| Publication | Date of Publication | Type |
|---|
| Tight algorithms for connectivity problems parameterized by clique-width | 2025-01-06 | Paper |
| Tight algorithmic applications of clique-width generalizations | 2024-12-03 | Paper |
| Tight bounds for connectivity problems parameterized by cutwidth | 2024-10-08 | Paper |
| Flow-augmentation. III: Complexity dichotomy for Boolean CSPs parameterized by the number of unsatisfied constraints | 2024-05-14 | Paper |
| Tight Algorithms for Connectivity Problems Parameterized by Modular-Treewidth | 2024-05-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147358 | 2024-01-15 | Paper |
| Efficient parameterized algorithms for computing all-pairs shortest paths | 2023-11-13 | Paper |
| Approximate Turing Kernelization for Problems Parameterized by Treewidth | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874311 | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874302 | 2023-02-07 | Paper |
| Elimination distances, blocking sets, and kernels for Vertex Cover | 2023-02-07 | Paper |
| Elimination Distances, Blocking Sets, and Kernels for Vertex Cover | 2022-08-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091230 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090486 | 2022-07-18 | Paper |
| Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack | 2022-05-11 | Paper |
| Multi-Budgeted Directed Cuts | 2021-08-04 | Paper |
| Efficient and Adaptive Parameterized Algorithms on Modular Decompositions | 2021-08-04 | Paper |
| Revenue maximization in Stackelberg pricing games: beyond the combinatorial setting | 2021-04-23 | Paper |
| Representative Sets and Irrelevant Vertices | 2020-11-11 | Paper |
| Multi-budgeted directed cuts | 2020-08-12 | Paper |
| Smaller Parameters for Vertex Cover Kernelization | 2020-05-27 | Paper |
| Revenue Maximization in Stackelberg Pricing Games: Beyond the Combinatorial Setting. | 2020-05-27 | Paper |
| Bipartite graphs of small readability | 2020-01-16 | Paper |
| The Parameterized Complexity of Finding a 2-Sphere in a Simplicial Complex | 2019-10-30 | Paper |
| The parameterized complexity of the minimum shared edges problem | 2019-08-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4967164 | 2019-07-03 | Paper |
| Point Line Cover: The Easy Kernel is Essentially Tight | 2019-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743382 | 2019-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743380 | 2019-05-10 | Paper |
| The minimum feasible tileset problem | 2019-03-11 | Paper |
| Fast Hamiltonicity Checking Via Bases of Perfect Matchings | 2018-12-06 | Paper |
| Point Line Cover | 2018-11-05 | Paper |
| Compression via Matroids | 2018-10-30 | Paper |
| Co-Nondeterminism in Compositions | 2018-10-30 | Paper |
| Bipartite graphs of small readability | 2018-10-04 | Paper |
| Two edge modification problems without polynomial kernels | 2018-08-17 | Paper |
| A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter | 2018-07-27 | Paper |
| Robust and Adaptive Search | 2018-04-19 | Paper |
| The parameterized complexity of finding a 2-sphere in a simplicial complex | 2018-04-19 | Paper |
| Preprocessing Under Uncertainty: Matroid Intersection. | 2018-03-21 | Paper |
| Parameterized complexity of team formation in social networks | 2018-03-13 | Paper |
| A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter | 2018-03-02 | Paper |
| A randomized polynomial kernel for subset feedback vertex set | 2018-03-01 | Paper |
| Preprocessing under uncertainty | 2018-01-24 | Paper |
| A Randomized Polynomial Kernel for Subset Feedback Vertex Set | 2018-01-24 | Paper |
| On kernelization and approximation for the vector connectivity problem | 2017-10-10 | Paper |
| On Kernelization and Approximation for the Vector Connectivity Problem | 2017-09-29 | Paper |
| Assessing the Computational Complexity of Multi-layer Subgraph Detection | 2017-07-21 | Paper |
| The Parameterized Complexity of the Minimum Shared Edges Problem | 2017-07-13 | Paper |
| On the complexity of the identifiable subgraph problem, revisited | 2017-06-14 | Paper |
| Tight bounds for parameterized complexity of Cluster Editing | 2017-01-30 | Paper |
| On Polynomial Kernels for Sparse Integer Linear Programs. | 2017-01-30 | Paper |
| Characterizing width two for variants of treewidth | 2016-11-24 | Paper |
| Graph isomorphism for graph classes characterized by two forbidden induced subgraphs | 2016-11-24 | Paper |
| Polynomial kernels for weighted problems | 2016-11-14 | Paper |
| Parameterized Complexity of Team Formation in Social Networks | 2016-11-09 | Paper |
| Kernel lower bounds using co-nondeterminism: finding induced hereditary subgraphs | 2016-10-24 | Paper |
| Parameterized complexity and kernelizability of max ones and exact ones problems | 2016-10-24 | Paper |
| Finding shortest paths between graph colourings | 2016-09-07 | Paper |
| Polynomial kernels and user reductions for the workflow satisfiability problem | 2016-09-07 | Paper |
| On polynomial kernels for sparse integer linear programs | 2016-04-18 | Paper |
| Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs | 2015-11-27 | Paper |
| The minimum feasible tileset problem | 2015-11-20 | Paper |
| A Structural Approach to Kernels for ILPs: Treewidth and Total Unimodularity | 2015-11-19 | Paper |
| Polynomial kernels for weighted problems | 2015-09-16 | Paper |
| A Shortcut to (Sun)Flowers: Kernels in Logarithmic Space or Linear Time | 2015-09-16 | Paper |
| On Kernels for Covering and Packing ILPs with Small Coefficients | 2015-09-15 | Paper |
| Finding Shortest Paths Between Graph Colourings | 2015-09-15 | Paper |
| Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem | 2015-09-15 | Paper |
| Clique Cover and Graph Separation | 2015-09-03 | Paper |
| Approximability and parameterized complexity of multicover by \(c\)-intervals | 2015-06-15 | Paper |
| Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth | 2015-06-09 | Paper |
| A completeness theory for polynomial (Turing) kernelization | 2015-05-04 | Paper |
| Streaming Kernelization | 2014-10-14 | Paper |
| Fast Hamiltonicity Checking Via Bases of Perfect Matchings | 2014-08-07 | Paper |
| A Multivariate Complexity Analysis of Lobbying in Multiple Referenda | 2014-07-30 | Paper |
| Kernelization Lower Bounds by Cross-Composition | 2014-06-19 | Paper |
| Tight bounds for parameterized complexity of cluster editing with a small number of clusters | 2014-06-10 | 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 |
| How to Put through Your Agenda in Collective Binary Decisions | 2013-12-17 | Paper |
| A Completeness Theory for Polynomial (Turing) Kernelization | 2013-12-10 | Paper |
| The Jump Number Problem: Exact and Parameterized | 2013-12-10 | Paper |
| Fixed-Parameter Tractability and Characterizations of Small Special Treewidth | 2013-12-06 | Paper |
| On Polynomial Kernels for Integer Linear Programs: Covering, Packing and Feasibility | 2013-09-17 | Paper |
| Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs | 2013-08-12 | Paper |
| Clique Cover and Graph Separation: New Incompressibility Results | 2013-08-12 | Paper |
| Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth | 2013-08-06 | Paper |
| Parameterized two-player Nash equilibrium | 2013-05-16 | Paper |
| Fixed-parameter evolutionary algorithms and the vertex cover problem | 2013-05-16 | Paper |
| Bin packing with fixed number of bins revisited | 2013-02-21 | Paper |
| Graph Isomorphism for Graph Classes Characterized by Two Forbidden Induced Subgraphs | 2012-11-06 | Paper |
| Kernel Bounds for Structural Parameterizations of Pathwidth | 2012-08-14 | Paper |
| Kernel Lower Bounds Using Co-nondeterminism: Finding Induced Hereditary Subgraphs | 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 |
| Safe Approximation and Its Relation to Kernelization | 2012-06-15 | Paper |
| Polynomial kernelizations for MIN \(F^{+}\Pi _{1}\) and MAX NP | 2012-04-26 | Paper |
| Polynomial Kernelizations For MIN F+Pi1 And MAX NP | 2012-04-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3113681 | 2012-01-23 | Paper |
| Parameterized two-player Nash equilibrium | 2011-12-16 | 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 |
| Preprocessing of Min Ones Problems: A Dichotomy | 2010-09-07 | Paper |
| Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems | 2010-09-03 | Paper |
| Isomorphism for Graphs of Bounded Feedback Vertex Set Number | 2010-06-22 | Paper |
| Bin Packing with Fixed Number of Bins Revisited | 2010-06-22 | Paper |
| Two Edge Modification Problems without Polynomial Kernels | 2010-01-14 | Paper |
