pith. sign in

Matthias Mnich

Identifiers

  • name variant Matthias Mnich 0.60 · backfill

Papers (27)

  1. Engineering Kernelization for Maximum Cut cs.DS · 2019 · author #4
  2. Voting and Bribing in Single-Exponential Time cs.DS · 2018 · author #3
  3. On the complexity of solving a decision problem with flow-depending costs: the case of the IJsselmeer dikes q-fin.RM · 2018 · author #4
  4. A Unifying Framework for Manipulation Problems cs.MA · 2018 · author #3
  5. Parameterized complexity of machine scheduling: 15 open problems math.OC · 2017 · author #1
  6. Odd Multiway Cut in Directed Acyclic Graphs cs.DS · 2017 · author #2
  7. Dynamic Parameterized Problems and Algorithms cs.DS · 2017 · author #2
  8. Combinatorial n-fold Integer Programming and Applications cs.DS · 2017 · author #3
  9. New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness cs.DS · 2016 · author #2
  10. New Deterministic Algorithms for Solving Parity Games cs.CC · 2015 · author #1
  11. On Routing Disjoint Paths in Bounded Treewidth Graphs cs.DS · 2015 · author #2
  12. A 7/3-Approximation for Feedback Vertex Sets in Tournaments cs.DS · 2015 · author #1
  13. Polynomial Kernels for Weighted Problems cs.CC · 2015 · author #3
  14. Parameterized Complexity Dichotomy for Steiner Multicut cs.DS · 2014 · author #3
  15. Interval scheduling and colorful independent sets cs.DM · 2014 · author #2
  16. Improved integrality gap upper bounds for TSP with distances one and two cs.DS · 2013 · author #1
  17. Scheduling Meets Fixed-Parameter Tractability cs.DS · 2013 · author #1
  18. Large Independent Sets in Triangle-Free Planar Graphs cs.DM · 2013 · author #2
  19. Beyond Max-Cut: \lambda-Extendible Properties Parameterized Above the Poljak-Turz\'{i}k Bound cs.DS · 2012 · author #1
  20. Parameterized Complexity of Induced Graph Matching on Claw-Free Graphs cs.DM · 2012 · author #2
  21. Max-Cut Parameterized Above the Edwards-Erd\H{o}s Bound cs.DS · 2011 · author #3
  22. Domination When the Stars Are Out cs.DS · 2010 · author #2
  23. All Ternary Permutation Constraint Satisfaction Problems Parameterized Above Average Have Kernels with Quadratic Numbers of Variables cs.DS · 2010 · author #3
  24. Betweenness Parameterized Above Tight Lower Bound cs.DS · 2009 · author #3
  25. Feedback Vertex Sets in Tournaments cs.DM · 2009 · author #2
  26. Computing Rooted and Unrooted Maximum Consistent Supertrees cs.DM · 2009 · author #2
  27. Uniqueness, intractability and exact algorithms: reflections on level-k phylogenetic networks q-bio.PE · 2007 · author #3

Mentions

  • 1402.0851 #2 · backfill · confidence 0.70 Matthias Mnich
  • 1312.2502 #1 · backfill · confidence 0.70 Matthias Mnich
  • 1311.4021 #1 · backfill · confidence 0.70 Matthias Mnich
  • 1311.2749 #2 · backfill · confidence 0.70 Matthias Mnich
  • 1207.5696 #1 · backfill · confidence 0.70 Matthias Mnich
  • 1206.7105 #2 · backfill · confidence 0.70 Matthias Mnich
  • 1112.3506 #3 · backfill · confidence 0.70 Matthias Mnich
  • 1012.0012 #2 · backfill · confidence 0.70 Matthias Mnich
  • 1004.1956 #3 · backfill · confidence 0.70 Matthias Mnich
  • 0907.5427 #3 · backfill · confidence 0.70 Matthias Mnich
  • 0905.0567 #2 · backfill · confidence 0.70 Matthias Mnich
  • 0901.3299 #2 · backfill · confidence 0.70 Matthias Mnich
  • 0712.2932 #3 · backfill · confidence 0.70 Matthias Mnich

Frequent Coauthors