Sebastian Lamm | DeepAI

AI Chat

Featured Co-authors

Christian Schulz
62 publications
Peter Sanders
53 publications
Ilya Safro
39 publications
Matthias Mnich
28 publications
Darren Strash
20 publications
Manuel Penschuck
14 publications
Alexander Noe
11 publications
Ulrich Meyer
9 publications
Michael Hamann
9 publications
Ulrik Brandes
8 publications
Lorenz Hübschle-Schneider
7 publications

∙ 08/29/2022

Finding Near-Optimal Weight Independent Sets at Scale

Computing maximum weight independent sets in graphs is an important NP-h...

0 Ernestine Großmann, et al. ∙

∙ 02/02/2021

Targeted Branching for the Maximum Independent Set Problem

Finding a maximum independent set is a fundamental NP-hard problem that ...

0 Demian Hespe, et al. ∙

∙ 12/23/2020

Recent Advances in Practical Data Reduction

Over the last two decades, significant advances have been made in the de...

0 Faisal Abu-Khzam, et al. ∙

∙ 08/12/2020

Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations

Given a vertex-weighted graph, the maximum weight independent set proble...

14 Alexander Gellner, et al. ∙

∙ 03/02/2020

Recent Advances in Scalable Network Generation

Random graph models are frequently used as a controllable and versatile ...

0 Manuel Penschuck, et al. ∙

∙ 08/19/2019

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

We present the winning solver of the PACE 2019 Implementation Challenge,...

0 Demian Hespe, et al. ∙

∙ 05/26/2019

Engineering Kernelization for Maximum Cut

Kernelization is a general theoretical framework for preprocessing insta...

0 Damir Ferizovic, et al. ∙

∙ 10/25/2018

Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs

One powerful technique to solve NP-hard optimization problems in practic...

0 Sebastian Lamm, et al. ∙

∙ 10/20/2017

Communication-free Massively Distributed Graph Generation

Analyzing massive complex networks yields promising insights about our e...

0 Daniel Funke, et al. ∙

∙ 10/17/2016

Efficient Random Sampling - Parallel, Vectorized, Cache-Efficient, and Online

We consider the problem of sampling n numbers from the range {1,...,N} w...

0 Peter Sanders, et al. ∙

∙ 09/02/2015

Finding Near-Optimal Independent Sets at Scale

The independent set problem is NP-hard and particularly difficult to sol...

0 Sebastian Lamm, et al. ∙

∙ 02/05/2015

Graph Partitioning for Independent Sets

Computing maximum independent sets in graphs is an important problem in ...

0 Sebastian Lamm, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world