default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSebastian Lamm
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c12]Ernestine Großmann
, Sebastian Lamm, Christian Schulz, Darren Strash:
Finding Near-Optimal Weight Independent Sets at Scale. GECCO 2023: 293-302- 2022
- [b1]Sebastian Lamm:
Scalable Graph Algorithms using Practically Efficient Data Reductions. Karlsruhe Institute of Technology, Germany, 2022 - [c11]Sebastian Lamm, Peter Sanders:
Communication-efficient Massively Distributed Connected Components. IPDPS 2022: 302-312 - [p2]Manuel Penschuck, Ulrik Brandes, Michael Hamann, Sebastian Lamm, Ulrich Meyer, Ilya Safro, Peter Sanders, Christian Schulz:
Recent Advances in Scalable Network Generation1. Massive Graph Analytics 2022: 333-376 - [p1]Faisal N. Abu-Khzam, Sebastian Lamm, Matthias Mnich, Alexander Noe, Christian Schulz, Darren Strash:
Recent Advances in Practical Data Reduction. Algorithms for Big Data 2022: 97-133 - [i14]Ernestine Großmann, Sebastian Lamm, Christian Schulz, Darren Strash:
Finding Near-Optimal Weight Independent Sets at Scale. CoRR abs/2208.13645 (2022) - 2021
- [c10]Alexander Gellner, Sebastian Lamm, Christian Schulz, Darren Strash, Bogdán Zaválnij:
Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations. ALENEX 2021: 128-142 - [c9]Demian Hespe, Sebastian Lamm, Christian Schorr:
Targeted Branching for the Maximum Independent Set Problem. SEA 2021: 17:1-17:21 - [i13]Demian Hespe, Sebastian Lamm, Christian Schorr:
Targeted Branching for the Maximum Independent Set Problem. CoRR abs/2102.01540 (2021) - 2020
- [c8]Damir Ferizovic, Demian Hespe, Sebastian Lamm, Matthias Mnich, Christian Schulz, Darren Strash:
Engineering Kernelization for Maximum Cut. ALENEX 2020: 27-41 - [c7]Demian Hespe, Sebastian Lamm, Christian Schulz, Darren Strash:
WeGotYouCovered: The Winning Solver from the PACE 2019 Challenge, Vertex Cover Track. CSC 2020: 1-11 - [i12]Manuel Penschuck, Ulrik Brandes, Michael Hamann, Sebastian Lamm, Ulrich Meyer, Ilya Safro, Peter Sanders, Christian Schulz:
Recent Advances in Scalable Network Generation. CoRR abs/2003.00736 (2020) - [i11]Alexander Gellner, Sebastian Lamm, Christian Schulz, Darren Strash, Bogdán Zaválnij:
Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations. CoRR abs/2008.05180 (2020) - [i10]Faisal N. Abu-Khzam, Sebastian Lamm, Matthias Mnich, Alexander Noe, Christian Schulz, Darren Strash:
Recent Advances in Practical Data Reduction. CoRR abs/2012.12594 (2020)
2010 – 2019
- 2019
- [j3]Daniel Funke, Sebastian Lamm, Ulrich Meyer, Manuel Penschuck, Peter Sanders, Christian Schulz, Darren Strash, Moritz von Looz:
Communication-free massively distributed graph generation. J. Parallel Distributed Comput. 131: 200-217 (2019) - [c6]Sebastian Lamm, Christian Schulz, Darren Strash, Robert Williger, Huashuo Zhang:
Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs. ALENEX 2019: 144-158 - [i9]Damir Ferizovic, Demian Hespe, Sebastian Lamm, Matthias Mnich, Christian Schulz, Darren Strash:
Engineering Kernelization for Maximum Cut. CoRR abs/1905.10902 (2019) - [i8]Demian Hespe, Sebastian Lamm, Christian Schulz, Darren Strash:
WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track. CoRR abs/1908.06795 (2019) - 2018
- [j2]Peter Sanders, Sebastian Lamm, Lorenz Hübschle-Schneider, Emanuel Schrade, Carsten Dachsbacher:
Efficient Parallel Random Sampling - Vectorized, Cache-Efficient, and Online. ACM Trans. Math. Softw. 44(3): 29:1-29:14 (2018) - [c5]Daniel Funke, Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Moritz von Looz:
Communication-Free Massively Distributed Graph Generation. IPDPS 2018: 336-347 - [i7]Sebastian Lamm, Christian Schulz, Darren Strash, Robert Williger, Huashuo Zhang:
Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs. CoRR abs/1810.10834 (2018) - 2017
- [j1]Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck:
Finding near-optimal independent sets at scale. J. Heuristics 23(4): 207-229 (2017) - [i6]Daniel Funke, Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Moritz von Looz:
Communication-free Massively Distributed Graph Generation. CoRR abs/1710.07565 (2017) - 2016
- [c4]Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck:
Finding Near-Optimal Independent Sets at Scale. ALENEX 2016: 138-150 - [c3]Timo Bingmann, Michael Axtmann, Emanuel Jöbstl, Sebastian Lamm, Huyen Chau Nguyen, Alexander Noe, Sebastian Schlag, Matthias Stumpp, Tobias Sturm, Peter Sanders:
Thrill: High-performance algorithmic distributed batch data processing with C++. IEEE BigData 2016: 172-183 - [c2]Jakob Dahlum, Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck:
Accelerating Local Search for the Maximum Independent Set Problem. SEA 2016: 118-133 - [i5]Jakob Dahlum, Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck:
Accelerating Local Search for the Maximum Independent Set Problem. CoRR abs/1602.01659 (2016) - [i4]Timo Bingmann, Michael Axtmann, Emanuel Jöbstl, Sebastian Lamm, Huyen Chau Nguyen, Alexander Noe, Sebastian Schlag, Matthias Stumpp, Tobias Sturm, Peter Sanders:
Thrill: High-Performance Algorithmic Distributed Batch Data Processing with C++. CoRR abs/1608.05634 (2016) - [i3]Peter Sanders, Sebastian Lamm, Lorenz Hübschle-Schneider, Emanuel Schrade, Carsten Dachsbacher:
Efficient Random Sampling - Parallel, Vectorized, Cache-Efficient, and Online. CoRR abs/1610.05141 (2016) - 2015
- [c1]Sebastian Lamm, Peter Sanders, Christian Schulz:
Graph Partitioning for Independent Sets. SEA 2015: 68-81 - [i2]Sebastian Lamm, Peter Sanders, Christian Schulz:
Graph Partitioning for Independent Sets. CoRR abs/1502.01687 (2015) - [i1]Sebastian Lamm, Peter Sanders, Christian Schulz, Darren Strash, Renato F. Werneck:
Finding Near-Optimal Independent Sets at Scale. CoRR abs/1509.00764 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
