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
542016
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
On antimagic directed graphs
D Hefetz, T Mütze, J Schwartz
Journal of Graph Theory 64 (3), 219-232, 2010
352010
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
242017
Bipartite Kneser graphs are Hamiltonian
T Mütze, P Su
Electronic Notes in Discrete Mathematics 49, 259-267, 2015
232015
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
232011
A short proof of the middle levels theorem
P Gregor, T Mütze, J Nummenpalo
arXiv preprint arXiv:1710.08249, 2017
182017
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
172012
Distance-preserving graph contractions
A Bernstein, K Däubel, Y Disser, M Klimm, T Mütze, F Smolny
CoRR, abs/1705.04544, 2017
12*2017
Coloring random graphs online without creating monochromatic subgraphs
T Mütze, T Rast, R Spöhel
Random Structures & Algorithms 44 (4), 419-464, 2014
122014
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
122012
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
112018
Trimming and gluing Gray codes
P Gregor, T Mütze
Theoretical Computer Science 714, 74-95, 2018
112018
Efficient computation of middle levels Gray codes
T Mütze, J Nummenpalo
Algorithms-ESA 2015, 915-927, 2015
112015
Scheduling with few changes
T Mütze
European Journal of Operational Research 236 (1), 37-50, 2014
102014
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
92017
Gray codes and symmetric chains
P Gregor, S Jäger, T Mütze, J Sawada, K Wille
arXiv preprint arXiv:1802.06021, 2018
82018
On universal partial words
HZQ Chen, S Kitaev, T Mütze, BY Sun
Electronic Notes in Discrete Mathematics 61, 231-237, 2017
82017
On the path-avoidance vertex-coloring game
T Mütze, R Spöhel
Electronic Notes in Discrete Mathematics 38, 657-662, 2011
82011
On orthogonal symmetric chain decompositions
K Däubel, S Jäger, T Mütze, M Scheucher
arXiv preprint arXiv:1810.09847, 2018
72018
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20