• Audrey Lee and Ileana Streinu.
  Pebble Game Algorithms and Sparse Graphs.
  Discrete Mathematics, 308(8):1425-1437, 2008.
  Abstract presented at EuroComb ’05.
  [ DOI:10.1016/j.disc.2007.07.104 | arXiv:math.CO/0702129 | .bib ]
• Ileana Streinu and Louis Theran.
  Combinatorial Genericity and Minimal Rigidity.
  [ arXiv:0712.0031 | .bib ]
  
• Günter Rote, Francisco Santos and Ileana Streinu
  Pseudo-Triangulations - a Survey.
  in Proc. Joint Summer Research Conference on Discrete and Computational Geometry, 2007.
  [ arXiv:math/0612672 | .bib ]
  
• Audrey Lee, Ileana Streinu and Louis Theran
  Graded Sparse Graphs and Matroids.
  Journal of Universal Computer Science, 13(10), 2007.
  [ arXiv:0711.2838 | .bib ]
  
• Audrey Lee, Ileana Streinu and Louis Theran.
  The Slider-pinning Problem.
  in Proc. 19th Canadian Conference on Computational Geometry Carelton University, Ottawa, Ontario, Canada, Aug. 20-22, 2007.
  [ .pdf | .bib ]
  
• Ileana Streinu and Louis Theran.
  Sparsity-certifying graph decompositions.
  [ arXiv:0704.0002 | .bib ]
  
• Ileana Streinu and Louis Theran.
  Sparse Hypergraphs and Pebble Game Algorithms.
  To appear in European Journal of Combinatorics, special issue for the Proceedings of Oriented Matroids (OM'05) (2007).
  [ arXiv:math/0703921 | .bib ]
• Ruth Haas, Audrey Lee, Ileana Streinu and Louis Theran.
  Characterizing Sparse Graphs by Map Decompositions.
  Journal of Combinatorial Mathematics and Combinatorial Computing (JCMCC) , vol. 62, 2007, 3–11.
  [ arXiv:0704.3843 | .bib ]
  
• Audrey Lee, Ileana Streinu and Oliver Brock.
  A Methodology for Efficiently Sampling the Conformation Space of Molecular Structures.
  In Physical Biology 2, SPECIAL FOCUS: Flexibility in biomolecules, Nov. 2005, S108-S115.
  [ DOI:10.1088/1478-3975/2/4/S05 | .pdf | .bib ]
  
• Audrey Lee, Ileana Streinu and Louis Theran.
  Finding and Maintaining Rigid Components.
  in Proc. 17th Canadian Conference on Computational Geometry Univ. of Windsor, Ontario, Canada, Aug. 10-12, 2005.
  [ .pdf | .bib ]