| Publication | Date of Publication | Type |
|---|
Oriented spanners
Algorithmica | 2025-12-30 | Paper |
| Oriented spanners | 2025-01-06 | Paper |
Twin-distance-hereditary digraphs
Theoretical Computer Science | 2023-07-21 | Paper |
Characterizations and directed path-width of sequence digraphs
Theory of Computing Systems | 2023-05-02 | Paper |
| scientific article; zbMATH DE number 7559442 (Why is no real title available?) | 2022-07-18 | Paper |
| Directed width parameters on semicomplete digraphs | 2022-06-29 | Paper |
Computing directed Steiner path covers
Journal of Combinatorial Optimization | 2022-04-13 | Paper |
| Acyclic coloring parameterized by directed clique-width | 2022-03-24 | Paper |
| Subset sum problems with special digraph constraints | 2021-08-30 | Paper |
| Exact solutions for the Steiner path cover problem on special graph classes | 2021-08-30 | Paper |
On characterizations for subclasses of directed co-graphs
Journal of Combinatorial Optimization | 2021-05-11 | Paper |
How to compute digraph width measures on directed co-graphs
Theoretical Computer Science | 2021-01-25 | Paper |
Solutions for subset sum problems with special digraph constraints
Mathematical Methods of Operations Research | 2020-12-15 | Paper |
| Forbidden directed minors, directed path-width and directed tree-width of tree-like digraphs | 2020-10-22 | Paper |
Counting and enumerating independent sets with applications to combinatorial optimization problems
Mathematical Methods of Operations Research | 2020-08-03 | Paper |
Computing directed Steiner path covers for directed co-graphs (extended abstract)
SOFSEM 2020: Theory and Practice of Computer Science | 2020-07-20 | Paper |
| Characterizations for special directed co-graphs | 2020-05-13 | Paper |
| Computing digraph width measures on directed co-graphs (extended abstract) | 2020-01-30 | Paper |
Controlling distribution conveyors and multiline palletizers: theoretical foundations and online algorithms
OR Spectrum | 2020-01-15 | Paper |
On the hardness of palletizing bins using FIFO queues
Theoretical Computer Science | 2019-10-18 | Paper |
| Directed path-width of sequence digraphs | 2019-10-11 | Paper |
Comparing linear width parameters for directed graphs
Theory of Computing Systems | 2019-09-05 | Paper |
Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width
Mathematical Methods of Operations Research | 2019-07-10 | Paper |
Oriented coloring on recursively defined digraphs
Algorithms | 2019-07-08 | Paper |
Knapsack problems: a parameterized point of view
Theoretical Computer Science | 2019-05-29 | Paper |
A graph theoretic approach to solve special knapsack problems in polynomial time
Operations Research Proceedings | 2018-10-09 | Paper |
Directed path-width and directed tree-width of directed co-graphs
(available as arXiv preprint) | 2018-10-04 | Paper |
Computing directed path-width and directed tree-width of recursively defined digraphs
(available as arXiv preprint) | 2018-06-12 | Paper |
