{"id":"https://openalex.org/W2537919540","doi":"https://doi.org/10.1007/s00453-019-00625-1","title":"Online Clique Clustering","display_name":"Online Clique Clustering","publication_year":2019,"publication_date":"2019-09-23","ids":{"openalex":"https://openalex.org/W2537919540","doi":"https://doi.org/10.1007/s00453-019-00625-1","mag":"2537919540"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-019-00625-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-019-00625-1","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-019-00625-1.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00453-019-00625-1.pdf","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":true,"raw_author_name":"Marek Chrobak","raw_affiliation_strings":["Department of Computer Science and Engineering, University of California at Riverside, Riverside, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, 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/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":["Laboratoire d\u2019informatique de Paris 6, LIP6, CNRS, Sorbonne Universit\u00e9, 75252, Paris, France","Laboratoire d\u2019informatique de Paris 6, LIP6, CNRS, Sorbonne Universit\u00e9, Paris, France"],"affiliations":[{"raw_affiliation_string":"Laboratoire d\u2019informatique de Paris 6, LIP6, CNRS, Sorbonne Universit\u00e9, 75252, Paris, France","institution_ids":["https://openalex.org/I39804081","https://openalex.org/I4210159731","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"Laboratoire d\u2019informatique de Paris 6, LIP6, CNRS, Sorbonne Universit\u00e9, Paris, France","institution_ids":["https://openalex.org/I4210159731","https://openalex.org/I39804081","https://openalex.org/I1294671590"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010245209","display_name":"Aleksander Fabijan","orcid":"https://orcid.org/0000-0003-4908-2708"},"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"]},{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Aleksander Fabijan","raw_affiliation_strings":["Department of Computer Science and Media Technology, Malm\u00f6 University, 205 06, Malm\u00f6, Sweden","[Dept. of Comput. Sci. & Media Technol., Malmo Univ., Malmo, Sweden]"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Media Technology, Malm\u00f6 University, 205 06, Malm\u00f6, Sweden","institution_ids":["https://openalex.org/I183111857"]},{"raw_affiliation_string":"[Dept. of Comput. Sci. & Media Technol., Malmo Univ., Malmo, Sweden]","institution_ids":["https://openalex.org/I187531555"]}]},{"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"]},{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Bengt J. Nilsson","raw_affiliation_strings":["Department of Computer Science and Media Technology, Malm\u00f6 University, 205 06, Malm\u00f6, Sweden","[Dept. of Comput. Sci. & Media Technol., Malmo Univ., Malmo, Sweden]"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Media Technology, Malm\u00f6 University, 205 06, Malm\u00f6, Sweden","institution_ids":["https://openalex.org/I183111857"]},{"raw_affiliation_string":"[Dept. of Comput. Sci. & Media Technol., Malmo Univ., Malmo, Sweden]","institution_ids":["https://openalex.org/I187531555"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5024529572"],"corresponding_institution_ids":["https://openalex.org/I103635307"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00231365,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"82","issue":"4","first_page":"938","last_page":"965"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9958999752998352,"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.9958999752998352,"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/T11704","display_name":"Mobile Crowdsensing and Crowdsourcing","score":0.9918000102043152,"subfield":{"id":"https://openalex.org/subfields/1706","display_name":"Computer Science Applications"},"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.9850999712944031,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7906675338745117},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.6803373098373413},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5856502056121826},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5767955183982849},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5566498041152954},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.5328918695449829},{"id":"https://openalex.org/keywords/clique-number","display_name":"Clique number","score":0.5254218578338623},{"id":"https://openalex.org/keywords/clique-graph","display_name":"Clique graph","score":0.509849488735199},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.48408806324005127},{"id":"https://openalex.org/keywords/block-graph","display_name":"Block graph","score":0.4401150941848755},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42518866062164307},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.23946866393089294},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.22565418481826782},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.21771591901779175},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.13549718260765076},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.08453664183616638}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7906675338745117},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.6803373098373413},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5856502056121826},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5767955183982849},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5566498041152954},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.5328918695449829},{"id":"https://openalex.org/C2985491264","wikidata":"https://www.wikidata.org/wiki/Q761631","display_name":"Clique number","level":3,"score":0.5254218578338623},{"id":"https://openalex.org/C189239283","wikidata":"https://www.wikidata.org/wiki/Q17101022","display_name":"Clique graph","level":5,"score":0.509849488735199},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.48408806324005127},{"id":"https://openalex.org/C43413943","wikidata":"https://www.wikidata.org/wiki/Q4927193","display_name":"Block graph","level":5,"score":0.4401150941848755},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42518866062164307},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.23946866393089294},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.22565418481826782},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.21771591901779175},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.13549718260765076},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.08453664183616638},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1007/s00453-019-00625-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-019-00625-1","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-019-00625-1.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1411.4274","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1411.4274","pdf_url":"https://arxiv.org/pdf/1411.4274","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"pmh:oai:DiVA.org:mau-49617","is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:mau:diva-49617","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":"Article in journal"},{"id":"pmh:oai:HAL:hal-02980446v1","is_oa":false,"landing_page_url":"https://hal.science/hal-02980446","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":"Algorithmica, 2020, 82 (4), pp.938-965. &#x27E8;10.1007/s00453-019-00625-1&#x27E9;","raw_type":"Journal articles"},{"id":"doi:10.48550/arxiv.1411.4274","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1411.4274","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"},{"id":"mag:2537919540","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"doi:10.1007/s00453-019-00625-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-019-00625-1","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-019-00625-1.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6348192977","display_name":null,"funder_award_id":"CCF-1217314","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6524782626","display_name":"AF: Small: Collaborative Research: Algorithmic Approaches to Energy-Efficient Computing","funder_award_id":"1217314","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6528768137","display_name":"AitF: EXPL: Algorithmic Fluid Concentration Management for Programmable Microfluidics","funder_award_id":"1536026","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8051148489","display_name":"Approximation Algorithms for Combinatorial Optimization","funder_award_id":"0729071","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8118483970","display_name":null,"funder_award_id":"CCF-0729071","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320323521","display_name":"Malm\u00f6 H\u00f6gskola","ror":"https://ror.org/05wp7an13"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2537919540.pdf","grobid_xml":"https://content.openalex.org/works/W2537919540.grobid-xml"},"referenced_works_count":12,"referenced_works":["https://openalex.org/W2016973429","https://openalex.org/W2041182977","https://openalex.org/W2064594923","https://openalex.org/W2066682058","https://openalex.org/W2080535496","https://openalex.org/W2107223449","https://openalex.org/W2127375409","https://openalex.org/W2159207877","https://openalex.org/W2167112911","https://openalex.org/W2611831635","https://openalex.org/W2914959486","https://openalex.org/W4229753684"],"related_works":["https://openalex.org/W2107080175","https://openalex.org/W2963857389","https://openalex.org/W2139077607","https://openalex.org/W2105378877","https://openalex.org/W2099808872","https://openalex.org/W2949066063","https://openalex.org/W1521302999","https://openalex.org/W2113654320","https://openalex.org/W3124448908","https://openalex.org/W3047807847","https://openalex.org/W2963588936","https://openalex.org/W3082664529","https://openalex.org/W2532936822","https://openalex.org/W2949064752","https://openalex.org/W2918542030","https://openalex.org/W2408175436","https://openalex.org/W2031140681","https://openalex.org/W1985061429","https://openalex.org/W1985427743","https://openalex.org/W1944495491"],"abstract_inverted_index":{"Abstract":[0],"Clique":[1],"clustering":[2,64],"is":[3,36,60,156,164],"the":[4,8,23,33,71,75,82,87,96,133,140,149,154,165,170],"problem":[5,155],"of":[6,10,84,142,153,167],"partitioning":[7],"vertices":[9,45,168],"a":[11,20,41,63,109],"graph":[12,35],"into":[13],"disjoint":[14],"clusters,":[15,88,145],"where":[16,77,135,162],"each":[17],"cluster":[18],"forms":[19],"clique":[21],"in":[22,86,169],"graph,":[24],"while":[25],"optimizing":[26],"some":[27],"objective":[28,67],"function.":[29],"In":[30],"online":[31,92],"clustering,":[32],"input":[34],"given":[37],"one":[38],"vertex":[39],"at":[40,105,113],"time,":[42],"and":[43,108],"any":[44],"that":[46,119,148],"have":[47,124],"previously":[48],"been":[49],"clustered":[50],"together":[51],"are":[52],"not":[53],"allowed":[54],"to":[55,61,70,80,138],"be":[56],"separated.":[57],"The":[58],"goal":[59],"maintain":[62],"with":[65],"an":[66,91,101,125],"value":[68],"close":[69],"optimal":[72],"solution.":[73],"For":[74,132],"variant":[76,134],"we":[78,89,136,146],"want":[79,137],"maximize":[81],"number":[83,141,166],"edges":[85,143],"propose":[90],"algorithm":[93,122],"based":[94],"on":[95],"doubling":[97],"technique.":[98],"It":[99],"has":[100],"asymptotic":[102,126],"competitive":[103,111,127,151],"ratio":[104,112,128,152],"most":[106,114],"15.646":[107],"strict":[110],"22.641.":[115],"We":[116],"also":[117],"show":[118,147],"no":[120],"deterministic":[121,150],"can":[123],"better":[129],"than":[130],"6.":[131],"minimize":[139],"between":[144],"$$n-\\omega":[157],"(1)$$":[158],"<mml:math":[159],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"><mml:mrow><mml:mi>n</mml:mi><mml:mo>-</mml:mo><mml:mi>\u03c9</mml:mi><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math>":[160],",":[161],"n":[163],"graph.":[171]},"counts_by_year":[],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}