31 citations · 155 across the 25 of their papers we have counts for
4 papers · 2 filters
Efficiently Enumerating all Maximal Cliques with Bit-Parallelism
Pablo San Segundo, Jorge Artieda, Darren Strash
The maximal clique enumeration (MCE) problem has numerous applications in biology, chemistry, sociology, and graph modeling. Though this problem is well studied, most current resea…
Reconstructing Generalized Staircase Polygons with Uniform Step Length
Nodari Sitchinava, Darren Strash
Visibility graph reconstruction, which asks us to construct a polygon that has a given visibility graph, is a fundamental problem with unknown complexity (although visibility graph…
Practical Minimum Cut Algorithms
Monika Henzinger, Alexander Noe, Christian Schulz +1
The minimum cut problem for an undirected edge-weighted graph asks us to divide its set of nodes into two blocks while minimizing the weight sum of the cut edges. Here, we introduc…
Scalable Kernelization for Maximum Independent Sets
Demian Hespe, Christian Schulz, Darren Strash
The most efficient algorithms for finding maximum independent sets in both theory and practice use reduction rules to obtain a much smaller problem instance called a kernel. The ke…