Vorträge
An unserem Lehrstuhl findet regelmäßig das OMS-Oberseminar statt, bei dem Vortragende in lockerer Atmosphäre über neuartige Entwicklungen der aktuellen Forschung berichten. Gäste sind bei den Vorträgen gern gesehen. Alle Vorträge werden zuvor per E-Mail angekündigt. Die Einladungen zu den Vorträgen können per Mail an Katharina Eickhoff abonniert werden.
| Datum | Ort | Sprecher | Titel |
| 23.05.2023 | B227 | Khai Van Tran, RWTH Aachen | Competitive Strategies for Symmetric Rendezvous on the Line |
| 10.03.2023 | B227 | Martin Nägele, Bonn U | Recent advances on (Strictly) Delta-modular and congruency-constrained IPs |
| 07.03.2023 | B227 | Mariia Anapolska, RWTH Aachen | Fixed-interval scheduling on multitasking machines with flexible availabilities |
| 07.03.2023 | B227 | Khai Van Tran, TU Berlin | A Faster Algorithm for Quickest Transshipments via an Extended Discrete Newton Method |
| 17.01.2023 | B227 | Kevin Conrads, RWTH Aachen | Design and Analysis of Operations Research Methods for Optimization of Rail Network Traffic |
| 13.12.2022 | B227 | Meike Neuwohner, Bonn U | The Limits of Local Search for Weighted k-Set Packing |
| 15.11.2022 | online | Luca Ferrarini, University of Pavia | A Polyhedral Approach to the Total Matching Problem |
| 15.11.2022 | B227 | Philipp Pabst, RWTH Aachen | The k-slow Burning Problem |
| 11.10.2022 | B227 | Tom McCormick, University of British Columbia | Why Should You Care About Submodularity? |
| 15.09.2022 | B227 online |
Katharina Eickhoff, RWTH Aachen | Computing Walrasian prices via Matroid Partitioning |
| 18.08.2022 | B227 | José Verschae, Pontificia Universidad Católica de Chile | Symmetry Breaking Inequalities and Vector Orderings |
| 12.08.2022 | B227 | Marc Schröder, Maastricht U | Congestion Games with Random Demand |
| 21.06.2022 | B227 | Dorothee Henke, TU Dortmund | On the Complexity of the Bilevel Minimum Spanning Tree Problem |
| 02.06.2022 | online | Maximilian Hippler, RWTH Aachen | The Impact of Traffic Lights in Nash Flows Over Time |
| 19.05.2022 | B227 | Komal Muluk, RWTH Aachen | On the complexity of bilevel assignment problem |
| 05.05.2022 | B227 | Robin Westermann, RWTH Aachen | Analysis of multi-stage flow shop processing systems |
| 28.04.2022 | B227 | Lennart Kauther, RWTH Aachen | Stackelberg Minimum Weighted Vertex Cover |
| 24.03.2022 | online | Daniel Schmand, Bremen U | Bicriteria Nash Flows over Time |
| 24.02.2022 | online | Tobias Harks, Augsburg U | Generalized Nash Equilibrium Problems with Mixed-Integer Variables |
| 28.10.2021 | online | Niklas Rieken, RWTH Aachen | A Primal-Dual Approximation Framework for Weighted Covering Problems |
| 14.10.2021 | online | Katharina Eickhoff, RWTH Aachen | Computing buyer-optimal Walrasian prices in multi-unit matching markets via a sequence of max flow computations |
| 16.08.2021 | online | Rebecca Reiffenhäuser, Rome U | Greedy Selection Algorithms for Single-Sample Prophet Inequalities |
| 24.06.2021 | online | Laura Vargas Koch, ETH Zürich | Convergence of a Packet Routing Model to Flows Over Time |
| 10.06.2021 | online | Anna Arutyunova, Bonn U | Improvements on the k-means algorithm |
| 27.05.2021 | online | Komal Muluk, RWTH Aachen | On the complexity of singly connected vertex deletion |
| 11.05.2021 | online | Tim Poelma, RWTH Aachen | Makespan approximaton for scheduling trains on a single track |
| 06.05.2021 | online | Eran Rosenbluth, RWTH Aachen | PV2DNI, Low Cost, High Res, DNI Measurements Over a Large Area |
| 04.02.2021 | online | Marc Schröder, Maastricht U | Flow over time games with deadlines |
| 28.01.2021 | online | Tamme Emunds, RWTH Aachen | Capacity calculation of track infrastructure at railway junctions |
| 21.01.2021 | online | Katharina Eickhoff, RWTH Aachen | Integer Programming Formulations for the Burning Number Problem |
| 14.01.2021 | online | Andreas Abels, Bonn U | Knapsack Secretary Through Boosting |
| 03.12.2020 | online | Franziska Eberle, Bremen U | Fully Dynamic Knapsack Problems |
| 19.11.2020 | online | Barbara Schwarzwald, Bonn U | On Discrete and Continuous Firefighting |
| 12.11.2020 | online | Elisa Iacomini, RWTH Aachen | Mathematical models for traffic flow and Stop-and-Go waves |
| 05.11.2020 | online | Daniel Schmand, Frankfurt U | Strategic Payments in Financial Network |
| 29.10.2020 | online | Lukas Graf, Augsburg U | Instantaneous Dynamic Equilibrium |
| 22.10.2020 | online | Tim Oosterwijk, Maastricht U | The Secretary Problem with Independent Sampling |
| 14.10.2020 | online | Luisa Ackermann, RWTH Aachen | Ein regulierter Auktionsmarkt für Überkreuz-Nierenspenden |
| 08.10.2020 | online | Marc Schröder, RWTH Aachen | Congestion games with altruistic/spiteful players |
| 01.10.2020 | online | Neil Olver, LSE | Nash Flows over Time with Depature Time Choice / with Scheduling Costs |
| 03.09.2020 | online | Theresa Ziemke, TU Berlin | Flows Over Time as Continuous Limits of Packet-Based Network Simulations |
| 20.08.2020 | online | Ulrike Schmidt-Kraeplin, TU Berlin | Popular Branchings and Their Dual Certificates |
| 16.07.2020 | online | Jannik Matuschke, KU Leuven | Rounding Assignment LPs for Load-Balancing in Scheduling and Beyond |
| 09.07.2020 | online |
Christoph Hertrich, TU Berlin |
Theoretical Aspects of Neural Networks for Solving Combinatorial Optimization Problems |
| 02.07.2020 | online | Oliver Antons, RWTH Aachen | Scheduling approaches in a job-shop setting |
| 25.06.2020 | online | Dennis Fischer, RWTH Aachen | Recoverable Robust Matchings |
| 18.06.2020 | online | Patricia Häuser, RWTH Aachen | Single Machine Scheduling with Learning and Forgetting Effects |
| 18.06.2020 | online | Stephan Zieger, RWTH Aachen | Operating Concepts for Highly Automated and Autonomous Rail Vehicles in Rural Areas |
| 12.06.2020 | online | Niklas Rieken, RWTH Aachen | The Primal-Dual Greedy Algorithm for Weighted Covering and Packing Problems |
| 04.06.2020 | online | Martin Comis, RWTH Aachen | Robust strategic planning for mobile medical units with unsteerable demands |
| 19.05.2020 | online | Marc Schröder and Laura Vargas Koch, RWTH Aachen | The Greedy Dagstuhl and the Greedy Oberwolfach Problem |
| 14.05.2020 | online | Tabea Krabs, RWTH Aachen | Minimum Color-Degree Perfect b-Matching Problem |
| 30.04.2020 | online | David Kuntz, RWTH Aachen | Sorting Algorithms in Sports: An Analysis of Innovative Tournament Systems |
| 11.12.2019 | B227 | Felix Hommelsheim, TU Dortmund | Flexible Graph Connectivity: Approximating Network Design Problems Between 1- and 2-connectivity |
| 06.12.2019 | B227 | Marc Schröder, RWTH Aachen | Scheduling Games with Machine-Dependent Priority Lists |
| 19.11.2019 | B227 | Björn Tauer, RWTH Aachen | Waiting for Trains: Complexity Results |
| 11.10.2019 | B227 | Oliver Antons, RWTH Aachen | Approaches to production planning and control |
| 19.09.2019 | B227 | Britta Peis, RWTH Aachen | Stable and Balanced Outcomes in Network Bargaining Games |
| 27.06.2019 | B227 | Marc Hermans, RWTH Aachen | Statistical Repositioning of Dynamic Dial-a-Ride Fleet Management in MATSim |
| 23.05.2019 | B227 | Stefan Lendl, TU Graz | The expressive power of cut functions and applications |
| 16.05.2019 | B227 | Sophia Wrede, RWTH Aachen | On the Price of Anarchy in Atomic Congestion Games under Player-Entrance-Probabilities |
| 09.05.2019 | B227 | Jonas Aberle, RWTH Aachen | Algorithmische Optimierung des Nierenaustausches auf Basis der Gallai-Edmonds-Dekomposition bei Hinzunahme eines externen Spenders |
| 02.05.2019 | B227 | Niklas Rieken, RWTH Aachen | Network Pricing Games with Atomic Splittable Followers |
| 26.03.2019 | B227 | Mirjam Kirchner, Lancaster | TBA |
| 07.02.2019 | B227 | Laura Vargas Koch, RWTH Aachen | Atomic Splittable Nash flows over time |
| 19.12.2018 | B227 | Anisse Ismaili, Kyushu | On Sequential Routing Games |
| 16.10.2018 | B227 | Pieter Kleer, CWI |
Tight Inefficiency Bounds for Perception-Parameterized Affine Congestion Games |
| 09.10.2018 | B227 | Janosch Fuchs, RWTH Aachen |
The 3-Color Reconfiguration Problem on Paths |
| 02.10.2018 | B227 |
Britta Peis, |
Matroid Bases with Cardinality Constraints on the Intersection |
| 07.08.2018 | B227 | Marc Schröder, RWTH Aachen |
Stochastic Atomic Congestion Games |
| 26.06.2018 | B227 |
Leon Sering, |
Nash Flows with Spillback |
| 19.06.2018 | B227 | Tim Oosterwijk, Universidad de Chile |
The Price of Anarchy of Flows over Time |
| 12.06.2018 | B227 | Veerle Tan-Timmermans, RWTH Aachen |
Equilibrium Computation in Atomic Splittable Polymatroid Congestion Games |
| 29.05.2018 | B227 | Theresa Thunig, TU-Berlin |
Simulating and analyzing autonomous taxis in the agent-based transport simulation MatSim -- an overview about existing work |
| 08.05.2018 | B227 | WIlhelm Kramer, RWTH Aachen |
Design Premises for Local Energy Markets |
|
10.04.2018 |
B227 | Martin Groß, RWTH Aachen |
General Bounds for Incremental Maximization |
| 28.02.2018 | B227 |
Vipin Ravindran Vijayalakshmi, |
Bounding the Inefficiency of Equilibria in Congestion Games under Taxation |
| 06.02.2018 | B227 | Marc Schröder, RWTH Aachen |
Waiting in the queue on Hotelling's Main Street |
| 30.01.2018 | B227 | Laura Vargas Koch, RWTH Aachen |
Competitive packet routing with edge priorities |
| 19.12.2017 | B227 | Andreas Wierz, RWTH Aachen |
TBA |
| 12.12.2017 | B227 | Britta Peis, RWTH Aachen |
Sensitivity analysis for conver optimisation over polymatroids with applications to game theory |
| 28.11.2017 | B227 | Daniel Schmand, RWTH Aachen |
The Benefit of Concurrent Employment |
| 20.11.2017 | B259 | Matthias Walter, RWTH Aachen |
Extension Complexities of Radial Cones for Matchings, T-Joins and T-Cuts |
| 14.11.2017 | B227 | Fabian Mies, RWTH Aachen |
Blending robust and stochastic optimization of two-stage problems |
| 09.11.2017 | B227 | Max Lohove, RWTH Aachen |
The performance of Online Dial-a-Ride Algorithms Under Real-Life Industrial Data Based on an Implementation in Python |
| 07.11.2017 | B201 | Marc Schröder, RWTH Aachen |
Network Pricing: How to Induce Optimal Flows under Strategic Link Operators |
| 25.10.2017 | B 227 | Rebecca Reiffenhäuser, RWTH Aachen |
Puppy Happiness - On Truthful Approximability for the Online Assignment Problem |
| 23.10.2017 | B 227 |
Björn Tauer, |
Suppose I own 100 sports cars.. |
| 17.10.2017 | B 227 | Martin Leuermann, RWTH Aachen |
Empty-Car Routing Policies in Car Sharing Systems Based on Fluid-Dynamics Modelling |
| 27.06.2017 | B 227 | Daniel Schmand, RWTH Aachen |
Network Design Games with Bandwidth Competition and Selfish Followers. |
| 27.06.2017 | B 227 | Benedict Kruti, RWTH Aachen |
Mathematical Model and Algorithm for Dependent Requirements Planning of Mass Customized Products. |
| 22.06.2017 | B 227 |
David Kuntz, |
Planung der Spielreihenfolge bei einem Turnier mit zwei K.O.-Bäumen: Eine Analyse am Beispiel Tischtennis. |
| 16.05.2017 | B 227 |
Daniel Schmand, |
Randomized One Round Best Response in (weighted) Linear Congestion Games |
| 18.04.2017 |
B 227 |
Daniel Schmand, |
Approximation von sozialen Optima in (gewichteten) Congestion Games |
| 12.04.2017 | B 227 | Veerle Timmermans, Maastricht University |
Equilibrium Computation in Atomic Splittable Singleton Congestion Games |
| 10.04.2017 | B 227 |
Irina Zettelmeyer, |
Analyse und Modellierung eines Shared-Taxi-Problems |
| 30.03.2017 | B 227 |
Martin Frohn, |
Approximation linearer Ordnungen durch Seriation |
| 28.03.2017 | B 227 | Michael Krause, RWTH Aachen |
Sensitivity analysis for core allocations in convex cooperative games |
| 08.03.2017 | B 227 | Jannick Matuschke, TU München |
Parametric Shortest Paths in Planar Graphs |
| 06.03.2017 | B 227 | Warren Volk-Makarewicz, RWTH Aachen |
A Reconceptualization of Agent-Based Models |
| 03.03.2017 | B 227 | Adrian Hasse, RWTH Aachen |
Color Batching Problem |
| 09.02.2017 | B 227 | Vera Weil, RWTH Aachen |
Wenn wir Graphen fair-ben möchten |
| 15.12.2016 | B 227 | Tim Hartmann, RWTH Aachen |
Mehr als P und NP |
| 08.12.2016 | B 227 |
Britta Peis, |
submodulare Funktionen und Spiele |
| 01.12.2016 | B 227 | Oliver Schaudt, Universität zu Köln |
Listenfärbungen von H-freien Graphen |
| 24.11.2016 | 4017 | Björn Tauer, RWTH Aachen |
Der Einfluss verschiedener Koordinationsmechanismen auf das Competitive Packet Routing Spiel |
| 03.11.2016 | B 227 | Daniel Schmand, RWTH Aachen |
Falsche Beweise II |
| 26.10.2016 | B 227 | Daniel Schmand, RWTH Aachen |
Falsche Beweise |
| 19.10.2016 | B 227 | Ervin Hoxhallari, RWTH Aachen |
Ladestationsplanung für Elektrofahrzeuge |
| 13.10.2016 | 4017 | Janosch Fuchs, RWTH Aachen |
Nichts kennen, nichts wissen, aber mit Advice alles schnellstmöglich finden |
| 07.10.2016 | B 227 | Andreas Wierz, RWTH Aachen |
Primal-Duale Algorithmen: Die zwei Polyeder |
| 04.10.2016 | 4017 | Stefan Braun, RWTH Aachen |
Air-Holding und Ground-Holding im Air Traffic Management Problem |
| 04.10.2016 | 4017 | Robin Stenzel, RWTH Aachen |
Design und Analyse von Allokationsalgorithmen mit zusätzlichen Budgetbeschränkungen |
| 29.09.2016 | B 227 | Jan Bierboms, RWTH Aachen |
Monotonie von Scheduling Algorithmen |
| 22.06.2016 | B 227 | Thomas Otten, RWTH Aachen |
Robuste Flüsse in Planaren Graphen |
| 15.06.2016 | B 227 | Fabian Mies, RWTH Aachen |
Uncertainty in Network Flows |
| 08.06.2016 | B 227 | Corinna Gottschalk, RWTH Aachen |
Wie Gao hilft Touren zu verbessern |
| 23.05.2016 | B 227 | Oliver Schaudt, Universität zu Köln |
Auf Möwen schießen: Das Cluster Vertex Deletion Problem |
| 12.05.2016 | B 227 | Andreas Tönnis, RWTH Aachen |
Sekretäre bleiben nicht ewig |
| 02.05.2016 | B 227 | Stefan Braun, RWTH Aachen |
Was tun bei überlasteten Lufträumen? |
| 27.04.2016 | B 227 | Corinna Gottschalk, RWTH Aachen |
Posets machen (fast) alles schwieriger: Von Matroiden und Budgets |
| 17.03.2016 | B 227 | Daniel Schmand, RWTH Aachen |
Stackelberg und Wardrop, oder: Der gesellschaftliche Schaden von Monopolen |
| 21.01.2016 | B 227 | Paresh Nakhe, MPI Saarbrücken |
Exploitation optimiziation: Robbing a group of bandits |
| 20.01.2016 | B 227 | Christian Glaser, RWTH Aachen |
Über das Tauschen von Nieren |
| 21.12.2015 | B 227 | Thomas Kesselheim, Max-Planck-Institut für Informatik |
Algorithms against Anarchy |
| 14.12.2015 | B 227 | Rebecca Reiffenhäuser, RWTH Aachen |
Über Bäume und die Ehrlichkeit |
| 08.12.2015 | B 227 | Vera Weil, RWTH Aachen |
Wenn der Maximalgrad sauer ist, weil die Clique ihn nicht schießen lässt |
| 30.11.2015 | B 227 | Andreas Wierz, RWTH Aachen |
Irgendwas über Flüsse |
| 11.11.2015 | B 227 | Laura Vargas-Koch, RWTH Aachen |
Wir analysieren zusammen die Ineffizienz von Competitive Routing Games! |
| 21.10.2015 | B 227 | Daniel Schmand, RWTH Aachen |
Wie Unsicherheit zu (erwarteter) Effizienz führt |
| 19.8.2015 | B 227 | Oliver Schaudt, Universität zu Köln |
Alles muss raus: Einheitspreise in Stackelbergspielen revisited |
| 28.5.2015 | B 227 | Oliver Göbel, RWTH Aachen |
Sekretäre mieten |
| 13.5.2015 | B 227 | Andreas Tönnis, RWTH Aachen |
Warum warte ich beim Arzt immer so lange? |
| 06.5.2015 | B 227 | Andreas Wierz, RWTH Aachen |
Die Berechnung des perfekten Zeitpunkts zur Umsiedlung |
| 15.4.2015 | B 227 | Daniel Schmand, RWTH Aachen |
Über die Probleme eines Diktators in Congestion Games |
| 10.3.2015 | B 227 | Jan Goedgebeur, Universiteit Gent |
Finding minimal obstructions to graph coloring through graph enumeration |
| 04.3.2015 | B 227 | Vera Weil, Universität zu Köln |
Graphen, in denen der Abstand zwischen dem Maximalgrad und der Cliquenzahl beschränkt ist |
| 20.1.2015 | B 227 | Theresa Thunig, Technische Universität Berlin |
Tempolimits zur Beschleunigung von Verkehr |
| 20.12.2015 | B 227 | Matthias Feldotto, Universität Paderborn |
Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria |
| 15.12.2014 | B 227 | Andreas Tönnis, RWTH Aachen |
A Funny PTAS for Multiunit Auctions (Teil 2) |
| 08.12.2014 | B 227 | Andreas Wierz, RWTH Aachen |
Sicheres Routing over time trotz unbekannter Staustellen |
| 01.12.2014 | B 227 | Corinna Gottschalk, RWTH Aachen |
Constrained maximization of interesting functions |
| 07.11.2014 | B 201 | Kazuo Murota, Tokyo Metropolitan University |
Auction Theory and Discrete Convex Analysis |
| 03.11.2014 | B 227 | Julia Buwaya, RWTH Aachen |
Calibration of agent-based simulations using a game-theoretic model |
| 23.10.2014 | B 227 | Andreas Tönnis, RWTH Aachen |
A Funny PTAS for Multiunit Auctions |
| 30.06.2014 | B 201 | Tom McCormick, Sauder School of Business, UBC, Canada |
Supply Chain Management and Discrete Convexity |
| 18.06.2014 | B 201 | Karthik Chandrasekaran, Harvard University |
Finding a most biased coin with fewest flips |
| 14.04.2014 | B 201 | Jannik Matuschke, Departamento de Ingenieria Industrial de Universidad de Chile |
Strong LP formulations for scheduling splittable jobs on unrelated machines |
| 17.03.2014 | B 201 | Frauke Liers, Universität Erlangen-Nürnberg |
Verallgemeinertes quadratisches Assignment - Strukturanalyse und Lösungsmethoden |
| 29.01.2014 | SG 12 | Ulrich Faigle, Mathematisches Institut, Köln |
Vector space methods in cooperative game theory |
| 14.01.2014 | E3-009 | Tom McCormick, Sauder School of Business, UBC, Canada |
Discrete Newton Algorithms for Budgeted Network Problems |
| 30.10.2013 | B 201 | Tobias Harks, Operations Research Group, Maastricht University |
Complexity and Approximation of the Continuous Network Design Problem |