@article{bazgan2019proportionally,
    author = {Bazgan, Cristina and Chleb{\'i}kov{\'a}, Janka and Dallard, Cl{\'e}ment and Pontoizeau, Thomas},
    doi = {10.1016/j.dam.2019.07.010},
    journal = {Discrete Applied Mathematics},
    publisher = {North-Holland},
    title = {Proportionally dense subgraph of maximum size: complexity and approximation},
    year = {2019}
}

{"_id":"RCmqPMWuWdSs8wYt7","bibbaseid":"bazgan-chlebikov-dallard-pontoizeau-proportionallydensesubgraphofmaximumsizecomplexityandapproximation-2019","authorIDs":["5e38c7cd87bbe9de010000af","5e425d9f82b0c2de010000bd","5e52e34e9c58afde01000021","5e56a9b0e177dede010000c4","5e601babc064fcde010001a5","5e6ab205f216f6de0100019f","qii8D3ApJ73KNbrG9"],"author_short":["Bazgan, C.","Chlebíková, Janka","Dallard, C.","Pontoizeau, T."],"bibdata":{"bibtype":"article","type":"article","author":[{"propositions":[],"lastnames":["Bazgan"],"firstnames":["Cristina"],"suffixes":[]},{"firstnames":[],"propositions":[],"lastnames":["Chlebíková, Janka"],"suffixes":[]},{"propositions":[],"lastnames":["Dallard"],"firstnames":["Clément"],"suffixes":[]},{"propositions":[],"lastnames":["Pontoizeau"],"firstnames":["Thomas"],"suffixes":[]}],"doi":"10.1016/j.dam.2019.07.010","journal":"Discrete Applied Mathematics","publisher":"North-Holland","title":"Proportionally dense subgraph of maximum size: complexity and approximation","year":"2019","bibtex":"@article{bazgan2019proportionally,\n author = {Bazgan, Cristina and Chleb{\\'i}kov{\\'a}, Janka and Dallard, Cl{\\'e}ment and Pontoizeau, Thomas},\n doi = {10.1016/j.dam.2019.07.010},\n journal = {Discrete Applied Mathematics},\n publisher = {North-Holland},\n title = {Proportionally dense subgraph of maximum size: complexity and approximation},\n year = {2019}\n}\n\n","author_short":["Bazgan, C.","Chlebíková, Janka","Dallard, C.","Pontoizeau, T."],"key":"bazgan2019proportionally","id":"bazgan2019proportionally","bibbaseid":"bazgan-chlebikov-dallard-pontoizeau-proportionallydensesubgraphofmaximumsizecomplexityandapproximation-2019","role":"author","urls":{},"downloads":0,"html":"","metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"https://pnenp.github.io/publis.bib","creationDate":"2020-01-24T13:01:32.557Z","downloads":0,"keywords":[],"search_terms":["proportionally","dense","subgraph","maximum","size","complexity","approximation","bazgan","chlebíková","dallard","pontoizeau"],"title":"Proportionally dense subgraph of maximum size: complexity and approximation","year":2019,"dataSources":["gnpLmkqf5or77BT6p"]}