Hitting Long Directed Cycles is Fixed-Parameter Tractable | 0 | 0.34 | 2020 |
Dynamic Parameterized Problems and Algorithms | 1 | 0.36 | 2020 |
Combinatorial n-fold integer programming and applications. | 0 | 0.34 | 2020 |
Odd Multiway Cut in Directed Acyclic Graphs. | 0 | 0.34 | 2020 |
Parameterized Algorithms for Generalizations of Directed Feedback Vertex Set. | 0 | 0.34 | 2019 |
Resolving Infeasibility of Linear Systems - A Parameterized Approach. | 0 | 0.34 | 2019 |
Engineering Kernelization for Maximum Cut. | 0 | 0.34 | 2019 |
Linear-Time Recognition of Map Graphs with Outerplanar Witness. | 4 | 0.46 | 2018 |
Parameterized complexity of machine scheduling: 15 open problems. | 8 | 0.50 | 2018 |
A time- and space-optimal algorithm for the many-visits TSP | 0 | 0.34 | 2018 |
Voting and Bribing in Single-Exponential Time | 3 | 0.38 | 2018 |
Reachability Switching Games | 0 | 0.34 | 2018 |
Improved Bounds for Minimal Feedback Vertex Sets in Tournaments. | 0 | 0.34 | 2018 |
Linear Kernels and Linear-Time Algorithms for Finding Large Cuts. | 4 | 0.48 | 2018 |
Improved integrality gap upper bounds for traveling salesperson problems with distances one and two. | 0 | 0.34 | 2018 |
Big data algorithms beyond machine learning. | 0 | 0.34 | 2018 |
New Approximation Algorithms for (1, 2)-TSP. | 0 | 0.34 | 2018 |
A Unifying Framework For Manipulation Problems | 1 | 0.35 | 2018 |
Polynomial Kernels for Deletion to Classes of Acyclic Digraphs. | 4 | 0.53 | 2017 |
Combinatorial n-fold Integer Programming and Applications. | 10 | 0.58 | 2017 |
Stable Matchings with Covering Constraints: A Complete Computational Trichotomy | 4 | 0.42 | 2017 |
New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness. | 1 | 0.36 | 2016 |
Large Independent Sets in Subquartic Planar Graphs. | 1 | 0.40 | 2016 |
Lower Bounds for Locally Highly Connected Graphs. | 0 | 0.34 | 2016 |
New Deterministic Algorithms for Solving Parity Games | 0 | 0.34 | 2015 |
A 7/3-Approximation for Feedback Vertex Sets in Tournaments | 0 | 0.34 | 2015 |
On Routing Disjoint Paths in Bounded Treewidth Graphs | 2 | 0.40 | 2015 |
Polynomial Kernels for Weighted Problems | 1 | 0.36 | 2015 |
Scheduling and fixed-parameter tractability | 17 | 0.67 | 2014 |
Parameterized Complexity of Induced Graph Matching on Claw-Free Graphs | 5 | 0.50 | 2014 |
Parameterized Complexity Dichotomy for Steiner Multicut. | 1 | 0.37 | 2014 |
Improved integrality gap upper bounds for TSP with distances one and two. | 1 | 0.36 | 2013 |
Large Independent Sets in Triangle-Free Planar Graphs. | 3 | 0.47 | 2013 |
Feedback Vertex Sets in Tournaments | 11 | 0.67 | 2013 |
Kernel and fast algorithm for dense triplet inconsistency | 6 | 0.48 | 2013 |
Scheduling Meets Fixed-Parameter Tractability. | 2 | 0.37 | 2013 |
Interval scheduling and colorful independent sets. | 13 | 0.58 | 2012 |
Beyond Max-Cut: λ-extendible properties parameterized above the Poljak-Turzík bound. | 0 | 0.34 | 2012 |
Induced Matchings in Subcubic Planar Graphs | 10 | 0.66 | 2012 |
Max-cut parameterized above the edwards-erdős bound | 7 | 0.53 | 2012 |
Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables | 7 | 0.51 | 2012 |
Parameterized complexity of induced h-matching on claw-free graphs | 3 | 0.39 | 2012 |
Beyond Max-Cut: lambda-Extendible Properties Parameterized Above the Poljak-Turzik Bound. | 6 | 0.63 | 2012 |
Bisections above tight lower bounds | 8 | 0.53 | 2012 |
Planar k-path in subexponential time and polynomial space | 3 | 0.40 | 2011 |
Domination when the stars are out | 11 | 0.54 | 2011 |
A linear kernel for a planar connected dominating set | 17 | 0.76 | 2011 |
All Ternary Permutation Constraint Satisfaction Problems Parameterized Above Average Have Polynomial Kernels | 3 | 0.40 | 2010 |
All ternary permutation constraint satisfaction problems parameterized above average have kernels with quadratic numbers of variables | 16 | 0.94 | 2010 |
Betweenness parameterized above tight lower bound | 16 | 0.77 | 2010 |