| Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time | 0 | 0.34 | 2022 |
| Randomized Contractions Meet Lean Decompositions | 0 | 0.34 | 2021 |
| Lower Bounds for the Parameterized Complexity of Minimum Fill-in and Other Completion Problems | 0 | 0.34 | 2020 |
| From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More | 0 | 0.34 | 2020 |
| Minimum Bisection Is Fixed-Parameter Tractable | 1 | 0.36 | 2019 |
| Randomized contractions meet lean decompositions. | 0 | 0.34 | 2018 |
| Improved GQ-CNN: Deep Learning Model for Planning Robust Grasps. | 0 | 0.34 | 2018 |
| On subexponential running times for approximating directed Steiner tree and related problems. | 0 | 0.34 | 2018 |
| Online Facility Location with Deletions. | 0 | 0.34 | 2018 |
| From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More | 4 | 0.38 | 2017 |
| Tight Lower Bounds on Graph Embedding Problems. | 1 | 0.37 | 2017 |
| On problems equivalent to (min, +)-convolution. | 10 | 0.70 | 2017 |
| Randomization in Parameterized Complexity (Dagstuhl Seminar 17041). | 0 | 0.34 | 2017 |
| Approximation and parameterized complexity of minimax approval voting | 1 | 0.35 | 2017 |
| Foreword: Special Issue on IPEC 2014. | 0 | 0.34 | 2016 |
| Tight Bounds for Graph Homomorphism and Subgraph Isomorphism. | 3 | 0.41 | 2016 |
| Algorithmic Complexity of Power Law Networks. | 9 | 0.57 | 2016 |
| Erratum to: Foreword: Special Issue on IPEC 2014. | 0 | 0.34 | 2016 |
| Online Pricing with Impatient Bidders. | 1 | 0.36 | 2016 |
| Approximating Upper Degree-Constrained Partial Orientations. | 0 | 0.34 | 2015 |
| Polynomial kernelization for removing induced claws and diamonds. | 1 | 0.36 | 2015 |
| Kernelization lower bound for Permutation Pattern Matching | 0 | 0.34 | 2015 |
| Lower bounds for approximation schemes for Closest String | 1 | 0.35 | 2015 |
| The Hardness of Subgraph Isomorphism. | 2 | 0.41 | 2015 |
| Clique Cover and Graph Separation: New Incompressibility Results | 21 | 0.76 | 2014 |
| A Fast Branching Algorithm for Cluster Vertex Deletion. | 14 | 0.66 | 2014 |
| Parameterized complexity of firefighting. | 3 | 0.41 | 2014 |
| Parameterized Complexity of Eulerian Deletion Problems. | 6 | 0.53 | 2014 |
| Hitting Forbidden Subgraphs in Graphs of Bounded Treewidth. | 0 | 0.34 | 2014 |
| On the Hardness of Losing Width | 4 | 0.43 | 2014 |
| Solving the 2-Disjoint Connected Subgraphs Problem Faster than 2n | 3 | 0.40 | 2014 |
| On cutwidth parameterized by vertex cover | 4 | 0.41 | 2014 |
| Faster exponential-time algorithms in graphs of bounded average degree | 3 | 0.41 | 2013 |
| Improved Approximation for 3-Dimensional Matching via Bounded Pathwidth Local Search | 17 | 0.73 | 2013 |
| Catch them if you can: how to serve impatient users | 1 | 0.38 | 2013 |
| Known algorithms for edge clique cover are probably optimal | 12 | 0.63 | 2013 |
| Tight Kernel Bounds for Problems on Graphs with Small Degeneracy | 3 | 0.37 | 2013 |
| A bound on the number of perfect matchings in Klee-graphs. | 1 | 0.38 | 2013 |
| Split Vertex Deletion meets Vertex Cover: New fixed-parameter and exact exponential-time algorithms | 7 | 0.52 | 2013 |
| Tight Kernel Bounds for Problems on Graphs with Small Degeneracy - (Extended Abstract). | 0 | 0.34 | 2013 |
| On Pairwise Spanners | 4 | 0.44 | 2013 |
| The Planar Directed K-Vertex-Disjoint Paths Problem Is Fixed-Parameter Tractable | 12 | 0.59 | 2013 |
| Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth | 34 | 1.12 | 2013 |
| On multiway cut parameterized above lower bounds | 34 | 1.13 | 2013 |
| How to sell hyperedges: the hypermatching assignment problem | 11 | 0.64 | 2013 |
| A Planar Linear Arboricity Conjecture | 2 | 0.39 | 2012 |
| A Polynomial Algorithm for 3-Compatible Coloring and the Stubborn List Partition Problem (The Stubborn Problem Is Stubborn No More). | 1 | 0.37 | 2012 |
| Directed subset feedback vertex set is fixed-parameter tractable | 12 | 0.61 | 2012 |
| LP Rounding for k-Centers with Non-uniform Hard Capacities | 13 | 0.59 | 2012 |
| Deterministic parameterized connected vertex cover | 15 | 0.73 | 2012 |
