default search action
Ileana Streinu
Person information
- affiliation: Smith College, Northampton, MA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j39]Goran Malic, Ileana Streinu:
Enumerating combinatorial resultant trees. Comput. Geom. 118: 102064 (2024) - 2023
- [j38]Goran Malic, Ileana Streinu:
Computing Circuit Polynomials in the Algebraic Rigidity Matroid. SIAM J. Appl. Algebra Geom. 7(2): 345-385 (2023) - [c63]Alexandra Camero, Ileana Streinu:
Interactive 2D Periodic Graphs (Media Exposition). SoCG 2023: 63:1-63:4 - [i17]Goran Malic, Ileana Streinu:
Computing Circuit Polynomials in the Algebraic Rigidity Matroid. CoRR abs/2304.12435 (2023) - [i16]Goran Malic, Ileana Streinu:
Enumerating combinatorial resultant decompositions of 2-connected rigidity circuits. CoRR abs/2309.12248 (2023) - 2021
- [j37]Ciprian S. Borcea, Ileana Streinu:
Infinitesimal Periodic Deformations and Quadrics. Symmetry 13(9): 1719 (2021) - [c62]Goran Malic, Ileana Streinu:
Combinatorial Resultants in the Algebraic Rigidity Matroid. SoCG 2021: 52:1-52:16 - [i15]Goran Malic, Ileana Streinu:
Combinatorial Resultants in the Algebraic Rigidity Matroid. CoRR abs/2103.08432 (2021)
2010 – 2019
- 2018
- [j36]Ciprian S. Borcea, Ileana Streinu:
Auxetic deformations and elliptic curves. Comput. Aided Geom. Des. 61: 9-19 (2018) - 2017
- [j35]Ciprian S. Borcea, Ileana Streinu:
New Principles for Auxetic Periodic Design. SIAM J. Appl. Algebra Geom. 1(1): 442-458 (2017) - [c61]Magdalena Metlicka, Mojtaba Nouri Bygi, Ileana Streinu:
Repairing gaps in Kinari-2 for large scale protein and flexibility analysis applications. BIBM 2017: 577-580 - [c60]Mojtaba Nouri Bygi, Ileana Streinu:
Efficient pebble game algorithms engineered for protein rigidity applications. ICCABS 2017: 1-6 - 2016
- [j34]John Christopher Bowers, Ileana Streinu:
Geodesic Universal Molecules. Math. Comput. Sci. 10(1): 115-141 (2016) - [c59]Emily Flynn, Ileana Streinu:
Consistent Visualization of Multiple Rigid Domain Decompositions of Proteins. ISBRA 2016: 151-162 - 2015
- [j33]John Christopher Bowers, Ileana Streinu:
Lang's Universal molecule algorithm. Ann. Math. Artif. Intell. 74(3-4): 371-400 (2015) - [j32]Ciprian Borcea, Ileana Streinu:
Liftings and Stresses for Planar Periodic Frameworks. Discret. Comput. Geom. 53(4): 747-782 (2015) - [j31]Ciprian Borcea, Ileana Streinu, Shin-ichi Tanigawa:
Periodic Body-and-Bar Frameworks. SIAM J. Discret. Math. 29(1): 93-112 (2015) - [c58]John Christopher Bowers, Rose Tharail John, Ileana Streinu:
Managing Reproducible Computational Experiments with Curated Proteins in KINARI-2. ISBRA 2015: 72-83 - [i14]Ciprian S. Borcea, Ileana Streinu:
Liftings and stresses for planar periodic frameworks. CoRR abs/1501.03549 (2015) - [i13]Ciprian S. Borcea, Ileana Streinu:
Geometric auxetics. CoRR abs/1501.03550 (2015) - [i12]Ciprian S. Borcea, Ileana Streinu:
Deforming Diamond. CoRR abs/1501.03551 (2015) - 2014
- [c57]Md. Ashraful Alam, Ileana Streinu:
Star-Unfolding Polygons. ADG 2014: 1-20 - [c56]Ciprian S. Borcea, Ileana Streinu:
Volume Frameworks and Deformation Varieties. ADG 2014: 21-36 - [c55]Ciprian Borcea, Ileana Streinu:
Liftings and stresses for planar periodic frameworks. SoCG 2014: 519 - [p1]Naomi Fox, Ileana Streinu:
Redundant and Critical Noncovalent Interactions in Protein Rigid Cluster Analysis. Discrete and Topological Models in Molecular Biology 2014: 167-196 - 2013
- [j30]Filip Jagodzinski, Pamela Clark, Jessica Grant, Tiffany Liu, Samantha Monastra, Ileana Streinu:
Rigidity analysis of protein biological assemblies and periodic crystal structures. BMC Bioinform. 14(S-18): S2 (2013) - [j29]Naomi Fox, Ileana Streinu:
Towards accurate modeling of noncovalent interactions for protein rigidity analysis. BMC Bioinform. 14(S-18): S3 (2013) - [c54]Emily Flynn, Filip Jagodzinski, Sharon Pamela Santana, Ileana Streinu:
Rigidity and flexibility of protein-nucleic acid complexes. ICCABS 2013: 1-6 - [c53]John Christopher Bowers, Ileana Streinu:
Computing Origami Universal Molecules with Cyclic Tournament Forests. SYNASC 2013: 42-49 - [i11]Jialong Cheng, Meera Sitharam, Ileana Streinu:
Nucleation-free $3D$ rigidity. CoRR abs/1311.4859 (2013) - 2012
- [j28]Kirk Haller, Audrey Lee-St. John, Meera Sitharam, Ileana Streinu, Neil White:
Body-and-cad geometric constraint systems. Comput. Geom. 45(8): 385-405 (2012) - [j27]Filip Jagodzinski, Jeanne Hardy, Ileana Streinu:
Using Rigidity Analysis to Probe Mutation-induced Structural Changes in proteins. J. Bioinform. Comput. Biol. 10(3) (2012) - [c52]Ciprian Borcea, Ileana Streinu:
Realizations of Volume Frameworks. Automated Deduction in Geometry 2012: 110-119 - [c51]John Christopher Bowers, Ileana Streinu:
Rigidity of Origami Universal Molecules. Automated Deduction in Geometry 2012: 120-142 - [c50]Ciprian S. Borcea, Ileana Streinu:
Positional Workspace Boundary for Serial Manipulators with Revolute Joints. ARK 2012: 325-332 - [c49]Filip Jagodzinski, Ileana Streinu:
Towards biophysical validation of constraint modeling for rigidity analysis of proteins. BCB 2012: 408-413 - [c48]Emily Flynn, Filip Jagodzinski, Ileana Streinu:
Towards sequence-based DNA flexibility analysis. BCB 2012: 607-609 - [c47]Md. Ashraful Alam, Igor Rivin, Ileana Streinu:
Outerplanar Graphs and Delaunay Triangulations. Computation, Physics and Beyond 2012: 320-329 - [c46]Ciprian Borcea, Ileana Streinu:
Flexible Crystal Frameworks. CCCG 2012: 235-240 - [c45]Ciprian Borcea, Ileana Streinu, Shin-ichi Tanigawa:
Periodic body-and-bar frameworks. SCG 2012: 347-356 - [c44]John Christopher Bowers, Ileana Streinu:
Lang's universal molecule algorithm. SCG 2012: 419-420 - [c43]Pamela Clark, Jessica Grant, Samantha Monastra, Filip Jagodzinski, Ileana Streinu:
Periodic rigidity of protein crystal structures. ICCABS 2012: 1-6 - [c42]Naomi Fox, Ileana Streinu:
Towards accurate modeling for protein rigidity analysis. ICCABS 2012: 1-6 - 2011
- [j26]Ileana Streinu, Louis Theran:
Natural realizations of sparsity matroids. Ars Math. Contemp. 4(1): 141-151 (2011) - [j25]Naomi Fox, Filip Jagodzinski, Yang Li, Ileana Streinu:
KINARI-Web: a server for protein rigidity analysis. Nucleic Acids Res. 39(Web-Server-Issue): 177-183 (2011) - [c41]Filip Jagodzinski, Jeanne Hardy, Ileana Streinu:
Using rigidity analysis to probe mutation-induced structural changes in proteins. BIBM Workshops 2011: 432-437 - [c40]Md. Ashraful Alam, Igor Rivin, Ileana Streinu:
Outerplanar graphs and Delaunay triangulations. CCCG 2011 - [c39]Ciprian Borcea, Ileana Streinu:
Extremal reaches in polynomial time. SCG 2011: 472-480 - [c38]Ciprian Borcea, Ileana Streinu:
Exact workspace boundary by extremal reaches. SCG 2011: 481-490 - [c37]Naomi Fox, Ileana Streinu:
Redundant interactions in protein rigid cluster analysis. ICCABS 2011: 99-104 - 2010
- [j24]Gaiane Panina, Ileana Streinu:
Flattening single-vertex origami: The non-expansive case. Comput. Geom. 43(8): 678-687 (2010) - [j23]Ileana Streinu, Louis Theran:
Slider-Pinning Rigidity: a Maxwell-Laman-Type Theorem. Discret. Comput. Geom. 44(4): 812-837 (2010) - [c36]Ciprian Borcea, Ileana Streinu:
How Far Can You Reach? SODA 2010: 928-937 - [i10]Gaiane Panina, Ileana Streinu:
Flattening single-vertex origami: the non-expansive case. CoRR abs/1003.3490 (2010) - [i9]Kirk Haller, Audrey Lee-St. John, Meera Sitharam, Ileana Streinu, Neil White:
Body-and-cad Geometric Constraint Systems. CoRR abs/1006.1126 (2010)
2000 – 2009
- 2009
- [j22]Ileana Streinu, Louis Theran:
Sparse hypergraphs and pebble game algorithms. Eur. J. Comb. 30(8): 1944-1964 (2009) - [j21]Ileana Streinu, Louis Theran:
Sparsity-certifying Graph Decompositions. Graphs Comb. 25(2): 219-238 (2009) - [c35]Audrey Lee-St. John, Ileana Streinu:
Angular rigidity in 3D: combinatorial characterizations and algorithms. CCCG 2009: 67-70 - [c34]Jialong Cheng, Meera Sitharam, Ileana Streinu:
Nucleation-free 3D rigidity. CCCG 2009: 71-74 - [c33]Gaiane Panina, Ileana Streinu:
Flattening single-vertex origami: the non-expansive case. SCG 2009: 306-313 - [c32]Kirk Haller, Audrey Lee-St. John, Meera Sitharam, Ileana Streinu, Neil White:
Body-and-cad geometric constraint systems. SAC 2009: 1127-1131 - 2008
- [j20]Greg Aloupis, Erik D. Demaine, Stefan Langerman, Pat Morin, Joseph O'Rourke, Ileana Streinu, Godfried T. Toussaint:
Edge-unfolding nested polyhedral bands. Comput. Geom. 39(1): 30-42 (2008) - [j19]David Avis, Naoki Katoh, Makoto Ohsaki, Ileana Streinu, Shin-ichi Tanigawa:
Enumerating Constrained Non-crossing Minimally Rigid Frameworks. Discret. Comput. Geom. 40(1): 31-46 (2008) - [j18]Audrey Lee, Ileana Streinu:
Pebble game algorithms and sparse graphs. Discret. Math. 308(8): 1425-1437 (2008) - [c31]Audrey Lee, Ileana Streinu, Louis Theran:
Analyzing rigidity with pebble games. SCG 2008: 226-227 - [c30]Ileana Streinu, Louis Theran:
Combinatorial genericity and minimal rigidity. SCG 2008: 365-374 - 2007
- [j17]David Avis, Naoki Katoh, Makoto Ohsaki, Ileana Streinu, Shin-ichi Tanigawa:
Enumerating Non-crossing Minimally Rigid Frameworks. Graphs Comb. 23(Supplement-1): 117-134 (2007) - [j16]Audrey Lee, Ileana Streinu, Louis Theran:
Graded Sparse Graphs and Matroids. J. Univers. Comput. Sci. 13(11): 1671-1679 (2007) - [c29]Audrey Lee, Ileana Streinu, Louis Theran:
The Slider-Pinning Problem. CCCG 2007: 113-116 - [i8]Ileana Streinu, Louis Theran:
Sparsity-certifying Graph Decompositions. CoRR abs/0704.0002 (2007) - [i7]Ileana Streinu, Louis Theran:
Natural realizations of sparsity matroids. CoRR abs/0711.3013 (2007) - [i6]Audrey Lee, Ileana Streinu:
Pebble Game Algorithms and Sparse Graphs. CoRR abs/math/0702129 (2007) - [i5]Ileana Streinu, Louis Theran:
Sparse Hypergraphs and Pebble Game Algorithms. CoRR abs/math/0703921 (2007) - 2006
- [j15]Stefan Felsner, Ferran Hurtado, Marc Noy, Ileana Streinu:
Hamiltonicity and colorings of arrangement graphs. Discret. Appl. Math. 154(17): 2470-2483 (2006) - [j14]Ileana Streinu:
Erratum to "Pseudo-Triangulations, Rigidity and Motion Planning". Discret. Comput. Geom. 35(2): 358-358 (2006) - [c28]David Avis, Naoki Katoh, Makoto Ohsaki, Ileana Streinu, Shin-ichi Tanigawa:
Enumerating Non-crossing Minimally Rigid Frameworks. COCOON 2006: 205-215 - 2005
- [j13]Ruth Haas, David Orden, Günter Rote, Francisco Santos, Brigitte Servatius, Herman Servatius, Diane L. Souvaine, Ileana Streinu, Walter Whiteley:
Planar minimally rigid graphs and pseudo-triangulations. Comput. Geom. 31(1-2): 31-61 (2005) - [j12]Ileana Streinu:
Non-stretchable pseudo-visibility graphs. Comput. Geom. 31(3): 195-206 (2005) - [j11]Jürgen Bokowski, Simon King, Susanne Mock, Ileana Streinu:
The Topological Representation of Oriented Matroids. Discret. Comput. Geom. 33(4): 645-668 (2005) - [j10]Ileana Streinu:
Acute Triangulations of Polygons. Discret. Comput. Geom. 34(4): 587-635 (2005) - [c27]Audrey Lee, Ileana Streinu, Louis Theran:
Finding and Maintaining Rigid Components. CCCG 2005: 219-222 - [c26]Jack Snoeyink, Ileana Streinu:
Computing Rigid Components of Pseudo-triangulation Mechanisms in Linear Time. CCCG 2005: 223-226 - [c25]Ileana Streinu:
Parallel-Redrawing Mechanisms, Pseudo-Triangulations and Kinetic Planar Graphs. GD 2005: 421-433 - 2004
- [j9]Ileana Streinu:
Editorial. Comput. Geom. 29(1): 1 (2004) - [j8]Ciprian Borcea, Ileana Streinu:
The Number of Embeddings of Minimally Rigid Graphs. Discret. Comput. Geom. 31(2): 287-303 (2004) - [c24]Greg Aloupis, Erik D. Demaine, Stefan Langerman, Pat Morin, Joseph O'Rourke, Ileana Streinu, Godfried T. Toussaint:
Unfolding polyhedral bands. CCCG 2004: 60-63 - [c23]Ileana Streinu, Walter Whiteley:
Single-Vertex Origami and Spherical Expansive Motions. JCDCG 2004: 161-173 - 2003
- [j7]Kim Miller, Suneeta Ramaswami, Peter J. Rousseeuw, Joan Antoni Sellarès, Diane L. Souvaine, Ileana Streinu, Anja Struyf:
Efficient computation of location depth contours by methods of computational geometry. Stat. Comput. 13(2): 153-162 (2003) - [c22]Ruth Haas, David Orden, Günter Rote, Francisco Santos, Brigitte Servatius, Herman Servatius, Diane L. Souvaine, Ileana Streinu, Walter Whiteley:
Planar minimally rigid graphs and pseudo-triangulations. SCG 2003: 154-163 - [c21]Ileana Streinu, Sue Whitesides:
Rectangle Visibility Graphs: Characterization, Construction, and Compaction. STACS 2003: 26-37 - [c20]Oswin Aichholzer, Günter Rote, Bettina Speckmann, Ileana Streinu:
The Zigzag Path of a Pseudo-Triangulation. WADS 2003: 377-388 - 2002
- [j6]Therese Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides:
A note on reconfiguring tree linkages: trees can lock. Discret. Appl. Math. 117(1-3): 293-297 (2002) - [c19]Eynat Rafalin, Diane L. Souvaine, Ileana Streinu:
Topological Sweep in Degenerate Cases. ALENEX 2002: 155-165 - [c18]Greg Aloupis, Erik D. Demaine, Henk Meijer, Joseph O'Rourke, Ileana Streinu, Godfried T. Toussaint:
On flat-state connectivity of chains with fixed acute angles. CCCG 2002: 27-30 - [c17]Ciprian Borcea, Ileana Streinu:
On the number of embeddings of minimally rigid graphs. SCG 2002: 25-32 - [c16]Ileana Streinu, Elif Tosun:
Camera Position Reconstruction and Tight Direction Networks. GD 2002: 372-373 - [c15]Greg Aloupis, Erik D. Demaine, Vida Dujmovic, Jeff Erickson, Stefan Langerman, Henk Meijer, Joseph O'Rourke, Mark H. Overmars, Michael A. Soss, Ileana Streinu, Godfried T. Toussaint:
Flat-State Connectivity of Linkages under Dihedral Motions. ISAAC 2002: 369-380 - 2001
- [j5]Therese Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Mark H. Overmars, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides:
Locked and Unlocked Polygonal Chains in Three Dimensions. Discret. Comput. Geom. 26(3): 269-281 (2001) - [j4]Jürgen Bokowski, Susanne Mock, Ileana Streinu:
On the Folkman-Lawrence Topological Representation Theorem for Oriented Matroids of Rank 3. Eur. J. Comb. 22(5): 601-615 (2001) - [c14]Ileana Streinu:
Combinatorial Roadmaps in Configuration Spaces of Simple Planar Polygons. Algorithmic and Quantitative Aspects of Real Algebraic Geometry in Mathematics and Computer Science 2001: 181-205 - [c13]Kim Miller, Suneeta Ramaswami, Peter J. Rousseeuw, Joan Antoni Sellarès, Diane L. Souvaine, Ileana Streinu, Anja Struyf:
Fast implementation of depth contours using topological sweep. SODA 2001: 690-699 - 2000
- [c12]Ileana Streinu:
A Combinatorial Approach to Planar Non-colliding Robot Arm Motion Planning. FOCS 2000: 443-453 - [c11]Stefan Felsner, Ferran Hurtado, Marc Noy, Ileana Streinu:
Hamiltonicity and colorings of arrangement graphs. SODA 2000: 155-164
1990 – 1999
- 1999
- [c10]Ileana Streinu:
Non-stretchable pseudo-visibility graphs. CCCG 1999 - [c9]Ileana Streinu:
Stretchability of Star-Like Pseudo-Visibility Graphs. SCG 1999: 274-280 - [c8]Therese Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Mark H. Overmars, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides:
Locked and Unlocked Polygonal Chains in 3D. SODA 1999: 866-867 - [r1]Ileana Streinu, Károly Bezdek, János Pach, Tamal K. Dey, Jianer Chen, Dina Kravets, Nancy M. Amato, W. Randolph Franklin:
Discrete And Computational Geometry. Handbook of Discrete and Combinatorial Mathematics 1999 - [i4]Therese Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Mark H. Overmars, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides:
Locked and Unlocked Polygonal Chains in 3D. CoRR cs.CG/9910009 (1999) - [i3]Therese Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides:
On Reconfiguring Tree Linkages: Trees can Lock. CoRR cs.CG/9910024 (1999) - [i2]Joseph O'Rourke, Beenish Chaudry, Sorina Chircu, Elizabeth F. Churchill, Sasha Fedorova, Judy A. Franklin, Biliana Kaneva, Halley Miller, Anton Okmianski, Irena Pashchenko, Ileana Streinu, Geetika Tewari, Dominique Thiébaut, Elif Tosun:
PushPush is NP-hard in 3D. CoRR cs.CG/9911013 (1999) - 1998
- [j3]William L. Steiger, Ileana Streinu:
Illumination by floodlights. Comput. Geom. 10(1): 57-70 (1998) - [j2]Joseph O'Rourke, Ileana Streinu:
The vertex-edge visibility graph of a polygon. Comput. Geom. 10(2): 105-120 (1998) - [c7]Therese Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides:
On reconfiguring tree linkages: Trees can lock. CCCG 1998 - [i1]Therese Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Mark H. Overmars, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides:
Locked and Unlocked Polygonal Chains in 3D. CoRR cs.CG/9811019 (1998) - 1997
- [c6]Joseph O'Rourke, Ileana Streinu:
Vertex-Edge Pseudo-Visibility Graphs: Characterization and Recognition. SCG 1997: 119-128 - [c5]Ileana Streinu:
Clusters of Stars. SCG 1997: 439-441 - 1995
- [j1]William L. Steiger, Ileana Streinu:
A Pseudo-Algorithmic Separation of Lines from Pseudo-Lines. Inf. Process. Lett. 53(5): 295-299 (1995) - [c4]Joseph O'Rourke, Thomas C. Shermer, Ileana Streinu:
Illuminating convex polygonswith vertex floodlight. CCCG 1995: 151-156 - 1994
- [c3]William L. Steiger, Ileana Streinu:
A Pseudo-Algorithmic Separation of Lines from Pseudo-Lines. CCCG 1994: 7-11 - [c2]William L. Steiger, Ileana Streinu:
Positive and Negative Results on the Floodlight Problem. CCCG 1994: 87-92
1970 – 1979
- 1977
- [c1]Ileana Streinu:
LL(k) Languages are Closed Under Union with Finite Languages. ICALP 1977: 504-508
Coauthor Index
aka: Ciprian S. Borcea
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-03 21:36 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint