{"id":"https://openalex.org/W2120085999","doi":"https://doi.org/10.1007/978-3-319-18173-8_7","title":"Competitive Strategies for Online Clique Clustering","display_name":"Competitive Strategies for Online Clique Clustering","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W2120085999","doi":"https://doi.org/10.1007/978-3-319-18173-8_7","mag":"2120085999"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-18173-8_7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-18173-8_7","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":true,"oa_status":"green","oa_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:mau:diva-12684","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5024529572","display_name":"Marek Chrob\u00e1k","orcid":"https://orcid.org/0000-0002-8673-2709"},"institutions":[{"id":"https://openalex.org/I103635307","display_name":"University of California, Riverside","ror":"https://ror.org/03nawhv43","country_code":"US","type":"education","lineage":["https://openalex.org/I103635307"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Marek Chrobak","raw_affiliation_strings":["University of California at Riverside, Riverside, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California at Riverside, Riverside, USA","institution_ids":["https://openalex.org/I103635307"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029270613","display_name":"Christoph D\u00fcrr","orcid":"https://orcid.org/0000-0001-8103-5333"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]},{"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"]},{"id":"https://openalex.org/I4210159731","display_name":"LIP6","ror":"https://ror.org/05krcen59","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I39804081","https://openalex.org/I4210159245","https://openalex.org/I4210159731"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Christoph D\u00fcrr","raw_affiliation_strings":["CNRS, UMR 7606, LIP6, Paris, France","Sorbonne Universit\u00e9s, UPMC Univ Paris 06, UMR 7606, LIP6, Paris, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CNRS, UMR 7606, LIP6, Paris, France","institution_ids":["https://openalex.org/I4210159731","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"Sorbonne Universit\u00e9s, UPMC Univ Paris 06, UMR 7606, LIP6, Paris, France","institution_ids":["https://openalex.org/I204730241","https://openalex.org/I39804081","https://openalex.org/I4210159731"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101713320","display_name":"Bengt J. Nilsson","orcid":"https://orcid.org/0000-0002-1342-8618"},"institutions":[{"id":"https://openalex.org/I183111857","display_name":"Malm\u00f6 University","ror":"https://ror.org/05wp7an13","country_code":"SE","type":"education","lineage":["https://openalex.org/I183111857"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Bengt J. Nilsson","raw_affiliation_strings":["Department of Computer Science, Malm\u00f6 University, Malm\u00f6, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Malm\u00f6 University, Malm\u00f6, Sweden","institution_ids":["https://openalex.org/I183111857"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5101713320"],"corresponding_institution_ids":["https://openalex.org/I183111857"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.7314,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.68606802,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"101","last_page":"113"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998000264167786,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991999864578247,"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/T11502","display_name":"Facility Location and Emergency Management","score":0.9944000244140625,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6936075091362},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.6698876023292542},{"id":"https://openalex.org/keywords/clique-graph","display_name":"Clique graph","score":0.663275420665741},{"id":"https://openalex.org/keywords/clique-sum","display_name":"Clique-sum","score":0.6075897216796875},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5402112007141113},{"id":"https://openalex.org/keywords/clique-percolation-method","display_name":"Clique percolation method","score":0.5096983909606934},{"id":"https://openalex.org/keywords/simplex-graph","display_name":"Simplex graph","score":0.49072515964508057},{"id":"https://openalex.org/keywords/split-graph","display_name":"Split graph","score":0.47933849692344666},{"id":"https://openalex.org/keywords/merge","display_name":"Merge (version control)","score":0.4534277617931366},{"id":"https://openalex.org/keywords/clique-problem","display_name":"Clique problem","score":0.4475003778934479},{"id":"https://openalex.org/keywords/block-graph","display_name":"Block graph","score":0.43746817111968994},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4369455575942993},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.4338374137878418},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.423044353723526},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.41373273730278015},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4026636779308319},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3895036578178406},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3360971510410309},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.20582321286201477},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.13325586915016174},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.10184511542320251},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.08298608660697937},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.06692266464233398}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6936075091362},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.6698876023292542},{"id":"https://openalex.org/C189239283","wikidata":"https://www.wikidata.org/wiki/Q17101022","display_name":"Clique graph","level":5,"score":0.663275420665741},{"id":"https://openalex.org/C186942658","wikidata":"https://www.wikidata.org/wiki/Q5134410","display_name":"Clique-sum","level":5,"score":0.6075897216796875},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5402112007141113},{"id":"https://openalex.org/C128243737","wikidata":"https://www.wikidata.org/wiki/Q5134414","display_name":"Clique percolation method","level":3,"score":0.5096983909606934},{"id":"https://openalex.org/C202183611","wikidata":"https://www.wikidata.org/wiki/Q7520883","display_name":"Simplex graph","level":5,"score":0.49072515964508057},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.47933849692344666},{"id":"https://openalex.org/C197129107","wikidata":"https://www.wikidata.org/wiki/Q1921621","display_name":"Merge (version control)","level":2,"score":0.4534277617931366},{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.4475003778934479},{"id":"https://openalex.org/C43413943","wikidata":"https://www.wikidata.org/wiki/Q4927193","display_name":"Block graph","level":5,"score":0.43746817111968994},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4369455575942993},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.4338374137878418},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.423044353723526},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.41373273730278015},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4026636779308319},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3895036578178406},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3360971510410309},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.20582321286201477},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.13325586915016174},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.10184511542320251},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.08298608660697937},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.06692266464233398},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-319-18173-8_7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-18173-8_7","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:DiVA.org:mau-12684","is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:mau:diva-12684","pdf_url":null,"source":{"id":"https://openalex.org/S4306401559","display_name":"KTH Publication Database DiVA (KTH Royal Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:HAL:hal-01206282v1","is_oa":false,"landing_page_url":"https://hal.science/hal-01206282","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":"The 9th International Conference on Algorithms and Complexity (CIAC), May 2015, Paris, France. pp.101-113, ⟨10.1007/978-3-319-18173-8_7⟩","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"pmh:oai:DiVA.org:mau-12684","is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:mau:diva-12684","pdf_url":null,"source":{"id":"https://openalex.org/S4306401559","display_name":"KTH Publication Database DiVA (KTH Royal Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferenceObject"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1539373727","https://openalex.org/W1552828154","https://openalex.org/W2013850148","https://openalex.org/W2016973429","https://openalex.org/W2041182977","https://openalex.org/W2064594923","https://openalex.org/W2066682058","https://openalex.org/W2114432090","https://openalex.org/W2115556222","https://openalex.org/W2125220573","https://openalex.org/W2127375409","https://openalex.org/W2167112911","https://openalex.org/W2611831635","https://openalex.org/W2914959486","https://openalex.org/W4229753684"],"related_works":["https://openalex.org/W2091356038","https://openalex.org/W2186006531","https://openalex.org/W2115713772","https://openalex.org/W3102191718","https://openalex.org/W2544657472","https://openalex.org/W2370540517","https://openalex.org/W4288099403","https://openalex.org/W154317836","https://openalex.org/W4301185033","https://openalex.org/W2794565019"],"abstract_inverted_index":null,"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-07-02T09:51:11.867554","created_date":"2025-10-10T00:00:00"}