| Publication | Date of Publication | Type |
|---|
| On finding -th smallest perfect matchings | 2026-08-31 | Paper |
| Fréchet distance in unweighted planar graphs | 2026-08-31 | Paper |
| On the complexity of recoverable robust optimization in the polynomial hierarchy | 2026-08-05 | Paper |
The complexity of blocking all solutions
Theoretical Computer Science | 2026-03-30 | Paper |
Completeness in the Polynomial Hierarchy and PSPACE for many natural problems derived from NP
(available as arXiv preprint) | 2026-01-01 | Paper |
| Completeness in the polynomial hierarchy for many natural problems in bilevel and robust optimization | 2025-12-22 | Paper |
On the complexity of the bilevel shortest path problem
Networks | 2025-12-04 | Paper |
| On the exact matching problem in dense graphs | 2025-11-10 | Paper |
| Exact matching: correct parity and FPT parameterized by independence number | 2025-07-24 | Paper |
| Recognition of unit segment and polyline graphs is \(\exists \mathbb{R} \)-complete | 2025-05-02 | Paper |
A linear time algorithm for linearizing quadratic and higher-order shortest path problems
Mathematical Programming. Series A. Series B | 2025-03-05 | Paper |
| An approximation algorithm for the exact matching problem in bipartite graphs | 2025-01-14 | Paper |
On the Multi-Robber Damage Number
(available as arXiv preprint) | 2025-01-01 | Paper |
On the complexity of robust multi-stage problems with discrete recourse
Discrete Applied Mathematics | 2024-01-02 | Paper |
A linear time algorithm for linearizing quadratic and higher-order shortest path problems
Integer Programming and Combinatorial Optimization | 2023-11-09 | Paper |
Assistance and interdiction problems on interval graphs
Discrete Applied Mathematics | 2023-09-14 | Paper |
Non-preemptive tree packing
Algorithmica | 2023-03-09 | Paper |
| On the Multi-Robber Damage Number | 2022-09-22 | Paper |
Recoverable robust representatives selection problems with discrete budgeted uncertainty
European Journal of Operational Research | 2022-07-22 | Paper |
| Linearizable special cases of the quadratic shortest path problem | 2022-06-08 | Paper |
Two-stage robust optimization problems with two-stage uncertainty
European Journal of Operational Research | 2022-05-20 | Paper |
Non-preemptive tree packing
Lecture Notes in Computer Science | 2022-03-22 | Paper |
| Non-interference through determinism | 2021-12-20 | Paper |
Two-Stage Robust Optimization Problems with Two-Stage Uncertainty
(available as arXiv preprint) | 2021-04-07 | Paper |
Recoverable Robust Representatives Selection Problems with Discrete Budgeted Uncertainty
(available as arXiv preprint) | 2020-08-28 | Paper |
A greedy heuristic for crossing-angle maximization
(available as arXiv preprint) | 2019-02-15 | Paper |
