2024
Filling crosswords is very hard.
Theor. Comput. Sci., January, 2024
The Primal Pathwidth SETH.
CoRR, 2024
Core Stability in Additively Separable Hedonic Games of Low Treewidth.
CoRR, 2024
Parameterized Vertex Integrity Revisited.
CoRR, 2024
Parameterized Algorithms for Steiner Forest in Bounded Width Graphs.
CoRR, 2024
Faster Winner Determination Algorithms for (Colored) Arc Kayles.
Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024
2023
Improved (In-)Approximability Bounds for d-Scattered Set.
J. Graph Algorithms Appl., 2023
New Results on Directed Edge Dominating Set.
Discret. Math. Theor. Comput. Sci., 2023
Parameterized Max Min Feedback Vertex Set.
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023
First Order Logic on Pathwidth Revisited Again.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023
Structural Parameterizations for Two Bounded Degree Problems Revisited.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023
2022
Grundy Distinguishes Treewidth from Pathwidth.
SIAM J. Discret. Math., September, 2022
Upper Dominating Set: Tight algorithms for pathwidth and sub-exponential approximation.
Theor. Comput. Sci., 2022
(In)approximability of maximum minimal FVS.
J. Comput. Syst. Sci., 2022
Defective Coloring on Classes of Perfect Graphs.
Discret. Math. Theor. Comput. Sci., 2022
Structurally parameterized d-scattered set.
Discret. Appl. Math., 2022
Parameterized Complexity of (A, ℓ )-Path Packing.
Algorithmica, 2022
Determining a Slater Winner Is Complete for Parallel Access to NP.
Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022
Hedonic Games and Treewidth Revisited.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022
Structural Graph Parameters, Fine-Grained Complexity, and Approximation.
, 2022
2021
Token Sliding on Split Graphs.
Theory Comput. Syst., 2021
New Algorithms for Mixed Dominating Set.
Discret. Math. Theor. Comput. Sci., 2021
Digraph Coloring and Distance to Acyclicity.
Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021
Fine-Grained Meta-Theorems for Vertex Integrity.
Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021
Minimum Stable Cut and Treewidth.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021
2020
Maximum independent sets in subcubic graphs: New results.
Theor. Comput. Sci., 2020
Finer Tight Bounds for Coloring on Clique-Width.
SIAM J. Discret. Math., 2020
Parameterized (Approximate) Defective Coloring.
SIAM J. Discret. Math., 2020
<i>K</i><sub>3</sub> Edge Cover Problem in a Wide Sense.
J. Inf. Process., 2020
Parameterized Complexity of Safe Set.
J. Graph Algorithms Appl., 2020
Parameterized Orientable Deletion.
Algorithmica, 2020
Independent Set Reconfiguration Parameterized by Modular-Width.
Algorithmica, 2020
2019
On the parameterized complexity of red-blue points separation.
J. Comput. Geom., 2019
How Bad is the Freedom to Flood-It?
J. Graph Algorithms Appl., 2019
Structural parameters, tight bounds, and approximation for (k, r)-center.
Discret. Appl. Math., 2019
2018
The many facets of upper domination.
Theor. Comput. Sci., 2018
Time-approximation trade-offs for inapproximable problems.
J. Comput. Syst. Sci., 2018
Parameterized Power Vertex Cover.
Discret. Math. Theor. Comput. Sci., 2018
Parameterized Edge Hamiltonicity.
Discret. Appl. Math., 2018
Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018
QBF as an Alternative to Courcelle's Theorem.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2018, 2018
2017
Complexity and Approximability of Parameterized MAX-CSPs.
Algorithmica, 2017
Treewidth with a Quantifier Alternation Revisited.
Proceedings of the 12th International Symposium on Parameterized and Exact Computation, 2017
2016
Sub-exponential Approximation Schemes for CSPs: From Dense to Almost Sparse.
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016
Upper Domination: Complexity and Approximation.
Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016
Algorithmic Aspects of Upper Domination: A Parameterised Perspective.
Proceedings of the Algorithmic Aspects in Information and Management, 2016
2015
Scrabble is PSPACE-Complete.
J. Inf. Process., 2015
New inapproximability bounds for TSP.
J. Comput. Syst. Sci., 2015
Algorithmic Aspects of Upper Domination.
CoRR, 2015
Parameterized Algorithms for Parity Games.
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015
2014
Improved Inapproximability for TSP.
Theory Comput., 2014
Guest column: the elusive inapproximability of the TSP.
SIGACT News, 2014
Model Checking Lower Bounds for Simple Graphs
Log. Methods Comput. Sci., 2014
The Computational Complexity of the Game of Set and Its Theoretical Applications.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014
Parameterized Approximation Schemes Using Graph Widths.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014
2013
Parameterized maximum path coloring.
Theor. Comput. Sci., 2013
Review of exact exponential algorithms by Fedor V. Fomin and Dieter Kratsch.
SIGACT News, 2013
Closing a Gap in the Complexity of Refinement Modal Logic.
CoRR, 2013
Parameterized Algorithms for Modular-Width.
Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013
2012
Ordered coloring of grids and related graphs.
Theor. Comput. Sci., 2012
Online maximum directed cut.
J. Comb. Optim., 2012
Local Improvement Gives Better Expanders
CoRR, 2012
Algorithmic Meta-theorems for Restrictions of Treewidth.
Algorithmica, 2012
Parameterized Modal Satisfiability.
Algorithmica, 2012
2011
Vertex Cover Problem Parameterized Above and Below Tight Bounds.
Theory Comput. Syst., 2011
A kernel of order 2 k-c log k for vertex cover.
Inf. Process. Lett., 2011
On the algorithmic effectiveness of digraph decompositions and complexity measures.
Discret. Optim., 2011
2009
Theory Comput. Syst., 2009
Algorithmic Meta-Theorems for Graphs of Bounded Vertex Cover
CoRR, 2009
2006
Quantum Data and Control Made Easier.
Proceedings of the 4th International Workshop on Quantum Programming Languages, 2006
Periodic Metro Scheduling.
Proceedings of the ATMOS 2006, 2006
