Mütze, Torsten

Publications

Preprints

• Construction of 2-factors in the middle layer of the discrete cube
  (joint with Franziska Weber)
  Submitted
• On globally sparse Ramsey graphs
  (joint with Ueli Peter)
  Submitted
• Coloring random graphs online without creating monochromatic subgraphs [Computer program] [Preprint version on Arxiv] [Extended abstract]
  (joint with Thomas Rast and Reto Spöhel)
  An extended abstract of this work has appeared in the Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '11), 145-158
  Submitted
• Probabilistic one-player Ramsey games via deterministic two-player games [Computer-generated proofs] [Preprint version on Arxiv]
  (joint with Michael Belfrage and Reto Spöhel)
  Submitted

2011

• On the path-avoidance vertex-coloring game [Preprint] [Computer program]
  (joint with Reto Spöhel)
  Electron. J. Combin. 18(1) (2011), Research Paper 163, 33 pp.
  An extended abstract of this work will appear in the Proceedings of the 6th European Conference on Combinatorics, Graph Theory and Applications (EuroComb '11)
• Small subgraphs in random graphs and the power of multiple choices [Preprint]
  (joint with Reto Spöhel and Henning Thomas)
  Journal of Combinatorial Theory, Series B 101(4) (2011), 237-268

2006-2010

• On antimagic directed graphs [Preprint]
  (joint with Dan Hefetz and Justus Schwartz)
  Journal of Graph Theory 64(3) (2010), 219-232
• Understanding radio irregularity in wireless networks [Preprint]
  (joint with Patrick Stüdi, Fabian Kuhn and Gustavo Alonso)
  Proceedings of the 5th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON '08), 82-90
• Generalized switch-setting problems [Preprint]
  Discrete Mathematics 307(22) (2007), 2755-2770
• A new proof of the colored branch theorem [Preprint]
  IEEE Transactions on Circuits and Systems II: Express Briefs 53(4) (2006), 286-288

Talks

• On Ramsey games in random graphs [Slides]
  PhD defense, ETH Zürich, Nov 22, 2011
• On the path-avoidance vertex-coloring game [Slides]
  EuroComb '11, Budapest, Aug 30, 2011
• On sparse Ramsey graphs [Slides]
  Max-Planck-Institut für Informatik, Saarbrücken, July 26, 2011
• On the relation between probabilistic and deterministic avoidance games [Slides]
  RSA '11, Atlanta, May 27, 2011
• Explicit matchings in the middle levels graph [Slides]
  Mittagsseminar, ETH Zürich, May 10, 2011
• Coloring random graphs online without creating monochromatic subgraphs [Slides]
  SODA '11, San Francisco, Jan 23, 2011
• Probabilistic one-player vertex-coloring games via deterministic two-player games - the deterministic game [Slides]
  Mittagsseminar, ETH Zürich, Oct 05, 2010
• Globally sparse Ramsey graphs
  Mittagsseminar, ETH Zürich, Apr 27, 2010
• The search for simple symmetric Venn diagrams [Slides]
  Mittagsseminar, ETH Zürich, Oct 27, 2009
• Avoiding small subgraphs in the Achlioptas process [Slides]
  RSA '09, Poznań, Aug 05, 2009
• Small subgraphs in random graphs and the power of multiple choices - the online case [Slides]
  Mittagsseminar, ETH Zürich, Nov 25, 2008
• Understanding radio irregularity in wireless networks [Slides]
  IEEE SECON '08, San Francisco, June 18, 2008
• Antimagic labellings of graphs [Slides]
  Mittagsseminar, ETH Zürich, Apr 24, 2008
• Understanding radio irregularity in wireless networks [Slides]
  Mittagsseminar, ETH Zürich, July 13, 2007
• Switch-setting games [Slides]
  Mittagsseminar, ETH Zürich, Oct 05, 2006