Search

for the lectures and tutorials, please send us an email. Description Computational geometry considers problems with geometric input, and its goal is to design efficient algorithms and to study the com [...] Research Departments Algorithms and Complexity Teaching Summer 2020 Computational Geometry Computational Geometry Advanced Course, 3+1 Basic Information Lectures: Tuesday 10:00-12:00, Odd week Thursday [...] Exam: Take-home (can be done virtually) Prerequisites: Basics of data structures, algorithms, computational complexity, and linear algebra Announcements All students should subscribe to the mailing list at

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 Teaching Summer 2020 Sublinear Algorithms Sublinear Algorithms Advanced Course Basic Information Lectures: Thursday, 16:15 - 18:00 Lecturer: Karl Bringmann [...] can design non-trivial and meaningful algorithms. In this course, we will learn how to design and analyze sublinear algorithms. Regarding space, we will focus on streaming algorithms, regarding time, we will [...] assume mathematical maturity and comfort with basic probability theory. We also assume basic knowledge in algorithms. Therefore, required prerequisite is a basic lecture in algorithms (such as "Grundzüge von

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 [...] Cristi and Tim Oosterwijk Pieter Kleer No A Local-Search Algorithm for Steiner Forest Martin Groß, Anupam Gupta, Amit Kumar and Jannik Matuscke Corinna Coupette No Computation of Hadwiger Number and Related [...] Network Decomposition and Distributed Derandomization Václav Rozhoň, Mohsen Ghaffari Computational Geometry Optimization Parameterized Algorithms Reading Group Algorithms Sublinear Algorithms

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 [...] Tutorials: Wednesdays before class and Thursdays after class Credits: 9 Prerequisites: Basics in linear algebra, discrete mathematics, calculus, algorithms, and complexity. At Saarland University these topics [...] Optimization by Dimitris Bertsimas and John N. Tsitsiklis. Computational Geometry Optimization Parameterized Algorithms Reading Group Algorithms Sublinear Algorithms

Sublinear Algorithms Advanced Course (2+1). Given by: Karl Bringmann and Vasileios Nakos more Computational Geometry Optimization Parameterized Algorithms Reading Group Algorithms Sublinear Algorithms [...] 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 [...] . 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 and Karl Bringmann more Sublinear

discriminative when it comes to algorithm design. Other key dimensions are covered within each sub-topic: like the complexity of questions addressed, and degrees of explainability and interactivity introduced [...] processing, and machine learning will be helpful. Additional knowledge of probability and statistics, linear algebra, and optimization techniques is reocmmended, but not absolutely necessary. Exams and eligibility [...] each paper discussed in the lecture ( after the lecture), and comment on their advantages and disadvantages. Assignments will be individual and group work will not be allowed. Assignment grades will contribute

Lingni and Ye, Yuting and Hong, Fangzhou and Guzov, Vladimir and Jiang, Yifeng and Postyeni, Rowan and Pesqueira, Luis and Gamino, Alexander and Baiyya, Vijay and Kim, Hyo Jin and Bailey, Kevin and Fosas [...] Head-Mounted Device}, AUTHOR = {Guzov, Vladimir and Jiang, Yifeng and Hong, Fangzhou and Pons-Moll, Gerard and Newcombe, Richard and Liu, C. Karen and Ye, Yuting and Ma, Lingni}, LANGUAGE = {eng}, PUBLISHER = [...] {D}ataset and Method for Intuitive Physics Guided Human-object Interaction}, AUTHOR = {Zhang, Xiaohan and Bhatnagar, Bharat Lal and Starke, Sebastian and Petrov, Ilya A. and Guzov, Vladimir and Dhamo, Helisa

Research Departments Algorithms and Complexity Teaching Winter 2019/20 Ideen und Konzepte der Informatik, eine Videovorlesung Ziele Wir verfolgen drei Ziele: Die Hörer sollen mit den Grundbegriffen der [...] sich auch im Semesterapparat der Informatikbibliothek. Ideen und Konzepte der Informatik Optimization and Entrepreneurship Theory of Distributed Systems Topics in Fair Division

CoCo-Beholder: Enabling Comprehensive Evaluation of Congestion Control Algorithms" in 2019 under the supervision of Professor Anja Feldmann and Dr. Corinna Coupette. Download: https://github.com/ZhenyaKh/coc [...] Architecture Software CoCo-Beholder CoCo-Beholder: Highly-Customizable Testing of Congestion Control Algorithms Published: 2019 Author: Evgeniya Khasina Description: CoCo-Beholder is a human-friendly virtual [...] popular dumbbell topology of any size. Each link of the topology may have individual rate, delay, and queue size. The central link may also have a variable delay with optional jitter. Flows of different