| Publication | Date of Publication | Type |
|---|
| Pathwidth vs Cocircumference | 2024-03-14 | Paper |
| Edge separators for graphs excluding a minor | 2024-02-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147373 | 2024-01-15 | Paper |
| Sparse universal graphs for planarity | 2023-12-02 | Paper |
| Approximating Pathwidth for Graphs of Small Treewidth | 2023-10-23 | Paper |
| Treedepth vs circumference | 2023-10-04 | Paper |
| Subgraph densities in a surface | 2023-03-31 | Paper |
| Adjacency Labelling for Planar Graphs (and Beyond) | 2022-12-08 | Paper |
| Excluding a ladder | 2022-11-09 | Paper |
| Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond | 2022-04-04 | Paper |
| Improved bounds for weak coloring numbers | 2022-04-04 | Paper |
| Notes on graph product structure theory | 2021-12-10 | Paper |
| Tight bounds on the clique chromatic number | 2021-09-28 | Paper |
| Packing and covering balls in graphs excluding a minor | 2021-08-03 | Paper |
| Unavoidable minors for graphs with large \(\ell_p\)-dimension | 2021-07-02 | Paper |
| Seymour's conjecture on 2-connected graphs of large pathwidth | 2021-04-16 | Paper |
| The stable set problem in graphs with bounded genus and bounded odd cycle packing number | 2021-02-02 | Paper |
| Two lower bounds for $p$-centered colorings | 2021-01-05 | Paper |
| Progress on the Adjacent Vertex Distinguishing Edge Coloring Conjecture | 2020-12-04 | Paper |
| Planar Graphs Have Bounded Queue-Number | 2020-11-11 | Paper |
| Erdös--Pósa from Ball Packing | 2020-10-28 | Paper |
| Minor-Closed Graph Classes with Bounded Layered Pathwidth | 2020-10-28 | Paper |
| A tight Erdős-Pósa function for planar minors | 2020-10-20 | Paper |
| Planar graphs have bounded nonrepetitive chromatic number | 2020-10-20 | Paper |
| Large independent sets in triangle-free cubic graphs: beyond planarity | 2020-10-20 | Paper |
| Improved approximation algorithms for hitting 3-vertex paths | 2020-06-26 | Paper |
| Tight Bounds on the Clique Chromatic Number | 2020-06-19 | Paper |
| Revisiting a theorem by Folkman on graph colouring | 2020-03-30 | Paper |
| Assortment optimisation under a general discrete choice model: a tight analysis of revenue-ordered assortments | 2020-02-28 | Paper |
| Excluding a ladder | 2020-02-02 | Paper |
| Nowhere dense graph classes and dimension | 2020-01-17 | Paper |
| A tight Erdős-Pósa function for planar minors | 2019-10-15 | Paper |
| Information-theoretic lower bounds for quantum sorting | 2019-02-18 | Paper |
| Sparsity and dimension | 2019-02-01 | Paper |
| Corrigendum: Orthogonal Tree Decompositions of Graphs | 2018-12-19 | Paper |
| A Tight Erdös--Pósa Function for Wheel Minors | 2018-09-14 | Paper |
| Sparsity and dimension | 2018-07-16 | Paper |
| Orthogonal Tree Decompositions of Graphs | 2018-04-11 | Paper |
| Burling graphs, chromatic number, and orthogonal tree-decompositions | 2018-02-22 | Paper |
| $K_4$-Minor-Free Induced Subgraphs of Sparse Connected Graphs | 2018-01-22 | Paper |
| Burling graphs, chromatic number, and orthogonal tree-decompositions | 2018-01-18 | Paper |
| Planar Posets Have Dimension at Most Linear in Their Height | 2018-01-04 | Paper |
| On the dimension of posets with cover graphs of treewidth 2 | 2017-10-06 | Paper |
| Tree-width and dimension | 2017-08-25 | Paper |
| Smaller extended formulations for the spanning tree polytope of bounded-genus graphs | 2017-05-11 | Paper |
| Nonrepetitive colouring via entropy compression | 2017-04-25 | Paper |
| The Excluded Minors for Isometric Realizability in the Plane | 2017-03-16 | Paper |
| Pathwidth and nonrepetitive list coloring | 2017-01-18 | Paper |
| Improved approximation algorithms for hitting 3-vertex paths | 2016-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3455036 | 2015-12-03 | Paper |
| Empty Pentagons in Point Sets with Collinearities | 2015-11-27 | Paper |
| The Cops and Robber game on graphs with forbidden (induced) subgraphs | 2015-07-24 | Paper |
| Hitting all maximal independent sets of a bipartite graph | 2015-07-10 | Paper |
| An efficient algorithm for partial order production | 2015-02-04 | Paper |
| Hitting and Harvesting Pumpkins | 2014-12-22 | Paper |
| Sorting under partial information (without the ellipsoid algorithm). | 2014-08-13 | Paper |
| Colouring Planar Graphs With Three Colours and No Large Monochromatic Components | 2014-08-06 | Paper |
| A Linear-Time Algorithm for Finding a Complete Graph Minor in a Dense Graph | 2014-04-10 | Paper |
| A note on the cops and robber game on graphs embedded in non-orientable surfaces | 2014-03-24 | Paper |
| Sorting under partial information (without the ellipsoid algorithm). | 2014-03-17 | Paper |
| Excluded Forest Minors and the Erdős–Pósa Property | 2014-02-24 | Paper |
| Boxicity of graphs on surfaces | 2013-06-26 | Paper |
| Nonrepetitive colourings of planar graphs with \(O(\log n)\) colours | 2013-06-07 | Paper |
| The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs | 2013-04-08 | Paper |
| Complete graph minors and the graph minor structure theorem | 2013-01-18 | Paper |
| An Improved Bound for First-Fit on Posets Without Two Long Incomparable Chains | 2013-01-04 | Paper |
| Trees with given stability number and minimum number of stable sets | 2012-12-27 | Paper |
| Minimum entropy combinatorial optimization problems | 2012-12-07 | Paper |
| Approximating the balanced minimum evolution problem | 2012-07-06 | Paper |
| Small minors in dense graphs | 2012-06-18 | Paper |
| Nordhaus-Gaddum for treewidth | 2012-05-04 | Paper |
| Disproof of the list Hadwiger conjecture | 2012-03-06 | Paper |
| First-Fit is linear on posets excluding two long incomparable chains | 2011-12-13 | Paper |
| On the maximum number of cliques in a graph embedded in a surface | 2011-11-29 | Paper |
| Hitting and Harvesting Pumpkins | 2011-09-16 | Paper |
| An Efficient Algorithm for Partial Order Production | 2011-04-04 | Paper |
| Stackelberg network pricing is hard to approximate | 2011-03-16 | Paper |
| The Stackelberg minimum spanning tree game | 2011-03-02 | Paper |
| Minimum Entropy Combinatorial Optimization Problems | 2010-07-28 | Paper |
| Hitting Diamonds and Growing Cacti | 2010-06-22 | Paper |
| Irreducible triangulations are small | 2010-06-03 | Paper |
| Well-balanced orientations of mixed graphs | 2010-04-19 | Paper |
| Minimum entropy coloring | 2009-05-04 | Paper |
| Weighted graphs defining facets: A connection between stable set and linear ordering polytopes | 2009-04-17 | Paper |
| On a theorem of Sewell and Trotter | 2009-03-04 | Paper |
| The Stackelberg Minimum Spanning Tree Game | 2009-02-17 | Paper |
| Minimum entropy orientations | 2009-01-09 | Paper |
| Tight results on minimum entropy set cover | 2008-05-27 | Paper |
| Turán's theorem and k‐connected graphs | 2008-05-14 | Paper |
| Tight Results on Minimum Entropy Set Cover | 2007-08-28 | Paper |
| On a weighted generalization of α-critical graphs | 2007-05-29 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Facets of the linear ordering polytope: a unification for the fence family through weighted graphs | 2006-08-04 | Paper |
