| 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 | 111 | 2023 |
| 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 | 88 | 2017 |
| 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 | 76 | 2016 |
| 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 | 61 | 2023 |
| Improving coarsening schemes for hypergraph partitioning by exploiting community structure T Heuer, S Schlag 16th international symposium on experimental algorithms (SEA 2017), 2017 | 56 | 2017 |
| Network flow-based refinement for multilevel hypergraph partitioning T Heuer, P Sanders, S Schlag Journal of Experimental Algorithmics (JEA) 24, 1-36, 2019 | 48 | 2019 |
| 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 | 40 | 2021 |
| Deep multilevel graph partitioning L Gottesbüren, T Heuer, P Sanders, C Schulz, D Seemaier arXiv preprint arXiv:2105.02022, 2021 | 31 | 2021 |
| Engineering initial partitioning algorithms for direct k-way hypergraph partitioning T Heuer Karlsruher Institut für Technologie (KIT), 2015 | 19 | 2015 |
| Parallel flow-based hypergraph partitioning L Gottesbüren, T Heuer, P Sanders arXiv preprint arXiv:2201.01556, 2022 | 16 | 2022 |
| 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 | 15 | 2022 |
| Practical range minimum queries revisited N Baumstark, S Gog, T Heuer, J Labeit 16th International Symposium on Experimental Algorithms (SEA 2017), 2017 | 13 | 2017 |
| 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 | 11 | 2022 |
| Multilevel hypergraph partitioning with vertex weights revisited T Heuer, N Maas, S Schlag arXiv preprint arXiv:2102.01378, 2021 | 7 | 2021 |
| 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 | 7 | 2021 |
| 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 | 5 | 2024 |
| High Quality Hypergraph Partitioning via Max-Flow-Min-Cut Computations T Heuer Master’s thesis, KIT, 2018 | 5 | 2018 |
| 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 | 4 | 2022 |
| Scalable High-Quality Graph and Hypergraph Partitioning T Heuer Dissertation, Karlsruhe, Karlsruher Institut für Technologie (KIT), 2022, 2022 | 2 | 2022 |
| Open Problems in (Hyper) Graph Decomposition D Ajwani, RH Bisseling, K Casel, ÜV Çatalyürek, C Chevalier, ... arXiv preprint arXiv:2310.11812, 2023 | 1 | 2023 |
Sebastian SchlagAlgorithm Engineer at AppleVerified email at sebastianschlag.de
