Manuel Sorge: A More Complicated Hardness Proof for Finding Densest Subgraphs in Bounded Degree Graphs. CoRR abs/1306.6598 (2013)