Sebastian Lamm

Dr. rer. nat. Sebastian Lamm

Research Interests

Graph Algorithms
Graph Generation
Distributed Computing
Kernelization

Software

KaGen - Karlsruhe Graph Generators
KaMIS - Karlsruhe Maximum Independent Sets
WeGotYouCovered - The Vertex Cover Solver that won the PACE 2019 challenge
DMAX - Data Reduction for Maximum Cut
Thrill - Distributed Big Data Batch Processing Framework in C++

Publications

Technical Reports
Title	Author(s)	Source	Date
WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track	Demian Hespe, Sebastian Lamm, Christian Schulz, Darren Strash	arXiv:1908.06795	August 2019
Thrill: High-Performance Algorithmic Distributed Batch Data Processing with C++	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
Targeted Branching for the Maximum Independent Set Problem	Demian Hespe, Sebastian Lamm, Christian Schorr	arXiv:2102.01540	February 2021
Graph Partitioning for Independent Sets	Sebastian Lamm, Peter Sanders, Christian Schulz	arXiv:1502.01687	February 2015
Finding Near-Optimal Weight Independent Sets at Scale	Ernestine Großmann, Sebastian Lamm, Christian Schulz, Darren Strash	arXiv:2208.13645	September 2022
Finding Near-Optimal Independent Sets at Scale	Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck	arXiv:1509.00764	September 2015
Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs	Sebastian Lamm, Christian Schulz, Darren Strash, Robert Williger, Huashuo Zhang	arXiv:1810.10834	October 2018
Engineering Kernelization for Maximum Cut	Damir Ferizovic, Demian Hespe, Sebastian Lamm, Matthias Mnich, Christian Schulz, Darren Strash	arXiv:1905.10902	May 2019
Efficient Random Sampling – Parallel, Vectorized, Cache-Efficient, and Online	Peter Sanders, Sebastian Lamm, Lorenz Hübschle-Schneider, Emanuel Schrade, and Carsten Dachsbacher	arXiv:1610.05141	October 2016
Communication-free Massively Distributed Graph Generation	Daniel Funke, Sebastian Lamm, Ulrich Meyer, Peter Sanders, Manuel Penschuck, Christian Schulz, Darren Strash, Moritz von Looz	arXiv:1710.07565	October 2017
Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations	Alexander Gellner, Sebastian Lamm, Christian Schulz, Darren Strash, Bogdán Zaválnij	arXiv:2008.05180	August 2020
Accelerating Local Search for the Maximum Independent Set Problem	Jakob Dahlum, Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck	arXiv:1602.01659	February 2016

Presentations
Title	Conference	Date
Communication-efficient Massively Distributed Connected Components	IPDPS 2022	May 2022
Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations	ALENEX 2021	January 2021
Fundamental Graph Algorithms	KSETA Topical Course	March 2020
Engineering Kernelization for Maximum Cut	ALENEX 2020	January 2020
Engineering Kernelization for Maximum Cut	NII Shonan Meeting No.144	March 2019
Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs	ALENEX 2019	January 2019
Communication-free Massively Distributed Graph Generation	IPDPS 2018	June 2018
Examples of Massively Parallel Non-Numerical Algorithms	NIC Symposium 18	February 2018
Communication-free Massively Distributed Graph Generation	Research Talk	November 2017
Fundamental Graph Algorithms	KSETA Topical Course	September 2017
Accelerating Local Search for the Maximum Independent Set Problem	SEA 2016	June 2016
Graph Partitioning for Independent Sets	SEA 2015	June 2015

Teaching

Courses
Title	Type	Semester
Praxis der Softwareentwicklung (PSE) - Graphbasiertes Empfehlungssystem für Publikationen	Lab course	SS 2021
Effizientes paralleles C++	Praktikum (P)	WS 20/21
Praxis der Softwareentwicklung (PSE) - Graphbasiertes Empfehlungssystem für Publikationen	Lab course	SS 2020
Seminar: Scalable Parallel Graph Algorithms	Seminar (S)	SS 2020
Algorithmen II	Vorlesung (V)	WS 19/20
Algorithm Engineering	Vorlesung (V)	SS 2019
Algorithmen II	Vorlesung (V)	WS 18/19
Parallele Algorithmen	Vorlesung (V)	WS 17/18

Open Theses
Title	Subject	Supervisor

Supervised Theses
Title	Subject	Supervisor	Student
Communication Efficient Triangle Counting	Distributed Graph Algorithms	Sebastian Lamm, Peter Sanders	Tim Niklas Uhl
Communication-free Generation of Graphs with Planted Communities	Graph Generation	Michael Hamann, Sebastian Lamm	Adrian Feilhauer
Improved Branching Strategies for Maximum Independent Sets	Kernelization	Demian Hespe, Sebastian Lamm, Peter Sanders	Christian Schorr
Engineering Generalized Reductions for the Maximum Weight Independent Set Problem	Kernelization	Sebastian Lamm, Christian Schulz, Darren Strash, Bogdán Zaválnij	Alexander Gellner
A Practical Analysis of Kernelization Techniques for the Maximum Cut Problem	Kernelization	Peter Sanders, Demian Hespe, Sebastian Lamm, Matthias Mnich, Christian Schulz, Darren Strash	Damir Ferizovic
Distributed Kernelization for Independent Sets	Distributed Graph Algorithms	Peter Sanders, Demian Hespe, Sebastian Lamm	Tom George