| Publication | Date of Publication | Type |
|---|
Finding forest-orderings of tournaments is NP-complete
(available as arXiv preprint) | N/A | Paper |
Twin-width. VIIIa: Delineation
European Journal of Combinatorics | 2026-10-02 | Paper |
| Revisiting directed disjoint paths on tournaments (and relatives) | 2026-09-29 | Paper |
Clique number of tournaments
The Electronic Journal of Combinatorics | 2026-09-18 | Paper |
Blow-ups and extensions of trees in tournaments
The Electronic Journal of Combinatorics | 2026-09-16 | Paper |
Constant congestion linkages in polynomially strong digraphs in polynomial time
Discrete Mathematics | 2025-12-15 | Paper |
| Disjoint temporal walks under waiting time constraints | 2025-11-11 | Paper |
New Menger-like dualities in digraphs and applications to half-integral linkages
ACM Transactions on Algorithms | 2025-10-01 | Paper |
| Twin-width. VIII: Delineation and win-wins | 2025-06-23 | Paper |
| New Menger-like dualities in digraphs and applications to half-integral linkages | 2025-01-06 | Paper |
Parameterized algorithms for Steiner tree and (connected) dominating set on path graphs
Networks | 2024-09-05 | Paper |
On computing large temporal (unilateral) connected components
Journal of Computer and System Sciences | 2024-07-01 | Paper |
A study of networks with arc-disjoint branched flows
Matemática Contemporânea | 2024-04-25 | Paper |
From branchings to flows: a study of an Edmonds' like property to arc-disjoint branching flows
Discrete Mathematics & Theoretical Computer Science | 2024-04-18 | Paper |
On computing large temporal (unilateral) connected components
Lecture Notes in Computer Science | 2023-12-22 | Paper |
| New Menger-like dualities in digraphs and applications to half-integral linkages | 2023-06-28 | Paper |
Adapting the directed grid theorem into an FPT algorithm
SIAM Journal on Discrete Mathematics | 2022-08-31 | Paper |
| A Relaxation of the Directed Disjoint Paths Problem: A Global Congestion Metric Helps. | 2022-07-18 | Paper |
| Menger's Theorem for Temporal Paths (Not Walks) | 2022-06-30 | Paper |
| Adapting the directed grid theorem into an \textsf{FPT} algorithm | 2022-04-27 | Paper |
| Twin-width VIII: delineation and win-wins | 2022-04-01 | Paper |
A relaxation of the directed disjoint paths problem: a global congestion metric helps
Theoretical Computer Science | 2021-12-01 | Paper |
A relaxation of the directed disjoint paths problem: a global congestion metric helps
Theoretical Computer Science | 2021-12-01 | Paper |
A relaxation of the Directed Disjoint Paths problem: a global congestion metric helps
(available as arXiv preprint) | 2019-09-30 | Paper |
Bispindles in strongly connected digraphs with large chromatic number
The Electronic Journal of Combinatorics | 2018-06-14 | Paper |
Bispindle in strongly connected digraphs with large chromatic number
(available as arXiv preprint) | 2018-04-09 | Paper |
| Bispindle in strongly connected digraphs with large chromatic number | 2018-04-09 | Paper |
A proof for a conjecture of Gorgol
Electronic Notes in Discrete Mathematics | 2016-10-17 | Paper |
| scientific article; zbMATH DE number 1341622 (Why is no real title available?) | 1999-09-22 | Paper |
