Prati
Tobias Heuer
Tobias Heuer
Software Engineer, eBay
Potvrđena adresa e-pošte na kit.edu - Početna stranica
Naslov
Citirano
Citirano
Godina
High-quality hypergraph partitioning
S Schlag, T Heuer, L Gottesbüren, Y Akhremtsev, C Schulz, P Sanders
ACM Journal of Experimental Algorithmics 27, 1-39, 2023
732023
Engineering a direct k-way Hypergraph Partitioning Algorithm
Y Akhremtsev, T Heuer, P Sanders, S Schlag
2017 Proceedings of the Ninteenth Workshop on Algorithm Engineering and …, 2017
722017
k-way Hypergraph Partitioning via n-Level Recursive Bisection
S Schlag, V Henne, T Heuer, H Meyerhenke, P Sanders, C Schulz
2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and …, 2016
702016
Improving coarsening schemes for hypergraph partitioning by exploiting community structure
T Heuer, S Schlag
16th international symposium on experimental algorithms (SEA 2017), 2017
522017
Network flow-based refinement for multilevel hypergraph partitioning
T Heuer, P Sanders, S Schlag
Journal of Experimental Algorithmics (JEA) 24, 1-36, 2019
462019
More recent advances in (hyper) graph partitioning
Ü Çatalyürek, K Devine, M Faraj, L Gottesbüren, T Heuer, H Meyerhenke, ...
ACM Computing Surveys 55 (12), 1-38, 2023
352023
Scalable Shared-Memory Hypergraph Partitioning
L Gottesbüren, T Heuer, P Sanders, S Schlag
2021 Proceedings of the Workshop on Algorithm Engineering and Experiments …, 2021
332021
Deep multilevel graph partitioning
L Gottesbüren, T Heuer, P Sanders, C Schulz, D Seemaier
arXiv preprint arXiv:2105.02022, 2021
262021
Engineering initial partitioning algorithms for direct k-way hypergraph partitioning
T Heuer
Karlsruher Institut für Technologie (KIT), 2015
182015
Shared-Memory n-level Hypergraph Partitioning
L Gottesbüren, T Heuer, P Sanders, S Schlag
2022 Proceedings of the Symposium on Algorithm Engineering and Experiments …, 2022
142022
Parallel flow-based hypergraph partitioning
L Gottesbüren, T Heuer, P Sanders
arXiv preprint arXiv:2201.01556, 2022
122022
Practical range minimum queries revisited
N Baumstark, S Gog, T Heuer, J Labeit
16th International Symposium on Experimental Algorithms (SEA 2017), 2017
112017
Multilevel hypergraph partitioning with vertex weights revisited
T Heuer, N Maas, S Schlag
arXiv preprint arXiv:2102.01378, 2021
72021
A branch-and-bound algorithm for cluster editing
T Bläsius, P Fischbeck, L Gottesbüren, M Hamann, T Heuer, J Spinner, ...
20th International Symposium on Experimental Algorithms (SEA 2022), 2022
62022
PACE solver description: KaPoCE: A heuristic cluster editing algorithm
T Bläsius, P Fischbeck, L Gottesbüren, M Hamann, T Heuer, J Spinner, ...
16th International Symposium on Parameterized and Exact Computation (IPEC 2021), 2021
62021
High Quality Hypergraph Partitioning via Max-Flow-Min-Cut Computations
T Heuer
Master’s thesis, KIT, 2018
52018
The pace 2022 parameterized algorithms and computational experiments challenge: directed feedback vertex set
E Großmann, T Heuer, C Schulz, D Strash
17th International Symposium on Parameterized and Exact Computation (IPEC 2022), 2022
32022
Scalable High-Quality Graph and Hypergraph Partitioning
T Heuer
Dissertation, Karlsruhe, Karlsruher Institut für Technologie (KIT), 2022, 2022
22022
Scalable High-Quality Hypergraph Partitioning
L Gottesbüren, T Heuer, N Maas, P Sanders, S Schlag
ACM Transactions on Algorithms 20 (1), 1-54, 2024
12024
The Quantile Index-Succinct Self-Index for Top-k Document Retrieval
N Baumstark, S Gog, T Heuer, J Labeit
16th International Symposium on Experimental Algorithms (SEA 2017), 2017
12017
Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.
Članci 1–20