| Publication | Date of Publication | Type |
|---|
| scientific article; zbMATH DE number 7803608 (Why is no real title available?) | 2024-02-12 | Paper |
The Treewidth and Pathwidth of Graph Unions
SIAM Journal on Discrete Mathematics | 2024-01-23 | Paper |
scientific article; zbMATH DE number 7788458 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
| Algorithmic properties of sparse digraphs | 2022-07-18 | Paper |
| scientific article; zbMATH DE number 7340147 (Why is no real title available?) | 2021-04-27 | Paper |
| The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs | 2021-04-27 | Paper |
Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness
ACM Journal of Experimental Algorithmics | 2021-04-21 | Paper |
Classes of graphs with low complexity: the case of classes with bounded linear rankwidth
European Journal of Combinatorics | 2021-02-08 | Paper |
Linear rankwidth meets stability
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
| scientific article; zbMATH DE number 7297863 (Why is no real title available?) | 2021-01-19 | Paper |
scientific article; zbMATH DE number 7297863 (Why is no real title available?)
(available as arXiv preprint) | 2021-01-19 | Paper |
Empirical evaluation of approximation algorithms for generalized graph coloring and uniform quasi-wideness
(available as arXiv preprint) | 2020-12-16 | Paper |
Model-checking on ordered structures
ACM Transactions on Computational Logic | 2020-09-11 | Paper |
Neighborhood complexity and kernelization for nowhere dense classes of graphs
(available as arXiv preprint) | 2020-05-27 | Paper |
Cyclewidth and the grid theorem for perfect matching width of bipartite graphs
(available as arXiv preprint) | 2020-02-24 | Paper |
Routing with congestion in acyclic digraphs
Information Processing Letters | 2019-09-20 | Paper |
Polynomial kernels and wideness properties of nowhere dense graph classes
ACM Transactions on Algorithms | 2019-03-28 | Paper |
Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs
(available as arXiv preprint) | 2019-02-04 | Paper |
Coloring and covering nowhere dense graphs
SIAM Journal on Discrete Mathematics | 2018-10-31 | Paper |
Polynomial kernels and wideness properties of nowhere dense graph classes
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| Structural properties and constant factor-approximation of strong distance-\(r\) dominating sets in sparse directed graphs | 2018-04-19 | Paper |
The generalised colouring numbers on classes of bounded expansion
(available as arXiv preprint) | 2018-03-21 | Paper |
scientific article; zbMATH DE number 6851840 (Why is no real title available?)
(available as arXiv preprint) | 2018-03-21 | Paper |
On the generalised colouring numbers of graphs that exclude a fixed minor
European Journal of Combinatorics | 2017-09-11 | Paper |
On the generalised colouring numbers of graphs that exclude a fixed minor
European Journal of Combinatorics | 2017-09-11 | Paper |
| Graph searching games and width measures for directed graphs | 2017-01-24 | Paper |
Jumping robbers in digraphs
Theoretical Computer Science | 2016-11-29 | Paper |
DAG-width is PSPACE-complete
Theoretical Computer Science | 2016-11-29 | Paper |
Colouring and covering nowhere dense graphs
Graph-Theoretic Concepts in Computer Science | 2016-10-21 | Paper |
On the generalised colouring numbers of graphs that exclude a fixed minor
Electronic Notes in Discrete Mathematics | 2016-10-14 | Paper |
Down the Borel hierarchy: solving Muller games via safety games
Theoretical Computer Science | 2014-12-02 | Paper |
The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs
Theoretical Computer Science | 2014-12-02 | Paper |
| Directed Width Measures and Monotonicity of Directed Graph Searching | 2014-08-20 | Paper |
Entanglement and the complexity of directed graphs
Theoretical Computer Science | 2013-01-07 | Paper |
Parity games with partial information played on graphs of bounded complexity
Mathematical Foundations of Computer Science 2010 | 2010-09-03 | Paper |
Directed Graphs of Entanglement Two
Fundamentals of Computation Theory | 2009-10-20 | Paper |
