default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthias Mnich
Person information
- affiliation: TU Hamburg, Institute for Algorithms and Complexity, Germany
- affiliation: University of Bonn, Institute of Computer Science, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j42]Parinya Chalermsook
, Matthias Kaul, Matthias Mnich, Joachim Spoerhase, Sumedha Uniyal, Daniel Vaz:
Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial Diameter. ACM Trans. Algorithms 20(1): 6:1-6:20 (2024)- [c51]Susanne Armbruster, Matthias Mnich, Martin Nägele:
A (3/2 + 1/e)-Approximation Algorithm for Ordered TSP. APPROX/RANDOM 2024: 1:1-1:18 - [c50]Klaus Heeger, Danny Hermelin, Matthias Mnich, Dvir Shabtay:
No Polynomial Kernels for Knapsack. ICALP 2024: 83:1-83:17 - [c49]Laura Codazzi, Gergely Csáji, Matthias Mnich:
Efficient Cost-Minimization Schemes for Electrical Energy Demand Satisfaction by Prosumers in Microgrids with Battery Storage Capabilities. IJCAI 2024: 1873-1880 - [c48]Sebastian Berndt, Matthias Mnich, Tobias Stamm:
New Support Size Bounds and Proximity Bounds for Integer Linear Programming. SOFSEM 2024: 82-95 - [i49]Susanne Armbruster, Matthias Mnich, Martin Nägele:
A (3/2+1/e)-Approximation Algorithm for Ordered TSP. CoRR abs/2405.06244 (2024) - [i48]Matthias Kaul, Matthias Mnich, Hendrik Molter:
Single-Machine Scheduling to Minimize the Number of Tardy Jobs with Release Dates. CoRR abs/2408.12967 (2024) - 2023
- [j41]Dusan Knop, Martin Koutecký, Asaf Levin, Matthias Mnich, Shmuel Onn:
High-multiplicity N-fold IP via configuration LP. Math. Program. 200(1): 199-227 (2023) - [c47]Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen:
Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth. ESA 2023: 18:1-18:18 - [c46]Max Deppert, Matthias Kaul, Matthias Mnich:
A (3/2 + ε)-Approximation for Multiple TSP with a Variable Number of Depots. ESA 2023: 39:1-39:15 - [c45]Ariel Kulik, Matthias Mnich, Hadas Shachnai:
Improved Approximations for Vector Bin Packing via Iterative Randomized Rounding. FOCS 2023: 1366-1376 - [c44]Christian Dietrich, Tim-Marek Thomas, Matthias Mnich:
Checkpoint Placement for Systematic Fault-Injection Campaigns. ICCAD 2023: 1-9 - [c43]Sebastian Berndt, Hauke Brinkop, Klaus Jansen, Matthias Mnich, Tobias Stamm:
New Support Size Bounds for Integer Programming, Applied to Makespan Minimization on Uniformly Related Machines. ISAAC 2023: 13:1-13:18 - [i47]Sebastian Berndt, Hauke Brinkop, Klaus Jansen, Matthias Mnich, Tobias Stamm:
New Support Size Bounds for Integer Programming, Applied to Makespan Minimization on Uniformly Related Machines. CoRR abs/2305.08432 (2023) - [i46]Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen:
Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth. CoRR abs/2307.01285 (2023) - [i45]Max Deppert, Matthias Kaul, Matthias Mnich:
A (3/2 + ε)-Approximation for Multiple TSP with a Variable Number of Depots. CoRR abs/2307.07180 (2023) - [i44]Christian Dietrich, Tim-Marek Thomas, Matthias Mnich:
Checkpoint Placement for Systematic Fault-Injection Campaigns. CoRR abs/2308.05521 (2023) - [i43]Klaus Heeger, Danny Hermelin, Matthias Mnich, Dvir Shabtay:
No Polynomial Kernels for Knapsack. CoRR abs/2308.12593 (2023) - 2022
- [j40]Alexander Göke, Dániel Marx, Matthias Mnich:
Parameterized algorithms for generalizations of Directed Feedback Vertex Set. Discret. Optim. 46: 100740 (2022) - [j39]Alexander Göke, Jochen Könemann, Matthias Mnich, Hao Sun:
Hitting Weighted Even Cycles in Planar Graphs. SIAM J. Discret. Math. 36(4): 2830-2862 (2022) - [j38]Kristóf Bérczi, Matthias Mnich, Roland Vincze:
A 3/2-Approximation for the Metric Many-Visits Path TSP. SIAM J. Discret. Math. 36(4): 2995-3030 (2022) - [p1]Faisal N. Abu-Khzam, Sebastian Lamm, Matthias Mnich, Alexander Noe, Christian Schulz, Darren Strash:
Recent Advances in Practical Data Reduction. Algorithms for Big Data 2022: 97-133 - [i42]Kristóf Bérczi, Matthias Mnich, Roland Vincze:
Efficient Approximations for Many-Visits Multiple Traveling Salesman Problems. CoRR abs/2201.02054 (2022) - [i41]Ariel Kulik, Matthias Mnich, Hadas Shachnai:
An Asymptotic (4/3+ε)-Approximation for the 2-Dimensional Vector Bin Packing Problem. CoRR abs/2205.12828 (2022) - [i40]Gregory Z. Gutin, Matthias Mnich:
A Survey on Graph Problems Parameterized Above and Below Guaranteed Values. CoRR abs/2207.12278 (2022) - [i39]Kristóf Bérczi, Alexander Göke, Lydia Mirabel Mendoza Cadena, Matthias Mnich:
Resolving Infeasibility of Linear Systems: A Parameterized Approach. CoRR abs/2209.02017 (2022) - 2021
- [j37]John Fearnley, Martin Gairing, Matthias Mnich, Rahul Savani:
Reachability Switching Games. Log. Methods Comput. Sci. 17(2) (2021) - [j36]Dusan Knop, Martin Koutecký, Asaf Levin, Matthias Mnich, Shmuel Onn:
Parameterized complexity of configuration integer programs. Oper. Res. Lett. 49(6): 908-913 (2021) - [c42]Alexander Göke, Jochen Könemann, Matthias Mnich, Hao Sun:
Hitting Weighted Even Cycles in Planar Graphs. APPROX-RANDOM 2021: 25:1-25:23 - [i38]Alexander Göke, Jochen Könemann, Matthias Mnich, Hao Sun:
Hitting Weighted Even Cycles in Planar Graphs. CoRR abs/2107.04763 (2021) - [i37]Parinya Chalermsook, Matthias Kaul, Matthias Mnich, Joachim Spoerhase, Sumedha Uniyal, Daniel Vaz:
Approximating Sparsest Cut in Low-Treewidth Graphs via Combinatorial Diameter. CoRR abs/2111.06299 (2021) - 2020
- [j35]Matthias Mnich, Ildikó Schlotter:
Stable Matchings with Covering Constraints: A Complete Computational Trichotomy. Algorithmica 82(5): 1136-1188 (2020) - [j34]Aida Abiad, Sander Gribling, Domenico Lahaye, Matthias Mnich, Guus Regts, Lluís Vena, Gerard Verweij, Peter J. Zwaneveld:
On the complexity of solving a decision problem with flow-depending costs: The case of the IJsselmeer dikes. Discret. Optim. 37: 100565 (2020) - [j33]Dusan Knop, Martin Koutecký, Matthias Mnich:
Combinatorial n-fold integer programming and applications. Math. Program. 184(1): 1-34 (2020) - [j32]Karthekeyan Chandrasekaran, Matthias Mnich, Sahand Mozaffari:
Odd Multiway Cut in Directed Acyclic Graphs. SIAM J. Discret. Math. 34(2): 1385-1408 (2020) - [j31]André Berger, László Kozma, Matthias Mnich, Roland Vincze:
Time- and Space-optimal Algorithm for the Many-visits TSP. ACM Trans. Algorithms 16(3): 35:1-35:22 (2020) - [j30]Josh Alman, Matthias Mnich, Virginia Vassilevska Williams:
Dynamic Parameterized Problems and Algorithms. ACM Trans. Algorithms 16(4): 45:1-45:46 (2020) - [j29]Dusan Knop, Martin Koutecký, Matthias Mnich:
Voting and Bribing in Single-Exponential Time. ACM Trans. Economics and Comput. 8(3): 12:1-12:28 (2020) - [c41]Damir Ferizovic, Demian Hespe, Sebastian Lamm, Matthias Mnich, Christian Schulz, Darren Strash:
Engineering Kernelization for Maximum Cut. ALENEX 2020: 27-41 - [c40]Alexander Göke, Dániel Marx, Matthias Mnich:
Hitting Long Directed Cycles Is Fixed-Parameter Tractable. ICALP 2020: 59:1-59:18 - [c39]Max Bannach, Sebastian Berndt, Marten Maack, Matthias Mnich, Alexandra Lassota, Malin Rau, Malte Skambath:
Solving Packing Problems with Few Small Items Using Rainbow Matchings. MFCS 2020: 11:1-11:14 - [i36]Alexander Göke, Dániel Marx, Matthias Mnich:
Parameterized Algorithms for Generalizations of Directed Feedback Vertex Set. CoRR abs/2003.02483 (2020) - [i35]Alexander Göke, Dániel Marx, Matthias Mnich:
Hitting Long Directed Cycles is Fixed-Parameter Tractable. CoRR abs/2003.05267 (2020) - [i34]Marek Karpinski, Mateusz Lewandowski, Syed Mohammad Meesum, Matthias Mnich:
Dense Steiner problems: Approximation algorithms and inapproximability. CoRR abs/2004.14102 (2020) - [i33]Max Bannach, Sebastian Berndt, Marten Maack, Matthias Mnich, Alexandra Lassota, Malin Rau, Malte Skambath:
Solving Packing Problems with Few Small Items Using Rainbow Matchings. CoRR abs/2007.02660 (2020) - [i32]Kristóf Bérczi, Matthias Mnich, Roland Vincze:
A 3/2-Approximation for the Metric Many-visits Path TSP. CoRR abs/2007.11389 (2020) - [i31]Faisal N. Abu-Khzam, Sebastian Lamm, Matthias Mnich, Alexander Noe, Christian Schulz, Darren Strash:
Recent Advances in Practical Data Reduction. CoRR abs/2012.12594 (2020)
2010 – 2019
- 2019
- [j28]Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen, Gerhard J. Woeginger:
Domination When the Stars Are Out. ACM Trans. Algorithms 15(2): 25:1-25:90 (2019) - [c38]Alexander Göke, Dániel Marx, Matthias Mnich:
Parameterized Algorithms for Generalizations of Directed Feedback Vertex Set. CIAC 2019: 249-261 - [c37]Alexander Göke, Lydia Mirabel Mendoza Cadena, Matthias Mnich:
Resolving Infeasibility of Linear Systems: A Parameterized Approach. IPEC 2019: 17:1-17:15 - [c36]André Berger, László Kozma, Matthias Mnich, Roland Vincze:
A time- and space-optimal algorithm for the many-visits TSP. SODA 2019: 1770-1782 - [i30]Damir Ferizovic, Demian Hespe, Sebastian Lamm, Matthias Mnich, Christian Schulz, Darren Strash:
Engineering Kernelization for Maximum Cut. CoRR abs/1905.10902 (2019) - [i29]Dusan Knop, Martin Koutecký, Asaf Levin, Matthias Mnich, Shmuel Onn:
Multitype Integer Monoid Optimization and Applications. CoRR abs/1909.07326 (2019) - [i28]Kristóf Bérczi, André Berger, Matthias Mnich, Roland Vincze:
Degree-Bounded Generalized Polymatroids and Approximating the Metric Many-Visits TSP. CoRR abs/1911.09890 (2019) - [i27]Danny Hermelin, Matthias Mnich, Simon Omlor:
Single Machine Batch Scheduling to Minimize the Weighted Number of Tardy Jobs. CoRR abs/1911.12350 (2019) - 2018
- [j27]Michael Etscheid, Matthias Mnich:
Linear Kernels and Linear-Time Algorithms for Finding Large Cuts. Algorithmica 80(9): 2574-2615 (2018) - [j26]Matthias Mnich, René van Bevern:
Parameterized complexity of machine scheduling: 15 open problems. Comput. Oper. Res. 100: 254-261 (2018) - [j25]Matthias Mnich, Ignaz Rutter, Jens M. Schmidt:
Linear-time recognition of map graphs with outerplanar witness. Discret. Optim. 28: 63-77 (2018) - [j24]Matthias Mnich, Heiko Röglin, Clemens Rösner:
New deterministic algorithms for solving parity games. Discret. Optim. 30: 73-95 (2018) - [j23]Matthias Mnich, Tobias Mömke:
Improved integrality gap upper bounds for traveling salesperson problems with distances one and two. Eur. J. Oper. Res. 266(2): 436-457 (2018) - [j22]Matthias Mnich, Eva-Lotta Teutrine:
Improved bounds for minimal feedback vertex sets in tournaments. J. Graph Theory 88(3): 482-506 (2018) - [j21]Matthias Mnich:
Big data algorithms beyond machine learning. Künstliche Intell. 32(1): 9-17 (2018) - [j20]Krzysztof Fleszar, Matthias Mnich, Joachim Spoerhase:
New algorithms for maximum disjoint paths based on tree-likeness. Math. Program. 171(1-2): 433-461 (2018) - [c35]Dusan Knop, Martin Koutecký, Matthias Mnich:
A Unifying Framework for Manipulation Problems. AAMAS 2018: 256-264 - [c34]Anna Adamaszek, Matthias Mnich, Katarzyna Paluch:
New Approximation Algorithms for (1, 2)-TSP. ICALP 2018: 9:1-9:14 - [c33]John Fearnley, Martin Gairing, Matthias Mnich, Rahul Savani:
Reachability Switching Games. ICALP 2018: 124:1-124:14 - [i26]Dusan Knop, Martin Koutecký, Matthias Mnich:
A Unifying Framework for Manipulation Problems. CoRR abs/1801.09584 (2018) - [i25]André Berger, László Kozma, Matthias Mnich, Roland Vincze:
Time- and space-optimal algorithms for the many-visits TSP. CoRR abs/1804.06361 (2018) - [i24]Dusan Knop, Martin Koutecký, Matthias Mnich:
Voting and Bribing in Single-Exponential Time. CoRR abs/1812.01852 (2018) - 2017
- [j19]Matthias Mnich, Erik Jan van Leeuwen:
Polynomial kernels for deletion to classes of acyclic digraphs. Discret. Optim. 25: 48-76 (2017) - [j18]Michael Etscheid, Stefan Kratsch, Matthias Mnich, Heiko Röglin:
Polynomial kernels for weighted problems. J. Comput. Syst. Sci. 84: 1-10 (2017) - [j17]Zdenek Dvorák, Matthias Mnich:
Large Independent Sets in Triangle-Free Planar Graphs. SIAM J. Discret. Math. 31(2): 1355-1373 (2017) - [c32]Dusan Knop, Martin Koutecký, Matthias Mnich:
Combinatorial n-fold Integer Programming and Applications. ESA 2017: 54:1-54:14 - [c31]Josh Alman, Matthias Mnich, Virginia Vassilevska Williams:
Dynamic Parameterized Problems and Algorithms. ICALP 2017: 41:1-41:16 - [c30]Matthias Mnich, Ildikó Schlotter:
Stable Marriage with Covering Constraints-A Complete Computational Trichotomy. SAGT 2017: 320-332 - [c29]Dusan Knop, Martin Koutecký, Matthias Mnich:
Voting and Bribing in Single-Exponential Time. STACS 2017: 46:1-46:14 - [i23]Dusan Knop, Martin Koutecký, Matthias Mnich:
Combinatorial n-fold Integer Programming and Applications. CoRR abs/1705.08657 (2017) - [i22]Josh Alman, Matthias Mnich, Virginia Vassilevska Williams:
Dynamic Parameterized Problems and Algorithms. CoRR abs/1707.00362 (2017) - [i21]Karthekeyan Chandrasekaran, Matthias Mnich, Sahand Mozaffari:
Odd Multiway Cut in Directed Acyclic Graphs. CoRR abs/1708.02323 (2017) - [i20]Matthias Mnich, René van Bevern:
Parameterized complexity of machine scheduling: 15 open problems. CoRR abs/1709.01670 (2017) - [i19]John Fearnley, Martin Gairing, Matthias Mnich, Rahul Savani:
Reachability Switching Games. CoRR abs/1709.08991 (2017) - 2016
- [j16]Anna Adamaszek, Michal Adamaszek, Matthias Mnich, Jens M. Schmidt:
Lower Bounds for Locally Highly Connected Graphs. Graphs Comb. 32(5): 1641-1650 (2016) - [j15]Karl Bringmann, Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen:
Parameterized complexity dichotomy for Steiner Multicut. J. Comput. Syst. Sci. 82(6): 1020-1043 (2016) - [c28]Krzysztof Fleszar, Matthias Mnich, Joachim Spoerhase:
New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness. ESA 2016: 42:1-42:17 - [c27]Matthias Mnich, Virginia Vassilevska Williams, László A. Végh:
A 7/3-Approximation for Feedback Vertex Sets in Tournaments. ESA 2016: 67:1-67:14 - [c26]Michael Etscheid, Matthias Mnich:
Linear Kernels and Linear-Time Algorithms for Finding Large Cuts. ISAAC 2016: 31:1-31:13 - [c25]Matthias Mnich, Eva-Lotta Teutrine:
Improved Bounds for Minimal Feedback Vertex Sets in Tournaments. IPEC 2016: 24:1-24:10 - [c24]Matthias Mnich, Heiko Röglin, Clemens Rösner:
New Deterministic Algorithms for Solving Parity Games. LATIN 2016: 634-645 - [c23]Matthias Mnich, Erik Jan van Leeuwen:
Polynomial Kernels for Deletion to Classes of Acyclic Digraphs. STACS 2016: 55:1-55:13 - [c22]Matthias Mnich, Ignaz Rutter, Jens M. Schmidt:
Linear-Time Recognition of Map Graphs with Outerplanar Witness. SWAT 2016: 5:1-5:14 - [c21]Alina Ene, Matthias Mnich, Marcin Pilipczuk, Andrej Risteski:
On Routing Disjoint Paths in Bounded Treewidth Graphs. SWAT 2016: 15:1-15:15 - [c20]Matthias Mnich:
Large Independent Sets in Subquartic Planar Graphs. WALCOM 2016: 209-221 - [i18]Matthias Mnich, Ildikó Schlotter:
Stable Marriage with Covering Constraints: A Complete Computational Trichotomy. CoRR abs/1602.08230 (2016) - [i17]Krzysztof Fleszar, Matthias Mnich, Joachim Spoerhase:
New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness. CoRR abs/1603.01740 (2016) - 2015
- [j14]Robert Crowston, Mark Jones, Matthias Mnich:
Max-Cut Parameterized Above the Edwards-Erdős Bound. Algorithmica 72(3): 734-757 (2015) - [j13]Matthias Mnich, Andreas Wiese:
Scheduling and fixed-parameter tractability. Math. Program. 154(1-2): 533-562 (2015) - [j12]René van Bevern, Matthias Mnich, Rolf Niedermeier, Mathias Weller:
Interval scheduling and colorful independent sets. J. Sched. 18(5): 449-469 (2015) - [c19]Matthias Mnich, Yash Raj Shrestha, Yongjie Yang:
When Does Schwartz Conjecture Hold? IJCAI 2015: 603-609 - [c18]Michael Etscheid, Stefan Kratsch, Matthias Mnich, Heiko Röglin:
Polynomial Kernels for Weighted Problems. MFCS (2) 2015: 287-298 - [c17]Karl Bringmann, Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen:
Parameterized Complexity Dichotomy for Steiner Multicut. STACS 2015: 157-170 - [i16]Michael Etscheid, Stefan Kratsch, Matthias Mnich, Heiko Röglin:
Polynomial Kernels for Weighted Problems. CoRR abs/1507.03439 (2015) - [i15]Matthias Mnich, Virginia Vassilevska Williams, László A. Végh:
A 7/3-Approximation for Feedback Vertex Sets in Tournaments. CoRR abs/1511.01137 (2015) - [i14]Alina Ene, Matthias Mnich, Marcin Pilipczuk, Andrej Risteski:
On Routing Disjoint Paths in Bounded Treewidth Graphs. CoRR abs/1512.01829 (2015) - [i13]Matthias Mnich, Heiko Röglin, Clemens Rösner:
New Deterministic Algorithms for Solving Parity Games. CoRR abs/1512.03246 (2015) - 2014
- [j11]Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen:
Parameterized Complexity of Induced Graph Matching on Claw-Free Graphs. Algorithmica 70(3): 513-560 (2014) - [j10]Matthias Mnich, Geevarghese Philip, Saket Saurabh, Ondrej Suchý:
Beyond Max-Cut: λ-extendible properties parameterized above the Poljak-Turzík bound. J. Comput. Syst. Sci. 80(7): 1384-1403 (2014) - [c16]Zdenek Dvorák, Matthias Mnich:
Large Independent Sets in Triangle-Free Planar Graphs. ESA 2014: 346-357 - [c15]Riko Jacob, Tobias Lieber, Matthias Mnich:
Treewidth Computation and Kernelization in the Parallel External Memory Model. IFIP TCS 2014: 78-89 - [c14]Matthias Mnich, Andreas Wiese:
Scheduling and Fixed-Parameter Tractability. IPCO 2014: 381-392 - [i12]René van Bevern, Matthias Mnich, Rolf Niedermeier, Mathias Weller:
Interval scheduling and colorful independent sets. CoRR abs/1402.0851 (2014) - [i11]Karl Bringmann, Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen:
Parameterized Complexity Dichotomy for Steiner Multicut. CoRR abs/1404.7006 (2014) - 2013
- [j9]Serge Gaspers, Matthias Mnich:
Feedback Vertex Sets in Tournaments. J. Graph Theory 72(1): 72-89 (2013) - [j8]Sylvain Guillemot, Matthias Mnich:
Kernel and fast algorithm for dense triplet inconsistency. Theor. Comput. Sci. 494: 134-143 (2013) - [i10]Zdenek Dvorák, Matthias Mnich:
Large Independent Sets in Triangle-Free Planar Graphs. CoRR abs/1311.2749 (2013) - [i9]Matthias Mnich, Andreas Wiese:
Scheduling Meets Fixed-Parameter Tractability. CoRR abs/1311.4021 (2013) - [i8]Matthias Mnich, Tobias Mömke:
Improved integrality gap upper bounds for TSP with distances one and two. CoRR abs/1312.2502 (2013) - 2012
- [j7]Gregory 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. 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. Discret. 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]Matthias Mnich, Rico Zenklusen:
Bisections above Tight Lower Bounds. WG 2012: 184-193 - [i7]Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen:
Parameterized Complexity of Induced Graph Matching on Claw-Free Graphs. CoRR abs/1206.7105 (2012) - [i6]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]Matthias Mnich:
Book review. Oper. Res. Lett. 39(3): 229-230 (2011) - [j4]Daniel Lokshtanov, Matthias Mnich, Saket Saurabh:
A linear kernel for 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 - [i5]Robert Crowston, Mark Jones, Matthias Mnich:
Max-Cut Parameterized Above the Edwards-Erdős Bound. CoRR abs/1112.3506 (2011) - 2010
- [j3]Gregory Z. 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]Serge Gaspers, Matthias Mnich:
Feedback Vertex Sets in Tournaments. ESA (1) 2010: 267-277 - [c4]Gregory 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. 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 - [i4]Gregory Z. 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) - [i3]Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen, Gerhard J. Woeginger:
Domination When the Stars Are Out. CoRR abs/1012.0012 (2010)
2000 – 2009
- 2009
- [j2]Leo van Iersel, Steven Kelk, Matthias Mnich:
Uniqueness, Intractability and Exact Algorithms: Reflections on Level-k Phylogenetic Networks. J. Bioinform. Comput. Biol. 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 - [i2]Serge Gaspers, Matthias Mnich:
On Feedback Vertex Sets in Tournaments. CoRR abs/0905.0567 (2009) - [i1]Gregory Z. Gutin, Eun Jung Kim, Matthias Mnich, Anders Yeo:
Ordinal Embedding Relaxations Parameterized Above Tight Lower Bound. CoRR abs/0907.5427 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-21 21:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
