Vida Dujmovic

CoRR, 2024

Rectilinear Crossing Number of Graphs Excluding Single-Crossing Graphs as Minors.

[BibT_eX]

[DOI]

Camille La Rose

CoRR, 2024

Bounded-Degree Planar Graphs Do Not Have Bounded-Degree Product Structure.

[BibT_eX]

[DOI]

Electron. J. Comb., 2024

Graphs Drawn With Some Vertices per Face: Density and Relationships.

[BibT_eX]

[DOI]

IEEE Access, 2024

The Grid-Minor Theorem Revisited.

[BibT_eX]

[DOI]

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Rectilinear Crossing Number of Graphs Excluding a Single-Crossing Graph as a Minor.

[BibT_eX]

[DOI]

Camille La Rose

Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 2024

On k-Planar Graphs Without Short Cycles.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 2024

2023

Graph product structure for non-minor-closed classes.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2023

Connected Dominating Sets in Triangulations.

[BibT_eX]

[DOI]

CoRR, 2023

Min-k-planar Drawings of Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

Proof of the Clustered Hadwiger Conjecture.

[BibT_eX]

[DOI]

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022

Separating layered treewidth and row treewidth.

[BibT_eX]

[DOI]

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

Clustered 3-colouring graphs of bounded degree.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2022

Linear versus centred chromatic numbers.

[BibT_eX]

[DOI]

CoRR, 2022

$2\times n$ Grids have Unbounded Anagram-Free Chromatic Number.

[BibT_eX]

[DOI]

Electron. J. Comb., 2022

Stack-Number is Not Bounded by Queue-Number.

[BibT_eX]

[DOI]

Comb., 2022

2021

On dispersable book embeddings.

[BibT_eX]

[DOI]

Muhammad Jawaherul Alam

Theor. Comput. Sci., 2021

Local routing in WSPD-based spanners.

[BibT_eX]

[DOI]

J. Comput. Geom., 2021

Two Results on Layered Pathwidth and Linear Layouts.

[BibT_eX]

[DOI]

Céline Yelle

J. Graph Algorithms Appl., 2021

2×n Grids have Unbounded Anagram-Free Chromatic Number.

[BibT_eX]

[DOI]

CoRR, 2021

2020

Minor-Closed Graph Classes with Bounded Layered Pathwidth.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2020

Face flips in origami tessellations.

[BibT_eX]

[DOI]

J. Comput. Geom., 2020

Asymptotically Optimal Vertex Ranking of Planar Graphs.

[BibT_eX]

[DOI]

CoRR, 2020

Adjacency Labelling for Planar Graphs (and Beyond).

[BibT_eX]

[DOI]

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019

Notes on growing a tree in a graph.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2019

The structure of k-planar graphs.

[BibT_eX]

[DOI]

CoRR, 2019

Planar graphs have bounded nonrepetitive chromatic number.

[BibT_eX]

[DOI]

CoRR, 2019

Queue Layouts of Graphs with Bounded Degree and Bounded Genus.

[BibT_eX]

[DOI]

Luís Fernando Schultz Xavier da Silveira

CoRR, 2019

More Turán-Type Theorems for Triangles in Convex Point Sets.

[BibT_eX]

[DOI]

Electron. J. Comb., 2019

Track Layouts, Layered Path Decompositions, and Leveled Planarity.

[BibT_eX]

[DOI]

Algorithmica, 2019

Every Collinear Set in a Planar Graph Is Free.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Planar Graphs have Bounded Queue-Number.

[BibT_eX]

[DOI]

Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers.

[BibT_eX]

[DOI]

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

Dual Circumference and Collinear Sets.

[BibT_eX]

[DOI]

Proceedings of the 35th International Symposium on Computational Geometry, 2019

Graph Drawing via Layered Partitions.

[BibT_eX]

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

2018

Corrigendum: Orthogonal Tree Decompositions of Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

Orthogonal Tree Decompositions of Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

Thickness and antithickness of graphs.

[BibT_eX]

[DOI]

J. Comput. Geom., 2018

Near-Optimal O(k)-Robust Geometric Spanners.

[BibT_eX]

[DOI]

CoRR, 2018

Tight Upper Bounds on the Crossing Number in a Minor-Closed Class.

[BibT_eX]

[DOI]

Ken-ichi Kawarabayashi

Bojan Mohar

CoRR, 2018

A note on choosability with defect 1 of graphs on surfaces.

[BibT_eX]

[DOI]

Djedjiga Outioua

CoRR, 2018

Anagram-Free Chromatic Number Is Not Pathwidth-Bounded.

[BibT_eX]

[DOI]

Paz Carmi

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

Geodesic Obstacle Representation of Graphs.

[BibT_eX]

[DOI]

Fabrizio Montecchiani

Luís Fernando Schultz Xavier da Silveira

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

Pole Dancing: 3D Morphs for Tree Drawings.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 26th International Symposium, 2018

2017

Structure of Graphs with Locally Restricted Crossings.

[BibT_eX]

[DOI]

David Eppstein

SIAM J. Discret. Math., 2017

Layered separators in minor-closed graph classes with applications.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2017

Local Routing in Spanners Based on WSPDs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

EPG-representations with Small Grid-Size.

[BibT_eX]

[DOI]

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

2016

Nonrepetitive colouring via entropy compression.

[BibT_eX]

[DOI]

Comb., 2016

Layouts of Expander Graphs.

[BibT_eX]

[DOI]

Anastasios Sidiropoulos

Chic. J. Theor. Comput. Sci., 2016

Drawing Planar Graphs with Many Collinear Vertices.

[BibT_eX]

[DOI]

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

Stack and Queue Layouts via Layered Separators.

[BibT_eX]

[DOI]

Fabrizio Frati

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

Track Layout Is Hard.

[BibT_eX]

[DOI]

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

New Bounds for Facial Nonrepetitive Colouring.

[BibT_eX]

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

2015

Empty Pentagons in Point Sets with Collinearities.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2015

Graph layouts via layered separators.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2015

Average Stretch Factor: How Low Does It Go?

[BibT_eX]

[DOI]

Michiel H. M. Smid

Discret. Comput. Geom., 2015

3-Monotone Expanders.

[BibT_eX]

[DOI]

Anastasios Sidiropoulos

CoRR, 2015

On Obstacle Numbers.

[BibT_eX]

[DOI]

Electron. J. Comb., 2015

Compatible Connectivity-Augmentation of Planar Disconnected Graphs.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Genus, Treewidth, and Local Crossing Number.

[BibT_eX]

[DOI]

David Eppstein

Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

The Utility of Untangling.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

2014

Crossings in Grid Drawings.

[BibT_eX]

[DOI]

Adam Sheffer

Electron. J. Comb., 2014

2013

Three-Dimensional Drawings.

[BibT_eX]

Proceedings of the Handbook on Graph Drawing and Visualization., 2013

A Linear-Time Algorithm for Finding a Complete Graph Minor in a Dense Graph.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 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

Layered Separators in Minor-Closed Families with Applications.

[BibT_eX]

[DOI]

CoRR, 2013

Nonrepetitive Colourings of Planar Graphs with O(log n) Colours.

[BibT_eX]

[DOI]

Electron. J. Comb., 2013

Layered Separators for Queue Layouts, 3D Graph Drawing and Nonrepetitive Coloring.

[BibT_eX]

[DOI]

Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

Robust geometric spanners.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Computational Geometry 2013, 2013

2012

Entropy, triangulation, and point location in planar subdivisions.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2012

An Improved Bound for First-Fit on Posets Without Two Long Incomparable Chains.

[BibT_eX]

[DOI]

Gwenaël Joret

SIAM J. Discret. Math., 2012

PROXIMITY GRAPHS: E, δ, Δ, χ AND ω.

[BibT_eX]

[DOI]

Vera Sacristán Adinolfi

Maria Saumell

Int. J. Comput. Geom. Appl., 2012

Memoryless routing in convex subdivisions: Random walks are optimal.

[BibT_eX]

[DOI]

Comput. Geom., 2012

An affine invariant k-nearest neighbor regression estimate.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Visibility Monotonic Polygon Deflation.

[BibT_eX]

[DOI]

Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

2011

On the maximum number of cliques in a graph embedded in a surface.

[BibT_eX]

[DOI]

Eur. J. Comb., 2011

On the Book Thickness of k-Trees.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2011

Nonrepetitive Colouring via Entropy Compression

[BibT_eX]

[DOI]

Gwenaël Joret

CoRR, 2011

A note on the perimeter of fat objects.

[BibT_eX]

[DOI]

Prosenjit Bose

Otfried Cheong

Comput. Geom., 2011

Meshes Preserving Minimum Feature Size.

[BibT_eX]

[DOI]

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

On Point-Sets That Support Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 19th International Symposium, 2011

A center transversal theorem for hyperplanes and applications to graph drawing.

[BibT_eX]

[DOI]

Stefan Langerman

Proceedings of the 27th ACM Symposium on Computational Geometry, 2011

Convexifying Polygons Without Losing Visibilities.

[BibT_eX]

[DOI]

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

[BibT_eX]

[DOI]

CoRR, 2010

Odds-On Trees

[BibT_eX]

[DOI]

CoRR, 2010

Point Location in Disconnected Planar Subdivisions

[BibT_eX]

[DOI]

CoRR, 2010

An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2010

Layered Working-Set Trees.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2010: Theoretical Informatics, 2010

On Graphs Supported by Line Sets.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 18th International Symposium, 2010

Coverage with k-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

Common Unfoldings of Polyominoes and Polycubes.

[BibT_eX]

[DOI]

Proceedings of the Computational Geometry, Graphs and Applications, 2010

Ghost chimneys.

[BibT_eX]

[DOI]

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

Fast local searches and updates in bounded universes.

[BibT_eX]

[DOI]

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

On the perimeter of fat objects.

[BibT_eX]

[DOI]

Prosenjit Bose

Otfried Cheong

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

Notes on Large Angle Crossing Graphs.

[BibT_eX]

[DOI]

Proceedings of the Theory of Computing 2010, 2010

2009

Connectivity-preserving transformations of binary images.

[BibT_eX]

[DOI]

Comput. Vis. Image Underst., 2009

Minimum feature size preserving decompositions

[BibT_eX]

[DOI]

CoRR, 2009

Biased range trees.

[BibT_eX]

[DOI]

John Howat

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Every Large Point Set contains Many Collinear Points or an Empty Pentagon.

[BibT_eX]

[DOI]

Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

2008

A Polynomial Bound for Untangling Geometric Planar Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2008

Distinct Distances in Graph Drawings.

[BibT_eX]

[DOI]

Electron. J. Comb., 2008

On the Parameterized Complexity of Layered Graph Drawing.

[BibT_eX]

[DOI]

Algorithmica, 2008

Distribution-sensitive point location in convex subdivisions.

[BibT_eX]

[DOI]

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Improved upper bounds on the crossing number.

[BibT_eX]

[DOI]

Ken-ichi Kawarabayashi

Bojan Mohar

Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

Triangulating and Guarding Realistic Polygons.

[BibT_eX]

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

2007

Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra.

[BibT_eX]

[DOI]

SIAM J. Comput., 2007

Graph drawings with few slopes.

[BibT_eX]

[DOI]

Matthew Suderman

Comput. Geom., 2007

Drawings of planar graphs with few slopes and segments.

[BibT_eX]

[DOI]

Comput. Geom., 2007

A Characterization of the Degree Sequences of 2-trees.

[BibT_eX]

[DOI]

Proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics, 2007

2006

Upward Three-Dimensional Grid Drawings of Graphs.

[BibT_eX]

[DOI]

Order, 2006

A Fixed-Parameter Approach to 2-Layer Planarization.

[BibT_eX]

[DOI]

Algorithmica, 2006

Curves in the Sand: Algorithmic Drawing.

[BibT_eX]

[DOI]

Godfried T. Toussaint

Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

2005

Layout of Graphs with Bounded Tree-Width.

[BibT_eX]

[DOI]

SIAM J. Comput., 2005

Stacks, Queues and Tracks: Layouts of Graph Subdivisions.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2005

Induced Subgraphs of Bounded Degree and Bounded Treewidth.

[BibT_eX]

[DOI]

Prosenjit Bose

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

Graph Treewidth and Geometric Thickness Parameters.

[BibT_eX]

[DOI]

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

Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint.

[BibT_eX]

[DOI]

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

2004

On Linear Layouts of Graphs.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2004

Track Layouts of Graphs.

[BibT_eX]

[DOI]

Attila Pór

Discret. Math. Theor. Comput. Sci., 2004

Layouts of Graph Subdivisions.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 12th International Symposium, 2004

Really Straight Graph Drawings.

[BibT_eX]

[DOI]

Matthew Suderman

Proceedings of the Graph Drawing, 12th International Symposium, 2004

The number of lines tangent to arbitrary convex polyhedra in 3D.

[BibT_eX]

[DOI]

Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

2003

The Expected Number of 3D Visibility Events Is Linear.

[BibT_eX]

[DOI]

SIAM J. Comput., 2003

Tree-Partitions of k-Trees with Applications in Graph Layout.

[BibT_eX]

[DOI]

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

Three-Dimensional Grid Drawings with Sub-quadratic Volume.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 11th International Symposium, 2003

Fixed Parameter Algorithms for one-sided crossing minimization Revisited.

[BibT_eX]

[DOI]

Henning Fernau

Michael Kaufmann

Proceedings of the Graph Drawing, 11th International Symposium, 2003

2002

Flipturning Polygons.

[BibT_eX]

[DOI]

Godfried T. Toussaint

Discret. Comput. Geom., 2002

Flat-State Connectivity of Linkages under Dihedral Motions.

[BibT_eX]

[DOI]

Godfried T. Toussaint

Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization.

[BibT_eX]

[DOI]

Sue Whitesides

Proceedings of the Graph Drawing, 10th International Symposium, 2002

Path-Width and Three-Dimensional Straight-Line Grid Drawings of Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 10th International Symposium, 2002

On the number of lines tangent to four convex polyhedra.

[BibT_eX]

[DOI]

Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

2001

On validating planar worlds.

[BibT_eX]

[DOI]

Sue Whitesides

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

A Fixed-Parameter Approach to Two-Layer Planarization.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 9th International Symposium, 2001

On the Parameterized Complexity of Layered Graph Drawing.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2001

1999

Efficient Topological Exploration.

[BibT_eX]

[DOI]

Ioannis M. Rekleitis