Search

Departments ALGO Algorithmic Game Theory Approximation Algorithms Fine-Grained Complexity and Algorithm Design Graph Algorithms Optimization Parameterized and Counting Algorithms and Complexity Robust Learning [...] such problems: integer programming, fixed-parameter tractable and exact algorithms, approximation algorithms and combinatorial algorithms, among others. D1 works on applying these methods to various problems [...] Research Departments Algorithms and Complexity Research Optimization Optimization Many real world applications are naturally formulated as optimization problems, i.e., problems of finding the best solution(s)

Research Departments Algorithms and Complexity Research Fine-Grained Complexity and Algorithm Design Fine-Grained Complexity and Algorithm Design Fine-grained Complexity Theory is the design of reductions [...] Departments ALGO Algorithmic Game Theory Approximation Algorithms Fine-Grained Complexity and Algorithm Design Graph Algorithms Optimization Parameterized and Counting Algorithms and Complexity Robust Learning [...] time lower bounds assuming a plausible complexity-theoretic conjecture such as the Strong Exponential Time Hypothesis. In this area the design of efficient algorithms goes hand in hand with proving fine-grained

Desharnais (Ph.D. 2025): Formal Verification of Logical Calculi and Simulations in Isabelle/HOL Fajar Haifani (Ph.D. 2023): On a Notion of Abduction and Relevance for First-Order Logic Clause Sets Mathias Fleury [...] 2019): Decidable Fragments of First-Order Logic and of First-Order Linear Arithmetic with Uninterpreted Predicates Andreas Teucke (Ph.D. 2018): An Approximation and Refinement Approach to First-Order Automated [...] Procedures for Complex First-Order Theories Carsten Ihlemann (Ph.D. 2010): Reasoning in Combinations of Theories Matthias Horbach (Ph.D. 2010): Saturation-Based Decision Procedures for Fixed Domain and Minimal

Nico Pfeifer High-Throughput Genomics and Systems Biology (former group) (Excellence Cluster on Multimodal Computing and Interaction) Dr. Marcel Schulz Algorithms for Computational Genomics (former group) [...] Groups Research conducted under the leadership of junior group leaders Computational Biology and Applied Algorithmics Prof. Dr. Dr. Thomas Lengauer Molecular Networks in Medical Bioinformatics (former group) [...] group) Dr. Mario Albrecht Computational Epigenetics (former group) Dr. Christoph Bock and Prof. Dr. Dr. Thomas Lengauer Structural Bioinformatics of Protein Interactions (former group) Dr. Olga Kalinina S

Research Departments Algorithms and Complexity People Former Members Former Members A Abed, Fidaa Abo-Hasna, Ziad Abraham, David Adamaszek, Michal Adamaszek, Anna Afanasev, Kirill Agarwal, Manindra Agarwal

external algorithms, distributed algorithms, complexity theory, combinatorial and continuous optimization, graph drawing, on-line algorithms, randomized algorithms, computational biology and implementation [...] Departments Algorithms and Complexity Offers Offers The interests of the (around 40) research group members includes data structures, graph and network algorithms, computational geometry, parallel and external [...] Potential D1 supervisors and their availability will be listed here in due time, as well as on their personal webpages. Long Term Visits If you would like to visit the Algorithms and Complexity Group for an extended

scheduling, and several others. more More information Parameterized and Counting Algorithms and Complexity Parameterized complexity analyzes how different parameters of the input influence the complexity of hard [...] learning algorithms have many applications. Can we theoretically prove they are consistent and helpful? We focus on two paradigms: algorithmic stability and algorithms with predictions. Stable algorithms, which [...] information Fine-Grained Complexity and Algorithm Design Fine-grained Complexity Theory is the design of reductions that prove running time lower bounds assuming a plausible complexity-theoretic conjecture

Research Departments Algorithms and Complexity Teaching Teaching The members of the algorithms group of MPI-INF offer courses and thesis (bachelor, master, and PhD) topics in algorithmics. We offer the core [...] Course Course type Speaker / Tutor Algorithms and Data Structures Core Course Karl Bringmann and Philip Wellnitz Sublinear Algorithms Advanced Course Karl Bringmann and Nithin Varma Ideen und Konzepte der [...] Course type Speaker / Tutor Randomized Algorithms and Probabilistic Analysis of Algorithms Advanced Course Philip Wellnitz , Tutor: Baris Can Esmer Approximation Algorithms Advanced Course Joachim Spoerhase

is intuitive and light weight. In order to make progress along the lines above, our work is both theoretical and practical with a focus on first-class research and new methods and algorithms, as well as [...] television, digital photography and the rapid development of new sensing devices, telecommunication and telepresence, virtual and augmented reality further indicate its potential and pose new challenges in the [...] these challenges, and in particular to seamlessly blend real and synthetic footage, we have adopted a new and more integrated scientific view of computer graphics as 3D Image Analysis and Synthesis that takes

Departments Algorithms and Complexity Department 1: Algorithms and Complexity The department investigates a broad range of theoretical and practical aspects of modern algorithmics. We design new algorithms and [...] scheduling, and several others. more More information Parameterized and Counting Algorithms and Complexity Parameterized complexity analyzes how different parameters of the input influence the complexity of hard [...] learning algorithms have many applications. Can we theoretically prove they are consistent and helpful? We focus on two paradigms: algorithmic stability and algorithms with predictions. Stable algorithms, which