%0 Conference Paper %1 conf/waw/AndersenC09 %A Andersen, Reid %A Chellapilla, Kumar %B WAW %D 2009 %E Avrachenkov, Konstantin %E Donato, Debora %E Litvak, Nelly %I Springer %K dblp %P 25-37 %T Finding Dense Subgraphs with Size Bounds. %U http://dblp.uni-trier.de/db/conf/waw/waw2009.html#AndersenC09 %V 5427 %@ 978-3-540-95994-6

@inproceedings{conf/waw/AndersenC09, added-at = {2017-05-24T00:00:00.000+0200}, author = {Andersen, Reid and Chellapilla, Kumar}, biburl = {https://www.bibsonomy.org/bibtex/2683d6bd5fb1bdbe7c7d3cd83637088df/dblp}, booktitle = {WAW}, crossref = {conf/waw/2009}, editor = {Avrachenkov, Konstantin and Donato, Debora and Litvak, Nelly}, ee = {https://doi.org/10.1007/978-3-540-95995-3_3}, interhash = {a15e130c21d8d0d6fd12253f4132ed1b}, intrahash = {683d6bd5fb1bdbe7c7d3cd83637088df}, isbn = {978-3-540-95994-6}, keywords = {dblp}, pages = {25-37}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T18:00:45.000+0200}, title = {Finding Dense Subgraphs with Size Bounds.}, url = {http://dblp.uni-trier.de/db/conf/waw/waw2009.html#AndersenC09}, volume = 5427, year = 2009 }