Name
Affiliation
Papers
MATTHIAS MNICH
Department of Mathematics and Computer Science|Eindhoven University of Technology
55
Collaborators
Citations 
PageRank 
76
253
25.44
Referers 
Referees 
References 
320
816
752
Search Limit
100816
Title
Citations
PageRank
Year
Hitting Long Directed Cycles is Fixed-Parameter Tractable00.342020
Dynamic Parameterized Problems and Algorithms10.362020
Combinatorial n-fold integer programming and applications.00.342020
Odd Multiway Cut in Directed Acyclic Graphs.00.342020
Parameterized Algorithms for Generalizations of Directed Feedback Vertex Set.00.342019
Resolving Infeasibility of Linear Systems - A Parameterized Approach.00.342019
Engineering Kernelization for Maximum Cut.00.342019
Linear-Time Recognition of Map Graphs with Outerplanar Witness.40.462018
Parameterized complexity of machine scheduling: 15 open problems.80.502018
A time- and space-optimal algorithm for the many-visits TSP00.342018
Voting and Bribing in Single-Exponential Time30.382018
Reachability Switching Games00.342018
Improved Bounds for Minimal Feedback Vertex Sets in Tournaments.00.342018
Linear Kernels and Linear-Time Algorithms for Finding Large Cuts.40.482018
Improved integrality gap upper bounds for traveling salesperson problems with distances one and two.00.342018
Big data algorithms beyond machine learning.00.342018
New Approximation Algorithms for (1, 2)-TSP.00.342018
A Unifying Framework For Manipulation Problems10.352018
Polynomial Kernels for Deletion to Classes of Acyclic Digraphs.40.532017
Combinatorial n-fold Integer Programming and Applications.100.582017
Stable Matchings with Covering Constraints: A Complete Computational Trichotomy40.422017
New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness.10.362016
Large Independent Sets in Subquartic Planar Graphs.10.402016
Lower Bounds for Locally Highly Connected Graphs.00.342016
New Deterministic Algorithms for Solving Parity Games00.342015
A 7/3-Approximation for Feedback Vertex Sets in Tournaments00.342015
On Routing Disjoint Paths in Bounded Treewidth Graphs20.402015
Polynomial Kernels for Weighted Problems10.362015
Scheduling and fixed-parameter tractability170.672014
Parameterized Complexity of Induced Graph Matching on Claw-Free Graphs50.502014
Parameterized Complexity Dichotomy for Steiner Multicut.10.372014
Improved integrality gap upper bounds for TSP with distances one and two.10.362013
Large Independent Sets in Triangle-Free Planar Graphs.30.472013
Feedback Vertex Sets in Tournaments110.672013
Kernel and fast algorithm for dense triplet inconsistency60.482013
Scheduling Meets Fixed-Parameter Tractability.20.372013
Interval scheduling and colorful independent sets.130.582012
Beyond Max-Cut: λ-extendible properties parameterized above the Poljak-Turzík bound.00.342012
Induced Matchings in Subcubic Planar Graphs100.662012
Max-cut parameterized above the edwards-erdős bound70.532012
Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables70.512012
Parameterized complexity of induced h-matching on claw-free graphs30.392012
Beyond Max-Cut: lambda-Extendible Properties Parameterized Above the Poljak-Turzik Bound.60.632012
Bisections above tight lower bounds80.532012
Planar k-path in subexponential time and polynomial space30.402011
Domination when the stars are out110.542011
A linear kernel for a planar connected dominating set170.762011
All Ternary Permutation Constraint Satisfaction Problems Parameterized Above Average Have Polynomial Kernels30.402010
All ternary permutation constraint satisfaction problems parameterized above average have kernels with quadratic numbers of variables160.942010
Betweenness parameterized above tight lower bound160.772010
  • 1
  • 2