Ileana Streinu

Comput. Geom., March, 2024

2023

Computing Circuit Polynomials in the Algebraic Rigidity Matroid.

[BibT_eX]

[DOI]

SIAM J. Appl. Algebra Geom., June, 2023

Enumerating combinatorial resultant decompositions of 2-connected rigidity circuits.

[BibT_eX]

[DOI]

CoRR, 2023

Interactive 2D Periodic Graphs (Media Exposition).

[BibT_eX]

[DOI]

Alexandra Camero

Proceedings of the 39th International Symposium on Computational Geometry, 2023

2021

Infinitesimal Periodic Deformations and Quadrics.

[BibT_eX]

[DOI]

Symmetry, 2021

Combinatorial Resultants in the Algebraic Rigidity Matroid.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Computational Geometry, 2021

2018

Auxetic deformations and elliptic curves.

[BibT_eX]

[DOI]

Comput. Aided Geom. Des., 2018

2017

New Principles for Auxetic Periodic Design.

[BibT_eX]

[DOI]

SIAM J. Appl. Algebra Geom., 2017

Efficient pebble game algorithms engineered for protein rigidity applications.

[BibT_eX]

[DOI]

Mojtaba Nouri Bygi

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.

[BibT_eX]

[DOI]

Magdalena Metlicka

Mojtaba Nouri Bygi

Proceedings of the 2017 IEEE International Conference on Bioinformatics and Biomedicine, 2017

2016

Geodesic Universal Molecules.

[BibT_eX]

[DOI]

Math. Comput. Sci., 2016

Consistent Visualization of Multiple Rigid Domain Decompositions of Proteins.

[BibT_eX]

[DOI]

Emily Flynn

Proceedings of the Bioinformatics Research and Applications - 12th International Symposium, 2016

2015

Periodic Body-and-Bar Frameworks.

[BibT_eX]

[DOI]

Shin-ichi Tanigawa

SIAM J. Discret. Math., 2015

Liftings and Stresses for Planar Periodic Frameworks.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2015

Deforming Diamond.

[BibT_eX]

[DOI]

CoRR, 2015

Geometric auxetics.

[BibT_eX]

[DOI]

CoRR, 2015

Lang's Universal molecule algorithm.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2015

Managing Reproducible Computational Experiments with Curated Proteins in KINARI-2.

[BibT_eX]

[DOI]

Rose Tharail John

Proceedings of the Bioinformatics Research and Applications - 11th International Symposium, 2015

2014

Redundant and Critical Noncovalent Interactions in Protein Rigid Cluster Analysis.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Topological Models in Molecular Biology, 2014

Volume Frameworks and Deformation Varieties.

[BibT_eX]

[DOI]

Proceedings of the Automated Deduction in Geometry - 10th International Workshop, 2014

Star-Unfolding Polygons.

[BibT_eX]

[DOI]

Md. Ashraful Alam

Proceedings of the Automated Deduction in Geometry - 10th International Workshop, 2014

2013

Rigidity analysis of protein biological assemblies and periodic crystal structures.

[BibT_eX]

[DOI]

BMC Bioinform., 2013

Towards accurate modeling of noncovalent interactions for protein rigidity analysis.

[BibT_eX]

[DOI]

BMC Bioinform., 2013

Computing Origami Universal Molecules with Cyclic Tournament Forests.

[BibT_eX]

[DOI]

Proceedings of the 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2013

Rigidity and flexibility of protein-nucleic acid complexes.

[BibT_eX]

[DOI]

Emily Flynn

Sharon Pamela Santana

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.

[BibT_eX]

[DOI]

Jeanne Hardy

J. Bioinform. Comput. Biol., 2012

Body-and-cad geometric constraint systems.

[BibT_eX]

[DOI]

Comput. Geom., 2012

Towards accurate modeling for protein rigidity analysis.

[BibT_eX]

[DOI]

Proceedings of the IEEE 2nd International Conference on Computational Advances in Bio and Medical Sciences, 2012

Periodic rigidity of protein crystal structures.

[BibT_eX]

[DOI]

Proceedings of the IEEE 2nd International Conference on Computational Advances in Bio and Medical Sciences, 2012

Flexible Crystal Frameworks.

[BibT_eX]

[DOI]

Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

Outerplanar Graphs and Delaunay Triangulations.

[BibT_eX]

[DOI]

Md. Ashraful Alam

Igor Rivin

Proceedings of the Computation, Physics and Beyond, 2012

Towards biophysical validation of constraint modeling for rigidity analysis of proteins.

[BibT_eX]

[DOI]

Proceedings of the ACM International Conference on Bioinformatics, 2012

Towards sequence-based DNA flexibility analysis.

[BibT_eX]

[DOI]

Emily Flynn

Proceedings of the ACM International Conference on Bioinformatics, 2012

Positional Workspace Boundary for Serial Manipulators with Revolute Joints.

[BibT_eX]

[DOI]

Proceedings of the Latest Advances in Robot Kinematics, 2012

Rigidity of Origami Universal Molecules.

[BibT_eX]

[DOI]

Proceedings of the Automated Deduction in Geometry - 9th International Workshop, 2012

Realizations of Volume Frameworks.

[BibT_eX]

[DOI]

Proceedings of the Automated Deduction in Geometry - 9th International Workshop, 2012

2011

KINARI-Web: a server for protein rigidity analysis.

[BibT_eX]

[DOI]

Nucleic Acids Res., 2011

Natural realizations of sparsity matroids.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2011

Redundant interactions in protein rigid cluster analysis.

[BibT_eX]

[DOI]

Proceedings of the IEEE 1st International Conference on Computational Advances in Bio and Medical Sciences, 2011

Exact workspace boundary by extremal reaches.

[BibT_eX]

[DOI]

Proceedings of the 27th ACM Symposium on Computational Geometry, 2011

Extremal reaches in polynomial time.

[BibT_eX]

[DOI]

Proceedings of the 27th ACM Symposium on Computational Geometry, 2011

2010

Slider-Pinning Rigidity: a Maxwell-Laman-Type Theorem.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2010

Flattening single-vertex origami: The non-expansive case.

[BibT_eX]

[DOI]

Gaiane Panina

Comput. Geom., 2010

How Far Can You Reach?

[BibT_eX]

[DOI]

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

2009

Sparsity-certifying Graph Decompositions.

[BibT_eX]

[DOI]

Graphs Comb., 2009

Sparse hypergraphs and pebble game algorithms.

[BibT_eX]

[DOI]

Eur. J. Comb., 2009

Angular rigidity in 3D: combinatorial characterizations and algorithms.

[BibT_eX]

[DOI]

Audrey Lee-St. John

Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

Nucleation-free 3D rigidity.

[BibT_eX]

[DOI]

Jialong Cheng

Meera Sitharam

Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

2008

Pebble game algorithms and sparse graphs.

[BibT_eX]

[DOI]

Discret. Math., 2008

Enumerating Constrained Non-crossing Minimally Rigid Frameworks.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2008

Edge-unfolding nested polyhedral bands.

[BibT_eX]

[DOI]

Comput. Geom., 2008

Combinatorial genericity and minimal rigidity.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

Analyzing rigidity with pebble games.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

2007

Graded Sparse Graphs and Matroids.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 2007

Enumerating Non-crossing Minimally Rigid Frameworks.

[BibT_eX]

[DOI]

Graphs Comb., 2007

The Slider-Pinning Problem.

[BibT_eX]

[DOI]

Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006

Erratum to "Pseudo-Triangulations, Rigidity and Motion Planning".

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2006

Hamiltonicity and colorings of arrangement graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

2005

Acute Triangulations of Polygons.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2005

The Topological Representation of Oriented Matroids.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2005

Non-stretchable pseudo-visibility graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2005

Planar minimally rigid graphs and pseudo-triangulations.

[BibT_eX]

[DOI]

Comput. Geom., 2005

Parallel-Redrawing Mechanisms, Pseudo-Triangulations and Kinetic Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 13th International Symposium, 2005

Computing Rigid Components of Pseudo-triangulation Mechanisms in Linear Time.

[BibT_eX]

[DOI]

Jack Snoeyink

Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

Finding and Maintaining Rigid Components.

[BibT_eX]

[DOI]

Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2004

The Number of Embeddings of Minimally Rigid Graphs.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2004

Editorial.

[BibT_eX]

[DOI]

Comput. Geom., 2004

Single-Vertex Origami and Spherical Expansive Motions.

[BibT_eX]

[DOI]

Walter Whiteley

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2004

Unfolding polyhedral bands.

[BibT_eX]

[DOI]

Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

2003

Efficient computation of location depth contours by methods of computational geometry.

[BibT_eX]

[DOI]

Stat. Comput., 2003

The Zigzag Path of a Pseudo-Triangulation.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

Rectangle Visibility Graphs: Characterization, Construction, and Compaction.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2002

Flat-State Connectivity of Linkages under Dihedral Motions.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

Camera Position Reconstruction and Tight Direction Networks.

[BibT_eX]

[DOI]

Elif Tosun

Proceedings of the Graph Drawing, 10th International Symposium, 2002

On flat-state connectivity of chains with fixed acute angles.

[BibT_eX]

[DOI]

Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

Topological Sweep in Degenerate Cases.

[BibT_eX]

[DOI]

Eynat Rafalin

Diane L. Souvaine

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.

[BibT_eX]

[DOI]

Jürgen Bokowski

Susanne Mock

Eur. J. Comb., 2001

Locked and Unlocked Polygonal Chains in Three Dimensions.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2001

Fast implementation of depth contours using topological sweep.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Combinatorial Roadmaps in Configuration Spaces of Simple Planar Polygons.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

1999

Discrete And Computational Geometry.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999

PushPush is NP-hard in 3D

[BibT_eX]

[DOI]

Beenish Chaudry

Sorina Chircu

Elizabeth F. Churchill

CoRR, 1999

Locked and Unlocked Polygonal Chains in 3D.

[BibT_eX]

[DOI]

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Stretchability of Star-Like Pseudo-Visibility Graphs.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

1998

Illumination by floodlights.

[BibT_eX]

[DOI]

William L. Steiger

Comput. Geom., 1998

The vertex-edge visibility graph of a polygon.

[BibT_eX]

[DOI]

Comput. Geom., 1998

On reconfiguring tree linkages: Trees can lock.

[BibT_eX]

[DOI]

Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

1997

Clusters of Stars.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

Vertex-Edge Pseudo-Visibility Graphs: Characterization and Recognition.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1995

A Pseudo-Algorithmic Separation of Lines from Pseudo-Lines.

[BibT_eX]

[DOI]

William L. Steiger

Inf. Process. Lett., 1995

Illuminating convex polygonswith vertex floodlight.

[BibT_eX]

[DOI]

Thomas C. Shermer

Proceedings of the 7th Canadian Conference on Computational Geometry, 1995

1994

Positive and Negative Results on the Floodlight Problem.

[BibT_eX]

William L. Steiger

Proceedings of the 6th Canadian Conference on Computational Geometry, 1994

1977

LL(k) Languages are Closed Under Union with Finite Languages.

[BibT_eX]

[DOI]