- Graphenalgorithmen
- Graphgeneration
- Verteilte Algorithmen
- Problemkern-Reduktion
 |
 M.Sc. Sebastian Lamm |
|
|
Raum: 210 Tel.: +49 721 608-45270 Fax: +49 721 608-43088 sebastian lammZxy8∂kit edu |
|
|
Forschungsschwerpunkte
Software
- KaGen - Karlsruhe Graph Generators
- KaMIS - Karlsruhe Maximum Independent Sets
- WeGotYouCovered - Der "Vertex Cover"-Löser, der den PACE 2019 Wettbewerb gewann
- Thrill - Distributed Big Data Batch Processing Framework in C++
Publikationen
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
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
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
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
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
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.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, IEEE, Piscataway (NJ). 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, Cham. 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, 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
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
| Titel | Autor | Quelle | Datum |
|---|---|---|---|
| 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 | |
| WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track | Demian Hespe, Sebastian Lamm, Christian Schulz, Darren Strash |
August 2019 | |
| Graph Partitioning for Independent Sets | Sebastian Lamm, Peter Sanders, Christian Schulz |
Februar 2015 | |
| Accelerating Local Search for the Maximum Independent Set Problem | Jakob Dahlum, Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck |
Februar 2016 | |
| Engineering Kernelization for Maximum Cut | Damir Ferizovic, Demian Hespe, Sebastian Lamm, Matthias Mnich, Christian Schulz, Darren Strash |
Mai 2019 | |
| Efficient Random Sampling – Parallel, Vectorized, Cache-Efficient, and Online | Peter Sanders, Sebastian Lamm, Lorenz Hübschle-Schneider, Emanuel Schrade und Carsten Dachsbacher |
Oktober 2016 | |
| 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 | |
| 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 | |
| Finding Near-Optimal Independent Sets at Scale | Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck |
September 2015 |
| Titel | Tagung | Datum |
|---|---|---|
| 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 |
Januar 2019 |
| Communication-free Massively Distributed Graph Generation | IPDPS 2018 |
Juni 2018 |
| Examples of Massively Parallel Non-Numerical Algorithms | NIC Symposium 2018 |
Februar 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 |
Juni 2016 |
| Graph Partitioning for Independent Sets | SEA 2015 |
Juni 2015 |
Lehre
| Titel | Typ | Semester |
|---|---|---|
| Algorithm Engineering | Vorlesung (V) | SS 2019 |
| Algorithmen II | Vorlesung (V) | WS 18/19 |
| Parallele Algorithmen | Vorlesung (V) | WS 17/18 |
| Titel | Forschungsthema | Betreuer |
|---|---|---|
| Distributed Graph Generation | Graph Generation, Distributed Computing | Michael Hamann, Sebastian Lamm |
| Kernelization for Independent Sets | Problemkern-Reduktion | Demian Hespe, Sebastian Lamm |
| Titel | Forschungsthema | Betreuer | Bearbeiter |
|---|---|---|---|
| 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 |
