| Publication | Date of Publication | Type |
|---|
scientific article; zbMATH DE number 7788607 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
| Grundy distinguishes treewidth from pathwidth | 2023-02-07 | Paper |
| scientific article; zbMATH DE number 7650223 (Why is no real title available?) | 2023-02-03 | Paper |
Grundy Distinguishes Treewidth from Pathwidth
SIAM Journal on Discrete Mathematics | 2022-08-18 | Paper |
| Token sliding on split graphs | 2022-07-18 | Paper |
Defective Coloring on Classes of Perfect Graphs
Discrete Mathematics & Theoretical Computer Science | 2022-06-08 | Paper |
Graph modification for edge-coloured and signed graph homomorphism problems: parameterized and classical complexity
Algorithmica | 2022-05-03 | Paper |
Token sliding on split graphs
Theory of Computing Systems | 2021-08-05 | Paper |
Parameterized (approximate) defective coloring
(available as arXiv preprint) | 2020-08-05 | Paper |
Complexity of planar signed graph homomorphisms to cycles
Discrete Applied Mathematics | 2020-07-07 | Paper |
| Treewidth with a quantifier alternation revisited | 2020-05-27 | Paper |
Parameterized (approximate) defective coloring
SIAM Journal on Discrete Mathematics | 2020-04-22 | Paper |
| scientific article; zbMATH DE number 6992823 (Why is no real title available?) | 2018-12-12 | 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 |
Defective coloring on classes of perfect graphs
(available as arXiv preprint) | 2018-01-04 | Paper |
| Double-exponential and triple-exponential bounds for choosability problems parameterized by treewidth | 2017-12-19 | 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 |
| Hanabi is NP-complete, even for cheaters who look at their cards | 2017-07-17 | Paper |
Hanabi is NP-hard, even for cheaters who look at their cards
Theoretical Computer Science | 2017-05-12 | 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 |
The computational complexity of the game of Set and its theoretical applications
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
Parameterized modal satisfiability
Algorithmica | 2012-11-21 | Paper |
On the algorithmic effectiveness of digraph decompositions and complexity measures
Discrete Optimization | 2012-10-16 | Paper |
| Entropy, orbits, and spectra of graphs | 2012-09-05 | Paper |
Ordered coloring of grids and related graphs
Theoretical Computer Science | 2012-08-10 | 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 |
Ordered coloring grids and related graphs
Structural Information and Communication Complexity | 2010-02-24 | 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 |
