%0 Conference Paper %1 conf/approx/ChlamtacDKKR16 %A Chlamtác, Eden %A Dinitz, Michael %A Konrad, Christian %A Kortsarz, Guy %A Rabanca, George %B APPROX-RANDOM %D 2016 %E Jansen, Klaus %E Mathieu, Claire %E Rolim, José D. P. %E Umans, Chris %I Schloss Dagstuhl - Leibniz-Zentrum für Informatik %K %P 6:1-6:19 %T The Densest k-Subhypergraph Problem. %U http://dblp.uni-trier.de/db/conf/approx/approx2016.html#ChlamtacDKKR16 %V 60 %@ 978-3-95977-018-7

@inproceedings{conf/approx/ChlamtacDKKR16, added-at = {2023-12-14T15:35:49.000+0100}, author = {Chlamtác, Eden and Dinitz, Michael and Konrad, Christian and Kortsarz, Guy and Rabanca, George}, biburl = {https://www.bibsonomy.org/bibtex/24b9e570ea7a0b78e06c258fd697622e6/admin}, booktitle = {APPROX-RANDOM}, crossref = {conf/approx/2016}, editor = {Jansen, Klaus and Mathieu, Claire and Rolim, José D. P. and Umans, Chris}, ee = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2016.6}, interhash = {ed229b61bf5f659ea04edac41c0c3c4d}, intrahash = {4b9e570ea7a0b78e06c258fd697622e6}, isbn = {978-3-95977-018-7}, keywords = {}, pages = {6:1-6:19}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, series = {LIPIcs}, timestamp = {2023-12-14T15:35:49.000+0100}, title = {The Densest k-Subhypergraph Problem.}, url = {http://dblp.uni-trier.de/db/conf/approx/approx2016.html#ChlamtacDKKR16}, volume = 60, year = 2016 }