Forschungsschwerpunkte
- Graph- und Hypergraphpartitionierung
- Shared Memory Algorithmen
- Succinct Data Structures
Veröffentlichungen
Multilevel Hypergraph Partitioning with Vertex Weights Revisited.
Heuer, T.; Maas, N.; Schlag, S.
2021. 19th International Symposium on Experimental Algorithms (SEA 2021), 8:1–8:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH (LZI). doi:10.4230/LIPIcs.SEA.2021.8
Heuer, T.; Maas, N.; Schlag, S.
2021. 19th International Symposium on Experimental Algorithms (SEA 2021), 8:1–8:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH (LZI). doi:10.4230/LIPIcs.SEA.2021.8
Scalable Shared-Memory Hypergraph Partitioning.
Gottesbüren, L.; Heuer, T.; Sanders, P.; Schlag, S.
2021. ALENEX 2021 : SIAM Symposium on Algorithm Engineering and Experiments. Ed.: M. Farach-Colton, 16–30, Society for Industrial and Applied Mathematics (SIAM). doi:10.1137/1.9781611976472.2
Gottesbüren, L.; Heuer, T.; Sanders, P.; Schlag, S.
2021. ALENEX 2021 : SIAM Symposium on Algorithm Engineering and Experiments. Ed.: M. Farach-Colton, 16–30, Society for Industrial and Applied Mathematics (SIAM). doi:10.1137/1.9781611976472.2
Network Flow-Based Refinement for Multilevel Hypergraph Partitioning.
Heuer, T.; Sanders, P.; Schlag, S.
2019. Journal of experimental algorithmics, 24 (1), Article: 2.3. doi:10.1145/3329872
Heuer, T.; Sanders, P.; Schlag, S.
2019. Journal of experimental algorithmics, 24 (1), Article: 2.3. doi:10.1145/3329872
Network Flow-Based Refinement for Multilevel Hypergraph Partitioning.
Heuer, T.; Sanders, P.; Schlag, S.
2018. 17th International Symposium on Experimental Algorithms (SEA), June 27-29, 2018, L’Aquila, Italy. Ed.: G. D’Angelo, 1:1–1:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH (LZI). doi:10.4230/LIPIcs.SEA.2018.1
Heuer, T.; Sanders, P.; Schlag, S.
2018. 17th International Symposium on Experimental Algorithms (SEA), June 27-29, 2018, L’Aquila, Italy. Ed.: G. D’Angelo, 1:1–1:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH (LZI). doi:10.4230/LIPIcs.SEA.2018.1
Quality Hypergraph Partitioning via Max-Flow-Min-Cut Computations. Masterarbeit.
Heuer, T.
2018. Karlsruher Institut für Technologie (KIT). doi:10.5445/IR/1000083200
Heuer, T.
2018. Karlsruher Institut für Technologie (KIT). doi:10.5445/IR/1000083200
Practical range minimum queries revisited.
Baumstark, N.; Gog, S.; Heuer, T.; Labeit, J.
2017. 16th Symposium on Experimental Algorithms (SEA 2017), London, United Kingdom, 21st - 23rd June 2017, Art. Nr.: 12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH (LZI). doi:10.4230/LIPIcs.SEA.2017.12
Baumstark, N.; Gog, S.; Heuer, T.; Labeit, J.
2017. 16th Symposium on Experimental Algorithms (SEA 2017), London, United Kingdom, 21st - 23rd June 2017, Art. Nr.: 12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH (LZI). doi:10.4230/LIPIcs.SEA.2017.12
The quantile index : Succinct self-index for top-k document retrieval.
Baumstark, N.; Gog, S.; Heuer, T.; Labeit, J.
2017. 16th Symposium on Experimental Algorithms (SEA 2017), London, United Kingdom, 21st - 23rd June 2017, Art. Nr.: 15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH (LZI). doi:10.4230/LIPIcs.SEA.2017.15
Baumstark, N.; Gog, S.; Heuer, T.; Labeit, J.
2017. 16th Symposium on Experimental Algorithms (SEA 2017), London, United Kingdom, 21st - 23rd June 2017, Art. Nr.: 15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH (LZI). doi:10.4230/LIPIcs.SEA.2017.15
Improving Coarsening Schemes for Hypergraph Partitioning by Exploiting Community Structure.
Heuer, T.; Schlag, S.
2017. 16th International Symposium on Experimental Algorithms (SEA 2017), London, UK, 21th - 23rd June 2017. Ed.: C. Iliopoulos, Art. Nr. 21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH (LZI). doi:10.4230/LIPIcs.SEA.2017.21
Heuer, T.; Schlag, S.
2017. 16th International Symposium on Experimental Algorithms (SEA 2017), London, UK, 21th - 23rd June 2017. Ed.: C. Iliopoulos, Art. Nr. 21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH (LZI). doi:10.4230/LIPIcs.SEA.2017.21
Engineering a direct k-way hypergraph partitioning algorithm.
Akhremtsev, Y.; Heuer, T.; Sanders, P.; Schlag, S.
2017. Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments (ALENEX), Barcelona, E, January 17-18, 2017. Ed.: S. Fekete, 28–42, SIAM Publ. doi:10.1137/1.9781611974768.3
Akhremtsev, Y.; Heuer, T.; Sanders, P.; Schlag, S.
2017. Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments (ALENEX), Barcelona, E, January 17-18, 2017. Ed.: S. Fekete, 28–42, SIAM Publ. doi:10.1137/1.9781611974768.3
Engineering Initial Partitioning Algorithms for direct k-way Hypergraph Partitioning. Bachelorarbeit.
Heuer, T.
2015. doi:10.5445/IR/1000063446
Heuer, T.
2015. doi:10.5445/IR/1000063446
K-way hypergraph partitioning via n-level recursive bisection.
Schlag, S.; Henne, V.; Heuer, T.; Meyerhenke, H.; Sanders, P.; Schulz, C.
2016. Proceedings of the 18th Workshop on Algorithm Engineering and Experiments 2016, ALENEX 2016, Arlington, United States. Ed.: M. Goodrich, 53–67. doi:10.1137/1.9781611974317.5
Schlag, S.; Henne, V.; Heuer, T.; Meyerhenke, H.; Sanders, P.; Schulz, C.
2016. Proceedings of the 18th Workshop on Algorithm Engineering and Experiments 2016, ALENEX 2016, Arlington, United States. Ed.: M. Goodrich, 53–67. doi:10.1137/1.9781611974317.5
| Titel | Author(en) | Quelle | Datum |
|---|---|---|---|
| Network Flow-Based Refinement for Multilevel Hypergraph Partitioning | Sebastian Schlag, Peter Sanders, Tobias Heuer |
JEA |
2019 |
| Titel | Author(en) | Quelle | Datum |
|---|---|---|---|
| Network Flow-Based Refinement for Multilevel Hypergraph Partitioning | Tobias Heuer, Peter Sanders, Sebastian Schlag |
arXiv:1802.03587 |
Februar 2018 |
| Titel | Ort | Datum |
|---|---|---|
| Recent Advances in (Hyper-)Graph Partitioning | Freiburg |
September 2019 |
| Practical range minimum queries revisited | London |
June 2017 |
| Title | Type | Semester |
|---|---|---|
| Parallele Algorithmen - Von Theorie zu Praxis | Proseminar (PS) | SS 2021 |
| Algorithmen II | Vorlesung (V) | WS 20/21 |
| Praxis der Softwareentwicklung (PSE): Hyper Wedding Seat Planner | Praktikum | SS 2020 |
| Algorithmen II | Vorlesung (V) | WS 19/20 |
| Titel | Forschungsthema | Betreuer |
|---|---|---|
| Multilevel Framework for Vertex Separator Problem in Hypergraphs | Hypergraph Partitioning | Tobias Heuer |
| Titel | Forschungsthema | Betreuer | Student |
|---|---|---|---|
| A Parallel Network Flow-Based Refinement Techinque for Multilevel Hypergraph Partitioning | Hypergraph Partitioning, Shared Memory Algorithms, Network Flows | Tobias Heuer |
Lukas Reister |
| Machine-Learning based Hypergraph Pruning for Partitioning | Hypergraph Partitioning, Machine Learning, Coarsening Algorithms | Christian Schulz Daniel Seemaier Tobias Heuer |
Tobias Fuchs |
| Multilevel Hypergraph Partitioning with Vertex Weights Revisited | Hypergraph Partitioning, Initial Partitioning, Load Balancing | Sebastian Schlag Tobias Heuer |
Nikolai Maas |
| Throughput Optimization in a Distributed Database System via Hypergraph Partitioning | Database Optimization | Sebastian Schlag |
Patrick Firnkes |