Team & Students

Current Team
  • Georg Brandst├Ątter, PhD student (co-supervised with I. Ljubic)
  • Michael Kahr, PhD student (co-supervised with I. Bomze)
Former Post-Docs
Former PhD Students
  • Martin Luipersbeck. Large-scale Network Optimization: Steiner Tree Problems, 2017 (co-supervised with I. Ljubic)
Supervised Master Theses
  1. A. Merdzani. Heavy and dense subgraphs: a survey on models, algorithms and applications. Master’s thesis. University of Vienna, Austria, 2017
  2. M. Kahr. Determining optimal locations for electric car sharing stations under stochastic demand. Master’s thesis. University of Vienna, Austria, 2016 (co-supervised with W. Gutjahr)
  3. G. Brandst├Ątter. Solving the multi-objective Steiner tree problem with resources. Master’s thesis, Vienna University of Technology, Austria, 2015 (co-supervised with G. Raidl and M. Ruthmair)
  4. M. Riedler. Exact approaches to the network design problem with relays. Master’s thesis, Vienna University of Technology, Vienna, Austria, 2014 (co-supervised with I. Ljubic and M. Ruthmair)
  5. M. Luipersbeck. A new partition-based heuristic for the Steiner tree problem in large graphs. Master’s thesis, Vienna University of Technology, Vienna, Austria, 2013 (co-supervised with I. Ljubic)
  6. R. Karl. The rooted delay-constrained Steiner tree problem with uncertain delays. Master’s thesis, Vienna University of Technology, Vienna, Austria, 2013 (co-supervised with G. Raidl and M. Ruthmair)
  7. T. Petelin. Two-phase local search for the bi-objective connected facility location problem. Master’s thesis, Vienna University of Technology, Vienna, Austria, 2013 (co-supervised with G. Raidl)
  8. G. Fritz. Heuristic methods for the hop constrained survivable network design problem. Master’s thesis, Vienna University of Technology, Vienna, Austria, 2011 (co-supervised with G. Raidl)
  9. M. Sinnl. Branch-and-price for the Steiner tree problem with revenues, budget and hop constraints. Master’s thesis, Vienna University of Technology, Vienna, Austria, 2011 (co-supervised with G. Raidl)