| Publication | Date of Publication | Type |
|---|
Approximating highly inapproximable problems on graphs of bounded twin-width
Journal of Computer and System Sciences | 2027-01-01 | Paper |
The Canadian traveller problem on unit-weighted and arbitrarily weighted outerplanar graphs
Theoretical Computer Science | 2026-08-21 | Paper |
| Quasilinear-time eccentricities computation, and more, on median graphs | 2026-07-03 | Paper |
| The Canadian traveller problem on outerplanar graphs | 2026-05-12 | Paper |
Approximation algorithms for demand-based job scheduling with reconfigurable resources
Discrete Applied Mathematics | 2026-01-28 | Paper |
Diameter in linear time for constant-dimension median graphs
Procedia Computer Science | 2025-12-02 | Paper |
| Approximation algorithm for job scheduling with reconfigurable resources | 2025-02-07 | Paper |
| Approximating highly inapproximable problems on graphs of bounded twin-width | 2024-10-08 | Paper |
| Deciding twin-width at most 4 is NP-complete | 2024-06-24 | Paper |
| Subquadratic-time algorithm for the diameter and all eccentricities on median graphs | 2024-04-23 | Paper |
1-extendability of independent sets
Algorithmica | 2024-03-25 | Paper |
Subquadratic-time algorithm for the diameter and all eccentricities on median graphs
Theory of Computing Systems | 2024-02-09 | Paper |
On the Parameterized Complexity of Counting Small-Sized Minimum \(\boldsymbol{(S,T)}\)-Cuts
SIAM Journal on Discrete Mathematics | 2023-06-22 | Paper |
The influence of maximum \((s,t)\)-cuts on the competitiveness of deterministic strategies for the Canadian traveller problem
Theoretical Computer Science | 2023-01-04 | Paper |
1-extendability of independent sets
(available as arXiv preprint) | 2022-08-30 | Paper |
| Approximating Highly Inapproximable Problems on Graphs of Bounded Twin-Width | 2022-07-15 | Paper |
| Deciding twin-width at most 4 is NP-complete | 2021-12-16 | Paper |
| Diameter, radius and all eccentricities in linear time for constant-dimension median graphs | 2021-05-25 | Paper |
| Improved deterministic strategy for the Canadian Traveller Problem exploiting small max-\((s,t)\)-cuts | 2020-08-24 | Paper |
Fixed-parameter tractability of counting small minimum \((S,T)\)-cuts
(available as arXiv preprint) | 2020-02-24 | Paper |
Multiple canadians on the road: minimizing the distance competitive ratio
Journal of Combinatorial Optimization | 2019-12-13 | Paper |
On the parameterized complexity of separating certain sources from the target
Theoretical Computer Science | 2019-10-18 | Paper |
| On the competitiveness of memoryless strategies for the \(k\)-Canadian traveller problem | 2019-10-11 | Paper |
A lower bound for weak Schur numbers with a deterministic algorithm
Journal of Discrete Algorithms | 2019-01-04 | Paper |
| scientific article; zbMATH DE number 1194440 (Why is no real title available?) | 1998-08-25 | Paper |
| scientific article; zbMATH DE number 1194464 (Why is no real title available?) | 1998-08-25 | Paper |
| scientific article; zbMATH DE number 4096427 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 4096426 (Why is no real title available?) | 1984-01-01 | Paper |
