| Publication | Date of Publication | Type |
|---|
Approximate monotone local search for weighted problems
Algorithmica | 2026-09-21 | Paper |
| Crossing number in slightly superexponential time (extended abstract) | 2026-07-03 | Paper |
| Metric dimension and geodetic set parameterized by vertex cover | 2026-06-24 | Paper |
| MaxMin separation problems: FPT algorithms for st-separator and odd cycle transversal | 2026-06-24 | Paper |
| Uniform polynomial kernel for deletion to \(K_{2,p}\) minor-free graphs | 2026-06-08 | Paper |
The complexity of contracting bipartite graphs into small cycles
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2026-06-04 | Paper |
| Component order connectivity admits no polynomial kernel parameterized by the distance to subdivided comb graphs | 2026-05-29 | Paper |
| Hitting meets packing: how hard can it be? | 2026-05-26 | Paper |
Balanced substructures in bicolored graphs
Theoretical Computer Science | 2026-02-12 | Paper |
| Subexponential parameterized directed Steiner network problems on planar graphs: a complete classification | 2026-01-14 | Paper |
| Problems in NP can admit double-exponential lower bounds when parameterized by treewidth or vertex cover | 2026-01-14 | Paper |
| Parameterized approximation for robust clustering in discrete geometric spaces | 2026-01-14 | Paper |
Reducing CMSO to Unbreakable Graphs Cannot be Computable
(available as arXiv preprint) | 2026-01-01 | Paper |
Multiway f-Cut is fixed-parameter tractable
(available as arXiv preprint) | 2026-01-01 | Paper |
| Eliminating crossings in ordered graphs | 2025-12-02 | Paper |
| Approximate monotone local search for weighted problems | 2025-09-24 | Paper |
| Parameterized complexity classification for interval constraints | 2025-09-24 | Paper |
| Difference determines the degree: structural kernelizations of component order connectivity | 2025-09-24 | Paper |
| Parameterized approximation schemes for clustering with general norm objectives | 2025-08-15 | Paper |
| Parameterized complexity of biclique contraction and balanced biclique contraction | 2025-07-28 | Paper |
| Structural parameterizations of b-coloring | 2025-07-24 | Paper |
Odd cycle transversal on P₅-free graphs in polynomial time
ACM Transactions on Algorithms | 2025-07-22 | Paper |
| Domination and cut problems on chordal graphs with bounded leafage | 2025-06-23 | Paper |
| Faster exponential-time approximation algorithms using approximate monotone local search | 2025-06-19 | Paper |
Wannabe bounded treewidth graphs admit a polynomial kernel for directed feedback vertex set
ACM Transactions on Computation Theory | 2025-04-23 | Paper |
Exact and approximate digraph bandwidth
Theory of Computing Systems | 2025-02-28 | Paper |
On the parameterized complexity of deletion to \(\mathcal{H}\)-free strong components
SIAM Journal on Discrete Mathematics | 2024-12-18 | Paper |
| Optimally repurposing existing algorithms to obtain exponential-time approximations | 2024-11-28 | Paper |
| Odd cycle transversal on P₅-free graphs in quasi-polynomial time | 2024-11-28 | Paper |
| Metric dimension parameterized by feedback vertex set and other structural parameters | 2024-08-06 | Paper |
| Fixed-parameter tractability of \textsc{Directed Multicut} with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation | 2024-05-14 | Paper |
Domination and Cut Problems on Chordal Graphs with Bounded Leafage
Algorithmica | 2024-04-24 | Paper |
| Parameterized Complexity of Directed Spanner Problems. | 2023-11-13 | Paper |
Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters
SIAM Journal on Discrete Mathematics | 2023-10-13 | Paper |
Parameterized complexity of multicut in weighted trees
Theoretical Computer Science | 2023-10-12 | Paper |
Treedepth vs circumference
Combinatorica | 2023-10-04 | Paper |
Balanced substructures in bicolored graphs
Lecture Notes in Computer Science | 2023-08-14 | Paper |
Sub-exponential time parameterized algorithms for graph layout problems on digraphs with bounded independence number
Algorithmica | 2023-06-28 | Paper |
Parameterized complexity of weighted multicut in trees
Graph-Theoretic Concepts in Computer Science | 2023-05-05 | Paper |
The complexity of contracting bipartite graphs into small cycles
Graph-Theoretic Concepts in Computer Science | 2023-05-05 | Paper |
| Circumventing connectivity for kernelization | 2023-03-22 | Paper |
| Exact and Approximate Digraph Bandwidth | 2023-02-03 | Paper |
| scientific article; zbMATH DE number 7650395 (Why is no real title available?) | 2023-02-03 | Paper |
Parameterized complexity of directed spanner problems
Algorithmica | 2022-08-03 | Paper |
| Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number | 2022-07-21 | Paper |
| A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs | 2022-07-21 | Paper |
| Quick separation in chordal and split graphs | 2022-07-18 | Paper |
scientific article; zbMATH DE number 7559446 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
| Brief announcement: Treewidth modulator: emergency exit for DFVS | 2021-07-28 | Paper |
A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs
Algorithmica | 2021-06-11 | Paper |
Covering small independent sets and separators with applications to parameterized algorithms
ACM Transactions on Algorithms | 2021-05-03 | Paper |
| Balanced judicious bipartition is fixed-parameter tractable | 2020-11-25 | Paper |
| Wannabe bounded treewidth graphs admit a polynomial kernel for DFVS | 2020-01-16 | Paper |
Balanced Judicious Bipartition is Fixed-Parameter Tractable
SIAM Journal on Discrete Mathematics | 2019-10-28 | Paper |
Parameterised algorithms for deletion to classes of DAGs
Theory of Computing Systems | 2019-09-05 | Paper |
| Kernels for deletion to classes of acyclic digraphs | 2018-04-19 | Paper |
| Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set | 2018-04-10 | Paper |
| Covering small independent sets and separators with applications to parameterized algorithms | 2018-03-15 | Paper |
Kernels for deletion to classes of acyclic digraphs
Journal of Computer and System Sciences | 2017-11-14 | Paper |
Product dimension of forests and bounded treewidth graphs
The Electronic Journal of Combinatorics | 2014-08-14 | Paper |
Product dimension of forests and bounded treewidth graphs
The Electronic Journal of Combinatorics | 2014-08-14 | Paper |
