2024
The Excluded Tree Minor Theorem Revisited.
Comb. Probab. Comput., January, 2024
Free Sets in Planar Graphs: History and Applications.
CoRR, 2024
Tight bound for the Erdős-Pósa property of tree minors.
CoRR, 2024
Rectilinear Crossing Number of Graphs Excluding Single-Crossing Graphs as Minors.
CoRR, 2024
Grid Minors and Products.
CoRR, 2024
The Grid-Minor Theorem Revisited.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024
2023
Graph product structure for non-minor-closed classes.
J. Comb. Theory, Ser. B, 2023
Dual Circumference and Collinear Sets.
Discret. Comput. Geom., 2023
Connected Dominating Sets in Triangulations.
CoRR, 2023
Geodesic obstacle representation of graphs.
Comput. Geom., 2023
Min-k-planar Drawings of Graphs.
Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023
Proof of the Clustered Hadwiger Conjecture.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023
2022
Separating layered treewidth and row treewidth.
Discret. Math. Theor. Comput. Sci., 2022
Clustered 3-colouring graphs of bounded degree.
Comb. Probab. Comput., 2022
Linear versus centred chromatic numbers.
CoRR, 2022
$2\times n$ Grids have Unbounded Anagram-Free Chromatic Number.
Electron. J. Comb., 2022
Stack-Number is Not Bounded by Queue-Number.
Comb., 2022
2021
On dispersable book embeddings.
Theor. Comput. Sci., 2021
Local routing in WSPD-based spanners.
J. Comput. Geom., 2021
Two Results on Layered Pathwidth and Linear Layouts.
J. Graph Algorithms Appl., 2021
Adjacency Labelling for Planar Graphs (and Beyond).
J. ACM, 2021
Every Collinear Set in a Planar Graph is Free.
Discret. Comput. Geom., 2021
2×n Grids have Unbounded Anagram-Free Chromatic Number.
CoRR, 2021
Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers.
,
,
,
,
,
,
,
,
,
,
Algorithmica, 2021
2020
Minor-Closed Graph Classes with Bounded Layered Pathwidth.
SIAM J. Discret. Math., 2020
Face flips in origami tessellations.
J. Comput. Geom., 2020
Planar Graphs Have Bounded Queue-Number.
J. ACM, 2020
Asymptotically Optimal Vertex Ranking of Planar Graphs.
CoRR, 2020
2019
Notes on growing a tree in a graph.
Random Struct. Algorithms, 2019
Pole Dancing: 3D Morphs for Tree Drawings.
J. Graph Algorithms Appl., 2019
The structure of k-planar graphs.
CoRR, 2019
Planar graphs have bounded nonrepetitive chromatic number.
CoRR, 2019
Queue Layouts of Graphs with Bounded Degree and Bounded Genus.
CoRR, 2019
More Turán-Type Theorems for Triangles in Convex Point Sets.
Electron. J. Comb., 2019
Track Layouts, Layered Path Decompositions, and Leveled Planarity.
Algorithmica, 2019
Graph Drawing via Layered Partitions.
Proceedings of the 31st Canadian Conference on Computational Geometry, 2019
2018
Corrigendum: Orthogonal Tree Decompositions of Graphs.
SIAM J. Discret. Math., 2018
Orthogonal Tree Decompositions of Graphs.
SIAM J. Discret. Math., 2018
Drawing planar graphs with many collinear vertices.
J. Comput. Geom., 2018
Thickness and antithickness of graphs.
J. Comput. Geom., 2018
Stack and Queue Layouts via Layered Separators.
J. Graph Algorithms Appl., 2018
Near-Optimal O(k)-Robust Geometric Spanners.
CoRR, 2018
Tight Upper Bounds on the Crossing Number in a Minor-Closed Class.
CoRR, 2018
A note on choosability with defect 1 of graphs on surfaces.
CoRR, 2018
Anagram-Free Chromatic Number Is Not Pathwidth-Bounded.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018
2017
Structure of Graphs with Locally Restricted Crossings.
SIAM J. Discret. Math., 2017
The Utility of Untangling.
J. Graph Algorithms Appl., 2017
Layered separators in minor-closed graph classes with applications.
J. Comb. Theory, Ser. B, 2017
New Bounds for Facial Nonrepetitive Colouring.
Graphs Comb., 2017
Local Routing in Spanners Based on WSPDs.
Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017
EPG-representations with Small Grid-Size.
Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017
2016
Nonrepetitive colouring via entropy compression.
Comb., 2016
Layouts of Expander Graphs.
Chic. J. Theor. Comput. Sci., 2016
Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016
2015
Empty Pentagons in Point Sets with Collinearities.
SIAM J. Discret. Math., 2015
Graph layouts via layered separators.
J. Comb. Theory, Ser. B, 2015
Average Stretch Factor: How Low Does It Go?
Discret. Comput. Geom., 2015
Compatible Connectivity Augmentation of Planar Disconnected Graphs.
Discret. Comput. Geom., 2015
Visibility-monotonic polygon deflation.
Contributions Discret. Math., 2015
Genus, Treewidth, and Local Crossing Number.
Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015
2014
Triangulating and guarding realistic polygons.
Comput. Geom., 2014
Crossings in Grid Drawings.
Electron. J. Comb., 2014
2013
Three-Dimensional Drawings.
Proceedings of the Handbook on Graph Drawing and Visualization., 2013
A Linear-Time Algorithm for Finding a Complete Graph Minor in a Dense Graph.
SIAM J. Discret. Math., 2013
Robust Geometric Spanners.
SIAM J. Comput., 2013
Coverage with k-transmitters in the presence of obstacles.
,
,
,
,
,
,
,
,
,
,
,
,
,
J. Comb. Optim., 2013
A Center Transversal Theorem for Hyperplanes and Applications to Graph Drawing.
Discret. Comput. Geom., 2013
Layered Separators in Minor-Closed Families with Applications.
CoRR, 2013
On point-sets that support planar graphs.
Comput. Geom., 2013
Fast local searches and updates in bounded universes.
Comput. Geom., 2013
Nonrepetitive Colourings of Planar Graphs with O(log n) Colours.
Electron. J. Comb., 2013
Layered Separators for Queue Layouts, 3D Graph Drawing and Nonrepetitive Coloring.
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013
2012
Entropy, triangulation, and point location in planar subdivisions.
ACM Trans. Algorithms, 2012
An Improved Bound for First-Fit on Posets Without Two Long Incomparable Chains.
SIAM J. Discret. Math., 2012
An affine invariant k-nearest neighbor regression estimate.
J. Multivar. Anal., 2012
Int. J. Comput. Geom. Appl., 2012
PROXIMITY GRAPHS: E, δ, Δ, χ AND ω.
Int. J. Comput. Geom. Appl., 2012
Memoryless routing in convex subdivisions: Random walks are optimal.
Comput. Geom., 2012
Layered Working-Set Trees.
Algorithmica, 2012
2011
Every Large Point Set contains Many Collinear Points or an Empty Pentagon.
Graphs Comb., 2011
On the maximum number of cliques in a graph embedded in a surface.
Eur. J. Comb., 2011
On the Book Thickness of k-Trees.
Discret. Math. Theor. Comput. Sci., 2011
Nonrepetitive Colouring via Entropy Compression
CoRR, 2011
A note on the perimeter of fat objects.
Comput. Geom., 2011
Notes on Large Angle Crossing Graphs.
Chic. J. Theor. Comput. Sci., 2011
Meshes Preserving Minimum Feature Size.
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
An O(loglog n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times
CoRR, 2010
Point Location in Disconnected Planar Subdivisions
CoRR, 2010
An <i>O</i>(log log <i>n</i>)-Competitive Binary Search Tree with Optimal Worst-Case Access Times.
Proceedings of the Algorithm Theory, 2010
On Graphs Supported by Line Sets.
Proceedings of the Graph Drawing - 18th International Symposium, 2010
Coverage with <i>k</i>-Transmitters in the Presence of Obstacles.
,
,
,
,
,
,
,
,
,
,
,
,
,
Proceedings of the Combinatorial Optimization and Applications, 2010
Common Unfoldings of Polyominoes and Polycubes.
Proceedings of the Computational Geometry, Graphs and Applications, 2010
On the perimeter of fat objects.
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010
2009
Connectivity-preserving transformations of binary images.
Comput. Vis. Image Underst., 2009
Minimum feature size preserving decompositions
CoRR, 2009
2008
A Characterization of the degree sequences of 2-trees.
J. Graph Theory, 2008
Fixed parameter algorithms for one-sided crossing minimization revisited.
J. Discrete Algorithms, 2008
A Polynomial Bound for Untangling Geometric Planar Graphs.
Electron. Notes Discret. Math., 2008
Distinct Distances in Graph Drawings.
Electron. J. Comb., 2008
On the Parameterized Complexity of Layered Graph Drawing.
Algorithmica, 2008
Distribution-sensitive point location in convex subdivisions.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008
Improved upper bounds on the crossing number.
Proceedings of the 24th ACM Symposium on Computational Geometry, 2008
2007
Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra.
SIAM J. Comput., 2007
Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint.
Int. J. Comput. Geom. Appl., 2007
Graph Treewidth and Geometric Thickness Parameters.
Discret. Comput. Geom., 2007
Graph drawings with few slopes.
Comput. Geom., 2007
Drawings of planar graphs with few slopes and segments.
Comput. Geom., 2007
2006
Upward Three-Dimensional Grid Drawings of Graphs.
Order, 2006
Induced Subgraphs of Bounded Degree and Bounded Treewidth.
Contributions Discret. Math., 2006
A Fixed-Parameter Approach to 2-Layer Planarization.
,
,
,
,
,
,
,
,
,
,
,
Algorithmica, 2006
Curves in the Sand: Algorithmic Drawing.
,
,
,
,
,
,
,
,
,
,
,
,
Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006
2005
Layout of Graphs with Bounded Tree-Width.
SIAM J. Comput., 2005
Stacks, Queues and Tracks: Layouts of Graph Subdivisions.
Discret. Math. Theor. Comput. Sci., 2005
2004
On Linear Layouts of Graphs.
Discret. Math. Theor. Comput. Sci., 2004
Discret. Math. Theor. Comput. Sci., 2004
An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization.
Algorithmica, 2004
Layouts of Graph Subdivisions.
Proceedings of the Graph Drawing, 12th International Symposium, 2004
Really Straight Graph Drawings.
Proceedings of the Graph Drawing, 12th International Symposium, 2004
The number of lines tangent to arbitrary convex polyhedra in 3D.
Proceedings of the 20th ACM Symposium on Computational Geometry, 2004
2003
The Expected Number of 3D Visibility Events Is Linear.
SIAM J. Comput., 2003
Tree-Partitions of k-Trees with Applications in Graph Layout.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003
Three-Dimensional Grid Drawings with Sub-quadratic Volume.
Proceedings of the Graph Drawing, 11th International Symposium, 2003
2002
Discret. Comput. Geom., 2002
Flat-State Connectivity of Linkages under Dihedral Motions.
,
,
,
,
,
,
,
,
,
,
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002
Path-Width and Three-Dimensional Straight-Line Grid Drawings of Graphs.
Proceedings of the Graph Drawing, 10th International Symposium, 2002
On the number of lines tangent to four convex polyhedra.
Proceedings of the 14th Canadian Conference on Computational Geometry, 2002
2001
On validating planar worlds.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001
A Fixed-Parameter Approach to Two-Layer Planarization.
,
,
,
,
,
,
,
,
,
,
,
Proceedings of the Graph Drawing, 9th International Symposium, 2001
On the Parameterized Complexity of Layered Graph Drawing.
,
,
,
,
,
,
,
,
,
,
,
Proceedings of the Algorithms, 2001
1999
Efficient Topological Exploration.
Proceedings of the 1999 IEEE International Conference on Robotics and Automation, 1999
