David R. Wood

CoRR, May, 2026

The Dominating 4-Colour Theorem.

[BibT_eX]

[DOI]

CoRR, May, 2026

Adjacency labelling for proper minor-closed graph classes.

[BibT_eX]

[DOI]

CoRR, May, 2026

Sparse String Graphs and Region Intersection Graphs over Minor-Closed Classes have Linear Expansion.

[BibT_eX]

[DOI]

Nikolai Karol

CoRR, April, 2026

Tree-partitions and small-spread tree-decompositions.

[BibT_eX]

[DOI]

CoRR, April, 2026

Reduced bandwidth: A qualitative strengthening of twin-width in minor-closed classes (and beyond).

[BibT_eX]

[DOI]

Édouard Bonnet

O-joung Kwon

J. Comb. Theory B, 2026

2025

Optimal Tree-Decompositions with Bags of Bounded Treewidth.

[BibT_eX]

[DOI]

CoRR, November, 2025

Expansion of gap-planar graphs.

[BibT_eX]

[DOI]

CoRR, September, 2025

Tree decompositions with small width, spread, order and degree.

[BibT_eX]

[DOI]

CoRR, September, 2025

Structure of k-Matching-Planar Graphs.

[BibT_eX]

[DOI]

Nikolai Karol

CoRR, July, 2025

3-Colouring Planar Graphs.

[BibT_eX]

[DOI]

CoRR, July, 2025

Polynomial Bounds in the Apex Minor Theorem.

[BibT_eX]

[DOI]

CoRR, March, 2025

Dominating Kt-Models.

[BibT_eX]

[DOI]

Freddie Illingworth

J. Graph Theory, 2025

Structural properties of graph products.

[BibT_eX]

[DOI]

Robert Hickingbotham

J. Graph Theory, 2025

Product Structure of Graph Classes with Strongly Sublinear Separators.

[BibT_eX]

[DOI]

Zdenek Dvorák

Innov. Graph Theory, 2025

Treewidth 2 in the Planar Graph Product Structure Theorem.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2025

Grid Minors and Products.

[BibT_eX]

[DOI]

Electron. J. Comb., 2025

Clustered Colouring of Graph Products.

[BibT_eX]

[DOI]

Electron. J. Comb., 2025

Planar Graphs in Blowups of Fans.

[BibT_eX]

[DOI]

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

2024

Three-Dimensional Graph Products with Unbounded Stack-Number.

[BibT_eX]

[DOI]

Discret. Comput. Geom., June, 2024

Defective coloring of hypergraphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, May, 2024

Shallow Minors, Graph Products, and Beyond-Planar Graphs.

[BibT_eX]

[DOI]

Robert Hickingbotham

SIAM J. Discret. Math., March, 2024

Treewidth, Circle Graphs, and Circular Drawings.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., March, 2024

The product structure of squaregraphs.

[BibT_eX]

[DOI]

J. Graph Theory, February, 2024

The Excluded Tree Minor Theorem Revisited.

[BibT_eX]

[DOI]

Comb. Probab. Comput., January, 2024

Product Structure Extension of the Alon-Seymour-Thomas Theorem.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2024

Powers of planar graphs, product structure, and blocking partitions.

[BibT_eX]

[DOI]

Innov. Graph Theory, 2024

Clustered coloring of graphs with bounded layered treewidth and bounded degree.

[BibT_eX]

[DOI]

Chun-Hung Liu

Eur. J. Comb., 2024

Colouring strong products.

[BibT_eX]

[DOI]

Louis Esperet

Eur. J. Comb., 2024

Product structure of graph classes with bounded treewidth.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2024

Product Structure and Tree-Decompositions.

[BibT_eX]

[DOI]

Chun-Hung Liu

Sergey Norin

CoRR, 2024

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

[BibT_eX]

[DOI]

Electron. J. Comb., 2024

The Grid-Minor Theorem Revisited.

[BibT_eX]

[DOI]

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

2023

Refined List Version of Hadwiger's Conjecture.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., September, 2023

Clustered colouring of graph classes with bounded treedepth or pathwidth.

[BibT_eX]

[DOI]

Sergey Norin

Alex Scott

Comb. Probab. Comput., January, 2023

2-Layer Graph Drawings with Bounded Pathwidth.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2023

Graph product structure for non-minor-closed classes.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2023

Graphs of Linear Growth have Bounded Treewidth.

[BibT_eX]

[DOI]

Electron. J. Comb., 2023

Proof of the Clustered Hadwiger Conjecture.

[BibT_eX]

[DOI]

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

2022

A General Framework for Hypergraph Coloring.

[BibT_eX]

[DOI]

Ian M. Wanless

SIAM J. Discret. Math., 2022

Clustered variants of Hajós' conjecture.

[BibT_eX]

[DOI]

Chun-Hung Liu

J. Comb. Theory B, 2022

Improved product structure for graphs on surfaces.

[BibT_eX]

[DOI]

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

Separating layered treewidth and row treewidth.

[BibT_eX]

[DOI]

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

Subgraph densities in a surface.

[BibT_eX]

[DOI]

Tony Huynh

Comb. Probab. Comput., 2022

Clustered 3-colouring graphs of bounded degree.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2022

Product structure of graph classes with strongly sublinear separators.

[BibT_eX]

[DOI]

CoRR, 2022

Inducibility and universality for trees.

[BibT_eX]

[DOI]

Comb. Theory, 2022

An Improved Planar Graph Product Structure Theorem.

[BibT_eX]

[DOI]

Torsten Ueckerdt

Wendy Yi

Electron. J. Comb., 2022

Stack-Number is Not Bounded by Queue-Number.

[BibT_eX]

[DOI]

Comb., 2022

2021

The Size Ramsey Number of Graphs with Bounded Treewidth.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2021

Smaller Extended Formulations for Spanning Tree Polytopes in Minor-closed Classes and Beyond.

[BibT_eX]

[DOI]

Electron. J. Comb., 2021

2020

Minor-Closed Graph Classes with Bounded Layered Pathwidth.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2020

A variant of the Erdős-Sós conjecture.

[BibT_eX]

[DOI]

J. Graph Theory, 2020

Nonrepetitive graph colouring.

[BibT_eX]

[DOI]

CoRR, 2020

Notes on Tree- and Path-chromatic Number.

[BibT_eX]

[DOI]

CoRR, 2020

Notes on Graph Product Structure Theory.

[BibT_eX]

[DOI]

CoRR, 2020

A Lower Bound on the Average Degree Forcing a Minor.

[BibT_eX]

[DOI]

Electron. J. Comb., 2020

Seymour's Conjecture on 2-Connected Graphs of Large Pathwidth.

[BibT_eX]

[DOI]

Comb., 2020

2019

A Golden Ratio Inequality for Vertex Degrees of Graphs.

[BibT_eX]

[DOI]

Fiachra Knox

Bojan Mohar

Am. Math. Mon., 2019

Nonrepetitive colorings of graphs excluding a fixed immersion or topological minor.

[BibT_eX]

[DOI]

Paul Wollan

J. Graph Theory, 2019

Bad news for chordal partitions.

[BibT_eX]

[DOI]

Alex Scott

Paul D. Seymour

J. Graph Theory, 2019

Defective and clustered choosability of sparse graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 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]

CoRR, 2019

Clustered Colouring in Minor-Closed Classes.

[BibT_eX]

[DOI]

Comb., 2019

Defective Colouring of Graphs Excluding A Subgraph or Minor.

[BibT_eX]

[DOI]

Patrice Ossona de Mendez

Sang-il Oum

Comb., 2019

Track Layouts, Layered Path Decompositions, and Leveled Planarity.

[BibT_eX]

[DOI]

Algorithmica, 2019

Planar Graphs have Bounded Queue-Number.

[BibT_eX]

[DOI]

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

2018

Anagram-Free Colorings of Graph Subdivisions.

[BibT_eX]

[DOI]

Tim E. Wilson

SIAM J. Discret. Math., 2018

K4-Minor-Free Induced Subgraphs of Sparse Connected Graphs.

[BibT_eX]

[DOI]

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

Improper colourings inspired by Hadwiger's conjecture.

[BibT_eX]

[DOI]

Jan van den Heuvel

J. Lond. Math. Soc., 2018

The extremal function for Petersen minors.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2018

The treewidth of line graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2018

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

[BibT_eX]

[DOI]

Ken-ichi Kawarabayashi

Bojan Mohar

CoRR, 2018

Better bounds for poset dimension and boxicity.

[BibT_eX]

[DOI]

Alex Scott

CoRR, 2018

The exact chromatic number of the convex segment disjointness graph.

[BibT_eX]

[DOI]

CoRR, 2018

Anagram-Free Graph Colouring.

[BibT_eX]

[DOI]

Tim E. Wilson

Electron. J. Comb., 2018

2017

Structure of Graphs with Locally Restricted Crossings.

[BibT_eX]

[DOI]

David Eppstein

SIAM J. Discret. Math., 2017

Hadwiger's Conjecture for ℓ-Link Graphs.

[BibT_eX]

[DOI]

Bin Jia

J. Graph Theory, 2017

Parameters Tied to Treewidth.

[BibT_eX]

[DOI]

J. Graph Theory, 2017

Layered separators in minor-closed graph classes with applications.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2017

Majority Colourings of Digraphs.

[BibT_eX]

[DOI]

Stephan Kreutzer

Sang-il Oum

Paul D. Seymour

Dominic van der Zypen

Electron. J. Comb., 2017

2016

Three-Dimensional Graph Drawing.

[BibT_eX]

[DOI]

Guillermo Pineda-Villavicencio

Encyclopedia of Algorithms, 2016

On the maximum order of graphs embedded in surfaces.

[BibT_eX]

[DOI]

Eran Nevo

J. Comb. Theory B, 2016

Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking.

[BibT_eX]

[DOI]

Tony Grubman

Y. Ahmet Sekercioglu

Discret. Appl. Math., 2016

'Forcing a sparse minor' - CORRIGENDUM.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2016

Forcing a sparse minor.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2016

Three dimensional graph drawing with fixed vertices and one bend per edge.

[BibT_eX]

[DOI]

CoRR, 2016

$K_{4}$-Minor-Free Induced Subgraphs of Sparse Connected Graphs.

[BibT_eX]

[DOI]

CoRR, 2016

Cliques in Graphs Excluding a Complete Graph Minor.

[BibT_eX]

[DOI]

Electron. J. Comb., 2016

Average Degree Conditions Forcing a Minor.

[BibT_eX]

[DOI]

Electron. J. Comb., 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

Thoughts on Barnette's Conjecture.

[BibT_eX]

[DOI]

Australas. J Comb., 2016

Track Layout Is Hard.

[BibT_eX]

[DOI]

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

2015

Cycles of Given Size in a Dense Graph.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2015

Empty Pentagons in Point Sets with Collinearities.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2015

Circumference and Pathwidth of Highly Connected Graphs.

[BibT_eX]

[DOI]

Emily Abernethy Marshall

J. Graph Theory, 2015

Treewidth of the Line Graph of a Complete Graph.

[BibT_eX]

[DOI]

J. Graph Theory, 2015

3-Monotone Expanders.

[BibT_eX]

[DOI]

Anastasios Sidiropoulos

Guillermo Pineda-Villavicencio

CoRR, 2015

The Degree-Diameter Problem for Sparse Graph Classes.

[BibT_eX]

[DOI]

Electron. J. Comb., 2015

Genus, Treewidth, and Local Crossing Number.

[BibT_eX]

[DOI]

David Eppstein

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

2014

Which point sets admit a k-angulation?

[BibT_eX]

[DOI]

Michael S. Payne

Jens M. Schmidt

J. Comput. Geom., 2014

General Position Subsets and Independent Hyperplanes in d-Space.

[BibT_eX]

[DOI]

Jean Cardinal

Csaba D. Tóth

CoRR, 2014

Brooks' Vertex-Colouring Theorem in Linear Time.

[BibT_eX]

[DOI]

Bradley Baetz

CoRR, 2014

Progress on Dirac's Conjecture.

[BibT_eX]

[DOI]

Michael S. Payne

Electron. J. Comb., 2014

Treewidth of the Kneser Graph and the Erdős-Ko-Rado Theorem.

[BibT_eX]

[DOI]

Electron. J. Comb., 2014

2013

On the General Position Subset Selection Problem.

[BibT_eX]

[DOI]

Michael S. Payne

SIAM J. Discret. Math., 2013

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

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

Treewidth of Cartesian Products of Highly Connected Graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2013

Complete graph minors and the graph minor structure theorem.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2013

On Multiplicative Sidon Sets.

[BibT_eX]

[DOI]

David Wakeham

Integers, 2013

Proximity Drawings of High-Degree Trees.

[BibT_eX]

[DOI]

Ferran Hurtado

Giuseppe Liotta

Int. J. Comput. Geom. Appl., 2013

Excluded Forest Minors and the Erdős-Pósa Property.

[BibT_eX]

[DOI]

Samuel Fiorini

Comb. Probab. Comput., 2013

Layered Separators in Minor-Closed Families with Applications.

[BibT_eX]

[DOI]

CoRR, 2013

Rooted K4-Minors.

[BibT_eX]

[DOI]

Electron. J. Comb., 2013

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

[BibT_eX]

[DOI]

Electron. J. Comb., 2013

On the Upward Planarity of Mixed Plane Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 21st International Symposium, 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

2012

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

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2012

Colouring the triangles determined by a point set.

[BibT_eX]

[DOI]

J. Comput. Geom., 2012

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

[BibT_eX]

[DOI]

Vera Sacristán Adinolfi

Maria Saumell

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

Token Graphs.

[BibT_eX]

[DOI]

David Flores-Peñaloza

Graphs Comb., 2012

Polynomial treewidth forces a large grid-like-minor.

[BibT_eX]

[DOI]

Eur. J. Comb., 2012

Characterisations and examples of graph classes with bounded expansion.

[BibT_eX]

[DOI]

Jaroslav Nesetril

Patrice Ossona de Mendez

Eur. J. Comb., 2012

Nordhaus-Gaddum for treewidth.

[BibT_eX]

[DOI]

Eur. J. Comb., 2012

Small minors in dense graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2012

On the Connectivity of Visibility Graphs.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2012

Cliques in Odd-Minor-Free Graphs.

[BibT_eX]

[DOI]

Ken-ichi Kawarabayashi

Proceedings of the Eighteenth Computing: The Australasian Theory Symposium, 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

On the number of maximal independent sets in a graph.

[BibT_eX]

[DOI]

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

Colouring the Square of the Cartesian Product of Trees.

[BibT_eX]

[DOI]

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

Nonrepetitive Colouring via Entropy Compression

[BibT_eX]

[DOI]

CoRR, 2011

Disproof of the List Hadwiger Conjecture.

[BibT_eX]

[DOI]

János Barát

Electron. J. Comb., 2011

The Chromatic Number of the Convex Segment Disjointness Graph.

[BibT_eX]

[DOI]

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

2010

Thomassen's Choosability Argument Revisited.

[BibT_eX]

[DOI]

Svante Linusson

SIAM J. Discret. Math., 2010

On Visibility and Blockers.

[BibT_eX]

[DOI]

J. Comput. Geom., 2010

Irreducible triangulations are small.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2010

Contractibility and the Hadwiger Conjecture.

[BibT_eX]

[DOI]

Eur. J. Comb., 2010

Edge-Removal and Non-Crossing Configurations in Geometric Graphs.

[BibT_eX]

[DOI]

Oswin Aichholzer

Sergio Cabello

David Flores-Peñaloza

Discret. Math. Theor. Comput. Sci., 2010

Partitions and Coverings of Trees by Bounded-Degree Subtrees

[BibT_eX]

[DOI]

CoRR, 2010

Graph Minors and Minimum Degree.

[BibT_eX]

[DOI]

Gasper Fijavz

Electron. J. Comb., 2010

2009

A linear-time algorithm to find a separator in a graph excluding a minor.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2009

On tree-partition-width.

[BibT_eX]

[DOI]

Eur. J. Comb., 2009

On the Chromatic Number of some Flip Graphs.

[BibT_eX]

[DOI]

David Flores-Peñaloza

Discret. Math. Theor. Comput. Sci., 2009

The distance geometry of music.

[BibT_eX]

[DOI]

Erik D. Demaine

Francisco Gomez-Martin

Henk Meijer

David Rappaport

Perouz Taslakian

Godfried T. Toussaint

Terry Winograd

Comput. Geom., 2009

Colourings of the cartesian product of graphs and multiplicative Sidon sets.

[BibT_eX]

[DOI]

Comb., 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

Minimum Degree and Graph Minors.

[BibT_eX]

[DOI]

Gasper Fijavz

Electron. Notes Discret. Math., 2008

A Polynomial Bound for Untangling Geometric Planar Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2008

Compatible Geometric Matchings.

[BibT_eX]

[DOI]

Oswin Aichholzer

Sergey Bereg

Adrian Dumitrescu

Alfredo García Olaverri

Electron. Notes Discret. Math., 2008

Bounded-Degree Graphs have Arbitrarily Large Queue-Number.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2008

Distinct Distances in Graph Drawings.

[BibT_eX]

[DOI]

Electron. J. Comb., 2008

The Minor Crossing Number of Graphs with an Excluded Minor.

[BibT_eX]

[DOI]

Drago Bokal

Gasper Fijavz

Electron. J. Comb., 2008

Notes on Nonrepetitive Graph Colouring.

[BibT_eX]

[DOI]

János Barát

Electron. J. Comb., 2008

On the Parameterized Complexity of Layered Graph Drawing.

[BibT_eX]

[DOI]

Algorithmica, 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

2007

On the Metric Dimension of Cartesian Products of Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2007

On the Maximum Number of Cliques in a Graph.

[BibT_eX]

[DOI]

Graphs Comb., 2007

Extremal Graph Theory for Metric Dimension and Diameter.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2007

Independent Sets in Graphs with an Excluded Clique Minor.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2007

Clique Minors in Cartesian Products of Graphs.

[BibT_eX]

[DOI]

CoRR, 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

On the oriented chromatic number of dense graphs.

[BibT_eX]

[DOI]

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

Vertex partitions of chordal graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2006

Drawing a Graph in a Hypercube.

[BibT_eX]

[DOI]

Electron. J. Comb., 2006

Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness.

[BibT_eX]

[DOI]

János Barát

Jirí Matousek

Electron. J. Comb., 2006

A Fixed-Parameter Approach to 2-Layer Planarization.

[BibT_eX]

[DOI]

Algorithmica, 2006

Characterisations of intersection graphs by vertex orderings.

[BibT_eX]

[DOI]

Australas. J Comb., 2006

Simultaneous diagonal flips in plane triangulations.

[BibT_eX]

[DOI]

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

Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor.

[BibT_eX]

[DOI]

Jan Arne Telle

Proceedings of the Graph Drawing, 14th International Symposium, 2006

2005

Layout of Graphs with Bounded Tree-Width.

[BibT_eX]

[DOI]

SIAM J. Comput., 2005

Queue Layouts of Graph Products and Powers.

[BibT_eX]

[DOI]

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

Acyclic, Star and Oriented Colourings of Graph Subdivisions.

[BibT_eX]

[DOI]

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

Stacks, Queues and Tracks: Layouts of Graph Subdivisions.

[BibT_eX]

[DOI]

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

On the Chromatic Number of the Visibility Graph of a Set of Points in the Plane.

[BibT_eX]

[DOI]

Jan Kára

Mohammad Taghi Hajiaghayi

Discret. Comput. Geom., 2005

Balanced vertex-orderings of graphs.

[BibT_eX]

[DOI]

Therese Biedl

Timothy M. Chan

Yashar Ganjali

Discret. Appl. Math., 2005

A Simple Proof of the F{á}ry-Wagner Theorem

[BibT_eX]

[DOI]

CoRR, 2005

Grid drawings of k-colourable graphs.

[BibT_eX]

[DOI]

Comput. Geom., 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

On the Complexity of the Balanced Vertex Ordering Problem.

[BibT_eX]

[DOI]

Jan Kára

Jan Kratochvíl

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

The Distance Geometry of Deep Rhythms and Scales.

[BibT_eX]

[DOI]

Erik D. Demaine

Francisco Gomez-Martin

Henk Meijer

David Rappaport

Perouz Taslakian

Godfried T. Toussaint

Terry Winograd

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

2004

Dimension-exchange algorithms for token distribution on tree-connected architectures.

[BibT_eX]

[DOI]

Michael E. Houle

J. Parallel Distributed Comput., 2004

The Maximum Number of Edges in a Three-Dimensional Grid-Drawing.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2004

Bounded degree acyclic decompositions of digraphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2004

On Linear Layouts of Graphs.

[BibT_eX]

[DOI]

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

Track Layouts of Graphs.

[BibT_eX]

[DOI]

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

Minimising the Number of Bends and Volume in 3-Dimensional Orthogonal Graph Drawings with a Diagonal Vertex Layout.

[BibT_eX]

[DOI]

Algorithmica, 2004

No-Three-in-Line-in-3D.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 12th International Symposium, 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

Partitions of Complete Geometric Graphs into Plane Trees.

[BibT_eX]

[DOI]

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

Three-dimensional 1-bend graph drawings.

[BibT_eX]

[DOI]

Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

2003

Optimal three-dimensional orthogonal graph drawing in the general position model.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Geometric thickness in a grid.

[BibT_eX]

[DOI]

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

2002

Degree constrained book embeddings.

[BibT_eX]

[DOI]

J. Algorithms, 2002

Lower Bounds for One-to-one Packet Routing on Trees using Hot-Potato Algorithms.

[BibT_eX]

[DOI]

Alan Roberts

Comput. J., 2002

On vertex-magic and edge-magic total injections of graphs.

[BibT_eX]

[DOI]

Australas. J Comb., 2002

Dimension-Exchange Algorithms for Load Balancing on Trees.

[BibT_eX]

Michael E. Houle

Proceedings of the SIROCCO 9, 2002

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

[BibT_eX]

[DOI]

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

Queue Layouts, Tree-Width, and Three-Dimensional Graph Drawing.

[BibT_eX]

[DOI]

Proceedings of the FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science, 2002

Cost-optimal quadtrees for ray shooting.

[BibT_eX]

[DOI]

Hervé Brönnimann

Marc Glisse

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

Light edges in degree-constrained graphs.

[BibT_eX]

[DOI]

Prosenjit Bose

Michiel H. M. Smid

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

2001

Geometric Thickness in a Grid of Linear Area.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

Bounded Degree Book Embeddings and Three-Dimensional Orthogonal Graph Drawing.

[BibT_eX]

[DOI]

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

A Fixed-Parameter Approach to Two-Layer Planarization.

[BibT_eX]

[DOI]

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

Orthogonal Drawings with Few Layers.

[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

2000

Lower bounds for hot-potato permutation routing on trees.

[BibT_eX]

Alan Roberts

Proceedings of the SIROCCO 7, 2000

Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings.

[BibT_eX]

[DOI]

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

Refinement of Three-Dimensional Orthogonal Graph Drawings.

[BibT_eX]

[DOI]

Benjamin Yin-Sun Lynn

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

Three-Dimensional Orthogonal Graph Drawing with Optimal Volume.

[BibT_eX]

[DOI]

Therese Biedl

Torsten Thiele

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

1999

Multi-dimensional Orthogonal Graph Drawing with Small Boxes.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 7th International Symposium, 1999

1998

An Algorithm for Three-Dimensional Orthogonal Graph Drawing.

[BibT_eX]

[DOI]

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

1997

An algorithm for finding a maximum clique in a graph.

[BibT_eX]

[DOI]