{"id":"https://openalex.org/W2019602046","doi":"https://doi.org/10.1145/1412228.1455265","title":"Efficiently implementing maximum independent set algorithms on circle graphs","display_name":"Efficiently implementing maximum independent set algorithms on circle graphs","publication_year":2009,"publication_date":"2009-02-01","ids":{"openalex":"https://openalex.org/W2019602046","doi":"https://doi.org/10.1145/1412228.1455265","mag":"2019602046"},"language":"en","primary_location":{"id":"doi:10.1145/1412228.1455265","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1412228.1455265","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"},"type":"article","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/A5065566225","display_name":"Nicholas Nash","orcid":null},"institutions":[{"id":"https://openalex.org/I205274468","display_name":"Trinity College Dublin","ror":"https://ror.org/02tyrky19","country_code":"IE","type":"education","lineage":["https://openalex.org/I205274468"]}],"countries":["IE"],"is_corresponding":true,"raw_author_name":"Nicholas Nash","raw_affiliation_strings":["Trinity College Dublin, Dublin, Ireland","Trinity college Dublin, Dublin, Ireland"],"affiliations":[{"raw_affiliation_string":"Trinity College Dublin, Dublin, Ireland","institution_ids":["https://openalex.org/I205274468"]},{"raw_affiliation_string":"Trinity college Dublin, Dublin, Ireland","institution_ids":["https://openalex.org/I205274468"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083658589","display_name":"Sylvain Lelait","orcid":null},"institutions":[{"id":"https://openalex.org/I4210153229","display_name":"European Patent Organisation","ror":"https://ror.org/050pmr719","country_code":"DE","type":"other","lineage":["https://openalex.org/I4210153229"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Sylvain Lelait","raw_affiliation_strings":["European Patent Office"],"affiliations":[{"raw_affiliation_string":"European Patent Office","institution_ids":["https://openalex.org/I4210153229"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003800161","display_name":"David Gregg","orcid":"https://orcid.org/0000-0003-3782-4612"},"institutions":[{"id":"https://openalex.org/I205274468","display_name":"Trinity College Dublin","ror":"https://ror.org/02tyrky19","country_code":"IE","type":"education","lineage":["https://openalex.org/I205274468"]}],"countries":["IE"],"is_corresponding":false,"raw_author_name":"David Gregg","raw_affiliation_strings":["Trinity College Dublin, Dublin, Ireland","Trinity college Dublin, Dublin, Ireland"],"affiliations":[{"raw_affiliation_string":"Trinity College Dublin, Dublin, Ireland","institution_ids":["https://openalex.org/I205274468"]},{"raw_affiliation_string":"Trinity college Dublin, Dublin, Ireland","institution_ids":["https://openalex.org/I205274468"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5065566225"],"corresponding_institution_ids":["https://openalex.org/I205274468"],"apc_list":null,"apc_paid":null,"fwci":1.9287,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.8737221,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"13","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9980000257492065,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7382968664169312},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6136406660079956},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.45047032833099365},{"id":"https://openalex.org/keywords/dense-graph","display_name":"Dense graph","score":0.4379413425922394},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41398513317108154},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2892017066478729},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.22656983137130737},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.12338775396347046}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7382968664169312},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6136406660079956},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.45047032833099365},{"id":"https://openalex.org/C13251829","wikidata":"https://www.wikidata.org/wiki/Q3085841","display_name":"Dense graph","level":5,"score":0.4379413425922394},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41398513317108154},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2892017066478729},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.22656983137130737},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.12338775396347046},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1412228.1455265","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1412228.1455265","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W356220299","https://openalex.org/W1512353928","https://openalex.org/W1575404050","https://openalex.org/W1984346383","https://openalex.org/W1992459191","https://openalex.org/W1998629568","https://openalex.org/W2008836603","https://openalex.org/W2010751129","https://openalex.org/W2017829568","https://openalex.org/W2049520215","https://openalex.org/W2052850644","https://openalex.org/W2068291241","https://openalex.org/W2130939643","https://openalex.org/W2140411614","https://openalex.org/W2561675875"],"related_works":["https://openalex.org/W1744486668","https://openalex.org/W253330752","https://openalex.org/W1867780321","https://openalex.org/W2169248772","https://openalex.org/W1972375568","https://openalex.org/W1496844168","https://openalex.org/W2375354128","https://openalex.org/W2384572477","https://openalex.org/W1497385637","https://openalex.org/W2391817034"],"abstract_inverted_index":{"Circle":[0],"graphs":[1,179],"are":[2],"an":[3,28,94],"important":[4],"class":[5],"of":[6,13,31,43,50,53,56,76,128,134,149,160,186],"graph":[7],"with":[8,64],"applications":[9],"in":[10,96,120,125,190],"a":[11,44,144,158,191],"number":[12],"areas,":[14],"including":[15],"compiler":[16],"optimization,":[17],"VLSI":[18],"design":[19],"and":[20,60,67,87,106,156,169],"computational":[21],"geometry.":[22],"In":[23,99],"this":[24,97],"article,":[25],"we":[26,101,152],"provide":[27,48,164],"experimental":[29,165],"evaluation":[30],"the":[32,39,54,74,117,126,132,135,147,150,161],"two":[33],"most":[34],"efficient":[35],"algorithms":[36,55],"for":[37,177],"computing":[38],"maximum":[40],"independent":[41],"set":[42],"circle":[45,136,172,178],"graph.":[46],"We":[47,70,91,163],"details":[49],"our":[51],"implementations":[52],"Apostolico":[57,77],"et":[58,78],"al.":[59,79],"Valiente":[61],"[2003],":[62],"together":[63],"time,":[65],"space,":[66],"other":[68],"measurements.":[69],"describe":[71],"optimizations":[72,151],"to":[73,104,112],"algorithm":[75,118],"that":[80,180],"significantly":[81],"reduce":[82],"both":[83,129],"its":[84,88],"running":[85],"time":[86],"memory":[89],"consumption.":[90],"also":[92],"correct":[93],"error":[95],"algorithm.":[98],"addition,":[100],"show":[102],"how":[103],"restructure":[105],"simplify":[107],"Valiente's":[108],"algorithm,":[109],"allowing":[110],"us":[111],"remove":[113],"redundant":[114],"computations":[115],"from":[116],"resulting":[119],"much":[121],"improved":[122],"performance.":[123],"Moreover,":[124],"case":[127],"algorithms,":[130],"when":[131,182],"density":[133],"graph's":[137],"associated":[138],"interval":[139],"representation":[140],"is":[141],"increased":[142],"beyond":[143],"certain":[145],"point":[146],"efficacy":[148],"apply":[153],"increases":[154],"dramatically":[155],"as":[157,174,176],"function":[159],"density.":[162],"results":[166],"over":[167],"dense":[168],"sparse":[170],"random":[171],"graphs,":[173],"well":[175],"arise":[181],"performing":[183],"register":[184],"allocation":[185],"software":[187],"pipelined":[188],"loops":[189],"compiler.":[192]},"counts_by_year":[{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}