Forschung Abteilungen AlgorithmsandComplexity Research Parameterized and Counting AlgorithmsandComplexity Parameterized and Counting AlgorithmsandComplexity Parameterized complexity analyzes how different [...] Algorithmic Game Theory Approximation Algorithms Fine-Grained ComplexityandAlgorithm Design Graph Algorithms Optimization Parameterized and Counting AlgorithmsandComplexity 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
Sciences, HBNI, Chennai, India. She joined the AlgorithmsandComplexity group from October 2020. Her area of research is Parameterized Complexity, Kernelization and Graph Theory. Lingjie Liu received her Ph [...] University of Rome. In May 2018 she joined the "Databases and Information Systems" group of Gerhard Weikum. Her topic is “Personalised Search and Knowledge Harvesting for Health Domain”. Jiangxin Dong received [...] Computing and AI Department) of Prof. Christian Theobalt at the Max-Planck-Institute for Informatics in Oct 2019. Her research interests include neural rendering, human performance capture and modeling
explanations for recommender systems and other machine learning models are crucial to gain user trust. Prior works that have focused on paths connecting users and items in a heterogeneous network have [...] intuitive baselines, and insights from a crowdsourced user-study demonstrate the viability of such action-based explanations. We thus posit that PRINCE produces scrutable, actionable, and concise explanations [...] actions, and minimal sets, respectively. Counterfactual Explanations for Neural Recommenders Understanding why specific items are recommended to users can significantly increase their trust and satisfaction
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
Sublinear Algorithms Advanced Course (2+1). Given by: Karl Bringmann and Vasileios Nakos mehr Computational Geometry Optimization Parameterized Algorithms Reading Group Algorithms Sublinear Algorithms [...] Forschung Abteilungen AlgorithmsandComplexity Teaching Summer 2020 Summer Semester 2020 Computational Geometry Advanced Course (3+1). Given by: Sándor Kisfaludi-Bak and Raimund Seidel mehr Optimization [...] . mehr Parameterized Algorithms Advanced Course (2+1). Given by: Pranabendu Misra and Dániel Marx mehr Reading Group Algorithms Seminar (2+0). Given by: Bhaskar Ray Chaudhury and Karl Bringmann mehr Sublinear
The simplex algorithmand 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, andcomplexity. At Saarland University these topics [...] Optimization by Dimitris Bertsimas and John N. Tsitsiklis. Computational Geometry Optimization Parameterized Algorithms Reading Group Algorithms Sublinear Algorithms
Forschung Abteilungen AlgorithmsandComplexity 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
Forschung Abteilungen AlgorithmsandComplexity 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 [...] 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 Algorithmen und
Forschung Abteilungen AlgorithmsandComplexity Teaching Summer 2020 Parameterized Algorithms Parameterized Algorithms Advanced Course, 2+1 Basic Information Lectures: (Online) Friday 2PM to 4PM at Room [...] 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 [...] - STOC 2017 [ arxiv ] Computational Geometry Optimization Parameterized Algorithms Reading Group Algorithms Sublinear Algorithms
