| Montag, 14. Juli | |
|---|---|
| 9:30 |
Jauß, Christian
Hole Detection or: "How much Geometry hides in Connectivity?" |
| 10:30 |
Weichert, Volker
An Experimental Study of A Parallel Shortest Path Algorithm for Solving Large-Scale Graph Instances |
| 11:30 |
Herborn, Nadine
Locating Guards for Visibility Coverage of Polygons |
| 13:30 |
Politoukhin, Klara
Packing a Trunk - now with a Twist |
| Dienstag, 15. Juli | |
| 9:30 |
Kilic, Selvi
To Fill or not to Fill: The Gas Station Problem |
| 10:30 |
Beck, Roman
How Branch Mispredictions Affect Quicksort |
| 11:30 |
Arslan, Serdar
Algorithms for longer OLED Lifetime |
| 14:00 |
Tas, Mahir
Algorithms to Take Advantage of Hardware Prefetching |
| Mittwoch, 16. Juli | |
| 9:30 |
Azizi, Parviz
ScrewBox: a Randomized Certifying Graph-Non-Isomorphism Algorithm |
| 10:30 |
Adamca, Richard
Improved external memory BFS implementations |
| 11:30 |
Thieme, Kristina
Better external memory suffix array construction |
| 14:00 |
Savostiyanova, Yulia
Energy-aware stage illumination |
| 15:00 |
Oruclar, Ali
Experimental Analysis of Dynamic All Pairs Shortest Path Algorithms |
| 14:00 |
Michailidis, Georgios
Faster Filters for Approximate String Matching |
| 15:00 |
Mehdizadeh Valujerdi, Karamat
In Transit to Constant Time Shortest-Path Queries in Road Networks |