Sidebar
Informal Algorithms Seminar
Room: In the current semester, the seminar takes place in room 2.050!
| Date | Name | Topic |
|---|---|---|
| 4.10.2019 11:00 | Dennis Rohde (TU Dortmund) | Random projections and sampling algorithms for clustering of high-dimensional polygonal curves |
| 2.10.2019, 9:00-12:45 | Presentations BSc students “Project Group Computational Geometry” | |
| | Dennis Rohde (TU Dortmund) | Random projections and sampling algorithms for clustering of high-dimensional polygonal curves |
| 18.09.2019, 10:15 | Ioannis Psarros | Near-Neighbor Preserving Dimension Reduction for Doubling Subsets of l_1 |
| 04.09.2019, 10:15 | Ioannis Psarros | The VC Dimension of Metric Balls Under Fréchet and Hausdorff Distances |
| 19.06.2019, 9:30 | Thomas Kesselheim | Posted Pricing and Prophet Inequalities with Inaccurate Priors |
| 23.05.2019 10:15 | Abhirup Ghosh (University of Edinburgh, UK) | Topological Signatures for Fast Mobility Analysis |
| 21.05.2019 10:15 | Aniket Basu Roy (LIRMM, Montpellier, France) | Effectiveness of Local Search for Geometric Packing and Covering Problems |
| 10.04.2019, 9:30 | Matteo Ceccarello (IT University and BARC Copenhagen, Denmark) | Solving k-center Clustering (with Outliers) in MapReduce and Streaming, almost as Accurately as Sequentially |
| 22.03.2019, 11:00 | Shahrzad Haddadan (University of Rome, Sapienza, Italy) | Random walks and their application in exploring networks and ranking objects |
| 20.03.2019, 14:00 | Hendrik Fichtenberger | The k-disk Connection: Local Knowledge is Sublinear Power |
| 15.03.2019, 14:15 | Hee-Kap Ahn (POSTECH, Pohang, South Korea) | Maximizing Dominance in the Plane and its Applications |
| 13.03.2019, 11:30 | André Nusser (MPI Informatik, Saarbrücken, Germany) | Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance |
| 20.02.2019, 11:30 | Alperen Ergür (TU Berlin, Germany) | Average and Smoothed Analysis of Plantinga-Vegter Algorithm |
| 15.01.2019, 15:00 | Jens M. Schmidt (TU Ilmenau, Ilmenau, Germany) | Computing Vertex-Disjoint Paths in Large Graphs using MAOs |
| 19.12.2018, 14:00 | Anup Bhattacharya | Approximate Clustering with Same-cluster Queries |
| 12.12.2019, 14:00 | Ioannis Psarros (National & Kapodistrian University of Athens, Greece) | Products of Euclidean metrics and applications to proximity questions among curves |
| 14.11.2018, 14:00 | Tomás Toufar (Charles University, Prague, Czech Republic) | Theoretical and practical aspects on Steiner tree approximations |
| 10.10.2018, 14:00 | Erik Jan van Leeuwen (Utrecht University, Utrecht, The Netherlands) | Approximation and parameterized algorithms in computational geometry |
| 11.09.2018, 12:00 | | cancelled |
| 10.07.2018, 12:00 | Andreas Tönnis | SUPERSET: A (Super)natural Variant of the Card Game SET |
| 03.07.2018, 12:00 | Danny Hermelin (Ben-Gurion University of the Negev, Be'er Sheva, Israel) | New lower bounds for the bicriteria shortest path problem |
| 28.06.2018, 10:00 | Andreas Feldmann (Charles University, Prague, Czech Republic) | Fixed-parameter approximation schemes for directed Steiner network problems |
| 26.06.2018, 12:00 | Clemens Rösner | Privacy preserving clustering with constraints |
| 13.06.2018, 10:00 | Melanie Schmidt | Clustering with constraints |
| 15.05.2018, 12:00 | Alexander Göke | Deleting long cycles in directed graphs |
| 08.05.2018, 12:00 | Thomas Kesselheim | Prophet inequalities and posted prices for stochastic combinatorial optimization |
| 24.04.2018, 12:00 | Matthias Mnich | A time- and space-optimal algorithm for the many-visits TSP |
How To Talk
If you would like to give a talk, add a line to the above table and enter your talk time, your name and your talk title. In SoSe 2018, the standard time is on Tuesdays, 12.00. In WS 18/19, the standard time will be Wednesday, 14.00. In the following semester, one standard time will be Wednesday, 9.30..
The talk length is 25-45 minutes.
The above table is mostly for coordination purposes and for people who want to look up future talks. In addition, every speaker should announce her/his talk via email to inform those who do not regularly check this page.
Next Semester
We have reserved a room for talks to be scheduled on Wednesdays, 9.30-10!
Non-standard times
The standard talk times are chosen to minimize conflicts. If, however, your talk can not be scheduled at the standard time, you may use the following table at your convenience. This table is for WS18/19! All: Please correct any errors in the table and add missing information to improve the talk scheduling. For example, most of the tutorial times are missing. Underlined entries block room 2050.
| Time | Monday | Tuesday | Wednesday | Thursday | Friday |
|---|---|---|---|---|---|
| 8-10 | |||||
| 10-12 | Logik und diskrete Strukturen (RK) Seminar 1217 (HR, MS) | Cluster Analysis (MS) | Advanced Algorithms (NB) Algorithms and Uncertainty, Ü (TK) | Algorithms and Uncertainty, Ü (TK) Logik und diskrete Strukturen (RK) | |
| 12-14 | Rand. und appr. Alg. (HR) | Algo. u. Ber. I (EL) | Rand. und appr. Alg. (HR) Cluster Analysis, Ü (CR) | Rand. und appr. Alg., Ü (AG) | |
| 14-16 | Advanced Algorithms (NB) | Algorithms and Uncertainty (TK) | STANDARD TALK TIME! | Algorithms and Uncertainty (TK) | Cluster Analysis, Ü (CR) |
| 16-18 | Rand. und appr. Alg., Ü (AT) |