| Publication | Date of Publication | Type |
|---|
| PACE solver description: UzL solver for dominating set and hitting set | 2026-09-23 | Paper |
| Structure-guided automated reasoning | 2026-06-24 | Paper |
| PACE solver description: UzL exact solver for one-sided crossing minimization | 2026-05-29 | Paper |
| On the descriptive complexity of vertex deletion problems | 2026-05-12 | Paper |
| Faster graph algorithms through DAG compression | 2025-11-10 | Paper |
| PACE solver description: the PACE 2023 parameterized algorithms and computational experiments challenge: twinwidth | 2025-09-24 | Paper |
| Existential second-order logic over graphs: parameterized complexity | 2025-09-24 | Paper |
| On the parallel parameterized complexity of MaxSAT variants | 2024-07-12 | Paper |
| MaxSAT with absolute value functions: a parameterized perspective | 2024-05-27 | Paper |
| Dynamic kernels for hitting sets and set packing | 2024-02-12 | Paper |
On the parallel parameterized complexity of MaxSAT variants
The Journal of Artificial Intelligence Research (JAIR) | 2023-12-20 | Paper |
| scientific article; zbMATH DE number 7764118 (Why is no real title available?) | 2023-11-13 | Paper |
| scientific article; zbMATH DE number 7764119 (Why is no real title available?) | 2023-11-13 | Paper |
| scientific article; zbMATH DE number 7759277 (Why is no real title available?) | 2023-11-02 | Paper |
Dynamic kernels for hitting sets and set packing
Algorithmica | 2022-10-27 | Paper |
scientific article; zbMATH DE number 7559382 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
On the descriptive complexity of color coding
(available as arXiv preprint) | 2022-07-18 | Paper |
Complete edge-colored permutation graphs
Advances in Applied Mathematics | 2022-06-13 | Paper |
Computing kernels in parallel: lower and upper bounds
(available as arXiv preprint) | 2021-08-04 | Paper |
Practical access to dynamic programming on tree decompositions
(available as arXiv preprint) | 2021-08-04 | Paper |
Practical access to dynamic programming on tree decompositions
Algorithms | 2020-10-08 | Paper |
Computing Hitting Set Kernels By AC^0-Circuits
(available as arXiv preprint) | 2020-08-05 | Paper |
Computing hitting set kernels by \(\mathrm{AC}^0\)-circuits
Theory of Computing Systems | 2020-04-15 | Paper |
Positive-instance driven dynamic programming for graph searching
(available as arXiv preprint) | 2020-01-16 | Paper |
Towards work-efficient parallel parameterized algorithms
WALCOM: Algorithms and Computation | 2019-10-15 | Paper |
| Jdrasil: a modular library for computing tree decompositions | 2018-08-13 | Paper |
| Parallel Multivariate Meta-Theorems | 2018-04-10 | Paper |
Fast parallel fixed-parameter algorithms via color coding
(available as arXiv preprint) | 2017-09-29 | Paper |
