Search

The simplex algorithm and the ellipsoid method will be presented. The lecture concludes with exact and approximation algorithms for NP-hard optimization problems. There will be theoretical and practical [...] (except on May, 7 and May, 22: room 021, E1 4) Friday, 12-14, room 024, E1 4 Credits: 9 Prerequisites: Basics in linear algebra, discrete mathematics, calculus, algorithms, and complexity. At Saarland University [...] Research Departments Algorithms and Complexity Teaching Summer 2018 Optimization Optimization Core Course, 4+2 Basic Information Lecturer: Andreas Karrenbauer Lectures: Tuesday + Thursday, 14:00 - 16:00

science) Optimization Complexity Theory of Polynomial-Time Problems Randomized Algorithms and Probabilistic Analysis of Algorithms Mathematik für Informatiker 2 Reading Group Algorithms State of the Art Linear [...] Research Departments Algorithms and Complexity Teaching Optimization Optimization Core Course, 4+2 Basic Information Lecturers: Parinya Chalermsook and Andreas Wiese Teaching assistant: Sandy Heydrich [...] Approximation Algorithms, Fixed Parameter Tractable (FPT) Algorithms, and Matroid Theory. Schedule Date Topic Reference Homework Note 20 Apr Introduction Slides , Notes , [BT] Chapters 1.1 and 2.1 Assignment

Research Departments Algorithms and Complexity Teaching Winter 2019/20 Optimization and Entrepreneurship Optimization and Entrepreneurship Seminar Basic Information Given by: Andreas Karrenbauer Time: [...] throughout the semester, a final presentation, and a final report. Disclaimer: The successful participation in and grading of this seminar is separate from and unrelated to any seminar participant's choice [...] Slides Nov, 21 Polyhedra, Polytopes, and Complexity Slides Nov, 28 Modeling Slides Dec, 5 Branch & Bound Slides Literature Ideen und Konzepte der Informatik Optimization and Entrepreneurship Theory of Distributed

Research Departments Algorithms and Complexity Teaching Optimization and Entrepreneurship Optimization and Entrepreneurship Seminar Basic Information Given by: Andreas Karrenbauer Time: Tuesday, 2:15 PM [...] Wrap-Up Slides Literature Algorithms and Data Structures Approximation Algorithms Theory of Distributed Systems Ideen und Konzepte der Informatik Reading Group Algorithms Algorithmic Lower Bound Techniques [...] throughout the semester, a final presentation, and a final report. Disclaimer: The successful participation in and grading of this seminar is separate from and unrelated to any seminar participant's choice

navigation Institute D1 Algorithms & Complexity D2 Computer Vision and Machine Learning D3 Internet Architecture D4 Computer Graphics D5 Databases and Information Systems D6 Visual Computing and Artificial Intelligence [...] Departments D1 Algorithms & Complexity D2 Computer Vision and Machine Learning D3 Internet Architecture D4 Computer Graphics D5 Databases and Information Systems D6 Visual Computing and Artificial Intelligence [...] RG2 Network and Cloud Systems RG3 Multimodal Language Processing Publications Algorithms & Complexity Computer Vision and Machine Learning Internet Architecture Computer Graphics Databases and Information

Research Departments Algorithms and Complexity Teaching Summer 2020 Parameterized Algorithms Parameterized Algorithms Advanced Course, 2+1 Basic Information Lectures: (Online) Friday 2PM to 4PM at Room [...] are small. We will see several algorithmic techniques to design fast algorithms for NP-hard problems in this setting, called Fixed Parameter Tractable (FPT) algorithms , as well as an overview of the lower-bound [...] will also learn about preprocessing or data-reduction algorithms in this setting, called Kernelization algorithms , which run in polynomial time and reduce a given instance of a NP-hard problem to an equivalent

Research Departments Algorithms and Complexity Research Parameterized and Counting Algorithms and Complexity Parameterized and Counting Algorithms and Complexity Parameterized complexity analyzes how different [...] Departments ALGO Algorithmic Game Theory Approximation Algorithms Fine-Grained Complexity and Algorithm Design Graph Algorithms Optimization Parameterized and Counting Algorithms and Complexity Robust Learning [...] different parameters of the input influence the complexity of hard algorithmic problems. The general goal is to show with fixed-parameter tractability results that the combinatorial explosion can be confined

Assistant Professor Aalto University, Helsinki (after having graduated with the MPI-Inf Dep. Algorithms and Complexity, Saarbruecken, Germany) Daniel Wagner Researcher DE-CIX Management GmbH, Frankfurt, Germany [...] (Ben) Hui Professor & Director HKUST-DT System and Media Laboratory (SyMLab) at Computer Science and Engineering Department of Hong Kong University of Science and Technology, China Petr Kuznetsov Professor [...] IPInfo Reese Enghardt Internet Researcher and Engineer Netflix, USA Thorben Krüger Researcher Institut für Intelligente Kooperierende Systeme (IKS); AG Networks and Distributed Systems (Netsys) Lab at the

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

Sotnychenko Associated researchers Ayush Tewari Helge Rhodin Taku Komura Current and former Master/Diplom/Bachelor Students and Supervised Theses Hendrik Junkawitsch: EVA: Expressive Virtual Avatars from Muli-view [...] Modeling of Speech and Gesture in Multi-Person dialogue (2023). Kartik Teotia : HQ3D Avatar: High Quality Controllable 3D Head Avatar (2023). Akshay Mundra: LiveHand: Real-time and Photorealistic Neural [...] 3D human motion capture and synthesis with interactions), now Research Scientist at Netflix. Edith Tretschk , PhD in VCAI department (graduated 2024 - thesis: Representing and Reconstructing General Non-Rigid