| Publication | Date of Publication | Type |
|---|
Induced minor models. I: Structural properties and algorithmic consequences
Journal of Computer and System Sciences | 2026-02-11 | Paper |
| Computing tree decompositions with small independence number | 2026-01-14 | Paper |
Graphs with two moplexes
Procedia Computer Science | 2025-12-02 | Paper |
Finding \(k\)-community structures in special graph classes
Discrete Applied Mathematics | 2024-11-06 | Paper |
| On constrained intersection representations of graphs and digraphs | 2024-09-11 | Paper |
Graphs with at most two moplexes
Journal of Graph Theory | 2024-08-30 | Paper |
Treewidth versus clique number. II: Tree-independence number
Journal of Combinatorial Theory. Series B | 2024-01-29 | Paper |
Functionality of box intersection graphs
Results in Mathematics | 2024-01-19 | Paper |
| scientific article; zbMATH DE number 7765402 (Why is no real title available?) | 2023-11-14 | Paper |
Impact of soft ride time constraints on the complexity of scheduling in dial-a-ride problems
Theoretical Computer Science | 2023-05-19 | Paper |
Allocation of indivisible items with individual preference graphs
Discrete Applied Mathematics | 2023-05-11 | Paper |
Allocating indivisible items with minimum dissatisfaction on preference graphs
(available as arXiv preprint) | 2023-03-31 | Paper |
| Treewidth versus clique number in graph classes with a forbidden structure | 2022-12-21 | Paper |
| On minimally tough chordal graphs | 2022-10-01 | Paper |
| Computing Tree Decompositions with Small Independence Number | 2022-07-20 | Paper |
| Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure | 2022-06-30 | Paper |
| Finding $k$-community structures in special graph classes | 2022-06-29 | Paper |
| Vertex cover at distance on \(H\)-free graphs | 2022-03-22 | Paper |
Treewidth versus clique number. I: Graph classes with a forbidden structure
SIAM Journal on Discrete Mathematics | 2021-12-01 | Paper |
Colourful components in \(k\)-caterpillars and planar graphs
Theoretical Computer Science | 2021-11-18 | Paper |
On girth and the parameterized complexity of token sliding and token jumping
Algorithmica | 2021-09-02 | Paper |
On girth and the parameterized complexity of token sliding and token jumping
Algorithmica | 2021-09-02 | Paper |
| Graphs with at most two moplexes | 2021-06-18 | Paper |
| Towards a complexity dichotomy for colourful components problems on \(k\)-caterpillars and small-degree planar graphs | 2020-02-25 | Paper |
| Complexity of scheduling for DARP with soft ride times | 2020-02-06 | Paper |
Graphs without a partition into two proportionally dense subgraphs
Information Processing Letters | 2019-12-19 | Paper |
Proportionally dense subgraph of maximum size: complexity and approximation
Discrete Applied Mathematics | 2019-11-06 | Paper |
Scaffolding problems revisited: complexity, approximation and fixed parameter tractable algorithms, and some special cases
Algorithmica | 2018-06-01 | Paper |
Instance guaranteed ratio on greedy heuristic for genome scaffolding
Combinatorial Optimization and Applications | 2017-02-01 | Paper |
Detecting $K_{2,3}$ as an induced minor
(available as arXiv preprint) | N/A | Paper |
Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star
(available as arXiv preprint) | N/A | Paper |
