| 2012 | ||
|---|---|---|
| 104 | Giuseppe Di Battista, Ethan Kim, Giuseppe Liotta, Anna Lubiw, Sue Whitesides: The Shape of Orthogonal Cycles in Three Dimensions. Discrete & Computational Geometry 47(3): 461-491 (2012) | |
| 2011 | ||
| 103 | 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 | |
| 102 | Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Anna Lubiw, Andrew Winslow: Algorithms for Solving Rubik's Cubes. ESA 2011: 689-700 | |
| 101 | Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Anna Lubiw, Andrew Winslow: Algorithms for Solving Rubik's Cubes CoRR abs/1106.5736: (2011) | |
| 100 | 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) | |
| 99 | Mustaq Ahmed, Anna Lubiw: Shortest Descending Paths: towards an Exact Algorithm. Int. J. Comput. Geometry Appl. 21(4): 431-466 (2011) | |
| 98 | Anna Lubiw, Mark Petrick: Morphing Planar Graph Drawings with Bent Edges. J. Graph Algorithms Appl. 15(2): 205-227 (2011) | |
| 2010 | ||
| 97 | Anna Lubiw, Erik D. Demaine, Martin L. Demaine, Arlo Shallit, Jonah Shallit: Zipper unfoldings of polyhedral complexes. CCCG 2010: 219-222 | |
| 96 | Gill Barequet, Nadia 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 | |
| 95 | Brad Ballinger, Nadia 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 | |
| 94 | Krishnam Raju Jampani, Anna Lubiw: Simultaneous Interval Graphs. ISAAC (1) 2010: 206-217 | |
| 93 | Bernhard Haeupler, Krishnam Raju Jampani, Anna Lubiw: Testing Simultaneous Planarity When the Common Graph Is 2-Connected. ISAAC (2) 2010: 410-421 | |
| 92 | Krishnam Raju Jampani, Anna Lubiw: Simultaneous Interval Graphs CoRR abs/1009.3502: (2010) | |
| 91 | Bernhard Haeupler, Krishnam Raju Jampani, Anna Lubiw: Testing Simultaneous Planarity when the Common Graph is 2-Connected CoRR abs/1009.4517: (2010) | |
| 90 | Peter Brass, Ferran Hurtado, Benjamin J. Lafreniere, Anna Lubiw: A Lower Bound on the Area of a 3-Coloured Disk Packing. Int. J. Comput. Geometry Appl. 20(3): 341-360 (2010) | |
| 89 | 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) | |
| 2009 | ||
| 88 | Mustaq Ahmed, Anna Lubiw: Shortest Paths Avoiding Forbidden Subpaths. STACS 2009: 63-74 | |
| 87 | Krishnam Raju Jampani, Anna Lubiw: The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs. WADS 2009: 387-398 | |
| 86 | Mustaq Ahmed, Anna Lubiw, Anil Maheshwari: Shortest Gently Descending Paths. WALCOM 2009: 59-70 | |
| 85 | Therese C. Biedl, Anna Lubiw, Michael J. Spriggs: Morphing polyhedra with parallel faces: Counterexamples. Comput. Geom. 42(5): 395-402 (2009) | |
| 84 | Mustaq Ahmed, Anna Lubiw: Shortest descending paths through given faces. Comput. Geom. 42(5): 464-470 (2009) | |
| 2008 | ||
| 83 | Mina Razaghpour, Anna Lubiw: The Steiner Ratio for Obstacle-Avoiding Rectilinear Steiner Trees. CCCG 2008 | |
| 82 | 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 | |
| 81 | 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) | |
| 80 | 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) | |
| 79 | Mustaq Ahmed, Anna Lubiw: Shortest Paths Avoiding Forbidden Subpaths CoRR abs/0807.0807: (2008) | |
| 78 | Krishnam Raju Jampani, Anna Lubiw: The Simultaneous Membership Problem for Chordal, Comparability and Permutation graphs CoRR abs/0811.4007: (2008) | |
| 77 | Masud Hasan, Anna Lubiw: Equiprojective polyhedra. Comput. Geom. 40(2): 148-155 (2008) | |
| 76 | Anna Lubiw, Mark Petrick: Morphing Planar Graph Drawings with Bent Edges. Electronic Notes in Discrete Mathematics 31: 45-48 (2008) | |
| 2007 | ||
| 75 | Anna Lubiw: Morphing Planar Graph Drawings. CCCG 2007: 1 | |
| 74 | 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 | |
| 73 | Stephen Bahun, Anna Lubiw: Optimal Schedules for 2-guard Room Search. CCCG 2007: 245-248 | |
| 72 | Therese C. Biedl, Anna Lubiw, Michael J. Spriggs: Cauchy's Theorem and Edge Lengths of Convex Polyhedra. WADS 2007: 398-409 | |
| 71 | Mustaq Ahmed, Anna Lubiw: An Approximation Algorithm for Shortest Descending Paths CoRR abs/0705.1364: (2007) | |
| 70 | 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) | |
| 2006 | ||
| 69 | Mustaq Ahmed, Anna Lubiw: Shortest Descending Paths through Given Faces. CCCG 2006 | |
| 68 | Anna Lubiw, Mark Petrick, Michael J. Spriggs: Morphing orthogonal planar graph drawings. SODA 2006: 222-230 | |
| 67 | Alon Efrat, Stephen G. Kobourov, Anna Lubiw: Computing homotopic shortest paths efficiently. Comput. Geom. 35(3): 162-172 (2006) | |
| 2005 | ||
| 66 | Therese C. Biedl, Anna Lubiw, Michael J. Spriggs: Morphing Polyhedra Preserving Face Normals: A Counterexample. CCCG 2005: 109-112 | |
| 65 | Therese C. Biedl, Anna Lubiw, Michael J. Spriggs: Morphing Planar Graphs While Preserving Edge Directions. Graph Drawing 2005: 13-24 | |
| 64 | Therese C. Biedl, Anna Lubiw, Julie Sun: When can a net fold to a polyhedron? Comput. Geom. 31(3): 207-218 (2005) | |
| 2004 | ||
| 63 | Anna Lubiw, Luke Tanur: Pattern Matching in Polyphonic Music as a Weighted Geometric Translation Problem. ISMIR 2004 | |
| 62 | Therese C. Biedl, Anna Lubiw, Michael J. Spriggs: Angles and Lengths in Reconfigurations of Polygons and Polyhedra. MFCS 2004: 748-759 | |
| 2003 | ||
| 61 | Therese C. Biedl, Anna Lubiw, Michael J. Spriggs: Parallel morphing of trees and cycles. CCCG 2003: 29-34 | |
| 60 | Masud Hasan, Anna Lubiw: Equiprojective Polyhedra. CCCG 2003: 47-50 | |
| 59 | Moshe Dror, Alon Efrat, Anna Lubiw, Joseph S. B. Mitchell: Touring a sequence of polygons. STOC 2003: 473-482 | |
| 58 | 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 | |
| 57 | Claudia Iturriaga, Anna Lubiw: Elastic labels around the perimeter of a map. J. Algorithms 47(1): 14-39 (2003) | |
| 2002 | ||
| 56 | Alon Efrat, Stephen G. Kobourov, Anna Lubiw: Computing Homotopic Shortest Paths Efficiently. ESA 2002: 411-423 | |
| 55 | Alon Efrat, Stephen G. Kobourov, Anna Lubiw: Computing Homotopic Shortest Paths Efficiently CoRR cs.CG/0204050: (2002) | |
| 54 | Prosenjit Bose, Anna Lubiw, J. Ian Munro: Efficient visibility queries in simple polygons. Comput. Geom. 23(3): 313-335 (2002) | |
| 53 | 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. Discrete Applied Mathematics 117(1-3): 293-297 (2002) | |
| 52 | Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Joseph O'Rourke: Enumerating Foldings and Unfoldings Between Polygons and Polytopes. Graphs and Combinatorics 18(1): 93-104 (2002) | |
| 51 | 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) | |
| 2001 | ||
| 50 | Erik D. Demaine, Martin L. Demaine, Anna Lubiw: The cccg 2001 logo. CCCG 2001 | |
| 49 | Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Joseph O'Rourke: Enumerating Foldings and Unfoldings between Polygons and Polytopes CoRR cs.CG/0107024: (2001) | |
| 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. Discrete & Computational Geometry 26(3): 269-281 (2001) | |
| 47 | Therese C. Biedl, Prosenjit Bose, Erik D. Demaine, Anna Lubiw: Efficient Algorithms for Petersen's Matching Theorem. J. Algorithms 38(1): 110-134 (2001) | |
| 2000 | ||
| 46 | Giuseppe Di Battista, Giuseppe Liotta, Anna Lubiw, Sue Whitesides: Embedding Problems for Paths with Direction Constrained Edges. COCOON 2000: 64-73 | |
| 45 | Giuseppe Di Battista, Giuseppe Liotta, Anna Lubiw, Sue Whitesides: Orthogonal Drawings of Cycles in 3D Space (Extended Abstract). Graph Drawing 2000: 272-283 | |
| 44 | 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) | |
| 1999 | ||
| 43 | Therese C. Biedl, Anna Lubiw, Julie Sun: When can a net fold to a polyhedron. CCCG 1999 | |
| 42 | Therese C. Biedl, Prosenjit Bose, Erik D. Demaine, Anna Lubiw: Efficient Algorithms for Petersen's Matching Theorem. SODA 1999: 130-139 | |
| 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 3D. SODA 1999: 866-867 | |
| 40 | Erik D. Demaine, Martin L. Demaine, Anna Lubiw: Folding and One Straight Cut Suffice. SODA 1999: 891-892 | |
| 39 | Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Joseph O'Rourke, Irena Pashchenko: Metamorphosis of the Cube. Symposium on Computational Geometry 1999: 409-410 | |
| 38 | Claudia Iturriaga, Anna Lubiw: Elastic Labels Around the Perimeter of a Map. WADS 1999: 306-317 | |
| 37 | 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 CoRR cs.CG/9910009: (1999) | |
| 36 | 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 CoRR cs.CG/9910024: (1999) | |
| 1998 | ||
| 35 | Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Godfried T. Toussaint: Hiding disks in folded polygons. CCCG 1998 | |
| 34 | 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. CCCG 1998 | |
| 33 | 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. CCCG 1998 | |
| 32 | Claudia Iturriaga, Anna Lubiw: Elastic Labels on the Perimeter of a Rectangle. Graph Drawing 1998: 451-453 | |
| 31 | Erik D. Demaine, Martin L. Demaine, Anna Lubiw: Folding and Cutting Paper. JCDCG 1998: 104-118 | |
| 30 | 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 CoRR cs.CG/9811019: (1998) | |
| 29 | Giuseppe Liotta, Anna Lubiw, Henk Meijer, Sue Whitesides: The rectangle of influence drawability problem. Comput. Geom. 10(1): 1-22 (1998) | |
| 28 | Prosenjit Bose, Jonathan F. Buss, Anna Lubiw: Pattern Matching for Permutations. Inf. Process. Lett. 65(5): 277-283 (1998) | |
| 27 | 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(2): (1998) | |
| 1997 | ||
| 26 | Claudia Iturriaga, Anna Lubiw: Elastic Labels: the Two-Axis Case. Graph Drawing 1997: 181-192 | |
| 25 | Paul Colley, Anna Lubiw, Jeremy Spinrad: Visibility Graphs of Towers. Comput. Geom. 7: 161-172 (1997) | |
| 24 | Prosenjit Bose, Leonidas J. Guibas, Anna Lubiw, Mark H. Overmars, Diane L. Souvaine, Jorge Urrutia: The Floodlight Problem. Int. J. Comput. Geometry Appl. 7(1/2): 153-163 (1997) | |
| 1996 | ||
| 23 | Michael D. Hutton, Anna Lubiw: Upward Planning of Single-Source Acyclic Digraphs. SIAM J. Comput. 25(2): 291-311 (1996) | |
| 1994 | ||
| 22 | Anna Lubiw, Naji Mouawad: Interval Graphs as Visibility Graphs of Simple Polygons Part 1: Parachutes. CCCG 1994: 18-23 | |
| 21 | Hossam A. ElGindy, Giuseppe Liotta, Anna Lubiw, Henk Meijer, Sue Whitesides: Recognizing Rectangle of Influence Drawable Graphs. Graph Drawing 1994: 352-363 | |
| 20 | Dieter Kratsch, Peter Damaschke, Anna Lubiw: Dominating cliques in chordal graphs. Discrete Mathematics 128(1-3): 269-275 (1994) | |
| 1993 | ||
| 19 | Anna Lubiw, Nora Sleumer: Maximal Outerplanar Graphs Are Relative Neighbourhood Graphs. CCCG 1993: 198-203 | |
| 18 | Hazel Everett, Anna Lubiw, Joseph O'Rourke: Recovery of Convex Hulls From External Visibility Graphs. CCCG 1993: 309-314 | |
| 17 | Prosenjit Bose, Leonidas J. Guibas, Anna Lubiw, Mark H. Overmars, Diane L. Souvaine, Jorge Urrutia: The Floodlight Problem. CCCG 1993: 399-404 | |
| 16 | Prosenjit Bose, Jonathan F. Buss, Anna Lubiw: Pattern Matching for Permutations. WADS 1993: 200-209 | |
| 1992 | ||
| 15 | Collette R. Coullard, Anna Lubiw: Distance visibility graphs. Int. J. Comput. Geometry Appl. 2(4): 349-362 (1992) | |
| 1991 | ||
| 14 | Michael D. Hutton, Anna Lubiw: Upward Planar Drawing of Single Source Acyclic Digraphs. SODA 1991: 203-211 | |
| 13 | Collette R. Coullard, Anna Lubiw: Distance Visibility Graphs. Symposium on Computational Geometry 1991: 289-296 | |
| 12 | Anna Lubiw, András Rácz: A Lower Bound for the Integer Element Distinctiveness Problem Inf. Comput. 94(1): 83-92 (1991) | |
| 11 | Anna Lubiw: Short-chorded and perfect graphs. J. Comb. Theory, Ser. B 51(1): 24-33 (1991) | |
| 10 | Anna Lubiw: A weighted min-max relation for intervals. J. Comb. Theory, Ser. B 53(2): 151-172 (1991) | |
| 9 | Jan Kratochvíl, Anna Lubiw, Jaroslav Nesetril: Noncrossing Subgraphs in Topological Layouts. SIAM J. Discrete Math. 4(2): 223-244 (1991) | |
| 1990 | ||
| 8 | Anna Lubiw: Counterexample to a Conjecture of Szymanski on Hypercube Routing. Inf. Process. Lett. 35(2): 57-61 (1990) | |
| 7 | Anna Lubiw: The Boolean Basis Problem and How to Cover Some Polygons by Rectangles. SIAM J. Discrete Math. 3(1): 98-115 (1990) | |
| 1988 | ||
| 6 | Anna Lubiw: A note on odd/even cycles. Discrete Applied Mathematics 22(1): 87-92 (1988) | |
| 1987 | ||
| 5 | Anna Lubiw: Doubly Lexical Orderings of Matrices. SIAM J. Comput. 16(5): 854-879 (1987) | |
| 1985 | ||
| 4 | Anna Lubiw: Doubly Lexical Orderings of Matrices STOC 1985: 396-404 | |
| 3 | Anna Lubiw: Decomposing polygonal regions into convex quadrilaterals. Symposium on Computational Geometry 1985: 97-106 | |
| 1981 | ||
| 2 | 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 | |
| 1 | Anna Lubiw: Some NP-Complete Problems Similar to Graph Isomorphism. SIAM J. Comput. 10(1): 11-21 (1981) | |
Colors in the list of coauthors
Last update Fri May 25 01:42:58 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page