- Routenplanung
- Problemkern-Reduktion
- Graphalgorithmen
- Fehlertoleranz
 |
 M.Sc. Demian Hespe |
|
|
Raum: 210 Tel.: +49 721 608-45270 Fax: +49 721 608-43088 hespeKfb5∂kit edu |
|
|
Forschungsschwerpunkte
Software
KaMIS - Karlsruhe Maximum Independent Sets
WeGotYouCovered - Der "Vertex Cover"-Löser, der den PACE 2019 Wettbewerb gewann
ParFastKer - Schnelle und parallele Problemkern-Reduktion für "Independent Sets"
Publikationen
Scalable Kernelization for Maximum Independent Sets.
Hespe, D.; Schulz, C.; Strash, D.
2019. Journal of experimental algorithmics, 24 (1), Article: 1.16. doi:10.1145/3355502
Hespe, D.; Schulz, C.; Strash, D.
2019. Journal of experimental algorithmics, 24 (1), Article: 1.16. doi:10.1145/3355502
Scalable Kernelization for Maximum Independent Sets.
Hespe, D.; Schulz, C.; Strash, D.
2018. ALENEX18 : Proceedings of the 20th Meeting on Algorithm Engineering & Experiments, New Orleans, Louisiana, USA, 7th - 8th January 2018. Ed.: R. Pagh, 223–237, Society for Industrial and Applied Mathematics Publications. doi:10.1137/1.9781611975055.19
Hespe, D.; Schulz, C.; Strash, D.
2018. ALENEX18 : Proceedings of the 20th Meeting on Algorithm Engineering & Experiments, New Orleans, Louisiana, USA, 7th - 8th January 2018. Ed.: R. Pagh, 223–237, Society for Industrial and Applied Mathematics Publications. doi:10.1137/1.9781611975055.19
| Titel | Autoren | Quelle | Datum |
|---|---|---|---|
| Engineering Kernelization for Maximum Cut | Damir Ferizovic, Demian Hespe, Sebastian Lamm, Matthias Mnich, Christian Schulz, Darren Strash |
Mai 2019 | |
| Fast OLAP Query Execution in Main Memory on Large Data in a Cluster | Demian Hespe, Martin Weidner, Jonathan Dees, Peter Sanders |
September 2017 | |
| More Hierarchy in Route Planning Using Edge Hierarchies | Demian Hespe, Peter Sanders |
Juli 2019 | |
| Scalable Kernelization for the Maximum Independent Set Problem | Demian Hespe, Christian Schulz, Darren Strash |
August 2017 | |
| WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track | Demian Hespe, Sebastian Lamm, Christian Schulz, Darren Strash |
August 2019 |
| Titel | Tagung | Datum |
|---|---|---|
| More Hierarchy in Route Planning Using Edge Hierarchies | ATMOS 2019 |
September 2019 |
| WeGotYouCovered - The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track (Poster) | IPEC 2019 |
September 2019 |
| WeGotYouCovered - The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track (Vortrag) | IPEC 2019 |
September 2019 |
| Practical Kernelization Techniques for the Maximum Cut Problem | The Indo-German Workshop / Spring School on Algorithms for Big Data |
Februar 2019 |
| Scalable Kernelization for Maximum Independent Sets | ALENEX 2018 |
Januar 2018 |
| Scalable Kernelization for Maximum Independent Sets | The German-Israeli Workshop / Winter School on Algorithms for Big Data |
November 2017 |
Lehre
| Titel | Typ | Semester |
|---|---|---|
| Parallele Algorithmen | Vorlesung (V) | WS 19/20 |
| Seminar: Proofs from THE BOOK | Seminar (S) | SS 2019 |
| Algorithmen II | Vorlesung (V) | WS 18/19 |
| Seminar: Proofs from THE BOOK | Seminar (S) | SS 2018 |
| Algorithmen II | Vorlesung (V) | WS 17/18 |
| Algorithm Engineering | Vorlesung (V) | SS 2017 |
| Titel | Forschungsthema | Betreuer |
|---|---|---|
| Kernelization for Independent Sets | Problemkern-Reduktion | Demian Hespe, Sebastian Lamm |
| Titel | Forschungsthema | Betreuer | Bearbeiter |
|---|---|---|---|
| A Practical Analysis of Kernelization Techniques for the Maximum Cut Problem | Problemkern-Reduktion | Peter Sanders, Demian Hespe, Sebastian Lamm, Matthias Mnich, Christian Schulz, Darren Strash |
Damir Ferizovic |
| Distributed Kernelization for Independent Sets | Verteilte Graphalgorithmen | Peter Sanders, Demian Hespe, Sebastian Lamm |
Tom George |
