| Publication | Date of Publication | Type |
|---|
| When you come at the king you best not miss | 2024-09-12 | Paper |
scientific article; zbMATH DE number 7764102 (Why is no real title available?)
(available as arXiv preprint) | 2023-11-13 | Paper |
A color-avoiding approach to subgraph counting in bounded expansion classes
Algorithmica | 2023-08-17 | Paper |
| When you come at the kings you best not miss | 2022-09-24 | Paper |
Harmless sets in sparse classes
(available as arXiv preprint) | 2022-08-30 | Paper |
Domination above \(r\)-independence: does sparseness help?
(available as arXiv preprint) | 2022-07-21 | Paper |
Parameterized algorithms for zero extension and metric labelling problems
(available as arXiv preprint) | 2021-07-28 | Paper |
Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness
ACM Journal of Experimental Algorithmics | 2021-04-21 | Paper |
Empirical evaluation of approximation algorithms for generalized graph coloring and uniform quasi-wideness
(available as arXiv preprint) | 2020-12-16 | Paper |
\(k\)-distinct in- and out-branchings in digraphs
(available as arXiv preprint) | 2020-05-27 | Paper |
| Path-contractions, edge deletions and connectivity preservation | 2020-05-27 | Paper |
scientific article; zbMATH DE number 7204413 (Why is no real title available?)
(available as arXiv preprint) | 2020-05-26 | Paper |
Width, depth, and space: tradeoffs between branching and dynamic programming
Algorithms | 2020-01-21 | Paper |
Alternative parameterizations of \textsc{Metric Dimension}
Theoretical Computer Science | 2020-01-16 | Paper |
Evaluation of an MSO-Solver
2012 Proceedings of the Fourteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
A practical fpt algorithm for F<scp>low</scp> D<scp>ecomposition</scp> and transcript assembly
2018 Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Structural sparsity of complex networks: bounded expansion in random models and real-world graphs
Journal of Computer and System Sciences | 2019-08-07 | Paper |
Structural sparsity of complex networks: bounded expansion in random models and real-world graphs
Journal of Computer and System Sciences | 2019-08-07 | Paper |
| Longest paths in 2-edge-connected cubic graphs | 2019-03-06 | Paper |
Path-contractions, edge deletions and connectivity preservation
Journal of Computer and System Sciences | 2019-01-25 | Paper |
Path-contractions, edge deletions and connectivity preservation
Journal of Computer and System Sciences | 2019-01-25 | Paper |
Characterising bounded expansion by neighbourhood complexity
European Journal of Combinatorics | 2018-11-15 | Paper |
Characterising bounded expansion by neighbourhood complexity
European Journal of Combinatorics | 2018-11-15 | Paper |
Linear kernels and single-exponential algorithms via protrusion decompositions
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials
Journal of Computer and System Sciences | 2018-05-08 | Paper |
Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials
Journal of Computer and System Sciences | 2018-05-08 | Paper |
\(k\)-distinct in- and out-branchings in digraphs
Journal of Computer and System Sciences | 2018-05-08 | Paper |
Fast biclustering by dual parameterization
(available as arXiv preprint) | 2017-09-29 | Paper |
Kernelization using structural parameters on sparse graph classes
Journal of Computer and System Sciences | 2016-11-14 | Paper |
Kernelization using structural parameters on sparse graph classes
Journal of Computer and System Sciences | 2016-11-14 | Paper |
Hyperbolicity, degeneracy, and expansion of random intersection graphs
Lecture Notes in Computer Science | 2016-01-08 | Paper |
Finite integer index of pathwidth and treewidth
Parameterized and Exact Computation | 2015-09-15 | Paper |
Practical algorithms for MSO model-checking on tree-decomposable graphs
Computer Science Review | 2014-11-24 | Paper |
A faster parameterized algorithm for treedepth
Automata, Languages, and Programming | 2014-07-01 | Paper |
Kernelization using structural parameters on sparse graph classes
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Linear kernels and single-exponential algorithms via protrusion decompositions
Lecture Notes in Computer Science | 2013-08-06 | Paper |
