The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ileana Streinu: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Eynat Rafalin, Diane L. Souvaine, Ileana Streinu
    Topological Sweep in Degenerate Cases. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2002, pp:155-165 [Conf]
  2. Greg Aloupis, Erik D. Demaine, Stefan Langerman, Pat Morin, Joseph O'Rourke, Ileana Streinu, Godfried T. Toussaint
    Unfolding polyhedral bands. [Citation Graph (0, 0)][DBLP]
    CCCG, 2004, pp:60-63 [Conf]
  3. 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. [Citation Graph (0, 0)][DBLP]
    CCCG, 2002, pp:27-30 [Conf]
  4. Therese C. 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. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  5. Audrey Lee, Ileana Streinu, Louis Theran
    Finding and Maintaining Rigid Components. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:219-222 [Conf]
  6. Jack Snoeyink, Ileana Streinu
    Computing Rigid Components of Pseudo-triangulation Mechanisms in Linear Time. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:223-226 [Conf]
  7. William L. Steiger, Ileana Streinu
    A Pseudo-Algorithmic Separation of Lines from Pseudo-Lines. [Citation Graph (0, 0)][DBLP]
    CCCG, 1994, pp:7-11 [Conf]
  8. William L. Steiger, Ileana Streinu
    Positive and Negative Results on the Floodlight Problem. [Citation Graph (0, 0)][DBLP]
    CCCG, 1994, pp:87-92 [Conf]
  9. Ileana Streinu
    Non-stretchable pseudo-visibility graphs. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  10. David Avis, Naoki Katoh, Makoto Ohsaki, Ileana Streinu, Shin-ichi Tanigawa
    Enumerating Non-crossing Minimally Rigid Frameworks. [Citation Graph (0, 0)][DBLP]
    COCOON, 2006, pp:205-215 [Conf]
  11. Ciprian Borcea, Ileana Streinu
    On the number of embeddings of minimally rigid graphs. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2002, pp:25-32 [Conf]
  12. 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. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:154-163 [Conf]
  13. Joseph O'Rourke, Ileana Streinu
    Vertex-Edge Pseudo-Visibility Graphs: Characterization and Recognition. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:119-128 [Conf]
  14. Ileana Streinu
    Clusters of Stars. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:439-441 [Conf]
  15. Ileana Streinu
    Stretchability of Star-Like Pseudo-Visibility Graphs. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:274-280 [Conf]
  16. Ileana Streinu
    Combinatorial Roadmaps in Configuration Spaces of Simple Planar Polygons. [Citation Graph (0, 0)][DBLP]
    Algorithmic and Quantitative Aspects of Real Algebraic Geometry in Mathematics and Computer Science, 2001, pp:181-206 [Conf]
  17. Ileana Streinu
    A Combinatorial Approach to Planar Non-colliding Robot Arm Motion Planning. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:443-453 [Conf]
  18. Ileana Streinu
    Parallel-Redrawing Mechanisms, Pseudo-Triangulations and Kinetic Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2005, pp:421-433 [Conf]
  19. Ileana Streinu, Elif Tosun
    Camera Position Reconstruction and Tight Direction Networks. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2002, pp:372-373 [Conf]
  20. Ileana Streinu
    LL(k) Languages are Closed Under Union with Finite Languages. [Citation Graph (0, 0)][DBLP]
    ICALP, 1977, pp:504-508 [Conf]
  21. 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. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:369-380 [Conf]
  22. Ileana Streinu, Walter Whiteley
    Single-Vertex Origami and Spherical Expansive Motions. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2004, pp:161-173 [Conf]
  23. Therese C. 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. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:866-867 [Conf]
  24. Stefan Felsner, Ferran Hurtado, Marc Noy, Ileana Streinu
    Hamiltonicity and colorings of arrangement graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:155-164 [Conf]
  25. Kim Miller, Suneeta Ramaswami, Peter Rousseeuw, Joan Antoni Sellarès, Diane L. Souvaine, Ileana Streinu, Anja Struyf
    Fast implementation of depth contours using topological sweep. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:690-699 [Conf]
  26. Ileana Streinu, Sue Whitesides
    Rectangle Visibility Graphs: Characterization, Construction, and Compaction. [Citation Graph (0, 0)][DBLP]
    STACS, 2003, pp:26-37 [Conf]
  27. Oswin Aichholzer, Günter Rote, Bettina Speckmann, Ileana Streinu
    The Zigzag Path of a Pseudo-Triangulation. [Citation Graph (0, 0)][DBLP]
    WADS, 2003, pp:377-388 [Conf]
  28. 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. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2005, v:31, n:1-2, pp:31-61 [Journal]
  29. William L. Steiger, Ileana Streinu
    Illumination by floodlights. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:10, n:1, pp:57-70 [Journal]
  30. Ileana Streinu
    Editorial. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:29, n:1, pp:1-0 [Journal]
  31. Ileana Streinu
    Non-stretchable pseudo-visibility graphs. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2005, v:31, n:3, pp:195-206 [Journal]
  32. Joseph O'Rourke, Ileana Streinu
    The vertex-edge visibility graph of a polygon. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:10, n:2, pp:105-120 [Journal]
  33. Therese C. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  34. Therese C. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  35. Therese C. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  36. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  37. Therese C. 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. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:117, n:1-3, pp:293-297 [Journal]
  38. Stefan Felsner, Ferran Hurtado, Marc Noy, Ileana Streinu
    Hamiltonicity and colorings of arrangement graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:17, pp:2470-2483 [Journal]
  39. Jürgen Bokowski, Simon King, Susanne Mock, Ileana Streinu
    The Topological Representation of Oriented Matroids. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2005, v:33, n:4, pp:645-668 [Journal]
  40. Ciprian Borcea, Ileana Streinu
    The Number of Embeddings of Minimally Rigid Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2004, v:31, n:2, pp:287-303 [Journal]
  41. Therese C. 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. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:26, n:3, pp:269-281 [Journal]
  42. Ileana Streinu
    Acute Triangulations of Polygons. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2005, v:34, n:4, pp:587-635 [Journal]
  43. Ileana Streinu
    Erratum to "Pseudo-Triangulations, Rigidity and Motion Planning". [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2006, v:35, n:2, pp:358-358 [Journal]
  44. Jürgen Bokowski, Susanne Mock, Ileana Streinu
    On the Folkman-Lawrence Topological Representation Theorem for Oriented Matroids of Rank 3. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2001, v:22, n:5, pp:601-615 [Journal]
  45. William L. Steiger, Ileana Streinu
    A Pseudo-Algorithmic Separation of Lines from Pseudo-Lines. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:53, n:5, pp:295-299 [Journal]
  46. Audrey Lee, Ileana Streinu, Louis Theran
    The Slider-Pinning Problem. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:113-116 [Conf]
  47. Greg Aloupis, Erik D. Demaine, Stefan Langerman, Pat Morin, Joseph O'Rourke, Ileana Streinu, Godfried T. Toussaint
    Edge-unfolding nested polyhedral bands. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2008, v:39, n:1, pp:30-42 [Journal]
  48. Audrey Lee, Ileana Streinu
    Pebble Game Algorithms and Sparse Graphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  49. Ileana Streinu, Louis Theran
    Sparse Hypergraphs and Pebble Game Algorithms [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  50. Ileana Streinu, Louis Theran
    Sparsity-certifying Graph Decompositions [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  51. Angular rigidity in 3D: combinatorial characterizations and algorithms. [Citation Graph (, )][DBLP]


  52. Nucleation-free 3D rigidity. [Citation Graph (, )][DBLP]


  53. Combinatorial genericity and minimal rigidity. [Citation Graph (, )][DBLP]


  54. Analyzing rigidity with pebble games. [Citation Graph (, )][DBLP]


  55. Flattening single-vertex origami: the non-expansive case. [Citation Graph (, )][DBLP]


  56. Body-and-cad geometric constraint systems. [Citation Graph (, )][DBLP]


  57. How Far Can You Reach? [Citation Graph (, )][DBLP]


  58. Flattening single-vertex origami: The non-expansive case. [Citation Graph (, )][DBLP]


  59. Flattening single-vertex origami: the non-expansive case [Citation Graph (, )][DBLP]


  60. Body-and-cad Geometric Constraint Systems [Citation Graph (, )][DBLP]


  61. Enumerating Constrained Non-crossing Minimally Rigid Frameworks. [Citation Graph (, )][DBLP]


  62. Pebble game algorithms and sparse graphs. [Citation Graph (, )][DBLP]


  63. Sparse hypergraphs and pebble game algorithms. [Citation Graph (, )][DBLP]


Search in 0.008secs, Finished in 0.010secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002