| Publication | Date of Publication | Type |
|---|
| Shallow Minors, Graph Products, and Beyond-Planar Graphs | 2024-04-03 | Paper |
| Defective coloring of hypergraphs | 2024-03-25 | Paper |
| Treewidth, Circle Graphs, and Circular Drawings | 2024-03-14 | Paper |
| The product structure of squaregraphs | 2024-01-24 | Paper |
| 2-Layer Graph Drawings with Bounded Pathwidth | 2023-12-20 | Paper |
| Refined List Version of Hadwiger’s Conjecture | 2023-08-11 | Paper |
| Graphs of linear growth have bounded treewidth | 2023-08-10 | Paper |
| Graph product structure for non-minor-closed classes | 2023-08-10 | Paper |
| Improved product structure for graphs on surfaces | 2023-05-31 | Paper |
| Separating layered treewidth and row treewidth | 2023-05-30 | Paper |
| Clustered colouring of graph classes with bounded treedepth or pathwidth | 2023-04-03 | Paper |
| Clustered 3-colouring graphs of bounded degree | 2023-03-31 | Paper |
| Subgraph densities in a surface | 2023-03-31 | Paper |
| Extremal functions for sparse minors | 2023-01-18 | Paper |
| Inducibility and universality for trees | 2022-11-23 | Paper |
| Tree densities in sparse graph classes | 2022-11-08 | Paper |
| A General Framework for Hypergraph Coloring | 2022-07-28 | Paper |
| An improved planar graph product structure theorem | 2022-07-11 | Paper |
| Stack-number is not bounded by queue-number | 2022-06-30 | Paper |
| Nonrepetitive graph colouring | 2022-04-07 | Paper |
| Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond | 2022-04-04 | Paper |
| Notes on tree- and path-chromatic number | 2021-12-10 | Paper |
| Notes on graph product structure theory | 2021-12-10 | Paper |
| Clustered variants of Hajós' conjecture | 2021-11-17 | Paper |
| Separation dimension and degree | 2021-09-14 | Paper |
| Seymour's conjecture on 2-connected graphs of large pathwidth | 2021-04-16 | Paper |
| The Size Ramsey Number of Graphs with Bounded Treewidth | 2021-03-17 | Paper |
| Planar Graphs Have Bounded Queue-Number | 2020-11-11 | Paper |
| Minor-Closed Graph Classes with Bounded Layered Pathwidth | 2020-10-28 | Paper |
| Planar graphs have bounded nonrepetitive chromatic number | 2020-10-20 | Paper |
| A lower bound on the average degree forcing a minor | 2020-06-15 | Paper |
| A variant of the Erdős‐Sós conjecture | 2020-05-21 | Paper |
| Defective and clustered choosability of sparse graphs | 2020-04-06 | Paper |
| Clustered colouring in minor-closed classes | 2020-02-26 | Paper |
| Clustered 3-Colouring Graphs of Bounded Degree | 2020-02-26 | Paper |
| Better bounds for poset dimension and boxicity | 2020-02-26 | Paper |
| A Golden Ratio Inequality for Vertex Degrees of Graphs | 2019-09-25 | Paper |
| A Characterization of the degree sequences of 2-trees | 2019-09-16 | Paper |
| Defective colouring of graphs excluding a subgraph or minor | 2019-09-04 | Paper |
| Nonrepetitive colorings of graphs excluding a fixed immersion or topological minor | 2019-08-15 | Paper |
| Bad News for Chordal Partitions | 2019-06-14 | Paper |
| Clustered Coloring of Graphs Excluding a Subgraph and a Minor | 2019-05-23 | Paper |
| Clustered Graph Coloring and Layered Treewidth | 2019-05-22 | Paper |
| Track layouts, layered path decompositions, and leveled planarity | 2019-04-25 | Paper |
| Thickness and Antithickness of Graphs | 2019-02-27 | Paper |
| Queue Layouts of Graphs with Bounded Degree and Bounded Genus | 2019-01-16 | Paper |
| Corrigendum: Orthogonal Tree Decompositions of Graphs | 2018-12-19 | Paper |
| A logarithmic bound for the chromatic number of the associahedron | 2018-11-21 | Paper |
| Anagram-Free Colorings of Graph Subdivisions | 2018-10-01 | Paper |
| Edge-Maximal Graphs on Surfaces | 2018-08-30 | Paper |
| Improper colourings inspired by Hadwiger's conjecture | 2018-08-30 | Paper |
| Tight Upper Bounds on the Crossing Number in a Minor-Closed Class | 2018-07-30 | Paper |
| The treewidth of line graphs | 2018-07-24 | Paper |
| Defective and clustered graph colouring | 2018-05-25 | Paper |
| Anagram-free graph colouring | 2018-05-25 | Paper |
| Transversals in Latin Arrays with Many Distinct Symbols | 2018-05-22 | Paper |
| The extremal function for Petersen minors | 2018-05-09 | Paper |
| Orthogonal Tree Decompositions of Graphs | 2018-04-11 | Paper |
| The exact chromatic number of the convex segment disjointness graph | 2018-04-03 | Paper |
| $K_4$-Minor-Free Induced Subgraphs of Sparse Connected Graphs | 2018-01-22 | Paper |
| Colourings with Bounded Monochromatic Components in Graphs of Given Circumference | 2017-12-06 | Paper |
| Forcing a sparse minor | 2017-10-10 | Paper |
| ‘Forcing a sparse minor’ — CORRIGENDUM | 2017-10-10 | Paper |
| Layered separators in minor-closed graph classes with applications | 2017-09-29 | Paper |
| Majority colourings of digraphs | 2017-06-13 | Paper |
| Structure of Graphs with Locally Restricted Crossings | 2017-05-24 | Paper |
| General position subsets and independent hyperplanes in \(d\)-space | 2017-05-22 | Paper |
| Nonrepetitive colouring via entropy compression | 2017-04-25 | Paper |
| Parameters Tied to Treewidth | 2017-04-21 | Paper |
| Hadwiger's Conjecture for ℓ‐Link Graphs | 2017-04-21 | Paper |
| On visibility and blockers | 2017-03-09 | Paper |
| Colouring the triangles determined by a point set | 2017-03-09 | Paper |
| Which point sets admit a $k$-angulation? | 2017-03-09 | Paper |
| Track Layout Is Hard | 2017-02-21 | Paper |
| Genus, Treewidth, and Local Crossing Number | 2017-02-10 | Paper |
| Hadwiger's conjecture for 3-arc graphs | 2016-12-06 | Paper |
| Cliques in graphs excluding a complete graph minor | 2016-09-13 | Paper |
| Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking | 2016-09-12 | Paper |
| On the maximum order of graphs embedded in surfaces | 2016-04-21 | Paper |
| Thoughts on Barnette's Conjecture | 2016-04-18 | Paper |
| Average degree conditions forcing a minor | 2016-03-11 | Paper |
| Layouts of Expander Graphs | 2016-02-01 | Paper |
| PROXIMITY DRAWINGS OF HIGH-DEGREE TREES | 2015-12-22 | Paper |
| Cycles of Given Size in a Dense Graph | 2015-12-04 | Paper |
| Empty Pentagons in Point Sets with Collinearities | 2015-11-27 | Paper |
| The degree-diameter problem for sparse graph classes | 2015-08-26 | Paper |
| Circumference and Pathwidth of Highly Connected Graphs | 2015-07-23 | Paper |
| Treewidth of the Line Graph of a Complete Graph | 2015-05-22 | Paper |
| A linear-time algorithm to find a separator in a graph excluding a minor | 2014-11-18 | Paper |
| Treewidth of the Kneser graph and the Erdős-Ko-Rado theorem | 2014-09-04 | Paper |
| Progress on Dirac's conjecture | 2014-09-04 | Paper |
| Rooted \(K_4\)-minors | 2014-08-14 | Paper |
| On the Upward Planarity of Mixed Plane Graphs | 2014-05-22 | Paper |
| On the General Position Subset Selection Problem | 2014-04-10 | Paper |
| A Linear-Time Algorithm for Finding a Complete Graph Minor in a Dense Graph | 2014-04-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5403002 | 2014-03-25 | Paper |
| On the book thickness of $k$-trees | 2014-03-25 | Paper |
| Excluded Forest Minors and the Erdős–Pósa Property | 2014-02-24 | Paper |
| On the Upward Planarity of Mixed Plane Graphs | 2013-12-20 | Paper |
| On Multiplicative Sidon Sets | 2013-10-25 | Paper |
| Hypergraph Colouring and Degeneracy | 2013-10-10 | Paper |
| Blocking Colored Point Sets | 2013-09-25 | Paper |
| Treewidth of Cartesian Products of Highly Connected Graphs | 2013-07-31 | Paper |
| Minimum Degree and Graph Minors | 2013-06-28 | Paper |
| Compatible Geometric Matchings | 2013-06-28 | Paper |
| A Polynomial Bound for Untangling Geometric Planar Graphs | 2013-06-28 | Paper |
| PROXIMITY GRAPHS: E, δ, Δ, χ AND ω | 2013-06-24 | Paper |
| Nonrepetitive colourings of planar graphs with \(O(\log n)\) colours | 2013-06-07 | Paper |
| A Note on Hadwiger's Conjecture | 2013-04-24 | Paper |
| Complete graph minors and the graph minor structure theorem | 2013-01-18 | Paper |
| The Chromatic Number of the Convex Segment Disjointness Graph | 2013-01-07 | Paper |
| An Improved Bound for First-Fit on Posets Without Two Long Incomparable Chains | 2013-01-04 | Paper |
| Token graphs | 2012-12-27 | Paper |
| Treewidth of the Line Graph of Complete and Complete Multipartite Graphs | 2012-10-30 | Paper |
| On the connectivity of visibility graphs | 2012-10-15 | Paper |
| Small minors in dense graphs | 2012-06-18 | Paper |
| Clique minors in Cartesian products of graphs | 2012-05-10 | Paper |
| Nordhaus-Gaddum for treewidth | 2012-05-04 | Paper |
| Disproof of the list Hadwiger conjecture | 2012-03-06 | Paper |
| Characterisations and examples of graph classes with bounded expansion | 2012-02-11 | Paper |
| Polynomial treewidth forces a large grid-like-minor | 2012-02-11 | Paper |
| Every large point set contains many collinear points or an empty pentagon | 2012-01-24 | Paper |
| On the maximum number of cliques in a graph embedded in a surface | 2011-11-29 | Paper |
| Decompositions of Complete Multipartite Graphs into Complete Graphs | 2011-09-15 | Paper |
| Cliques in Odd-Minor-Free Graphs | 2011-08-15 | Paper |
| Thomassen's Choosability Argument Revisited | 2011-07-18 | Paper |
| Graph minors and minimum degree | 2010-12-16 | Paper |
| Contractibility and the Hadwiger conjecture | 2010-10-22 | Paper |
| Partitions and Coverings of Trees by Bounded-Degree Subtrees | 2010-08-18 | Paper |
| The Big-Line-Big-Clique Conjecture is False for Infinite Point Sets | 2010-08-17 | Paper |
| Simultaneous diagonal flips in plane triangulations | 2010-08-16 | Paper |
| Colouring the Square of the Cartesian Product of Trees | 2010-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3576658 | 2010-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3575458 | 2010-07-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3575470 | 2010-07-27 | Paper |
| Irreducible triangulations are small | 2010-06-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3558604 | 2010-05-05 | Paper |
| Extremal graph theory for metric dimension and diameter | 2010-03-26 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2010-01-12 | Paper |
| A polynomial bound for untangling geometric planar graphs | 2009-12-14 | Paper |
| Graph Drawing | 2009-08-11 | Paper |
| Compatible geometric matchings | 2009-07-27 | Paper |
| On tree-partition-width | 2009-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3625873 | 2009-05-22 | Paper |
| The minor crossing number of graphs with an excluded minor | 2009-04-07 | Paper |
| Notes on nonrepetitive graph colouring | 2009-04-07 | Paper |
| Distinct distances in graph drawings | 2009-04-07 | Paper |
| Improved upper bounds on the crossing number | 2009-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5506519 | 2009-01-28 | Paper |
| On the parameterized complexity of layered graph drawing | 2008-12-02 | Paper |
| A Characterization of the degree sequences of 2-trees | 2008-09-04 | Paper |
| Extremal Graph Theory for Metric Dimension and Diameter | 2008-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5387656 | 2008-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5387660 | 2008-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5387693 | 2008-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5387696 | 2008-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5387727 | 2008-05-27 | Paper |
| Folding = Colouring | 2008-02-18 | Paper |
| Graph drawings with few slopes | 2007-10-12 | Paper |
| Drawings of planar graphs with few slopes and segments | 2007-10-12 | Paper |
| On the maximum number of cliques in a graph | 2007-09-10 | Paper |
| Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor | 2007-08-28 | Paper |
| Planar decompositions and the crossing number of graphs with an excluded minor | 2007-07-16 | Paper |
| Graph treewidth and geometric thickness parameters | 2007-06-21 | Paper |
| Geometric Thickness in a Grid of Linear Area | 2007-05-29 | Paper |
| Colourings of the Cartesian Product of Graphs and Multiplicative Sidon Sets | 2007-05-29 | Paper |
| Simultaneous diagonal flips in plane triangulations | 2007-05-11 | Paper |
| No-three-in-line-in-3D | 2007-05-10 | Paper |
| Vertex partitions of chordal graphs | 2007-02-07 | Paper |
| Graph Drawing | 2006-11-13 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2006-11-01 | Paper |
| Upward three-dimensional grid drawings of graphs | 2006-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5487920 | 2006-09-13 | Paper |
| Drawing a graph in a hypercube | 2006-08-30 | Paper |
| A fixed-parameter approach to 2-layer planarization | 2006-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5480768 | 2006-08-03 | Paper |
| Three-dimensional orthogonal graph drawing with optimal volume | 2006-06-14 | Paper |
| Partitions of complete geometric graphs into plane trees | 2006-05-16 | Paper |
| Three-Dimensional 1-Bend Graph Drawings | 2006-04-03 | Paper |
| Bounded-degree graphs have arbitrarily large geometric thickness | 2006-01-17 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Graph Drawing | 2005-12-07 | Paper |
| Graph Drawing | 2005-12-07 | Paper |
| Graph Drawing | 2005-12-07 | Paper |
| Graph Drawing | 2005-12-07 | Paper |
| On the chromatic number of the visibility graph of a set of points in the plane | 2005-11-10 | Paper |
| Layout of Graphs with Bounded Tree-Width | 2005-09-16 | Paper |
| The Maximum Number of Edges in a Three-Dimensional Grid-Drawing | 2005-05-25 | Paper |
| Balanced vertex-orderings of graphs | 2005-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4667610 | 2005-04-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4667621 | 2005-04-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4667626 | 2005-04-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4657578 | 2005-03-14 | Paper |
| Grid drawings of \(k\)-colourable graphs | 2005-02-09 | Paper |
| Minimising the number of bends and volume in 3-dimensional orthogonal graph drawings with a diagonal vertex layout | 2004-12-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4823519 | 2004-10-28 | Paper |
| Dimension-exchange algorithms for token distribution on tree-connected architectures | 2004-10-04 | Paper |
| Light edges in degree-constrained graphs | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3043700 | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3043732 | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3043733 | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472316 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472318 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472320 | 2004-08-04 | Paper |
| Bounded degree acyclic decompositions of digraphs. | 2004-03-14 | Paper |
| Geometric thickness in a grid | 2004-01-05 | Paper |
| Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings | 2003-11-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4422261 | 2003-09-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4780504 | 2003-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4415269 | 2003-07-28 | Paper |
| Optimal three-dimensional orthogonal graph drawing in the general position model. | 2003-05-25 | Paper |
| Degree constrained book embeddings | 2003-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796197 | 2003-03-02 | Paper |
| Lower Bounds for One-to-one Packet Routing on Trees using Hot-Potato Algorithms | 2002-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501708 | 2000-11-06 | Paper |
| An algorithm for finding a maximum clique in a graph | 1998-10-06 | Paper |
