| Publication | Date of Publication | Type |
|---|
Polynomial-Delay Enumeration of Large Maximal Common Independent Sets in Two Matroids and Beyond
(available as arXiv preprint) | N/A | Paper |
| On the complexity of minimising the moving distance for dispersing objects | 2026-08-11 | Paper |
Enumerating graphlets with amortized time complexity independent of graph size
Algorithmica | 2025-08-29 | Paper |
Polynomial-delay enumeration of large maximal common independent sets in two matroids and beyond
Information and Computation | 2025-05-19 | Paper |
| Algorithms for optimally shifting intervals under intersection graph models | 2025-04-29 | Paper |
| Enumerating minimal vertex covers and dominating sets with capacity and/or connectivity constraints | 2025-02-28 | Paper |
Dichotomies for tree minor containment with structural parameters
Theoretical Computer Science | 2025-01-08 | Paper |
Efficient constant-factor approximate enumeration of minimal subsets for monotone properties with weight constraints
Discrete Applied Mathematics | 2025-01-06 | Paper |
| Polynomial-delay enumeration of large maximal common independent sets in two matroids | 2024-12-03 | Paper |
| Optimal LZ-end parsing is hard | 2024-10-21 | Paper |
| Dichotomies for tree minor containment with structural parameters | 2024-07-19 | Paper |
An approximation algorithm for K-best enumeration of minimal connected edge dominating sets with cardinality constraints
Theoretical Computer Science | 2024-06-27 | Paper |
On the hardness of inclusion-wise minimal separators enumeration
Information Processing Letters | 2024-03-13 | Paper |
Polynomial-delay and polynomial-space enumeration of large maximal matchings
Graph-Theoretic Concepts in Computer Science | 2023-05-05 | Paper |
| Finding the Anticover of a String | 2023-02-07 | Paper |
| Efficient enumeration of dominating sets for sparse graphs | 2022-07-21 | Paper |
scientific article; zbMATH DE number 7559431 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
Constant amortized time enumeration of Eulerian trails
Theoretical Computer Science | 2022-06-13 | Paper |
An improved deterministic parameterized algorithm for cactus vertex deletion
Theory of Computing Systems | 2022-05-09 | Paper |
Efficient enumeration of dominating sets for sparse graphs
Discrete Applied Mathematics | 2021-09-15 | Paper |
Efficient enumeration of dominating sets for sparse graphs
Discrete Applied Mathematics | 2021-09-15 | Paper |
A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number
Theoretical Computer Science | 2021-06-22 | Paper |
An efficient algorithm for enumerating chordal bipartite induced subgraphs in sparse graphs
(available as arXiv preprint) | 2020-02-25 | Paper |
Efficient enumeration of subgraphs and induced subgraphs with bounded girth
(available as arXiv preprint) | 2018-09-06 | Paper |
| Listing acyclic subgraphs and subgraphs of bounded girth in directed graphs | 2018-03-26 | Paper |
