| Publication | Date of Publication | Type |
|---|
| Mixing is hard for triangle-free reflexive graphs | 2024-02-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6185533 | 2024-01-29 | Paper |
| Recolouring homomorphisms to triangle-free reflexive graphs | 2023-03-02 | Paper |
| Complexity Framework for Forbidden Subgraphs II: When Hardness Is Not Preserved under Edge Subdivision | 2022-11-25 | Paper |
| A Brightwell-Winkler type characterisation of NU graphs | 2022-08-08 | Paper |
| Graph homomorphism reconfiguration and frozen H‐colorings | 2022-03-31 | Paper |
| A reflexive digraph that is retraction trivial but not endomorphism trivial | 2022-01-13 | Paper |
| Reconfiguration of homomorphisms to reflexive digraph cycles | 2021-06-14 | Paper |
| On the representation of finite distributive lattices | 2020-10-05 | Paper |
| Reconfiguring graph homomorphisms on the sphere | 2020-04-09 | Paper |
| AK-type stability theorems on cross \(t\)-intersecting families | 2019-08-30 | Paper |
| Reflexive graphs with near unanimity but no semilattice polymorphisms | 2018-10-30 | Paper |
| A complexity dichotomy for signed \(\mathbf{H}\)-colouring | 2018-08-15 | Paper |
| Distributive Lattice Polymorphism on Reflexive Graphs | 2018-07-10 | Paper |
| Recolouring reflexive digraphs | 2018-04-19 | Paper |
| NU Polymorphisms on Reflexive Digraphs | 2018-04-06 | Paper |
| Towards extending the Ahlswede-Khachatrian theorem to cross \(t\)-intersecting families | 2017-03-15 | Paper |
| Characterisation of forests with trivial game domination numbers | 2016-10-12 | Paper |
| On a question of Dirac on critical and vertex critical graphs | 2015-11-16 | Paper |
| Decompositions of graphs into trees, forests, and regular subgraphs | 2015-04-29 | Paper |
| An Erdős-Ko-Rado theorem for cross \(t\)-intersecting families | 2014-10-07 | Paper |
| Graphs Admitting $k$-NU Operations. Part 2: The Irreflexive Case | 2014-09-26 | Paper |
| Locally injective \(k\)-colourings of planar graphs | 2014-08-22 | Paper |
| Graphs Admitting $k$-NU Operations. Part 1: The Reflexive Case | 2014-04-10 | Paper |
| Five Cycles are Highly Ramsey Infinite | 2014-04-04 | Paper |
| Semilattice polymorphisms and chordal graphs | 2014-03-25 | Paper |
| Non-bipartite pairs of 3-connected graphs are highly Ramsey-infinite | 2014-03-25 | Paper |
| The maximum size of intersecting and union families of sets | 2012-01-11 | Paper |
| A strong Mal'cev condition for locally finite varieties omitting the unary type | 2011-01-07 | Paper |
| A new proof of the \(H\)-coloring dichotomy | 2010-12-03 | Paper |
| Potentially \(H\)-bigraphic sequences | 2010-05-14 | Paper |
| Note on robust critical graphs with large odd girth | 2010-03-29 | Paper |
| On the complexity of \(H\)-colouring planar graphs | 2009-12-15 | Paper |
| A combinatorial constraint satisfaction problem dichotomy classification conjecture | 2009-12-01 | Paper |
| On Ramsey Minimal Graphs | 2009-05-27 | Paper |
| Dichotomy for bounded degree \(H\)-colouring | 2009-03-04 | Paper |
| On highly ramsey infinite graphs | 2009-02-20 | Paper |
| Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete | 2008-09-17 | Paper |
| Integer and fractional packings of hypergraphs | 2007-02-13 | Paper |
| Color critical hypergraphs with many edges | 2006-09-12 | Paper |
| Towards a dichotomy for the switch list homomorphism problem for signed graphs | N/A | Paper |
| On geometric realizations of the extreme Khovanov homology of pretzel links | N/A | Paper |
