M.Sc. Daniel Seemaier

Forschungsgebiet

  • Graph- und Hypergraphpartitionierung
  • Shared Memory Algorithmen
  • Verteilte Algorithmen

Publikationen


Parallel Unconstrained Local Search for Partitioning Irregular Graphs
Maas, N.; Gottesbüren, L.; Seemaier, D.
2024. 2024 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX), Alexandria, VA, 7th-8th January 2024, 32 – 45, Society for Industrial and Applied Mathematics Publications (SIAM). doi:10.1137/1.9781611977929.3
More Recent Advances in (Hyper)Graph Partitioning
Çatalyürek, Ü.; Devine, K.; Faraj, M.; Gottesbüren, L.; Heuer, T.; Meyerhenke, H.; Sanders, P.; Schlag, S.; Schulz, C.; Seemaier, D.; Wagner, D.
2023. ACM Computing Surveys, 55 (12), Artkl.Nr.: 3571808. doi:10.1145/3571808
Distributed Deep Multilevel Graph Partitioning
Sanders, P.; Seemaier, D.
2023. Euro-Par 2023: Parallel Processing – 29th International Conference on Parallel and Distributed Computing, Limassol, Cyprus, August 28 – September 1, 2023, Proceedings. Ed.: J. Cano, 443 – 457, Springer Nature Switzerland. doi:10.1007/978-3-031-39698-4_30
Deep multilevel graph partitioning
Gottesbüren, L.; Heuer, T.; Sanders, P.; Schulz, C.; Seemaier, D.
2021. 29th Annual European Symposium on Algorithms (ESA 2021): 6-8 September 2021, online. Ed.: P. Mutzel, Art.-Nr.: 48, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (LZI). doi:10.4230/LIPIcs.ESA.2021.48
Multilevel acyclic hypergraph partitioning
Popp, M.; Schlag, S.; Schulz, C.; Seemaier, D.
2021. 2021 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX). Ed.: M. Farach-Colton, Society for Industrial and Applied Mathematics (SIAM)
Scalable Edge Partitioning
Schlag, S.; Schulz, C.; Seemaier, D.; Strash, D.
2019. Proceedings of the 21st Workshop on Algorithm Engineering and Experiments (ALENEX 2019), San Diego, CA, January 7-8, 2019, 211–225. doi:10.1137/1.9781611975499.17
Technische Berichte
Titel Autor Quelle Datum

Nikolai Maas, Lars Gottesbüren, Daniel Seemaier

arXiv:2308.15494

August 2023

Peter Sanders, Daniel Seemaier

arXiv:2303.01417

März 2023

Ü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

arXiv:2205.13202

Mai 2022

Lars Gottesbüren, Tobias Heuer, Peter Sanders, Christian Schulz, Daniel Seemaier

arXiv:2105.02022

Mai 2021

Merten Popp, Sebastian Schlag, Christian Schulz, Daniel Seemaier

arXiv:2002.02962

Februar 2020

Sebastian Schlag, Christian Schulz, Daniel Seemaier, Darren Strash

arXiv:1808.06411

August 2018

Lehre

Veranstaltungen
Titel Typ Semester
Vorlesung (V)
Proseminar (PS) SS 2023
Praxis der Softwareentwicklung WS 22/23
Praxis der Softwareentwicklung WS 22/23
Seminar (S) SS 2022
Vorlesung (V) WS 21/22
Vorlesung (V) SS 2021
Vorlesung (V) WS 20/21
Abgeschlossene Abschlussarbeiten
Titel Forschungsthema Betreuung Bearbeitung
Graph Partitioning

Daniel Seemaier

Tim Niklas Uhl

Samuel Gil

Graphpartitionierung

Tobias Heuer

Daniel Seemaier

Timo Fritsch

Graph Partitioning, ILP, Local Search Heuristics

Lars Gottesbüren

Tobias Heuer

Daniel Seemaier

Cedrico Knoesel

Graph Partitioning, Initial Partitioning, Local Search Algorithms

Christian Schulz

Daniel Seemaier

Tobias Heuer

 

Manuel Haag

Hypergraph Partitioning, Machine Learning, Coarsening Algorithms

Christian Schulz

Daniel Seemaier

Tobias Heuer

Tobias Fuchs

Offene Abschlussarbeiten