| Publication | Date of Publication | Type |
|---|
Flow-augmentation. I: Directed graphs
Journal of the ACM | 2026-02-24 | Paper |
On polynomial kernelization for stable cutset
Discrete Applied Mathematics | 2026-02-24 | Paper |
| A tight Monte-Carlo algorithm for Steiner tree parameterized by clique-width | 2026-01-14 | Paper |
Approximate Turing kernelization for problems parameterized by treewidth
Journal of Computer and System Sciences | 2025-12-11 | Paper |
| Approximate Turing kernelization and lower bounds for domination problems | 2025-09-24 | Paper |
Flow-augmentation. III: Complexity dichotomy for Boolean CSPS parameterized by the number of unsatisfied constraints
SIAM Journal on Computing | 2025-09-16 | Paper |
| Towards exact structural thresholds for parameterized complexity | 2025-06-23 | Paper |
| Representative sets and irrelevant vertices: new tools for kernelization | 2025-05-05 | Paper |
| On polynomial kernelization for stable cutset | 2025-05-02 | Paper |
Flow-augmentation. II: Undirected graphs
ACM Transactions on Algorithms | 2025-02-21 | Paper |
| 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 |
scientific article; zbMATH DE number 7788441 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
Efficient parameterized algorithms for computing all-pairs shortest paths
Discrete Applied Mathematics | 2023-11-13 | Paper |
Efficient parameterized algorithms for computing all-pairs shortest paths
(available as arXiv preprint) | 2023-02-07 | Paper |
scientific article; zbMATH DE number 7650914 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-07 | Paper |
Elimination distances, blocking sets, and kernels for Vertex Cover
(available as arXiv preprint) | 2023-02-07 | Paper |
Approximate Turing Kernelization for Problems Parameterized by Treewidth
(available as arXiv preprint) | 2023-02-07 | Paper |
Elimination Distances, Blocking Sets, and Kernels for Vertex Cover
SIAM Journal on Discrete Mathematics | 2022-08-31 | Paper |
On adaptive algorithms for maximum matching
(available as arXiv preprint) | 2022-07-21 | Paper |
On kernelization for edge dominating set under structural parameters
(available as arXiv preprint) | 2022-07-18 | Paper |
Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack
(available as arXiv preprint) | 2022-05-11 | Paper |
| Multi-budgeted directed cuts | 2021-08-04 | Paper |
Efficient and Adaptive Parameterized Algorithms on Modular Decompositions
(available as arXiv preprint) | 2021-08-04 | Paper |
Revenue maximization in Stackelberg pricing games: beyond the combinatorial setting
Mathematical Programming. Series A. Series B | 2021-04-23 | Paper |
Representative sets and irrelevant vertices: new tools for kernelization
Journal of the ACM | 2020-11-11 | Paper |
Multi-budgeted directed cuts
Algorithmica | 2020-08-12 | Paper |
Smaller parameters for vertex cover kernelization
(available as arXiv preprint) | 2020-05-27 | Paper |
| Revenue maximization in Stackelberg pricing games: beyond the combinatorial setting | 2020-05-27 | Paper |
Bipartite graphs of small readability
Theoretical Computer Science | 2020-01-16 | Paper |
The parameterized complexity of finding a 2-sphere in a simplicial complex
SIAM Journal on Discrete Mathematics | 2019-10-30 | Paper |
The parameterized complexity of the minimum shared edges problem
Journal of Computer and System Sciences | 2019-08-30 | Paper |
| Recent developments in kernelization: a survey | 2019-07-03 | Paper |
Point line cover: the easy kernel is essentially tight
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Co-nondeterminism in compositions: a kernelization lower bound for a Ramsey-type problem
(available as arXiv preprint) | 2019-05-10 | Paper |
| Co-nondeterminism in compositions: a kernelization lower bound for a Ramsey-type problem | 2019-05-10 | Paper |
| Compression via matroids: a randomized polynomial kernel for odd cycle transversal | 2019-05-10 | Paper |
The minimum feasible tileset problem
Algorithmica | 2019-03-11 | Paper |
Fast Hamiltonicity checking via bases of perfect matchings
Journal of the ACM | 2018-12-06 | Paper |
Point line cover: the easy kernel is essentially tight
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Compression via Matroids
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Co-Nondeterminism in Compositions
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Bipartite graphs of small readability
Lecture Notes in Computer Science | 2018-10-04 | Paper |
Two edge modification problems without polynomial kernels
Discrete Optimization | 2018-08-17 | Paper |
A randomized polynomial kernelization for vertex cover with a smaller parameter
SIAM Journal on Discrete Mathematics | 2018-07-27 | Paper |
Robust and adaptive search
(available as arXiv preprint) | 2018-04-19 | Paper |
The parameterized complexity of finding a 2-sphere in a simplicial complex
(available as arXiv preprint) | 2018-04-19 | Paper |
| Preprocessing under uncertainty: matroid intersection | 2018-03-21 | Paper |
Parameterized complexity of team formation in social networks
Theoretical Computer Science | 2018-03-13 | Paper |
A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter
(available as arXiv preprint) | 2018-03-02 | Paper |
A randomized polynomial kernel for subset feedback vertex set
Theory of Computing Systems | 2018-03-01 | Paper |
A randomized polynomial kernel for subset feedback vertex set
Theory of Computing Systems | 2018-03-01 | Paper |
| A randomized polynomial kernel for subset feedback vertex set | 2018-01-24 | Paper |
Preprocessing under uncertainty
(available as arXiv preprint) | 2018-01-24 | Paper |
On kernelization and approximation for the vector connectivity problem
Algorithmica | 2017-10-10 | Paper |
On kernelization and approximation for the vector connectivity problem
Algorithmica | 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
Lecture Notes in Computer Science | 2017-07-21 | Paper |
Assessing the computational complexity of multi-layer subgraph detection
Lecture Notes in Computer Science | 2017-07-21 | Paper |
The parameterized complexity of the minimum shared edges problem
(available as arXiv preprint) | 2017-07-13 | Paper |
On the complexity of the identifiable subgraph problem, revisited
Discrete Applied Mathematics | 2017-06-14 | Paper |
| Tight bounds for parameterized complexity of Cluster Editing | 2017-01-30 | Paper |
On polynomial kernels for sparse integer linear programs
(available as arXiv preprint) | 2017-01-30 | Paper |
Characterizing width two for variants of treewidth
Discrete Applied Mathematics | 2016-11-24 | Paper |
Graph isomorphism for graph classes characterized by two forbidden induced subgraphs
Discrete Applied Mathematics | 2016-11-24 | Paper |
Polynomial kernels for weighted problems
Journal of Computer and System Sciences | 2016-11-14 | Paper |
Parameterized complexity of team formation in social networks
Algorithmic Aspects in Information and Management | 2016-11-09 | Paper |
Kernel lower bounds using co-nondeterminism: finding induced hereditary subgraphs
ACM Transactions on Computation Theory | 2016-10-24 | Paper |
Parameterized complexity and kernelizability of max ones and exact ones problems
ACM Transactions on Computation Theory | 2016-10-24 | Paper |
Finding shortest paths between graph colourings
Algorithmica | 2016-09-07 | Paper |
Polynomial kernels and user reductions for the workflow satisfiability problem
Algorithmica | 2016-09-07 | Paper |
On polynomial kernels for sparse integer linear programs
Journal of Computer and System Sciences | 2016-04-18 | Paper |
Fixed-parameter tractability of multicut in directed acyclic graphs
SIAM Journal on Discrete Mathematics | 2015-11-27 | Paper |
The minimum feasible tileset problem
Lecture Notes in Computer Science | 2015-11-20 | Paper |
A structural approach to kernels for ILPs: treewidth and total unimodularity
Algorithms - ESA 2015 | 2015-11-19 | Paper |
A shortcut to (sun)flowers: kernels in logarithmic space or linear time
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
Polynomial kernels for weighted problems
Lecture Notes in Computer Science | 2015-09-16 | Paper |
On kernels for covering and packing ILPs with small coefficients
Parameterized and Exact Computation | 2015-09-15 | Paper |
Finding shortest paths between graph colourings
Parameterized and Exact Computation | 2015-09-15 | Paper |
Finding shortest paths between graph colourings
Parameterized and Exact Computation | 2015-09-15 | Paper |
Polynomial kernels and user reductions for the workflow satisfiability problem
Parameterized and Exact Computation | 2015-09-15 | Paper |
Clique Cover and Graph Separation
ACM Transactions on Computation Theory | 2015-09-03 | Paper |
Approximability and parameterized complexity of multicover by \(c\)-intervals
Information Processing Letters | 2015-06-15 | Paper |
Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
Information and Computation | 2015-06-09 | Paper |
A completeness theory for polynomial (Turing) kernelization
Algorithmica | 2015-05-04 | Paper |
Streaming kernelization
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Fast Hamiltonicity checking via bases of perfect matchings
Proceedings of the forty-fifth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
A Multivariate Complexity Analysis of Lobbying in Multiple Referenda
Journal of Artificial Intelligence Research | 2014-07-30 | Paper |
Kernelization Lower Bounds by Cross-Composition
SIAM Journal on Discrete Mathematics | 2014-06-19 | Paper |
Tight bounds for parameterized complexity of cluster editing with a small number of clusters
Journal of Computer and System Sciences | 2014-06-10 | Paper |
Preprocessing for treewidth: a combinatorial analysis through kernelization
SIAM Journal on Discrete Mathematics | 2014-04-10 | Paper |
Data reduction for graph coloring problems
Information and Computation | 2014-01-16 | Paper |
Kernel bounds for path and cycle problems
Theoretical Computer Science | 2014-01-13 | Paper |
Parameterized complexity of vertex deletion into perfect graph classes
Theoretical Computer Science | 2014-01-13 | Paper |
How to Put through Your Agenda in Collective Binary Decisions
Algorithmic Decision Theory | 2013-12-17 | Paper |
A completeness theory for polynomial (Turing) kernelization
Parameterized and Exact Computation | 2013-12-10 | Paper |
The jump number problem: exact and parameterized
Parameterized and Exact Computation | 2013-12-10 | Paper |
Fixed-parameter tractability and characterizations of small special treewidth
Graph-Theoretic Concepts in Computer Science | 2013-12-06 | Paper |
On Polynomial Kernels for Integer Linear Programs: Covering, Packing and Feasibility
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Clique cover and graph separation: new incompressibility results
Automata, Languages, and Programming | 2013-08-12 | Paper |
Fixed-parameter tractability of multicut in directed acyclic graphs
Lecture Notes in Computer Science | 2013-08-12 | Paper |
Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
Automata, Languages, and Programming | 2013-08-06 | Paper |
Fixed-parameter evolutionary algorithms and the vertex cover problem
Algorithmica | 2013-05-16 | Paper |
Parameterized two-player Nash equilibrium
Algorithmica | 2013-05-16 | Paper |
Bin packing with fixed number of bins revisited
Journal of Computer and System Sciences | 2013-02-21 | Paper |
Graph isomorphism for graph classes characterized by two forbidden induced subgraphs
Graph-Theoretic Concepts in Computer Science | 2012-11-06 | Paper |
Kernel bounds for structural parameterizations of pathwidth
Algorithm Theory – SWAT 2012 | 2012-08-14 | Paper |
Kernel lower bounds using co-nondeterminism: finding induced hereditary subgraphs
Algorithm Theory – SWAT 2012 | 2012-08-14 | Paper |
Kernel bounds for path and cycle problems
Parameterized and Exact Computation | 2012-06-15 | Paper |
On polynomial kernels for structural parameterizations of odd cycle transversal
Parameterized and Exact Computation | 2012-06-15 | Paper |
Safe approximation and its relation to kernelization
Parameterized and Exact Computation | 2012-06-15 | Paper |
Polynomial kernelizations for MIN \(F^{+}\Pi _{1}\) and MAX NP
Algorithmica | 2012-04-26 | Paper |
| Polynomial kernelizations for \(\text{MIN} \text{F}^+ \Pi_1\) and \(\text{MAX NP}\) | 2012-04-24 | Paper |
| Cross-composition: a new technique for kernelization lower bounds | 2012-01-23 | Paper |
Cross-composition: a new technique for kernelization lower bounds
(available as arXiv preprint) | 2012-01-23 | Paper |
Parameterized two-player Nash equilibrium
Lecture Notes in Computer Science | 2011-12-16 | Paper |
Data reduction for graph coloring problems
Fundamentals of Computation Theory | 2011-08-19 | Paper |
Parameterized complexity of vertex deletion into perfect graph classes
Fundamentals of Computation Theory | 2011-08-19 | Paper |
Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization
Automata, Languages and Programming | 2011-07-06 | Paper |
Preprocessing of min ones problems: a dichotomy
Automata, Languages and Programming | 2010-09-07 | Paper |
Parameterized complexity and kernelizability of Max Ones and Exact Ones problems
Mathematical Foundations of Computer Science 2010 | 2010-09-03 | Paper |
Isomorphism for graphs of bounded feedback vertex set number
Lecture Notes in Computer Science | 2010-06-22 | Paper |
Bin packing with fixed number of bins revisited
Lecture Notes in Computer Science | 2010-06-22 | Paper |
Two edge modification problems without polynomial kernels
Parameterized and Exact Computation | 2010-01-14 | Paper |
