Please note that on 11.3., the entire Saarland university has postponed the start of the semester by 4 weeks. This also affects this course. We will update the information below as soon as we can.
|Given by:||Karl Bringmann, Bhaskar Ray Chaudhury|
|Time:||Wednesday, 4:15 PM|
|First Meeting:||May 6|
|Credits:||7 credit points|
|Prerequisites:||You should bring a solid background in algorithms and data structures. This is an advanced seminar. The papers are challenging and a proper preparation of your talk will require some effort. Thus, you should bring a great passion for theoretical computer science. The target audience of this reading group are master students, PhD students, as well as postdocs.|
We will read (more or less) recent papers in theoretical computer science. The paper may be less recent if there is interesting follow-up work. In each session we have a regular presentation (40-60 minutes + discussion) of one paper. The reading group is open for all interested students and postdocs. Students aiming to get credit points must give a regular talk and write a short summary about the paper.
You earn the usual 7 credit points for a seminar if you (i) give a regular presentation of the paper given to you, and (ii) write a short summary (about 5 pages). The summary should be handed in within the first two weeks after the end of the semester, more precisely until tba (around August, 15th). You will receive comments and can improve your summary based on our comments. The presentation needs to be discussed with us at least one week before your scheduled talk in the reading group (you are supposed to give a practice talk to your supervisor).
The reading group counts as a seminar in your study program. You can register by sending an e-mail to Bhaskar. Please make sure that you read the section on prerequisites above before you register.
- The seminar will most likely be virtual. Talks will be given on standard teleconference systems such as Zoom. In exceptional cases of unstable internet connection, it is also possible to record your talk and submit a video.
- The Zoom URL for the nineth meeting (on 1st July): https://cs-uni-saarland-de.zoom.us/j/98670829152
|May 6||Bhaskar |
Introduction to the Reading Group
Finding Fair and Efficient Allocations
|May 13||Karl |
Approximating Text-to-Pattern Hamming Distances
|May 20||Pieter |
Recent Progress in the Area of Approximate Sampling and Counting
|May 27||Golnoosh |
A Strongly Polynomial Algorithm for Linear Exchange Markets
|June 3||Laszlo Kozma |
Many Visits TSP
|June 10||Pascal |
On the Price of Anarchy for Flows over Time
Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds
|June 24||Jannik |
Approximation Schemes for 0-1 Knapsack
|July 1||Saurabh |
Fully Dynamic Maximal Independent Set in Expected Poly-Log Update Time
|July 8||Shreyas |
Polylogarithmic-Time Deterministic Network Decomposition and Distributed Derandomization
|July 15||Hossein |
A Deterministic Algorithm for the MST Problem in Constant Rounds of Congested Clique
List of papers available for students.
|Paper Title / Abstract of Talk||Authors|
|[May6]||Finding Fair and Efficient Allocations||Siddharth Barman, Sanath Kumar Krishnamurthy, Rohit Vaish|
|[May13]||Approximating Text-to-Pattern Hamming Distances||Timothy M. Chan, Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat|
|[May20]||Log-Concave Polynomials II: High-Dimensional Walks and an FPRAS for Counting Bases of a Matroid||Nima Anari, Kuikui Liu, Shayan Oveis Gharan, Cynthia Vinzant|
|[May27]||A Strongly Polynomial Algorithm for Linear Exchange Markets||Jugal Garg, Laszlo Vegh|
|[Jun3]||A time- and space-optimal algorithm for the many-visits TSP||André Berger, László Kozma, Matthias Mnich, Roland Vincze|
|[Jun10]||On the Price of Anarchy of Flows over Time||Jose Correa, Andres Cristi, Tim Oosterwijk|
|[Jun17]||Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds||Fedor V. Fomin, Daniel Lokshtanov, Ivan Mihajlin, Saket Saurabh, Meirav Zehavi|
|[Jun24]||Approximation Schemes for 0-1 Knapsack||Timothy M. Chan|