Lars Gottesbüren

Orcid: 0000-0003-1895-5828

Affiliations:
  • Karlsruhe Institute of Technology, Germany


According to our database1, Lars Gottesbüren authored at least 21 papers between 2019 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Scalable High-Quality Hypergraph Partitioning.
ACM Trans. Algorithms, January, 2024

Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search.
CoRR, 2024

2023
More Recent Advances in (Hyper)Graph Partitioning.
ACM Comput. Surv., December, 2023

Parallel and Flow-Based High Quality Hypergraph Partitioning.
PhD thesis, 2023

Recent Trends in Graph Decomposition (Dagstuhl Seminar 23331).
Dagstuhl Reports, 2023

Open Problems in (Hyper)Graph Decomposition.
CoRR, 2023

Parallel Unconstrained Local Search for Partitioning Irregular Graphs.
CoRR, 2023

Greedy Heuristics for Judicious Hypergraph Partitioning.
Proceedings of the 21st International Symposium on Experimental Algorithms, 2023

2022
High-Quality Hypergraph Partitioning.
ACM J. Exp. Algorithmics, December, 2022

Parallel Flow-Based Hypergraph Partitioning.
Proceedings of the 20th International Symposium on Experimental Algorithms, 2022

A Branch-And-Bound Algorithm for Cluster Editing.
Proceedings of the 20th International Symposium on Experimental Algorithms, 2022

Deterministic Parallel Hypergraph Partitioning.
Proceedings of the Euro-Par 2022: Parallel Processing, 2022

Shared-Memory n-level Hypergraph Partitioning.
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2022

2021
PACE Solver Description: KaPoCE: A Heuristic Cluster Editing Algorithm.
Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

PACE Solver Description: The KaPoCE Exact Cluster Editing Algorithm.
Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

Deep Multilevel Graph Partitioning.
Proceedings of the 29th Annual European Symposium on Algorithms, 2021

Scalable Shared-Memory Hypergraph Partitioning.
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2021

2020
Advanced Flow-Based Multilevel Hypergraph Partitioning.
Proceedings of the 18th International Symposium on Experimental Algorithms, 2020

Engineering Exact Quasi-Threshold Editing.
Proceedings of the 18th International Symposium on Experimental Algorithms, 2020

2019
Faster and Better Nested Dissection Orders for Customizable Contraction Hierarchies.
Algorithms, 2019

Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019


  Loading...