|Given by:||Kurt Mehlhorn, Daniel Vaz|
|Time:||Wednesday, 4:15 PM|
|First Meeting:||April, 11th|
|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 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 Daniel. Please make sure that you read the section on prerequisites above before you register.
- There will be no reading group today, April 25th.
|Apr, 11||Daniel||Introduction to the Reading Group|
|Bhaskar||Optimal Polyline Simplification under Hausdorff and Frechet distance||[Apr11]|
|Apr, 18||Daniel||Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs||[Apr18]|
|May, 2||Davis||Deciding k-colorability of P5-free graphs in polynomial time||[May02]|
|May, 9||Nitin||Arithmetic Circuits : A chasm at depth four||[May09]|
|May, 16||Andreas||Sparse Kneser graphs are Hamiltonian||[May16]|
|May, 23||André||A faster algorithm for the discrete Fréchet distance under translation||[May23]|
|May, 30||Eunjin||Dynamic Time Warping and Geometric Edit Distance: Breaking the Quadratic Barrier||[May30]|
|Jun, 6||Ben||A Distributed Algorithm for Spanning Trees||[Jun06]|
|Jun, 20||Pavel||Approximating Maximum Clique||[Jun20]|
|Jun, 27||Andreas Schmid||Generalized comparison trees for point-location problems||[Jun27]|
A Distributed Algorithm for Spanning Trees (reprise)
|Jul, 11||Max||A Friendly Smoothed Analysis of the Simplex Method||[Jul11]|
|Jul, 18||Emanuele Natale||TBA||[Jul18]|
|Jul, 25||Anna Krasilnikova||Complex brain networks: graph theoretical analysis of structural and functional systems||[Jul25]|
List of papers available for students.
|Adi Livnat, Nicholas Pippenger|
|Low-Congestion Shortcuts without Embedding||Bernhard Haeupler, Taisuke Izumi, Goran Zuzic||Christoph Lenzen|
|Joshua Grochow, Cristopher Moore||Christian Ikenmeyer|
|The 4/3 Additive Spanner Exponent is Tight||Amir Abboud, Greg Bodwin||Karl Bringmann|
|Alexander Hoyer, Robin Thomas||Daniel Vaz|
|Sparsest Cut on Bounded Treewidth Graphs: Algorithms and Hardness Results||Anupam Gupta, Kunal Talwar, David Witmer||Daniel Vaz|
|Ed Bullmore, Olaf Sporns||Günter Schmidt||X|
|Optimal Analysis of an Online Algorithm for the Bipartite Matching Problem on a Line||Sharath Raghvendra||Antonios Antoniadis|
|Saleh Soltan, Mihalis Yannakakis, Gil Zussman||Yun Kuen (Marco) CHEUNG|
|Arnold Filtser||Yun Kuen (Marco) CHEUNG|
|Georgios Piliouras, Jeff S. Shamma||Yun Kuen (Marco) CHEUNG|
|Fast fourier transforms: A tutorial review and a state of the art||Pierre Duhamel, Martin Vetterli||Attila Kinali-Dogan|