The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Matthias Mnich" ( http://dblp.L3S.de/Authors/Matthias_Mnich )

URL (Homepage):  http://tcs.cs.uni-bonn.de/doku.php?id=staff:matthiasmnich  Author page on DBLP  Author page in RDF  Community of Matthias Mnich in ASPL-2

Publication years (Num. hits)
2009-2011 (18) 2012-2014 (21) 2015-2016 (23) 2017-2018 (26) 2019 (5)
Publication types (Num. hits)
article(56) inproceedings(37)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 3 occurrences of 3 keywords

Results
Found 94 publication records. Showing 93 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen, Gerhard J. Woeginger Domination When the Stars Are Out. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Damir Ferizovic, Demian Hespe, Sebastian Lamm, Matthias Mnich, Christian Schulz 0003, Darren Strash Engineering Kernelization for Maximum Cut. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Dusan Knop, Martin Koutecký, Asaf Levin, Matthias Mnich, Shmuel Onn Multitype Integer Monoid Optimization and Applications. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1André Berger, László Kozma 0002, Matthias Mnich, Roland Vincze A time- and space-optimal algorithm for the many-visits TSP. Search on Bibsonomy SODA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Alexander Göke, Dániel Marx, Matthias Mnich Parameterized Algorithms for Generalizations of Directed Feedback Vertex Set. Search on Bibsonomy CIAC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Matthias Mnich Big data algorithms beyond machine learning. Search on Bibsonomy KI The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Matthias Mnich, René van Bevern Parameterized complexity of machine scheduling: 15 open problems. Search on Bibsonomy Computers & OR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Michael Etscheid, Matthias Mnich Linear Kernels and Linear-Time Algorithms for Finding Large Cuts. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Dusan Knop, Martin Koutecký, Matthias Mnich Voting and Bribing in Single-Exponential Time. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Dusan Knop, Martin Koutecký, Matthias Mnich A Unifying Framework for Manipulation Problems. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1André Berger, László Kozma 0002, Matthias Mnich, Roland Vincze Time- and space-optimal algorithms for the many-visits TSP. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Matthias Mnich, Tobias Mömke Improved integrality gap upper bounds for traveling salesperson problems with distances one and two. Search on Bibsonomy European Journal of Operational Research The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Krzysztof Fleszar 0001, Matthias Mnich, Joachim Spoerhase New algorithms for maximum disjoint paths based on tree-likeness. Search on Bibsonomy Math. Program. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Matthias Mnich, Ignaz Rutter, Jens M. Schmidt Linear-time recognition of map graphs with outerplanar witness. Search on Bibsonomy Discrete Optimization The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Matthias Mnich, Heiko Röglin, Clemens Rösner New deterministic algorithms for solving parity games. Search on Bibsonomy Discrete Optimization The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Matthias Mnich, Eva-Lotta Teutrine Improved bounds for minimal feedback vertex sets in tournaments. Search on Bibsonomy Journal of Graph Theory The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1John Fearnley, Martin Gairing, Matthias Mnich, Rahul Savani Reachability Switching Games. Search on Bibsonomy ICALP The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Anna Adamaszek, Matthias Mnich, Katarzyna Paluch New Approximation Algorithms for (1, 2)-TSP. Search on Bibsonomy ICALP The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Dusan Knop, Martin Koutecký, Matthias Mnich A Unifying Framework for Manipulation Problems. Search on Bibsonomy AAMAS The full citation details ... 2018 DBLP  BibTeX  RDF
1Zdenek Dvorák, Matthias Mnich Large Independent Sets in Triangle-Free Planar Graphs. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Michael Etscheid, Stefan Kratsch, Matthias Mnich, Heiko Röglin Polynomial kernels for weighted problems. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Dusan Knop, Martin Koutecký, Matthias Mnich Combinatorial n-fold Integer Programming and Applications. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Karthekeyan Chandrasekaran, Matthias Mnich, Sahand Mozaffari Odd Multiway Cut in Directed Acyclic Graphs. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Josh Alman, Matthias Mnich, Virginia Vassilevska Williams Dynamic Parameterized Problems and Algorithms. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1John Fearnley, Martin Gairing, Matthias Mnich, Rahul Savani Reachability Switching Games. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Matthias Mnich, René van Bevern Parameterized complexity of machine scheduling: 15 open problems. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Matthias Mnich, Erik Jan van Leeuwen Polynomial kernels for deletion to classes of acyclic digraphs. Search on Bibsonomy Discrete Optimization The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Matthias Mnich, Ildikó Schlotter Stable Marriage with Covering Constraints-A Complete Computational Trichotomy. Search on Bibsonomy SAGT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Dusan Knop, Martin Koutecký, Matthias Mnich Combinatorial n-fold Integer Programming and Applications. Search on Bibsonomy ESA The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Josh Alman, Matthias Mnich, Virginia Vassilevska Williams Dynamic Parameterized Problems and Algorithms. Search on Bibsonomy ICALP The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Dusan Knop, Martin Koutecký, Matthias Mnich Voting and Bribing in Single-Exponential Time. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Karl Bringmann, Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen Parameterized complexity dichotomy for Steiner Multicut. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Anna Adamaszek, Michal Adamaszek, Matthias Mnich, Jens M. Schmidt Lower Bounds for Locally Highly Connected Graphs. Search on Bibsonomy Graphs and Combinatorics The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Matthias Mnich, Ildikó Schlotter Stable Marriage with Covering Constraints: A Complete Computational Trichotomy. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Krzysztof Fleszar 0001, Matthias Mnich, Joachim Spoerhase New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Michael Etscheid, Matthias Mnich Linear Kernels and Linear-Time Algorithms for Finding Large Cuts. Search on Bibsonomy ISAAC The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Matthias Mnich Large Independent Sets in Subquartic Planar Graphs. Search on Bibsonomy WALCOM The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Matthias Mnich, Virginia Vassilevska Williams, László A. Végh A 7/3-Approximation for Feedback Vertex Sets in Tournaments. Search on Bibsonomy ESA The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Krzysztof Fleszar 0001, Matthias Mnich, Joachim Spoerhase New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness. Search on Bibsonomy ESA The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Matthias Mnich, Erik Jan van Leeuwen Polynomial Kernels for Deletion to Classes of Acyclic Digraphs. Search on Bibsonomy STACS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Matthias Mnich, Ignaz Rutter, Jens M. Schmidt Linear-Time Recognition of Map Graphs with Outerplanar Witness. Search on Bibsonomy SWAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Alina Ene, Matthias Mnich, Marcin Pilipczuk, Andrej Risteski On Routing Disjoint Paths in Bounded Treewidth Graphs. Search on Bibsonomy SWAT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Matthias Mnich, Heiko Röglin, Clemens Rösner New Deterministic Algorithms for Solving Parity Games. Search on Bibsonomy LATIN The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Matthias Mnich, Eva-Lotta Teutrine Improved Bounds for Minimal Feedback Vertex Sets in Tournaments. Search on Bibsonomy IPEC The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Robert Crowston, Mark Jones, Matthias Mnich Max-Cut Parameterized Above the Edwards-Erdős Bound. Search on Bibsonomy Algorithmica The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Michael Etscheid, Stefan Kratsch, Matthias Mnich, Heiko Röglin Polynomial Kernels for Weighted Problems. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Matthias Mnich, Heiko Röglin, Clemens Rösner New Deterministic Algorithms for Solving Parity Games. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Matthias Mnich, Virginia Vassilevska Williams, László A. Végh A 7/3-Approximation for Feedback Vertex Sets in Tournaments. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Alina Ene, Matthias Mnich, Marcin Pilipczuk, Andrej Risteski On Routing Disjoint Paths in Bounded Treewidth Graphs. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Matthias Mnich, Andreas Wiese Scheduling and fixed-parameter tractability. Search on Bibsonomy Math. Program. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1René van Bevern, Matthias Mnich, Rolf Niedermeier, Mathias Weller Interval scheduling and colorful independent sets. Search on Bibsonomy J. Scheduling The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Michael Etscheid, Stefan Kratsch, Matthias Mnich, Heiko Röglin Polynomial Kernels for Weighted Problems. Search on Bibsonomy MFCS (2) The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Karl Bringmann, Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen Parameterized Complexity Dichotomy for Steiner Multicut. Search on Bibsonomy STACS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Matthias Mnich, Yash Raj Shrestha, Yongjie Yang 0001 When Does Schwartz Conjecture Hold? Search on Bibsonomy IJCAI The full citation details ... 2015 DBLP  BibTeX  RDF
1Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen Parameterized Complexity of Induced Graph Matching on Claw-Free Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Matthias Mnich, Geevarghese Philip, Saket Saurabh 0001, Ondrej Suchý Beyond Max-Cut: λ-extendible properties parameterized above the Poljak-Turzík bound. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Karl Bringmann, Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen Parameterized Complexity Dichotomy for Steiner Multicut. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1René van Bevern, Matthias Mnich, Rolf Niedermeier, Mathias Weller Interval scheduling and colorful independent sets. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Matthias Mnich, Andreas Wiese Scheduling and Fixed-Parameter Tractability. Search on Bibsonomy IPCO The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Zdenek Dvorák, Matthias Mnich Large Independent Sets in Triangle-Free Planar Graphs. Search on Bibsonomy ESA The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Riko Jacob, Tobias Lieber, Matthias Mnich Treewidth Computation and Kernelization in the Parallel External Memory Model. Search on Bibsonomy IFIP TCS The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Sylvain Guillemot, Matthias Mnich Kernel and fast algorithm for dense triplet inconsistency. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Zdenek Dvorák, Matthias Mnich Large Independent Sets in Triangle-Free Planar Graphs. Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Matthias Mnich, Andreas Wiese Scheduling Meets Fixed-Parameter Tractability. Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Matthias Mnich, Tobias Mömke Improved integrality gap upper bounds for TSP with distances one and two. Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Serge Gaspers, Matthias Mnich Feedback Vertex Sets in Tournaments. Search on Bibsonomy Journal of Graph Theory The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Ross J. Kang, Matthias Mnich, Tobias Müller Induced Matchings in Subcubic Planar Graphs. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Gregory Z. 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. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen Parameterized Complexity of Induced Graph Matching on Claw-Free Graphs. Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Matthias Mnich, Geevarghese Philip, Saket Saurabh 0001, Ondrej Suchý Beyond Max-Cut: λ-Extendible Properties Parameterized Above the Poljak-Turzík Bound Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1René van Bevern, Matthias Mnich, Rolf Niedermeier, Mathias Weller Interval Scheduling and Colorful Independent Sets. Search on Bibsonomy ISAAC The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen Parameterized Complexity of Induced H-Matching on Claw-Free Graphs. Search on Bibsonomy ESA The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Robert Crowston, Mark Jones, Matthias Mnich Max-Cut Parameterized above the Edwards-Erdős Bound. Search on Bibsonomy ICALP (1) The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Matthias Mnich, Rico Zenklusen Bisections above Tight Lower Bounds. Search on Bibsonomy WG The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Matthias Mnich, Geevarghese Philip, Saket Saurabh 0001, Ondrej Suchý Beyond Max-Cut: lambda-Extendible Properties Parameterized Above the Poljak-Turzik Bound. Search on Bibsonomy FSTTCS The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Daniel Lokshtanov, Matthias Mnich, Saket Saurabh 0001 A linear kernel for a planar connected dominating set. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Matthias Mnich Book review. Search on Bibsonomy Oper. Res. Lett. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Robert Crowston, Mark Jones, Matthias Mnich Max-Cut Parameterized Above the Edwards-Erdős Bound Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen, Gerhard J. Woeginger Domination When the Stars Are Out. Search on Bibsonomy ICALP (1) The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Daniel Lokshtanov, Matthias Mnich, Saket Saurabh 0001 Planar k-Path in Subexponential Time and Polynomial Space. Search on Bibsonomy WG The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Gregory Z. Gutin, Eun Jung Kim 0002, Matthias Mnich, Anders Yeo Betweenness parameterized above tight lower bound. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen, Gerhard J. Woeginger Domination When the Stars Are Out Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Gregory Z. Gutin, Leo van Iersel, Matthias Mnich, Anders Yeo All Ternary Permutation Constraint Satisfaction Problems Parameterized Above Average Have Polynomial Kernels Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Sylvain Guillemot, Matthias Mnich Kernel and Fast Algorithm for Dense Triplet Inconsistency. Search on Bibsonomy TAMC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Gregory Z. Gutin, Leo van Iersel, Matthias Mnich, Anders Yeo All Ternary Permutation Constraint Satisfaction Problems Parameterized above Average Have Kernels with Quadratic Numbers of Variables. Search on Bibsonomy ESA (1) The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Serge Gaspers, Matthias Mnich Feedback Vertex Sets in Tournaments. Search on Bibsonomy ESA (1) The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Ross J. Kang, Matthias Mnich, Tobias Müller Induced Matchings in Subcubic Planar Graphs. Search on Bibsonomy ESA (2) The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Matthias Mnich, Geevarghese Philip, Saket Saurabh 0001 Ranking and Drawing in Subexponential Time. Search on Bibsonomy IWOCA The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Matthias Mnich, Frances A. Rosamond, Saket Saurabh 0001 The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Max-leaf, Well-quasiordering, Bandwidth, Kernelization, Parameterized complexity
1Serge Gaspers, Matthias Mnich On Feedback Vertex Sets in Tournaments Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Gregory Z. Gutin, Eun Jung Kim 0002, Matthias Mnich, Anders Yeo Ordinal Embedding Relaxations Parameterized Above Tight Lower Bound Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Leo van Iersel, Steven Kelk, Matthias Mnich Uniqueness, Intractability and Exact Algorithms: Reflections on Level-k Phylogenetic Networks. Search on Bibsonomy J. Bioinformatics and Computational Biology The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Daniel Lokshtanov, Matthias Mnich, Saket Saurabh 0001 Linear Kernel for Planar Connected Dominating Set. Search on Bibsonomy TAMC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #93 of 93 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license