{"id":"https://openalex.org/W1571644423","doi":"https://doi.org/10.1007/978-3-642-36065-7_12","title":"Exact and Approximation Algorithms for Densest k-Subgraph","display_name":"Exact and Approximation Algorithms for Densest k-Subgraph","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W1571644423","doi":"https://doi.org/10.1007/978-3-642-36065-7_12","mag":"1571644423"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-36065-7_12","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-36065-7_12","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5005743823","display_name":"Nicolas Bourgeois","orcid":"https://orcid.org/0000-0001-5404-1260"},"institutions":[{"id":"https://openalex.org/I124261006","display_name":"\u00c9cole Sup\u00e9rieure des Sciences \u00c9conomiques et Commerciales","ror":"https://ror.org/02dga6j42","country_code":"FR","type":"other","lineage":["https://openalex.org/I124261006"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Nicolas Bourgeois","raw_affiliation_strings":["ESSEC, France"],"affiliations":[{"raw_affiliation_string":"ESSEC, France","institution_ids":["https://openalex.org/I124261006"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003864326","display_name":"Aristotelis Giannakos","orcid":null},"institutions":[{"id":"https://openalex.org/I56435720","display_name":"Universit\u00e9 Paris Dauphine-PSL","ror":"https://ror.org/052bz7812","country_code":"FR","type":"education","lineage":["https://openalex.org/I2746051580","https://openalex.org/I56435720"]},{"id":"https://openalex.org/I2746051580","display_name":"Universit\u00e9 Paris Sciences et Lettres","ror":"https://ror.org/013cjyk83","country_code":"FR","type":"education","lineage":["https://openalex.org/I2746051580"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Aristotelis Giannakos","raw_affiliation_strings":["PSL Research University, Universit\u00e9 Paris-Dauphine, LAMSADE, CNRS UMR, 7243, Paris, France"],"affiliations":[{"raw_affiliation_string":"PSL Research University, Universit\u00e9 Paris-Dauphine, LAMSADE, CNRS UMR, 7243, Paris, France","institution_ids":["https://openalex.org/I56435720","https://openalex.org/I2746051580","https://openalex.org/I1294671590"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085905772","display_name":"Giorgio Lucarelli","orcid":"https://orcid.org/0000-0001-7368-355X"},"institutions":[{"id":"https://openalex.org/I39804081","display_name":"Sorbonne Universit\u00e9","ror":"https://ror.org/02en5vm52","country_code":"FR","type":"education","lineage":["https://openalex.org/I39804081"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Giorgio Lucarelli","raw_affiliation_strings":["Universit\u00e9 Pierre et Marie Curie, LIP6, Paris, France"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Pierre et Marie Curie, LIP6, Paris, France","institution_ids":["https://openalex.org/I39804081"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011937346","display_name":"Ioannis Milis","orcid":null},"institutions":[{"id":"https://openalex.org/I73142707","display_name":"Athens University of Economics and Business","ror":"https://ror.org/03s262162","country_code":"GR","type":"education","lineage":["https://openalex.org/I73142707"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Ioannis Milis","raw_affiliation_strings":["Dept. of Informatics, Athens University of Economics and Business, Athens, Greece"],"affiliations":[{"raw_affiliation_string":"Dept. of Informatics, Athens University of Economics and Business, Athens, Greece","institution_ids":["https://openalex.org/I73142707"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111473903","display_name":"Vang\u00e9lis Th. Paschos","orcid":null},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I56435720","display_name":"Universit\u00e9 Paris Dauphine-PSL","ror":"https://ror.org/052bz7812","country_code":"FR","type":"education","lineage":["https://openalex.org/I2746051580","https://openalex.org/I56435720"]},{"id":"https://openalex.org/I2746051580","display_name":"Universit\u00e9 Paris Sciences et Lettres","ror":"https://ror.org/013cjyk83","country_code":"FR","type":"education","lineage":["https://openalex.org/I2746051580"]},{"id":"https://openalex.org/I185839726","display_name":"Institut Universitaire de France","ror":"https://ror.org/055khg266","country_code":"FR","type":"education","lineage":["https://openalex.org/I185839726"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Vangelis Th. Paschos","raw_affiliation_strings":["Institut Universitaire de France, France","PSL Research University, Universit\u00e9 Paris-Dauphine, LAMSADE, CNRS UMR, 7243, Paris, France"],"affiliations":[{"raw_affiliation_string":"Institut Universitaire de France, France","institution_ids":["https://openalex.org/I185839726"]},{"raw_affiliation_string":"PSL Research University, Universit\u00e9 Paris-Dauphine, LAMSADE, CNRS UMR, 7243, Paris, France","institution_ids":["https://openalex.org/I56435720","https://openalex.org/I2746051580","https://openalex.org/I1294671590"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5005743823"],"corresponding_institution_ids":["https://openalex.org/I124261006"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":5.7186,"has_fulltext":false,"cited_by_count":29,"citation_normalized_percentile":{"value":0.96324111,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"114","last_page":"125"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.760948657989502},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7117352485656738},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.7046751976013184},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6356170177459717},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.6231002807617188},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.566710889339447},{"id":"https://openalex.org/keywords/clique-problem","display_name":"Clique problem","score":0.5585076212882996},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5002338886260986},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.48448440432548523},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.48362982273101807},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4833621382713318},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.4831637740135193},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.46999654173851013},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.46518248319625854},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.45601561665534973},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.44355499744415283},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4431353509426117},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4195346236228943},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.29697632789611816},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.201945960521698},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.191616028547287},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.16360872983932495},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.06785175204277039}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.760948657989502},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7117352485656738},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.7046751976013184},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6356170177459717},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.6231002807617188},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.566710889339447},{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.5585076212882996},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5002338886260986},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.48448440432548523},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.48362982273101807},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4833621382713318},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.4831637740135193},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.46999654173851013},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.46518248319625854},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.45601561665534973},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.44355499744415283},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4431353509426117},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4195346236228943},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.29697632789611816},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.201945960521698},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.191616028547287},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.16360872983932495},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.06785175204277039},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-642-36065-7_12","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-36065-7_12","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:HAL:hal-01215976v1","is_oa":false,"landing_page_url":"https://hal.science/hal-01215976","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"7th International Workshop on Algorithms and Computation (WALCOM 2013), Feb 2013, Kharagpur, India. pp.114-125, ⟨10.1007/978-3-642-36065-7_12⟩","raw_type":"Conference papers"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W820461064","https://openalex.org/W1516574938","https://openalex.org/W1571257748","https://openalex.org/W1571644423","https://openalex.org/W1582617592","https://openalex.org/W1980809300","https://openalex.org/W1985694287","https://openalex.org/W1989483229","https://openalex.org/W1994262057","https://openalex.org/W2011039300","https://openalex.org/W2012700732","https://openalex.org/W2030365814","https://openalex.org/W2036836182","https://openalex.org/W2044104853","https://openalex.org/W2059372025","https://openalex.org/W2059451253","https://openalex.org/W2074359677","https://openalex.org/W2076595213","https://openalex.org/W2085550081","https://openalex.org/W2089718638","https://openalex.org/W2103164681","https://openalex.org/W2112825968","https://openalex.org/W2115659887","https://openalex.org/W2118980874","https://openalex.org/W2164056371","https://openalex.org/W2170054126","https://openalex.org/W2170702810","https://openalex.org/W2505201213","https://openalex.org/W2570928651","https://openalex.org/W2913688336","https://openalex.org/W4213368513","https://openalex.org/W4285719527","https://openalex.org/W4292230561"],"related_works":["https://openalex.org/W2011162901","https://openalex.org/W4388329052","https://openalex.org/W2796050003","https://openalex.org/W2952626310","https://openalex.org/W4297902403","https://openalex.org/W2570024161","https://openalex.org/W2971952735","https://openalex.org/W1520195889","https://openalex.org/W2575141006","https://openalex.org/W1667353902"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":7}],"updated_date":"2026-04-12T07:58:50.170612","created_date":"2025-10-10T00:00:00"}