{"id":"https://openalex.org/W2007069176","doi":"https://doi.org/10.1145/1077464.1077468","title":"Fixed-parameter algorithms for ( <i>k</i> , <i>r</i> )-center in planar graphs and map graphs","display_name":"Fixed-parameter algorithms for ( <i>k</i> , <i>r</i> )-center in planar graphs and map graphs","publication_year":2005,"publication_date":"2005-07-01","ids":{"openalex":"https://openalex.org/W2007069176","doi":"https://doi.org/10.1145/1077464.1077468","mag":"2007069176"},"language":"en","primary_location":{"id":"doi:10.1145/1077464.1077468","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1077464.1077468","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/A5083684609","display_name":"Erik D. Demaine","orcid":"https://orcid.org/0000-0003-3803-5703"},"institutions":[{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Erik D. Demaine","raw_affiliation_strings":["MIT, Cambridge, Massachusetts, Cambridge, MA"],"affiliations":[{"raw_affiliation_string":"MIT, Cambridge, Massachusetts, Cambridge, MA","institution_ids":["https://openalex.org/I4210110987"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075328697","display_name":"Fedor V. Fomin","orcid":"https://orcid.org/0000-0003-1955-4612"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Fedor V. Fomin","raw_affiliation_strings":["University of Bergen, Bergen, Norway"],"affiliations":[{"raw_affiliation_string":"University of Bergen, Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111876448","display_name":"MohammadTaghi Hajiaghayi","orcid":null},"institutions":[{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mohammadtaghi Hajiaghayi","raw_affiliation_strings":["MIT, Cambridge, Massachusetts, Cambridge, MA"],"affiliations":[{"raw_affiliation_string":"MIT, Cambridge, Massachusetts, Cambridge, MA","institution_ids":["https://openalex.org/I4210110987"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085447779","display_name":"Dimitrios M. Thilikos","orcid":null},"institutions":[{"id":"https://openalex.org/I9617848","display_name":"Universitat Polit\u00e8cnica de Catalunya","ror":"https://ror.org/03mb6wj31","country_code":"ES","type":"education","lineage":["https://openalex.org/I9617848"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Dimitrios M. Thilikos","raw_affiliation_strings":["Universitat Polit\u00e8cnica de Catalunya, Barcelona, Spain"],"affiliations":[{"raw_affiliation_string":"Universitat Polit\u00e8cnica de Catalunya, Barcelona, Spain","institution_ids":["https://openalex.org/I9617848"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5083684609"],"corresponding_institution_ids":["https://openalex.org/I4210110987"],"apc_list":null,"apc_paid":null,"fwci":10.773,"has_fulltext":false,"cited_by_count":149,"citation_normalized_percentile":{"value":0.98948733,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"1","issue":"1","first_page":"33","last_page":"47"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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":0.9998999834060669,"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.9970999956130981,"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/T12288","display_name":"Optimization and Search Problems","score":0.992900013923645,"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.7150601744651794},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7013985514640808},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.6932089328765869},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.6744015216827393},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6017501354217529},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.5519841313362122},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.5056774616241455},{"id":"https://openalex.org/keywords/center","display_name":"Center (category theory)","score":0.4928750991821289},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4680587649345398},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.45817893743515015},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43551018834114075},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3309326171875},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.221640944480896}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7150601744651794},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7013985514640808},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.6932089328765869},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.6744015216827393},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6017501354217529},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.5519841313362122},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.5056774616241455},{"id":"https://openalex.org/C2779463800","wikidata":"https://www.wikidata.org/wiki/Q5062222","display_name":"Center (category theory)","level":2,"score":0.4928750991821289},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4680587649345398},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.45817893743515015},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43551018834114075},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3309326171875},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.221640944480896},{"id":"https://openalex.org/C8010536","wikidata":"https://www.wikidata.org/wiki/Q160398","display_name":"Crystallography","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1077464.1077468","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1077464.1077468","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W172960762","https://openalex.org/W1491529421","https://openalex.org/W1504740823","https://openalex.org/W1515227792","https://openalex.org/W1527664624","https://openalex.org/W1533301948","https://openalex.org/W1548803284","https://openalex.org/W1564936042","https://openalex.org/W1813271084","https://openalex.org/W1971680805","https://openalex.org/W1973264045","https://openalex.org/W1983156760","https://openalex.org/W1985758609","https://openalex.org/W1993920925","https://openalex.org/W2013522700","https://openalex.org/W2019137761","https://openalex.org/W2047871605","https://openalex.org/W2064796716","https://openalex.org/W2067431706","https://openalex.org/W2083807544","https://openalex.org/W2085348754","https://openalex.org/W2087088044","https://openalex.org/W2108093643","https://openalex.org/W2132750992","https://openalex.org/W2144809360","https://openalex.org/W2147879413","https://openalex.org/W2156760067","https://openalex.org/W2294414813","https://openalex.org/W2748837517","https://openalex.org/W2913688336","https://openalex.org/W3137423196","https://openalex.org/W4292230561"],"related_works":["https://openalex.org/W1480846237","https://openalex.org/W1544821268","https://openalex.org/W1548014395","https://openalex.org/W3037533092","https://openalex.org/W4301463689","https://openalex.org/W2605313623","https://openalex.org/W1726008105","https://openalex.org/W2952055179","https://openalex.org/W2133160845","https://openalex.org/W4302786124"],"abstract_inverted_index":{"The":[0],"(":[1,41,68,91,97],"k":[2,15,42,49,69,165],",":[3,43,52,70,103],"r":[4,30,44,71,98,100,167,183],")-center":[5,45],"problem":[6,185],"asks":[7],"whether":[8],"an":[9,63],"input":[10],"graph":[11],"G":[12,25],"has":[13],"\u2264":[14,29],"vertices":[16],"(called":[17],"centers":[18],")":[19,72,93,101],"such":[20],"that":[21,39,89,121,246,290,297],"every":[22],"vertex":[23],"of":[24,65,82,107,116,125,136,152,164,172,178,199,218,232,255,258,280,295,304],"is":[26,53,80,175,210],"within":[27],"distance":[28],"from":[31],"some":[32],"center.":[33],"In":[34,85,251],"this":[35,160],"article,":[36],"we":[37,87,119,235],"prove":[38,120],"the":[40,77,105,108,114,122,132,176,182,196,215,230,259,276],"problem,":[46],"parameterized":[47],"by":[48,140],"and":[50,143,155,166,190,201,206,269,307],"R":[51],"fixed-parameter":[54],"tractable":[55],"(FPT)":[56],"on":[57,195,203,225,249],"planar":[58,188,226,305],"graphs,":[59],"i.e.,":[60],"it":[61],"admits":[62],"algorithm":[64,174],"complexity":[66],"f":[67,79,90],"n":[73,83],"O":[74,96],"(1)":[75],"where":[76,104],"function":[78],"independent":[81],".":[84,168],"particular,":[86],"show":[88,236],"k,r":[92],"=":[94],"2":[95],"log":[99],"\u221ak":[102],"exponent":[106],"exponential":[109,223],"term":[110],"grows":[111],"sublinearly":[112],"in":[113,162,186,289],"number":[115],"centers.":[117],"Moreover,":[118],"same":[123],"type":[124],"FPT":[126],"algorithms":[127,149,239],"can":[128,240],"be":[129,241],"designed":[130],"for":[131,150,181,222],"more":[133,212,271],"general":[134,244],"class":[135],"map":[137,191,308],"graphs":[138,151,189,296,306],"introduced":[139],"Chen,":[141],"Grigni,":[142],"Papadimitriou.":[144],"Our":[145,284],"results":[146,198,285],"combine":[147],"dynamic-programming":[148],"small":[153],"branchwidth":[154,256],"a":[156,170,179,208],"graph-theoretic":[157],"result":[158,209],"bounding":[159],"parameter":[161],"terms":[163],"Finally,":[169],"byproduct":[171],"our":[173,233,238,253],"existence":[177],"PTAS":[180],"-domination":[184],"both":[187],"graphs.Our":[192],"approach":[193],"builds":[194],"seminal":[197],"Robertson":[200],"Seymour":[202],"Graph":[204],"Minors,":[205],"as":[207],"much":[211,266],"powerful":[213],"than":[214,275],"previous":[216],"machinery":[217],"Alber":[219],"et":[220],"al.":[221],"speedup":[224],"graphs.":[227,309],"To":[228],"demonstrate":[229],"versatility":[231],"results,":[234],"how":[237],"extended":[242],"to":[243,264,293],"parameters":[245],"are":[247,286,298],"\u201clarge\u201d":[248],"grids.":[250],"addition,":[252],"use":[254],"instead":[257],"usual":[260],"treewidth":[261],"allows":[262],"us":[263],"obtain":[265],"faster":[267],"algorithms,":[268],"requires":[270],"complicated":[272],"dynamic":[273],"programming":[274],"standard":[277],"leaf/introduce/forget/join":[278],"structure":[279],"nice":[281],"tree":[282],"decompositions.":[283],"also":[287],"unique":[288],"they":[291],"apply":[292],"classes":[294],"not":[299],"minor-closed,":[300],"namely,":[301],"constant":[302],"powers":[303]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":11},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":11},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":11},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":5}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}