| Publication | Date of Publication | Type |
|---|
| Extending partial 1-planar drawings | 2026-03-18 | Paper |
Routing few robots in a crowded network
Journal of Computer and System Sciences | 2026-02-11 | Paper |
| Parameterized algorithms for coordinated motion planning: minimizing energy | 2026-01-14 | Paper |
From data completion to problems on hypercubes: a parameterized analysis of the independent set problem
Algorithmica | 2025-11-25 | Paper |
Determinantal sieving
TheoretiCS | 2025-10-22 | Paper |
| From data completion to problems on hypercubes: a parameterized analysis of the independent set problem | 2025-09-24 | Paper |
| Finding a highly connected Steiner subgraph and its applications | 2024-12-03 | Paper |
| Determinantal sieving | 2024-11-28 | Paper |
| The parameterized complexity of coordinated motion planning | 2024-10-16 | Paper |
The parameterized complexity of welfare guarantees in Schelling segregation
Theoretical Computer Science | 2024-10-07 | Paper |
Being an influencer is hard: the complexity of influence maximization in temporal graphs with a fixed source
Information and Computation | 2024-06-21 | Paper |
scientific article; zbMATH DE number 7788495 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
Component order connectivity in directed graphs
(available as arXiv preprint) | 2023-11-13 | Paper |
scientific article; zbMATH DE number 7764101 (Why is no real title available?)
(available as arXiv preprint) | 2023-11-13 | Paper |
Removing Connected Obstacles in the Plane is FPT
(available as arXiv preprint) | 2023-11-02 | Paper |
A polynomial kernel for 3-leaf power deletion
Algorithmica | 2023-10-06 | Paper |
| Complexity Dichotomies for the Maximum Weighted Digraph Partition Problem | 2023-07-03 | Paper |
On the lossy kernelization for connected treedepth deletion set
Graph-Theoretic Concepts in Computer Science | 2023-05-05 | Paper |
A Colored Path Problem and Its Applications
ACM Transactions on Algorithms | 2023-04-26 | Paper |
Preference swaps for the stable matching problem
Theoretical Computer Science | 2023-04-20 | Paper |
On the parameterized complexity of clustering problems for incomplete data
Journal of Computer and System Sciences | 2023-03-10 | Paper |
A Polynomial Kernel for Line Graph Deletion
(available as arXiv preprint) | 2023-02-07 | Paper |
| On covering segments with unit intervals | 2023-02-07 | Paper |
Parameterized complexity of envy-free resource allocation in social networks
Artificial Intelligence | 2023-01-04 | Paper |
Component order connectivity in directed graphs
Algorithmica | 2022-08-18 | Paper |
| Measuring what matters: a hybrid approach to dynamic programming with treewidth | 2022-07-21 | Paper |
scientific article; zbMATH DE number 7559376 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
scientific article; zbMATH DE number 7559402 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
Complexity of the Steiner Network Problem with Respect to the Number of Terminals
(available as arXiv preprint) | 2022-07-18 | Paper |
On Covering Segments with Unit Intervals
SIAM Journal on Discrete Mathematics | 2022-06-03 | Paper |
| scientific article; zbMATH DE number 7525479 (Why is no real title available?) | 2022-05-11 | Paper |
Preference Swaps for the Stable Matching Problem
(available as arXiv preprint) | 2021-12-31 | Paper |
The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints
Artificial Intelligence | 2021-11-02 | Paper |
How to navigate through obstacles?
(available as arXiv preprint) | 2021-07-28 | Paper |
Measuring what matters: a hybrid approach to dynamic programming with treewidth
Journal of Computer and System Sciences | 2021-07-06 | Paper |
Towards a polynomial kernel for directed feedback vertex set
Algorithmica | 2021-04-19 | Paper |
Bisection of bounded treewidth graphs by convolutions
Journal of Computer and System Sciences | 2021-04-14 | Paper |
Lossy kernels for connected dominating set on sparse graphs
(available as arXiv preprint) | 2020-08-05 | Paper |
Small resolution proofs for QBF using dependency treewidth
(available as arXiv preprint) | 2020-08-05 | Paper |
| Towards a polynomial kernel for directed feedback vertex set | 2020-05-26 | Paper |
| Lossy Kernels for Hitting Subgraphs | 2020-05-26 | Paper |
Toward Cereceda's conjecture for planar graphs
Journal of Graph Theory | 2020-05-21 | Paper |
Using decomposition-parameters for QBF: mind the prefix!
Journal of Computer and System Sciences | 2020-03-13 | Paper |
| Integer programming and incidence treedepth | 2020-02-06 | Paper |
Integer programming and incidence treedepth
(available as arXiv preprint) | 2020-02-06 | Paper |
A polynomial kernel for $3$-leaf power deletion
(available as arXiv preprint) | 2019-11-11 | Paper |
Lossy kernels for connected dominating set on sparse graphs
SIAM Journal on Discrete Mathematics | 2019-09-30 | Paper |
On approximate preprocessing for domination and hitting subgraphs with connected deletion sets
Journal of Computer and System Sciences | 2019-08-07 | Paper |
Symmetry properties of generalized graph truncations
Journal of Combinatorial Theory. Series B | 2019-07-17 | Paper |
Meta-kernelization using well-structured modulators
Discrete Applied Mathematics | 2018-09-17 | Paper |
Meta-kernelization using well-structured modulators
Discrete Applied Mathematics | 2018-09-17 | Paper |
A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion
Journal of Computer and System Sciences | 2018-09-07 | Paper |
A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion
Journal of Computer and System Sciences | 2018-09-07 | Paper |
On the complexity of rainbow coloring problems
Discrete Applied Mathematics | 2018-06-27 | Paper |
Solving problems on graphs of high rank-width
Algorithmica | 2018-04-06 | Paper |
| A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion | 2018-03-21 | Paper |
| Counting linear extensions: parameterizations by treewidth | 2018-03-02 | Paper |
| Meta-kernelization using Well-structured Modulators | 2017-09-29 | Paper |
On the complexity of rainbow coloring problems
Lecture Notes in Computer Science | 2016-04-04 | Paper |
Equimatchable Graphs on Surfaces
Journal of Graph Theory | 2016-02-01 | Paper |
Solving problems on graphs of high rank-width
Lecture Notes in Computer Science | 2015-10-30 | Paper |
| Equimatchable factor-critical graphs and independence number 2 | 2015-01-29 | Paper |
