135 citations · 211 across the 20 of their papers we have counts for
1 paper · 2 filters
René van Bevern, Robert Bredereck, Laurent Bulteau +4
The partition of graphs into "nice" subgraphs is a central algorithmic problem with strong ties to matching theory. We study the partitioning of undirected graphs into same-size st…