30 citations · 158 across the 36 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.DM2013★ 14 cited
On the Parameterized Complexity of Computing Balanced Partitions in Graphs
René van Bevern, Andreas Emil Feldmann, Manuel Sorge +1
A balanced partition is a clustering of a graph into a given number of equal-sized parts. For instance, the Bisection problem asks to remove at most k edges in order to partition t…
cs.CC2013
A More Complicated Hardness Proof for Finding Densest Subgraphs in Bounded Degree Graphs
Manuel Sorge
We consider the Densest-Subgraph problem, where a graph and an integer k is given and we search for a subgraph on exactly k vertices that induces the maximum number of edges. We pr…