| 2013 | ||
|---|---|---|
| j8 | Serge Gaspers, Matthias Mnich: Feedback Vertex Sets in Tournaments. Journal of Graph Theory 72(1): 72-89 (2013) | |
| 2012 | ||
| j7 | 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. J. Comput. Syst. Sci. 78(1): 151-163 (2012) | |
| j6 | Ross J. Kang, Matthias Mnich, Tobias Müller: Induced Matchings in Subcubic Planar Graphs. SIAM J. Discrete Math. 26(3): 1383-1411 (2012) | |
| c13 | Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen: Parameterized Complexity of Induced H-Matching on Claw-Free Graphs. ESA 2012: 624-635 | |
| c12 | Matthias Mnich, Geevarghese Philip, Saket Saurabh, Ondrej Suchý: Beyond Max-Cut: lambda-Extendible Properties Parameterized Above the Poljak-Turzik Bound. FSTTCS 2012: 412-423 | |
| c11 | Robert Crowston, Mark Jones, Matthias Mnich: Max-Cut Parameterized above the Edwards-Erdős Bound. ICALP (1) 2012: 242-253 | |
| c10 | René van Bevern, Matthias Mnich, Rolf Niedermeier, Mathias Weller: Interval Scheduling and Colorful Independent Sets. ISAAC 2012: 247-256 | |
| c9 | ||
| i7 | Matthias Mnich, Geevarghese Philip, Saket Saurabh, Ondrej Suchý: Beyond Max-Cut: λ-Extendible Properties Parameterized Above the Poljak-Turzík Bound. CoRR abs/1207.5696 (2012) | |
| 2011 | ||
| j5 | ||
| j4 | Daniel Lokshtanov, Matthias Mnich, Saket Saurabh: A linear kernel for a planar connected dominating set. Theor. Comput. Sci. 412(23): 2536-2543 (2011) | |
| c8 | Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen, Gerhard J. Woeginger: Domination When the Stars Are Out. ICALP (1) 2011: 462-473 | |
| c7 | Daniel Lokshtanov, Matthias Mnich, Saket Saurabh: Planar k-Path in Subexponential Time and Polynomial Space. WG 2011: 262-270 | |
| i6 | Robert Crowston, Mark Jones, Matthias Mnich: Max-Cut Parameterized Above the Edwards-Erdős Bound. CoRR abs/1112.3506 (2011) | |
| 2010 | ||
| j3 | Gregory Gutin, Eun Jung Kim, Matthias Mnich, Anders Yeo: Betweenness parameterized above tight lower bound. J. Comput. Syst. Sci. 76(8): 872-878 (2010) | |
| c6 | Ross J. Kang, Matthias Mnich, Tobias Müller: Induced Matchings in Subcubic Planar Graphs. ESA (2) 2010: 112-122 | |
| c5 | ||
| c4 | Gregory Gutin, Leo van Iersel, Matthias Mnich, Anders Yeo: All Ternary Permutation Constraint Satisfaction Problems Parameterized above Average Have Kernels with Quadratic Numbers of Variables. ESA (1) 2010: 326-337 | |
| c3 | Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Matthias Mnich, Geevarghese Philip, Saket Saurabh: Ranking and Drawing in Subexponential Time. IWOCA 2010: 337-348 | |
| c2 | Sylvain Guillemot, Matthias Mnich: Kernel and Fast Algorithm for Dense Triplet Inconsistency. TAMC 2010: 247-257 | |
| i5 | Gregory Gutin, Leo van Iersel, Matthias Mnich, Anders Yeo: All Ternary Permutation Constraint Satisfaction Problems Parameterized Above Average Have Polynomial Kernels. CoRR abs/1004.1956 (2010) | |
| i4 | Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen, Gerhard J. Woeginger: Domination When the Stars Are Out. CoRR abs/1012.0012 (2010) | |
| 2009 | ||
| j2 | Leo van Iersel, Steven Kelk, Matthias Mnich: Uniqueness, Intractability and Exact Algorithms: Reflections on Level-k Phylogenetic Networks. J. Bioinformatics and Computational Biology 7(4): 597-623 (2009) | |
| j1 | Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Matthias Mnich, Frances A. Rosamond, Saket Saurabh: The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number. Theory Comput. Syst. 45(4): 822-848 (2009) | |
| c1 | Daniel Lokshtanov, Matthias Mnich, Saket Saurabh: Linear Kernel for Planar Connected Dominating Set. TAMC 2009: 281-290 | |
| i3 | Leo van Iersel, Matthias Mnich: Computing Rooted and Unrooted Maximum Consistent Supertrees. CoRR abs/0901.3299 (2009) | |
| i2 | ||
| i1 | Gregory Gutin, Eun Jung Kim, Matthias Mnich, Anders Yeo: Ordinal Embedding Relaxations Parameterized Above Tight Lower Bound. CoRR abs/0907.5427 (2009) | |
Data released under the ODC-BY 1.0 license — See also our legal information page