{"id":"https://openalex.org/W3048679163","doi":"https://doi.org/10.1145/3396573","title":"A Colored Path Problem and Its Applications","display_name":"A Colored Path Problem and Its Applications","publication_year":2020,"publication_date":"2020-06-21","ids":{"openalex":"https://openalex.org/W3048679163","doi":"https://doi.org/10.1145/3396573","mag":"3048679163"},"language":"en","primary_location":{"id":"doi:10.1145/3396573","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3396573","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"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 Transactions on Algorithms","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/A5066848088","display_name":"Eduard Eiben","orcid":"https://orcid.org/0000-0003-2628-3435"},"institutions":[{"id":"https://openalex.org/I184558857","display_name":"Royal Holloway University of London","ror":"https://ror.org/04g2vpn86","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I184558857"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Eduard Eiben","raw_affiliation_strings":["Royal Holloway, University of London, Egham, United Kingdom"],"affiliations":[{"raw_affiliation_string":"Royal Holloway, University of London, Egham, United Kingdom","institution_ids":["https://openalex.org/I184558857"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009111693","display_name":"Iyad Kanj","orcid":"https://orcid.org/0000-0003-1698-8829"},"institutions":[{"id":"https://openalex.org/I118353179","display_name":"DePaul University","ror":"https://ror.org/04xtx5t16","country_code":"US","type":"education","lineage":["https://openalex.org/I118353179"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Iyad Kanj","raw_affiliation_strings":["School of Computing, DePaul University, Chicago, IL, USA"],"affiliations":[{"raw_affiliation_string":"School of Computing, DePaul University, Chicago, IL, USA","institution_ids":["https://openalex.org/I118353179"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5066848088"],"corresponding_institution_ids":["https://openalex.org/I184558857"],"apc_list":null,"apc_paid":null,"fwci":1.8735,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.88805483,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"16","issue":"4","first_page":"1","last_page":"48"},"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.9980000257492065,"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.9980000257492065,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.996999979019165,"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/T12546","display_name":"Smart Parking Systems Research","score":0.9864000082015991,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6410952806472778},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.637540876865387},{"id":"https://openalex.org/keywords/colored","display_name":"Colored","score":0.6068024635314941},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6020514965057373},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5707017183303833},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5063387155532837},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.5028578639030457},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.439644455909729},{"id":"https://openalex.org/keywords/path-graph","display_name":"Path graph","score":0.4234943687915802},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.41492757201194763},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40744370222091675},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3829217553138733},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2911432385444641},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.1824493706226349},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.15821370482444763},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.1403006911277771}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6410952806472778},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.637540876865387},{"id":"https://openalex.org/C2778307483","wikidata":"https://www.wikidata.org/wiki/Q5149038","display_name":"Colored","level":2,"score":0.6068024635314941},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6020514965057373},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5707017183303833},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5063387155532837},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.5028578639030457},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.439644455909729},{"id":"https://openalex.org/C128067373","wikidata":"https://www.wikidata.org/wiki/Q1415372","display_name":"Path graph","level":5,"score":0.4234943687915802},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.41492757201194763},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40744370222091675},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3829217553138733},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2911432385444641},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.1824493706226349},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.15821370482444763},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.1403006911277771},{"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/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3396573","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3396573","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"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 Transactions on Algorithms","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":33,"referenced_works":["https://openalex.org/W41182841","https://openalex.org/W143512583","https://openalex.org/W1517593500","https://openalex.org/W1590111402","https://openalex.org/W1817769608","https://openalex.org/W1822044859","https://openalex.org/W1969884720","https://openalex.org/W2002722727","https://openalex.org/W2003525146","https://openalex.org/W2019137761","https://openalex.org/W2020715570","https://openalex.org/W2022670034","https://openalex.org/W2023862787","https://openalex.org/W2024505010","https://openalex.org/W2026178428","https://openalex.org/W2029948740","https://openalex.org/W2033042995","https://openalex.org/W2048177396","https://openalex.org/W2058510050","https://openalex.org/W2066423045","https://openalex.org/W2077451547","https://openalex.org/W2116087731","https://openalex.org/W2133773025","https://openalex.org/W2151721933","https://openalex.org/W2152179543","https://openalex.org/W2175267184","https://openalex.org/W2565603695","https://openalex.org/W2757636421","https://openalex.org/W2788657802","https://openalex.org/W2794302811","https://openalex.org/W4213368513","https://openalex.org/W4255005259","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2113684989","https://openalex.org/W4389814085","https://openalex.org/W1531868704","https://openalex.org/W4285659194","https://openalex.org/W3031065515","https://openalex.org/W2039168577","https://openalex.org/W3048010228","https://openalex.org/W4382239723","https://openalex.org/W4301463689","https://openalex.org/W2605313623"],"abstract_inverted_index":{"Given":[0,73],"a":[1,13,48,55,74,133,157,163],"set":[2,158],"of":[3,58,159,192,219,241],"obstacles":[4,33],"and":[5,66,96,140,216,222,238,248],"two":[6,17,43,85],"points":[7,18],"in":[8,107],"the":[9,16,42,69,121,125,138,144,167,189,193,201,217,220,233,239,242],"plane,":[10],"is":[11,37,47,100,118,170],"there":[12,36,101],"path":[14,40,106],"between":[15,41],"that":[19,35,52,109,129,166,183],"does":[20],"not":[21],"cross":[22],"more":[23],"than":[24],"k":[25,32,97,113,215,237],"different":[26],"obstacles?":[27],"Equivalently,":[28],"can":[29,63],"we":[30],"remove":[31],"so":[34],"an":[38,102,149,206,229],"obstacle-free":[39],"designated":[44,86],"points?":[45],"This":[46],"fundamental":[49],"NP-hard":[50],"problem":[51,62,147,211],"has":[53],"undergone":[54],"tremendous":[56],"amount":[57],"research":[59],"work.":[60],"The":[61,244],"be":[64],"formulated":[65],"generalized":[67],"into":[68],"following":[70],"graph":[71,76,123,146,221],"problem:":[72],"planar":[75],"G":[77,94,108],"whose":[78],"vertices":[79,87],"are":[80],"colored":[81],"by":[82,213,235],"color":[83,131],"sets,":[84],"s":[88,103],",":[89],"t":[90,105],"\u2208":[91,98],"V":[92],"(":[93],"),":[95],"N,":[99],"-":[104],"uses":[110],"at":[111],"most":[112],"colors?":[114],"If":[115],"each":[116,130],"obstacle":[117,255],"connected,":[119],"then":[120,196],"resulting":[122],"satisfies":[124],"color-connectivity":[126,168,202],"property,":[127],"namely":[128],"induces":[132],"connected":[134],"subgraph.":[135],"We":[136,155,180,195,204],"study":[137],"complexity":[139],"design":[141,205],"algorithms":[142],"for":[143,172,175,209,232,253],"above":[145],"with":[148],"eye":[150],"on":[151,198],"its":[152],"geometric":[153,190],"applications.":[154],"prove":[156],"hardness":[160,185],"results,":[161],"including":[162],"result":[164,225,246],"showing":[165],"property":[169],"crucial":[171],"any":[173],"hope":[174],"fixed-parameter":[176],"tractable":[177],"(FPT)":[178],"algorithms.":[179],"also":[181],"show":[182],"our":[184],"results":[186,252],"translate":[187],"to":[188,227],"instances":[191],"problem.":[194],"focus":[197],"graphs":[199],"satisfying":[200],"property.":[203],"FPT":[207,230,251],"algorithm":[208,231],"this":[210,224],"parameterized":[212],"both":[214,236],"treewidth":[218],"extend":[223],"further":[226],"obtain":[228],"parameterization":[234],"length":[240],"path.":[243],"latter":[245],"implies":[247],"explains":[249],"previous":[250],"various":[254],"shapes.":[256]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}