| Publication | Date of Publication | Type |
|---|
| Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion | 2025-01-23 | Paper |
| 5-approximation for \(\mathcal{H}\)-treewidth essentially as fast as \(\mathcal{H}\)-deletion parameterized by solution size | 2025-01-06 | Paper |
| Single-exponential FPT algorithms for enumerating secluded \(\mathcal{F}\)-free subgraphs and deleting to scattered graph classes | 2024-12-27 | Paper |
| Upward and orthogonal planarity are W[1]-hard parameterized by treewidth | 2024-10-14 | Paper |
| Search-space reduction via essential vertices | 2024-09-17 | Paper |
| Preprocessing to reduce the search space: antler structures for feedback vertex set | 2024-07-01 | Paper |
| Kernelization for feedback vertex set via elimination distance to a forest | 2024-02-14 | Paper |
| Preprocessing for outerplanar vertex deletion: an elementary kernel of quartic size | 2024-02-12 | Paper |
| Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion | 2023-12-08 | Paper |
| Vertex deletion parameterized by elimination distance and even less | 2023-11-14 | Paper |
| Sparsification lower bounds for list \(H\)-coloring | 2023-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6059193 | 2023-11-02 | Paper |
| Finding \(k\)-secluded trees faster | 2023-08-21 | Paper |
| On the Hardness of Compressing Weights | 2023-08-08 | Paper |
| Finding \(k\)-secluded trees faster | 2023-05-05 | Paper |
| Kernelization for feedback vertex set via elimination distance to a forest | 2023-05-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874535 | 2023-02-07 | Paper |
| Fine-grained parameterized complexity analysis of graph coloring problems | 2023-01-11 | Paper |
| \(p\)-edge/vertex-connected vertex cover: parameterized and approximation algorithms | 2023-01-06 | Paper |
| Bridge-depth characterizes which minor-closed structural parameterizations of vertex cover admit a polynomial kernel | 2022-11-15 | Paper |
| Preprocessing for outerplanar vertex deletion: an elementary kernel of quartic size | 2022-10-27 | Paper |
| Crossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower Bounds | 2022-10-19 | Paper |
| A deterministic polynomial kernel for odd cycle transversal and vertex multiway cut in planar graphs | 2022-07-18 | Paper |
| FPT algorithms to compute the elimination distance to bipartite graphs and more | 2022-06-08 | Paper |
| Preprocessing to reduce the search space: antler structures for feedback vertex set | 2022-06-08 | Paper |
| Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP | 2022-05-11 | Paper |
| Preprocessing vertex-deletion problems: characterizing graph properties by low-rank adjacencies | 2022-03-29 | Paper |
| Fine-grained Complexity Analysis of Two Classic TSP Variants | 2022-02-08 | Paper |
| A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs | 2021-11-04 | Paper |
| Computing the Chromatic Number Using Graph Decompositions via Matrix Rank | 2021-08-04 | Paper |
| Best-case and worst-case sparsifiability of Boolean CSPs | 2021-08-04 | Paper |
| Lower bounds for dynamic programming on planar graphs of bounded cutwidth | 2021-08-04 | Paper |
| Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations. | 2021-08-04 | Paper |
| A Turing kernelization dichotomy for structural parameterizations of \(\mathcal{F} \)-minor-free deletion | 2021-04-14 | Paper |
| Lower bounds for dynamic programming on planar graphs of bounded cutwidth | 2020-11-05 | Paper |
| Polynomial kernels for hitting forbidden minors under structural parameterizations | 2020-09-17 | Paper |
| The evolutionary language game: an orthogonal approach | 2020-09-03 | Paper |
| Best-case and worst-case sparsifiability of Boolean CSPs | 2020-08-12 | Paper |
| Optimal data reduction for graph coloring using low-degree polynomials | 2020-05-27 | Paper |
| Turing kernelization for finding long paths in graphs excluding a topological minor | 2020-05-27 | Paper |
| Lower bounds for protrusion replacement by counting equivalence classes | 2020-04-21 | Paper |
| Hamiltonicity below Dirac's condition | 2020-02-24 | Paper |
| A Turing kernelization dichotomy for structural parameterizations of \(\mathcal{F}\)-minor-free deletion | 2020-02-24 | Paper |
| Optimal sparsification for some binary CSPs using low-degree polynomials | 2019-12-16 | Paper |
| Computing the chromatic number using graph decompositions via matrix rank | 2019-10-18 | Paper |
| Optimal data reduction for graph coloring using low-degree polynomials | 2019-09-10 | Paper |
| Turing kernelization for finding long paths in graph classes excluding a topological minor | 2019-09-10 | Paper |
| A near-optimal planarization algorithm | 2019-06-20 | Paper |
| Hamiltonicity below Dirac's condition | 2019-02-05 | Paper |
| Uniform kernelization complexity of hitting forbidden minors | 2018-11-05 | Paper |
| Independent-set reconfiguration thresholds of hereditary graph classes | 2018-10-26 | Paper |
| Approximation and kernelization for chordal vertex deletion | 2018-09-12 | Paper |
| Approximation and kernelization for chordal vertex deletion | 2018-07-16 | Paper |
| Independent-set reconfiguration thresholds of hereditary graph classes | 2018-04-19 | Paper |
| Lower bounds for protrusion replacement by counting equivalence classes | 2018-04-10 | Paper |
| Optimal sparsification for some binary CSPs using low-degree polynomials | 2018-03-21 | Paper |
| Constrained bipartite vertex cover: the easy kernel is essentially tight | 2018-01-24 | Paper |
| Fine-grained complexity analysis of two classic TSP variants | 2017-12-19 | Paper |
| A Locally Adaptive System for the Fusion of Objective Quality Measures | 2017-11-20 | Paper |
| Sparsification upper and lower bounds for graph problems and not-all-equal SAT | 2017-10-10 | Paper |
| Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels | 2017-10-05 | Paper |
| Sparsification upper and lower bounds for graphs problems and not-all-equal SAT | 2017-09-29 | Paper |
| Fine-grained parameterized complexity analysis of graph coloring problems | 2017-07-21 | Paper |
| On structural parameterizations of Hitting Set: hitting paths in graphs using 2-SAT | 2017-04-05 | Paper |
| Turing kernelization for finding long paths and cycles in restricted graph classes | 2016-12-28 | Paper |
| FPT is characterized by useful obstruction sets: connecting algorithms, kernels, and quasi-orders | 2016-10-24 | Paper |
| On structural parameterizations of \textsc{Hitting Set}: hitting paths in graphs using 2-SAT | 2016-10-21 | Paper |
| A structural approach to kernels for ILPs: treewidth and total unimodularity | 2015-11-19 | Paper |
| Uniform kernelization complexity of hitting forbidden minors | 2015-10-27 | Paper |
| On sparsification for computing treewidth | 2015-05-04 | Paper |
| Turing kernelization for finding long paths and cycles in restricted graph classes | 2014-10-08 | Paper |
| Kernelization Lower Bounds by Cross-Composition | 2014-06-19 | Paper |
| Preprocessing for treewidth: a combinatorial analysis through kernelization | 2014-04-10 | Paper |
| Data reduction for graph coloring problems | 2014-01-16 | Paper |
| Kernel bounds for path and cycle problems | 2014-01-13 | Paper |
| Parameterized complexity of vertex deletion into perfect graph classes | 2014-01-13 | Paper |
| Preprocessing subgraph and minor problems: when does a small vertex cover help? | 2013-12-13 | Paper |
| On sparsification for computing treewidth | 2013-12-10 | Paper |
| FPT is characterized by useful obstruction sets | 2013-12-06 | Paper |
| Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter | 2013-10-21 | Paper |
| Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity | 2013-01-24 | Paper |
| Preprocessing subgraph and minor problems: When does a small vertex cover help? | 2013-01-07 | Paper |
| Kernelization for maximum leaf spanning tree with positive vertex weights | 2012-12-07 | Paper |
| Determining the winner of a Dodgson election is hard | 2012-08-29 | Paper |
| Kernel bounds for structural parameterizations of pathwidth | 2012-08-14 | Paper |
| Kernel bounds for path and cycle problems | 2012-06-15 | Paper |
| On polynomial kernels for structural parameterizations of odd cycle transversal | 2012-06-15 | Paper |
| Cross-composition: a new technique for kernelization lower bounds | 2012-01-23 | Paper |
| Vertex cover kernelization revisited: upper and lower bounds for a refined parameter | 2012-01-23 | Paper |
| Data reduction for graph coloring problems | 2011-08-19 | Paper |
| Parameterized complexity of vertex deletion into perfect graph classes | 2011-08-19 | Paper |
| Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization | 2011-07-06 | Paper |
| Polynomial kernels for hard problems on disk graphs | 2010-06-22 | Paper |
| Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights | 2010-05-28 | Paper |
| Kernelization Dichotomies for Hitting Subgraphs under Structural Parameterizations | N/A | Paper |
