Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
research:researchseminar [2019/01/09 12:17]
mnich
research:researchseminar [2019/06/14 08:23] (current)
mnich
Line 3: Line 3:
 **Room**: In the current semester, the seminar takes place in** room 2.078**! **Room**: In the current semester, the seminar takes place in** room 2.078**!
  
-^Date ^Name ^Topic^+^Date ^Name ^Topic^ ​ 
 +|09.07.2019,​ 10:00 | Támas Kiraly, Kristóf Bérczi, Erika Kovács-Bérczi (ELTE, Budapest, Hungary) | Talks in the Budapest-Bonn Combinatorial Optimization Collaboration | 
 +|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 | | **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 | | 19.12.2018, 14:00 | Anup Bhattacharya | Approximate Clustering with Same-cluster Queries |
Line 22: Line 32:
  
 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. ​ 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 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 talk length is 25-45 minutes.
-**Talks have to end at 14.45 because of different self-administration meetings which start at 15.15!** 
  
 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. 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 === === Non-standard times ===

Page Tools