| Publication | Date of Publication | Type |
|---|
| Proper conflict-free coloring of graphs with large maximum degree | 2024-12-18 | Paper |
| Clustered coloring of graphs with bounded layered treewidth and bounded degree | 2024-09-30 | Paper |
| Asymptotic dimension of minor-closed families and Assouad-Nagata dimension of surfaces | 2024-08-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147375 | 2024-01-15 | Paper |
| Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth | 2023-10-30 | Paper |
| Weak diameter choosability of graphs with an excluded minor | 2023-10-26 | Paper |
| Assouad-Nagata dimension of minor-closed metrics | 2023-08-23 | Paper |
| Packing topological minors half‐integrally | 2023-08-22 | Paper |
| Phase transition of degeneracy in minor-closed families | 2023-03-09 | Paper |
| Well-quasi-ordering digraphs with no long alternating paths by the strong immersion relation | 2022-11-23 | Paper |
| Immersion and clustered coloring | 2022-11-23 | Paper |
| Clustered Coloring of Graphs with Bounded Layered Treewidth and Bounded Degree | 2022-09-25 | Paper |
| Legacy of Robin Thomas | 2022-08-31 | Paper |
| Defective coloring is perfect for minors | 2022-08-23 | Paper |
| A Unified Proof of Conjectures on Cycle Lengths in Graphs | 2022-06-16 | Paper |
| A global decomposition theorem for excluding immersions in graphs with no edge-cut of order three | 2022-03-03 | Paper |
| Notes on graph product structure theory | 2021-12-10 | Paper |
| Clustered variants of Hajós' conjecture | 2021-11-17 | Paper |
| Packing and covering immersions in 4-edge-connected graphs | 2021-09-16 | Paper |
| Homomorphism counts in robustly sparse graphs | 2021-07-02 | Paper |
| Sparse Subspace Clustering via Two-Step Reweighted L1-Minimization: Algorithm and Provable Neighbor Recovery Rates | 2021-02-24 | Paper |
| Asymptotic Dimension of Minor-Closed Families and Assouad-Nagata Dimension of Surfaces | 2020-12-04 | Paper |
| Recent Progress on Well-Quasi-ordering Graphs | 2020-07-08 | Paper |
| Robertson's conjecture I. Well-quasi-ordering bounded tree-width graphs by the topological minor relation | 2020-05-30 | Paper |
| Phase Transition of Degeneracy in Minor-Closed Families | 2019-12-04 | Paper |
| Triangle‐free graphs that do not contain an induced subdivision of K4 are 3‐colorable | 2019-10-31 | 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 |
| Size of the largest induced forest in subcubic graphs of girth at least four and five | 2019-01-03 | Paper |
| Excluding subdivisions of bounded degree graphs | 2018-12-20 | Paper |
| Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs | 2018-06-07 | Paper |
| Domination in tournaments | 2018-04-18 | Paper |
| On the Minimum Edge‐Density of 4‐Critical Graphs of Girth Five | 2017-12-01 | Paper |
| Cycle lengths and minimum degree of graphs | 2017-11-28 | Paper |
| Partitioning \(H\)-minor free graphs into three subgraphs with no large components | 2017-11-28 | Paper |
| Multicast Outage Probability and Transmission Capacity of Multihop Wireless Networks | 2017-07-12 | Paper |
| Minimum size of feedback vertex sets of planar graphs of girth at least five | 2016-12-27 | Paper |
| Edge Roman domination on graphs | 2016-11-29 | Paper |
| Partitioning \(H\)-minor free graphs into three subgraphs with no large components | 2016-10-14 | Paper |
| Deploying Robots With Two Sensors inK1, 6-Free Graphs | 2016-08-12 | Paper |
| An Upper Bound on the Fractional Chromatic Number of Triangle-Free Subcubic Graphs | 2014-12-22 | Paper |
| Linear colorings of subcubic graphs | 2014-04-11 | Paper |
| Trees with strong equality between the roman domination number and the unique response Roman domination number | 2014-01-03 | Paper |
| Roman domination on strongly chordal graphs | 2013-12-02 | Paper |
| A New Bound for the 2/3 Conjecture | 2013-05-13 | Paper |
| Roman domination on 2-connected graphs | 2012-08-22 | Paper |
| Upper bounds on Roman domination numbers of graphs | 2012-03-16 | Paper |
| Proper Conflict-free Coloring of Graphs with Large Maximum Degree | N/A | Paper |
| Asymptotically Optimal Proper Conflict-Free Colouring | N/A | Paper |
| Peaceful Colourings | N/A | Paper |
| Tight minimum degree conditions for apex-outerplanar minors and subdivisions in graphs and digraphs | N/A | Paper |
