activity
20102026
most citedH-Index Manipulation by Merging Articles: Models, Theory, and Experiments

30 citations · 158 across the 36 of their papers we have counts for

collaborators
Showing 2013 · cs.CCShow all

1 paper · 2 filters

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…