Institute of Theoretical Informatics, Algorithmics II
Sebastian Schlag Sebastian Schlag

Dr. rer. nat. Sebastian Schlag

Activities

In April 2020, I started working at Apple.

Research Interests

  • Graph and Hypergraph Partitioning
  • Communication Efficient Algorithms
  • Distributed Processing of Large Data

Publications


Conference Papers
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, Dagstuhl, Germany. 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, IEEE, Piscataway )NJ). 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. 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 fuer Informatik, Wadern, Saarbrücken/Wadern. 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, ACM Press, New York (NY). 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, Wadern. 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., Philadelphia (PA). 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, IEEE, Piscataway (NJ). doi:10.1109/BigData.2016.7840603Full textFull text of the publication as PDF document
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, IEEE, Piscataway, NJ. doi:10.1109/BigData.2013.6691549
Journal Articles
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
Book Chapters
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, KIT, Karlsruhe 
Presentations
Title Conference Date

Dissertation Defense

11.12.2019

ICIAM'19

July 2019

Algorithms II

January 2019

ALENEX'19

January 2019

Annual SPP Meeting 2018

September 2018

GECCO'18

July 2018

SEA'18

June 2018

Bioinformatics Programming Practical

April 2018

Scientific Review: Research Field Key Technologies - Information

December 2017

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

November 2017

SPP 1736 Big Data

October 2017

BDAHM

October 2017

KSETA Topical Course

September 2017

SEA'17

June 2017

GP Workshop

24.02.2017

ALENEX'17

January 2017

ALENEX'16

January 2016

Teaching

Open Theses
Supervised Theses
Title Subject Supervisor Student
Graph Partitioning

Christian Schulz, Peter Sanders, Sebastian Schlag

Tobias Ribizel

Hypergraph Partitioning

Christian Schulz, Peter Sanders, Sebastian Schlag

Daniel Seemaier

Hypergraph Partitioning

Henning Meyerhenke, Peter Sanders, Sebastian Schlag, Christian Schulz

Vitali Henne

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, Christian Schulz

Charel Mercatoris

Hypergraph Partitioning

Peter Sanders, Sebastian Schlag, Christian Schulz

Robin Andre

Hypergraph Partitioning

Peter Sanders, Sebastian Schlag, Christian Schulz

Clemens Öhl

SVMs

Peter Sanders, Sebastian Schlag, Christian Schulz

Matthias Schmitt

Hypergraph Partitioning

Peter Sanders, Sebastian Schlag

Orlin Kolev

Hypergraph Partitioning

Peter Sanders, Sebastian Schlag

Tobias Heuer

Hypergraph Partitioning

Peter Sanders, Sebastian Schlag

Tobias Heuer

Database Optimization

Sebastian Schlag
Tobias Heuer

Patrick Firnkes