Torsten Mütze

ACM Trans. Algorithms, January, 2025

Hamiltonicity of Schrijver graphs and stable Kneser graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2025

Graphs that admit a Hamilton path are cup-stackable.

[BibT_eX]

[DOI]

Discret. Math., 2025

Listing Spanning Trees of Outerplanar Graphs by Pivot-Exchanges.

[BibT_eX]

[DOI]

Nastaran Behrooznia

Proceedings of the 42nd International Symposium on Theoretical Aspects of Computer Science, 2025

2024

Combinatorial generation via permutation languages. VI. Binary trees.

[BibT_eX]

[DOI]

Eur. J. Comb., 2024

A Book Proof of the Middle Levels Theorem.

[BibT_eX]

[DOI]

Comb., 2024

Matchings in Hypercubes Extend to Long Cycles.

[BibT_eX]

[DOI]

Jirí Fink

Proceedings of the Combinatorial Algorithms - 35th International Workshop, 2024

Flips in Colorful Triangulations.

[BibT_eX]

[DOI]

Rohan Acharya

Francesco Verciani

Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 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

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

Combinatorial Gray codes-an updated survey.

[BibT_eX]

[DOI]

CoRR, 2022

Star Transposition Gray Codes for Multiset Permutations.

[BibT_eX]

[DOI]

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 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 a combinatorial generation problem of Knuth.

[BibT_eX]

[DOI]

Ondrej Micka

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

Efficient Generation of Rectangulations via Permutation Languages.

[BibT_eX]

[DOI]

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

2020

On Flips in Planar Matchings.

[BibT_eX]

[DOI]

Marcel Milich

Martin Pergel

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2020

Combinatorial generation via permutation languages.

[BibT_eX]

[DOI]

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

On the Central Levels Problem.

[BibT_eX]

[DOI]

Ondrej Micka

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

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

Flip Distances Between Graph Orientations.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019

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

Distance-Preserving Graph Contractions.

[BibT_eX]

[DOI]

Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

Gray Codes and Symmetric Chains.

[BibT_eX]

[DOI]

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

On L-Shaped Point Set Embeddings of Trees: First Non-embeddable Examples.

[BibT_eX]

[DOI]

Manfred Scheucher

Proceedings of the Graph Drawing and Network Visualization - 26th International Symposium, 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

Rainbow Cycles in Flip Graphs.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Computational Geometry, 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

Bipartite Kneser Graphs are Hamiltonian.

[BibT_eX]

[DOI]

Pascal Su

Comb., 2017

Trimming and Gluing Gray Codes.

[BibT_eX]

[DOI]

Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

A constant-time algorithm for middle levels Gray codes.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2015

Efficient Computation of Middle Levels Gray Codes.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2015, 2015

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 A, 2012

2011

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

[BibT_eX]

[DOI]

Henning Thomas

J. Comb. Theory B, 2011

On the path-avoidance vertex-coloring game.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

Coloring random graphs online without creating monochromatic subgraphs.

[BibT_eX]

[DOI]

Thomas Rast

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 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]