The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Anna Lubiw: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Mark H. Overmars, Joseph O'Rourke, Steve Robbins, Sue Whitesides
    Unfolding some classes of orthogonal polyhedra. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  3. Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Godfried T. Toussaint
    Hiding disks in folded polygons. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  4. Therese C. Biedl, Anna Lubiw, Michael J. Spriggs
    Parallel morphing of trees and cycles. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:29-34 [Conf]
  5. Therese C. Biedl, Anna Lubiw, Michael J. Spriggs
    Morphing Polyhedra Preserving Face Normals: A Counterexample. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:109-112 [Conf]
  6. Therese C. Biedl, Anna Lubiw, Julie Sun
    When can a net fold to a polyhedron. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  7. Prosenjit Bose, Leonidas J. Guibas, Anna Lubiw, Mark H. Overmars, Diane L. Souvaine, Jorge Urrutia
    The Floodlight Problem. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:399-404 [Conf]
  8. Erik D. Demaine, Martin L. Demaine, Anna Lubiw
    The cccg 2001 logo. [Citation Graph (0, 0)][DBLP]
    CCCG, 2001, pp:- [Conf]
  9. Hazel Everett, Anna Lubiw, Joseph O'Rourke
    Recovery of Convex Hulls From External Visibility Graphs. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:309-314 [Conf]
  10. Masud Hasan, Anna Lubiw
    Equiprojective Polyhedra. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:47-50 [Conf]
  11. Anna Lubiw, Naji Mouawad
    Interval Graphs as Visibility Graphs of Simple Polygons Part 1: Parachutes. [Citation Graph (0, 0)][DBLP]
    CCCG, 1994, pp:18-23 [Conf]
  12. Anna Lubiw, Nora Sleumer
    Maximal Outerplanar Graphs Are Relative Neighbourhood Graphs. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:198-203 [Conf]
  13. Giuseppe Di Battista, Giuseppe Liotta, Anna Lubiw, Sue Whitesides
    Embedding Problems for Paths with Direction Constrained Edges. [Citation Graph (0, 0)][DBLP]
    COCOON, 2000, pp:64-73 [Conf]
  14. Collette R. Coullard, Anna Lubiw
    Distance Visibility Graphs. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1991, pp:289-296 [Conf]
  15. Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Joseph O'Rourke, Irena Pashchenko
    Metamorphosis of the Cube. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:409-410 [Conf]
  16. Alon Efrat, Stephen G. Kobourov, Anna Lubiw
    Computing Homotopic Shortest Paths Efficiently. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:411-423 [Conf]
  17. Therese C. Biedl, Anna Lubiw, Michael J. Spriggs
    Morphing Planar Graphs While Preserving Edge Directions. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2005, pp:13-24 [Conf]
  18. Giuseppe Di Battista, Giuseppe Liotta, Anna Lubiw, Sue Whitesides
    Orthogonal Drawings of Cycles in 3D Space (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2000, pp:272-283 [Conf]
  19. Hossam A. ElGindy, Giuseppe Liotta, Anna Lubiw, Henk Meijer, Sue Whitesides
    Recognizing Rectangle of Influence Drawable Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1994, pp:352-363 [Conf]
  20. Claudia Iturriaga, Anna Lubiw
    Elastic Labels: the Two-Axis Case. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1997, pp:181-192 [Conf]
  21. Claudia Iturriaga, Anna Lubiw
    Elastic Labels on the Perimeter of a Rectangle. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1998, pp:451-453 [Conf]
  22. Anna Lubiw, Luke Tanur
    Pattern Matching in Polyphonic Music as a Weighted Geometric Translation Problem. [Citation Graph (0, 0)][DBLP]
    ISMIR, 2004, pp:- [Conf]
  23. Erik D. Demaine, Martin L. Demaine, Anna Lubiw
    Folding and Cutting Paper. [Citation Graph (0, 0)][DBLP]
    JCDCG, 1998, pp:104-118 [Conf]
  24. Therese C. Biedl, Anna Lubiw, Michael J. Spriggs
    Angles and Lengths in Reconfigurations of Polygons and Polyhedra. [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:748-759 [Conf]
  25. Therese C. Biedl, Prosenjit Bose, Erik D. Demaine, Anna Lubiw
    Efficient Algorithms for Petersen's Matching Theorem. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:130-139 [Conf]
  26. 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]
  27. Erik D. Demaine, Martin L. Demaine, Anna Lubiw
    Folding and One Straight Cut Suffice. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:891-892 [Conf]
  28. Michael D. Hutton, Anna Lubiw
    Upward Planar Drawing of Single Source Acyclic Digraphs. [Citation Graph (0, 0)][DBLP]
    SODA, 1991, pp:203-211 [Conf]
  29. Anna Lubiw, Mark Petrick, Michael J. Spriggs
    Morphing orthogonal planar graph drawings. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:222-230 [Conf]
  30. Moshe Dror, Alon Efrat, Anna Lubiw, Joseph S. B. Mitchell
    Touring a sequence of polygons. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:473-482 [Conf]
  31. Anna Lubiw
    Doubly Lexical Orderings of Matrices [Citation Graph (0, 0)][DBLP]
    STOC, 1985, pp:396-404 [Conf]
  32. Prosenjit Bose, Jonathan F. Buss, Anna Lubiw
    Pattern Matching for Permutations. [Citation Graph (0, 0)][DBLP]
    WADS, 1993, pp:200-209 [Conf]
  33. Peter Braß, Eowyn Cenek, Christian A. Duncan, Alon Efrat, Cesim Erten, Dan Ismailescu, Stephen G. Kobourov, Anna Lubiw, Joseph S. B. Mitchell
    On Simultaneous Planar Graph Embeddings. [Citation Graph (0, 0)][DBLP]
    WADS, 2003, pp:243-255 [Conf]
  34. Claudia Iturriaga, Anna Lubiw
    Elastic Labels Around the Perimeter of a Map. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:306-317 [Conf]
  35. Therese C. Biedl, Anna Lubiw, Julie Sun
    When can a net fold to a polyhedron? [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2005, v:31, n:3, pp:207-218 [Journal]
  36. Prosenjit Bose, Anna Lubiw, J. Ian Munro
    Efficient visibility queries in simple polygons. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2002, v:23, n:3, pp:313-335 [Journal]
  37. Paul Colley, Anna Lubiw, Jeremy Spinrad
    Visibility Graphs of Towers. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:7, n:, pp:161-172 [Journal]
  38. Giuseppe Liotta, Anna Lubiw, Henk Meijer, Sue Whitesides
    The rectangle of influence drawability problem. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:10, n:1, pp:1-22 [Journal]
  39. Alon Efrat, Stephen G. Kobourov, Anna Lubiw
    Computing homotopic shortest paths efficiently. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2006, v:35, n:3, pp:162-172 [Journal]
  40. Peter Braß, Eowyn Cenek, Christian A. Duncan, Alon Efrat, Cesim Erten, Dan Ismailescu, Stephen G. Kobourov, Anna Lubiw, Joseph S. B. Mitchell
    On simultaneous planar graph embeddings. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:36, n:2, pp:117-130 [Journal]
  41. Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Joseph O'Rourke
    Examples, Counterexamples, and Enumeration Results for Foldings and Unfoldings between Polygons and Polytopes [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  42. Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Joseph O'Rourke
    Enumerating Foldings and Unfoldings between Polygons and Polytopes [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  43. Alon Efrat, Stephen G. Kobourov, Anna Lubiw
    Computing Homotopic Shortest Paths Efficiently [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  44. 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]
  45. 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]
  46. 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]
  47. 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]
  48. 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]
  49. Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Joseph O'Rourke
    Enumerating Foldings and Unfoldings Between Polygons and Polytopes. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2002, v:18, n:1, pp:93-104 [Journal]
  50. Anna Lubiw, András Rácz
    A Lower Bound for the Integer Element Distinctiveness Problem [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1991, v:94, n:1, pp:83-92 [Journal]
  51. Prosenjit Bose, Leonidas J. Guibas, Anna Lubiw, Mark H. Overmars, Diane L. Souvaine, Jorge Urrutia
    The Floodlight Problem. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1997, v:7, n:1/2, pp:153-163 [Journal]
  52. Collette R. Coullard, Anna Lubiw
    Distance visibility graphs. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1992, v:2, n:4, pp:349-362 [Journal]
  53. Prosenjit Bose, Jonathan F. Buss, Anna Lubiw
    Pattern Matching for Permutations. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:65, n:5, pp:277-283 [Journal]
  54. Anna Lubiw
    Counterexample to a Conjecture of Szymanski on Hypercube Routing. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:35, n:2, pp:57-61 [Journal]
  55. Therese C. Biedl, Prosenjit Bose, Erik D. Demaine, Anna Lubiw
    Efficient Algorithms for Petersen's Matching Theorem. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:38, n:1, pp:110-134 [Journal]
  56. Claudia Iturriaga, Anna Lubiw
    Elastic labels around the perimeter of a map. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2003, v:47, n:1, pp:14-39 [Journal]
  57. Anna Lubiw
    A weighted min-max relation for intervals. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1991, v:53, n:2, pp:151-172 [Journal]
  58. Anna Lubiw
    Short-chorded and perfect graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1991, v:51, n:1, pp:24-33 [Journal]
  59. Prosenjit Bose, Hazel Everett, Sándor P. Fekete, Michael E. Houle, Anna Lubiw, Henk Meijer, Kathleen Romanik, Günter Rote, Thomas C. Shermer, Sue Whitesides, Christian Zelle
    A Visibility Representation for Graphs in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 1998, v:2, n:2, pp:- [Journal]
  60. Michael D. Hutton, Anna Lubiw
    Upward Planning of Single-Source Acyclic Digraphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1996, v:25, n:2, pp:291-311 [Journal]
  61. Anna Lubiw
    Some NP-Complete Problems Similar to Graph Isomorphism. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1981, v:10, n:1, pp:11-21 [Journal]
  62. Anna Lubiw
    Doubly Lexical Orderings of Matrices. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1987, v:16, n:5, pp:854-879 [Journal]
  63. Jan Kratochvíl, Anna Lubiw, Jaroslav Nesetril
    Noncrossing Subgraphs in Topological Layouts. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1991, v:4, n:2, pp:223-244 [Journal]
  64. Anna Lubiw
    The Boolean Basis Problem and How to Cover Some Polygons by Rectangles. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1990, v:3, n:1, pp:98-115 [Journal]
  65. Giuseppe Di Battista, Giuseppe Liotta, Anna Lubiw, Sue Whitesides
    Embedding problems for paths with direction constrained edges. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:2, pp:897-917 [Journal]
  66. Mustaq Ahmed, Anna Lubiw
    Shortest Descending Paths through Given Faces. [Citation Graph (0, 0)][DBLP]
    CCCG, 2006, pp:- [Conf]
  67. Anna Lubiw
    Morphing Planar Graph Drawings. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:1- [Conf]
  68. Stephen Bahun, Anna Lubiw
    Optimal Schedules for 2-guard Room Search. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:245-248 [Conf]
  69. Peter Brass, Ferran Hurtado, Benjamin J. Lafreniere, Anna Lubiw
    A Lower Bound on the Area of a 3-Coloured Disc Packing. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:101-104 [Conf]
  70. Therese C. Biedl, Anna Lubiw, Michael J. Spriggs
    Cauchy's Theorem and Edge Lengths of Convex Polyhedra. [Citation Graph (0, 0)][DBLP]
    WADS, 2007, pp:398-409 [Conf]
  71. Mustaq Ahmed, Anna Lubiw
    An Approximation Algorithm for Shortest Descending Paths [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  72. Dieter Kratsch, Peter Damaschke, Anna Lubiw
    Dominating cliques in chordal graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:128, n:1-3, pp:269-275 [Journal]

  73. The Steiner Ratio for Obstacle-Avoiding Rectilinear Steiner Trees. [Citation Graph (, )][DBLP]


  74. Zipper unfoldings of polyhedral complexes. [Citation Graph (, )][DBLP]


  75. Bounded-degree polyhedronization of point sets. [Citation Graph (, )][DBLP]


  76. Decomposing polygonal regions into convex quadrilaterals. [Citation Graph (, )][DBLP]


  77. Modelling gateway placement in wireless networks: geometric k-centres of unit disc graphs. [Citation Graph (, )][DBLP]


  78. Shortest Paths Avoiding Forbidden Subpaths. [Citation Graph (, )][DBLP]


  79. The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs. [Citation Graph (, )][DBLP]


  80. Shortest Gently Descending Paths. [Citation Graph (, )][DBLP]


  81. Equiprojective polyhedra. [Citation Graph (, )][DBLP]


  82. Morphing polyhedra with parallel faces: Counterexamples. [Citation Graph (, )][DBLP]


  83. Shortest descending paths through given faces. [Citation Graph (, )][DBLP]


  84. A Lower Bound on the Area of a 3-Coloured Disk Packing [Citation Graph (, )][DBLP]


  85. Approximation Algorithms for Shortest Descending Paths in Terrains [Citation Graph (, )][DBLP]


  86. Shortest Paths Avoiding Forbidden Subpaths [Citation Graph (, )][DBLP]


  87. The Simultaneous Membership Problem for Chordal, Comparability and Permutation graphs [Citation Graph (, )][DBLP]


  88. A note on odd/even cycles. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.011secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002