| Publication | Date of Publication | Type |
|---|
| A precise condition for independent transversals in bipartite covers | 2024-05-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147256 | 2024-01-15 | Paper |
| Packing list‐colorings | 2024-01-05 | Paper |
| When removing an independent set is optimal for reducing the chromatic number | 2023-10-25 | Paper |
| Colorings, transversals, and local sparsity | 2023-10-12 | Paper |
| Regular Turán numbers and some Gan–Loh–Sudakov‐type problems | 2023-10-05 | Paper |
| Strong chromatic index and Hadwiger number | 2023-10-05 | Paper |
| Occupancy fraction, fractional colouring, and triangle fraction | 2023-10-04 | Paper |
| Single‐conflict colouring | 2023-09-29 | Paper |
| The $\chi$-binding function of $d$-directional segment graphs | 2023-09-12 | Paper |
| Independent transversals in bipartite correspondence-covers | 2023-04-26 | Paper |
| List packing number of bounded degree graphs | 2023-03-02 | Paper |
| Lower bounds for Ramsey numbers as a statistical physics problem | 2022-05-23 | Paper |
| Maximizing Line Subgraphs of Diameter at Most t | 2022-04-20 | Paper |
| Mathematical (online) meetings reimagined? | 2022-02-17 | Paper |
| Asymmetric list sizes in bipartite graphs | 2021-12-18 | Paper |
| Structure and colour in triangle-free graphs | 2021-06-21 | Paper |
| Coloring triangle‐free graphs with local list sizes | 2020-11-30 | Paper |
| Approximate strong edge-colouring of unit disk graphs | 2020-08-24 | Paper |
| Bipartite induced density in triangle-free graphs | 2020-06-04 | Paper |
| An algorithmic framework for colouring locally sparse graphs | 2020-04-15 | Paper |
| Separation Choosability and Dense Bipartite Induced Subgraphs | 2020-04-06 | Paper |
| Graph structure via local occupancy | 2020-03-31 | Paper |
| Strong cliques and forbidden cycles | 2020-01-17 | Paper |
| A precolouring extension of Vizing's theorem | 2019-12-30 | Paper |
| VC dimension and a union theorem for set systems | 2019-08-05 | Paper |
| Squared Chromatic Number Without Claws or Large Cliques | 2019-03-15 | Paper |
| Tree-like distance colouring for planar graphs of sufficient girth | 2019-03-05 | Paper |
| Colouring Squares of Claw-free Graphs | 2019-02-21 | Paper |
| Discrepancy and large dense monochromatic subsets | 2018-12-10 | Paper |
| Distance Colouring Without One Cycle Length | 2018-11-05 | Paper |
| Packing Graphs of Bounded Codegree | 2018-11-05 | Paper |
| Extension from precoloured sets of edges | 2018-08-15 | Paper |
| Bounded monochromatic components for random graphs | 2018-05-23 | Paper |
| Single-conflict colouring | 2018-03-29 | Paper |
| Colouring squares of claw-free graphs | 2018-01-18 | Paper |
| Packing two graphs of even girth 10 | 2018-01-18 | Paper |
| Distance colouring without one cycle length | 2018-01-18 | Paper |
| On a Ramsey-type problem of Erdős and Pach | 2018-01-16 | Paper |
| The Bollob\'as-Eldridge-Catlin conjecture for even girth at least $10$ | 2017-03-15 | Paper |
| List Coloring with a Bounded Palette | 2017-02-01 | Paper |
| The latest designs | 2016-11-10 | Paper |
| Coloring powers and girth | 2016-10-20 | Paper |
| On a Ramsey-type problem of Erdős and Pach | 2016-10-14 | Paper |
| Colouring random graphs | 2016-09-30 | Paper |
| A Precise Threshold for Quasi-Ramsey Numbers | 2015-09-23 | Paper |
| Supersaturation in the Boolean lattice | 2015-07-09 | Paper |
| On \(r\)-dynamic coloring of grids | 2015-05-22 | Paper |
| Decomposition of bounded degree graphs into \(C_4\)-free subgraphs | 2014-11-19 | Paper |
| For most graphs H , most H -free graphs have a linear homogeneous set | 2014-11-17 | Paper |
| For most graphs \(H\), most \(H\)-free graphs have a linear homogeneous set | 2014-11-17 | Paper |
| Subset Glauber dynamics on graphs, hypergraphs and matroids of bounded tree-width | 2014-10-23 | Paper |
| Tight inequalities among set hitting times in Markov chains | 2014-09-16 | Paper |
| Arrangements of pseudocircles and circles | 2014-09-12 | Paper |
| Largest sparse subgraphs of random graphs | 2014-07-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5419962 | 2014-06-11 | Paper |
| The Distance-t Chromatic Index of Graphs | 2014-05-02 | Paper |
| Sphere and dot product representations of graphs | 2014-03-24 | Paper |
| Largest sparse subgraphs of random graphs | 2013-11-01 | Paper |
| On distance edge-colourings and matchings | 2013-10-10 | Paper |
| Improper Choosability and Property B | 2013-07-31 | Paper |
| Induced Matchings in Subcubic Planar Graphs | 2013-01-04 | Paper |
| Distance edge-colourings and matchings | 2012-10-19 | Paper |
| Invasion percolation on the Poisson-weighted infinite tree | 2012-07-08 | Paper |
| Sphere and dot product representations of graphs | 2012-04-04 | Paper |
| Dot product representations of planar graphs | 2011-11-22 | Paper |
| Frugal, acyclic and star colourings of graphs | 2011-10-27 | Paper |
| Every Plane Graph of Maximum Degree 8 has an Edge-Face 9-Coloring | 2011-10-27 | Paper |
| Rapid Mixing of Subset Glauber Dynamics on Graphs of Bounded Tree-Width | 2011-07-06 | Paper |
| Dot Product Representations of Planar Graphs | 2011-02-11 | Paper |
| Acyclic dominating partitions | 2010-11-24 | Paper |
| Improper coloring of unit disk graphs | 2010-11-24 | Paper |
| Induced Matchings in Subcubic Planar Graphs | 2010-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3576687 | 2010-07-30 | Paper |
| The \(t\)-stability number of a random graph | 2010-06-16 | Paper |
| The t-Improper Chromatic Number of Random Graphs | 2010-04-23 | Paper |
| Acyclic improper colourings of graphs with bounded maximum degree | 2010-03-29 | Paper |
| Circular choosability | 2009-12-18 | Paper |
| The t-improper chromatic number of random graphs | 2008-06-05 | Paper |
| Acyclic dominating partitions | 2008-06-05 | Paper |
| Improper colouring of (random) unit disk graphs | 2008-03-18 | Paper |
| Improper Colourings of Unit Disk Graphs | 2007-05-29 | Paper |
| A precise condition for independent transversals in bipartite covers | N/A | Paper |
| On Vizing's problem for triangle-free graphs | N/A | Paper |
