| Fine-grained Complexity Analysis of Two Classic TSP Variants | 0 | 0.34 | 2021 |
| Special Issue Dedicated To The 14th International Symposium On Parameterized And Exact Computation | 0 | 0.34 | 2021 |
| A DETERMINISTIC POLYNOMIAL KERNEL FOR ODD CYCLE TRANSVERSAL AND VERTEX MULTIWAY CUT IN PLANAR GRAPHS | 0 | 0.34 | 2021 |
| A Turing kernelization dichotomy for structural parameterizations of F-Minor-Free Deletion | 0 | 0.34 | 2021 |
| Vertex deletion parameterized by elimination distance and even less | 1 | 0.36 | 2021 |
| Sparsification Lower Bounds for List H-Coloring. | 0 | 0.34 | 2020 |
| Polynomial kernels for hitting forbidden minors under structural parameterizations. | 0 | 0.34 | 2020 |
| Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP. | 0 | 0.34 | 2019 |
| A Turing Kernelization Dichotomy For Structural Parameterizations Of F-Minor-Free Deletion | 0 | 0.34 | 2019 |
| Hamiltonicity Below Dirac'S Condition | 0 | 0.34 | 2019 |
| Lower Bounds for Dynamic Programming on Planar Graphs of Bounded Cutwidth. | 0 | 0.34 | 2018 |
| Computing the Chromatic Number Using Graph Decompositions via Matrix Rank. | 0 | 0.34 | 2018 |
| Best-Case and Worst-Case Sparsifiability of Boolean CSPs | 0 | 0.34 | 2018 |
| Independent-set reconfiguration thresholds of hereditary graph classes. | 0 | 0.34 | 2018 |
| Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations. | 0 | 0.34 | 2018 |
| Turing Kernelization for Finding Long Paths in Graphs Excluding a Topological Minor. | 0 | 0.34 | 2017 |
| Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems. | 3 | 0.49 | 2017 |
| Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials. | 0 | 0.34 | 2017 |
| Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor. | 0 | 0.34 | 2017 |
| The First Parameterized Algorithms and Computational Experiments Challenge. | 0 | 0.34 | 2016 |
| Approximation and kernelization for chordal vertex deletion | 1 | 0.35 | 2016 |
| Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials | 0 | 0.34 | 2016 |
| Independent Set Reconfiguration Thresholds of Hereditary Graph Classes. | 0 | 0.34 | 2016 |
| Constrained Bipartite Vertex Cover: The Easy Kernel is Essentially Tight. | 0 | 0.34 | 2016 |
| Lower Bounds for Protrusion Replacement by Counting Equivalence Classes. | 0 | 0.34 | 2016 |
| Sparsification Upper and Lower Bounds for Graph Problems and Not-All-Equal SAT | 3 | 0.39 | 2015 |
| Uniform Kernelization Complexity of Hitting Forbidden Minors. | 4 | 0.46 | 2015 |
| A structural approach to kernels for ILPs: Treewidth and Total Unimodularity | 4 | 0.43 | 2015 |
| On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT | 0 | 0.34 | 2015 |
| Preprocessing subgraph and minor problems: When does a small vertex cover help? | 10 | 0.51 | 2014 |
| Turing Kernelization for Finding Long Paths and Cycles in Restricted Graph Classes. | 6 | 0.43 | 2014 |
| KERNELIZATION LOWER BOUNDS BY CROSS-COMPOSITION | 27 | 0.86 | 2014 |
| A near-optimal planarization algorithm | 13 | 0.55 | 2014 |
| Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity | 23 | 0.72 | 2013 |
| Fpt Is Characterized By Useful Obstruction Sets | 1 | 0.35 | 2013 |
| On Sparsification for Computing Treewidth. | 5 | 0.40 | 2013 |
| Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter | 24 | 0.95 | 2013 |
| Kernel bounds for structural parameterizations of pathwidth | 7 | 0.43 | 2012 |
| Cross-Composition: A New Technique for Kernelization Lower Bounds | 54 | 1.72 | 2011 |
| Preprocessing for treewidth: a combinatorial analysis through kernelization | 19 | 0.80 | 2011 |
| On polynomial kernels for structural parameterizations of odd cycle transversal | 11 | 0.58 | 2011 |
| Connect The Dot: Computing Feed-Links For Network Extension | 4 | 0.47 | 2011 |
| Kernel bounds for path and cycle problems | 7 | 0.44 | 2011 |
| Kernelization for maximum leaf spanning tree with positive vertex weights | 2 | 0.41 | 2010 |
| Determining the Winner of a Dodgson Election is Hard | 2 | 0.64 | 2010 |
| Feed-links for network extensions | 1 | 0.36 | 2008 |
