| 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 | 124 | 2023 |
| 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 | 65 | 2023 |
| 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 29th Annual European Symposium on Algorithms (ESA 2021), 2021 | 33 | 2021 |
| Advanced Flow-Based Multilevel Hypergraph Partitioning L Gottesbüren, M Hamann, S Schlag, D Wagner 18th International Symposium on Experimental Algorithms (SEA 2020), 2020 | 25 | 2020 |
| Faster and better nested dissection orders for customizable contraction hierarchies L Gottesbüren, M Hamann, TN Uhl, D Wagner Algorithms 12 (9), 196, 2019 | 23 | 2019 |
| Parallel Flow-Based Hypergraph Partitioning L Gottesbüren, T Heuer, P Sanders 20th International Symposium on Experimental Algorithms (SEA 2022), 2022 | 15 | 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 |
| Engineering Exact Quasi-Threshold Editing L Gottesbüren, M Hamann, P Schoch, B Strasser, D Wagner, S Zühlsdorf 18th International Symposium on Experimental Algorithms (SEA 2020), 2020 | 14 | 2020 |
| Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm L Gottesbüren, M Hamann, D Wagner 27th Annual European Symposium on Algorithms (ESA 2019), 2019 | 12 | 2019 |
| 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 |
| Deterministic parallel hypergraph partitioning L Gottesbüren, M Hamann European Conference on Parallel Processing, 301-316, 2022 | 11 | 2022 |
| 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 | 8 | 2024 |
| 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 | 8 | 2021 |
| Parallel Unconstrained Local Search for Partitioning Irregular Graphs N Maas, L Gottesbüren, D Seemaier 2024 Proceedings of the Symposium on Algorithm Engineering and Experiments …, 2024 | 4 | 2024 |
| Parallel and Flow-Based High Quality Hypergraph Partitioning L Gottesbüren Karlsruhe Institute of Technology, Germany, 2023 | 3 | 2023 |
| Open Problems in (Hyper) Graph Decomposition D Ajwani, RH Bisseling, K Casel, ÜV Çatalyürek, C Chevalier, ... arXiv preprint arXiv:2310.11812, 2023 | 2 | 2023 |
| Practical Expander Decomposition L Gottesbüren, N Parotsidis, MP Gutenberg 32nd Annual European Symposium on Algorithms (ESA 2024), 2024 | 1 | 2024 |
| Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search L Gottesbüren, L Dhulipala, R Jayaram, J Lacki arXiv preprint arXiv:2403.01797, 2024 | 1 | 2024 |
| Recent Trends in Graph Decomposition (Dagstuhl Seminar 23331) G Karypis, C Schulz, D Strash, D Ajwani, RH Bisseling, K Casel, ... Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 2024 | 1 | 2024 |
Tobias HeuerSoftware Engineer, eBaykit.edu의 이메일 확인됨
