| Publication | Date of Publication | Type |
|---|
Hamiltonian graphs are cup-stackable
(available as arXiv preprint) | N/A | Paper |
Generating all invertible matrices by row operations
(available as arXiv preprint) | N/A | Paper |
| Set selection with uncertain weights: non-adaptive queries and thresholds | 2026-09-29 | Paper |
Minimum maximal matchings in permutahedra
The Electronic Journal of Combinatorics | 2026-08-03 | Paper |
| Traversing regions of supersolvable hyperplane arrangements and their lattice quotients | 2026-07-13 | Paper |
| Listing faces of polytopes | 2026-07-13 | Paper |
Combinatorial generation via permutation languages. VII: Supersolvable hyperplane arrangements
European Journal of Combinatorics | 2026-07-09 | Paper |
| Generating all invertible matrices by row operations | 2026-06-08 | Paper |
| Efficient generation of rectangulations via permutation languages | 2026-04-27 | Paper |
| On the two-dimensional knapsack problem for convex polygons | 2026-03-18 | Paper |
| Computing diverse and nice triangulations | 2026-02-26 | Paper |
Faster and simpler traversal of 0/1-polytopes
(available as arXiv preprint) | 2026-01-01 | Paper |
Impartial selection under combinatorial constraints
International Journal of Game Theory | 2026-01-01 | Paper |
Generating all invertible matrices by row operations
Discrete Mathematics | 2025-12-15 | Paper |
| Traversing combinatorial 0/1-polytopes via optimization | 2025-08-15 | 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 |
Combinatorial generation via permutation languages. IV: Elimination trees
ACM Transactions on Algorithms | 2025-02-21 | Paper |
On the two-dimensional knapsack problem for convex polygons
ACM Transactions on Algorithms | 2025-02-21 | Paper |
Minimum maximal matchings in permutahedra
(available as arXiv preprint) | 2025-01-01 | Paper |
Combinatorial generation via permutation languages. VII. Supersolvable hyperplane arrangements
(available as arXiv preprint) | 2025-01-01 | 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 |
| On the hardness of Gray code problems for combinatorial objects | 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 |
| scientific article; zbMATH DE number 7788384 (Why is no real title available?) | 2024-01-15 | Paper |
Facet-Hamiltonian cycles in the B-permutahedron
(available as arXiv preprint) | 2024-01-01 | Paper |
A Demigod's Number for the Rubik's Cube
(available as arXiv preprint) | 2024-01-01 | Paper |
Star transposition Gray codes for multiset permutations
Journal of Graph Theory | 2023-10-12 | 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 |
| Kneser graphs are Hamiltonian | 2022-12-07 | Paper |
The Minimum Cost Query Problem on Matroids with Uncertainty Areas.
(available as arXiv preprint) | 2022-07-21 | 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. IV. Elimination trees | 2021-06-30 | Paper |
