2024
Perfect Matchings with Crossings.
Algorithmica, March, 2024
Twisted Ways to Find Plane Structures in Simple Drawings of Complete Graphs.
Discret. Comput. Geom., January, 2024
Folding polyominoes into cubes.
CoRR, 2024
Towards Crossing-Free Hamiltonian Cycles in Simple Drawings of Complete Graphs.
Comput. Geom. Topol., 2024
Comput. Geom. Topol., 2024
There is a unique crossing-minimal rectilinear drawing of K_18.
Ars Math. Contemp., 2024
Separable Drawings: Extendability and Crossing-Free Hamiltonian Cycles.
Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 2024
2023
Graphs with large total angular resolution.
Theor. Comput. Sci., 2023
Geometric dominating sets - a minimum version of the No-Three-In-Line Problem.
Comput. Geom., 2023
Flipping Plane Spanning Paths.
Proceedings of the WALCOM: Algorithms and Computation, 2023
Different Types of Isomorphisms of Drawings of Complete Multipartite Graphs.
Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023
Bichromatic Perfect Matchings with Crossings.
Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023
Drawings of Complete Multipartite Graphs up to Triangle Flips.
Proceedings of the 39th International Symposium on Computational Geometry, 2023
2022
J. Graph Algorithms Appl., 2022
Drawing Graphs as Spanners.
Discret. Comput. Geom., 2022
Blocking Delaunay Triangulations from the Exterior.
CoRR, 2022
Reconfiguration of Non-crossing Spanning Trees.
CoRR, 2022
Geometric Dominating Sets.
CoRR, 2022
Flipping Plane Spanning Paths.
CoRR, 2022
On crossing-families in planar point sets.
Comput. Geom., 2022
Disjoint Compatibility via Graph Classes.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022
Compatible Spanning Trees in Simple Drawings of K<sub>n</sub>.
Proceedings of the Graph Drawing and Network Visualization - 30th International Symposium, 2022
Shooting Stars in Simple Drawings of K<sub>m, n</sub>.
Proceedings of the Graph Drawing and Network Visualization - 30th International Symposium, 2022
Hardness of Token Swapping on Trees.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022
Edge Partitions of Complete Geometric Graphs.
Proceedings of the 38th International Symposium on Computational Geometry, 2022
2021
Edge Partitions of Complete Geometric Graphs (Part 2).
CoRR, 2021
Folding polyominoes with holes into a cube.
,
,
,
,
,
,
,
,
,
,
,
Comput. Geom., 2021
Flip Distances Between Graph Orientations.
Algorithmica, 2021
Another Small but Long Step for Crossing Numbers: cr(13) = 225 and cr(14) = 315.
Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021
2020
An Ongoing Project to Improve the Rectilinear and the Pseudolinear Crossing Constants.
J. Graph Algorithms Appl., 2020
Minimal Representations of Order Types by Geometric Graphs.
,
,
,
,
,
,
,
,
,
,
J. Graph Algorithms Appl., 2020
A superlinear lower bound on the number of 5-holes.
J. Comb. Theory A, 2020
Plane Spanning Trees in Edge-Colored Simple Drawings of K<sub>n</sub>.
Proceedings of the Graph Drawing and Network Visualization - 28th International Symposium, 2020
2019
Cross-sections of line configurations in R3 and (<i>d</i> - 2)-flat configurations in Rd.
Comput. Geom., 2019
Packing plane spanning graphs with short edges in complete geometric graphs.
Comput. Geom., 2019
On the 2-Colored Crossing Number.
Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019
On the Edge-Vertex Ratio of Maximal Thrackles.
Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019
2018
Bishellable drawings of K<sub>n</sub>.
SIAM J. Discret. Math., 2018
Computing balanced islands in two colored point sets in the plane.
Inf. Process. Lett., 2018
Folding Polyominoes into (Poly)Cubes.
Int. J. Comput. Geom. Appl., 2018
Perfect <i>k</i>-Colored Matchings and \((k+2)\) -Gonal Tilings.
Graphs Comb., 2018
Modem illumination of monotone polygons.
Comput. Geom., 2018
Linear transformation distance for bichromatic matchings.
Comput. Geom., 2018
Holes in 2-convex point sets.
Comput. Geom., 2018
2017
Packing plane spanning trees and paths in complete geometric graphs.
Inf. Process. Lett., 2017
An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings.
Int. J. Comput. Geom. Appl., 2017
Packing Short Plane Spanning Graphs in Complete Geometric Graphs.
CoRR, 2017
2016
Reconstructing Point Set Order Types from Radial Orderings.
Int. J. Comput. Geom. Appl., 2016
Geometric Achromatic and Pseudoachromatic Indices.
Graphs Comb., 2016
Packing Short Plane Spanning Trees in Complete Geometric Graphs.
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016
An Improved Lower Bound on the Minimum Number of Triangulations.
Proceedings of the 32nd International Symposium on Computational Geometry, 2016
2015
Embedding Four-directional Paths on Convex Point Sets.
J. Graph Algorithms Appl., 2015
Monotone Simultaneous Embeddings of Upward Planar Digraphs.
J. Graph Algorithms Appl., 2015
Triangulations with Circular Arcs.
J. Graph Algorithms Appl., 2015
3-Colorability of Pseudo-Triangulations.
Int. J. Comput. Geom. Appl., 2015
Empty Triangles in Good Drawings of the Complete Graph.
Graphs Comb., 2015
Characterization of Extremal Antipodal Polygons.
Graphs Comb., 2015
Flip Distance Between Triangulations of a Simple Polygon is NP-Complete.
Discret. Comput. Geom., 2015
Balanced Islands in Two Colored Point Sets in the Plane.
CoRR, 2015
On k-gons and k-holes in point sets.
Comput. Geom., 2015
Reprint of: Theta-3 is connected.
Comput. Geom., 2015
Disjoint Compatibility Graph of Non-Crossing Matchings of Points in Convex Position.
Electron. J. Comb., 2015
A Note on the Number of General 4-holes in (Perturbed) Grids.
Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015
Representing Directed Trees as Straight Skeletons.
Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015
2014
Flips in Combinatorial pointed Pseudo-Triangulations with Face degree at most Four.
Int. J. Comput. Geom. Appl., 2014
Geodesic-Preserving Polygon Simplification.
Int. J. Comput. Geom. Appl., 2014
Plane Graphs with Parity Constraints.
Graphs Comb., 2014
Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane.
,
,
,
,
,
,
,
,
,
,
Discret. Math. Theor. Comput. Sci., 2014
Empty Monochromatic Simplices.
Discret. Comput. Geom., 2014
Shellable Drawings and the Cylindrical Crossing Number of K<sub>n</sub>.
Discret. Comput. Geom., 2014
Reprint of: Extreme point and halving edge search in abstract order types.
Comput. Geom., 2014
Lower bounds for the number of small convex k-holes.
Comput. Geom., 2014
Reconstructing Point Set Order Typesfrom Radial Orderings.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014
Straight Skeletons by Means of Voronoi Diagrams Under Polyhedral Distance Functions.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014
Order types and cross-sections of line arrangements in R^3.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014
Graph Drawings with Relative Edge Length Specifications.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014
Non-Shellable Drawings of K<sub>n</sub> with Few Crossings.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014
Einführung in die angewandte Geometrie.
Mathematik Kompakt, Birkhäuser, ISBN: 978-3-0346-0143-6, 2014
2013
Balanced 6-holes in linearly separable bichromatic point sets.
Electron. Notes Discret. Math., 2013
More on the crossing number of K<sub>n</sub>: Monotone drawings.
Electron. Notes Discret. Math., 2013
The 2-Page Crossing Number of K<sub>n</sub>.
Discret. Comput. Geom., 2013
Extremal antipodal polygons and polytopes
CoRR, 2013
Monotone Simultaneous Embedding of Directed Paths.
CoRR, 2013
Shellable drawings and the cylindrical crossing number of $K_n$.
CoRR, 2013
Extreme point and halving edge search in abstract order types.
Comput. Geom., 2013
Blocking Delaunay triangulations.
Comput. Geom., 2013
Maximizing maximal angles for plane straight-line graphs.
Comput. Geom., 2013
Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013
2012
Pointed drawings of planar graphs.
Comput. Geom., 2012
What makes a Tree a Straight Skeleton?
Proceedings of the 24th Canadian Conference on Computational Geometry, 2012
2011
Computational and Structural Advantages of Circular Boundary Representation.
Int. J. Comput. Geom. Appl., 2011
There is a unique crossing-minimal rectilinear drawing of K<sub>18</sub>.
Electron. Notes Discret. Math., 2011
Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011
Convexifying Monotone Polygons while Maintaining Internal Visibility.
Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011
Convexifying Polygons Without Losing Visibilities.
,
,
,
,
,
,
,
,
,
,
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011
2010
Large Bichromatic Point Sets Admit Empty Monochromatic 4-Gons.
SIAM J. Discret. Math., 2010
Edge-Removal and Non-Crossing Configurations in Geometric Graphs.
Discret. Math. Theor. Comput. Sci., 2010
Divide-and-conquer for Voronoi diagrams revisited.
Comput. Geom., 2010
Playing Pylos with an autonomous robot.
Proceedings of the 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2010
Compatible pointed pseudo-triangulations.
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010
Exact Medial Axis Computation for Circular Arc Boundaries.
Proceedings of the Curves and Surfaces, 2010
Exact Medial Axis Computation for Triangulated Solids with Respect to Piecewise Linear Metrics.
Proceedings of the Curves and Surfaces, 2010
2009
Flip Graphs of Bounded-Degree Triangulations.
Electron. Notes Discret. Math., 2009
New results on lower bounds for the number of (<=k)-facets.
Eur. J. Comb., 2009
Empty monochromatic triangles.
Comput. Geom., 2009
Compatible geometric matchings.
,
,
,
,
,
,
,
,
,
,
,
,
Comput. Geom., 2009
On minimum weight pseudo-triangulations.
Comput. Geom., 2009
Improved upper bounds on the reflexivity of point sets.
Comput. Geom., 2009
Recovering Structure from <i>r</i>-Sampled Objects.
Comput. Graph. Forum, 2009
Medial axis computation for planar free-form shapes.
Comput. Aided Des., 2009
2008
On the number of pseudo-triangulations of certain point sets.
J. Comb. Theory A, 2008
Triangulations without pointed spanning trees.
Comput. Geom., 2008
Matching edges and faces in polygonal partitions.
Comput. Geom., 2008
2007
Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-Triangles.
Graphs Comb., 2007
On the Number of Plane Geometric Graphs.
Graphs Comb., 2007
Gray Code Enumeration of Plane Straight-Line Graphs.
Graphs Comb., 2007
New results on lower bounds for the number of (k)-facets: (extended abstract).
Electron. Notes Discret. Math., 2007
New Lower Bounds for the Number of (<=k)-Edges and the Rectilinear Crossing Number of K<sub>n</sub>.
Discret. Comput. Geom., 2007
Pre-Triangulations and Liftable Complexes.
Discret. Comput. Geom., 2007
Connecting colored point sets.
Discret. Appl. Math., 2007
A quadratic distance bound on sliding between crossing-free spanning trees.
Comput. Geom., 2007
Abstract order type extension and new results on the rectilinear crossing number.
Comput. Geom., 2007
On (Pointed) Minimum Weight Pseudo-Triangulations.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007
2006
Transforming spanning trees and pseudo-triangulations.
Inf. Process. Lett., 2006
On the Crossing Number of Complete Graphs.
Computing, 2006
On the number of plane graphs.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006
2005
Theor. Comput. Sci., 2005
On pseudo-convex decompositions, partitions, and coverings.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005
2004
Quickest Paths, Straight Skeletons, and the City Voronoi Diagram.
Discret. Comput. Geom., 2004
A lower bound on the number of triangulations of planar point sets.
Comput. Geom., 2004
Convexity minimizes pseudo-triangulations.
Comput. Geom., 2004
2003
Towards compatible triangulations.
Theor. Comput. Sci., 2003
Pseudotriangulations from Surfaces and a Novel Type of Edge Flip.
SIAM J. Comput., 2003
Long proteins with unique optimal foldings in the H-P model.
Comput. Geom., 2003
The Zigzag Path of a Pseudo-Triangulation.
Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003
Adapting (Pseudo)-Triangulations with a Near-Linear Number of Edge Flips.
Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003
Spatial embedding of pseudo-triangulations.
Proceedings of the 19th ACM Symposium on Computational Geometry, 2003
Degree Bounds for Constrained Pseudo-Triangulations.
Proceedings of the 15th Canadian Conference on Computational Geometry, 2003
2002
Enumerating Order Types for Small Point Sets with Applications.
Order, 2002
On Flips in Polyhedral Surfaces.
Int. J. Found. Comput. Sci., 2002
Discret. Comput. Geom., 2002
Sequences of spanning trees and a fixed tree theorem.
Comput. Geom., 2002
Playing with Triangulations.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2002
2001
Generalized self-approaching curves.
Discret. Appl. Math., 2001
Reconfiguring convex polygons.
Comput. Geom., 2001
Enumerating order types for small sets with applications.
Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001
The point set order type data base: A collection of applications and results.
Proceedings of the 13th Canadian Conference on Computational Geometry, 2001
On the number of triangulations every planar point set must have.
Proceedings of the 13th Canadian Conference on Computational Geometry, 2001
2000
Edge Operations on Non-Crossing Spanning Trees.
EuroCG, 2000
1999
New Results on MWT Subgraphs.
Inf. Process. Lett., 1999
Int. J. Comput. Geom. Appl., 1999
The Path of a Triangulation.
Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999
1998
Constant-Level Greedy Triangulations Approximate the MWT Well.
J. Comb. Optim., 1998
1997
Matching Shapes with a Reference Point.
Int. J. Comput. Geom. Appl., 1997
Voronoi Diagrams for Direction-Sensitive Distances.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997
1996
Classifying Hyperplanes in Hypercubes.
SIAM J. Discret. Math., 1996
Triangulations Intersect Nicely.
Discret. Comput. Geom., 1996
Straight Skeletons for General Polygonal Figures in the Plane.
Proceedings of the Computing and Combinatorics, Second Annual International Conference, 1996
1995
A Novel Type of Skeleton for Polygons.
J. Univers. Comput. Sci., 1995
Triangulations Intersect Nicely.
Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995
