31 citations · 155 across the 25 of their papers we have counts for
3 papers · 1 filter
Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs
Sebastian Lamm, Christian Schulz, Darren Strash +2
One powerful technique to solve NP-hard optimization problems in practice is branch-and-reduce search---which is branch-and-bound that intermixes branching with reductions to decre…
Scalable Edge Partitioning
Sebastian Schlag, Christian Schulz, Daniel Seemaier +1
Edge-centric distributed computations have appeared as a recent technique to improve the shortcomings of think-like-a-vertex algorithms on large scale-free networks. In order to in…
Convexity-Increasing Morphs of Planar Graphs
Linda Kleist, Boris Klemz, Anna Lubiw +3
We study the problem of convexifying drawings of planar graphs. Given any planar straight-line drawing of an internally 3-connected graph, we show how to morph the drawing to one w…