The following pages link to Matthias Mnich (Q295635):
Displaying 50 items.
- Parameterized complexity dichotomy for \textsc{Steiner Multicut} (Q295637) (← links)
- Polynomial kernels for weighted problems (Q340549) (← links)
- Kernel and fast algorithm for dense triplet inconsistency (Q391097) (← links)
- Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables (Q414863) (← links)
- Parameterized complexity of induced graph matching on claw-free graphs (Q487013) (← links)
- A linear kernel for a planar connected dominating set (Q534569) (← links)
- Stable marriage with covering constraints -- a complete computational trichotomy (Q681890) (← links)
- Linear kernels and linear-time algorithms for finding large cuts (Q722541) (← links)
- The complexity ecology of parameters: An illustration using bounded max leaf number (Q733736) (← links)
- On the complexity of solving a decision problem with flow-depending costs: the case of the IJsselmeer dikes (Q783034) (← links)
- Interval scheduling and colorful independent sets (Q892898) (← links)
- Scheduling and fixed-parameter tractability (Q896271) (← links)
- Linear-time recognition of map graphs with outerplanar witness (Q1662161) (← links)
- Polynomial kernels for deletion to classes of acyclic digraphs (Q1751231) (← links)
- Improved integrality gap upper bounds for traveling salesperson problems with distances one and two (Q1754106) (← links)
- New deterministic algorithms for solving parity games (Q1756345) (← links)
- Parameterized complexity of machine scheduling: 15 open problems (Q1782183) (← links)
- New algorithms for maximum disjoint paths based on tree-likeness (Q1785205) (← links)
- Betweenness parameterized above tight lower bound (Q1959433) (← links)
- Combinatorial \(n\)-fold integer programming and applications (Q2205969) (← links)
- Stable matchings with covering constraints: a complete computational trichotomy (Q2309466) (← links)
- Beyond Max-Cut: \(\lambda\)-extendible properties parameterized above the Poljak-Turzík bound (Q2453557) (← links)
- Parameterized complexity of configuration integer programs (Q2670456) (← links)
- Max-Cut Parameterized above the Edwards-Erdős Bound (Q2843252) (← links)
- Parameterized Complexity of Induced H-Matching on Claw-Free Graphs (Q2912880) (← links)
- Large Independent Sets in Triangle-Free Planar Graphs (Q2921419) (← links)
- Parameterized complexity dichotomy for Steiner Multicut (Q2954992) (← links)
- Beyond Max-Cut: lambda-Extendible Properties Parameterized Above the Poljak-Turzik Bound (Q2957517) (← links)
- Ranking and Drawing in Subexponential Time (Q3000521) (← links)
- Domination When the Stars Are Out (Q3012826) (← links)
- (Q3089795) (← links)
- Planar k-Path in Subexponential Time and Polynomial Space (Q3104782) (← links)
- Treewidth Computation and Kernelization in the Parallel External Memory Model (Q3190152) (← links)
- Odd Multiway Cut in Directed Acyclic Graphs (Q3300762) (← links)
- Kernel and Fast Algorithm for Dense Triplet Inconsistency (Q3569080) (← links)
- Induced Matchings in Subcubic Planar Graphs (Q3586388) (← links)
- Feedback Vertex Sets in Tournaments (Q3586468) (← links)
- All Ternary Permutation Constraint Satisfaction Problems Parameterized above Average Have Kernels with Quadratic Numbers of Variables (Q3586474) (← links)
- Linear Kernel for Planar Connected Dominating Set (Q3630213) (← links)
- Improved bounds for minimal feedback vertex sets in tournaments (Q4581278) (← links)
- Polynomial Kernels for Deletion to Classes of Acyclic Digraphs (Q4601907) (← links)
- New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness (Q4606313) (← links)
- A 7/3-Approximation for Feedback Vertex Sets in Tournaments (Q4606339) (← links)
- Improved Bounds for Minimal Feedback Vertex Sets in Tournaments (Q4634408) (← links)
- Linear Kernels and Linear-Time Algorithms for Finding Large Cuts (Q4636514) (← links)
- Voting and bribing in single-exponential time (Q4636646) (← links)
- Induced Matchings in Subcubic Planar Graphs (Q4899067) (← links)
- Feedback Vertex Sets in Tournaments (Q4908824) (← links)
- Time- and Space-optimal Algorithm for the Many-visits TSP (Q4987455) (← links)
- (Q4989405) (← links)
