| Publication | Date of Publication | Type |
|---|
| Dispersing obnoxious facilities on graphs by rounding distances | 2024-08-06 | Paper |
scientific article; zbMATH DE number 7803597 (Why is no real title available?)
(available as arXiv preprint) | 2024-02-12 | 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 |
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 |
Non-preemptive tree packing
Algorithmica | 2023-03-09 | Paper |
Continuous facility location on graphs
Integer Programming and Combinatorial Optimization | 2022-10-14 | Paper |
Robust combinatorial optimization with locally budgeted uncertainty
OJMO. Open Journal of Mathematical Optimization | 2022-08-20 | Paper |
Recoverable robust representatives selection problems with discrete budgeted uncertainty
European Journal of Operational Research | 2022-07-22 | Paper |
| Dispersing Obnoxious Facilities on a Graph | 2022-07-18 | Paper |
Matroid bases with cardinality constraints on the intersection
Mathematical Programming. Series A. Series B | 2022-06-29 | 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 |
Continuous facility location on graphs
Mathematical Programming. Series A. Series B | 2022-03-22 | Paper |
Non-preemptive tree packing
Lecture Notes in Computer Science | 2022-03-22 | Paper |
The Steiner cycle and path cover problem on interval graphs
Journal of Combinatorial Optimization | 2022-02-14 | Paper |
A linear time algorithm for the robust recoverable selection problem
Discrete Applied Mathematics | 2021-09-15 | Paper |
Dispersing obnoxious facilities on a graph
Algorithmica | 2021-06-11 | 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 |
Combinatorial optimization with interaction costs: complexity and solvable cases
Discrete Optimization | 2019-11-28 | Paper |
On sequences covering all rainbow \(k\)-progressions
Journal of Combinatorics | 2018-12-10 | Paper |
