Research Departments Algorithms and Complexity Teaching Algorithms and Data Structures Algorithms and Data Structures Core Course, 4+2 Basic Information Lectures: Monday + Wednesday, 16:15 - 18:00, E1 [...] 29: Subset Sum AlgorithmAlgorithms and Data Structures Theory of Distributed Systems Grundzüge von Algorithmen und Datenstrukturen Ideen und Konzepte der Informatik Reading Group Algorithms [...] Structures (hashing, union-find, etc.), graph algorithms (shortest path, matching, flow, etc.), optimization techniques (divide-and-conquer, approximation algorithms, etc.), analysis techniques (amortized analysis
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
Marvin %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics [...] Quentin %A van Wijland, Ernest %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics [...] Eva %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and
Research Departments Algorithms and Complexity Teaching Winter 2022/23 Teaching - Winter 2022/23 Randomized Algorithms and Probabilistic Analysis of Algorithms Advanced Course (2+1). Lecturer: Philip Wellnitz [...] Dozenten: Kurt Mehlhorn und Corinna Coupette more Randomized Algorithms and Probabilistic Analysis of Algorithms Approximation Algorithms Ideen und Konzepte der Informatik [...] Wellnitz Tutor: Baris Can Esmer more Approximation Algorithms Advanced Course (2+2). Lecturer: Joachim Spoerhase Teaching Assistant: Martin Herold more Ideen und Konzepte der Informatik Veranstaltung für
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
Sublinear Algorithms Advanced Course (2+1). Given by: Karl Bringmann and Vasileios Nakos more Computational Geometry Optimization Parameterized Algorithms Reading Group Algorithms Sublinear Algorithms [...] Lecturer: Andreas Karrenbauer. more Parameterized Algorithms Advanced Course (2+1). Given by: Pranabendu Misra and Dániel Marx more Reading Group Algorithms Seminar (2+0). Given by: Bhaskar Ray Chaudhury [...] Research Departments Algorithms and Complexity Teaching Summer 2020 Summer Semester 2020 Computational Geometry Advanced Course (3+1). Given by: Sándor Kisfaludi-Bak and Raimund Seidel more Optimization
Research Departments Algorithms and Complexity Offers Postdoc Position: ERC SYSTEMATICGRAPH project Postdoc positions are available at the Algorithms & Complexity group of the Max Planck Institute for [...] search for tractable algorithmic graph problems into a systematic and methodological framework: instead of focusing on specific sporadic problems, we intend to obtain a unified algorithmic understanding by [...] admit efficient algorithms and proves that all the other cases are computationally hard. Achieving such a complete understanding for a family of problems requires the joint effort of algorithm design (to identify
External Organizations External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T EFX [...] Conference Proceedings %A Akrami, Hannaneh %A Rathi, Nidhi %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Achieving [...] Conference Proceedings %A Akrami, Hannaneh %A Rathi, Nidhi %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Epistemic
Research Departments Algorithms and Complexity Teaching Summer 2021 Geometric algorithms with limited resources Geometric algorithms with limited resources Advanced Course, 2+1 Basic Information Lectures: [...] types of resource restrictions, such as property testing, sublinear algorithms, constant workspace algorithms, and the usual algorithmic design techniques used in these settings. These allow one to make [...] computational hardness: approximation, moderately exponential-time, and parameterized algorithms (external) Geometric algorithms with limited resources Optimization
5719 Departments ALGO Algorithmic Game Theory Approximation Algorithms Fine-Grained Complexity and Algorithm Design Graph Algorithms Optimization Parameterized and Counting Algorithms and Complexity Robust [...] Research Departments Algorithms and Complexity Research Algorithmic Game Theory Algorithmic Game Theory In the problems we consider in this group, we usually try to optimize some goal function while dealing [...] and conflicting goals, and that may lie to us in order to improve their own goal function. In algorithmic mechanism design, we ensure that it is in the best interest of the agents to tell us the truth
