research-publications

KO | EN

gitlite — search

#hacktoberfest #react #ai #go #android #rust #docker #nodejs #macos #java #cli #vue #mcp #openai

research-publications

(★ 12)

A list of all publications related to the KaHyPar frameworks.

research-publications Latest Version Download

Download Latest Version (.zip)

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# Literature

### Publications

[S. Schlag, T. Heuer, L. Gottesbüren, Y. Akhremtsev, C. Schulz, and P. Sanders, High-Quality Hypergraph Partitioning, in ACM Journal of Experimental Algorithmics (JEA), 2022.](https://dl.acm.org/doi/10.1145/3529090)

[L. Gottesbüren, T. Heuer, P. Sanders, S. Schlag. Shared-Memory n-level Hypergraph Partitioning. SIAM Symposium on Algorithm Engineering and Experiments, to appear, 2022.](https://www.siam.org/conferences/cm/program/accepted-papers/alenex22-accepted-papers)

[T. Heuer, N. Maas, S. Schlag. Multilevel Hypergraph Partitioning with Vertex Weights Revisited. In 19th International Symposium on Experimental Algorithms (SEA), 2021.](https://drops.dagstuhl.de/opus/volltexte/2021/13780/)

[L. Gottesbüren, T. Heuer, P. Sanders, S. Schlag. Scalable Shared-Memory Hypergraph Partitioning. In 23rd Workshop on Algorithm Engineering and Experiments (ALENEX), 2021.](https://epubs.siam.org/doi/pdf/10.1137/1.9781611976472.2)

[M. Popp, S. Schlag, C. Schulz, D. Seemaier. Multilevel Acyclic Hypergraph Partitioning. In 23rd Workshop on Algorithm Engineering and Experiments (ALENEX), 2021.](https://locus.siam.org/doi/pdf/10.1137/1.9781611976472.1)

[L. Gottesbüren, M. Hamann, S. Schlag, D. Wagner. Advanced Flow-Based Multilevel Hypergraph Partitioning. In 18th International Symposium on Experimental Algorithms (SEA), 2020.](https://drops.dagstuhl.de/opus/volltexte/2020/12085/pdf/LIPIcs-SEA-2020-11.pdf)

[T. Heuer, P. Sanders, and S. Schlag. Network Flow-Based Refinement for Multilevel Hypergraph
Partitioning, ACM Journal of Experimental Algorithmics (JEA), Special Issue SEA 2018, Volume 24 Issue 1, 2019.](https://dl.acm.org/doi/10.1145/3329872)

[R. Andre, C. Schulz, S. Schlag. Memetic Multilevel Hypergraph Partitioning. In Genetic and Evolutionary Computation Conference (GECCO), 2018.](https://dl.acm.org/doi/10.1145/3205455.3205475)

[T. Heuer, P. Sanders, S. Schlag. Network Flow-Based Refinement for Multilevel Hypergraph Partitioning. In 17th International Symposium on Experimental Algorithms (SEA), 2018.](http://drops.dagstuhl.de/opus/volltexte/2018/8936/pdf/LIPIcs-SEA-2018-1.pdf)

[T. Heuer, S. Schlag. Improving Coarsening Schemes for Hypergraph Partitioning by Exploiting Community Structure. In 16th International Symposium on Experimental Algorithms (SEA), 2017.](http://drops.dagstuhl.de/opus/volltexte/2017/7622/pdf/LIPIcs-SEA-2017-21.pdf)

[Y. Akhremtsev, T. Heuer, P. Sanders, and S. Schlag. Engineering a direct k-way Hypergraph Partitioning Algorithm. In 19th Workshop on Algorithm Engineering and Experiments (ALENEX), pages 28–42, 2017.](https://epubs.siam.org/doi/abs/10.1137/1.9781611974768.3?mobileUi=0&)

[S. Schlag, V. Henne, T. Heuer, H. Meyerhenke, P. Sanders, and C. Schulz. k-way Hypergraph Partitioning via n-Level Recursive Bisection. In 18th Workshop on Algorithm Engineering and Experiments (ALENEX), pages 53–67, 2016.](https://epubs.siam.org/doi/abs/10.1137/1.9781611974317.5)

### Technical Reports
[S. Schlag, T. Heuer, L. Gottesbüren, Y. Akhremtsev, C. Schulz, P. Sanders. High-Quality Hypergraph Partitioning, arXiv: 2106.08696, 2021.](https://arxiv.org/abs/2106.08696)

[L. Gottesbüren, T. Heuer, P. Sanders, S. Schlag. Shared-Memory n-level Hypergraph Partitioning. arXiv:2104.08107, 2021.](https://arxiv.org/abs/2104.08107)

[T. Heuer, N. Maas, S. Schlag. Multilevel Hypergraph Partitioning with Vertex Weights Revisited. arXiv:2102.01378, 2021.](https://arxiv.org/abs/2102.01378)

[L. Gottesbüren, T. Heuer, P. Sanders, S. Schlag. Scalable Shared-Memory Hypergraph Partitioning. arXiv:2010.10272, 2020.](https://arxiv.org/abs/2010.10272)

[L. Gottesbüren, M. Hamann, S. Schlag, D. Wagner. Advanced Flow-Based Multilevel Hypergraph Partitioning. arXiv:2003.12110, 2020.](https://arxiv.org/abs/2003.12110)

[T. Heuer, P. Sanders, S. Schlag. Network Flow-Based Refinement for Multilevel Hypergraph Partitioning. 	
arXiv:1802.03587, 2018.](https://arxiv.org/abs/1802.03587)

[R. Andre, C. Schulz, S. Schlag. Memetic Multilevel Hypergraph Partitioning. arXiv:1710.01968, 2017.](https://arxiv.org/abs/1710.01968)
	
[S. Schlag, V. Henne, T. Heuer, H. Meyerhenke, P, Sanders, C. Schulz. k-way Hypergraph Partitioning via n-Level Recursive Bisection, arXiv:1511.03137, 2015.](https://arxiv.org/abs/1511.03137)
	
[V. Henne, H. Meyerhenke, P. Sanders, S. Schlag, C. Schulz. n-Level Hypergraph Partitioning, arXiv:1505.00693, 2015.](https://arxiv.org/abs/1505.00693)

### Theses
[S. Schlag. High-Quality Hypergraph Partitioning (PhD thesis), 2019.](https://publikationen.bibliothek.kit.edu/1000105953)

[T. Heuer. High Quality Hypergraph Partitioning via Max-Flow-Min-Cut Computations, 2018.](https://publikationen.bibliothek.kit.edu/1000083200)

[R. Andre. Evolutionary Hypergraph Partitioning, 2017.](https://algo2.iti.kit.edu/download/bachelorarbeit_robin_andre.pdf)

[T. Heuer. Engineering Initial Partitioning Algorithms for direct k-way Hypergraph Partitioning, 2015.](https://publikationen.bibliothek.kit.edu/1000063446)

[V. Henne. Label Propagation for Hypergraph Partitioning, 2015.](https://publikationen.bibliothek.kit.edu/1000063440)

research-publications

research-publications Latest Version Download

Today's picks

Was this content helpful?

Recent Feedback

research-publications

research-publications Latest Version Download

Today's picks

Was this content helpful?

Recent Feedback

Download README