2025
Finding a Shortest Curve That Separates Few Objects from Many.
Proceedings of the 41st International Symposium on Computational Geometry, 2025
2024
Super Guarding and Dark Rays in Art Galleries.
CoRR, 2024
Morphing Planar Graph Drawings via Orthogonal Box Drawings.
Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 2024
2023
Preface to the Special Issue on the 17th Algorithms and Data Structures Symposium (WADS 2021).
Algorithmica, June, 2023
Computing Realistic Terrains from Imprecise Elevations.
Comput. Geom. Topol., 2023
The Geodesic Edge Center of a Simple Polygon.
Proceedings of the 39th International Symposium on Computational Geometry, 2023
Super Guarding and Dark Rays in Art Galleries.
Proceedings of the 35th Canadian Conference on Computational Geometry, 2023
2022
The Complexity of Drawing a Graph in a Polygonal Region.
J. Graph Algorithms Appl., 2022
Discret. Math. Theor. Comput. Sci., 2022
Computation and Reconfiguration in Low-Dimensional Topological Spaces (Dagstuhl Seminar 22062).
Dagstuhl Reports, 2022
Reconfiguration of Non-crossing Spanning Trees.
CoRR, 2022
Forbidding Edges between Points in the Plane to Disconnect the Triangulation Flip Graph.
CoRR, 2022
Bounded-Angle Minimum Spanning Trees.
Algorithmica, 2022
Hardness of Token Swapping on Trees.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022
Quasi-Twisting Convex Polyhedra.
Proceedings of the 34th Canadian Conference on Computational Geometry, 2022
2021
Minimum ply covering of points with disks and squares.
Comput. Geom., 2021
Dispersion for Intervals: A Geometric Approach.
Proceedings of the 4th Symposium on Simplicity in Algorithms, 2021
The Visibility Center of a Simple Polygon.
Proceedings of the 29th Annual European Symposium on Algorithms, 2021
Distant Representatives for Rectangles in the Plane.
Proceedings of the 29th Annual European Symposium on Algorithms, 2021
2020
On compatible triangulations with a minimum number of Steiner points.
Theor. Comput. Sci., 2020
Minimum shared-power edge cut.
Networks, 2020
Face flips in origami tessellations.
J. Comput. Geom., 2020
Building a larger class of graphs for efficient reconfiguration of vertex colouring.
CoRR, 2020
Shortest paths and convex hulls in 2D complexes with non-positive curvature.
Comput. Geom., 2020
Universal hinge patterns for folding strips efficiently into any grid polyhedron.
Comput. Geom., 2020
2019
Recognition and drawing of stick graphs.
Theor. Comput. Sci., 2019
Rollercoasters: Long Sequences without Short Runs.
SIAM J. Discret. Math., 2019
Construction and Local Routing for Angle-Monotone Graphs.
J. Graph Algorithms Appl., 2019
A Proof of the Orbit Conjecture for Flipping Edge-Labelled Triangulations.
Discret. Comput. Geom., 2019
Morphing Schnyder Drawings of Planar Triangulations.
Discret. Comput. Geom., 2019
Computation in Low-Dimensional Geometry and Topology (Dagstuhl Seminar 19352).
Dagstuhl Reports, 2019
Maximum Matchings and Minimum Blocking Sets in Θ<sub>6</sub>-Graphs.
CoRR, 2019
Convexity-increasing morphs of planar graphs.
Comput. Geom., 2019
Maximum Matchings and Minimum Blocking Sets in \varTheta _6 -Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019
Reconfiguring Undirected Paths.
Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019
Reconstructing a Polyhedron between Polygons in Parallel Slices.
Proceedings of the 31st Canadian Conference on Computational Geometry, 2019
2018
Flat foldings of plane graphs with prescribed angles and edge lengths.
J. Comput. Geom., 2018
Angle-Monotone Graphs: Construction and Local Routing.
CoRR, 2018
Flipping edge-labelled triangulations.
Comput. Geom., 2018
On the Planar Split Thickness of Graphs.
Algorithmica, 2018
Partitioning Orthogonal Histograms into Rectangular Boxes.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018
Rollercoasters and Caterpillars.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018
Compatible Paths on Labelled Point Sets.
,
,
,
,
,
,
,
,
,
,
Proceedings of the 30th Canadian Conference on Computational Geometry, 2018
2017
How to Morph Planar Graph Drawings.
,
,
,
,
,
,
,
,
,
,
,
,
SIAM J. Comput., 2017
J. Graph Algorithms Appl., 2017
Discret. Comput. Geom., 2017
Visibility graphs, dismantlability, and the cops and robbers game.
Comput. Geom., 2017
Fractional Coverings, Greedy Coverings, and Rectifier Networks.
Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017
Improved Bounds for Drawing Trees on Fixed Points with L-Shaped Edges.
Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017
Angle-monotone Paths in Non-obtuse Triangulations.
Proceedings of the 29th Canadian Conference on Computational Geometry, 2017
2016
Folding a paper strip to minimize thickness.
J. Discrete Algorithms, 2016
Star Unfolding from a Geodesic Curve.
Discret. Comput. Geom., 2016
Reconfiguring Ordered Bases of a Matroid.
CoRR, 2016
Some Counterexamples for Compatible Triangulations.
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
CoRR, 2016
Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition.
Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016
Rectangle-of-influence triangulations.
Proceedings of the 28th Canadian Conference on Computational Geometry, 2016
2015
Drawing Partially Embedded and Simultaneously Planar Graphs.
J. Graph Algorithms Appl., 2015
Flip distance between two triangulations of a point set is NP-complete.
Comput. Geom., 2015
Optimal Morphs of Convex Drawings.
Proceedings of the 31st International Symposium on Computational Geometry, 2015
Reconfiguring a Chain of Cubes.
Proceedings of the 27th Canadian Conference on Computational Geometry, 2015
2014
Morphing Planar Graph Drawings with Unidirectional Moves.
CoRR, 2014
Reprint of: Refold rigidity of convex polyhedra.
Comput. Geom., 2014
Semantic Word Cloud Representations: Hardness and Approximation Algorithms.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014
Continuously Flattening Polyhedra Using Straight Skeletons.
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014
Turning Orthogonally Convex Polyhedra into Orthoballs.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014
2013
Morphing orthogonal planar graph drawings.
ACM Trans. Algorithms, 2013
Shortest paths avoiding forbidden subpaths.
Networks, 2013
Testing Simultaneous Planarity when the Common Graph is 2-Connected.
J. Graph Algorithms Appl., 2013
Coverage with k-transmitters in the presence of obstacles.
,
,
,
,
,
,
,
,
,
,
,
,
,
J. Comb. Optim., 2013
Dihedral angles and orthogonal polyhedra.
CoRR, 2013
Refold rigidity of convex polyhedra.
Comput. Geom., 2013
Bounded-degree polyhedronization of point sets.
,
,
,
,
,
,
,
,
,
,
Comput. Geom., 2013
Smart-Grid Electricity Allocation via Strip Packing with Slicing.
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013
Algorithms for Designing Pop-Up Cards.
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013
Morphing Planar Graph Drawings with a Polynomial Number of Steps.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013
Minimum Length Embedding of Planar Graphs at Fixed Vertex Locations.
Proceedings of the Graph Drawing - 21st International Symposium, 2013
2012
The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs.
J. Graph Algorithms Appl., 2012
The Shape of Orthogonal Cycles in Three Dimensions.
Discret. Comput. Geom., 2012
Proceedings of the Graph Drawing - 20th International Symposium, 2012
2011
Morphing Planar Graph Drawings with Bent Edges.
J. Graph Algorithms Appl., 2011
Shortest Descending Paths: towards an Exact Algorithm.
Int. J. Comput. Geom. Appl., 2011
Modelling gateway placement in wireless networks: Geometric k-centres of unit disc graphs.
Comput. Geom., 2011
A Generalization of the Source Unfolding of Convex Polyhedra.
Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011
Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area.
Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011
Algorithms for Solving Rubik's Cubes.
Proceedings of the Algorithms - ESA 2011, 2011
Convexifying Polygons Without Losing Visibilities.
,
,
,
,
,
,
,
,
,
,
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011
2010
Approximation algorithms for shortest descending paths in terrains.
J. Discrete Algorithms, 2010
A Lower Bound on the Area of a 3-Coloured Disk Packing.
Int. J. Comput. Geom. Appl., 2010
Simultaneous Interval Graphs.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010
Coverage with <i>k</i>-Transmitters in the Presence of Obstacles.
,
,
,
,
,
,
,
,
,
,
,
,
,
Proceedings of the Combinatorial Optimization and Applications, 2010
Zipper unfoldings of polyhedral complexes.
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010
2009
Morphing polyhedra with parallel faces: Counterexamples.
Comput. Geom., 2009
Shortest descending paths through given faces.
Comput. Geom., 2009
Shortest Gently Descending Paths.
Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009
2008
The Simultaneous Membership Problem for Chordal, Comparability and Permutation graphs
CoRR, 2008
Equiprojective polyhedra.
Comput. Geom., 2008
08191 Working Group Report - Visualization of Trajectories.
Proceedings of the Graph Drawing with Applications to Bioinformatics and Social Sciences, 04.05., 2008
The Steiner Ratio for Obstacle-Avoiding Rectilinear Steiner Trees.
Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008
2007
An Approximation Algorithm for Shortest Descending Paths
CoRR, 2007
On simultaneous planar graph embeddings.
Comput. Geom., 2007
Cauchy's Theorem and Edge Lengths of Convex Polyhedra.
Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007
Morphing Planar Graph Drawings.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007
A Lower Bound on the Area of a 3-Coloured Disc Packing.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007
Optimal Schedules for 2-guard Room Search.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007
2006
Computing homotopic shortest paths efficiently.
Comput. Geom., 2006
Morphing orthogonal planar graph drawings.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006
2005
When can a net fold to a polyhedron?
Comput. Geom., 2005
Morphing Planar Graphs While Preserving Edge Directions.
Proceedings of the Graph Drawing, 13th International Symposium, 2005
Morphing Polyhedra Preserving Face Normals: A Counterexample.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005
2004
Angles and Lengths in Reconfigurations of Polygons and Polyhedra.
Proceedings of the Mathematical Foundations of Computer Science 2004, 2004
Pattern Matching in Polyphonic Music as a Weighted Geometric Translation Problem.
Proceedings of the ISMIR 2004, 2004
2003
Elastic labels around the perimeter of a map.
J. Algorithms, 2003
Touring a sequence of polygons.
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003
Parallel morphing of trees and cycles.
Proceedings of the 15th Canadian Conference on Computational Geometry, 2003
2002
Embedding problems for paths with direction constrained edges.
Theor. Comput. Sci., 2002
Enumerating Foldings and Unfoldings Between Polygons and Polytopes.
Graphs Comb., 2002
A note on reconfiguring tree linkages: trees can lock.
Discret. Appl. Math., 2002
Efficient visibility queries in simple polygons.
Comput. Geom., 2002
2001
Efficient Algorithms for Petersen's Matching Theorem.
J. Algorithms, 2001
Locked and Unlocked Polygonal Chains in Three Dimensions.
,
,
,
,
,
,
,
,
,
,
Discret. Comput. Geom., 2001
Proceedings of the 13th Canadian Conference on Computational Geometry, 2001
2000
Examples, Counterexamples, and Enumeration Results for Foldings and Unfoldings between Polygons and Polytopes
CoRR, 2000
Orthogonal Drawings of Cycles in 3D Space (Extended Abstract).
Proceedings of the Graph Drawing, 8th International Symposium, 2000
1999
Folding and One Straight Cut Suffice.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999
Locked and Unlocked Polygonal Chains in 3D.
,
,
,
,
,
,
,
,
,
,
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999
Metamorphosis of the Cube.
Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999
1998
A Visibility Representation for Graphs in Three Dimensions.
,
,
,
,
,
,
,
,
,
,
J. Graph Algorithms Appl., 1998
Pattern Matching for Permutations.
Inf. Process. Lett., 1998
The rectangle of influence drawability problem.
Comput. Geom., 1998
Folding and Cutting Paper.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 1998
Elastic Labels on the Perimeter of a Rectangle.
Proceedings of the Graph Drawing, 6th International Symposium, 1998
Hiding disks in folded polygons.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998
Unfolding some classes of orthogonal polyhedra.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998
On reconfiguring tree linkages: Trees can lock.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998
1997
Int. J. Comput. Geom. Appl., 1997
Visibility Graphs of Towers.
Comput. Geom., 1997
Elastic Labels: the Two-Axis Case.
Proceedings of the Graph Drawing, 5th International Symposium, 1997
1996
Upward Planar Drawing of Single-Source Acyclic Digraphs.
SIAM J. Comput., 1996
1994
Dominating cliques in chordal graphs.
Discret. Math., 1994
Recognizing Rectangle of Influence Drawable Graphs.
Proceedings of the Graph Drawing, DIMACS International Workshop, 1994
Interval Graphs as Visibility Graphs of Simple Polygons Part 1: Parachutes.
Proceedings of the 6th Canadian Conference on Computational Geometry, 1994
1993
Maximal Outerplanar Graphs Are Relative Neighbourhood Graphs.
Proceedings of the 5th Canadian Conference on Computational Geometry, 1993
Recovery of Convex Hulls From External Visibility Graphs.
Proceedings of the 5th Canadian Conference on Computational Geometry, 1993
1992
Distance visibility graphs.
Int. J. Comput. Geom. Appl., 1992
1991
A Lower Bound for the Integer Element Distinctness Problem
Inf. Comput., September, 1991
Noncrossing Subgraphs in Topological Layouts.
SIAM J. Discret. Math., 1991
Short-chorded and perfect graphs.
J. Comb. Theory B, 1991
A weighted min-max relation for intervals.
J. Comb. Theory B, 1991
1990
The Boolean Basis Problem and How to Cover Some Polygons by Rectangles.
SIAM J. Discret. Math., 1990
Counterexample to a Conjecture of Szymanski on Hypercube Routing.
Inf. Process. Lett., 1990
1988
A note on odd/even cycles.
Discret. Appl. Math., 1988
1987
Doubly Lexical Orderings of Matrices.
SIAM J. Comput., 1987
1986
Orderings and some combinatorial optimization problems with geometric applications.
PhD thesis, 1986
1985
Decomposing polygonal regions into convex quadrilaterals.
Proceedings of the First Annual Symposium on Computational Geometry, 1985
1981
Some NP-Complete Problems Similar to Graph Isomorphism.
SIAM J. Comput., 1981
A set of programs for MOS design.
Proceedings of the 18th Design Automation Conference, 1981