Institut für Theoretische Informatik, Algorithmik II
Sebastian Lamm

M.Sc. Sebastian Lamm

Forschungsschwerpunkte

  • Graphenalgorithmen
  • Graphgeneration
  • Verteilte Algorithmen
  • Problemkern-Reduktion

Publikationen


WeGotYouCovered: The Winning Solver from the PACE 2019 Challenge, Vertex Cover Track.
Hespe, D.; Lamm, S.; Schulz, C.; Strash, D.
2020. SIAM Workshop on Combinatorial Scientific Computing (CSC20), Seattle, Washington, U.S., February 11 - 13, 2020. Ed.: H.M. Bücker, 1–11, Society for Industrial and Applied Mathematics, Philadelphia (PA). doi:10.1137/1.9781611976229.1
Engineering Kernelization for Maximum Cut.
Ferizovic, D.; Hespe, D.; Lamm, S.; Mnich, M.; Schulz, C.; Strash, D.
2020. 2020 Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX), Salt Lake City, Utah, U.S., January 5 - 6, 2020. Ed.: G. Blelloch, 27–41, Society for Industrial and Applied Mathematics, Philadelphia (PA). doi:10.1137/1.9781611976007.3
Communication-free massively distributed graph generation.
Funke, D.; Lamm, S.; Meyer, U.; Penschuck, M.; Sanders, P.; Schulz, C.; Strash, D.; von Looz, M.
2019. Journal of parallel and distributed computing, 131, 200–217. doi:10.1016/j.jpdc.2019.03.011
Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs.
Lamm, S.; Schulz, C.; Strash, D.; Williger, R.; Zhang, H.
2019. 2019 Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX), San Diego, California, USA, January 7 - 8, 2019. Ed.: S. Kobourov, 144–158, Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA. doi:10.1137/1.9781611975499.12
Efficient Parallel Random Sampling : Vectorized, Cache-Efficient, and Online.
Sanders, P.; Lamm, S.; Hübschle-Schneider, L.; Schrade, E.; Dachsbacher, C.
2018. ACM transactions on mathematical software, 44 (3), 29:1–29:14. doi:10.1145/3157734
Communication-free Massively Distributed Graph Generation.
Funke, D.; Lamm, S.; Sanders, P.; Schulz, C.; Strash, D.; Looz, M. von.
2018. 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS), Vancouver, BC, Canada, 21-25 May 2018, 336–347, IEEE, Piscataway (NJ). doi:10.1109/IPDPS.2018.00043
Finding near-optimal independent sets at scale.
Lamm, S.; Sanders, P.; Schulz, C.; Strash, D.; Werneck, R. F.
2017. Journal of heuristics, 23 (4), 207–229. doi:10.1007/s10732-017-9337-x
Finding Near-Optimal Independent Sets at Scale.
Lamm, S.; Sanders, P.; Schulz, C.; Strash, D.; Werneck, R. F.
2016. 2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX), Arlington, VA, January 10, 2016, 138–150, Society for Industrial and Applied Mathematics, Philadelphia (PA). doi:10.1137/1.9781611974317.12
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.7840603VolltextVolltext der Publikation als PDF-Dokument
Accelerating Local Search for the Maximum Independent Set Problem.
Dahlum, J.; Lamm, S.; Sanders, P.; Schulz, C.; Strash, D.; Werneck, R. F.
2016. 15th International Symposium on Experimental Algorithms, SEA 2016; St. Petersburg; Russian Federation. Ed.: A. Goldberg, 118–133, Springer International Publishing, Cham. doi:10.1007/978-3-319-38851-9_9
Graph Partitioning for Independent Sets.
Lamm, S.; Sanders, P.; Schulz, C.
2015. Experimental Algorithms : 14th International Symposium, SEA 2015, Paris, France, June 29 – July 1, 2015, Proceedings. Ed.: E. Bampis, 68–81, Springer, Cahm. doi:10.1007/978-3-319-20086-6_6
Technische Berichte
Titel Autor Quelle Datum

Alexander Gellner, Sebastian Lamm, Christian Schulz, Darren Strash, Bogdán Zaválnij

arXiv:2008.05180

 
August 2020

Demian Hespe, Sebastian Lamm, Christian Schulz, Darren Strash

arXiv:1908.06795

August 2019

Damir Ferizovic, Demian Hespe, Sebastian Lamm, Matthias Mnich, Christian Schulz, Darren Strash

arXiv:1905.10902

Mai 2019

Sebastian Lamm, Christian Schulz, Darren Strash, Robert Williger, Huashuo Zhang

arXiv:1810.10834

Oktober 2018

Daniel Funke, Sebastian Lamm, Ulrich Meyer, Peter Sanders, Manuel Penschuck, Christian Schulz, Darren Strash, Moritz von Looz

arXiv:1710.07565

Oktober 2017

Peter Sanders, Sebastian Lamm, Lorenz Hübschle-Schneider, Emanuel Schrade und Carsten Dachsbacher

arXiv:1610.05141

Oktober 2016

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

arXiv:1608.05634

August 2016

Jakob Dahlum, Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck

arXiv:1602.01659

Februar 2016

Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck

arXiv:1509.00764

September 2015

Sebastian Lamm, Peter Sanders, Christian Schulz

arXiv:1502.01687

Februar 2015

Lehre

Veranstaltungen
Titel Typ Semester
Praktikum SS 2020
Seminar (S) SS 2020
Vorlesung (V) WS 19/20
Vorlesung (V) SS 2019
Vorlesung (V) WS 18/19
Vorlesung (V) WS 17/18
Offene Abschlussarbeiten
Titel Forschungsthema Betreuer
Problemkern-Reduktion

Sebastian Lamm

Problemkern-Reduktion

Demian Hespe, Sebastian Lamm

Graph Generation, Distributed Computing

Michael Hamann, Sebastian Lamm

Graph Algorithms, Distributed Computing

Sebastian Lamm

Betreute Abschlussarbeiten
Titel Forschungsthema Betreuer Bearbeiter
Problemkern-Reduktion

Peter Sanders, Demian Hespe, Sebastian Lamm, Matthias Mnich, Christian Schulz, Darren Strash

Damir Ferizovic

Verteilte Graphalgorithmen

Peter Sanders, Demian Hespe, Sebastian Lamm

Tom George

Problemkern-Reduktion

Sebastian Lamm, Christian Schulz, Darren Strash, Bogdán Zaválnij

Alexander Gellner