Dr. Tobias Heuer
- Herr Dr. Heuer hat unser Institut inzwischen verlassen.
- tobias heuer ∂does-not-exist.kit edu
Forschungsschwerpunkte
- Graph- und Hypergraphpartitionierung
- Shared Memory Algorithmen
- Succinct Data Structures
Publications
2022
The PACE 2022 Parameterized Algorithms and Computational Experiments Challenge: Directed Feedback Vertex Set
Großmann, E.; Heuer, T.; Schulz, C.; Strash, D.
2022. 17th International Symposium on Parameterized and Exact Computation (IPEC 2022) , Ed.: H. Dell, Art.-Nr.: 26, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (LZI). doi:10.4230/LIPIcs.IPEC.2022.26
Großmann, E.; Heuer, T.; Schulz, C.; Strash, D.
2022. 17th International Symposium on Parameterized and Exact Computation (IPEC 2022) , Ed.: H. Dell, Art.-Nr.: 26, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (LZI). doi:10.4230/LIPIcs.IPEC.2022.26
Parallel Flow-Based Hypergraph Partitioning
Gottesbüren, L.; Heuer, T.; Sanders, P.
2022. 20th International Symposium on Experimental Algorithms (SEA 2022), 5:1–5:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (LZI). doi:10.4230/LIPIcs.SEA.2022.5
Gottesbüren, L.; Heuer, T.; Sanders, P.
2022. 20th International Symposium on Experimental Algorithms (SEA 2022), 5:1–5:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (LZI). doi:10.4230/LIPIcs.SEA.2022.5
Shared-Memory n-level Hypergraph Partitioning
Gottesbüren, L.; Heuer, T.; Sanders, P.; Schlag, S.
2022. 2022 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX). Ed.: C. Phillips, Meeting on Algorithm Engineering and Experiments (ALENEX 2022 2022) Online, 09.01.2022–10.01.2022, 131–144, Society for Industrial and Applied Mathematics (SIAM). doi:10.1137/1.9781611977042.11
Gottesbüren, L.; Heuer, T.; Sanders, P.; Schlag, S.
2022. 2022 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX). Ed.: C. Phillips, Meeting on Algorithm Engineering and Experiments (ALENEX 2022 2022) Online, 09.01.2022–10.01.2022, 131–144, Society for Industrial and Applied Mathematics (SIAM). doi:10.1137/1.9781611977042.11
A Branch-And-Bound Algorithm for Cluster Editing
Bläsius, T.; Fischbeck, P.; Gottesbüren, L.; Hamann, M.; Heuer, T.; Spinner, J.; Weyand, C.; Wilhelm, M.
2022. C. Schulz & B. Uçar (Hrsg.), 20th International Symposium on Experimental Algorithms (SEA 2022). Ed.: C. Schulz, Art.-Nr.: 13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (LZI). doi:10.4230/LIPIcs.SEA.2022.13
Bläsius, T.; Fischbeck, P.; Gottesbüren, L.; Hamann, M.; Heuer, T.; Spinner, J.; Weyand, C.; Wilhelm, M.
2022. C. Schulz & B. Uçar (Hrsg.), 20th International Symposium on Experimental Algorithms (SEA 2022). Ed.: C. Schulz, Art.-Nr.: 13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (LZI). doi:10.4230/LIPIcs.SEA.2022.13
2021
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 (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 (LZI). doi:10.4230/LIPIcs.SEA.2021.8
PACE solver description: KaPoCE: A heuristic cluster editing algorithm
Bläsius, T.; Gottesbüren, L.; Heuer, T.; Weyand, C.; Fischbeck, P.; Hamann, M.; Spinner, J.; Wilhelm, M.
2021. 16th International Symposium on Parameterized and Exact Computation (IPEC 2021). Ed.: P. Golovach, Art.-Nr.: 31, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (LZI). doi:10.4230/LIPIcs.IPEC.2021.31
Bläsius, T.; Gottesbüren, L.; Heuer, T.; Weyand, C.; Fischbeck, P.; Hamann, M.; Spinner, J.; Wilhelm, M.
2021. 16th International Symposium on Parameterized and Exact Computation (IPEC 2021). Ed.: P. Golovach, Art.-Nr.: 31, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (LZI). doi:10.4230/LIPIcs.IPEC.2021.31
Deep multilevel graph partitioning
Gottesbüren, L.; Heuer, T.; Sanders, P.; Schulz, C.; Seemaier, D.
2021. 29th Annual European Symposium on Algorithms (ESA 2021): 6-8 September 2021, online. Ed.: P. Mutzel, Art.-Nr.: 48, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (LZI). doi:10.4230/LIPIcs.ESA.2021.48
Gottesbüren, L.; Heuer, T.; Sanders, P.; Schulz, C.; Seemaier, D.
2021. 29th Annual European Symposium on Algorithms (ESA 2021): 6-8 September 2021, online. Ed.: P. Mutzel, Art.-Nr.: 48, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (LZI). doi:10.4230/LIPIcs.ESA.2021.48
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
2018
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 (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 (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
2017
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 (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 (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 (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 (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 (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 (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
2016
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
2015
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
| Titel | Author(en) | Quelle | Datum |
|---|---|---|---|
| Network Flow-Based Refinement for Multilevel Hypergraph Partitioning | Sebastian Schlag, Peter Sanders, Tobias Heuer |
JEA |
2019 |
| Titel | Ort | Datum |
|---|---|---|
| Using Steiner Trees in Hypergraph Partitioning | Dagstuhl |
August 2023 |
| Scalable High-Quality Graph and Hypergraph Partitioning | Karlsruhe |
October 2022 |
| Parallel Flow-Based Hypergraph Partitioning | Heidelberg |
July 2022 |
| Recent Advances in Shared-Memory Hypergraph Partitioning | Online |
February 2022 |
| Shared-Memory n-level Hypergraph Partitioning | Online |
December 2021 |
| Scalable Shared-Memory Hypergraph Partitioning | Online |
December 2020 |
| Recent Advances in (Hyper-)Graph Partitioning | Freiburg |
September 2019 |
| Practical range minimum queries revisited | London |
June 2017 |
| Title | Type | Semester |
|---|---|---|
| Animation Aussagenlogischer Beweise | Praxis der Softwareentwicklung | WS 2021/2022 |
| 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 | Student |
|---|---|---|---|
| Star Partitioning - Improving Multilevel Graph Partitioning using Peripheral Nodes | Graph Partitioning, Social Networks, Approximation Algorithm | Tobias Heuer |
Nikolai Maas |
| A Parallel Network Flow-Based Refinement Techinque for Multilevel Hypergraph Partitioning | Hypergraph Partitioning, Shared Memory Algorithms, Network Flows | Tobias Heuer |
Lukas Reister |
| Throughput Optimization in a Distributed Database System via Hypergraph Partitioning | Database Optimization | Sebastian Schlag |
Patrick Firnkes |
| Multilevel Hypergraph Partitioning with Vertex Weights Revisited | Hypergraph Partitioning, Initial Partitioning, Load Balancing | Sebastian Schlag Tobias Heuer |
Nikolai Maas |
| Community Detection in Hypergraphs with Application to Partitioning | Community Detection, Hypergraph Partitioning, Shared Memory Algorithms | Lars Gottesbüren Tobias Heuer |
Robert Krause |
| Asynchronous n-Level Hypergraph Partitioning | Hypergraph Partitioning, Shared-Memory Algorithms, Local Search | Lars Gottesbüren Tobias Heuer |
Moritz Laupichler |
| Evaluation of Local Search Heuristics for Graph Partitioning with Large k | Graph Partitioning, Local Search Algorithms, Integer Linear Programing | Daniel Seemaier Tobias Heuer |
Cedrico Knoesel |
| Engineering of Algorithms for Very Large k Partitioning | Graph Partitioning, Initial Partitioning, Local Search Algorithms | Christian Schulz Daniel Seemaier Tobias Heuer
|
Manuel Haag |
| Machine-Learning based Hypergraph Pruning for Partitioning | Hypergraph Partitioning, Machine Learning, Coarsening Algorithms | Christian Schulz Daniel Seemaier Tobias Heuer |
Tobias Fuchs |