| Publication | Date of Publication | Type |
|---|
| Efficient generation of rectangulations via permutation languages | 2026-04-27 | Paper |
| On the central levels problem | 2026-03-18 | Paper |
Order dimension, grids, and products
Order | 2025-12-02 | Paper |
Matchings in hypercubes extend to long cycles
SIAM Journal on Discrete Mathematics | 2025-10-10 | Paper |
| Flips in colorful triangulations | 2025-10-07 | Paper |
| Traversing combinatorial 0/1-polytopes via optimization | 2025-08-15 | Paper |
Hamiltonicity of Schrijver graphs and stable Kneser graphs
European Journal of Combinatorics | 2025-08-08 | Paper |
| Pattern-avoiding binary trees -- generation, counting, and bijections | 2025-07-24 | Paper |
Flips in colorful triangulations
Journal of Computational Geometry | 2025-05-22 | Paper |
| Kneser graphs are Hamiltonian (extended abstract) | 2025-04-15 | Paper |
Kneser graphs are Hamiltonian
Advances in Mathematics | 2025-04-11 | Paper |
Graphs that admit a Hamilton path are cup-stackable
Discrete Mathematics | 2025-03-06 | Paper |
| Matchings in hypercubes extend to long cycles | 2025-02-28 | Paper |
Combinatorial generation via permutation languages. IV: Elimination trees
ACM Transactions on Algorithms | 2025-02-21 | Paper |
| On Hamilton cycles in highly symmetric graphs | 2024-10-31 | Paper |
On orthogonal symmetric chain decompositions
Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
Combinatorial generation via permutation languages. VI: Binary trees
European Journal of Combinatorics | 2024-09-30 | Paper |
On Hamilton cycles in graphs defined by intersecting set systems
Notices of the American Mathematical Society | 2024-09-26 | Paper |
Traversing combinatorial 0/1-polytopes via optimization
SIAM Journal on Computing | 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
Combinatorica | 2024-04-09 | Paper |
| scientific article; zbMATH DE number 7788384 (Why is no real title available?) | 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
Journal of Graph Theory | 2023-10-12 | Paper |
Combinatorial Gray codes -- an updated survey
The Electronic Journal of Combinatorics | 2023-08-16 | Paper |
Combinatorial Generation via Permutation Languages. V. Acyclic Orientations
SIAM Journal on Discrete Mathematics | 2023-08-10 | Paper |
Combinatorial generation via permutation languages. III: Rectangulations
Discrete & Computational Geometry | 2023-06-12 | Paper |
| Traversing combinatorial 0/1-polytopes via optimization | 2023-04-17 | Paper |
On the central levels problem
Journal of Combinatorial Theory. Series B | 2023-03-23 | Paper |
On flips in planar matchings
Graph-Theoretic Concepts in Computer Science | 2022-12-21 | Paper |
| Kneser graphs are Hamiltonian | 2022-12-07 | Paper |
On a combinatorial generation problem of Knuth
SIAM Journal on Computing | 2022-05-31 | Paper |
| The Hamilton compression of highly symmetric graphs | 2022-05-17 | Paper |
Combinatorial generation via permutation languages. I: Fundamentals
Transactions of the American Mathematical Society | 2022-03-10 | Paper |
Combinatorial generation via permutation languages. I: Fundamentals
Transactions of the American Mathematical Society | 2022-03-10 | Paper |
Gray codes and symmetric chains
Journal of Combinatorial Theory. Series B | 2022-01-26 | Paper |
Gray codes and symmetric chains
Journal of Combinatorial Theory. Series B | 2022-01-26 | Paper |
Combinatorial generation via permutation languages. II. Lattice congruences
Israel Journal of Mathematics | 2021-12-01 | Paper |
Sparse Kneser graphs are Hamiltonian
Journal of the London Mathematical Society | 2021-08-13 | Paper |
| Gray codes and symmetric chains | 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
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Flip distances between graph orientations
Algorithmica | 2021-02-01 | Paper |
On flips in planar matchings
Discrete Applied Mathematics | 2020-12-29 | Paper |
On flips in planar matchings
Discrete Applied Mathematics | 2020-12-29 | Paper |
On L-shaped point set embeddings of trees: first non-embeddable examples
Journal of Graph Algorithms and Applications | 2020-09-04 | Paper |
| Rainbow cycles in flip graphs | 2020-08-18 | Paper |
A constant-time algorithm for middle levels Gray codes
Algorithmica | 2020-04-01 | Paper |
Flip distances between graph orientations
Graph-Theoretic Concepts in Computer Science | 2020-02-24 | Paper |
Flip distances between graph orientations
Graph-Theoretic Concepts in Computer Science | 2020-02-24 | Paper |
Rainbow cycles in flip graphs
SIAM Journal on Discrete Mathematics | 2020-01-09 | Paper |
On the central levels problem
(available as arXiv preprint) | 2019-12-03 | Paper |
On orthogonal symmetric chain decompositions
The Electronic Journal of Combinatorics | 2019-09-30 | Paper |
On orthogonal symmetric chain decompositions
The Electronic Journal of Combinatorics | 2019-09-30 | Paper |
Distance-Preserving Graph Contractions
SIAM Journal on Discrete Mathematics | 2019-09-06 | Paper |
Sparse Kneser graphs are Hamiltonian
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Sparse Kneser graphs are Hamiltonian
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
| On L-shaped point set embeddings of trees: first non-embeddable examples | 2019-02-15 | Paper |
On L-shaped point set embeddings of trees: first non-embeddable examples
(available as arXiv preprint) | 2019-02-15 | Paper |
A short proof of the middle levels theorem
Discrete Analysis | 2019-01-09 | Paper |
On universal partial words
(available as arXiv preprint) | 2018-11-30 | Paper |
| On universal partial words | 2018-11-30 | Paper |
Efficient computation of middle levels Gray codes
ACM Transactions on Algorithms | 2018-11-13 | Paper |
On orthogonal symmetric chain decompositions
(available as arXiv preprint) | 2018-10-23 | Paper |
On L-shaped point set embeddings of trees: first non-embeddable examples
(available as arXiv preprint) | 2018-07-29 | Paper |
Bipartite Kneser graphs are Hamiltonian
Combinatorica | 2018-07-23 | Paper |
A constant-time algorithm for middle levels Gray codes
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
An algorithmic framework for tool switching problems with multiple objectives
European Journal of Operational Research | 2018-05-25 | Paper |
| Trimming and gluing Gray codes | 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
Theoretical Computer Science | 2018-02-06 | Paper |
Trimming and gluing Gray codes
Theoretical Computer Science | 2018-02-06 | Paper |
| On universal partial words | 2018-01-18 | Paper |
A minimum-change version of the Chung-Feller theorem for Dyck paths
Electronic Notes in Discrete Mathematics | 2018-01-18 | Paper |
A minimum-change version of the Chung-Feller theorem for Dyck paths
European Journal of Combinatorics | 2017-12-21 | Paper |
| Coloring random graphs online without creating monochromatic subgraphs | 2017-09-29 | Paper |
Bipartite Kneser graphs are Hamiltonian
Electronic Notes in Discrete Mathematics | 2016-10-14 | Paper |
Scheduling with few changes
European Journal of Operational Research | 2016-06-23 | Paper |
Proof of the middle levels conjecture
Proceedings of the London Mathematical Society. Third Series | 2016-05-27 | Paper |
Proof of the middle levels conjecture
Proceedings of the London Mathematical Society. Third Series | 2016-05-27 | Paper |
Efficient Computation of Middle Levels Gray Codes
Algorithms - ESA 2015 | 2015-11-19 | Paper |
Coloring random graphs online without creating monochromatic subgraphs
Random Structures & Algorithms | 2014-08-07 | Paper |
On globally sparse Ramsey graphs
Discrete Mathematics | 2014-01-24 | Paper |
| On the path-avoidance vertex-coloring game | 2013-11-01 | Paper |
On the path-avoidance vertex-coloring game
(available as arXiv preprint) | 2013-11-01 | Paper |
Probabilistic One-Player Ramsey Games via Deterministic Two-Player Games
SIAM Journal on Discrete Mathematics | 2013-01-04 | Paper |
Construction of 2-factors in the middle layer of the discrete cube
Journal of Combinatorial Theory. Series A | 2012-08-24 | Paper |
On the path-avoidance vertex-coloring game
The Electronic Journal of Combinatorics | 2011-10-18 | Paper |
Small subgraphs in random graphs and the power of multiple choices
Journal of Combinatorial Theory. Series B | 2011-05-19 | Paper |
On antimagic directed graphs
Journal of Graph Theory | 2010-11-10 | Paper |
Generalized switch-setting problems
Discrete Mathematics | 2007-11-27 | Paper |
Combinatorial generation via permutation languages. VI. Binary trees
(available as arXiv preprint) | N/A | Paper |
Hamiltonicity of Schrijver graphs and stable Kneser graphs
(available as arXiv preprint) | N/A | Paper |
Matchings in hypercubes extend to long cycles
(available as arXiv preprint) | N/A | Paper |
Hamiltonian graphs are cup-stackable
(available as arXiv preprint) | N/A | Paper |
