Ileana Streinu

According to our database1, Ileana Streinu authored at least 87 papers between 1977 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
Auxetic deformations and elliptic curves.
Computer Aided Geometric Design, 2018

2017
New Principles for Auxetic Periodic Design.
SIAM J. Appl. Algebra Geom., 2017

Efficient pebble game algorithms engineered for protein rigidity applications.
Proceedings of the 7th IEEE International Conference on Computational Advances in Bio and Medical Sciences, 2017

Repairing gaps in Kinari-2 for large scale protein and flexibility analysis applications.
Proceedings of the 2017 IEEE International Conference on Bioinformatics and Biomedicine, 2017

2016
Geodesic Universal Molecules.
Mathematics in Computer Science, 2016

Consistent Visualization of Multiple Rigid Domain Decompositions of Proteins.
Proceedings of the Bioinformatics Research and Applications - 12th International Symposium, 2016

2015
Periodic Body-and-Bar Frameworks.
SIAM J. Discrete Math., 2015

Liftings and Stresses for Planar Periodic Frameworks.
Discrete & Computational Geometry, 2015

Deforming Diamond.
CoRR, 2015

Geometric auxetics.
CoRR, 2015

Lang's Universal molecule algorithm.
Ann. Math. Artif. Intell., 2015

Managing Reproducible Computational Experiments with Curated Proteins in KINARI-2.
Proceedings of the Bioinformatics Research and Applications - 11th International Symposium, 2015

2014
Volume Frameworks and Deformation Varieties.
Proceedings of the Automated Deduction in Geometry - 10th International Workshop, 2014

Star-Unfolding Polygons.
Proceedings of the Automated Deduction in Geometry - 10th International Workshop, 2014

2013
Rigidity analysis of protein biological assemblies and periodic crystal structures.
BMC Bioinformatics, 2013

Towards accurate modeling of noncovalent interactions for protein rigidity analysis.
BMC Bioinformatics, 2013

Computing Origami Universal Molecules with Cyclic Tournament Forests.
Proceedings of the 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2013

Rigidity and flexibility of protein-nucleic acid complexes.
Proceedings of the IEEE 3rd International Conference on Computational Advances in Bio and Medical Sciences, 2013

2012
Using Rigidity Analysis to Probe Mutation-induced Structural Changes in proteins.
J. Bioinformatics and Computational Biology, 2012

Body-and-cad geometric constraint systems.
Comput. Geom., 2012

Towards accurate modeling for protein rigidity analysis.
Proceedings of the IEEE 2nd International Conference on Computational Advances in Bio and Medical Sciences, 2012

Periodic rigidity of protein crystal structures.
Proceedings of the IEEE 2nd International Conference on Computational Advances in Bio and Medical Sciences, 2012

Flexible Crystal Frameworks.
Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

Outerplanar Graphs and Delaunay Triangulations.
Proceedings of the Computation, Physics and Beyond, 2012

Towards biophysical validation of constraint modeling for rigidity analysis of proteins.
Proceedings of the ACM International Conference on Bioinformatics, 2012

Towards sequence-based DNA flexibility analysis.
Proceedings of the ACM International Conference on Bioinformatics, 2012

Rigidity of Origami Universal Molecules.
Proceedings of the Automated Deduction in Geometry - 9th International Workshop, 2012

Realizations of Volume Frameworks.
Proceedings of the Automated Deduction in Geometry - 9th International Workshop, 2012

2011
KINARI-Web: a server for protein rigidity analysis.
Nucleic Acids Research, 2011

Natural realizations of sparsity matroids.
Ars Math. Contemp., 2011

Redundant interactions in protein rigid cluster analysis.
Proceedings of the IEEE 1st International Conference on Computational Advances in Bio and Medical Sciences, 2011

Exact workspace boundary by extremal reaches.
Proceedings of the 27th ACM Symposium on Computational Geometry, 2011

Extremal reaches in polynomial time.
Proceedings of the 27th ACM Symposium on Computational Geometry, 2011

2010
Slider-Pinning Rigidity: a Maxwell-Laman-Type Theorem.
Discrete & Computational Geometry, 2010

Flattening single-vertex origami: The non-expansive case.
Comput. Geom., 2010

How Far Can You Reach?
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

2009
Sparsity-certifying Graph Decompositions.
Graphs and Combinatorics, 2009

Sparse hypergraphs and pebble game algorithms.
Eur. J. Comb., 2009

Angular rigidity in 3D: combinatorial characterizations and algorithms.
Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

Nucleation-free 3D rigidity.
Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

2008
Pebble game algorithms and sparse graphs.
Discrete Mathematics, 2008

Enumerating Constrained Non-crossing Minimally Rigid Frameworks.
Discrete & Computational Geometry, 2008

Edge-unfolding nested polyhedral bands.
Comput. Geom., 2008

Combinatorial genericity and minimal rigidity.
Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

Analyzing rigidity with pebble games.
Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

2007
Graded Sparse Graphs and Matroids.
J. UCS, 2007

Enumerating Non-crossing Minimally Rigid Frameworks.
Graphs and Combinatorics, 2007

The Slider-Pinning Problem.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006
Erratum to "Pseudo-Triangulations, Rigidity and Motion Planning".
Discrete & Computational Geometry, 2006

Hamiltonicity and colorings of arrangement graphs.
Discret. Appl. Math., 2006

2005
Acute Triangulations of Polygons.
Discrete & Computational Geometry, 2005

The Topological Representation of Oriented Matroids.
Discrete & Computational Geometry, 2005

Non-stretchable pseudo-visibility graphs.
Comput. Geom., 2005

Planar minimally rigid graphs and pseudo-triangulations.
Comput. Geom., 2005

Parallel-Redrawing Mechanisms, Pseudo-Triangulations and Kinetic Planar Graphs.
Proceedings of the Graph Drawing, 13th International Symposium, 2005

Computing Rigid Components of Pseudo-triangulation Mechanisms in Linear Time.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

Finding and Maintaining Rigid Components.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2004
The Number of Embeddings of Minimally Rigid Graphs.
Discrete & Computational Geometry, 2004

Editorial.
Comput. Geom., 2004

Single-Vertex Origami and Spherical Expansive Motions.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2004

Unfolding polyhedral bands.
Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

2003
Efficient computation of location depth contours by methods of computational geometry.
Statistics and Computing, 2003

The Zigzag Path of a Pseudo-Triangulation.
Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

Rectangle Visibility Graphs: Characterization, Construction, and Compaction.
Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

2002
A note on reconfiguring tree linkages: trees can lock.
Discret. Appl. Math., 2002

Flat-State Connectivity of Linkages under Dihedral Motions.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

Camera Position Reconstruction and Tight Direction Networks.
Proceedings of the Graph Drawing, 10th International Symposium, 2002

On flat-state connectivity of chains with fixed acute angles.
Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

Topological Sweep in Degenerate Cases.
Proceedings of the Algorithm Engineering and Experiments, 4th International Workshop, 2002

2001
On the Folkman-Lawrence Topological Representation Theorem for Oriented Matroids of Rank 3.
Eur. J. Comb., 2001

Locked and Unlocked Polygonal Chains in Three Dimensions.
Discrete & Computational Geometry, 2001

Fast implementation of depth contours using topological sweep.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Combinatorial Roadmaps in Configuration Spaces of Simple Planar Polygons.
Proceedings of the Algorithmic and Quantitative Aspects of Real Algebraic Geometry in Mathematics and Computer Science, 2001

2000
A Combinatorial Approach to Planar Non-colliding Robot Arm Motion Planning.
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

1999
Discrete And Computational Geometry.
Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999

PushPush is NP-hard in 3D
CoRR, 1999

Locked and Unlocked Polygonal Chains in 3D.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Stretchability of Star-Like Pseudo-Visibility Graphs.
Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

1998
Illumination by floodlights.
Comput. Geom., 1998

The vertex-edge visibility graph of a polygon.
Comput. Geom., 1998

On reconfiguring tree linkages: Trees can lock.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

1997
Clusters of Stars.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

Vertex-Edge Pseudo-Visibility Graphs: Characterization and Recognition.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1995
A Pseudo-Algorithmic Separation of Lines from Pseudo-Lines.
Inf. Process. Lett., 1995

Illuminating convex polygonswith vertex floodlight.
Proceedings of the 7th Canadian Conference on Computational Geometry, 1995

1994
Positive and Negative Results on the Floodlight Problem.
Proceedings of the 6th Canadian Conference on Computational Geometry, 1994

1977
LL(k) Languages are Closed Under Union with Finite Languages.
Proceedings of the Automata, 1977


  Loading...