Research Departments Algorithms and Complexity Teaching Winter 2018/19 Reading Group Algorithms Reading Group Algorithms Seminar Basic Information Given by: Kurt Mehlhorn , Daniel Vaz Time: Wednesday, [...] Randomized and Approximation AlgorithmsAlgorithms on Directed Graphs Theory of Distributed Systems Reading Group Algorithms [...] Polynomial Algorithm for Linear Exchange Markets (Part 2) Jugal Garg, László A. Végh Bhaskar Ray Chaudhury References Paper Title / Abstract of Talk Authors [Oct17] A Strongly Polynomial Algorithm for Linear
Research Departments Algorithms and Complexity Teaching Summer 2019 Reading Group Algorithms Reading Group Algorithms Seminar Basic Information Given by: Kurt Mehlhorn , Bhaskar Ray Chaudhury Time: (Wednesday [...] Manurangsi [Jul10] An Illuminating Algorithm for the Light Bulb Problem Josh Alman [Jul17] Separating Monotone VP and VNP Amir Yehudayoff Distributed and Sequential Graph Algorithms Fine-Grained Complexity Theory [...] Meeting: April, 10th Credits: 7 credit points Prerequisites: You should bring a solid background in algorithms and data structures. This is an advanced seminar. The papers are challenging and a proper preparation
Research Departments Algorithms and Complexity Teaching Reading Group Algorithms Reading Group Algorithms Seminar Basic Information Given by: Kurt Mehlhorn , Marvin Künnemann and Ruben Becker Time: Wednesday [...] Rothvoss [Jul27] Scaling Algorithms for Weighted Matching in General Graphs Ran Duan, Seth Pettie, Hsin-Hao Su Optimization Complexity Theory of Polynomial-Time Problems Randomized Algorithms and Probabilistic [...] c Analysis of Algorithms Mathematik für Informatiker 2 Reading Group Algorithms State of the Art Linear Programming Theory
Research Departments Algorithms and Complexity Teaching Reading Group Algorithms Reading Group Algorithms Seminar Basic Information Given by: Kurt Mehlhorn , Ruben Becker , and Emanuele Natale Time: Wednesday [...] Variables George Marsaglia, Wai Wan Tsang Optimization Approximation Algorithms Introduction to Geometric Complexity Theory Reading Group Algorithms [...] Meeting: April, 19 Credits: 7 credit points Prerequisites: You should bring a solid background in algorithms and data structures. This is an advanced seminar. The papers are challenging and a proper preparation
Research Departments Algorithms and Complexity Teaching Reading Group Algorithms Reading Group Algorithms Seminar Basic Information Given by: Kurt Mehlhorn and Ruben Becker Time: Wednesday, 4:15 PM Room: [...] Distributed Algorithm for Maximal Independent Set [Nov16] Nov, 23 Pavel Approximate Undirected Maximum Flows in O(m polylog(n)) Time [Nov23] Nov, 30 Sebastian Simple parallel and distributed algorithms for spectral [...] Distributed Algorithm for Maximal Independent Set Mohsen Ghaffari [Nov23] Approximate Undirected Maximum Flows in O(m polylog(n)) Time Richard Peng [Nov30] Simple parallel and distributed algorithms for spectral
Research Departments Algorithms and Complexity Teaching Summer 2020 Reading Group Algorithms Reading Group Algorithms Seminar Postponed by 4 weeks! Please note that on 11.3., the entire Saarland university [...] Rozhoň, Mohsen Ghaffari Computational Geometry Optimization Parameterized Algorithms Reading Group Algorithms Sublinear Algorithms [...] Gharan, Cynthia Vinzant [May27] A Strongly Polynomial Algorithm for Linear Exchange Markets Jugal Garg, Laszlo Vegh [Jun3] A time- and space-optimal algorithm for the many-visits TSP André Berger, László Kozma
Research Departments Algorithms and Complexity Teaching Summer 2018 Reading Group Algorithms Reading Group Algorithms Seminar Basic Information Given by: Kurt Mehlhorn , Daniel Vaz Time: Wednesday, 4:15 [...] Meeting: April, 11th Credits: 7 credit points Prerequisites: You should bring a solid background in algorithms and data structures. This is an advanced seminar. The papers are challenging and a proper preparation [...] four [May09] May, 16 Andreas Sparse Kneser graphs are Hamiltonian [May16] May, 23 André A faster algorithm for the discrete Fréchet distance under translation [May23] May, 30 Eunjin Dynamic Time Warping
Robert Tarjan, Uri Zwick Algorithms and Data Structures Approximation Algorithms Theory of Distributed Systems Ideen und Konzepte der Informatik Reading Group AlgorithmsAlgorithmic Lower Bound Techniques [...] Research Departments Algorithms and Complexity Teaching Reading Group Algorithms Reading Group Algorithms Seminar Basic Information Given by: Kurt Mehlhorn , Marvin Künnemann and Ruben Becker Time: Wednesday [...] Nov, 18 Daniel Vaz Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem [Nov18] Nov, 25 Erik Jan van Leeuwen Designing FPT algorithms for cut problems using randomized contractions
Research Departments Algorithms and Complexity Teaching Winter 2021/22 Reading Group Algorithms: Continuous Methods for Combinatorial Problems Reading Group Algorithms: Continuous Methods for Combinatorial [...] recent years, algorithms for convex optimization have revolutionized the design of algorithms, both for discrete as well as continuous optimization problems. At present, the fastest known algorithms for problems [...] understanding of the algorithms for convex optimization and see how they find applications in solving combinatorial optimization problems. In this seminar course, we read the book Algorithms for Convex Optimization
be sufficient to recognize the higher level composite activity and allow efficient recognition algorithms. Figure 2: Composite activity for construction Hierarchical model for composite activities Preserving [...] across different users, or the underlying activities can happen in different order. Using the same algorithms recognizing atomic activities can be suboptimal, as these require prohibitive amounts of training
