| Publication | Date of Publication | Type |
|---|
Core stability in additively separable hedonic games of low treewidth
Journal of Computer and System Sciences | 2026-02-11 | Paper |
| Parameterized algorithms for Steiner forest in bounded width graphs | 2026-01-14 | Paper |
Faster winner determination algorithms for (colored) Arc Kayles
Journal of Computer and System Sciences | 2025-12-11 | Paper |
Parameterized algorithms for \textsc{Steiner Forest} in bounded width graphs
ACM Transactions on Algorithms | 2025-11-03 | Paper |
Parameterized max min feedback vertex set
SIAM Journal on Discrete Mathematics | 2025-08-21 | Paper |
| Structural parameterizations for two bounded degree problems revisited | 2025-01-06 | Paper |
| Parameterized max min feedback vertex set | 2024-12-03 | Paper |
| First order logic on Pathwidth revisited again | 2024-11-14 | Paper |
Digraph coloring and distance to acyclicity
Theory of Computing Systems | 2024-10-07 | Paper |
| Determining a Slater winner is complete for parallel access to NP | 2024-04-23 | Paper |
Filling crosswords is very hard
Theoretical Computer Science | 2024-02-23 | Paper |
scientific article; zbMATH DE number 7788607 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
scientific article; zbMATH DE number 7788609 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
| In)approximability of Maximum Minimal FVS | 2023-11-14 | Paper |
| scientific article; zbMATH DE number 7764100 (Why is no real title available?) | 2023-11-13 | Paper |
Improved (In-)Approximability Bounds for d-Scattered Set
Journal of Graph Algorithms and Applications | 2023-07-03 | Paper |
Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation
Lecture Notes in Computer Science | 2023-03-22 | Paper |
| Grundy distinguishes treewidth from pathwidth | 2023-02-07 | Paper |
Parameterized Complexity of $$(A,\ell )$$-Path Packing
Lecture Notes in Computer Science | 2022-10-13 | Paper |
New algorithms for mixed dominating set
Discrete Mathematics & Theoretical Computer Science | 2022-09-30 | Paper |
New algorithms for mixed dominating set
Discrete Mathematics & Theoretical Computer Science | 2022-09-30 | Paper |
Grundy Distinguishes Treewidth from Pathwidth
SIAM Journal on Discrete Mathematics | 2022-08-18 | Paper |
| Token sliding on split graphs | 2022-07-18 | Paper |
Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation
Theoretical Computer Science | 2022-06-13 | Paper |
Defective Coloring on Classes of Perfect Graphs
Discrete Mathematics & Theoretical Computer Science | 2022-06-08 | Paper |
Parameterized complexity of \((A,\ell)\)-path packing
Algorithmica | 2022-03-22 | Paper |
Structurally parameterized \(d\)-scattered set
Discrete Applied Mathematics | 2022-01-05 | Paper |
(In)approximability of maximum minimal FVS
Journal of Computer and System Sciences | 2021-11-25 | Paper |
(In)approximability of maximum minimal FVS
Journal of Computer and System Sciences | 2021-11-25 | Paper |
Token sliding on split graphs
Theory of Computing Systems | 2021-08-05 | Paper |
New results on directed edge dominating set
(available as arXiv preprint) | 2021-08-04 | Paper |
| Finer tight bounds for coloring on clique-width | 2021-07-28 | Paper |
| scientific article; zbMATH DE number 7278055 (Why is no real title available?) | 2020-11-25 | Paper |
Maximum independent sets in subcubic graphs: new results
Theoretical Computer Science | 2020-11-06 | Paper |
Finer tight bounds for coloring on clique-width
SIAM Journal on Discrete Mathematics | 2020-10-29 | Paper |
Parameterized complexity of safe set
Journal of Graph Algorithms and Applications | 2020-09-04 | Paper |
Independent set reconfiguration parameterized by modular-width
Algorithmica | 2020-09-03 | Paper |
| scientific article; zbMATH DE number 7238962 (Why is no real title available?) | 2020-08-25 | Paper |
| Parameterized orientable deletion | 2020-08-25 | Paper |
Improved (In-)approximability bounds for \(d\)-scattered set
(available as arXiv preprint) | 2020-08-24 | Paper |
| How bad is the freedom to Flood-It? | 2020-08-11 | Paper |
Parameterized (approximate) defective coloring
(available as arXiv preprint) | 2020-08-05 | Paper |
| Treewidth with a quantifier alternation revisited | 2020-05-27 | Paper |
On the parameterized complexity of red-blue points separation
(available as arXiv preprint) | 2020-05-27 | Paper |
Parameterized orientable deletion
Algorithmica | 2020-05-21 | Paper |
Parameterized orientable deletion
Algorithmica | 2020-05-21 | Paper |
Parameterized (approximate) defective coloring
SIAM Journal on Discrete Mathematics | 2020-04-22 | Paper |
Maximum independent sets in subcubic graphs: new results
Lecture Notes in Computer Science | 2020-02-24 | Paper |
Independent set reconfiguration parameterized by modular-width
Lecture Notes in Computer Science | 2020-02-24 | Paper |
Parameterized complexity of safe set
(available as arXiv preprint) | 2020-02-06 | Paper |
| On the parameterized complexity of red-blue points separation | 2019-07-23 | Paper |
Structural parameters, tight bounds, and approximation for \((k, r)\)-center
Discrete Applied Mathematics | 2019-06-20 | Paper |
Structural parameters, tight bounds, and approximation for \((k, r)\)-center
Discrete Applied Mathematics | 2019-06-20 | Paper |
How Bad is the Freedom to Flood-It?
Journal of Graph Algorithms and Applications | 2019-02-14 | Paper |
Parameterized power vertex cover
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2018-12-10 | Paper |
Structurally parameterized \(d\)-scattered set
(available as arXiv preprint) | 2018-11-22 | Paper |
Parameterized edge Hamiltonicity
Discrete Applied Mathematics | 2018-09-17 | Paper |
QBF as an alternative to Courcelle's theorem
(available as arXiv preprint) | 2018-08-10 | Paper |
The many facets of upper domination
Theoretical Computer Science | 2018-03-13 | Paper |
Time-approximation trade-offs for inapproximable problems
(available as arXiv preprint) | 2018-01-24 | Paper |
Sub-exponential approximation schemes for CSPs: from dense to almost sparse
(available as arXiv preprint) | 2018-01-24 | Paper |
Defective coloring on classes of perfect graphs
(available as arXiv preprint) | 2018-01-04 | Paper |
Time-approximation trade-offs for inapproximable problems
Journal of Computer and System Sciences | 2017-11-14 | Paper |
Complexity and approximability of parameterized MAX-CSPs
Algorithmica | 2017-10-10 | Paper |
Complexity and Approximability of Parameterized MAX-CSPs
(available as arXiv preprint) | 2017-09-29 | Paper |
Parameterized power vertex cover
Lecture Notes in Computer Science | 2016-12-22 | Paper |
Algorithmic aspects of \textsc{Upper Domination}: a parameterised perspective
Algorithmic Aspects in Information and Management | 2016-11-09 | Paper |
Upper domination: complexity and approximation
Lecture Notes in Computer Science | 2016-09-29 | Paper |
Parameterized Algorithms for Parity Games
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
Parameterized edge Hamiltonicity
Lecture Notes in Computer Science | 2015-09-09 | Paper |
New inapproximability bounds for TSP
Journal of Computer and System Sciences | 2015-08-31 | Paper |
Improved inapproximability for TSP
Theory of Computing | 2014-10-06 | Paper |
Parameterized Approximation Schemes Using Graph Widths
Automata, Languages, and Programming | 2014-07-01 | Paper |
Model checking lower bounds for simple graphs
Logical Methods in Computer Science | 2014-04-09 | Paper |
The computational complexity of the game of Set and its theoretical applications
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
Quantum data and control made easier
Electronic Notes in Theoretical Computer Science | 2014-01-17 | Paper |
New inapproximability bounds for TSP
Algorithms and Computation | 2014-01-14 | Paper |
Parameterized maximum path coloring
Theoretical Computer Science | 2014-01-13 | Paper |
Parameterized Algorithms for Modular-Width
Parameterized and Exact Computation | 2013-12-10 | Paper |
Model checking lower bounds for simple graphs
Automata, Languages, and Programming | 2013-08-06 | Paper |
A kernel of order \(2k-c\log k\) for vertex cover
Information Processing Letters | 2013-04-04 | Paper |
Algorithmic meta-theorems for restrictions of treewidth
Algorithmica | 2012-11-21 | Paper |
Parameterized modal satisfiability
Algorithmica | 2012-11-21 | Paper |
Improved inapproximability for TSP
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2012-11-02 | Paper |
Improved inapproximability for TSP
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2012-11-02 | Paper |
| Local Improvement Gives Better Expanders | 2012-11-02 | Paper |
On the algorithmic effectiveness of digraph decompositions and complexity measures
Discrete Optimization | 2012-10-16 | Paper |
Online maximum directed cut
Journal of Combinatorial Optimization | 2012-10-01 | Paper |
| Periodic metro scheduling | 2012-09-28 | Paper |
Ordered coloring of grids and related graphs
Theoretical Computer Science | 2012-08-10 | Paper |
Parameterized maximum path coloring
Parameterized and Exact Computation | 2012-06-15 | Paper |
Queen labelings
AKCE International Journal of Graphs and Combinatorics | 2011-12-01 | Paper |
Vertex cover problem parameterized above and below tight bounds
Theory of Computing Systems | 2011-03-30 | Paper |
Parameterized modal satisfiability
Automata, Languages and Programming | 2010-09-07 | Paper |
Algorithmic meta-theorems for restrictions of treewidth
Algorithms – ESA 2010 | 2010-09-06 | Paper |
Ordered coloring grids and related graphs
Structural Information and Communication Complexity | 2010-02-24 | Paper |
Online Maximum Directed Cut
Algorithms and Computation | 2009-12-17 | Paper |
The ferry cover problem
Theory of Computing Systems | 2009-08-06 | Paper |
On the Algorithmic Effectiveness of Digraph Decompositions and Complexity Measures
Algorithms and Computation | 2009-01-29 | Paper |
The Ferry Cover Problem
Lecture Notes in Computer Science | 2007-11-15 | Paper |
