@article{DBLP:journals/siamdm/ChlamtacDKKR18,
  author    = {Eden Chlamt{\'{a}}c and
               Michael Dinitz and
               Christian Konrad and
               Guy Kortsarz and
               George Rabanca},
  title     = {The Densest k-Subhypergraph Problem},
  journal   = {{SIAM} J. Discret. Math.},
  volume    = {32},
  number    = {2},
  pages     = {1458--1477},
  year      = {2018},
  url       = {https://doi.org/10.1137/16M1096402},
  doi       = {10.1137/16M1096402},
  timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamdm/ChlamtacDKKR18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

{"_id":"8yXKzXZsJfvxdWQs4","bibbaseid":"chlamtc-dinitz-konrad-kortsarz-rabanca-thedensestksubhypergraphproblem-2018","authorIDs":[],"author_short":["Chlamtác, E.","Dinitz, M.","Konrad, C.","Kortsarz, G.","Rabanca, G."],"bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Eden"],"propositions":[],"lastnames":["Chlamtác"],"suffixes":[]},{"firstnames":["Michael"],"propositions":[],"lastnames":["Dinitz"],"suffixes":[]},{"firstnames":["Christian"],"propositions":[],"lastnames":["Konrad"],"suffixes":[]},{"firstnames":["Guy"],"propositions":[],"lastnames":["Kortsarz"],"suffixes":[]},{"firstnames":["George"],"propositions":[],"lastnames":["Rabanca"],"suffixes":[]}],"title":"The Densest k-Subhypergraph Problem","journal":"SIAM J. Discret. Math.","volume":"32","number":"2","pages":"1458–1477","year":"2018","url":"https://doi.org/10.1137/16M1096402","doi":"10.1137/16M1096402","timestamp":"Sat, 25 Apr 2020 01:00:00 +0200","biburl":"https://dblp.org/rec/journals/siamdm/ChlamtacDKKR18.bib","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@article{DBLP:journals/siamdm/ChlamtacDKKR18,\n author = {Eden Chlamt{\\'{a}}c and\n Michael Dinitz and\n Christian Konrad and\n Guy Kortsarz and\n George Rabanca},\n title = {The Densest k-Subhypergraph Problem},\n journal = {{SIAM} J. Discret. Math.},\n volume = {32},\n number = {2},\n pages = {1458--1477},\n year = {2018},\n url = {https://doi.org/10.1137/16M1096402},\n doi = {10.1137/16M1096402},\n timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/siamdm/ChlamtacDKKR18.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Chlamtác, E.","Dinitz, M.","Konrad, C.","Kortsarz, G.","Rabanca, G."],"key":"DBLP:journals/siamdm/ChlamtacDKKR18","id":"DBLP:journals/siamdm/ChlamtacDKKR18","bibbaseid":"chlamtc-dinitz-konrad-kortsarz-rabanca-thedensestksubhypergraphproblem-2018","role":"author","urls":{"Paper":"https://doi.org/10.1137/16M1096402"},"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"https://dblp.org/pid/15/8910.bib","creationDate":"2020-11-09T18:52:44.164Z","downloads":0,"keywords":[],"search_terms":["densest","subhypergraph","problem","chlamtác","dinitz","konrad","kortsarz","rabanca"],"title":"The Densest k-Subhypergraph Problem","year":2018,"dataSources":["J47sPXJH6Qz5BncQX","mYxb3K3dbLnhBPPJo"]}