default search action
Lars Gottesbüren
Person information
- affiliation: Karlsruhe Institute of Technology, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j4]Lars Gottesbüren
, Tobias Heuer
Scalable High-Quality Hypergraph Partitioning. ACM Trans. Algorithms 20(1): 9:1-9:54 (2024) - [c15]Nikolai Maas
Parallel Unconstrained Local Search for Partitioning Irregular Graphs. ALENEX 2024: 32-45 - [c14]Lars Gottesbüren, Nikos Parotsidis, Maximilian Probst Gutenberg:
Practical Expander Decomposition. ESA 2024: 61:1-61:17 - [c13]Lars Gottesbüren
Modern Software Libraries for Graph Partitioning (Abstract). HOPC@SPAA 2024 - [i17]Lars Gottesbüren, Laxman Dhulipala, Rajesh Jayaram, Jakub Lacki:
Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search. CoRR abs/2403.01797 (2024) - [i16]Daniel Salwasser, Daniel Seemaier, Lars Gottesbüren, Peter Sanders:
Tera-Scale Multilevel Graph Partitioning. CoRR abs/2410.19119 (2024) - 2023
- [b1]Lars Gottesbüren:
Parallel and Flow-Based High Quality Hypergraph Partitioning. Karlsruhe Institute of Technology, Germany, 2023 - [j3]Ümit V. Çatalyürek
More Recent Advances in (Hyper)Graph Partitioning. ACM Comput. Surv. 55(12): 253:1-253:38 (2023) - [c12]Noah Wahl, Lars Gottesbüren:
Greedy Heuristics for Judicious Hypergraph Partitioning. SEA 2023: 17:1-17:16 - [i15]Lars Gottesbüren, Tobias Heuer, Nikolai Maas
Scalable High-Quality Hypergraph Partitioning. CoRR abs/2303.17679 (2023) - [i14]Nikolai Maas
Parallel Unconstrained Local Search for Partitioning Irregular Graphs. CoRR abs/2308.15494 (2023) - [i13]Deepak Ajwani, Rob H. Bisseling, Katrin Casel, Ümit V. Çatalyürek, Cédric Chevalier, Florian Chudigiewitsch
Open Problems in (Hyper)Graph Decomposition. CoRR abs/2310.11812 (2023) - [i12]George Karypis, Christian Schulz, Darren Strash, Deepak Ajwani, Rob H. Bisseling, Katrin Casel, Ümit V. Çatalyürek, Cédric Chevalier, Florian Chudigiewitsch, Marcelo Fonseca Faraj, Michael R. Fellows, Lars Gottesbüren, Tobias Heuer, Kamer Kaya, Jakub Lacki, Johannes Langguth, Xiaoye Sherry Li, Ruben Mayer, Johannes Meintrup, Yosuke Mizutani, François Pellegrini, Fabrizio Petrini, Frances A. Rosamond, Ilya Safro, Sebastian Schlag, Roohani Sharma, Blair D. Sullivan, Bora Uçar, Albert-Jan Yzelman:
Recent Trends in Graph Decomposition (Dagstuhl Seminar 23331). Dagstuhl Reports 13(8): 1-45 (2023) - 2022
- [j2]Sebastian Schlag
High-Quality Hypergraph Partitioning. ACM J. Exp. Algorithmics 27: 1.9:1-1.9:39 (2022) - [c11]Lars Gottesbüren, Tobias Heuer
Shared-Memory n-level Hypergraph Partitioning. ALENEX 2022: 131-144 - [c10]Lars Gottesbüren, Michael Hamann:
Deterministic Parallel Hypergraph Partitioning. Euro-Par 2022: 301-316 - [c9]Lars Gottesbüren, Tobias Heuer
Parallel Flow-Based Hypergraph Partitioning. SEA 2022: 5:1-5:21 - [c8]Thomas Bläsius
A Branch-And-Bound Algorithm for Cluster Editing. SEA 2022: 13:1-13:19 - [i11]Lars Gottesbüren, Tobias Heuer, Peter Sanders:
Parallel Flow-Based Hypergraph Partitioning. CoRR abs/2201.01556 (2022) - [i10]Ümit V. Çatalyürek, Karen D. Devine, Marcelo Fonseca Faraj, Lars Gottesbüren, Tobias Heuer, Henning Meyerhenke, Peter Sanders, Sebastian Schlag, Christian Schulz, Daniel Seemaier, Dorothea Wagner:
More Recent Advances in (Hyper)Graph Partitioning. CoRR abs/2205.13202 (2022) - 2021
- [c7]Lars Gottesbüren, Tobias Heuer, Peter Sanders, Sebastian Schlag:
Scalable Shared-Memory Hypergraph Partitioning. ALENEX 2021: 16-30 - [c6]Lars Gottesbüren, Tobias Heuer, Peter Sanders, Christian Schulz, Daniel Seemaier:
Deep Multilevel Graph Partitioning. ESA 2021: 48:1-48:17 - [c5]Thomas Bläsius
PACE Solver Description: The KaPoCE Exact Cluster Editing Algorithm. IPEC 2021: 27:1-27:3 - [c4]Thomas Bläsius
PACE Solver Description: KaPoCE: A Heuristic Cluster Editing Algorithm. IPEC 2021: 31:1-31:4 - [i9]Lars Gottesbüren, Tobias Heuer, Peter Sanders, Sebastian Schlag:
Shared-Memory n-level Hypergraph Partitioning. CoRR abs/2104.08107 (2021) - [i8]Lars Gottesbüren, Tobias Heuer, Peter Sanders, Christian Schulz, Daniel Seemaier:
Deep Multilevel Graph Partitioning. CoRR abs/2105.02022 (2021) - [i7]Sebastian Schlag, Tobias Heuer, Lars Gottesbüren, Yaroslav Akhremtsev, Christian Schulz, Peter Sanders:
High-Quality Hypergraph Partitioning. CoRR abs/2106.08696 (2021) - [i6]Lars Gottesbüren, Michael Hamann:
Deterministic Parallel Hypergraph Partitioning. CoRR abs/2112.12704 (2021) - 2020
- [c3]Lars Gottesbüren
Engineering Exact Quasi-Threshold Editing. SEA 2020: 10:1-10:14 - [c2]Lars Gottesbüren, Michael Hamann
Advanced Flow-Based Multilevel Hypergraph Partitioning. SEA 2020: 11:1-11:15 - [i5]Lars Gottesbüren, Michael Hamann, Sebastian Schlag, Dorothea Wagner:
Advanced Flow-Based Multilevel Hypergraph Partitioning. CoRR abs/2003.12110 (2020) - [i4]Lars Gottesbüren, Michael Hamann, Philipp Schoch, Ben Strasser, Dorothea Wagner, Sven Zühlsdorf:
Engineering Exact Quasi-Threshold Editing. CoRR abs/2003.14317 (2020) - [i3]Lars Gottesbüren, Tobias Heuer, Peter Sanders, Sebastian Schlag:
Scalable Shared-Memory Hypergraph Partitioning. CoRR abs/2010.10272 (2020)
2010 – 2019
- 2019
- [j1]Lars Gottesbüren
Faster and Better Nested Dissection Orders for Customizable Contraction Hierarchies. Algorithms 12(9): 196 (2019) - [c1]Lars Gottesbüren
Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm. ESA 2019: 52:1-52:17 - [i2]Lars Gottesbüren, Michael Hamann, Tim Niklas Uhl, Dorothea Wagner:
Faster and Better Nested Dissection Orders for Customizable Contraction Hierarchies. CoRR abs/1906.11811 (2019) - [i1]Lars Gottesbüren, Michael Hamann, Dorothea Wagner:
Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm. CoRR abs/1907.02053 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-30 00:09 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: