LTI
LTI

Forschungsseminar: Algorithmen und Komplexität

Allgemeine Informationen

Das vom Lehrstuhl für Algorithmen und Komplexität organisierte Forschungsseminar beinhaltet Vorträge über eigene Arbeiten, Gastvorträge, Präsentationen über aktuelle Forschung, sowie Bachelorarbeits- und Masterarbeitsvorträge.

  • Übliche Zeit:
    Donnerstag, 15 Uhr, bzw. nach Ankündigung.
  • Üblicher Ort:
    03.11.018

Zukünftige Vorträge


Vergangene Vorträge

Approximation Algorithms for Parallel Job Scheduling under Regular Maintenance Constraints
  • Speaker:
    Ömer Behic Özdemir
  • Time and place:
    November 2, 2020, 14:00pm, Online Presentation
  • Type:
    Bachelor's thesis presentation

Explorable Uncertainty in Scheduling with Non-Uniform Testing Times
  • Speaker:
    Alexander Eckl
  • Time and place:
    September 2020, Online Presentation
  • Type:
    Own work

Best Fit Bin Packing with Random Order Revisited
  • Speaker:
    Leon Ladewig
  • Time and place:
    August 2020, Online Presentation
  • Type:
    Own work

Algorithms for Matching Problems with Vertex Capacities
  • Speaker:
    Sebastian Schubert
  • Time and place:
    July 15, 2020, 14:00pm, Online Presentation
  • Type:
    Master's thesis presentation

Scheduling in the Random-Order Model
  • Speaker:
    Maximilian Janke
  • Time and place:
    June 9, 2020, Online Presentation
  • Type:
    Own work

Nearly Tight Bounds for Randomized List Update in the Paid Exchange Model
  • Speaker:
    Maximilian Janke
  • Time and place:
    March 2, 2020, 14:00pm, 03.11.018
  • Type:
    Own work

Analysis and Implementation of Algorithms for Self-Organizing Lists in the Paid-Exchange Model
  • Speaker:
    Anisa Llaveshi
  • Time and place:
    Februar 18, 2020, 14:00pm, 03.11.018
  • Type:
    Master's thesis presentation

Demand-Aware Graphs and Self-Adjusting Networks
  • Speaker:
    Stefan Schmid (University of Vienna)
  • Time and place:
    December 11, 2019, 15:00pm, 03.11.018
  • Type:
    Guest talk

New Results for the k-Secretary Problem
  • Speaker:
    Leon Ladewig
  • Time and place:
    December 04, 2019, 15:00pm, 03.11.018
  • Type:
    Own work

Latency Constrainted Shortest Paths for Virtual Network Embedding
  • Speaker:
    Robin Münk
  • Time and place:
    October 30, 2019, 14:15pm, 03.11.018
  • Type:
    Bachelor's thesis presentation

Analysis of Algorithms for Energy-Efficient Data Aggregation in Sensor Networks
  • Speaker:
    Mitja Daniel Krebs
  • Time and place:
    October 24, 2019, 16:00pm, 03.11.018
  • Type:
    Bachelor's thesis presentation

Scheduling Algorithms for Uniform Machines
  • Speaker:
    Mahmoud Elashmawi
  • Time and place:
    October 23, 2019, 14:15pm, 03.11.018
  • Type:
    Master's thesis presentation

Algorithms for power management with two server types
  • Speaker:
    Leander Schnaars
  • Time and place:
    October 2, 2019, 15:15pm, 03.11.018
  • Type:
    Bachelor's thesis presentation

Scheduling in the Random-Order Model
  • Speaker:
    Maximilian Janke
  • Time and place:
    September 26, 2019, 15:00pm, 02.09.023
  • Type:
    Own work

Algorithms for opinion formation in networks
  • Speaker:
    Matthias Kammueller
  • Time and place:
    September 18, 2019, 14:30pm, 03.11.018
  • Type:
    Bachelor's thesis presentation

Implementation and analysis of data compression algorithms based
  • Speaker:
    Marcel Kollovieh
  • Time and place:
    September 18, 2019, 14:00pm, 03.11.018
  • Type:
    Bachelor's thesis presentation

Analysis and implementation of algorithms for storyboarding
  • Speaker:
    Lukas Vogl
  • Time and place:
    August 29, 2019, 14:00pm, 03.11.018
  • Type:
    Bachelor's thesis presentation

Analysis and Implementation of Algorithms for Exploring Directed Graphs
  • Speaker:
    Tobias Ladner
  • Time and place:
    August 20, 2019, 15:00pm, 03.11.018
  • Type:
    Bachelor's thesis presentation

Improved Online Algorithms for Knapsack and GAP in the Random Order Model
  • Speaker:
    Leon Ladewig
  • Time and place:
    August 01, 2019, 15:00pm, 03.11.018
  • Type:
    Own work

Polylogarithmic Guarantees for Generalized Reordering Buffer Management
  • Speaker:
    Richard Stotz
  • Time and place:
    July 25, 2019, 15:00pm, 03.11.018
  • Type:
    Own work

Matching is as Easy as the Decision Problem, in the NC Model
  • Speaker:
    Vijay Vazirani (UC Irvine)
  • Time and place:
    July 17, 2019, 11:15am, 01.10.011
  • Type:
    Guest talk

Prophet Inequalities for I.I.D. Random Variables from an Unknown Distribution
  • Speaker:
    Kevin Schewior
  • Time and place:
    July 11, 2019, 15:00pm, 01.13.010
  • Type:
    Own work

Framework development for automated configuration of test systems in rf circuits
  • Speaker:
    Alexander Reichmann
  • Time and place:
    July 8, 2019, 11:00am, 03.11.018
  • Type:
    Master's thesis presentation

Network Creation Games
  • Speaker:
    Attakorn Putwattana
  • Time and place:
    May 20, 2019, 11:00am, 03.11.018
  • Type:
    Semester Research Project


Februar 2020: Susanne Albers ist Vorsitzende des Programmkomitees der SWAT 2020.

Februar 2020: Susanne Albers ist eingeladene Sprecherin auf dem ACM India Annual Event.

ESA/ALGO 2019 wird von Susanne Albers und ihrer Gruppe organisiert.

Juli 2019: Susanne Albers ist Festrednerin der Tagung SIROCCO 2019, Italien.

Mai 2019: Susanne Albers ist Festrednerin des Symposiums 50 Years Informatics

Dezember 2017: Susanne Albers hält Festvortrag am Tag der Informatik, Absolventenfest der RWTH Aachen.

April 2017: Neues DFG Graduiertenkolleg AdONE.

Susanne Albers erhaelt ERC Advanced Grant. Pressemitteilung Bayerisches Staatsministerium f. Bildung u. Kultus, Wissenschaft u. Kunst.

August 2016: Susanne Albers hält einen Plenarvortrag auf Euro-Par 2016, Grenoble.

Susanne Albers, Nicole Megow und Andreas S. Schulz organisieren MAPSP 2017.

Juni 2016: Susanne Albers hält einen eingeladenen Vortrag in der Akademie der Wissenschaften und der Literatur, Mainz.

September 2015: Susanne Albers ist eingeladene Sprecherin auf dem MPI-INF – 25th Anniversary. Vortragende im Programm sind mehrere Turing-Preisträger, Leibniz-Preisträger, Humboldt-Preisträger und Gewinner von ERC Grants.

Juni 2015: Susanne Albers hält einen Plenarvortrag auf dem 31st International Symposium on Computational Geometry (SOCG15), Eindhoven.

Juni 2015: Susanne Albers ist eingeladene Sprecherin des Tutorials Network Creation Games: How Does the Internet Form?, organisiert von Erik D. Demaine (MIT) und MohammadTaghi Hajiaghayi (University of Maryland). 16th Conference on Electronic Commerce (EC15), Portland, Oregon.

Lehrstuhl für Algorithmen und Komplexität
Prof. Dr. Susanne Albers

Boltzmannstr. 3
85748 Garching bei München

Tel +89.289.17706
Fax +89.289.17707

E-Mail
Aktuelles