Anna Lubiw

Mohammad R. Salavatipour

Algorithmica, June, 2023

Preface.

[BibT_eX]

[DOI]

Meng He

Mohammad R. Salavatipour

Comput. Geom., 2023

The Geodesic Edge Center of a Simple Polygon.

[BibT_eX]

[DOI]

Proceedings of the 39th International Symposium on Computational Geometry, 2023

2022

The Complexity of Drawing a Graph in a Polygonal Region.

[BibT_eX]

[DOI]

Tillmann Miltzow

J. Graph Algorithms Appl., 2022

Token Swapping on Trees.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2022

Computation and Reconfiguration in Low-Dimensional Topological Spaces (Dagstuhl Seminar 22062).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2022

Reconfiguration of Non-crossing Spanning Trees.

[BibT_eX]

[DOI]

CoRR, 2022

Forbidding Edges between Points in the Plane to Disconnect the Triangulation Flip Graph.

[BibT_eX]

[DOI]

Reza Bigdeli

Virginia Vassilevska Williams

CoRR, 2022

Bounded-Angle Minimum Spanning Trees.

[BibT_eX]

[DOI]

Algorithmica, 2022

Hardness of Token Swapping on Trees.

[BibT_eX]

[DOI]

Nicole Wein

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

Quasi-Twisting Convex Polyhedra.

[BibT_eX]

Proceedings of the 34th Canadian Conference on Computational Geometry, 2022

Computing Realistic Terrains from Imprecise Elevations.

[BibT_eX]

Graeme Stroud

Proceedings of the 34th Canadian Conference on Computational Geometry, 2022

2021

Minimum ply covering of points with disks and squares.

[BibT_eX]

[DOI]

Ahmad Biniaz

Comput. Geom., 2021

Dispersion for Intervals: A Geometric Approach.

[BibT_eX]

[DOI]

Peter Dominik Ralbovsky

Graeme Stroud

Proceedings of the 4th Symposium on Simplicity in Algorithms, 2021

The Visibility Center of a Simple Polygon.

[BibT_eX]

[DOI]

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

Distant Representatives for Rectangles in the Plane.

[BibT_eX]

[DOI]

Peter Dominik Ralbovsky

Graeme Stroud

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2020

On compatible triangulations with a minimum number of Steiner points.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Minimum shared-power edge cut.

[BibT_eX]

[DOI]

Networks, 2020

Face flips in origami tessellations.

[BibT_eX]

[DOI]

J. Comput. Geom., 2020

Building a larger class of graphs for efficient reconfiguration of vertex colouring.

[BibT_eX]

[DOI]

Owen D. Merkel

CoRR, 2020

Shortest paths and convex hulls in 2D complexes with non-positive curvature.

[BibT_eX]

[DOI]

Daniela Maftuleac

Megan Owen

Comput. Geom., 2020

Universal hinge patterns for folding strips efficiently into any grid polyhedron.

[BibT_eX]

[DOI]

Comput. Geom., 2020

2019

Recognition and drawing of stick graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Rollercoasters: Long Sequences without Short Runs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2019

Construction and Local Routing for Angle-Monotone Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2019

A Proof of the Orbit Conjecture for Flipping Edge-Labelled Triangulations.

[BibT_eX]

[DOI]

Zuzana Masárová

Uli Wagner

Discret. Comput. Geom., 2019

Morphing Schnyder Drawings of Planar Triangulations.

[BibT_eX]

[DOI]

Fidel Barrera-Cruz

Penny Haxell

Discret. Comput. Geom., 2019

Computation in Low-Dimensional Geometry and Topology (Dagstuhl Seminar 19352).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2019

Maximum Matchings and Minimum Blocking Sets in Θ<sub>6</sub>-Graphs.

[BibT_eX]

[DOI]

CoRR, 2019

Convexity-increasing morphs of planar graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2019

Maximum Matchings and Minimum Blocking Sets in \varTheta _6 -Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019

Reconfiguring Undirected Paths.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

Reconstructing a Polyhedron between Polygons in Parallel Slices.

[BibT_eX]

Proceedings of the 31st Canadian Conference on Computational Geometry, 2019

2018

Flat foldings of plane graphs with prescribed angles and edge lengths.

[BibT_eX]

[DOI]

J. Comput. Geom., 2018

Angle-Monotone Graphs: Construction and Local Routing.

[BibT_eX]

[DOI]

CoRR, 2018

Flipping edge-labelled triangulations.

[BibT_eX]

[DOI]

Comput. Geom., 2018

On the Planar Split Thickness of Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2018

Partitioning Orthogonal Histograms into Rectangular Boxes.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Rollercoasters and Caterpillars.

[BibT_eX]

[DOI]

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Compatible Paths on Labelled Point Sets.

[BibT_eX]

[DOI]

Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

2017

How to Morph Planar Graph Drawings.

[BibT_eX]

[DOI]

SIAM J. Comput., 2017

Guest editors' foreword.

[BibT_eX]

[DOI]

Sándor P. Fekete

J. Comput. Geom., 2017

Guest Editors' Foreword.

[BibT_eX]

[DOI]

Emilio Di Giacomo

J. Graph Algorithms Appl., 2017

Visibility graphs, dismantlability, and the cops and robbers game.

[BibT_eX]

[DOI]

Jack Snoeyink

Hamideh Vosoughpour

Comput. Geom., 2017

Fractional Coverings, Greedy Coverings, and Rectifier Networks.

[BibT_eX]

[DOI]

Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

Improved Bounds for Drawing Trees on Fixed Points with L-Shaped Edges.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

Angle-monotone Paths in Non-obtuse Triangulations.

[BibT_eX]

Joseph O'Rourke

Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

2016

Folding a paper strip to minimize thickness.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2016

Star Unfolding from a Geodesic Curve.

[BibT_eX]

[DOI]

Stephen Kiazyk

Discret. Comput. Geom., 2016

Reconfiguring Ordered Bases of a Matroid.

[BibT_eX]

[DOI]

Vinayak Pathak

CoRR, 2016

Some Counterexamples for Compatible Triangulations.

[BibT_eX]

[DOI]

Gregory W. Mierzwinski

CoRR, 2016

Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016

Rectangle-of-influence triangulations.

[BibT_eX]

Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

2015

Drawing Partially Embedded and Simultaneously Planar Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2015

Flip distance between two triangulations of a point set is NP-complete.

[BibT_eX]

[DOI]

Vinayak Pathak

Comput. Geom., 2015

Optimal Morphs of Convex Drawings.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Computational Geometry, 2015

Reconfiguring a Chain of Cubes.

[BibT_eX]

[DOI]

Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

2014

Covering Folded Shapes.

[BibT_eX]

[DOI]

J. Comput. Geom., 2014

Morphing Planar Graph Drawings with Unidirectional Moves.

[BibT_eX]

[DOI]

Fidel Barrera-Cruz

Penny E. Haxell

CoRR, 2014

Reprint of: Refold rigidity of convex polyhedra.

[BibT_eX]

[DOI]

Comput. Geom., 2014

Semantic Word Cloud Representations: Hardness and Approximation Algorithms.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Continuously Flattening Polyhedra Using Straight Skeletons.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

Turning Orthogonally Convex Polyhedra into Orthoballs.

[BibT_eX]

[DOI]

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013

Morphing orthogonal planar graph drawings.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2013

Shortest paths avoiding forbidden subpaths.

[BibT_eX]

[DOI]

Networks, 2013

Testing Simultaneous Planarity when the Common Graph is 2-Connected.

[BibT_eX]

[DOI]

Bernhard Haeupler

J. Graph Algorithms Appl., 2013

Coverage with k-transmitters in the presence of obstacles.

[BibT_eX]

[DOI]

Vera Sacristán Adinolfi

Diane L. Souvaine

Ryuhei Uehara

J. Comb. Optim., 2013

Dihedral angles and orthogonal polyhedra.

[BibT_eX]

[DOI]

CoRR, 2013

Refold rigidity of convex polyhedra.

[BibT_eX]

[DOI]

Comput. Geom., 2013

Bounded-degree polyhedronization of point sets.

[BibT_eX]

[DOI]

Andrew Winslow

Comput. Geom., 2013

Smart-Grid Electricity Allocation via Strip Packing with Slicing.

[BibT_eX]

[DOI]

Srinivasan Keshav

Vinayak Pathak

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Algorithms for Designing Pop-Up Cards.

[BibT_eX]

[DOI]

Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

Morphing Planar Graph Drawings with a Polynomial Number of Steps.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Minimum Length Embedding of Planar Graphs at Fixed Vertex Locations.

[BibT_eX]

[DOI]

Timothy M. Chan

Hella-Franziska Hoffmann

Stephen Kiazyk

Proceedings of the Graph Drawing - 21st International Symposium, 2013

2012

The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2012

The Shape of Orthogonal Cycles in Three Dimensions.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2012

Self-approaching Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 20th International Symposium, 2012

2011

Shortest Descending Paths: towards an Exact Algorithm.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2011

Modelling gateway placement in wireless networks: Geometric k-centres of unit disc graphs.

[BibT_eX]

[DOI]

Stephane Durocher

Lata Narayanan

Comput. Geom., 2011

A Generalization of the Source Unfolding of Convex Polyhedra.

[BibT_eX]

[DOI]

Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011

Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area.

[BibT_eX]

[DOI]

Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011

Algorithms for Solving Rubik's Cubes.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2011, 2011

Convexifying Polygons Without Losing Visibilities.

[BibT_eX]

[DOI]

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010

Approximation algorithms for shortest descending paths in terrains.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2010

A Lower Bound on the Area of a 3-Coloured Disk Packing.

[BibT_eX]

[DOI]

Peter Brass

Ferran Hurtado

Benjamin J. Lafreniere

Int. J. Comput. Geom. Appl., 2010

Simultaneous Interval Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Coverage with <i>k</i>-Transmitters in the Presence of Obstacles.

[BibT_eX]

[DOI]

Vera Sacristán Adinolfi

Diane L. Souvaine

Ryuhei Uehara

Proceedings of the Combinatorial Optimization and Applications, 2010

Zipper unfoldings of polyhedral complexes.

[BibT_eX]

[DOI]

Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

2009

Morphing polyhedra with parallel faces: Counterexamples.

[BibT_eX]

[DOI]

Comput. Geom., 2009

Shortest descending paths through given faces.

[BibT_eX]

[DOI]

Comput. Geom., 2009

Shortest Gently Descending Paths.

[BibT_eX]

[DOI]

Anil Maheshwari

Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

2008

Morphing Planar Graph Drawings with Bent Edges.

[BibT_eX]

[DOI]

Mark Petrick

Electron. Notes Discret. Math., 2008

The Simultaneous Membership Problem for Chordal, Comparability and Permutation graphs

[BibT_eX]

[DOI]

CoRR, 2008

Equiprojective polyhedra.

[BibT_eX]

[DOI]

Masud Hasan

Comput. Geom., 2008

08191 Working Group Report - Visualization of Trajectories.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing with Applications to Bioinformatics and Social Sciences, 04.05., 2008

The Steiner Ratio for Obstacle-Avoiding Rectilinear Steiner Trees.

[BibT_eX]

Mina Razaghpour

Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

2007

An Approximation Algorithm for Shortest Descending Paths

[BibT_eX]

[DOI]

CoRR, 2007

On simultaneous planar graph embeddings.

[BibT_eX]

[DOI]

Joseph S. B. Mitchell

Comput. Geom., 2007

Cauchy's Theorem and Edge Lengths of Convex Polyhedra.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

Morphing Planar Graph Drawings.

[BibT_eX]

[DOI]

Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

A Lower Bound on the Area of a 3-Coloured Disc Packing.

[BibT_eX]

[DOI]

Peter Brass

Ferran Hurtado

Benjamin J. Lafreniere

Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

Optimal Schedules for 2-guard Room Search.

[BibT_eX]

[DOI]

Stephen Bahun

Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006

Computing homotopic shortest paths efficiently.

[BibT_eX]

[DOI]

Alon Efrat

Stephen G. Kobourov

Comput. Geom., 2006

Morphing orthogonal planar graph drawings.

[BibT_eX]

[DOI]

Mark Petrick

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2005

When can a net fold to a polyhedron?

[BibT_eX]

[DOI]

Julie Sun

Comput. Geom., 2005

Morphing Planar Graphs While Preserving Edge Directions.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 13th International Symposium, 2005

Morphing Polyhedra Preserving Face Normals: A Counterexample.

[BibT_eX]

[DOI]

Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2004

Angles and Lengths in Reconfigurations of Polygons and Polyhedra.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

Pattern Matching in Polyphonic Music as a Weighted Geometric Translation Problem.

[BibT_eX]

[DOI]

Luke Tanur

Proceedings of the ISMIR 2004, 2004

2003

Elastic labels around the perimeter of a map.

[BibT_eX]

[DOI]

Claudia Iturriaga

J. Algorithms, 2003

Touring a sequence of polygons.

[BibT_eX]

[DOI]

Moshe Dror

Alon Efrat

Joseph S. B. Mitchell

Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

Parallel morphing of trees and cycles.

[BibT_eX]

[DOI]

Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

2002

Embedding problems for paths with direction constrained edges.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Enumerating Foldings and Unfoldings Between Polygons and Polytopes.

[BibT_eX]

[DOI]

Graphs Comb., 2002

A note on reconfiguring tree linkages: trees can lock.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2002

Efficient visibility queries in simple polygons.

[BibT_eX]

[DOI]

Prosenjit Bose

J. Ian Munro

Comput. Geom., 2002

2001

Efficient Algorithms for Petersen's Matching Theorem.

[BibT_eX]

[DOI]

J. Algorithms, 2001

Locked and Unlocked Polygonal Chains in Three Dimensions.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2001

The cccg 2001 logo.

[BibT_eX]

[DOI]

Martin L. Demaine

Proceedings of the 13th Canadian Conference on Computational Geometry, 2001

2000

Examples, Counterexamples, and Enumeration Results for Foldings and Unfoldings between Polygons and Polytopes

[BibT_eX]

[DOI]

CoRR, 2000

Orthogonal Drawings of Cycles in 3D Space (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 8th International Symposium, 2000

1999

Folding and One Straight Cut Suffice.

[BibT_eX]

[DOI]

Martin L. Demaine

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Locked and Unlocked Polygonal Chains in 3D.

[BibT_eX]

[DOI]

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Metamorphosis of the Cube.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

1998

A Visibility Representation for Graphs in Three Dimensions.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 1998

Pattern Matching for Permutations.

[BibT_eX]

[DOI]

Prosenjit Bose

Jonathan F. Buss

Inf. Process. Lett., 1998

The rectangle of influence drawability problem.

[BibT_eX]

[DOI]

Comput. Geom., 1998

Folding and Cutting Paper.

[BibT_eX]

[DOI]

Martin L. Demaine

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 1998

Elastic Labels on the Perimeter of a Rectangle.

[BibT_eX]

[DOI]

Claudia Iturriaga

Proceedings of the Graph Drawing, 6th International Symposium, 1998

Hiding disks in folded polygons.

[BibT_eX]

[DOI]

Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

Unfolding some classes of orthogonal polyhedra.

[BibT_eX]

[DOI]

Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

On reconfiguring tree linkages: Trees can lock.

[BibT_eX]

[DOI]

Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

1997

The Floodlight Problem.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 1997

Visibility Graphs of Towers.

[BibT_eX]

[DOI]

Paul Colley

Jeremy P. Spinrad

Comput. Geom., 1997

Elastic Labels: the Two-Axis Case.

[BibT_eX]

[DOI]

Claudia Iturriaga

Proceedings of the Graph Drawing, 5th International Symposium, 1997

1996

Upward Planning of Single-Source Acyclic Digraphs.

[BibT_eX]

[DOI]

Michael D. Hutton

SIAM J. Comput., 1996

1994

Dominating cliques in chordal graphs.

[BibT_eX]

[DOI]

Dieter Kratsch

Peter Damaschke

Discret. Math., 1994

Recognizing Rectangle of Influence Drawable Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, DIMACS International Workshop, 1994

Interval Graphs as Visibility Graphs of Simple Polygons Part 1: Parachutes.

[BibT_eX]

Naji Mouawad

Proceedings of the 6th Canadian Conference on Computational Geometry, 1994

1993

Maximal Outerplanar Graphs Are Relative Neighbourhood Graphs.

[BibT_eX]

Nora Sleumer

Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

Recovery of Convex Hulls From External Visibility Graphs.

[BibT_eX]

Hazel Everett

Joseph O'Rourke

Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

1992

Distance visibility graphs.

[BibT_eX]

[DOI]

Collette R. Coullard

Int. J. Comput. Geom. Appl., 1992

1991

A Lower Bound for the Integer Element Distinctness Problem

[BibT_eX]

[DOI]

András Rácz

Inf. Comput., September, 1991

Noncrossing Subgraphs in Topological Layouts.

[BibT_eX]

[DOI]

Jan Kratochvíl

Jaroslav Nesetril

SIAM J. Discret. Math., 1991

Short-chorded and perfect graphs.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1991

A weighted min-max relation for intervals.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1991

Upward Planar Drawing of Single Source Acyclic Digraphs.

[BibT_eX]

[DOI]

Michael D. Hutton

Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

1990

The Boolean Basis Problem and How to Cover Some Polygons by Rectangles.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1990

Counterexample to a Conjecture of Szymanski on Hypercube Routing.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1990

1988

A note on odd/even cycles.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1988

1987

Doubly Lexical Orderings of Matrices.

[BibT_eX]

[DOI]

SIAM J. Comput., 1987

1986

Orderings and some combinatorial optimization problems with geometric applications.

[BibT_eX]

[DOI]

PhD thesis, 1986

1985

Decomposing polygonal regions into convex quadrilaterals.

[BibT_eX]

[DOI]

Proceedings of the First Annual Symposium on Computational Geometry, 1985

1981

Some NP-Complete Problems Similar to Graph Isomorphism.

[BibT_eX]

[DOI]