Matthias Mnich

150 papers A* 9A 16B 14C 4Journal 95Unranked 11

Year	Rank	Type	Title / Venue / Authors
2025	A	`conf`	A Quasi-Polynomial Time Algorithm for Multi-Arrival on Tree-Like Multigraphs. STACS Ebrahim Ghorbani, Jonah Leander Hoff, Matthias Mnich
2025	J	`jnl`	A survey on graph problems parameterized above and below guaranteed values. Comput. Sci. Rev. Gregory Z. Gutin, Matthias Mnich
2025	A	`conf`	Approximate Minimum Tree Cover in All Symmetric Monotone Norms Simultaneously. STACS Matthias Kaul, Kelin Luo, Matthias Mnich, Heiko Röglin
2025	J	`jnl`	Approximate Minimum Tree Cover in All Symmetric Monotone Norms Simultaneously. CoRR Matthias Kaul, Kelin Luo, Matthias Mnich, Heiko Röglin
2025	J	`jnl`	Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth. ACM Trans. Comput. Theory Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen
2024	A	`conf`	A (3/2 + 1/e)-Approximation Algorithm for Ordered TSP. APPROX/RANDOM Susanne Armbruster, Matthias Mnich, Martin Nägele
2024	J	`jnl`	A (3/2+1/e)-Approximation Algorithm for Ordered TSP. CoRR Susanne Armbruster, Matthias Mnich, Martin Nägele
2024	J	`jnl`	Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial Diameter. ACM Trans. Algorithms Parinya Chalermsook, Matthias Kaul, Matthias Mnich, Joachim Spoerhase, Sumedha Uniyal, Daniel Vaz
2024	A*	`conf`	Efficient Cost-Minimization Schemes for Electrical Energy Demand Satisfaction by Prosumers in Microgrids with Battery Storage Capabilities. IJCAI Laura Codazzi, Gergely Csáji, Matthias Mnich
2024	B	`conf`	New Support Size Bounds and Proximity Bounds for Integer Linear Programming. SOFSEM Sebastian Berndt, Matthias Mnich, Tobias Stamm
2024	A*	`conf`	No Polynomial Kernels for Knapsack. ICALP Klaus Heeger, Danny Hermelin, Matthias Mnich, Dvir Shabtay
2024	J	`jnl`	Serial batching to minimize the weighted number of tardy jobs. J. Sched. Danny Hermelin, Matthias Mnich, Simon Omlor
2024	B	`conf`	Single-Machine Scheduling to Minimize the Number of Tardy Jobs with Release Dates. IPEC Matthias Kaul, Matthias Mnich, Hendrik Molter
2024	J	`jnl`	Single-Machine Scheduling to Minimize the Number of Tardy Jobs with Release Dates. CoRR Matthias Kaul, Matthias Mnich, Hendrik Molter
2023	A	`conf`	A (3/2 + ε)-Approximation for Multiple TSP with a Variable Number of Depots. ESA Max A. Deppert, Matthias Kaul, Matthias Mnich
2023	J	`jnl`	A (3/2 + ε)-Approximation for Multiple TSP with a Variable Number of Depots. CoRR Max A. Deppert, Matthias Kaul, Matthias Mnich
2023	A	`conf`	Checkpoint Placement for Systematic Fault-Injection Campaigns. ICCAD Christian Dietrich, Tim-Marek Thomas, Matthias Mnich
2023	J	`jnl`	Checkpoint Placement for Systematic Fault-Injection Campaigns. CoRR Christian Dietrich, Tim-Marek Thomas, Matthias Mnich
2023	J	`jnl`	High-multiplicity N-fold IP via configuration LP. Math. Program. Dusan Knop, Martin Koutecký, Asaf Levin, Matthias Mnich, Shmuel Onn
2023	A*	`conf`	Improved Approximations for Vector Bin Packing via Iterative Randomized Rounding. FOCS Ariel Kulik, Matthias Mnich, Hadas Shachnai
2023	B	`conf`	New Support Size Bounds for Integer Programming, Applied to Makespan Minimization on Uniformly Related Machines. ISAAC Sebastian Berndt, Hauke Brinkop, Klaus Jansen, Matthias Mnich, Tobias Stamm
2023	J	`jnl`	New Support Size Bounds for Integer Programming, Applied to Makespan Minimization on Uniformly Related Machines. CoRR Sebastian Berndt, Hauke Brinkop, Klaus Jansen, Matthias Mnich, Tobias Stamm
2023	J	`jnl`	No Polynomial Kernels for Knapsack. CoRR Klaus Heeger, Danny Hermelin, Matthias Mnich, Dvir Shabtay
2023	A	`conf`	Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth. ESA Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen
2023	J	`jnl`	Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth. CoRR Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen
2022	J	`jnl`	A 3/2-Approximation for the Metric Many-Visits Path TSP. SIAM J. Discret. Math. Kristóf Bérczi, Matthias Mnich, Roland Vincze
2022	J	`jnl`	A Survey on Graph Problems Parameterized Above and Below Guaranteed Values. CoRR Gregory Z. Gutin, Matthias Mnich
2022	J	`jnl`	An Asymptotic (4/3+ε)-Approximation for the 2-Dimensional Vector Bin Packing Problem. CoRR Ariel Kulik, Matthias Mnich, Hadas Shachnai
2022	J	`jnl`	Efficient Approximations for Many-Visits Multiple Traveling Salesman Problems. CoRR Kristóf Bérczi, Matthias Mnich, Roland Vincze
2022	J	`jnl`	Hitting Weighted Even Cycles in Planar Graphs. SIAM J. Discret. Math. Alexander Göke, Jochen Könemann, Matthias Mnich, Hao Sun
2022	J	`jnl`	Parameterized algorithms for generalizations of Directed Feedback Vertex Set. Discret. Optim. Alexander Göke, Dániel Marx, Matthias Mnich
2022	—	`ch.`	Recent Advances in Practical Data Reduction. Algorithms for Big Data Faisal N. Abu-Khzam, Sebastian Lamm, Matthias Mnich, Alexander Noe, Christian Schulz, Darren Strash
2022	J	`jnl`	Resolving Infeasibility of Linear Systems: A Parameterized Approach. CoRR Kristóf Bérczi, Alexander Göke, Lydia Mirabel Mendoza-Cadena, Matthias Mnich
2021	J	`jnl`	Approximating Sparsest Cut in Low-Treewidth Graphs via Combinatorial Diameter. CoRR Parinya Chalermsook, Matthias Kaul, Matthias Mnich, Joachim Spoerhase, Sumedha Uniyal, Daniel Vaz
2021	—	`conf`	Hitting Weighted Even Cycles in Planar Graphs. APPROX-RANDOM Alexander Göke, Jochen Könemann, Matthias Mnich, Hao Sun
2021	J	`jnl`	Hitting Weighted Even Cycles in Planar Graphs. CoRR Alexander Göke, Jochen Könemann, Matthias Mnich, Hao Sun
2021	J	`jnl`	Parameterized complexity of configuration integer programs. Oper. Res. Lett. Dusan Knop, Martin Koutecký, Asaf Levin, Matthias Mnich, Shmuel Onn
2021	J	`jnl`	Reachability Switching Games. Log. Methods Comput. Sci. John Fearnley, Martin Gairing, Matthias Mnich, Rahul Savani
2020	J	`jnl`	A 3/2-Approximation for the Metric Many-visits Path TSP. CoRR Kristóf Bérczi, Matthias Mnich, Roland Vincze
2020	J	`jnl`	Combinatorial n-fold integer programming and applications. Math. Program. Dusan Knop, Martin Koutecký, Matthias Mnich
2020	J	`jnl`	Dense Steiner problems: Approximation algorithms and inapproximability. CoRR Marek Karpinski, Mateusz Lewandowski, Syed Mohammad Meesum, Matthias Mnich
2020	J	`jnl`	Dynamic Parameterized Problems and Algorithms. ACM Trans. Algorithms Josh Alman, Matthias Mnich, Virginia Vassilevska Williams
2020	A	`conf`	Engineering Kernelization for Maximum Cut. ALENEX Damir Ferizovic, Demian Hespe, Sebastian Lamm, Matthias Mnich, Christian Schulz, Darren Strash
2020	A*	`conf`	Hitting Long Directed Cycles Is Fixed-Parameter Tractable. ICALP Alexander Göke, Dániel Marx, Matthias Mnich
2020	J	`jnl`	Hitting Long Directed Cycles is Fixed-Parameter Tractable. CoRR Alexander Göke, Dániel Marx, Matthias Mnich
2020	J	`jnl`	Odd Multiway Cut in Directed Acyclic Graphs. SIAM J. Discret. Math. Karthekeyan Chandrasekaran, Matthias Mnich, Sahand Mozaffari
2020	J	`jnl`	On the complexity of solving a decision problem with flow-depending costs: The case of the IJsselmeer dikes. Discret. Optim. Aida Abiad, Sander Gribling, Domenico Lahaye, Matthias Mnich, Guus Regts, Lluís Vena, Gerard Verweij, Peter J. Zwaneveld
2020	J	`jnl`	Parameterized Algorithms for Generalizations of Directed Feedback Vertex Set. CoRR Alexander Göke, Dániel Marx, Matthias Mnich
2020	J	`jnl`	Recent Advances in Practical Data Reduction. CoRR Faisal N. Abu-Khzam, Sebastian Lamm, Matthias Mnich, Alexander Noe, Christian Schulz, Darren Strash
2020	B	`conf`	Solving Packing Problems with Few Small Items Using Rainbow Matchings. MFCS Max Bannach, Sebastian Berndt, Marten Maack, Matthias Mnich, Alexandra Lassota, Malin Rau, Malte Skambath
2020	J	`jnl`	Solving Packing Problems with Few Small Items Using Rainbow Matchings. CoRR Max Bannach, Sebastian Berndt, Marten Maack, Matthias Mnich, Alexandra Lassota, Malin Rau, Malte Skambath
2020	J	`jnl`	Stable Matchings with Covering Constraints: A Complete Computational Trichotomy. Algorithmica Matthias Mnich, Ildikó Schlotter
2020	J	`jnl`	Time- and Space-optimal Algorithm for the Many-visits TSP. ACM Trans. Algorithms André Berger, László Kozma, Matthias Mnich, Roland Vincze
2020	J	`jnl`	Voting and Bribing in Single-Exponential Time. ACM Trans. Economics and Comput. Dusan Knop, Martin Koutecký, Matthias Mnich
2019	A*	`conf`	A time- and space-optimal algorithm for the many-visits TSP. SODA André Berger, László Kozma, Matthias Mnich, Roland Vincze
2019	J	`jnl`	Degree-Bounded Generalized Polymatroids and Approximating the Metric Many-Visits TSP. CoRR Kristóf Bérczi, André Berger, Matthias Mnich, Roland Vincze
2019	J	`jnl`	Domination When the Stars Are Out. ACM Trans. Algorithms Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen, Gerhard J. Woeginger
2019	J	`jnl`	Engineering Kernelization for Maximum Cut. CoRR Damir Ferizovic, Demian Hespe, Sebastian Lamm, Matthias Mnich, Christian Schulz, Darren Strash
2019	J	`jnl`	Multitype Integer Monoid Optimization and Applications. CoRR Dusan Knop, Martin Koutecký, Asaf Levin, Matthias Mnich, Shmuel Onn
2019	C	`conf`	Parameterized Algorithms for Generalizations of Directed Feedback Vertex Set. CIAC Alexander Göke, Dániel Marx, Matthias Mnich
2019	B	`conf`	Resolving Infeasibility of Linear Systems: A Parameterized Approach. IPEC Alexander Göke, Lydia Mirabel Mendoza-Cadena, Matthias Mnich
2019	J	`jnl`	Single Machine Batch Scheduling to Minimize the Weighted Number of Tardy Jobs. CoRR Danny Hermelin, Matthias Mnich, Simon Omlor
2018	A	`conf`	A Unifying Framework for Manipulation Problems. AAMAS Dusan Knop, Martin Koutecký, Matthias Mnich
2018	J	`jnl`	A Unifying Framework for Manipulation Problems. CoRR Dusan Knop, Martin Koutecký, Matthias Mnich
2018	J	`jnl`	Big data algorithms beyond machine learning. Künstliche Intell. Matthias Mnich
2018	J	`jnl`	Improved bounds for minimal feedback vertex sets in tournaments. J. Graph Theory Matthias Mnich, Eva-Lotta Teutrine
2018	J	`jnl`	Improved integrality gap upper bounds for traveling salesperson problems with distances one and two. Eur. J. Oper. Res. Matthias Mnich, Tobias Mömke
2018	J	`jnl`	Linear Kernels and Linear-Time Algorithms for Finding Large Cuts. Algorithmica Michael Etscheid, Matthias Mnich
2018	J	`jnl`	Linear-time recognition of map graphs with outerplanar witness. Discret. Optim. Matthias Mnich, Ignaz Rutter, Jens M. Schmidt
2018	A*	`conf`	New Approximation Algorithms for (1, 2)-TSP. ICALP Anna Adamaszek, Matthias Mnich, Katarzyna Paluch
2018	J	`jnl`	New algorithms for maximum disjoint paths based on tree-likeness. Math. Program. Krzysztof Fleszar, Matthias Mnich, Joachim Spoerhase
2018	J	`jnl`	New deterministic algorithms for solving parity games. Discret. Optim. Matthias Mnich, Heiko Röglin, Clemens Rösner
2018	J	`jnl`	Parameterized complexity of machine scheduling: 15 open problems. Comput. Oper. Res. Matthias Mnich, René van Bevern
2018	A*	`conf`	Reachability Switching Games. ICALP John Fearnley, Martin Gairing, Matthias Mnich, Rahul Savani
2018	J	`jnl`	Time- and space-optimal algorithms for the many-visits TSP. CoRR André Berger, László Kozma, Matthias Mnich, Roland Vincze
2018	J	`jnl`	Voting and Bribing in Single-Exponential Time. CoRR Dusan Knop, Martin Koutecký, Matthias Mnich
2017	A	`conf`	Combinatorial n-fold Integer Programming and Applications. ESA Dusan Knop, Martin Koutecký, Matthias Mnich
2017	J	`jnl`	Combinatorial n-fold Integer Programming and Applications. CoRR Dusan Knop, Martin Koutecký, Matthias Mnich
2017	A*	`conf`	Dynamic Parameterized Problems and Algorithms. ICALP Josh Alman, Matthias Mnich, Virginia Vassilevska Williams
2017	J	`jnl`	Dynamic Parameterized Problems and Algorithms. CoRR Josh Alman, Matthias Mnich, Virginia Vassilevska Williams
2017	J	`jnl`	Large Independent Sets in Triangle-Free Planar Graphs. SIAM J. Discret. Math. Zdenek Dvorák, Matthias Mnich
2017	J	`jnl`	Odd Multiway Cut in Directed Acyclic Graphs. CoRR Karthekeyan Chandrasekaran, Matthias Mnich, Sahand Mozaffari
2017	J	`jnl`	Parameterized complexity of machine scheduling: 15 open problems. CoRR Matthias Mnich, René van Bevern
2017	J	`jnl`	Polynomial kernels for deletion to classes of acyclic digraphs. Discret. Optim. Matthias Mnich, Erik Jan van Leeuwen
2017	J	`jnl`	Polynomial kernels for weighted problems. J. Comput. Syst. Sci. Michael Etscheid, Stefan Kratsch, Matthias Mnich, Heiko Röglin
2017	J	`jnl`	Reachability Switching Games. CoRR John Fearnley, Martin Gairing, Matthias Mnich, Rahul Savani
2017	B	`conf`	Stable Marriage with Covering Constraints-A Complete Computational Trichotomy. SAGT Matthias Mnich, Ildikó Schlotter
2017	A	`conf`	Voting and Bribing in Single-Exponential Time. STACS Dusan Knop, Martin Koutecký, Matthias Mnich
2016	A	`conf`	A 7/3-Approximation for Feedback Vertex Sets in Tournaments. ESA Matthias Mnich, Virginia Vassilevska Williams, László A. Végh
2016	B	`conf`	Improved Bounds for Minimal Feedback Vertex Sets in Tournaments. IPEC Matthias Mnich, Eva-Lotta Teutrine
2016	B	`conf`	Large Independent Sets in Subquartic Planar Graphs. WALCOM Matthias Mnich
2016	B	`conf`	Linear Kernels and Linear-Time Algorithms for Finding Large Cuts. ISAAC Michael Etscheid, Matthias Mnich
2016	—	`conf`	Linear-Time Recognition of Map Graphs with Outerplanar Witness. SWAT Matthias Mnich, Ignaz Rutter, Jens M. Schmidt
2016	J	`jnl`	Lower Bounds for Locally Highly Connected Graphs. Graphs Comb. Anna Adamaszek, Michal Adamaszek, Matthias Mnich, Jens M. Schmidt
2016	A	`conf`	New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness. ESA Krzysztof Fleszar, Matthias Mnich, Joachim Spoerhase
2016	J	`jnl`	New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness. CoRR Krzysztof Fleszar, Matthias Mnich, Joachim Spoerhase
2016	B	`conf`	New Deterministic Algorithms for Solving Parity Games. LATIN Matthias Mnich, Heiko Röglin, Clemens Rösner
2016	—	`conf`	On Routing Disjoint Paths in Bounded Treewidth Graphs. SWAT Alina Ene, Matthias Mnich, Marcin Pilipczuk, Andrej Risteski
2016	J	`jnl`	Parameterized complexity dichotomy for Steiner Multicut. J. Comput. Syst. Sci. Karl Bringmann, Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen
2016	A	`conf`	Polynomial Kernels for Deletion to Classes of Acyclic Digraphs. STACS Matthias Mnich, Erik Jan van Leeuwen
2016	J	`jnl`	Stable Marriage with Covering Constraints: A Complete Computational Trichotomy. CoRR Matthias Mnich, Ildikó Schlotter
2015	J	`jnl`	A 7/3-Approximation for Feedback Vertex Sets in Tournaments. CoRR Matthias Mnich, Virginia Vassilevska Williams, László A. Végh
2015	J	`jnl`	Interval scheduling and colorful independent sets. J. Sched. René van Bevern, Matthias Mnich, Rolf Niedermeier, Mathias Weller
2015	J	`jnl`	Max-Cut Parameterized Above the Edwards-Erdős Bound. Algorithmica Robert Crowston, Mark Jones, Matthias Mnich
2015	J	`jnl`	New Deterministic Algorithms for Solving Parity Games. CoRR Matthias Mnich, Heiko Röglin, Clemens Rösner
2015	J	`jnl`	On Routing Disjoint Paths in Bounded Treewidth Graphs. CoRR Alina Ene, Matthias Mnich, Marcin Pilipczuk, Andrej Risteski
2015	A	`conf`	Parameterized Complexity Dichotomy for Steiner Multicut. STACS Karl Bringmann, Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen
2015	—	`conf`	Polynomial Kernels for Weighted Problems. MFCS (2) Michael Etscheid, Stefan Kratsch, Matthias Mnich, Heiko Röglin
2015	J	`jnl`	Polynomial Kernels for Weighted Problems. CoRR Michael Etscheid, Stefan Kratsch, Matthias Mnich, Heiko Röglin
2015	J	`jnl`	Scheduling and fixed-parameter tractability. Math. Program. Matthias Mnich, Andreas Wiese
2015	A*	`conf`	When Does Schwartz Conjecture Hold? IJCAI Matthias Mnich, Yash Raj Shrestha, Yongjie Yang
2014	J	`jnl`	Beyond Max-Cut: λ-extendible properties parameterized above the Poljak-Turzík bound. J. Comput. Syst. Sci. Matthias Mnich, Geevarghese Philip, Saket Saurabh, Ondrej Suchý
2014	J	`jnl`	Interval scheduling and colorful independent sets. CoRR René van Bevern, Matthias Mnich, Rolf Niedermeier, Mathias Weller
2014	A	`conf`	Large Independent Sets in Triangle-Free Planar Graphs. ESA Zdenek Dvorák, Matthias Mnich
2014	J	`jnl`	Parameterized Complexity Dichotomy for Steiner Multicut. CoRR Karl Bringmann, Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen
2014	J	`jnl`	Parameterized Complexity of Induced Graph Matching on Claw-Free Graphs. Algorithmica Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen
2014	B	`conf`	Scheduling and Fixed-Parameter Tractability. IPCO Matthias Mnich, Andreas Wiese
2014	—	`conf`	Treewidth Computation and Kernelization in the Parallel External Memory Model. IFIP TCS Riko Jacob, Tobias Lieber, Matthias Mnich
2013	J	`jnl`	Feedback Vertex Sets in Tournaments. J. Graph Theory Serge Gaspers, Matthias Mnich
2013	J	`jnl`	Improved integrality gap upper bounds for TSP with distances one and two. CoRR Matthias Mnich, Tobias Mömke
2013	J	`jnl`	Kernel and fast algorithm for dense triplet inconsistency. Theor. Comput. Sci. Sylvain Guillemot, Matthias Mnich
2013	J	`jnl`	Large Independent Sets in Triangle-Free Planar Graphs. CoRR Zdenek Dvorák, Matthias Mnich
2013	J	`jnl`	Scheduling Meets Fixed-Parameter Tractability. CoRR Matthias Mnich, Andreas Wiese
2012	—	`conf`	Beyond Max-Cut: lambda-Extendible Properties Parameterized Above the Poljak-Turzik Bound. FSTTCS Matthias Mnich, Geevarghese Philip, Saket Saurabh, Ondrej Suchý
2012	J	`jnl`	Beyond Max-Cut: λ-Extendible Properties Parameterized Above the Poljak-Turzík Bound CoRR Matthias Mnich, Geevarghese Philip, Saket Saurabh, Ondrej Suchý
2012	B	`conf`	Bisections above Tight Lower Bounds. WG Matthias Mnich, Rico Zenklusen
2012	J	`jnl`	Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables. J. Comput. Syst. Sci. Gregory Z. Gutin, Leo van Iersel, Matthias Mnich, Anders Yeo
2012	J	`jnl`	Induced Matchings in Subcubic Planar Graphs. SIAM J. Discret. Math. Ross J. Kang, Matthias Mnich, Tobias Müller
2012	B	`conf`	Interval Scheduling and Colorful Independent Sets. ISAAC René van Bevern, Matthias Mnich, Rolf Niedermeier, Mathias Weller
2012	—	`conf`	Max-Cut Parameterized above the Edwards-Erdős Bound. ICALP (1) Robert Crowston, Mark Jones, Matthias Mnich
2012	J	`jnl`	Parameterized Complexity of Induced Graph Matching on Claw-Free Graphs. CoRR Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen
2012	A	`conf`	Parameterized Complexity of Induced H-Matching on Claw-Free Graphs. ESA Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen
2011	J	`jnl`	A linear kernel for planar connected dominating set. Theor. Comput. Sci. Daniel Lokshtanov, Matthias Mnich, Saket Saurabh
2011	J	`jnl`	Book review. Oper. Res. Lett. Matthias Mnich
2011	—	`conf`	Domination When the Stars Are Out. ICALP (1) Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen, Gerhard J. Woeginger
2011	J	`jnl`	Max-Cut Parameterized Above the Edwards-Erdős Bound CoRR Robert Crowston, Mark Jones, Matthias Mnich
2011	B	`conf`	Planar k-Path in Subexponential Time and Polynomial Space. WG Daniel Lokshtanov, Matthias Mnich, Saket Saurabh
2010	J	`jnl`	All Ternary Permutation Constraint Satisfaction Problems Parameterized Above Average Have Polynomial Kernels CoRR Gregory Z. Gutin, Leo van Iersel, Matthias Mnich, Anders Yeo
2010	—	`conf`	All Ternary Permutation Constraint Satisfaction Problems Parameterized above Average Have Kernels with Quadratic Numbers of Variables. ESA (1) Gregory Z. Gutin, Leo van Iersel, Matthias Mnich, Anders Yeo
2010	J	`jnl`	Betweenness parameterized above tight lower bound. J. Comput. Syst. Sci. Gregory Z. Gutin, Eun Jung Kim, Matthias Mnich, Anders Yeo
2010	J	`jnl`	Domination When the Stars Are Out CoRR Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen, Gerhard J. Woeginger
2010	—	`conf`	Feedback Vertex Sets in Tournaments. ESA (1) Serge Gaspers, Matthias Mnich
2010	—	`conf`	Induced Matchings in Subcubic Planar Graphs. ESA (2) Ross J. Kang, Matthias Mnich, Tobias Müller
2010	C	`conf`	Kernel and Fast Algorithm for Dense Triplet Inconsistency. TAMC Sylvain Guillemot, Matthias Mnich
2010	C	`conf`	Ranking and Drawing in Subexponential Time. IWOCA Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Matthias Mnich, Geevarghese Philip, Saket Saurabh
2009	C	`conf`	Linear Kernel for Planar Connected Dominating Set. TAMC Daniel Lokshtanov, Matthias Mnich, Saket Saurabh
2009	J	`jnl`	On Feedback Vertex Sets in Tournaments CoRR Serge Gaspers, Matthias Mnich
2009	J	`jnl`	Ordinal Embedding Relaxations Parameterized Above Tight Lower Bound CoRR Gregory Z. Gutin, Eun Jung Kim, Matthias Mnich, Anders Yeo
2009	J	`jnl`	The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number. Theory Comput. Syst. Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Matthias Mnich, Frances A. Rosamond, Saket Saurabh
2009	J	`jnl`	Uniqueness, Intractability and Exact Algorithms: Reflections on Level-k Phylogenetic Networks. J. Bioinform. Comput. Biol. Leo van Iersel, Steven Kelk, Matthias Mnich