Folgen
Torsten Mütze
Torsten Mütze
University of Warwick
Bestätigte E-Mail-Adresse bei warwick.ac.uk - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Proof of the middle levels conjecture
T Mütze
Proceedings of the London Mathematical Society 112 (4), 677-713, 2016
792016
On antimagic directed graphs
D Hefetz, T Mütze, J Schwartz
Journal of Graph Theory 64 (3), 219-232, 2010
442010
Understanding radio irregularity in wireless networks
T Muetze, P Stuedi, F Kuhn, G Alonso
2008 5th Annual IEEE Communications Society Conference on Sensor, Mesh and …, 2008
372008
Sparse kneser graphs are hamiltonian
T Mütze, J Nummenpalo, B Walczak
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
332018
Combinatorial Gray codes-an updated survey
T Mütze
arXiv preprint arXiv:2202.01280, 2022
322022
A short proof of the middle levels theorem
P Gregor, T Mütze, J Nummenpalo
arXiv preprint arXiv:1710.08249, 2017
322017
Bipartite Kneser graphs are Hamiltonian
T Mütze, P Su
Electronic Notes in Discrete Mathematics 49, 259-267, 2015
322015
A constant-time algorithm for middle levels Gray codes
T Mütze, J Nummenpalo
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
302017
Small subgraphs in random graphs and the power of multiple choices
T Mütze, R Spöhel, H Thomas
Journal of Combinatorial Theory, Series B 101 (4), 237-268, 2011
252011
Combinatorial generation via permutation languages
E Hartung, HP Hoang, T Mütze, A Williams
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
242020
Combinatorial generation via permutation languages. II. Lattice congruences
HP Hoang, T Mütze
Israel Journal of Mathematics 244 (1), 359-417, 2021
232021
An algorithmic framework for tool switching problems with multiple objectives
M Furrer, T Mütze
European Journal of Operational Research 259 (3), 1003-1016, 2017
202017
Distance-preserving graph contractions
A Bernstein, K Däubel, Y Disser, M Klimm, T Mütze, F Smolny
CoRR, abs/1705.04544, 2017
18*2017
Efficient generation of elimination trees and graph associahedra∗
J Cardinal, A Merino, T Mütze
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
162022
On universal partial words
HZQ Chen, S Kitaev, T Mütze, BY Sun
Discrete Mathematics & Theoretical Computer Science 19 (Combinatorics), 2017
162017
Scheduling with few changes
T Mütze
European Journal of Operational Research 236 (1), 37-50, 2014
162014
Construction of 2-factors in the middle layer of the discrete cube
T Mütze, F Weber
Journal of Combinatorial Theory, Series A 119 (8), 1832-1855, 2012
162012
Combinatorial generation via permutation languages. I. Fundamentals
E Hartung, H Hoang, T Mütze, A Williams
Transactions of the American Mathematical Society 375 (4), 2255-2291, 2022
152022
Coloring random graphs online without creating monochromatic subgraphs
T Mütze, T Rast, R Spöhel
Random Structures & Algorithms 44 (4), 419-464, 2014
142014
Probabilistic one-player Ramsey games via deterministic two-player games
T Mütze, M Belfrage, R Spöhel
SIAM Journal on Discrete Mathematics 26 (3), 1031-1049, 2012
132012
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20