| Publication | Date of Publication | Type |
|---|
| Colored cut games | 2026-03-23 | Paper |
Multi-parameter analysis of finding minors and induced subgraphs in edge-periodic temporal graphs
Discrete Applied Mathematics | 2025-11-04 | Paper |
Efficient branch-and-bound algorithms for finding triangle-constrained 2-clubs
Journal of Combinatorial Optimization | 2024-12-03 | Paper |
On critical node problems with vulnerable vertices
Journal of Graph Algorithms and Applications | 2024-10-08 | Paper |
| Covering many (or few) edges with \(k\) vertices in sparse graphs | 2024-04-23 | Paper |
Destroying Multicolored Paths and Cycles in Edge-Colored Graphs
Discrete Mathematics & Theoretical Computer Science | 2024-04-18 | Paper |
| Essentially tight kernels for (weakly) closed graphs | 2024-01-15 | Paper |
| scientific article; zbMATH DE number 7765378 (Why is no real title available?) | 2023-11-14 | Paper |
The parameterized complexity of \(s\)-club with triangle and seed constraints
Theory of Computing Systems | 2023-10-30 | Paper |
Multi-parameter analysis of finding minors and subgraphs in edge-periodic temporal graphs
Lecture Notes in Computer Science | 2023-08-14 | Paper |
Computing dense and sparse subgraphs of weakly closed graphs
Algorithmica | 2023-06-28 | Paper |
Essentially tight kernels for (weakly) closed graphs
Algorithmica | 2023-06-05 | Paper |
| scientific article; zbMATH DE number 7651108 (Why is no real title available?) | 2023-02-07 | Paper |
| Exploiting c-Closure in Kernelization Algorithms for Graph Problems | 2023-02-07 | Paper |
Exploiting \(c\)-closure in kernelization algorithms for graph problems
SIAM Journal on Discrete Mathematics | 2022-11-15 | Paper |
Colored cut games
Theoretical Computer Science | 2022-10-21 | Paper |
Refined parameterizations for computing colored cuts in edge-colored graphs
Theory of Computing Systems | 2022-10-04 | Paper |
Destroying Bicolored $P_3$s by Deleting Few Edges
Discrete Mathematics & Theoretical Computer Science | 2022-09-30 | Paper |
| On critical node problems with vulnerable vertices | 2022-08-30 | Paper |
The parameterized complexity of \(s\)-club with triangle and seed constraints
(available as arXiv preprint) | 2022-08-30 | Paper |
Preventing small \(\mathbf{(s,t)} \)-cuts by protecting edges
(available as arXiv preprint) | 2022-06-08 | Paper |
Enumerating connected induced subgraphs: improved delay and experimental comparison
Discrete Applied Mathematics | 2021-09-15 | Paper |
FixCon: A Generic Solver for Fixed-Cardinality Subgraph Problems
2020 Proceedings of the Twenty-Second Workshop on Algorithm Engineering and Experiments (ALENEX) | 2021-01-27 | Paper |
Enumerating connected induced subgraphs: improved delay and experimental comparison
SOFSEM 2019: Theory and Practice of Computer Science | 2020-10-22 | Paper |
Refined parameterizations for computing colored cuts in edge-colored graphs
SOFSEM 2020: Theory and Practice of Computer Science | 2020-07-20 | Paper |
Parameterized algorithms for module map problems
Discrete Applied Mathematics | 2020-06-29 | Paper |
Destroying bicolored \(P_3\)s by deleting few edges
(available as arXiv preprint) | 2020-05-12 | Paper |
Parameterized algorithms for module map problems
Lecture Notes in Computer Science | 2018-08-17 | Paper |
