Graph Partitioning for Independent Sets. - Sebastian Lamm; Peter Sanders 001; Christian Schulz 003 (SEA, 2015)

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 001 (IEEE BigData, 2016)

Accelerating Local Search for the Maximum Independent Set Problem. - Jakob Dahlum; Sebastian Lamm; Peter Sanders 001; Christian Schulz 003; Darren Strash; Renato F. Werneck (SEA, 2016)

Efficient Random Sampling - Parallel, Vectorized, Cache-Efficient, and Online. - Peter Sanders 001; Sebastian Lamm; Lorenz Hübschle-Schneider; Emanuel Schrade; Carsten Dachsbacher (CoRR, 2016)

Finding near-optimal independent sets at scale. - Sebastian Lamm; Peter Sanders 001; Christian Schulz 003; Darren Strash; Renato F. Werneck (J. Heuristics, 2017)

Communication-Free Massively Distributed Graph Generation. - Daniel Funke; Sebastian Lamm; Peter Sanders 001; Christian Schulz 003; Darren Strash; Moritz von Looz (IPDPS, 2018)

Efficient Parallel Random Sampling - Vectorized, Cache-Efficient, and Online. - Peter Sanders 001; Sebastian Lamm; Lorenz Hübschle-Schneider; Emanuel Schrade; Carsten Dachsbacher (ACM Trans. Math. Softw., 2018)

Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs. - Sebastian Lamm; Christian Schulz 003; Darren Strash; Robert Williger; Huashuo Zhang (ALENEX, 2019)

WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track. - Demian Hespe; Sebastian Lamm; Christian Schulz 003; Darren Strash (CoRR, 2019)

Communication-free massively distributed graph generation. - Daniel Funke; Sebastian Lamm; Ulrich Meyer 001; Manuel Penschuck; Peter Sanders 001; Christian Schulz 003; Darren Strash; Moritz von Looz (J. Parallel Distributed Comput., 2019)

Engineering Kernelization for Maximum Cut. - Damir Ferizovic; Demian Hespe; Sebastian Lamm; Matthias Mnich; Christian Schulz 003; Darren Strash (ALENEX, 2020)

WeGotYouCovered: The Winning Solver from the PACE 2019 Challenge, Vertex Cover Track. - Demian Hespe; Sebastian Lamm; Christian Schulz 003; Darren Strash (CSC, 2020)

Recent Advances in Scalable Network Generation. - Manuel Penschuck; Ulrik Brandes; Michael Hamann; Sebastian Lamm; Ulrich Meyer 001; Ilya Safro; Peter Sanders 001; Christian Schulz 003 (CoRR, 2020)

Recent Advances in Practical Data Reduction. - Faisal N. Abu-Khzam; Sebastian Lamm; Matthias Mnich; Alexander Noe; Christian Schulz 003; Darren Strash (CoRR, 2020)

Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations. - Alexander Gellner; Sebastian Lamm; Christian Schulz 003; Darren Strash; Bogdán Zaválnij (ALENEX, 2021)

Targeted Branching for the Maximum Independent Set Problem. - Demian Hespe; Sebastian Lamm; Christian Schorr (SEA, 2021)

Recent Advances in Scalable Network Generation1. - Manuel Penschuck; Ulrik Brandes; Michael Hamann; Sebastian Lamm; Ulrich Meyer 001; Ilya Safro; Peter Sanders 001; Christian Schulz 003 (Massive Graph Analytics, 2022)

Recent Advances in Practical Data Reduction. - Faisal N. Abu-Khzam; Sebastian Lamm; Matthias Mnich; Alexander Noe; Christian Schulz 003; Darren Strash (Algorithms for Big Data, 2022)

Communication-efficient Massively Distributed Connected Components. - Sebastian Lamm; Peter Sanders 001 (IPDPS, 2022)

Scalable Graph Algorithms using Practically Efficient Data Reductions. - Sebastian Lamm (2022)

Finding Near-Optimal Weight Independent Sets at Scale. - Ernestine Großmann; Sebastian Lamm; Christian Schulz 003; Darren Strash (J. Graph Algorithms Appl., 2024)