My research interests are in the areas of combinatorial optimization, computational complexity and graphs with a focus on robust optimization and applications in operations research. I like to study problems about graph algorithms, transportation, packing, scheduling and facility location.
Papers
Publications in refereed journals- Allocation of Indivisible Items with Individual Preference Graphs
with N. Chiarelli, C. Dallard, A. Darmann, M. Milanič, P. Muršič and U. Pferschy
to appear in Discrete Applied Mathematics - Assistance and Interdiction Problems on Interval Graphs
with P. Hoang and L. Wulf
to appear in Discrete Applied Mathematics - Recoverable robust representatives selection problems with discrete budgeted uncertainty
with M. Goerigk and L. Wulf
European Journal of Operational Research, volume 303, issue 2, 2022 - Two-Stage robust optimization problems with two-stage uncertainty
with M. Goerigk and L. Wulf
European Journal of Operational Research, volume 302, issue 1, 2022 - Non-Preemptive Tree Packing
with L. Wulf and G. J. Woeginger
Algorithmica, 2022 - Continuous facility location on graphs
with T. A. Hartmann and G. J. Woeginger
Mathematical Programming, volume 192, 2022 - Dispersing obnoxious facilities on a graph
with A. Grigoriev, T. A. Hartmann and G. J. Woeginger
Algorithmica, volume 83, issue 6, 2021 - The Steiner cycle and path cover problem on interval graphs
with A. Ćustić
Journal of Combinatorial Optimization, volume 43, 2022 - Matroid bases with cardinality constraints on the intersection
with B. Peis and V. Timmermans
Mathematical Programming volume 194, 2022 - Robust Combinatorial Optimization with Locally Budgeted Uncertainty
with M. Goerigk
Open Journal of Mathematical Optimization, volume 2, 2021 - A linear time algorithm for the robust recoverable selection problem
with T. Lachmann and G. J. Woeginger
Discrete Applied Mathematics, volume 303, 2021 - Combinatorial optimization with interaction costs: Complexity and solvable cases
with A. Ćustić and A. Punnen
Discrete Optimization, volume 33, 2019 - On sequences covering all rainbow-progressions
with L. Alese and P. Tabatabai
Journal of Combinatorics, volume 9, 2018
- A linear time algorithm for linearizing quadratic and higher-order shortest path problems
with E. Çela, B. Klinz, G. J. Woeginger and L. Wulf
24th Conference on Integer Programming and Combinatorial Optimization (IPCO 2023) - Dispersing Obnoxious Facilities on Graphs by Rounding Distances
with T. A. Hartmann
47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022) - Allocating indivisible items with minimum dissatisfaction on preference graphs
with N. Chiarelli, C. Dallard, A. Darmann, M. Milanič, P. Muršič, N. Pivač and U. Pferschy
7th International Conference on Algorithmic Decision Theory (ADT 2021) - Linearizable Special Cases of the Quadratic Shortest Path Problem
with E. Çela, B. Klinz, J. B. Orlin, G. J. Woeginger and L. Wulf
Graph-Theoretic Concepts in Computer Science (WG 2021) - Non-Preemptive Tree Packing
with L. Wulf and G. J. Woeginger
32nd International Workshop on Combinatorial Algorithms (IWOCA 2021) - An investigation of the recoverable robust assignment problem
with D. Fischer, T. A. Hartmann and G. J. Woeginger
16th International Symposium on Parameterized and Exact Computation (IPEC 2021) - Continuous facility location on graphs
with T. A. Hartmann and G. J. Woeginger
21st Conference on Integer Programming and Combinatorial Optimization (IPCO 2020) - Dispersing Obnoxious Facilities on a Graph
with A. Grigoriev, T. A. Hartmann and G. J. Woeginger
36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)
- Rescheduling with New Orders under Bounded Disruption
with U. Pferschy and E. Rener
submitted - Dispersing Obnoxious Facilities in Dense Graphs: Stars and Matchings
with T. A. Hartmann
submitted - On the Complexity of Robust Multi-Stage Problems in the Polynomial Hierarchy
with M. Goerigk and L. Wulf
submitted - Minimizing Maximum Dissatisfaction in the Allocation of Indivisible Items under Identical Preference Graphs
with N. Chiarelli, C. Dallard, A. Darmann, M. Milanič, P. Muršič and U. Pferschy
submitted - Allocation of Indivisible Items with a Common Preference Graph
with N. Chiarelli, C. Dallard, A. Darmann, M. Milanič, P. Muršič and U. Pferschy
submitted
- A linear time algorithm for linearizing quadratic and higher-order shortest path problems
with E. Çela, B. Klinz, G. J. Woeginger and L. Wulf
in preparation - Linearizable Special Cases of the Quadratic Shortest Path Problem
with E. Çela, B. Klinz, J. B. Orlin, G. J. Woeginger and L. Wulf
in preparation - Matrix Completion Problems
with V. Deineko, E. Çela, B. Klinz and G. J. Woeginger
in preparation
Research Grants
- RTT: Robuste Taktische Transportplanung FFG Basisprogramm (Kleinprojekt)
- Bulk-robust optimizaton on graphs WTZ Scientfic & Technological Cooperaton AUSTRIA SLOVENIA