Students & Teaching

Co-Supervised Master’s Theses

  1. [PDF] Ludwig Mueller. The Target Set Selection Problem with Arbitrary Edge Weights. Master’s thesis, University of Vienna, Department of Statistics and Operations Research, Vienna, Austria, sep 2018. supervised by M. Leitner, and M. Ruthmair
    [Bibtex]
    @MastersThesis{Mueller2018,
    author = {Mueller, Ludwig},
    school = {University of Vienna, Department of Statistics and Operations Research},
    title = {The Target Set Selection Problem with Arbitrary Edge Weights},
    year = {2018},
    address = {Vienna, Austria},
    month = sep,
    note = {supervised by M. Leitner, and M. Ruthmair},
    file = {:pdfs-own/Mueller2018.pdf:PDF},
    timestamp = {2017-10-293},
    }
  2. [PDF] Zvezdana Milosevic. Crowdsourced Delivery: An Alternative to In-House Delivery. Master’s thesis, University of Vienna, Department of Statistics and Operations Research, Vienna, Austria, 2018. supervised by M. Leitner, and M. Ruthmair
    [Bibtex]
    @MastersThesis{Milosevic2018,
    author = {Milosevic, Zvezdana},
    school = {University of Vienna, Department of Statistics and Operations Research},
    title = {Crowdsourced Delivery: An Alternative to In-House Delivery},
    year = {2018},
    address = {Vienna, Austria},
    month = nov,
    note = {supervised by M. Leitner, and M. Ruthmair},
    file = {:pdfs-own/Milosevic2018.pdf:PDF},
    }
  3. [PDF] Agnes Rymarz. Influence Maximization in Social Networks: A survey on variants of the least cost influence problem. Master’s thesis, University of Vienna, Department of Statistics and Operations Research, Vienna, Austria, 2017. supervised by M. Leitner, and M. Ruthmair
    [Bibtex]
    @MastersThesis{Rymarz2017,
    author = {Rymarz, Agnes},
    school = {University of Vienna, Department of Statistics and Operations Research},
    title = {Influence Maximization in Social Networks: A survey on variants of the least cost influence problem},
    year = {2017},
    address = {Vienna, Austria},
    month = oct,
    note = {supervised by M. Leitner, and M. Ruthmair},
    file = {:pdfs-own/Rymarz2017.pdf:PDF},
    timestamp = {2017-10-293},
    }
  4. [PDF] Georg Brandstätter. Solving the Multi-Objective Steiner Tree Problem with Resources. Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms, Vienna, Austria, 2015. supervised by G.R. Raidl, M. Leitner, and M. Ruthmair
    [Bibtex]
    @MastersThesis{Brandstaetter2015,
    author = {Brandst{\"{a}}tter, Georg},
    school = {Vienna University of Technology, Institute of Computer Graphics and Algorithms},
    title = {Solving the Multi-Objective Steiner Tree Problem with Resources},
    year = {2015},
    address = {Vienna, Austria},
    month = jan,
    note = {supervised by G.R. Raidl, M. Leitner, and M. Ruthmair},
    file = {:pdfs-own/Brandstaetter2015.pdf:PDF},
    timestamp = {2015-01-26},
    }
  5. [PDF] Martin Riedler. Exact Approaches to the Network Design Problem with Relays. Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms, Vienna, Austria, 2014. supervised by I. Ljubic, M. Leitner, and M. Ruthmair
    [Bibtex]
    @MastersThesis{Riedler2014,
    author = {Riedler, Martin},
    school = {Vienna University of Technology, Institute of Computer Graphics and Algorithms},
    title = {Exact Approaches to the Network Design Problem with Relays},
    year = {2014},
    address = {Vienna, Austria},
    month = aug,
    note = {supervised by I. Ljubic, M. Leitner, and M. Ruthmair},
    file = {:pdfs-own/Riedler2014.pdf:PDF},
    timestamp = {2015-01-26},
    }
  6. [PDF] Roman Karl. The Rooted Delay-Constrained Steiner Tree Problem with Uncertain Delays. Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms, Vienna, Austria, 2013. supervised by G.R. Raidl, M. Leitner, and M. Ruthmair
    [Bibtex]
    @MastersThesis{Karl2013,
    author = {Karl, Roman},
    school = {Vienna University of Technology, Institute of Computer Graphics and Algorithms},
    title = {The Rooted Delay-Constrained Steiner Tree Problem with Uncertain Delays},
    year = {2013},
    address = {Vienna, Austria},
    month = dec,
    note = {supervised by G.R. Raidl, M. Leitner, and M. Ruthmair},
    file = {:pdfs-own/Karl2013.pdf:PDF},
    timestamp = {2015-01-26},
    }
  7. [PDF] Thorsten Krenek. Verbrauchsminimierung eines Hybridfahrzeuges im Neuen Europäischen Fahrzyklus. Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms, Vienna, Austria, jul 2011. supervised by G.R. Raidl and M. Ruthmair
    [Bibtex]
    @MastersThesis{Krenek2011,
    author = {Krenek, Thorsten},
    school = {Vienna University of Technology, Institute of Computer Graphics and Algorithms},
    title = {Verbrauchsminimierung eines Hybridfahrzeuges im Neuen Europ{\"a}ischen Fahrzyklus},
    year = {2011},
    address = {Vienna, Austria},
    month = jul,
    note = {supervised by G.R. Raidl and M. Ruthmair},
    file = {:pdfs-own/Krenek2011.pdf:PDF},
    timestamp = {2015-01-26},
    }
  8. [PDF] Thomas Seidl. A Multilevel Refinement Approach to the Rooted Delay-Constrained Steiner Tree Problem. Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms, Vienna, Austria, 2011. supervised by G.R. Raidl and M. Ruthmair
    [Bibtex]
    @MastersThesis{Seidl2011,
    author = {Seidl, Thomas},
    school = {Vienna University of Technology, Institute of Computer Graphics and Algorithms},
    title = {A Multilevel Refinement Approach to the Rooted Delay-Constrained Steiner Tree Problem},
    year = {2011},
    address = {Vienna, Austria},
    month = sep,
    note = {supervised by G.R. Raidl and M. Ruthmair},
    file = {:pdfs-own/Seidl2011.pdf:PDF},
    timestamp = {2015-01-26},
    }
  9. [PDF] Martin Berlakovich. Multilevel Heuristiken für das Rooted Delay-Constrained Minimum Spanning Tree Problem. Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms, Vienna, Austria, 2010. supervised by G.R. Raidl and M. Ruthmair
    [Bibtex]
    @MastersThesis{Berlakovich2010,
    author = {Berlakovich, Martin},
    school = {Vienna University of Technology, Institute of Computer Graphics and Algorithms},
    title = {Multilevel Heuristiken f{\"u}r das Rooted Delay-Constrained Minimum Spanning Tree Problem},
    year = {2010},
    address = {Vienna, Austria},
    month = jul,
    note = {supervised by G.R. Raidl and M. Ruthmair},
    file = {:pdfs-own/Berlakovich2010.pdf:PDF},
    timestamp = {2015-01-26},
    }
  10. [PDF] Jakob Walla. Exakte und heuristische Optimierungsmethoden zur Lösung von Video Server Load Re-Balancing. Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms, Vienna, Austria, 2009. supervised by G.R. Raidl and M. Ruthmair
    [Bibtex]
    @MastersThesis{Walla2009,
    author = {Walla, Jakob},
    school = {Vienna University of Technology, Institute of Computer Graphics and Algorithms},
    title = {Exakte und heuristische Optimierungsmethoden zur L{\"o}sung von Video Server Load Re-Balancing},
    year = {2009},
    address = {Vienna, Austria},
    month = apr,
    note = {supervised by G.R. Raidl and M. Ruthmair},
    file = {:pdfs-own/Walla2009.pdf:PDF},
    timestamp = {2015-01-26},
    }
  11. Teaching

    at Vienna University of Technology (VUT) and University of Vienna (UV)

    YearsCourse
    2012-2021Mathematical Programming (VUT)
    2020Optimization in Social Networks (Winter School on Network Optimization, Estoril, Portugal)
    2019-2020Graph Algorithms and Network Flows (UV)
    2018-2019Linear, Nonlinear and Integer Optimization (UV)
    2018-2019Decision Support (UV)
    2017-2018Mathematics 2 (UV)
    2016Linear Algebra (UV)
    2016Methods of Decision Support (UV)
    2011-2013Algorithmics (VUT)
    2011Advanced Algorithms and Data Structures (VUT)
    2010-2011Efficient Algorithms (VUT)
    2008-2010Algorithms on Graphs (VUT)
    2008-2010Algorithms and Data Structures 1 (organization and exercises, >600 students\, VUT)
    2008-2013Seminar on Basics of Methodical Working, Seminar on Algorithms, Seminar with Bachelor Thesis (VUT)