default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnna Lubiw
Person information
- affiliation: University of Waterloo, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c104]Therese Biedl, Anna Lubiw, Jack Spalding-Jamieson:
Morphing Planar Graph Drawings via Orthogonal Box Drawings. GD 2024: 40:1-40:16- [i63]MIT CompGeom Group, Hugo A. Akitaya, Erik D. Demaine, Adam Hesterberg, Anna Lubiw, Jayson Lynch, Joseph O'Rourke, Frederick Stock:
Super Guarding and Dark Rays in Art Galleries. CoRR abs/2404.04613 (2024) - [i62]Therese Biedl, Anna Lubiw, Jack Spalding-Jamieson:
Morphing Planar Graph Drawings via Orthogonal Box Drawings. CoRR abs/2409.04074 (2024) - 2023
- [j76]Meng He
, Anna Lubiw, Mohammad R. Salavatipour:
Preface to the Special Issue on the 17th Algorithms and Data Structures Symposium (WADS 2021). Algorithmica 85(6): 1736-1737 (2023) - [j75]Anna Lubiw, Graeme Stroud:
Computing Realistic Terrains from Imprecise Elevations. Comput. Geom. Topol. 2(2): 3:1-3:18 (2023) - [j74]Meng He, Anna Lubiw, Mohammad R. Salavatipour:
Preface. Comput. Geom. 110: 101958 (2023) - [c103]Joseph O'Rourke, Hugo A. Akitaya, Erik D. Demaine, Adam Hesterberg, Anna Lubiw, Jayson Lynch, Frederick Stock:
Super Guarding and Dark Rays in Art Galleries. CCCG 2023: 51-61 - [c102]Anna Lubiw, Anurag Murty Naredla:
The Geodesic Edge Center of a Simple Polygon. SoCG 2023: 49:1-49:15 - [i61]Anna Lubiw, Anurag Murty Naredla:
The geodesic edge center of a simple polygon. CoRR abs/2303.09702 (2023) - 2022
- [j73]Ahmad Biniaz, Prosenjit Bose, Anna Lubiw, Anil Maheshwari:
Bounded-Angle Minimum Spanning Trees. Algorithmica 84(1): 150-175 (2022) - [j72]Ahmad Biniaz, Kshitij Jain, Anna Lubiw, Zuzana Masárová, Tillmann Miltzow, Debajyoti Mondal, Anurag Murty Naredla, Josef Tkadlec, Alexi Turcotte:
Token Swapping on Trees. Discret. Math. Theor. Comput. Sci. 24(2) (2022) - [j71]Anna Lubiw, Tillmann Miltzow, Debajyoti Mondal:
The Complexity of Drawing a Graph in a Polygonal Region. J. Graph Algorithms Appl. 26(4): 421-446 (2022) - [c101]Anna Lubiw, Graeme Stroud:
Computing Realistic Terrains from Imprecise Elevations. CCCG 2022: 227-234 - [c100]Joseph O'Rourke, Anna Lubiw, Ryuhei Uehara, Chie Nara, Thomas C. Hull, Klara Mundilova, Josef Tkadlec:
Quasi-Twisting Convex Polyhedra. CCCG 2022: 270-276 - [c99]Oswin Aichholzer, Erik D. Demaine, Matias Korman, Anna Lubiw, Jayson Lynch, Zuzana Masárová, Mikhail Rudoy, Virginia Vassilevska Williams, Nicole Wein:
Hardness of Token Swapping on Trees. ESA 2022: 3:1-3:15 - [i60]Reza Bigdeli, Anna Lubiw:
Forbidding Edges between Points in the Plane to Disconnect the Triangulation Flip Graph. CoRR abs/2206.02700 (2022) - [i59]Oswin Aichholzer, Brad Ballinger, Therese Biedl, Mirela Damian, Erik D. Demaine, Matias Korman, Anna Lubiw, Jayson Lynch, Josef Tkadlec, Yushi Uno:
Reconfiguration of Non-crossing Spanning Trees. CoRR abs/2206.03879 (2022) - [i58]Maike Buchin, Anna Lubiw, Arnaud de Mesmay, Saul Schleimer:
Computation and Reconfiguration in Low-Dimensional Topological Spaces (Dagstuhl Seminar 22062). Dagstuhl Reports 12(2): 17-66 (2022) - 2021
- [j70]Therese Biedl, Ahmad Biniaz, Anna Lubiw:
Minimum ply covering of points with disks and squares. Comput. Geom. 94: 101712 (2021) - [c98]Therese Biedl, Anna Lubiw, Anurag Murty Naredla, Peter Dominik Ralbovsky, Graeme Stroud:
Distant Representatives for Rectangles in the Plane. ESA 2021: 17:1-17:18 - [c97]Anna Lubiw, Anurag Murty Naredla:
The Visibility Center of a Simple Polygon. ESA 2021: 65:1-65:14 - [c96]Therese Biedl, Anna Lubiw, Anurag Murty Naredla, Peter Dominik Ralbovsky, Graeme Stroud:
Dispersion for Intervals: A Geometric Approach. SOSA 2021: 37-44 - [e3]Anna Lubiw, Mohammad R. Salavatipour:
Algorithms and Data Structures - 17th International Symposium, WADS 2021, Virtual Event, August 9-11, 2021, Proceedings. Lecture Notes in Computer Science 12808, Springer 2021, ISBN 978-3-030-83507-1 [contents] - [i57]Oswin Aichholzer, Erik D. Demaine, Matias Korman, Jayson Lynch, Anna Lubiw, Zuzana Masárová, Mikhail Rudoy, Virginia Vassilevska Williams, Nicole Wein:
Hardness of Token Swapping on Trees. CoRR abs/2103.06707 (2021) - [i56]Anna Lubiw, Anurag Murty Naredla:
The Visibility Center of a Simple Polygon. CoRR abs/2108.07366 (2021) - [i55]Therese Biedl, Anna Lubiw, Anurag Murty Naredla, Peter Dominik Ralbovsky, Graeme Stroud:
Distant Representatives for Rectangles in the Plane. CoRR abs/2108.07751 (2021) - 2020
- [j69]Anna Lubiw, Daniela Maftuleac, Megan Owen:
Shortest paths and convex hulls in 2D complexes with non-positive curvature. Comput. Geom. 89: 101626 (2020) - [j68]Nadia M. Benbernou, Erik D. Demaine, Martin L. Demaine, Anna Lubiw:
Universal hinge patterns for folding strips efficiently into any grid polyhedron. Comput. Geom. 89: 101633 (2020) - [j67]Hugo A. Akitaya, Vida Dujmovic, David Eppstein, Thomas C. Hull, Kshitij Jain, Anna Lubiw:
Face flips in origami tessellations. J. Comput. Geom. 11(1): 397-417 (2020) - [j66]Sergio Cabello, Kshitij Jain, Anna Lubiw, Debajyoti Mondal:
Minimum shared-power edge cut. Networks 75(3): 321-333 (2020) - [j65]Anna Lubiw, Debajyoti Mondal:
On compatible triangulations with a minimum number of Steiner points. Theor. Comput. Sci. 835: 97-107 (2020) - [c95]Ahmad Biniaz, Prosenjit Bose, Anna Lubiw, Anil Maheshwari:
Bounded-Angle Minimum Spanning Trees. SWAT 2020: 14:1-14:22 - [i54]Therese Biedl, Anna Lubiw, Owen D. Merkel:
Building a larger class of graphs for efficient reconfiguration of vertex colouring. CoRR abs/2003.01818 (2020) - [i53]Therese Biedl, Pavle Bulatovic, Veronika Irvine, Anna Lubiw, Owen D. Merkel, Anurag Murty Naredla:
Reconstructing a Polyhedron between Polygons in Parallel Slices. CoRR abs/2004.05946 (2020) - [i52]Elena Arseneva, Yeganeh Bahoo, Ahmad Biniaz, Pilar Cano, Farah Chanchary, John Iacono, Kshitij Jain, Anna Lubiw, Debajyoti Mondal, Khadijeh Sheikhan, Csaba D. Tóth:
Compatible Paths on Labelled Point Sets. CoRR abs/2004.07996 (2020)
2010 – 2019
- 2019
- [j64]Linda Kleist, Boris Klemz, Anna Lubiw, Lena Schlipf, Frank Staals, Darren Strash:
Convexity-increasing morphs of planar graphs. Comput. Geom. 84: 69-88 (2019) - [j63]Fidel Barrera-Cruz, Penny Haxell, Anna Lubiw:
Morphing Schnyder Drawings of Planar Triangulations. Discret. Comput. Geom. 61(1): 161-184 (2019) - [j62]Anna Lubiw, Zuzana Masárová, Uli Wagner:
A Proof of the Orbit Conjecture for Flipping Edge-Labelled Triangulations. Discret. Comput. Geom. 61(4): 880-898 (2019) - [j61]Anna Lubiw, Debajyoti Mondal:
Construction and Local Routing for Angle-Monotone Graphs. J. Graph Algorithms Appl. 23(2): 345-369 (2019) - [j60]Therese Biedl, Ahmad Biniaz, Robert Cummings, Anna Lubiw, Florin Manea, Dirk Nowotka, Jeffrey O. Shallit:
Rollercoasters: Long Sequences without Short Runs. SIAM J. Discret. Math. 33(2): 845-861 (2019) - [j59]Felice De Luca, Md. Iqbal Hossain, Stephen G. Kobourov, Anna Lubiw, Debajyoti Mondal:
Recognition and drawing of stick graphs. Theor. Comput. Sci. 796: 22-33 (2019) - [c94]Therese Biedl, Pavle Bulatovic, Veronika Irvine, Anna Lubiw, Owen D. Merkel, Anurag Murty Naredla:
Reconstructing a Polyhedron between Polygons in Parallel Slices. CCCG 2019: 139-145 - [c93]Therese Biedl, Ahmad Biniaz, Anna Lubiw:
Minimum Ply Covering of Points with Disks and Squares. CCCG 2019: 226-235 - [c92]Erik D. Demaine, David Eppstein, Adam Hesterberg, Kshitij Jain, Anna Lubiw, Ryuhei Uehara, Yushi Uno:
Reconfiguring Undirected Paths. WADS 2019: 353-365 - [c91]Therese Biedl, Ahmad Biniaz, Veronika Irvine, Kshitij Jain, Philipp Kindermann, Anna Lubiw:
Maximum Matchings and Minimum Blocking Sets in \varTheta _6 -Graphs. WG 2019: 258-270 - [i51]Therese Biedl, Ahmad Biniaz, Veronika Irvine, Kshitij Jain, Philipp Kindermann, Anna Lubiw:
Maximum Matchings and Minimum Blocking Sets in Θ6-Graphs. CoRR abs/1901.01476 (2019) - [i50]Ahmad Biniaz, Kshitij Jain, Anna Lubiw, Zuzana Masárová, Tillmann Miltzow, Debajyoti Mondal, Anurag Murty Naredla, Josef Tkadlec, Alexi Turcotte:
Token Swapping on Trees. CoRR abs/1903.06981 (2019) - [i49]Erik D. Demaine, David Eppstein, Adam Hesterberg, Kshitij Jain, Anna Lubiw, Ryuhei Uehara, Yushi Uno:
Reconfiguring Undirected Paths. CoRR abs/1905.00518 (2019) - [i48]Therese Biedl, Ahmad Biniaz, Anna Lubiw:
Minimum Ply Covering of Points with Disks and Squares. CoRR abs/1905.00790 (2019) - [i47]Hugo A. Akitaya, Vida Dujmovic, David Eppstein, Thomas C. Hull, Kshitij Jain, Anna Lubiw:
Face flips in origami tessellations. CoRR abs/1910.05667 (2019) - [i46]Maarten Löffler, Anna Lubiw, Saul Schleimer, Erin Wolf Chambers:
Computation in Low-Dimensional Geometry and Topology (Dagstuhl Seminar 19352). Dagstuhl Reports 9(8): 84-112 (2019) - 2018
- [j58]David Eppstein, Philipp Kindermann, Stephen G. Kobourov, Giuseppe Liotta, Anna Lubiw, Aude Maignan, Debajyoti Mondal, Hamideh Vosoughpour, Sue Whitesides, Stephen K. Wismath:
On the Planar Split Thickness of Graphs. Algorithmica 80(3): 977-994 (2018) - [j57]Prosenjit Bose, Anna Lubiw, Vinayak Pathak, Sander Verdonschot:
Flipping edge-labelled triangulations. Comput. Geom. 68: 309-326 (2018) - [j56]Zachary Abel, Erik D. Demaine, Martin L. Demaine, David Eppstein, Anna Lubiw, Ryuhei Uehara:
Flat foldings of plane graphs with prescribed angles and edge lengths. J. Comput. Geom. 9(1): 74-93 (2018) - [c90]Elena Arseneva, Yeganeh Bahoo, Ahmad Biniaz, Pilar Cano, Farah Chanchary, John Iacono, Kshitij Jain, Anna Lubiw, Debajyoti Mondal, Khadijeh Sheikhan, Csaba D. Tóth:
Compatible Paths on Labelled Point Sets. CCCG 2018: 54-60 - [c89]Felice De Luca, Md. Iqbal Hossain, Stephen G. Kobourov, Anna Lubiw, Debajyoti Mondal:
Recognition and Drawing of Stick Graphs. GD 2018: 303-316 - [c88]Anna Lubiw, Tillmann Miltzow, Debajyoti Mondal:
The Complexity of Drawing a Graph in a Polygonal Region. GD 2018: 387-401 - [c87]Therese Biedl, Ahmad Biniaz, Robert Cummings, Anna Lubiw, Florin Manea, Dirk Nowotka, Jeffrey O. Shallit:
Rollercoasters and Caterpillars. ICALP 2018: 18:1-18:15 - [c86]Therese Biedl, Martin Derka, Veronika Irvine, Anna Lubiw, Debajyoti Mondal, Alexi Turcotte:
Partitioning Orthogonal Histograms into Rectangular Boxes. LATIN 2018: 146-160 - [c85]Linda Kleist, Boris Klemz, Anna Lubiw, Lena Schlipf, Frank Staals, Darren Strash:
Convexity-Increasing Morphs of Planar Graphs. WG 2018: 318-330 - [c84]Anna Lubiw, Debajyoti Mondal:
Construction and Local Routing for Angle-Monotone Graphs. WG 2018: 356-368 - [i45]Anna Lubiw, Debajyoti Mondal:
Angle-Monotone Graphs: Construction and Local Routing. CoRR abs/1801.06290 (2018) - [i44]Therese Biedl, Ahmad Biniaz, Robert Cummings, Anna Lubiw, Florin Manea, Dirk Nowotka, Jeffrey O. Shallit:
Rollercoasters and Caterpillars. CoRR abs/1801.08565 (2018) - [i43]Linda Kleist, Boris Klemz, Anna Lubiw, Lena Schlipf, Frank Staals, Darren Strash:
Convexity-Increasing Morphs of Planar Graphs. CoRR abs/1802.06579 (2018) - [i42]Anna Lubiw, Tillmann Miltzow, Debajyoti Mondal:
The Complexity of Drawing a Graph in a Polygonal Region. CoRR abs/1802.06699 (2018) - [i41]Sergio Cabello, Kshitij Jain, Anna Lubiw, Debajyoti Mondal:
Minimum Shared-Power Edge Cut. CoRR abs/1806.04742 (2018) - [i40]Felice De Luca, Md. Iqbal Hossain, Stephen G. Kobourov, Anna Lubiw, Debajyoti Mondal:
Recognition and Drawing of Stick Graphs. CoRR abs/1808.10005 (2018) - 2017
- [j55]Anna Lubiw, Jack Snoeyink, Hamideh Vosoughpour:
Visibility graphs, dismantlability, and the cops and robbers game. Comput. Geom. 66: 14-27 (2017) - [j54]Sándor P. Fekete, Anna Lubiw:
Guest Editors' Foreword. Discret. Comput. Geom. 58(4): 755-756 (2017) - [j53]Emilio Di Giacomo, Anna Lubiw:
Guest Editors' Foreword. J. Graph Algorithms Appl. 21(1): 1-3 (2017) - [j52]Sándor P. Fekete, Anna Lubiw:
Guest editors' foreword. J. Comput. Geom. 8(2): 1 (2017) - [j51]Soroush Alamdari, Patrizio Angelini, Fidel Barrera-Cruz, Timothy M. Chan, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Penny Haxell, Anna Lubiw, Maurizio Patrignani, Vincenzo Roselli, Sahil Singla, Bryan T. Wilkinson:
How to Morph Planar Graph Drawings. SIAM J. Comput. 46(2): 824-852 (2017) - [c83]Anna Lubiw, Joseph O'Rourke:
Angle-monotone Paths in Non-obtuse Triangulations. CCCG 2017: 25-30 - [c82]Anna Lubiw, Debajyoti Mondal:
On Compatible Triangulations with a Minimum Number of Steiner Points. CCCG 2017: 101-106 - [c81]Anna Lubiw, Zuzana Masárová, Uli Wagner:
A Proof of the Orbit Conjecture for Flipping Edge-Labelled Triangulations. SoCG 2017: 49:1-49:15 - [c80]Therese Biedl, Timothy M. Chan, Martin Derka, Kshitij Jain, Anna Lubiw:
Improved Bounds for Drawing Trees on Fixed Points with L-Shaped Edges. GD 2017: 305-317 - [c79]Dmitry Chistikov, Szabolcs Iván, Anna Lubiw, Jeffrey O. Shallit:
Fractional Coverings, Greedy Coverings, and Rectifier Networks. STACS 2017: 23:1-23:14 - [c78]Nadia M. Benbernou, Erik D. Demaine, Martin L. Demaine, Anna Lubiw:
Universal Hinge Patterns for Folding Strips Efficiently into Any Grid Polyhedron. WADS 2017: 109-120 - [i39]Anna Lubiw, Debajyoti Mondal:
On Compatible Triangulations with a Minimum Number of Steiner Points. CoRR abs/1706.09086 (2017) - [i38]Anna Lubiw, Joseph O'Rourke:
Angle-monotone Paths in Non-obtuse Triangulations. CoRR abs/1707.00219 (2017) - [i37]Therese Biedl, Timothy M. Chan, Martin Derka, Kshitij Jain, Anna Lubiw:
Improved Bounds for Drawing Trees on Fixed Points with L-shaped Edges. CoRR abs/1709.01456 (2017) - [i36]Anna Lubiw, Zuzana Masárová, Uli Wagner:
A Proof of the Orbit Conjecture for Flipping Edge-Labelled Triangulations. CoRR abs/1710.02741 (2017) - 2016
- [j50]Stephen Kiazyk, Anna Lubiw:
Star Unfolding from a Geodesic Curve. Discret. Comput. Geom. 56(4): 1018-1036 (2016) - [j49]Erik D. Demaine, David Eppstein, Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara, Yushi Uno:
Folding a paper strip to minimize thickness. J. Discrete Algorithms 36: 18-26 (2016) - [c77]Therese Biedl, Anna Lubiw, Saeed Mehrabi, Sander Verdonschot:
Rectangle-of-influence triangulations. CCCG 2016: 237-243 - [c76]Nicolas Bonichon, Prosenjit Bose, Paz Carmi, Irina Kostitsyna, Anna Lubiw, Sander Verdonschot:
Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition. GD 2016: 519-531 - [c75]David Eppstein, Philipp Kindermann, Stephen G. Kobourov, Giuseppe Liotta, Anna Lubiw, Aude Maignan, Debajyoti Mondal, Hamideh Vosoughpour, Sue Whitesides, Stephen K. Wismath:
On the Planar Split Thickness of Graphs. LATIN 2016: 403-415 - [e2]Sándor P. Fekete, Anna Lubiw:
32nd International Symposium on Computational Geometry, SoCG 2016, June 14-18, 2016, Boston, MA, USA. LIPIcs 51, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2016, ISBN 978-3-95977-009-5 [contents] - [i35]Anna Lubiw, Jack Snoeyink, Hamideh Vosoughpour:
Visibility Graphs, Dismantlability, and the Cops and Robbers Game. CoRR abs/1601.01298 (2016) - [i34]Anna Lubiw, Daniela Maftuleac, Megan Owen:
Shortest Paths and Convex Hulls in 2D Complexes with Non-Positive Curvature. CoRR abs/1603.00847 (2016) - [i33]Soroush Alamdari, Patrizio Angelini, Fidel Barrera-Cruz, Timothy M. Chan, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Penny Haxell, Anna Lubiw, Maurizio Patrignani, Vincenzo Roselli, Sahil Singla, Bryan T. Wilkinson:
How to morph planar graph drawings. CoRR abs/1606.00425 (2016) - [i32]Nicolas Bonichon, Prosenjit Bose, Paz Carmi, Irina Kostitsyna, Anna Lubiw, Sander Verdonschot:
Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition. CoRR abs/1608.08892 (2016) - [i31]Nadia M. Benbernou, Erik D. Demaine, Martin L. Demaine, Anna Lubiw:
Universal Hinge Patterns for Folding Strips Efficiently into Any Grid Polyhedron. CoRR abs/1611.03187 (2016) - [i30]Anna Lubiw, Vinayak Pathak:
Reconfiguring Ordered Bases of a Matroid. CoRR abs/1612.00958 (2016) - [i29]Cody Barnson, Dawn Chandler, Qiao Chen, Christina Chung, Andrew Coccimiglio, Sean La, Lily Li, Aïna Linn, Anna Lubiw, Clare Lyle, Shikha Mahajan, Gregory W. Mierzwinski, Simon Pratt, Yoon Su Yoo, Hongbo Zhang, Kevin Zhang:
Some Counterexamples for Compatible Triangulations. CoRR abs/1612.04861 (2016) - 2015
- [j48]Anna Lubiw, Vinayak Pathak:
Flip distance between two triangulations of a point set is NP-complete. Comput. Geom. 49: 17-23 (2015) - [j47]Timothy M. Chan, Fabrizio Frati, Carsten Gutwenger, Anna Lubiw, Petra Mutzel, Marcus Schaefer:
Drawing Partially Embedded and Simultaneously Planar Graphs. J. Graph Algorithms Appl. 19(2): 681-706 (2015) - [c74]Laurie J. Heyer, Anna Lubiw, Debajyoti Mondal, Ulrike Stege, Sue Whitesides:
Reconfiguring a Chain of Cubes. CCCG 2015 - [c73]Patrizio Angelini, Giordano Da Lozzo, Fabrizio Frati, Anna Lubiw, Maurizio Patrignani, Vincenzo Roselli:
Optimal Morphs of Convex Drawings. SoCG 2015: 126-140 - [c72]Stephen Kiazyk, Anna Lubiw:
Star Unfolding from a Geodesic Curve. SoCG 2015: 390-404 - [c71]Erik D. Demaine, David Eppstein, Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara, Yushi Uno:
Folding a Paper Strip to Minimize Thickness. WALCOM 2015: 113-124 - [e1]Emilio Di Giacomo, Anna Lubiw:
Graph Drawing and Network Visualization - 23rd International Symposium, GD 2015, Los Angeles, CA, USA, September 24-26, 2015, Revised Selected Papers. Lecture Notes in Computer Science 9411, Springer 2015, ISBN 978-3-319-27260-3 [contents] - [i28]Patrizio Angelini, Giordano Da Lozzo, Fabrizio Frati, Anna Lubiw, Maurizio Patrignani, Vincenzo Roselli:
Optimal Morphs of Convex Drawings. CoRR abs/1503.09021 (2015) - [i27]Dmitry Chistikov, Szabolcs Iván, Anna Lubiw, Jeffrey O. Shallit:
Fractional coverings, greedy coverings, and rectifier networks. CoRR abs/1509.07588 (2015) - 2014
- [j46]Erik D. Demaine, Martin L. Demaine, Jin-ichi Itoh, Anna Lubiw, Chie Nara, Joseph O'Rourke:
Reprint of: Refold rigidity of convex polyhedra. Comput. Geom. 47(3): 507-517 (2014) - [j45]Oswin Aichholzer, Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Michael Hoffmann, Anna Lubiw, Jack Snoeyink, Andrew Winslow:
Covering Folded Shapes. J. Comput. Geom. 5(1): 150-167 (2014) - [c70]Fidel Barrera-Cruz, Therese Biedl, Martin Derka, Stephen Kiazyk, Anna Lubiw, Hamideh Vosoughpour:
Turning Orthogonally Convex Polyhedra into Orthoballs. CCCG 2014 - [c69]Anna Lubiw, Jack Snoeyink, Hamideh Vosoughpour:
Visibility Graphs, Dismantlability, and the Cops and Robbers Game. CCCG 2014 - [c68]Zachary Abel, Erik D. Demaine, Martin L. Demaine, Jin-ichi Itoh, Anna Lubiw, Chie Nara, Joseph O'Rourke:
Continuously Flattening Polyhedra Using Straight Skeletons. SoCG 2014: 396 - [c67]Timothy M. Chan, Fabrizio Frati, Carsten Gutwenger, Anna Lubiw, Petra Mutzel, Marcus Schaefer:
Drawing Partially Embedded and Simultaneously Planar Graphs. GD 2014: 25-39 - [c66]Zachary Abel, Erik D. Demaine, Martin L. Demaine, David Eppstein, Anna Lubiw, Ryuhei Uehara:
Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths. GD 2014: 272-283 - [c65]Fidel Barrera-Cruz, Penny E. Haxell, Anna Lubiw:
Morphing Schnyder Drawings of Planar Triangulations. GD 2014: 294-305 - [c64]Lukas Barth, Sara Irina Fabrikant, Stephen G. Kobourov, Anna Lubiw, Martin Nöllenburg, Yoshio Okamoto, Sergey Pupyrev, Claudio Squarcella, Torsten Ueckerdt, Alexander Wolff:
Semantic Word Cloud Representations: Hardness and Approximation Algorithms. LATIN 2014: 514-525 - [i26]Oswin Aichholzer, Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Michael Hoffmann, Anna Lubiw, Jack Snoeyink, Andrew Winslow:
Covering Folded Shapes. CoRR abs/1405.2378 (2014) - [i25]Zachary Abel, Erik D. Demaine, Martin L. Demaine, David Eppstein, Anna Lubiw, Ryuhei Uehara:
Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths. CoRR abs/1408.6771 (2014) - [i24]Timothy M. Chan, Fabrizio Frati, Carsten Gutwenger, Anna Lubiw, Petra Mutzel, Marcus Schaefer:
Drawing Partially Embedded and Simultaneously Planar Graphs. CoRR abs/1410.8205 (2014) - [i23]Fidel Barrera-Cruz, Penny E. Haxell, Anna Lubiw:
Morphing Planar Graph Drawings with Unidirectional Moves. CoRR abs/1411.6185 (2014) - [i22]Fidel Barrera-Cruz, Penny Haxell, Anna Lubiw:
Morphing Schnyder drawings of planar triangulations. CoRR abs/1411.6186 (2014) - [i21]Erik D. Demaine, David Eppstein, Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara, Yushi Uno:
Folding a Paper Strip to Minimize Thickness. CoRR abs/1411.6371 (2014) - 2013
- [j44]Gill Barequet, Nadia M. Benbernou, David Charlton, Erik D. Demaine, Martin L. Demaine, Mashhood Ishaque, Anna Lubiw, André Schulz, Diane L. Souvaine, Godfried T. Toussaint, Andrew Winslow:
Bounded-degree polyhedronization of point sets. Comput. Geom. 46(2): 148-153 (2013) - [j43]Erik D. Demaine, Martin L. Demaine, Jin-ichi Itoh, Anna Lubiw, Chie Nara, Joseph O'Rourke:
Refold rigidity of convex polyhedra. Comput. Geom. 46(8): 979-989 (2013) - [j42]Brad Ballinger, Nadia M. Benbernou, Prosenjit Bose, Mirela Damian, Erik D. Demaine, Vida Dujmovic, Robin Y. Flatland, Ferran Hurtado, John Iacono, Anna Lubiw, Pat Morin, Vera Sacristán Adinolfi, Diane L. Souvaine, Ryuhei Uehara:
Coverage with k-transmitters in the presence of obstacles. J. Comb. Optim. 25(2): 208-233 (2013) - [j41]Bernhard Haeupler, Krishnam Raju Jampani, Anna Lubiw:
Testing Simultaneous Planarity when the Common Graph is 2-Connected. J. Graph Algorithms Appl. 17(3): 147-171 (2013) - [j40]Mustaq Ahmed, Anna Lubiw:
Shortest paths avoiding forbidden subpaths. Networks 61(4): 322-334 (2013) - [j39]Therese Biedl, Anna Lubiw, Mark Petrick, Michael J. Spriggs:
Morphing orthogonal planar graph drawings. ACM Trans. Algorithms 9(4): 29:1-29:24 (2013) - [c63]Oswin Aichholzer, Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Michael Hoffmann, Anna Lubiw, Jack Snoeyink, Andrew Winslow:
Covering Folded Shapes. CCCG 2013 - [c62]Timothy M. Chan, Hella-Franziska Hoffmann, Stephen Kiazyk, Anna Lubiw:
Minimum Length Embedding of Planar Graphs at Fixed Vertex Locations. GD 2013: 376-387 - [c61]Soroush Alamdari, Patrizio Angelini, Timothy M. Chan, Giuseppe Di Battista, Fabrizio Frati, Anna Lubiw, Maurizio Patrignani, Vincenzo Roselli, Sahil Singla, Bryan T. Wilkinson:
Morphing Planar Graph Drawings with a Polynomial Number of Steps. SODA 2013: 1656-1667 - [c60]Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Anna Lubiw, André Schulz, Diane L. Souvaine, Giovanni Viglietta, Andrew Winslow:
Algorithms for Designing Pop-Up Cards. STACS 2013: 269-280 - [c59]Soroush Alamdari, Therese Biedl, Timothy M. Chan, Elyot Grant, Krishnam Raju Jampani, Srinivasan Keshav, Anna Lubiw, Vinayak Pathak:
Smart-Grid Electricity Allocation via Strip Packing with Slicing. WADS 2013: 25-36 - [i20]Soroush Alamdari, Timothy M. Chan, Elyot Grant, Anna Lubiw, Vinayak Pathak:
Self-Approaching Graphs. CoRR abs/1306.5460 (2013) - [i19]Prosenjit Bose, Anna Lubiw, Vinayak Pathak, Sander Verdonschot:
Flipping Edge-Labelled Triangulations. CoRR abs/1310.1166 (2013) - [i18]Lukas Barth, Sara Irina Fabrikant, Stephen G. Kobourov, Anna Lubiw, Martin Nöllenburg, Yoshio Okamoto, Sergey Pupyrev, Claudio Squarcella, Torsten Ueckerdt, Alexander Wolff:
Semantic Word Cloud Representations: Hardness and Approximation Algorithms. CoRR abs/1311.4778 (2013) - [i17]Therese Biedl, Martin Derka, Stephen Kiazyk, Anna Lubiw, Hamideh Vosoughpour:
Dihedral angles and orthogonal polyhedra. CoRR abs/1312.6824 (2013) - 2012
- [j38]Giuseppe Di Battista, Ethan Kim, Giuseppe Liotta, Anna Lubiw, Sue Whitesides:
The Shape of Orthogonal Cycles in Three Dimensions. Discret. Comput. Geom. 47(3): 461-491 (2012) - [j37]Krishnam Raju Jampani, Anna Lubiw:
The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs. J. Graph Algorithms Appl. 16(2): 283-315 (2012) - [c58]Anna Lubiw, Vinayak Pathak:
Flip Distance Between Two Triangulations of a Point Set is NP-complete. CCCG 2012: 119-124 - [c57]Soroush Alamdari, Timothy M. Chan, Elyot Grant, Anna Lubiw, Vinayak Pathak:
Self-approaching Graphs. GD 2012: 260-271 - [i16]Anna Lubiw, Vinayak Pathak:
Flip Distance Between Two Triangulations of a Point-Set is NP-complete. CoRR abs/1205.2425 (2012) - 2011
- [j36]Stephane Durocher, Krishnam Raju Jampani, Anna Lubiw, Lata Narayanan:
Modelling gateway placement in wireless networks: Geometric k-centres of unit disc graphs. Comput. Geom. 44(5): 286-302 (2011) - [j35]Mustaq Ahmed, Anna Lubiw:
Shortest Descending Paths: towards an Exact Algorithm. Int. J. Comput. Geom. Appl. 21(4): 431-466 (2011) - [j34]Anna Lubiw, Mark Petrick:
Morphing Planar Graph Drawings with Bent Edges. J. Graph Algorithms Appl. 15(2): 205-227 (2011) - [c56]Oswin Aichholzer, Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, Ferran Hurtado, Anna Lubiw, Günter Rote, André Schulz, Diane L. Souvaine, Andrew Winslow:
Convexifying Polygons Without Losing Visibilities. CCCG 2011 - [c55]Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Anna Lubiw, Andrew Winslow:
Algorithms for Solving Rubik's Cubes. ESA 2011: 689-700 - [c54]Erik D. Demaine, Anna Lubiw:
A Generalization of the Source Unfolding of Convex Polyhedra. EGC 2011: 185-199 - [c53]Patrizio Angelini, Giuseppe Di Battista, Walter Didimo, Fabrizio Frati, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Anna Lubiw:
Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area. EGC 2011: 200-209 - [i15]Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Anna Lubiw, Andrew Winslow:
Algorithms for Solving Rubik's Cubes. CoRR abs/1106.5736 (2011) - 2010
- [j33]Peter Brass, Ferran Hurtado, Benjamin J. Lafreniere, Anna Lubiw:
A Lower Bound on the Area of a 3-Coloured Disk Packing. Int. J. Comput. Geom. Appl. 20(3): 341-360 (2010) - [j32]Mustaq Ahmed, Sandip Das, Sachin Lodha, Anna Lubiw, Anil Maheshwari, Sasanka Roy:
Approximation algorithms for shortest descending paths in terrains. J. Discrete Algorithms 8(2): 214-230 (2010) - [c52]Gill Barequet, Nadia M. Benbernou, David Charlton, Erik D. Demaine, Martin L. Demaine, Mashhood Ishaque, Anna Lubiw, André Schulz, Diane L. Souvaine, Godfried T. Toussaint, Andrew Winslow:
Bounded-degree polyhedronization of point sets. CCCG 2010: 99-102 - [c51]Anna Lubiw, Erik D. Demaine, Martin L. Demaine, Arlo Shallit, Jonah Shallit:
Zipper unfoldings of polyhedral complexes. CCCG 2010: 219-222 - [c50]Brad Ballinger, Nadia M. Benbernou, Prosenjit Bose, Mirela Damian, Erik D. Demaine, Vida Dujmovic, Robin Y. Flatland, Ferran Hurtado, John Iacono, Anna Lubiw, Pat Morin, Vera Sacristán Adinolfi, Diane L. Souvaine, Ryuhei Uehara:
Coverage with k-Transmitters in the Presence of Obstacles. COCOA (2) 2010: 1-15 - [c49]Krishnam Raju Jampani, Anna Lubiw:
Simultaneous Interval Graphs. ISAAC (1) 2010: 206-217 - [c48]Bernhard Haeupler, Krishnam Raju Jampani, Anna Lubiw:
Testing Simultaneous Planarity When the Common Graph Is 2-Connected. ISAAC (2) 2010: 410-421 - [i14]Krishnam Raju Jampani, Anna Lubiw:
Simultaneous Interval Graphs. CoRR abs/1009.3502 (2010) - [i13]Bernhard Haeupler, Krishnam Raju Jampani, Anna Lubiw:
Testing Simultaneous Planarity when the Common Graph is 2-Connected. CoRR abs/1009.4517 (2010)
2000 – 2009
- 2009
- [j31]Therese Biedl, Anna Lubiw, Michael J. Spriggs:
Morphing polyhedra with parallel faces: Counterexamples. Comput. Geom. 42(5): 395-402 (2009) - [j30]Mustaq Ahmed, Anna Lubiw:
Shortest descending paths through given faces. Comput. Geom. 42(5): 464-470 (2009) - [c47]Mustaq Ahmed, Anna Lubiw:
Shortest Paths Avoiding Forbidden Subpaths. STACS 2009: 63-74 - [c46]Krishnam Raju Jampani, Anna Lubiw:
The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs. WADS 2009: 387-398 - [c45]Mustaq Ahmed, Anna Lubiw, Anil Maheshwari:
Shortest Gently Descending Paths. WALCOM 2009: 59-70 - 2008
- [j29]Masud Hasan, Anna Lubiw:
Equiprojective polyhedra. Comput. Geom. 40(2): 148-155 (2008) - [j28]Anna Lubiw, Mark Petrick:
Morphing Planar Graph Drawings with Bent Edges. Electron. Notes Discret. Math. 31: 45-48 (2008) - [c44]Mina Razaghpour, Anna Lubiw:
The Steiner Ratio for Obstacle-Avoiding Rectilinear Steiner Trees. CCCG 2008 - [c43]Stephane Durocher, Krishnam Raju Jampani, Anna Lubiw, Lata Narayanan:
Modelling gateway placement in wireless networks: geometric k-centres of unit disc graphs. DIALM-POMC 2008: 79-86 - [i12]Stephen P. Borgatti, Ulrik Brandes, Michael Kaufmann, Stephen G. Kobourov, Anna Lubiw, Dorothea Wagner:
08191 Working Group Report - Visualization of Trajectories. Graph Drawing with Applications to Bioinformatics and Social Sciences 2008 - [i11]Peter Brass, Ferran Hurtado, Benjamin J. Lafreniere, Anna Lubiw:
A Lower Bound on the Area of a 3-Coloured Disk Packing. CoRR abs/0804.1173 (2008) - [i10]Mustaq Ahmed, Sandip Das, Sachin Lodha, Anna Lubiw, Anil Maheshwari, Sasanka Roy:
Approximation Algorithms for Shortest Descending Paths in Terrains. CoRR abs/0805.1401 (2008) - [i9]Mustaq Ahmed, Anna Lubiw:
Shortest Paths Avoiding Forbidden Subpaths. CoRR abs/0807.0807 (2008) - [i8]Krishnam Raju Jampani, Anna Lubiw:
The Simultaneous Membership Problem for Chordal, Comparability and Permutation graphs. CoRR abs/0811.4007 (2008) - 2007
- [j27]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. Comput. Geom. 36(2): 117-130 (2007) - [c42]Anna Lubiw:
Morphing Planar Graph Drawings. CCCG 2007: 1 - [c41]Peter Brass, Ferran Hurtado, Benjamin J. Lafreniere, Anna Lubiw:
A Lower Bound on the Area of a 3-Coloured Disc Packing. CCCG 2007: 101-104 - [c40]Stephen Bahun, Anna Lubiw:
Optimal Schedules for 2-guard Room Search. CCCG 2007: 245-248 - [c39]Therese Biedl, Anna Lubiw, Michael J. Spriggs:
Cauchy's Theorem and Edge Lengths of Convex Polyhedra. WADS 2007: 398-409 - [i7]Mustaq Ahmed, Anna Lubiw:
An Approximation Algorithm for Shortest Descending Paths. CoRR abs/0705.1364 (2007) - 2006
- [j26]Alon Efrat, Stephen G. Kobourov, Anna Lubiw:
Computing homotopic shortest paths efficiently. Comput. Geom. 35(3): 162-172 (2006) - [c38]Mustaq Ahmed, Anna Lubiw:
Shortest Descending Paths through Given Faces. CCCG 2006 - [c37]Anna Lubiw, Mark Petrick, Michael J. Spriggs:
Morphing orthogonal planar graph drawings. SODA 2006: 222-230 - 2005
- [j25]Therese Biedl, Anna Lubiw, Julie Sun:
When can a net fold to a polyhedron? Comput. Geom. 31(3): 207-218 (2005) - [c36]Therese Biedl, Anna Lubiw, Michael J. Spriggs:
Morphing Polyhedra Preserving Face Normals: A Counterexample. CCCG 2005: 109-112 - [c35]Therese Biedl, Anna Lubiw, Michael J. Spriggs:
Morphing Planar Graphs While Preserving Edge Directions. GD 2005: 13-24 - 2004
- [c34]Anna Lubiw, Luke Tanur:
Pattern Matching in Polyphonic Music as a Weighted Geometric Translation Problem. ISMIR 2004 - [c33]Therese Biedl, Anna Lubiw, Michael J. Spriggs:
Angles and Lengths in Reconfigurations of Polygons and Polyhedra. MFCS 2004: 748-759 - 2003
- [j24]Claudia Iturriaga, Anna Lubiw:
Elastic labels around the perimeter of a map. J. Algorithms 47(1): 14-39 (2003) - [c32]Therese Biedl, Anna Lubiw, Michael J. Spriggs:
Parallel morphing of trees and cycles. CCCG 2003: 29-34 - [c31]Masud Hasan, Anna Lubiw:
Equiprojective Polyhedra. CCCG 2003: 47-50 - [c30]Moshe Dror, Alon Efrat, Anna Lubiw, Joseph S. B. Mitchell:
Touring a sequence of polygons. STOC 2003: 473-482 - [c29]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. WADS 2003: 243-255 - 2002
- [j23]Prosenjit Bose, Anna Lubiw, J. Ian Munro:
Efficient visibility queries in simple polygons. Comput. Geom. 23(3): 313-335 (2002) - [j22]Therese 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. Discret. Appl. Math. 117(1-3): 293-297 (2002) - [j21]Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Joseph O'Rourke:
Enumerating Foldings and Unfoldings Between Polygons and Polytopes. Graphs Comb. 18(1): 93-104 (2002) - [j20]Giuseppe Di Battista, Giuseppe Liotta, Anna Lubiw, Sue Whitesides:
Embedding problems for paths with direction constrained edges. Theor. Comput. Sci. 289(2): 897-917 (2002) - [c28]Alon Efrat, Stephen G. Kobourov, Anna Lubiw:
Computing Homotopic Shortest Paths Efficiently. ESA 2002: 411-423 - [i6]Alon Efrat, Stephen G. Kobourov, Anna Lubiw:
Computing Homotopic Shortest Paths Efficiently. CoRR cs.CG/0204050 (2002) - 2001
- [j19]Therese 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. Discret. Comput. Geom. 26(3): 269-281 (2001) - [j18]Therese C. Biedl, Prosenjit Bose, Erik D. Demaine, Anna Lubiw:
Efficient Algorithms for Petersen's Matching Theorem. J. Algorithms 38(1): 110-134 (2001) - [c27]Erik D. Demaine, Martin L. Demaine, Anna Lubiw:
The cccg 2001 logo. CCCG 2001 - [i5]Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Joseph O'Rourke:
Enumerating Foldings and Unfoldings between Polygons and Polytopes. CoRR cs.CG/0107024 (2001) - 2000
- [c26]Giuseppe Di Battista, Giuseppe Liotta, Anna Lubiw, Sue Whitesides:
Embedding Problems for Paths with Direction Constrained Edges. COCOON 2000: 64-73 - [c25]Giuseppe Di Battista, Giuseppe Liotta, Anna Lubiw, Sue Whitesides:
Orthogonal Drawings of Cycles in 3D Space (Extended Abstract). GD 2000: 272-283 - [i4]Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Joseph O'Rourke:
Examples, Counterexamples, and Enumeration Results for Foldings and Unfoldings between Polygons and Polytopes. CoRR cs.CG/0007019 (2000)
1990 – 1999
- 1999
- [c24]Therese Biedl, Anna Lubiw, Julie Sun:
When can a net fold to a polyhedron. CCCG 1999 - [c23]Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Joseph O'Rourke, Irena Pashchenko:
Metamorphosis of the Cube. SCG 1999: 409-410 - [c22]Therese C. Biedl, Prosenjit Bose, Erik D. Demaine, Anna Lubiw:
Efficient Algorithms for Petersen's Matching Theorem. SODA 1999: 130-139 - [c21]Therese 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. SODA 1999: 866-867 - [c20]Erik D. Demaine, Martin L. Demaine, Anna Lubiw:
Folding and One Straight Cut Suffice. SODA 1999: 891-892 - [c19]Claudia Iturriaga, Anna Lubiw:
Elastic Labels Around the Perimeter of a Map. WADS 1999: 306-317 - [i3]Therese 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. CoRR cs.CG/9910009 (1999) - [i2]Therese 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. CoRR cs.CG/9910024 (1999) - 1998
- [j17]Giuseppe Liotta, Anna Lubiw, Henk Meijer, Sue Whitesides:
The rectangle of influence drawability problem. Comput. Geom. 10(1): 1-22 (1998) - [j16]Prosenjit Bose, Jonathan F. Buss, Anna Lubiw:
Pattern Matching for Permutations. Inf. Process. Lett. 65(5): 277-283 (1998) - [j15]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. J. Graph Algorithms Appl. 2(3): 1-16 (1998) - [c18]Therese 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. CCCG 1998 - [c17]Therese 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. CCCG 1998 - [c16]Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Godfried T. Toussaint:
Hiding disks in folded polygons. CCCG 1998 - [c15]Claudia Iturriaga, Anna Lubiw:
Elastic Labels on the Perimeter of a Rectangle. GD 1998: 451-453 - [c14]Erik D. Demaine, Martin L. Demaine, Anna Lubiw:
Folding and Cutting Paper. JCDCG 1998: 104-118 - [i1]Therese 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. CoRR cs.CG/9811019 (1998) - 1997
- [j14]Paul Colley, Anna Lubiw, Jeremy P. Spinrad:
Visibility Graphs of Towers. Comput. Geom. 7: 161-172 (1997) - [j13]Prosenjit Bose, Leonidas J. Guibas, Anna Lubiw, Mark H. Overmars, Diane L. Souvaine, Jorge Urrutia:
The Floodlight Problem. Int. J. Comput. Geom. Appl. 7(1/2): 153-163 (1997) - [c13]Claudia Iturriaga, Anna Lubiw:
Elastic Labels: the Two-Axis Case. GD 1997: 181-192 - 1996
- [j12]Michael D. Hutton, Anna Lubiw:
Upward Planning of Single-Source Acyclic Digraphs. SIAM J. Comput. 25(2): 291-311 (1996) - 1994
- [j11]Dieter Kratsch, Peter Damaschke, Anna Lubiw:
Dominating cliques in chordal graphs. Discret. Math. 128(1-3): 269-275 (1994) - [c12]Anna Lubiw, Naji Mouawad:
Interval Graphs as Visibility Graphs of Simple Polygons Part 1: Parachutes. CCCG 1994: 18-23 - [c11]Hossam A. ElGindy, Giuseppe Liotta, Anna Lubiw, Henk Meijer, Sue Whitesides:
Recognizing Rectangle of Influence Drawable Graphs. GD 1994: 352-363 - 1993
- [c10]Anna Lubiw, Nora Sleumer:
Maximal Outerplanar Graphs Are Relative Neighbourhood Graphs. CCCG 1993: 198-203 - [c9]Hazel Everett, Anna Lubiw, Joseph O'Rourke:
Recovery of Convex Hulls From External Visibility Graphs. CCCG 1993: 309-314 - [c8]Prosenjit Bose, Leonidas J. Guibas, Anna Lubiw, Mark H. Overmars, Diane L. Souvaine, Jorge Urrutia:
The Floodlight Problem. CCCG 1993: 399-404 - [c7]Prosenjit Bose, Jonathan F. Buss, Anna Lubiw:
Pattern Matching for Permutations. WADS 1993: 200-209 - 1992
- [j10]Collette R. Coullard, Anna Lubiw:
Distance visibility graphs. Int. J. Comput. Geom. Appl. 2(4): 349-362 (1992) - 1991
- [j9]Anna Lubiw, András Rácz:
A Lower Bound for the Integer Element Distinctness Problem. Inf. Comput. 94(1): 83-92 (1991) - [j8]Anna Lubiw:
Short-chorded and perfect graphs. J. Comb. Theory B 51(1): 24-33 (1991) - [j7]Anna Lubiw:
A weighted min-max relation for intervals. J. Comb. Theory B 53(2): 151-172 (1991) - [j6]Jan Kratochvíl, Anna Lubiw, Jaroslav Nesetril:
Noncrossing Subgraphs in Topological Layouts. SIAM J. Discret. Math. 4(2): 223-244 (1991) - [c6]Collette R. Coullard, Anna Lubiw:
Distance Visibility Graphs. SCG 1991: 289-296 - [c5]Michael D. Hutton, Anna Lubiw:
Upward Planar Drawing of Single Source Acyclic Digraphs. Planar Graphs 1991: 41-57 - [c4]Michael D. Hutton, Anna Lubiw:
Upward Planar Drawing of Single Source Acyclic Digraphs. SODA 1991: 203-211 - 1990
- [j5]Anna Lubiw:
Counterexample to a Conjecture of Szymanski on Hypercube Routing. Inf. Process. Lett. 35(2): 57-61 (1990) - [j4]Anna Lubiw:
The Boolean Basis Problem and How to Cover Some Polygons by Rectangles. SIAM J. Discret. Math. 3(1): 98-115 (1990)
1980 – 1989
- 1988
- [j3]Anna Lubiw:
A note on odd/even cycles. Discret. Appl. Math. 22(1): 87-92 (1988) - 1987
- [j2]Anna Lubiw:
Doubly Lexical Orderings of Matrices. SIAM J. Comput. 16(5): 854-879 (1987) - 1986
- [b1]Anna Lubiw:
Orderings and some combinatorial optimization problems with geometric applications. University of Toronto, Canada, 1986 - 1985
- [c3]Anna Lubiw:
Decomposing polygonal regions into convex quadrilaterals. SCG 1985: 97-106 - [c2]Anna Lubiw:
Doubly Lexical Orderings of Matrices. STOC 1985: 396-404 - 1981
- [j1]Anna Lubiw:
Some NP-Complete Problems Similar to Graph Isomorphism. SIAM J. Comput. 10(1): 11-21 (1981) - [c1]G. Sakauye, Anna Lubiw, J. Royle, R. Epplett, Jeffrey Tweedale, E. S. Y. Shew, E. Attfield, Franc Brglez, Philip S. Wilcox:
A set of programs for MOS design. DAC 1981: 435-442
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-30 21:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
