{"id":86,"date":"2015-05-16T18:22:36","date_gmt":"2015-05-16T17:22:36","guid":{"rendered":"http:\/\/mario.ruthmair.at\/?page_id=86"},"modified":"2023-12-02T15:46:48","modified_gmt":"2023-12-02T14:46:48","slug":"teaching","status":"publish","type":"page","link":"https:\/\/mario.ruthmair.at\/?page_id=86","title":{"rendered":"Students &#038; Teaching"},"content":{"rendered":"\n<h1 class=\"wp-block-heading\">Co-Supervised Master&#8217;s Theses<\/h1>\n\n\n<ol reversed class=\"papercite_bibliography\">\n<li>         <a href=\"https:\/\/mario.ruthmair.at\/wp-content\/papercite-data\/pdf\/mueller2018.pdf\" title='Download PDF' class='papercite_pdf'><img src='https:\/\/mario.ruthmair.at\/wp-content\/plugins\/papercite\/img\/pdf.png' alt=\"[PDF]\"\/><\/a>              Ludwig Mueller. The Target Set Selection Problem with Arbitrary Edge Weights. Master&#8217;s thesis, University of Vienna, Department of Statistics and Operations Research, Vienna, Austria, sep 2018. supervised by M. Leitner, and M. Ruthmair <br \/>    <a href=\"javascript:void(0)\" id=\"papercite_8\" class=\"papercite_toggle\">[Bibtex]<\/a>\n<div class=\"papercite_bibtex\" id=\"papercite_8_block\">\n<pre><code class=\"tex bibtex\">@MastersThesis{Mueller2018,\nauthor = {Mueller, Ludwig},\nschool = {University of Vienna, Department of Statistics and Operations Research},\ntitle = {The Target Set Selection Problem with Arbitrary Edge Weights},\nyear = {2018},\naddress = {Vienna, Austria},\nmonth = sep,\nnote = {supervised by M. Leitner, and M. Ruthmair},\nfile = {:pdfs-own\/Mueller2018.pdf:PDF},\ntimestamp = {2017-10-293},\n}<\/code><\/pre>\n<\/div>\n<\/li>\n<li>         <a href=\"https:\/\/mario.ruthmair.at\/wp-content\/papercite-data\/pdf\/milosevic2018.pdf\" title='Download PDF' class='papercite_pdf'><img src='https:\/\/mario.ruthmair.at\/wp-content\/plugins\/papercite\/img\/pdf.png' alt=\"[PDF]\"\/><\/a>              Zvezdana Milosevic. Crowdsourced Delivery: An Alternative to In-House Delivery. Master&#8217;s thesis, University of Vienna, Department of Statistics and Operations Research, Vienna, Austria, 2018. supervised by M. Leitner, and M. Ruthmair <br \/>    <a href=\"javascript:void(0)\" id=\"papercite_9\" class=\"papercite_toggle\">[Bibtex]<\/a>\n<div class=\"papercite_bibtex\" id=\"papercite_9_block\">\n<pre><code class=\"tex bibtex\">@MastersThesis{Milosevic2018,\nauthor = {Milosevic, Zvezdana},\nschool = {University of Vienna, Department of Statistics and Operations Research},\ntitle = {Crowdsourced Delivery: An Alternative to In-House Delivery},\nyear = {2018},\naddress = {Vienna, Austria},\nmonth = nov,\nnote = {supervised by M. Leitner, and M. Ruthmair},\nfile = {:pdfs-own\/Milosevic2018.pdf:PDF},\n}<\/code><\/pre>\n<\/div>\n<\/li>\n<li>         <a href=\"https:\/\/mario.ruthmair.at\/wp-content\/papercite-data\/pdf\/rymarz2017.pdf\" title='Download PDF' class='papercite_pdf'><img src='https:\/\/mario.ruthmair.at\/wp-content\/plugins\/papercite\/img\/pdf.png' alt=\"[PDF]\"\/><\/a>              Agnes Rymarz. Influence Maximization in Social Networks: A survey on variants of the least cost influence problem. Master&#8217;s thesis, University of Vienna, Department of Statistics and Operations Research, Vienna, Austria, 2017. supervised by M. Leitner, and M. Ruthmair <br \/>    <a href=\"javascript:void(0)\" id=\"papercite_5\" class=\"papercite_toggle\">[Bibtex]<\/a>\n<div class=\"papercite_bibtex\" id=\"papercite_5_block\">\n<pre><code class=\"tex bibtex\">@MastersThesis{Rymarz2017,\nauthor = {Rymarz, Agnes},\nschool = {University of Vienna, Department of Statistics and Operations Research},\ntitle = {Influence Maximization in Social Networks: A survey on variants of the least cost influence problem},\nyear = {2017},\naddress = {Vienna, Austria},\nmonth = oct,\nnote = {supervised by M. Leitner, and M. Ruthmair},\nfile = {:pdfs-own\/Rymarz2017.pdf:PDF},\ntimestamp = {2017-10-293},\n}<\/code><\/pre>\n<\/div>\n<\/li>\n<li>         <a href=\"https:\/\/mario.ruthmair.at\/wp-content\/papercite-data\/pdf\/brandstaetter2015.pdf\" title='Download PDF' class='papercite_pdf'><img src='https:\/\/mario.ruthmair.at\/wp-content\/plugins\/papercite\/img\/pdf.png' alt=\"[PDF]\"\/><\/a>              Georg Brandst\u00e4tter. Solving the Multi-Objective Steiner Tree Problem with Resources. Master&#8217;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 <br \/>    <a href=\"javascript:void(0)\" id=\"papercite_1\" class=\"papercite_toggle\">[Bibtex]<\/a>\n<div class=\"papercite_bibtex\" id=\"papercite_1_block\">\n<pre><code class=\"tex bibtex\">@MastersThesis{Brandstaetter2015,\nauthor = {Brandst{\\\"{a}}tter, Georg},\nschool = {Vienna University of Technology, Institute of Computer Graphics and Algorithms},\ntitle = {Solving the Multi-Objective Steiner Tree Problem with Resources},\nyear = {2015},\naddress = {Vienna, Austria},\nmonth = jan,\nnote = {supervised by G.R. Raidl, M. Leitner, and M. Ruthmair},\nfile = {:pdfs-own\/Brandstaetter2015.pdf:PDF},\ntimestamp = {2015-01-26},\n}<\/code><\/pre>\n<\/div>\n<\/li>\n<li>         <a href=\"https:\/\/mario.ruthmair.at\/wp-content\/papercite-data\/pdf\/riedler2014.pdf\" title='Download PDF' class='papercite_pdf'><img src='https:\/\/mario.ruthmair.at\/wp-content\/plugins\/papercite\/img\/pdf.png' alt=\"[PDF]\"\/><\/a>              Martin Riedler. Exact Approaches to the Network Design Problem with Relays. Master&#8217;s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms, Vienna, Austria, 2014. supervised by I. Ljubic, M. Leitner, and M. Ruthmair <br \/>    <a href=\"javascript:void(0)\" id=\"papercite_4\" class=\"papercite_toggle\">[Bibtex]<\/a>\n<div class=\"papercite_bibtex\" id=\"papercite_4_block\">\n<pre><code class=\"tex bibtex\">@MastersThesis{Riedler2014,\nauthor = {Riedler, Martin},\nschool = {Vienna University of Technology, Institute of Computer Graphics and Algorithms},\ntitle = {Exact Approaches to the Network Design Problem with Relays},\nyear = {2014},\naddress = {Vienna, Austria},\nmonth = aug,\nnote = {supervised by I. Ljubic, M. Leitner, and M. Ruthmair},\nfile = {:pdfs-own\/Riedler2014.pdf:PDF},\ntimestamp = {2015-01-26},\n}<\/code><\/pre>\n<\/div>\n<\/li>\n<li>         <a href=\"https:\/\/mario.ruthmair.at\/wp-content\/papercite-data\/pdf\/karl2013.pdf\" title='Download PDF' class='papercite_pdf'><img src='https:\/\/mario.ruthmair.at\/wp-content\/plugins\/papercite\/img\/pdf.png' alt=\"[PDF]\"\/><\/a>              Roman Karl. The Rooted Delay-Constrained Steiner Tree Problem with Uncertain Delays. Master&#8217;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 <br \/>    <a href=\"javascript:void(0)\" id=\"papercite_2\" class=\"papercite_toggle\">[Bibtex]<\/a>\n<div class=\"papercite_bibtex\" id=\"papercite_2_block\">\n<pre><code class=\"tex bibtex\">@MastersThesis{Karl2013,\nauthor = {Karl, Roman},\nschool = {Vienna University of Technology, Institute of Computer Graphics and Algorithms},\ntitle = {The Rooted Delay-Constrained Steiner Tree Problem with Uncertain Delays},\nyear = {2013},\naddress = {Vienna, Austria},\nmonth = dec,\nnote = {supervised by G.R. Raidl, M. Leitner, and M. Ruthmair},\nfile = {:pdfs-own\/Karl2013.pdf:PDF},\ntimestamp = {2015-01-26},\n}<\/code><\/pre>\n<\/div>\n<\/li>\n<li>         <a href=\"https:\/\/mario.ruthmair.at\/wp-content\/papercite-data\/pdf\/krenek2011.pdf\" title='Download PDF' class='papercite_pdf'><img src='https:\/\/mario.ruthmair.at\/wp-content\/plugins\/papercite\/img\/pdf.png' alt=\"[PDF]\"\/><\/a>              Thorsten Krenek. Verbrauchsminimierung eines Hybridfahrzeuges im Neuen Europ\u00e4ischen Fahrzyklus. Master&#8217;s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms, Vienna, Austria, jul 2011. supervised by G.R. Raidl and M. Ruthmair <br \/>    <a href=\"javascript:void(0)\" id=\"papercite_3\" class=\"papercite_toggle\">[Bibtex]<\/a>\n<div class=\"papercite_bibtex\" id=\"papercite_3_block\">\n<pre><code class=\"tex bibtex\">@MastersThesis{Krenek2011,\nauthor = {Krenek, Thorsten},\nschool = {Vienna University of Technology, Institute of Computer Graphics and Algorithms},\ntitle = {Verbrauchsminimierung eines Hybridfahrzeuges im Neuen Europ{\\\"a}ischen Fahrzyklus},\nyear = {2011},\naddress = {Vienna, Austria},\nmonth = jul,\nnote = {supervised by G.R. Raidl and M. Ruthmair},\nfile = {:pdfs-own\/Krenek2011.pdf:PDF},\ntimestamp = {2015-01-26},\n}<\/code><\/pre>\n<\/div>\n<\/li>\n<li>         <a href=\"https:\/\/mario.ruthmair.at\/wp-content\/papercite-data\/pdf\/seidl2011.pdf\" title='Download PDF' class='papercite_pdf'><img src='https:\/\/mario.ruthmair.at\/wp-content\/plugins\/papercite\/img\/pdf.png' alt=\"[PDF]\"\/><\/a>              Thomas Seidl. A Multilevel Refinement Approach to the Rooted Delay-Constrained Steiner Tree Problem. Master&#8217;s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms, Vienna, Austria, 2011. supervised by G.R. Raidl and M. Ruthmair <br \/>    <a href=\"javascript:void(0)\" id=\"papercite_6\" class=\"papercite_toggle\">[Bibtex]<\/a>\n<div class=\"papercite_bibtex\" id=\"papercite_6_block\">\n<pre><code class=\"tex bibtex\">@MastersThesis{Seidl2011,\nauthor = {Seidl, Thomas},\nschool = {Vienna University of Technology, Institute of Computer Graphics and Algorithms},\ntitle = {A Multilevel Refinement Approach to the Rooted Delay-Constrained Steiner Tree Problem},\nyear = {2011},\naddress = {Vienna, Austria},\nmonth = sep,\nnote = {supervised by G.R. Raidl and M. Ruthmair},\nfile = {:pdfs-own\/Seidl2011.pdf:PDF},\ntimestamp = {2015-01-26},\n}<\/code><\/pre>\n<\/div>\n<\/li>\n<li>         <a href=\"https:\/\/mario.ruthmair.at\/wp-content\/papercite-data\/pdf\/berlakovich2010.pdf\" title='Download PDF' class='papercite_pdf'><img src='https:\/\/mario.ruthmair.at\/wp-content\/plugins\/papercite\/img\/pdf.png' alt=\"[PDF]\"\/><\/a>              Martin Berlakovich. Multilevel Heuristiken f\u00fcr das Rooted Delay-Constrained Minimum Spanning Tree Problem. Master&#8217;s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms, Vienna, Austria, 2010. supervised by G.R. Raidl and M. Ruthmair <br \/>    <a href=\"javascript:void(0)\" id=\"papercite_0\" class=\"papercite_toggle\">[Bibtex]<\/a>\n<div class=\"papercite_bibtex\" id=\"papercite_0_block\">\n<pre><code class=\"tex bibtex\">@MastersThesis{Berlakovich2010,\nauthor = {Berlakovich, Martin},\nschool = {Vienna University of Technology, Institute of Computer Graphics and Algorithms},\ntitle = {Multilevel Heuristiken f{\\\"u}r das Rooted Delay-Constrained Minimum Spanning Tree Problem},\nyear = {2010},\naddress = {Vienna, Austria},\nmonth = jul,\nnote = {supervised by G.R. Raidl and M. Ruthmair},\nfile = {:pdfs-own\/Berlakovich2010.pdf:PDF},\ntimestamp = {2015-01-26},\n}<\/code><\/pre>\n<\/div>\n<\/li>\n<li>         <a href=\"https:\/\/mario.ruthmair.at\/wp-content\/papercite-data\/pdf\/walla2009.pdf\" title='Download PDF' class='papercite_pdf'><img src='https:\/\/mario.ruthmair.at\/wp-content\/plugins\/papercite\/img\/pdf.png' alt=\"[PDF]\"\/><\/a>              Jakob Walla. Exakte und heuristische Optimierungsmethoden zur L\u00f6sung von Video Server Load Re-Balancing. Master&#8217;s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms, Vienna, Austria, 2009. supervised by G.R. Raidl and M. Ruthmair <br \/>    <a href=\"javascript:void(0)\" id=\"papercite_7\" class=\"papercite_toggle\">[Bibtex]<\/a>\n<div class=\"papercite_bibtex\" id=\"papercite_7_block\">\n<pre><code class=\"tex bibtex\">@MastersThesis{Walla2009,\nauthor = {Walla, Jakob},\nschool = {Vienna University of Technology, Institute of Computer Graphics and Algorithms},\ntitle = {Exakte und heuristische Optimierungsmethoden zur L{\\\"o}sung von Video Server Load Re-Balancing},\nyear = {2009},\naddress = {Vienna, Austria},\nmonth = apr,\nnote = {supervised by G.R. Raidl and M. Ruthmair},\nfile = {:pdfs-own\/Walla2009.pdf:PDF},\ntimestamp = {2015-01-26},\n}<\/code><\/pre>\n<\/div>\n<\/li>\n<\/ul>\n\n\n\n<h1 class=\"wp-block-heading\">Teaching<\/h1>\n\n\n\n<p>at Vienna University of Technology (VUT) and University of Vienna (UV)<\/p>\n\n\n\n<figure class=\"wp-block-table\"><table><tbody><tr><td><strong>Years<\/strong><\/td><td><strong>Course<\/strong><\/td><\/tr><tr><td>2012-2021<\/td><td>Mathematical Programming (VUT)<\/td><\/tr><tr><td>2020<\/td><td>Optimization in Social Networks (Winter School on Network Optimization, Estoril, Portugal)<\/td><\/tr><tr><td>2019-2020<\/td><td>Graph Algorithms and Network Flows (UV)<\/td><\/tr><tr><td>2018-2019<\/td><td>Linear, Nonlinear and Integer Optimization (UV)<\/td><\/tr><tr><td>2018-2019<\/td><td>Decision Support (UV)<\/td><\/tr><tr><td>2017-2018<\/td><td>Mathematics 2 (UV)<\/td><\/tr><tr><td>2016<\/td><td>Linear Algebra (UV)<\/td><\/tr><tr><td>2016<\/td><td>Methods of Decision Support (UV)<\/td><\/tr><tr><td>2011-2013<\/td><td>Algorithmics (VUT)<\/td><\/tr><tr><td>2011<\/td><td>Advanced Algorithms and Data Structures (VUT)<\/td><\/tr><tr><td>2010-2011<\/td><td>Efficient Algorithms (VUT)<\/td><\/tr><tr><td>2008-2010<\/td><td>Algorithms on Graphs (VUT)<\/td><\/tr><tr><td>2008-2010<\/td><td>Algorithms and Data Structures 1 (organization and exercises, >600 students\\, VUT)<\/td><\/tr><tr><td>2008-2013<\/td><td>Seminar on Basics of Methodical Working, Seminar on Algorithms, Seminar with Bachelor Thesis (VUT)<\/td><\/tr><\/tbody><\/table><\/figure>\n","protected":false},"excerpt":{"rendered":"<p>Co-Supervised Master&#8217;s Theses Teaching at Vienna University of Technology (VUT) and University of Vienna (UV) Years Course 2012-2021 Mathematical Programming (VUT) 2020 Optimization in Social Networks (Winter School on Network Optimization, Estoril, Portugal) 2019-2020 Graph Algorithms and Network Flows (UV) 2018-2019 Linear, Nonlinear and Integer Optimization (UV) 2018-2019 Decision Support (UV) 2017-2018 Mathematics 2 (UV) [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":6,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-86","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/mario.ruthmair.at\/index.php?rest_route=\/wp\/v2\/pages\/86","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/mario.ruthmair.at\/index.php?rest_route=\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/mario.ruthmair.at\/index.php?rest_route=\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/mario.ruthmair.at\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/mario.ruthmair.at\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=86"}],"version-history":[{"count":40,"href":"https:\/\/mario.ruthmair.at\/index.php?rest_route=\/wp\/v2\/pages\/86\/revisions"}],"predecessor-version":[{"id":471,"href":"https:\/\/mario.ruthmair.at\/index.php?rest_route=\/wp\/v2\/pages\/86\/revisions\/471"}],"wp:attachment":[{"href":"https:\/\/mario.ruthmair.at\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=86"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}