| Publication | Date of Publication | Type |
|---|
| On Hamilton cycles in highly symmetric graphs | 2024-10-31 | Paper |
| On orthogonal symmetric chain decompositions | 2024-10-18 | Paper |
| Combinatorial generation via permutation languages. VI: Binary trees | 2024-09-30 | Paper |
| On Hamilton cycles in graphs defined by intersecting set systems | 2024-09-26 | Paper |
| Traversing combinatorial 0/1-polytopes via optimization | 2024-09-11 | Paper |
| The Hamilton compression of highly symmetric graphs | 2024-08-06 | Paper |
| Efficient generation of elimination trees and graph associahedra | 2024-07-19 | Paper |
| All your bases are belong to us: listing all bases of a matroid by greedy exchanges | 2024-05-16 | Paper |
| Zigzagging through acyclic orientations of chordal graphs and hypergraphs | 2024-05-14 | Paper |
| Star transposition gray codes for multiset permutations | 2024-04-23 | Paper |
| A book proof of the middle levels theorem | 2024-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147296 | 2024-01-15 | Paper |
| On Hamilton cycles in graphs defined by intersecting set systems | 2023-11-14 | Paper |
| Star transposition Gray codes for multiset permutations | 2023-10-12 | Paper |
| Combinatorial Gray codes -- an updated survey | 2023-08-16 | Paper |
| Combinatorial Generation via Permutation Languages. V. Acyclic Orientations | 2023-08-10 | Paper |
| Combinatorial generation via permutation languages. III: Rectangulations | 2023-06-12 | Paper |
| Traversing combinatorial 0/1-polytopes via optimization | 2023-04-17 | Paper |
| On the central levels problem | 2023-03-23 | Paper |
| On flips in planar matchings | 2022-12-21 | Paper |
| Kneser graphs are Hamiltonian | 2022-12-07 | Paper |
| On a Combinatorial Generation Problem of Knuth | 2022-05-31 | Paper |
| The Hamilton compression of highly symmetric graphs | 2022-05-17 | Paper |
| Combinatorial generation via permutation languages. I. Fundamentals | 2022-03-10 | Paper |
| Gray codes and symmetric chains | 2022-01-26 | Paper |
| Combinatorial generation via permutation languages. II. Lattice congruences | 2021-12-01 | Paper |
| Sparse Kneser graphs are Hamiltonian | 2021-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002744 | 2021-07-28 | Paper |
| Combinatorial generation via permutation languages. IV. Elimination trees | 2021-06-30 | Paper |
| Distance-Preserving Graph Contractions | 2021-06-15 | Paper |
| Combinatorial generation via permutation languages | 2021-02-02 | Paper |
| Flip distances between graph orientations | 2021-02-01 | Paper |
| On flips in planar matchings | 2020-12-29 | Paper |
| On L-shaped point set embeddings of trees: first non-embeddable examples | 2020-09-04 | Paper |
| Rainbow Cycles in Flip Graphs. | 2020-08-18 | Paper |
| A constant-time algorithm for middle levels Gray codes | 2020-04-01 | Paper |
| Flip distances between graph orientations | 2020-02-24 | Paper |
| Rainbow Cycles in Flip Graphs | 2020-01-09 | Paper |
| On the central levels problem | 2019-12-03 | Paper |
| On orthogonal symmetric chain decompositions | 2019-09-30 | Paper |
| Distance-Preserving Graph Contractions | 2019-09-06 | Paper |
| Sparse Kneser graphs are Hamiltonian | 2019-08-22 | Paper |
| On L-shaped point set embeddings of trees: first non-embeddable examples | 2019-02-15 | Paper |
| A short proof of the middle levels theorem | 2019-01-09 | Paper |
| On universal partial words | 2018-11-30 | Paper |
| Efficient Computation of Middle Levels Gray Codes | 2018-11-13 | Paper |
| On orthogonal symmetric chain decompositions | 2018-10-23 | Paper |
| On L-shaped point set embeddings of trees: first non-embeddable examples | 2018-07-29 | Paper |
| Bipartite Kneser graphs are Hamiltonian | 2018-07-23 | Paper |
| A constant-time algorithm for middle levels Gray codes | 2018-07-16 | Paper |
| An algorithmic framework for tool switching problems with multiple objectives | 2018-05-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636639 | 2018-04-19 | Paper |
| Realization of shift graphs as disjointness graphs of 1-intersecting curves in the plane | 2018-02-27 | Paper |
| Trimming and gluing Gray codes | 2018-02-06 | Paper |
| On universal partial words | 2018-01-18 | Paper |
| A minimum-change version of the Chung-Feller theorem for Dyck paths | 2018-01-18 | Paper |
| A minimum-change version of the Chung-Feller theorem for Dyck paths | 2017-12-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365033 | 2017-09-29 | Paper |
| Bipartite Kneser graphs are Hamiltonian | 2016-10-14 | Paper |
| Scheduling with few changes | 2016-06-23 | Paper |
| Proof of the middle levels conjecture | 2016-05-27 | Paper |
| Efficient Computation of Middle Levels Gray Codes | 2015-11-19 | Paper |
| Coloring random graphs online without creating monochromatic subgraphs | 2014-08-07 | Paper |
| On globally sparse Ramsey graphs | 2014-01-24 | Paper |
| On the path-avoidance vertex-coloring game | 2013-11-01 | Paper |
| Probabilistic One-Player Ramsey Games via Deterministic Two-Player Games | 2013-01-04 | Paper |
| Construction of 2-factors in the middle layer of the discrete cube | 2012-08-24 | Paper |
| On the path-avoidance vertex-coloring game | 2011-10-18 | Paper |
| Small subgraphs in random graphs and the power of multiple choices | 2011-05-19 | Paper |
| On antimagic directed graphs | 2010-11-10 | Paper |
| Generalized switch-setting problems | 2007-11-27 | Paper |
| Combinatorial generation via permutation languages. VI. Binary trees | N/A | Paper |
| Hamiltonicity of Schrijver graphs and stable Kneser graphs | N/A | Paper |
| Matchings in hypercubes extend to long cycles | N/A | Paper |
| Hamiltonian graphs are cup-stackable | N/A | Paper |
