Sebastian Lamm

Orcid: 0000-0001-7828-921X

According to our database1, Sebastian Lamm authored at least 21 papers between 2015 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Finding Near-Optimal Weight Independent Sets at Scale.
J. Graph Algorithms Appl., 2024

2022
Scalable Graph Algorithms using Practically Efficient Data Reductions.
PhD thesis, 2022

Communication-efficient Massively Distributed Connected Components.
Proceedings of the 2022 IEEE International Parallel and Distributed Processing Symposium, 2022

Recent Advances in Practical Data Reduction.
Proceedings of the Algorithms for Big Data - DFG Priority Program 1736, 2022

Recent Advances in Scalable Network Generation1.
Proceedings of the Massive Graph Analytics, 2022

2021
Targeted Branching for the Maximum Independent Set Problem.
Proceedings of the 19th International Symposium on Experimental Algorithms, 2021

Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations.
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2021

2020
Recent Advances in Practical Data Reduction.
CoRR, 2020

Recent Advances in Scalable Network Generation.
CoRR, 2020

WeGotYouCovered: The Winning Solver from the PACE 2019 Challenge, Vertex Cover Track.
Proceedings of the SIAM Workshop on Combinatorial Scientific Computing, 2020

Engineering Kernelization for Maximum Cut.
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2020

2019
Communication-free massively distributed graph generation.
J. Parallel Distributed Comput., 2019

WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track.
CoRR, 2019

Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs.
Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments, 2019

2018
Efficient Parallel Random Sampling - Vectorized, Cache-Efficient, and Online.
ACM Trans. Math. Softw., 2018

Communication-Free Massively Distributed Graph Generation.
Proceedings of the 2018 IEEE International Parallel and Distributed Processing Symposium, 2018

2017
Finding near-optimal independent sets at scale.
J. Heuristics, 2017

2016
Efficient Random Sampling - Parallel, Vectorized, Cache-Efficient, and Online.
CoRR, 2016

Accelerating Local Search for the Maximum Independent Set Problem.
Proceedings of the Experimental Algorithms - 15th International Symposium, 2016

Thrill: High-performance algorithmic distributed batch data processing with C++.
Proceedings of the 2016 IEEE International Conference on Big Data (IEEE BigData 2016), 2016

2015
Graph Partitioning for Independent Sets.
Proceedings of the Experimental Algorithms - 14th International Symposium, 2015


  Loading...