conv-vis inproceedings computational-geometry:visibility Convexifying Polygons Without Losing Visibilities 2011 Proc. 22nd Canadian Conference on Computational Geometry (CCCG) http://2011.cccg.ca/PDFschedule/papers/paper70.pdf 2011 2040647 inproceedings other-algorithms Algorithms for solving Rubik's cubes Berlin, Heidelberg Saarbr\"{u}cken, Germany 689--700 978-3-642-23718-8 2011 ESA'11: Proceedings of the 19th European conference on Algorithms http://dx.doi.org/10.1007/978-3-642-23719-5_58 http://arxiv.org/abs/1106.5736 Springer-Verlag 2011 DBLP:journals/comgeo/DurocherJLN11 article Comput. Geom. computational-geometry Modelling gateway placement in wireless networks: Geometric k-centres of unit disc graphs 286-302 44 2011 5 http://dx.doi.org/10.1016/j.comgeo.2010.12.003 2011 DBLP:journals/ijcga/AhmedL11 article Int. J. Comput. Geometry Appl. computational-geometry:shortest-paths Shortest Descending Paths: towards an Exact Algorithm 431-466 21 2011 4 http://dx.doi.org/10.1142/S0218195911003755 2011 DBLP:journals/jgaa/LubiwP11 article J. Graph Algorithms Appl. geometric-graphs:morphing Morphing Planar Graph Drawings with Bent Edges 205-227 15 2011 2 http://jgaa.info/accepted/2011/LubiwPetrick2011.15.2.pdf 2011 sim-planar inproceedings Lecture Notes in Computer Science geometric-graphs:simultaneous Cheong, Otfried and Chwa, Kyung-Yong and Park, Kunsoo Testing Simultaneous Planarity When the Common Graph Is 2-Connected 410-421 6507 2010 21st International Symposium on Algorithms and Computation, ISAAC 2010 http://arxiv.org/abs/1009.4517 http://dx.doi.org/10.1007/978-3-642-17514-5_35 Springer 2010 jampani2010simultaneous inproceedings Lecture Notes in Computer Science geometric-graphs:simultaneous Cheong, Otfried and Chwa, Kyung-Yong and Park, Kunsoo Simultaneous interval graphs 206--217 6507 2010 21st International Symposium on Algorithms and Computation, ISAAC 2010 http://arxiv.org/abs/1009.3502 http://dx.doi.org/10.1007/978-3-642-17517-6_20 Springer 2010 1940425 inproceedings computational-geometry Coverage with k-transmitters in the presence of obstacles Berlin, Heidelberg Kailua-Kona, HI, USA 1--15 3-642-17460-4, 978-3-642-17460-5 2010 COCOA'10: Proceedings of the 4th international conference on Combinatorial optimization and applications http://dx.doi.org/10.1007/978-3-642-17461-2_1 Springer-Verlag 2010 zipper inproceedings computational-geometry:folding Zipper unfoldings of polyhedral complexes 219--222 2010 Proc. 22nd Canadian Conference on Computational Geometry (CCCG) http://cccg.ca/proceedings/2010/paper58.pdf 2010 bounded inproceedings computational-geometry Bounded-Degree Polyhedronization of Point Sets Proc. 22nd Canadian Conference on Computational Geometry (CCCG) 2010 http://cccg.ca/proceedings/2010/paper28.pdf 2010 DBLP:journals/ijcga/BrassHLL10 article Int. J. Comput. Geometry Appl. computational-geometry A Lower Bound on the Area of a 3-Coloured Disk Packing 341-360 20 2010 3 http://arxiv.org/abs/0804.1173 http://dx.doi.org/10.1142/S0218195910003335 2010 1750686 article 1570-8667 214--230 2 http://arxiv.org/abs/0805.1401 Elsevier Science Publishers B. V. J. of Discrete Algorithms Approximation algorithms for shortest descending paths in terrains computational-geometry:shortest-paths Amsterdam, The Netherlands, The Netherlands 8 2010 http://dx.doi.org/10.1016/j.jda.2009.05.001 2010 1604461 inproceedings geometric-graphs:simultaneous The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs Berlin, Heidelberg 387--398 978-3-642-03366-7 2009 WADS '09: Proceedings of the 11th International Symposium on Algorithms and Data Structures http://dx.doi.org/10.1007/978-3-642-03367-4_34 Springer-Verlag 2009 DBLP:conf/stacs/AhmedL09 inproceedings LIPIcs computational-geometry:shortest-paths Susanne Albers and Jean-Yves Marion Shortest Paths Avoiding Forbidden Subpaths 63-74 3 2009 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009 http://arxiv.org/abs/0807.0807 http://dx.doi.org/10.4230/LIPIcs.STACS.2009.1831 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany 2009 1519564 article Comput. Geom. Theory Appl. computational-geometry:shortest-paths Shortest descending paths through given faces 0925-7721 Amsterdam, The Netherlands, The Netherlands 464--470 42 2009 5 http://dx.doi.org/10.1016/j.comgeo.2007.10.011 Elsevier Science Publishers B. V. 2009 1519573 article Comput. Geom. Theory Appl. geometric-graphs:morphing Morphing polyhedra with parallel faces: Counterexamples 0925-7721 Amsterdam, The Netherlands, The Netherlands 395--402 42 2009 5 http://dx.doi.org/10.1016/j.comgeo.2008.09.006 Elsevier Science Publishers B. V. 2009 1507102 inproceedings computational-geometry:shortest-paths Shortest Gently Descending Paths Berlin, Heidelberg Kolkata, India 59--70 978-3-642-00201-4 2009 WALCOM '09: Proceedings of the 3rd International Workshop on Algorithms and Computation http://dx.doi.org/10.1007/978-3-642-00202-1_6 Springer-Verlag 2009 ahmed2008shortest inproceedings computational-geometry:shortest-paths Shortest anisotropic paths with few bends is NP-complete 28--29 2008 Abstracts from the 18th Annual Fall Workshop on Computational Geometry 2008 DBLP:journals/endm/LubiwP08 article Electronic Notes in Discrete Mathematics geometric-graphs:morphing Morphing Planar Graph Drawings with Bent Edges 45-48 31 2008 http://dx.doi.org/10.1016/j.endm.2008.06.007 2008 DBLP:conf/cccg/RazaghpourL08 inproceedings computational-geometry The Steiner Ratio for Obstacle-Avoiding Rectilinear Steiner Trees 2008 Proceedings of the 20th Annual Canadian Conference on Computational Geometry, CCCG http://cccg.ca/proceedings/2008/paper38full.pdf 2008 1400879 inproceedings computational-geometry Modelling gateway placement in wireless networks: geometric k-centres of unit disc graphs New York, NY, USA Toronto, Canada 79--86 978-1-60558-244-3 2008 DIALM-POMC '08: Proceedings of the fifth international workshop on Foundations of mobile computing http://doi.acm.org/10.1145/1400863.1400879 ACM 2008 1350025 article Comput. Geom. Theory Appl. computational-geometry Equiprojective polyhedra 0925-7721 Amsterdam, The Netherlands, The Netherlands 148--155 40 2008 2 http://dx.doi.org/10.1016/j.comgeo.2007.05.002 Elsevier Science Publishers B. V. 2008 DBLP:conf/cccg/Lubiw07 inproceedings geometric-graphs:morphing Morphing Planar Graph Drawings 1 2007 Proceedings of the 19th Annual Canadian Conference on Computational Geometry (CCCG) http://cccg.ca/proceedings/2007/001.pdf 2007 DBLP:conf/cccg/BrassHLL07 inproceedings computational-geometry A Lower Bound on the Area of a 3-Coloured Disc Packing 101-104 2007 Proceedings of the 19th Annual Canadian Conference on Computational Geometry (CCCG) http://cccg.ca/proceedings/2007/04b3.pdf 2007 ahmed2007properties inproceedings computational-geometry:shortest-paths Properties of shortest descending paths 2007 Abstracts from the 17th Annual Fall Workshop on Computational Geometry 2007 DBLP:conf/cccg/BahunL07 inproceedings computational-geometry Optimal Schedules for 2-guard Room Search 245-248 2007 Proceedings of the 19th Annual Canadian Conference on Computational Geometry, CCCG 2007 http://www.cs.uwaterloo.ca/~alubiw/papers/guards.pdf 2007 DBLP:conf/wads/BiedlLS07 inproceedings Lecture Notes in Computer Science computational-geometry:folding Cauchy's Theorem and Edge Lengths of Convex Polyhedra 398-409 4619 2007 Algorithms and Data Structures, 10th International Workshop, WADS http://dx.doi.org/10.1007/978-3-540-73951-7_35 Springer 2007 DBLP:conf/cccg/AhmedL06 inproceedings computational-geometry:shortest-paths Shortest Descending Paths through Given Faces 2006 Proceedings of the 18th Annual Canadian Conference on Computational Geometry (CCCG) http://www.cs.queensu.ca/cccg/papers/cccg10.pdf 2006 1219199 article Comput. Geom. Theory Appl. geometric-graphs:simultaneous On simultaneous planar graph embeddings 0925-7721 Amsterdam, The Netherlands, The Netherlands 117--130 36 2007 2 http://dx.doi.org/10.1016/j.comgeo.2006.05.006 Elsevier Science Publishers B. V. 2007 1196087 article Comput. Geom. Theory Appl. computational-geometry:shortest-paths Computing homotopic shortest paths efficiently 0925-7721 Amsterdam, The Netherlands, The Netherlands 162--172 35 2006 3 http://dx.doi.org/10.1016/j.comgeo.2006.03.003 Elsevier Science Publishers B. V. 2006 1109583 inproceedings geometric-graphs:morphing Morphing orthogonal planar graph drawings New York, NY, USA Miami, Florida 222--230 0-89871-605-5 2006 SODA '06: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm http://doi.acm.org/10.1145/1109557.1109583 ACM 2006 local-overlaps inproceedings computational-geometry:folding Local Overlaps in Unfoldings of Polyhedra 2005 Abstracts from the 15th Annual Fall Workshop on Computational Geometry and Visualization http://www.cs.uwaterloo.ca/~alubiw/papers/localunf.pdf 2005 DBLP:conf/cccg/BiedlLS05 inproceedings geometric-graphs:morphing Morphing Polyhedra Preserving Face Normals: A Counterexample 109-112 2005 17th Canadian Conference on Computational Geometry (CCCG) http://www.cccg.ca/proceedings/2005/15.pdf 2005 DBLP:conf/gd/BiedlLS05 inproceedings Lecture Notes in Computer Science geometric-graphs:morphing Morphing Planar Graphs While Preserving Edge Directions 13-24 3843 2006 Graph Drawing, 13th International Symposium, GD 2005 http://dx.doi.org/10.1007/11618058_2 Springer 2006 1646553 article Comput. Geom. Theory Appl. computational-geometry:folding When can a net fold to a polyhedron? 207--218 31 2005 3 http://dx.doi.org/10.1016/j.comgeo.2004.12.004 Elsevier Science Publishers B. V. 2005 DBLP:conf/ismir/LubiwT04 inproceedings music-information-retrieval Pattern Matching in Polyphonic Music as a Weighted Geometric Translation Problem 2004 5th International Conference on Music Information Retrieval, ISMIR http://ismir2004.ismir.net/proceedings/p054-page-289-paper154.pdf 2004 DBLP:conf/mfcs/BiedlLS04 inproceedings Lecture Notes in Computer Science geometric-graphs:morphing Angles and Lengths in Reconfigurations of Polygons and Polyhedra 748-759 3153 2004 29th International Symposium on Mathematical Foundations of Computer Science, MFCS http://dx.doi.org/10.1007/978-3-540-28629-5_58 Springer 2004 DBLP:conf/cccg/BiedlLS03 inproceedings geometric-graphs:morphing Parallel morphing of trees and cycles 29-34 2003 15th Canadian Conference on Computational Geometry (CCCG) http://www.cccg.ca/proceedings/2003/20.pdf 2003 DBLP:conf/cccg/HasanL03 inproceedings computational-geometry Equiprojective Polyhedra 47-50 2003 15th Canadian Conference on Computational Geometry (CCCG) http://www.cccg.ca/proceedings/2003/33.pdf 2003 DBLP:conf/wads/BrassCDEEIKLM03 inproceedings Lecture Notes in Computer Science geometric-graphs:simultaneous On Simultaneous Planar Graph Embeddings 243-255 2748 2003 8th International Workshop on Algorithms and Data Structures (WADS) http://dx.doi.org/10.1007/978-3-540-45078-8_22 Springer 2003 780612 inproceedings computational-geometry:shortest-paths Touring a sequence of polygons New York, NY, USA San Diego, CA, USA 473--482 1-58113-674-9 2003 STOC '03: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing http://doi.acm.org/10.1145/780542.780612 ACM 2003 873974 article J. Algorithms map-labelling Elastic labels around the perimeter of a map 0196-6774 Duluth, MN, USA 14--39 47 2003 1 http://dx.doi.org/10.1016/S0196-6774(03)00004-X Academic Press, Inc. 2003 DBLP:conf/esa/EfratKL02 inproceedings Lecture Notes in Computer Science computational-geometry:shortest-paths Computing Homotopic Shortest Paths Efficiently 411-423 2461 2002 10th Annual European Symposium on Algorithms (ESA) http://dx.doi.org/10.1007/3-540-45749-6_38 Springer 2002 763206 article Comput. Geom. Theory Appl. computational-geometry:visibility Efficient visibility queries in simple polygons 0925-7721 Amsterdam, The Netherlands, The Netherlands 313--335 23 2002 3 http://dx.doi.org/10.1016/S0925-7721(01)00070-0 Elsevier Science Publishers B. V. 2002 DBLP:journals/dam/BiedlDDLLORSTW02 article Discrete Applied Mathematics computational-geometry:folding A note on reconfiguring tree linkages: trees can lock 293-297 117 2002 1-3 http://dx.doi.org/10.1016/S0166-218X(01)00229-3 2002 DBLP:journals/gc/DemaineDLO02 article Graphs and Combinatorics computational-geometry:folding Enumerating Foldings and Unfoldings Between Polygons and Polytopes 93-104 18 2002 1 http://dx.doi.org/10.1007/s003730200005 2002 638035 article Theor. Comput. Sci. geometric-graphs Embedding problems for paths with direction constrained edges 0304-3975 Essex, UK 897--917 289 2002 2 http://dx.doi.org/10.1016/S0304-3975(01)00408-X Elsevier Science Publishers Ltd. 2002 760488 inproceedings geometric-graphs Orthogonal Drawings of Cycles in 3D Space (Extended Abstract) London, UK, UK 272--283 3-540-41554-8 2001 GD '00: Proceedings of the 8th International Symposium on Graph Drawing http://dx.doi.org/10.1007/3-540-44541-2_26 Springer-Verlag 2001 702060 inproceedings geometric-graphs Embedding Problems for Paths with Direction Constrained Edges London, UK, UK 64--73 3-540-67787-9 2000 COCOON '00: Proceedings of the 6th Annual International Conference on Computing and Combinatorics http://dx.doi.org/10.1007/3-540-44968-X_7 Springer-Verlag 2000 DBLP:conf/soda/BiedlBDL99 inproceedings graph-algorithms DBLP:conf/soda/1999 Efficient Algorithms for Petersen's Matching Theorem DBLP, http://dblp.uni-trier.de 130-139 1999 Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) http://doi.acm.org/10.1145/314500.314544 1999 DBLP:conf/soda/BiedlDDLLOORSTW99 inproceedings computational-geometry:folding DBLP:conf/soda/1999 Locked and Unlocked Polygonal Chains in 3D DBLP, http://dblp.uni-trier.de 866-867 1999 Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) http://doi.acm.org/10.1145/314500.314977 1999 DBLP:conf/cccg/BiedlLS99 inproceedings computational-geometry:folding When can a net fold to a polyhedron 1999 CCCG http://www.cs.ubc.ca/conferences/CCCG/elec_proc/fp16.pdf 1999 673188 inproceedings map-labelling Elastic Labels Around the Perimeter of a Map London, UK, UK 306--317 3-540-66279-0 1999 WADS '99: Proceedings of the 6th International Workshop on Algorithms and Data Structures http://dx.doi.org/10.1007/3-540-48447-7_31 Springer-Verlag 1999 304995 inproceedings computational-geometry:folding Metamorphosis of the cube New York, NY, USA Miami Beach, Florida, United States 409--410 1-58113-068-6 1999 SCG '99: Proceedings of the fifteenth annual symposium on Computational geometry http://doi.acm.org/10.1145/304893.304995 ACM 1999 315072 inproceedings computational-geometry:folding Folding and one straight cut suffice Philadelphia, PA, USA Baltimore, Maryland, United States 891--892 0-89871-434-6 1999 SODA '99: Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms http://doi.acm.org/10.1145/314500.315072 Society for Industrial and Applied Mathematics 1999 DBLP:journals/dcg/BiedlDDLLOORSTW01 article Discrete {\&} Computational Geometry computational-geometry:folding Locked and Unlocked Polygonal Chains in Three Dimensions 269-281 26 2001 3 http://dx.doi.org/10.1007/s00454-001-0038-7 2001 DBLP:journals/jal/BiedlBDL01 article J. Algorithms graph-algorithms Efficient Algorithms for Petersen's Matching Theorem 110-134 38 2001 1 http://dx.doi.org/10.1006/jagm.2000.1132 2001 DBLP:journals/corr/cs-CG-0007019 article CoRR computational-geometry:folding Examples, Counterexamples, and Enumeration Results for Foldings and Unfoldings between Polygons and Polytopes cs.CG/0007019 2000 http://arxiv.org/abs/cs.CG/0007019 2000 686360 inproceedings computational-geometry:folding Folding and Cutting Paper London, UK, UK 104--118 3-540-67181-1 2000 JCDCG '98: Revised Papers from the Japanese Conference on Discrete and Computational Geometry http://dx.doi.org/10.1007/978-3-540-46515-7_9 Springer-Verlag 2000 BRIDGES99 inproceedings computational-geometry:folding Polyhedral Sculptures with Hyperbolic Paraboloids Ivars Peterson describes these results in his book,
Fragments of Infinity: A Kaleidoscope of Math and Art
, John Wiley & Sons, Inc., 2001, pages 79-80. Winfield, Kansas 91--100 10 pages July 30--August 1 1999 Proceedings of the 2nd Annual Conference of BRIDGES: Mathematical Connections in Art, Music, and Science (BRIDGES'99) http://erikdemaine.org/papers/BRIDGES99/paper.pdf http://www.sckans.edu/~bridges/ 1999-07 DBLP:conf/cccg/BiedlDDLOORW98 inproceedings computational-geometry:folding Unfolding some classes of orthogonal polyhedra 1998 Tenth Canadian Conference on Computational Geometry (CCCG) http://cgm.cs.mcgill.ca/cccg98/proceedings/cccg98-biedl-unfolding.ps.gz 1998 DBLP:conf/cccg/BiedlDDLLORSTW98 inproceedings computational-geometry:folding On reconfiguring tree linkages: Trees can lock DBLP, http://dblp.uni-trier.de 1998 Tenth Canadian Conference on Computational Geometry (CCCG) http://cgm.cs.mcgill.ca/cccg98/proceedings/cccg98-biedl-reconfiguring.ps.gz 1998 DBLP:conf/cccg/BiedlDDLT98 inproceedings computational-geometry:folding Hiding disks in folded polygons 1998 Tenth Canadian Conference on Computational Geometry (CCCG) http://cgm.cs.mcgill.ca/cccg98/proceedings/cccg98-biedl-hiding.ps.gz 1998 DBLP:journals/jgaa/BoseEFHLMRRSWZ98 article J. Graph Algorithms Appl. geometric-graphs A Visibility Representation for Graphs in Three Dimensions DBLP, http://dblp.uni-trier.de 2 1998 2 http://www.cs.brown.edu/publications/jgaa/accepted/98/Bose+a4-98.2.3.pdf 1998 729063 inproceedings map-labelling Elastic Labels on the Perimeter of a Rectangle London, UK, UK 451--453 3-540-65473-9 1998 GD '98: Proceedings of the 6th International Symposium on Graph Drawing http://dx.doi.org/10.1007/3-540-37623-2_42 Springer-Verlag 1998 DBLP:journals/comgeo/LiottaLMW98 article Comput. Geom. geometric-graphs The rectangle of influence drawability problem DBLP, http://dblp.uni-trier.de 1-22 10 1998 1 http://dx.doi.org/10.1016/S0925-7721(97)00018-7 1998 290438 article Inf. Process. Lett. other-algorithms Pattern matching for permutations 0020-0190 Amsterdam, The Netherlands, The Netherlands 277--283 65 1998 5 http://dx.doi.org/10.1016/S0020-0190(97)00209-3 Elsevier North-Holland, Inc. 1998 728905 inproceedings map-labelling Elastic Labels: the Two-Axis Case London, UK, UK 181--192 3-540-63938-1 1997 GD '97: Proceedings of the 5th International Symposium on Graph Drawing http://dx.doi.org/10.1007/3-540-63938-1_61 Springer-Verlag 1997 DBLP:journals/ijcga/BoseGLOSU97 article Int. J. Comput. Geometry Appl. computational-geometry The Floodlight Problem 153-163 7 1997 1/2 http://dx.doi.org/10.1142/S0218195997000090 1997 252151 article Comput. Geom. Theory Appl. computational-geometry:visibility Visibility graphs of towers 0925-7721 Amsterdam, The Netherlands, The Netherlands 161--172 7 1997 3 http://dx.doi.org/10.1016/0925-7721(95)00033-X Elsevier Science Publishers B. V. 1997 Lubiw96whencan techreport computational-geometry:folding When Can a Polygon Fold to a Polytope? 1996 ftp://cs.smith.edu/pub/orourke.papers/folding.ps.Z 1996 allouche1996convergents article ACTA ARITHMETICA-WARSZAWA- other Convergents of folded continued fractions 77--96 77 1996 THE INSTITUTE OF MATHEMATICS 1996 DBLP:conf/cccg/LubiwM94 inproceedings computational-geometry:visibility Interval Graphs as Visibility Graphs of Simple Polygons Part 1: Parachutes DBLP, http://dblp.uni-trier.de 18-23 1994 6th Canadian Conference on Computational Geometry (CCCG) 1994 586680 article SIAM J. Comput. geometric-graphs Upward Planar Drawing of Single-Source AcyclicDigraphs 0097-5397 Philadelphia, PA, USA 291--311 25 1996 2 http://dx.doi.org/10.1137/S0097539792235906 Society for Industrial and Applied Mathematics 1996 730922 inproceedings geometric-graphs Recognizing Rectangle of Influence Drawable Graphs London, UK, UK 352--363 3-540-58950-3 1995 GD '94: Proceedings of the DIMACS International Workshop on Graph Drawing http://dx.doi.org/10.1007/3-540-58950-3_390 Springer-Verlag 1995 179391 article Discrete Math. graph-algorithms Dominating cliques in chordal graphs 0012-365X Amsterdam, The Netherlands, The Netherlands 269--275 128 1994 1-3 http://dx.doi.org/10.1016/0012-365X(94)90118-X Elsevier Science Publishers B. V. 1994 DBLP:conf/cccg/EverettLO93 inproceedings computational-geometry:visibility Recovery of Convex Hulls From External Visibility Graphs DBLP, http://dblp.uni-trier.de 309-314 1993 5th Canadian Conference on Computational Geometry (CCCG) 1993 DBLP:conf/cccg/LubiwS93 inproceedings geometric-graphs Maximal Outerplanar Graphs Are Relative Neighbourhood Graphs 198-203 1993 5th Canadian Conference on Computational Geometry (CCCG) http://www.cs.uwaterloo.ca/~alubiw/papers/mop.pdf 1993 DBLP:conf/cccg/BoseGLOSU93 inproceedings computational-geometry The Floodlight Problem DBLP, http://dblp.uni-trier.de 399-404 1993 5th Canadian Conference on Computational Geometry (CCCG) 1993 672706 inproceedings other-algorithms Pattern Matching for Permutations London, UK, UK 200--209 3-540-57155-8 1993 WADS '93: Proceedings of the Third Workshop on Algorithms and Data Structures http://dx.doi.org/10.1007/3-540-57155-8_248 Springer-Verlag 1993 117593 article Inf. Comput. other A lower bound for the integer element distinctness problem 0890-5401 Duluth, MN, USA 83--92 94 1991 1 http://dx.doi.org/10.1016/0890-5401(91)90034-Y Academic Press, Inc. 1991 DBLP:journals/ijcga/CoullardL92 article Int. J. Comput. Geometry Appl. computational-geometry:visibility Distance visibility graphs DBLP, http://dblp.uni-trier.de 349-362 2 1992 4 http://dx.doi.org/10.1142/S0218195992000202 1992 DBLP:journals/jct/Lubiw91 article J. Comb. Theory, Ser. B combinatorial-optimization A weighted min-max relation for intervals 151-172 53 1991 2 http://dx.doi.org/10.1016/0095-8956(91)90073-S 1991 DBLP:conf/compgeom/CoullardL91 inproceedings computational-geometry:visibility Distance Visibility Graphs 289-296 1991 Symposium on Computational Geometry http://doi.acm.org/10.1145/109648.109681 1991 105821 article SIAM J. Discret. Math. geometric-graphs Noncrossing subgraphs in topological layouts 0895-4801 Philadelphia, PA, USA 223--244 4 1991 2 http://dx.doi.org/10.1137/0404022 Society for Industrial and Applied Mathematics 1991 127828 inproceedings geometric-graphs Upward planar drawing of single source acyclic digraphs Philadelphia, PA, USA San Francisco, California, United States 203--211 0-89791-376-0 1991 SODA '91: Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms http://doi.acm.org/10.1145/127787.127828 Society for Industrial and Applied Mathematics 1991 105890 article J. Comb. Theory Ser. B graph-algorithms Short-chorded and perfect graphs 0095-8956 Orlando, FL, USA 24--33 51 1991 1 http://dx.doi.org/10.1016/0095-8956(91)90003-3 Academic Press, Inc. 1991 DBLP:journals/ipl/Lubiw90 article Inf. Process. Lett. other Counterexample to a Conjecture of Szymanski on Hypercube Routing DBLP, http://dblp.uni-trier.de 57-61 35 1990 2 http://dx.doi.org/10.1016/0020-0190(90)90106-8 1990 84510 article SIAM J. Discret. Math. combinatorial-optimization The boolean basis problem and how to cover some polygons by rectangles 0895-4801 Philadelphia, PA, USA 98--115 3 1990 1 http://dx.doi.org/10.1137/0403010 Society for Industrial and Applied Mathematics 1990 56999 article Discrete Appl. Math. graph-algorithms A note on odd/even cycles 0166-218X Amsterdam, The Netherlands, The Netherlands 87--92 22 1988 1 http://dx.doi.org/10.1016/0166-218X(88)90125-4 Elsevier Science Publishers B. V. 1988 33385 article SIAM J. Comput. combinatorial-optimization Doubly lexical orderings of matrices 0097-5397 Philadelphia, PA, USA 854--879 16 1987 5 http://dx.doi.org/10.1137/0216057 Society for Industrial and Applied Mathematics 1987 13919 phdthesis combinatorial-optimization Orderings and some combinatorial optimization problems with geometric applications Toronto, Ont., Canada, Canada 1986 University of Toronto 1986 323247 inproceedings computational-geometry Decomposing polygonal regions into convex quadrilaterals New York, NY, USA Baltimore, Maryland, United States 97--106 0-89791-163-6 1985 SCG '85: Proceedings of the first annual symposium on Computational geometry http://doi.acm.org/10.1145/323233.323247 ACM 1985 DBLP:conf/stoc/Lubiw85 inproceedings combinatorial-optimization DBLP:conf/stoc/STOC17 Doubly Lexical Orderings of Matrices DBLP, http://dblp.uni-trier.de 396-404 1985 Proceedings of the 17th Annual ACM Symposium on Theory of Computing, STOC http://doi.acm.org/10.1145/22145.22189 1985 DBLP:journals/siamcomp/Lubiw81 article SIAM J. Comput. graph-algorithms Some NP-Complete Problems Similar to Graph Isomorphism DBLP, http://dblp.uni-trier.de 11-21 10 1981 1 http://dx.doi.org/10.1137/0210002 1981 lubiw1982 article Master's Thesis, Faculty of Mathematics, University of Waterloo, Ontario, Canada combinatorial-optimization Gamma-free matrices 1982 1982 sakauye1981set inproceedings other IEEE Press A set of programs for MOS design 435--442 1981 Proceedings of the 18th Design Automation Conference http://dx.doi.org/10.1109/DAC.1981.1585392 1981 Souvaine, Diane L. Souvaine Diane L. Souvaine Das, Sandip Das Das, Sandip Spinrad, Jeremy Spinrad Spinrad, Jeremy Hurtado, Ferran Hurtado Ferran Hurtado Lafreniere, Benjamin J. Lafreniere Benjamin J. Lafreniere Iturriaga, Claudia Iturriaga Iturriaga, Claudia Liotta, Giuseppe Liotta Liotta, Giuseppe R\'{a}cz, Andr\'{a}s R\'{a}cz R\'{a}cz, Andr\'{a}s Kratochv\'{\i}l, Jan Kratochv\'{\i}l Kratochv\'{\i}l, Jan Kratsch, Dieter Kratsch Kratsch, Dieter Toussaint, Godfried T. Toussaint Godfried T. Toussaint Jampani, Krishnam Raju Jampani Jampani, Krishnam Raju Dror, Moshe Dror Dror, Moshe Lubiw, Anna Lubiw Lubiw, Anna Attfield, E. Attfield Attfield, E. Sakauye, G. Sakauye Sakauye, G. Hutton, Michael D. Hutton Hutton, Michael D. Roy, Sasanka Roy Roy, Sasanka Iacono, John Iacono Iacono, John Kobourov, Stephen G. Kobourov Stephen G. Kobourov Eisenstat, Sarah Eisenstat Eisenstat, Sarah Epplett, R. Epplett Epplett, R. Efrat, Alon Efrat Alon Efrat Biedl, Therese C. Biedl Therese C. Biedl Brass, Peter Brass Peter Brass Robbins, Steve Robbins Steve Robbins Mouawad, Naji Mouawad Naji Mouawad Wilcox, P. Wilcox Wilcox, P. Spriggs, Michael J. Spriggs Michael J. Spriggs Haeupler, Bernhard Haeupler Haeupler, Bernhard Bose, Prosenjit Bose Bose, Prosenjit Petrick, Mark Petrick Petrick, Mark Hasan, Masud Hasan Masud Hasan Ne\v{s}et\v{r}il, Jaroslav Ne\v{s}et\v{r}il Ne\v{s}et\v{r}il, Jaroslav Ahmed, Mustaq Ahmed Mustaq Ahmed Lucier, Brendan Lucier Brendan Lucier Shew, E. Shew Shew, E. Sleumer, Nora Sleumer Nora Sleumer Shallit, Jonah Shallit Shallit, Jonah Twidale, J. Twidale Twidale, J. Zelle, Christian Zelle Christian Zelle ElGindy, Hossam A. ElGindy ElGindy, Hossam A. Ballinger, Brad Ballinger Ballinger, Brad Damaschke, Peter Damaschke Damaschke, Peter Aichholzer, Oswin Aichholzer Oswin Aichholzer Lazard, Sylvain Lazard Sylvain Lazard Brglez, F. Brglez Brglez, F. Shallit, Arlo Shallit Shallit, Arlo Winslow, Andrew Winslow Andrew Winslow Royle, J. Royle Royle, J. Romanik, Kathleen Romanik Kathleen Romanik Whitesides, Sue Whitesides Whitesides, Sue Demaine, Erik D. Demaine Erik D. Demaine Coullard, Collette R. Coullard Collette R. Coullard Bahun, Stephen Bahun Stephen Bahun Lodha, Sachin Lodha Lodha, Sachin Munro, J. Ian Munro Munro, J. Ian Erten, Cesim Erten Cesim Erten Barequet, Gill Barequet Gill Barequet Shermer, Thomas C. Shermer Thomas C. Shermer Shallit, Jeffrey Shallit Shallit, Jeffrey Houle, Michael E. Houle Michael E. Houle Streinu, Ileana Streinu Ileana Streinu Buss, Jonathan F. Buss Buss, Jonathan F. Duncan, Christian A. Duncan Christian A. Duncan Demaine, Martin L. Demaine Martin L. Demaine Mitchell, Joseph S. B. Mitchell Mitchell, Joseph S. B. Sun, Julie Sun Julie Sun Fekete, S{\'a}ndor P. Fekete S{\'a}ndor P. Fekete Urrutia, Jorge Urrutia Jorge Urrutia Schulz, Andr{\'e} Schulz Andr{\'e} Schulz Cenek, Eowyn Cenek Eowyn Cenek Allouche, Jean-Paul Allouche Allouche, Jean-Paul Aloupis, Greg Aloupis Greg Aloupis Battista, Giuseppe Di Battista Battista, Giuseppe Di Pashchenko, Irena Pashchenko Pashchenko, Irena Rote, G{\"u}nter Rote G{\"u}nter Rote Everett, Hazel Everett Hazel Everett Tanur, Luke Tanur Luke Tanur Lubiw, A. Lubiw Lubiw, A. Guibas, Leonidas J. Guibas Leonidas J. Guibas Benbernou, Nadia Benbernou Nadia Benbernou Ismailescu, Dan P. Ismailescu Dan P. Ismailescu Durocher, Stephane Durocher Durocher, Stephane Razaghpour, Mina Razaghpour Mina Razaghpour O'Rourke, Joseph O'Rourke Joseph O'Rourke Narayanan, Lata Narayanan Narayanan, Lata Van der Poorten, Alfred J. Van der Poorten Van der Poorten, Alfred J. Damian, Mirela Damian Damian, Mirela Sacrist\'{a}n, Vera Sacrist\'{a}n Sacrist\'{a}n, Vera Meijer, Henk Meijer Meijer, Henk Flatland, Robin Flatland Flatland, Robin Morin, Pat Morin Morin, Pat Dujmovi\'{c}, Vida Dujmovi\'{c} Dujmovi\'{c}, Vida Overmars, Mark H. Overmars Mark H. Overmars Ishaque, Mashhood Ishaque Mashhood Ishaque Uehara, Ryuhei Uehara Uehara, Ryuhei Mendes France, Michel Mendes France Mendes France, Michel Charlton, David Charlton David Charlton Colley, Paul Colley Colley, Paul Maheshwari, Anil Maheshwari Maheshwari, Anil
(
)
(
)
.
.
,
(
)
,
.
,
(
)
,
.
:
Categories:
Keywords:
[
link
]
[
doi
]
Anna Lubiw's publications