Sebastian Schlag Sebastian Schlag

Dr. rer. nat. Sebastian Schlag

Aktivitäten

Seit April 2020 arbeite ich bei Apple.

Forschungsschwerpunkte

  • Graph- und Hypergraph-Partitionierung
  • Kommunikationseffiziente Algorithmen
  • Parallele und verteilte Algorithmen

Publikationen


Dissertationen
Forschungsdaten
kahypar/mt-kahypar: v1.1
Gottesbüren, L.; Heuer, T.; Maas, N.; Wahl, N.; Grabowski, S.; Schlag, S.; Seemaier, D.; Hydai
2023. doi:10.5281/zenodo.7554854
kahypar/mt-kahypar: v1.2
Heuer, T.; Gottesbüren, L.; Maas, N.; Wahl, N.; Grabowski, S.; Schlag, S.; Seemaier, D.; Hydai
2023. doi:10.5281/zenodo.7816970
kahypar/mt-kahypar: v1.3
Heuer, T.; Gottesbüren, L.; Maas, N.; Wahl, N.; Grabowski, S.; Schlag, S.; Seemaier, D.; Hydai
2023. doi:10.5281/zenodo.8178577
kahypar/mt-kahypar: v1.3.1
Heuer, T.; Gottesbüren, L.; Maas, N.; Wahl, N.; Grabowski, S.; Schlag, S.; Seemaier, D.; Hydai
2023. doi:10.5281/zenodo.8199977
kahypar/mt-kahypar: v1.3.2
Heuer, T.; Gottesbüren, L.; Maas, N.; Wahl, N.; Grabowski, S.; Schlag, S.; Seemaier, D.; Hydai
2023. doi:10.5281/zenodo.8239347
Proceedingsbeiträge
Shared-Memory n-level Hypergraph Partitioning
Gottesbüren, L.; Heuer, T.; Sanders, P.; Schlag, S.
2022. 2022 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX). Ed.: C. Phillips, Meeting on Algorithm Engineering and Experiments (ALENEX 2022 2022) Online, 09.01.2022–10.01.2022, 131–144, Society for Industrial and Applied Mathematics (SIAM). doi:10.1137/1.9781611977042.11
Multilevel Hypergraph Partitioning with Vertex Weights Revisited
Heuer, T.; Maas, N.; Schlag, S.
2021. 19th International Symposium on Experimental Algorithms (SEA 2021), 8:1–8:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (LZI). doi:10.4230/LIPIcs.SEA.2021.8VolltextVolltext der Publikation als PDF-Dokument
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 Shared-Memory Hypergraph Partitioning
Gottesbüren, L.; Heuer, T.; Sanders, P.; Schlag, S.
2021. ALENEX 2021 : SIAM Symposium on Algorithm Engineering and Experiments. Ed.: M. Farach-Colton, 16–30, Society for Industrial and Applied Mathematics (SIAM). doi:10.1137/1.9781611976472.2
Advanced Flow-Based Multilevel Hypergraph Partitioning
Gottesbüren, L.; Hamann, M.; Schlag, S.; Wagner, D.
2020. 18th International Symposium on Experimental Algorithms (SEA 2020) Hrsg.: Faro, Simone; Cantone, Domenico, 11:1–11:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (LZI). doi:10.4230/LIPIcs.SEA.2020.11
Data Distribution for Phylogenetic Inference with Site Repeats via Judicious Hypergraph Partitioning
Baar, I.; Hübner, L.; Oettig, P.; Zapletal, A.; Schlag, S.; Stamatakis, A.; Morel, B.
2019. IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), Rio de Janeiro, Brazil, Brazil, 20-24 May 2019, 175–184, Institute of Electrical and Electronics Engineers (IEEE). doi:10.1109/IPDPSW.2019.00038
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
Faster Support Vector Machines
Schlag, S.; Schmitt, M.; Schulz, C.
2019. 2019 Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX). Ed.: S. Kobourov, 199–210, Society for Industrial and Applied Mathematics (SIAM). doi:10.1137/1.9781611975499.16
Network Flow-Based Refinement for Multilevel Hypergraph Partitioning
Heuer, T.; Sanders, P.; Schlag, S.
2018. 17th International Symposium on Experimental Algorithms (SEA), June 27-29, 2018, L’Aquila, Italy. Ed.: G. D’Angelo, 1:1–1:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (LZI). doi:10.4230/LIPIcs.SEA.2018.1
Memetic multilevel hypergraph partitioning
Andre, R.; Schlag, S.; Schulz, C.
2018. GECCO ’18 Proceedings of the Genetic and Evolutionary Computation Conference, Kyoto, J, July 15-19, 2018, 347–354, Association for Computing Machinery (ACM). doi:10.1145/3205455.3205475
Improving Coarsening Schemes for Hypergraph Partitioning by Exploiting Community Structure
Heuer, T.; Schlag, S.
2017. 16th International Symposium on Experimental Algorithms (SEA 2017), London, UK, 21th - 23rd June 2017. Ed.: C. Iliopoulos, Art. Nr. 21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (LZI). doi:10.4230/LIPIcs.SEA.2017.21
Engineering a direct k-way hypergraph partitioning algorithm
Akhremtsev, Y.; Heuer, T.; Sanders, P.; Schlag, S.
2017. Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments (ALENEX), Barcelona, E, January 17-18, 2017. Ed.: S. Fekete, 28–42, SIAM Publ. doi:10.1137/1.9781611974768.3
Thrill: High-performance algorithmic distributed batch data processing with C++
Bingmann, T.; Axtmann, M.; Jobstl, E.; Lamm, S.; Nguyen, H. C.; Noe, A.; Schlag, S.; Stumpp, M.; Sturm, T.; Sanders, P.
2016. IEEE International Conference on Big Data (Big Data), Washington DC, USA, 5–8 December 2016, 172–183, Institute of Electrical and Electronics Engineers (IEEE). doi:10.1109/BigData.2016.7840603VolltextVolltext der Publikation als PDF-Dokument
K-way hypergraph partitioning via n-level recursive bisection
Schlag, S.; Henne, V.; Heuer, T.; Meyerhenke, H.; Sanders, P.; Schulz, C.
2016. Proceedings of the 18th Workshop on Algorithm Engineering and Experiments 2016, ALENEX 2016, Arlington, United States. Ed.: M. Goodrich, 53–67. doi:10.1137/1.9781611974317.5
Communication efficient algorithms for fundamental big data problems
Sanders, P.; Schlag, S.; Muller, I.
2013. Proceedings of the 2013 IEEE International Conference on Big Data, Santa Clara, CA, October 6-9, 2013, 15–23, Institute of Electrical and Electronics Engineers (IEEE). doi:10.1109/BigData.2013.6691549
Zeitschriftenaufsätze
Scalable High-Quality Hypergraph Partitioning
Gottesbüren, L.; Heuer, T.; Maas, N.; Sanders, P.; Schlag, S.
2024. ACM Transactions on Algorithms, 20 (1), 1–54. doi:10.1145/3626527
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
High-Quality Hypergraph Partitioning
Schlag, S.; Heuer, T.; Gottesbüren, L.; Akhremtsev, Y.; Schulz, C.; Sanders, P.
2022. ACM Journal of Experimental Algorithmics, 27, Art.Nr. 1.9. doi:10.1145/3529090
Faster Support Vector Machines
Schlag, S.; Schmitt, M.; Schulz, C.
2021. Journal of experimental algorithmics, 26, 1–21. doi:10.1145/3484730
Network Flow-Based Refinement for Multilevel Hypergraph Partitioning
Heuer, T.; Sanders, P.; Schlag, S.
2019. Journal of experimental algorithmics, 24 (1), Article: 2.3. doi:10.1145/3329872
Masterarbeiten
Buchaufsätze
KaHIP - Karlsruhe High Quality Partitioning
Akhremtsev, Y.; Sanders, P.; Schlag, S.; Schulz, C.
2014. Large-Scale Data Management and Analysis (LSDMA) - Big Data in Science. Hrsg.: Ch. Jung, 8, Karlsruher Institut für Technologie (KIT) 
Technische Berichte
Titel Autoren Quelle Datum

Sebastian Schlag, Vitali Henne, Tobias Heuer, Henning Meyerhenke, Peter Sanders, Christian Schulz

arXiv:1511.03137

November 2015

Vitali Henne, Henning Meyerhenke, Peter Sanders, Sebastian Schlag, Christian Schulz

arXiv:1505.00693

Mai 2015

Lars Gottesbüren, Michael Hamann, Sebastian Schlag, Dorothea Wagner

arXiv:2003.12110

März 2020

Ivo Baar, 
Lukas Hubner,
 Peter Oettig, 
Adrian Zapletal, 
Sebastian Schlag, 
Alexandros Stamatakis, 
Benoit Morel

bioRxiv:579318

März 2019

Johannes Langguth, Sebastian Schlag, Christian Schulz

arXiv:2001.09645

Januar 2020

Merten Popp, Sebastian Schlag, Christian Schulz, Daniel Seemaier

arXiv:2002.02962

Februar 2020

Tobias Heuer, Peter Sanders, Sebastian Schlag

arXiv:1802.03587

Februar 2018

Sebastian Schlag, Matthias Schmitt, Christian Schulz

arXiv:1808.06394

August 2018

Sebastian Schlag, Christian Schulz, Daniel Seemaier, Darren Strash

arXiv:1808.06411

August 2018

Robin Andre, Sebastian Schlag, Christian Schulz

arXiv:1710.01968

August 2017

Timo Bingmann, Michael Axtmann, Emanuel Jöbstl, Sebastian Lamm, Huyen Chau Nguyen, Alexander Noe, Sebastian Schlag, Matthias Stumpp, Tobias Sturm, and Peter Sanders

arXiv:1608.05634

August 2016
Präsentationen
Titel Tagung Datum

Promotionsvortrag

11.12.2019

ICIAM'19

Juli 2019

Vorlesung Algorithmen II

Januar 2019

ALENEX'19

Januar 2019

Annual SPP Meeting 2018

September 2018

GECCO'18

Juli 2018

SEA'18

Juni 2018

Bioinformatics Programming Practical

April 2018

Scientific Review: Research Field Key Technologies - Information

Dezember 2017

The German-Israeli Workshop / Winter School on Algorithms for Big Data

November 2017

SPP 1736 Big Data

Oktober 2017

BDAHM

Oktober 2017

KSETA Topical Course

September 2017

SEA'17

Juni 2017

GP Workshop

Februar 2017

ALENEX'17

17.01.2017

ALENEX'16

Januar 2016

Lehre

Offene Abschlussarbeiten
Betreute Abschlussarbeiten
Titel Forschungsthema Betreuer Bearbeiter
Hypergraph Partitioning

Christian Schulz, Peter Sanders, Sebastian Schlag

Daniel Seemaier

Graph Partitioning

Christian Schulz, Peter Sanders, Sebastian Schlag

Tobias Ribizel

Database Optimization

Sebastian Schlag
Tobias Heuer

Patrick Firnkes

Hypergraph Partitioning

Peter Sanders, Sebastian Schlag, Christian Schulz

Charel Mercatoris

SVMs

Peter Sanders, Sebastian Schlag, Christian Schulz

Matthias Schmitt

Hypergraph Partitioning

Peter Sanders, Sebastian Schlag, Christian Schulz

Clemens Öhl

Hypergraph Partitioning

Peter Sanders, Sebastian Schlag

Tobias Heuer

Hypergraph Partitioning

Peter Sanders, Sebastian Schlag, Christian Schulz

Robin Andre

Graph Partitioning

Peter Sanders, Sebastian Schlag, Christian Schulz

Yani Kolev

Graph Partitioning

Peter Sanders, Sebastian Schlag, Christian Schulz

Daniel Seemaier

Hypergraph Partitioning

Peter Sanders, Sebastian Schlag

Orlin Kolev

Hypergraph Partitioning

Peter Sanders, Sebastian Schlag

Tobias Heuer

Hypergraph Partitioning

Vitali Henne