Torsten Mütze

CoRR, 2024

A Book Proof of the Middle Levels Theorem.

[BibT_eX]

[DOI]

Comb., 2024

2023

Combinatorial Generation via Permutation Languages. V. Acyclic Orientations.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., September, 2023

Combinatorial Generation via Permutation Languages. III. Rectangulations.

[BibT_eX]

[DOI]

Discret. Comput. Geom., July, 2023

Star transposition Gray codes for multiset permutations.

[BibT_eX]

[DOI]

J. Graph Theory, June, 2023

On the central levels problem.

[BibT_eX]

[DOI]

Ondrej Micka

J. Comb. Theory, Ser. B, May, 2023

Combinatorial generation via permutation languages. VI. Binary trees.

[BibT_eX]

[DOI]

CoRR, 2023

Kneser Graphs Are Hamiltonian.

[BibT_eX]

[DOI]

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Zigzagging through acyclic orientations of chordal graphs and hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Pattern-Avoiding Binary Trees - Generation, Counting, and Bijections.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

Traversing combinatorial 0/1-polytopes via optimization.

[BibT_eX]

[DOI]

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022

On a Combinatorial Generation Problem of Knuth.

[BibT_eX]

[DOI]

Ondrej Micka

SIAM J. Comput., 2022

Gray codes and symmetric chains.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2022

Combinatorial Gray codes-an updated survey.

[BibT_eX]

[DOI]

CoRR, 2022

Efficient generation of elimination trees and graph associahedra.

[BibT_eX]

[DOI]

Jean Cardinal

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

The Hamilton Compression of Highly Symmetric Graphs.

[BibT_eX]

[DOI]

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

All Your bases Are Belong to Us: Listing All Bases of a Matroid by Greedy Exchanges.

[BibT_eX]

[DOI]

Aaron Williams

Proceedings of the 11th International Conference on Fun with Algorithms, 2022

2021

On flips in planar matchings.

[BibT_eX]

[DOI]

Marcel Milich

Martin Pergel

Discret. Appl. Math., 2021

Combinatorial generation via permutation languages. IV. Elimination trees.

[BibT_eX]

[DOI]

Jean Cardinal

CoRR, 2021

Flip Distances Between Graph Orientations.

[BibT_eX]

[DOI]

Algorithmica, 2021

Efficient Generation of Rectangulations via Permutation Languages.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Computational Geometry, 2021

2020

Rainbow Cycles in Flip Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2020

On L-shaped point set embeddings of trees: first non-embeddable examples.

[BibT_eX]

[DOI]

Manfred Scheucher

J. Graph Algorithms Appl., 2020

A Constant-Time Algorithm for Middle Levels Gray Codes.

[BibT_eX]

[DOI]

Algorithmica, 2020

Combinatorial generation via permutation languages.

[BibT_eX]

[DOI]

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019

Distance-Preserving Graph Contractions.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2019

Combinatorial generation via permutation languages. I. Fundamentals.

[BibT_eX]

[DOI]

CoRR, 2019

On Orthogonal Symmetric Chain Decompositions.

[BibT_eX]

[DOI]

Electron. J. Comb., 2019

2018

Trimming and gluing Gray codes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Efficient Computation of Middle Levels Gray Codes.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2018

Realization of shift graphs as disjointness graphs of 1-intersecting curves in the plane.

[BibT_eX]

[DOI]

Bartosz Walczak

Veit Wiechert

CoRR, 2018

Sparse Kneser graphs are Hamiltonian.

[BibT_eX]

[DOI]

Bartosz Walczak

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

On Hamilton cycles in highly symmetric graphs.

[BibT_eX]

[DOI]

Proceedings of the 11th International Conference on Random and Exhaustive Generation of Combinatorial Structures, 2018

2017

An algorithmic framework for tool switching problems with multiple objectives.

[BibT_eX]

[DOI]

Martina Furrer

Eur. J. Oper. Res., 2017

A minimum-change version of the Chung-Feller theorem for Dyck paths.

[BibT_eX]

[DOI]

Christoph Standke

Veit Wiechert

Electron. Notes Discret. Math., 2017

On universal partial words.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

A short proof of the middle levels theorem.

[BibT_eX]

[DOI]

CoRR, 2017

Distance-preserving graph contractions.

[BibT_eX]

[DOI]

CoRR, 2017

2015

Bipartite Kneser graphs are Hamiltonian.

[BibT_eX]

[DOI]

Pascal Su

Electron. Notes Discret. Math., 2015

2014

Coloring random graphs online without creating monochromatic subgraphs.

[BibT_eX]

[DOI]

Thomas Rast

Random Struct. Algorithms, 2014

Scheduling with few changes.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2014

2013

On globally sparse Ramsey graphs.

[BibT_eX]

[DOI]

Ueli Peter

Discret. Math., 2013

2012

Probabilistic One-Player Ramsey Games via Deterministic Two-Player Games.

[BibT_eX]

[DOI]

Michael Belfrage

SIAM J. Discret. Math., 2012

Construction of 2-factors in the middle layer of the discrete cube.

[BibT_eX]

[DOI]

Franziska Weber

J. Comb. Theory, Ser. A, 2012

2011

Small subgraphs in random graphs and the power of multiple choices.

[BibT_eX]

[DOI]

Henning Thomas

J. Comb. Theory, Ser. B, 2011

On the path-avoidance vertex-coloring game.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

2010

On antimagic directed graphs.

[BibT_eX]

[DOI]

Dan Hefetz

Justus Schwartz

J. Graph Theory, 2010

2008

Understanding Radio Irregularity in Wireless Networks.

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual IEEE Communications Society Conference on Sensor, 2008

2007

Generalized switch-setting problems.

[BibT_eX]

[DOI]

Torsten Muetze

Discret. Math., 2007

2006

A new proof of the colored branch Theorem.

[BibT_eX]

[DOI]