- Domination When the Stars are Out - An algorithmization of Chudnovsky's and Seymour's Structure Theorem for Claw-Free Graphs. University of California at Berkeley, California, 20 April 2011.
- Domination When the Stars are Out - An algorithmization of Chudnovsky's and Seymour's Structure Theorem for Claw-Free Graphs. Royal Holloway - University of London, United Kingdom, 11 April 2011.
- Domination When the Stars are Out - An algorithmization of Chudnovsky's and Seymour's Structure Theorem for Claw-Free Graphs. University of Cambridge, United Kingdom, 8 April 2011.
- Domination When the Stars Are Out - An algorithmization of Chudnovsky's and Seymour's Structure Theorem for Claw-Free Graphs. DIMAP Workshop on Combinatorics and Graph Theory, Warwick, United Kingdom, 6 April 2011.
- Parameterized Complexity of Social Choice Problems. Stanford University, California, 2 March 2011.
- Feedback Vertex Sets in Tournaments. University of Birmingham, United Kingdom, 15 February 2011.
- All Ternary Permutation Constraint Satisfaction Problems Parameterized Above Average Have Kernels with Quadratic Numbers of Variables University of California, Davis, 21 January 2011.
- Domination When the Stars are Out - An algorithmization of Chudnovsky's and Seymour's Structure Theorem for Claw-Free Graphs. University of California, Irvine, 7 January 2011.
- Matthias Mnich: Allemaal op een rijtje (Philips Prize Lecture 2010). Nieuw Archief voor Wiskunde, 5(12), March 2011.
-
Matthias Mnich:
Book Review "Exact Exponential Algorithms" by F. V. Fomin and D. Kratsch.
Operations Research Letters, Elsevier 2011.
original publication -
Gregory Gutin, Leo van Iersel, Matthias Mnich, Anders Yeo:
Every Ternary Permutation Constraint Satisfaction Problem Parameterized Above Average Has a Kernel with a Quadratic Number of Variables.
Journal of Computer and System Sciences, Elsevier 2011.
original publication -
Daniel Lokshtanov, Matthias Mnich, Saket Saurah:
Linear Kernel for Planar Connected Dominating Set.
Theoretical Computer Science, 412(23):2536-2543, Elsevier 2011.
original publication -
Gregory Gutin, Eun Jung Kim, Matthias Mnich, Anders Yeo:
Betweenness Parameterized Above Tight Lower Bound.
Journal of Computer and System Sciences, 76(8):872-878, Elsevier 2010.
original publication -
Leo van Iersel, Steven Kelk, Matthias Mnich:
Uniqueness, Intractability and Exact Algorithms: Reflections on Level-k Phylogenetic Networks.
Journal of Bioinformatics and Computational Biology, 7(4):597-623, Imperial College Press 2009.
original publication -
Michael Fellows, Daniel Lokshtanov, Neeldhara Misra, Matthias Mnich, Frances Rosamond, Saket Saurabh:
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number.
Theory Of Computing Systems, 45(4):822-848, Springer 2009.
original publication
-
Daniel Lokshtanov, Matthias Mnich, Saket Saurabh:
Planar k-Path in Subexponential Time and Polynomial Space.
Accepted at WG 2011, to appear.
-
Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen, Gerhard Woeginger:
Domination When the Stars are Out.
Accepted at ICALP 2011, to appear.
full version -
Gregory Gutin, Leo van Iersel, Matthias Mnich, Anders Yeo:
All Ternary Permutation Constraint Satisfaction Problems Parameterized Above Average Have Polynomial Kernels.
In Proceedings of the 18th European Symposium on Algorithms (ESA '10), Lecture Notes in Computer Science, 6346:326-337, Springer 2010.
original publication -
Serge Gaspers and Matthias Mnich:
Feedback Vertex Sets in Tournaments.
In Proceedings of the 18th European Symposium on Algorithms (ESA '10), Lecture Notes in Computer Science, 6346:267-277, Springer 2010.
original publication -
Ross Kang, Matthias Mnich, Tobias Müller:
Induced Matchings in Subcubic Plane Graphs.
In Proceedings of the 18th European Symposium on Algorithms (ESA '10), Lecture Notes in Computer Science, 2010, 6347:112-122, Springer 2010.
original publication -
Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Matthias Mnich, Geevarghese Philip, Saket Saurabh:
Ranking and Drawing in Subexponential Time.
To appaear in Proceedings of the 21st International Workshop on Combinatorial Algorithms (IWOCA '10).
-
Sylvain Guillemot and Matthias Mnich:
Kernel and Fast Algorithm for Dense Triplet Inconsistency.
In Proceedings of 7th Annual Conference Theory and Applications of Models of Computation (TAMC '10), Prague, Czech Republic. June 2010. Volume 6108 of Lecture Notes in Computer Sciene, pp. 247-257, Springer 2010.
original publication -
Daniel Lokshtanov, Matthias Mnich, Saket Saurabh: Linear Kernel for Planar Connected Dominating Set.
In Proceedings of 6th Annual Conference Theory and Applications of Models of Computation (TAMC '09), Changsha, China. February 2009. Volume 5532 of Lecture Notes in Computer Science, pp. 281-290, Springer 2009.
original publication
- Matthias Mnich: Algorithms in Moderately Exponential Time. PhD thesis, Eindhoven University of Technology, Eindhoven, The Netherlands, September 2010. PDF
- Matthias Mnich: Correlated Equilibria in Succinctly Representable Games. MSc thesis, The London School of Economics and Political Science, London, United Kingdom, August 2006.
|
Theatre and the Arts have always fascinated me. Currently, I am involved in a Hungarian-German production The Mule, a play involving various nice mathematical bits. The production is supported by the German Federal Ministry of Education and Research, within the Year of Mathematics. The production featured at the Höhenrausch Festival in Rostock, performed in Frankfurt at the NAXOS-Halle and will soon be shown in Mainz. For exact dates and more information see here. |