%0 Journal Article %1 journals/algorithmica/KawaseM18 %A Kawase, Yasushi %A Miyauchi, Atsushi %D 2018 %J Algorithmica %K dblp %N 12 %P 3461-3480 %T The Densest Subgraph Problem with a Convex/Concave Size Function. %U http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica80.html#KawaseM18 %V 80

@article{journals/algorithmica/KawaseM18, added-at = {2020-02-18T00:00:00.000+0100}, author = {Kawase, Yasushi and Miyauchi, Atsushi}, biburl = {https://www.bibsonomy.org/bibtex/250bc9a53e6e1c79698e3d42436c87eab/dblp}, ee = {https://doi.org/10.1007/s00453-017-0400-7}, interhash = {d205831357b1b9008407eda11a40cc2a}, intrahash = {50bc9a53e6e1c79698e3d42436c87eab}, journal = {Algorithmica}, keywords = {dblp}, number = 12, pages = {3461-3480}, timestamp = {2020-02-19T11:53:26.000+0100}, title = {The Densest Subgraph Problem with a Convex/Concave Size Function.}, url = {http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica80.html#KawaseM18}, volume = 80, year = 2018 }