Dr. rer. nat. Sebastian Lamm
- Herr Dr. Lamm hat unser Institut inzwischen verlassen.
- sebastian lamm ∂does-not-exist.kit edu
- github.com/sebalamm
Forschungsschwerpunkte
- Graphenalgorithmen
- Graphgeneration
- Verteilte Algorithmen
- Problemkern-Reduktion
Software
- KaGen - Karlsruhe Graph Generators
- KaMIS - Karlsruhe Maximum Independent Sets
- WeGotYouCovered - Der "Vertex Cover"-Löser, der den PACE 2019 Wettbewerb gewann
- DMAX - Data Reduction for Maximum Cut
- Thrill - Distributed Big Data Batch Processing Framework in C++
Publikationen
Proceedingsbeiträge
Finding Near-Optimal Weight Independent Sets at Scale
Großmann, E.; Lamm, S.; Schulz, C.; Strash, D.
2023. GECCO ’23: Proceedings of the Genetic and Evolutionary Computation Conference. Ed.: S. Silva, 293–302, Association for Computing Machinery (ACM). doi:10.1145/3583131.3590353
Großmann, E.; Lamm, S.; Schulz, C.; Strash, D.
2023. GECCO ’23: Proceedings of the Genetic and Evolutionary Computation Conference. Ed.: S. Silva, 293–302, Association for Computing Machinery (ACM). doi:10.1145/3583131.3590353
Communication-efficient Massively Distributed Connected Components
Lamm, S.; Sanders, P.
2022. 2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS), Lyon, France, 30 May 2022 - 03 June 2022, 302–312, Institute of Electrical and Electronics Engineers (IEEE). doi:10.1109/IPDPS53621.2022.00037
Lamm, S.; Sanders, P.
2022. 2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS), Lyon, France, 30 May 2022 - 03 June 2022, 302–312, Institute of Electrical and Electronics Engineers (IEEE). doi:10.1109/IPDPS53621.2022.00037
Targeted Branching for the Maximum Independent Set Problem
Hespe, D.; Lamm, S.; Schorr, C.
2021. 19th International Symposium on Experimental Algorithms (SEA 2021). Hrsg.: D. Coudert, 17:1–17:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (LZI). doi:10.4230/LIPIcs.SEA.2021.17
Hespe, D.; Lamm, S.; Schorr, C.
2021. 19th International Symposium on Experimental Algorithms (SEA 2021). Hrsg.: D. Coudert, 17:1–17:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (LZI). doi:10.4230/LIPIcs.SEA.2021.17
Boosting data reduction for the maximum weight independent set problem using increasing transformations
Gellner, A.; Lamm, S.; Schulz, C.; Strash, D.; Zaválnij, B.
2021. 2021 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX). Ed.: M. Farach-Colton, 128–142, Society for Industrial and Applied Mathematics (SIAM). doi:10.1137/1.9781611976472.10
Gellner, A.; Lamm, S.; Schulz, C.; Strash, D.; Zaválnij, B.
2021. 2021 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX). Ed.: M. Farach-Colton, 128–142, Society for Industrial and Applied Mathematics (SIAM). doi:10.1137/1.9781611976472.10
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 (SIAM). doi:10.1137/1.9781611976229.1
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 (SIAM). 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 (SIAM). doi:10.1137/1.9781611976007.3
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 (SIAM). doi:10.1137/1.9781611976007.3
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). doi:10.1137/1.9781611975499.12
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). doi:10.1137/1.9781611975499.12
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, Institute of Electrical and Electronics Engineers (IEEE). doi:10.1109/IPDPS.2018.00043
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, Institute of Electrical and Electronics Engineers (IEEE). doi:10.1109/IPDPS.2018.00043
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 (SIAM). doi:10.1137/1.9781611974317.12
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 (SIAM). 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, Institute of Electrical and Electronics Engineers (IEEE). doi:10.1109/BigData.2016.7840603
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.7840603
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. doi:10.1007/978-3-319-38851-9_9
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. 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. doi:10.1007/978-3-319-20086-6_6
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. doi:10.1007/978-3-319-20086-6_6
Zeitschriftenaufsätze
Communication-free massively distributed graph generation
Funke, D.; Lamm, S.; Meyer, U.; Penschuck, M.; Sanders, P.; Schulz, C.; Strash, D.; Looz, M. von
2019. Journal of parallel and distributed computing, 131, 200–217. doi:10.1016/j.jpdc.2019.03.011
Funke, D.; Lamm, S.; Meyer, U.; Penschuck, M.; Sanders, P.; Schulz, C.; Strash, D.; Looz, M. von
2019. Journal of parallel and distributed computing, 131, 200–217. doi:10.1016/j.jpdc.2019.03.011
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
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
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
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
Dissertationen
Scalable Graph Algorithms using Practically Efficient Data Reductions. Dissertation
Lamm, S. E.
2022, August 12. Karlsruher Institut für Technologie (KIT). doi:10.5445/IR/1000149655
Lamm, S. E.
2022, August 12. Karlsruher Institut für Technologie (KIT). doi:10.5445/IR/1000149655
Buchaufsätze
Recent Advances in Scalable Network Generation1
Penschuck, M.; Brandes, U.; Hamann, M.; Lamm, S.; Meyer, U.; Safro, I.; Sanders, P.; Schulz, C.
2022. Massive Graph Analytics. Ed.: D.A. Bader, 333–376, Chapman and Hall/CRC. doi:10.1201/9781003033707-16
Penschuck, M.; Brandes, U.; Hamann, M.; Lamm, S.; Meyer, U.; Safro, I.; Sanders, P.; Schulz, C.
2022. Massive Graph Analytics. Ed.: D.A. Bader, 333–376, Chapman and Hall/CRC. doi:10.1201/9781003033707-16
| Titel | Autor | Quelle | Datum |
|---|---|---|---|
| Finding Near-Optimal Weight Independent Sets at Scale | Ernestine Großmann, Sebastian Lamm, Christian Schulz, Darren Strash |
September 2022 | |
| Targeted Branching for the Maximum Independent Set Problem | Demian Hespe, Sebastian Lamm, Christian Schorr |
Februar 2021 | |
| 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 |
|
August 2020 |
| WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track | Demian Hespe, Sebastian Lamm, Christian Schulz, Darren Strash |
August 2019 | |
| Engineering Kernelization for Maximum Cut | Damir Ferizovic, Demian Hespe, Sebastian Lamm, Matthias Mnich, Christian Schulz, Darren Strash |
Mai 2019 | |
| Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs | Sebastian Lamm, Christian Schulz, Darren Strash, Robert Williger, Huashuo Zhang |
Oktober 2018 | |
| Communication-free Massively Distributed Graph Generation | Daniel Funke, Sebastian Lamm, Ulrich Meyer, Peter Sanders, Manuel Penschuck, Christian Schulz, Darren Strash, Moritz von Looz |
Oktober 2017 | |
| Efficient Random Sampling – Parallel, Vectorized, Cache-Efficient, and Online | Peter Sanders, Sebastian Lamm, Lorenz Hübschle-Schneider, Emanuel Schrade und Carsten Dachsbacher |
Oktober 2016 | |
| 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 |
August 2016 | |
| Accelerating Local Search for the Maximum Independent Set Problem | Jakob Dahlum, Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck |
Februar 2016 | |
| Finding Near-Optimal Independent Sets at Scale | Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck |
September 2015 | |
| Graph Partitioning for Independent Sets | Sebastian Lamm, Peter Sanders, Christian Schulz |
Februar 2015 |
| Titel | Typ | Semester |
|---|---|---|
| Praxis der Softwareentwicklung (PSE) - Graphbasiertes Empfehlungssystem für Publikationen | Praktikum | SS 2021 |
| Effizientes paralleles C++ | Praktikum (P) | WS 20/21 |
| Praxis der Softwareentwicklung (PSE) - Graphbasiertes Empfehlungssystem für Publikationen | Praktikum | 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 |
| Titel | Forschungsthema | Betreuer | Bearbeiter |
|---|---|---|---|
| Improved Branching Strategies for Maximum Independent Sets | Problemkern-Reduktion | Demian Hespe, Sebastian Lamm, Peter Sanders |
Christian Schorr |
| Communication-free Generation of Graphs with Planted Communities | Graph Generation | Michael Hamann, Sebastian Lamm |
Adrian Feilhauer |
| A Practical Analysis of Kernelization Techniques for the Maximum Cut Problem | Problemkern-Reduktion | Peter Sanders, Demian Hespe, Sebastian Lamm, Matthias Mnich, Christian Schulz, Darren Strash |
Damir Ferizovic |
| Distributed Kernelization for Independent Sets | Verteilte Graphalgorithmen | Peter Sanders, Demian Hespe, Sebastian Lamm |
Tom George |
| Engineering Generalized Reductions for the Maximum Weight Independent Set Problem | Problemkern-Reduktion | Sebastian Lamm, Christian Schulz, Darren Strash, Bogdán Zaválnij |
Alexander Gellner |
| Communication Efficient Triangle Counting | Verteilte Graphalgorithmen | Sebastian Lamm, Peter Sanders |
Tim Niklas Uhl |