{"id":"https://openalex.org/W7166872652","doi":"https://doi.org/10.4230/lipics.icalp.2026.82","title":"A Fine-Grained Dichotomy for the Center Problem on Gromov Hyperbolic Graphs","display_name":"A Fine-Grained Dichotomy for the Center Problem on Gromov Hyperbolic Graphs","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7166872652","doi":"https://doi.org/10.4230/lipics.icalp.2026.82"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26471","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.82","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.82/LIPIcs.ICALP.2026.82.pdf","source":{"id":"https://openalex.org/S4306402524","display_name":"Leibniz-Zentrum f\u00fcr Informatik (Schloss Dagstuhl)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.82/LIPIcs.ICALP.2026.82.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5020003818","display_name":"Guillaume Ducoffe","orcid":"https://orcid.org/0000-0003-2127-5989"},"institutions":[{"id":"https://openalex.org/I141595442","display_name":"University of Bucharest","ror":"https://ror.org/02x2v6p15","country_code":"RO","type":"education","lineage":["https://openalex.org/I141595442"]},{"id":"https://openalex.org/I4210114681","display_name":"National Institute for Research and Development in Informatics - ICI Bucharest","ror":"https://ror.org/028rq5v79","country_code":"RO","type":"facility","lineage":["https://openalex.org/I4210114681"]}],"countries":["RO"],"is_corresponding":true,"raw_author_name":"Ducoffe, Guillaume","raw_affiliation_strings":["National Institute for Research and Development in Informatics, Bucharest, Romania","Faculty of Mathematics and Computer Science, University of Bucharest, Romania"],"raw_orcid":"https://orcid.org/0000-0003-2127-5989","affiliations":[{"raw_affiliation_string":"National Institute for Research and Development in Informatics, Bucharest, Romania","institution_ids":["https://openalex.org/I4210114681"]},{"raw_affiliation_string":"Faculty of Mathematics and Computer Science, University of Bucharest, Romania","institution_ids":["https://openalex.org/I141595442"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5020003818"],"corresponding_institution_ids":["https://openalex.org/I141595442","https://openalex.org/I4210114681"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.87131495,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.3163999915122986,"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.3163999915122986,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.14749999344348907,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10304","display_name":"Geometric and Algebraic Topology","score":0.13819999992847443,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5680000185966492},{"id":"https://openalex.org/keywords/neighbourhood","display_name":"Neighbourhood (mathematics)","score":0.5072000026702881},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.48500001430511475},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.415800005197525},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3912999927997589},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.34220001101493835},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.30649998784065247},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.2985999882221222}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7384999990463257},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7317000031471252},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5680000185966492},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.5072000026702881},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.48500001430511475},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45489999651908875},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.415800005197525},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3912999927997589},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.34220001101493835},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.30649998784065247},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.2985999882221222},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2896000146865845},{"id":"https://openalex.org/C82190004","wikidata":"https://www.wikidata.org/wiki/Q5121633","display_name":"Circulant graph","level":5,"score":0.2874999940395355},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.27720001339912415},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.27219998836517334},{"id":"https://openalex.org/C43413943","wikidata":"https://www.wikidata.org/wiki/Q4927193","display_name":"Block graph","level":5,"score":0.2621999979019165},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.2583000063896179},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.2567000091075897},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.25540000200271606},{"id":"https://openalex.org/C2779463800","wikidata":"https://www.wikidata.org/wiki/Q5062222","display_name":"Center (category theory)","level":2,"score":0.25029999017715454}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:26471","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.82","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.82/LIPIcs.ICALP.2026.82.pdf","source":{"id":"https://openalex.org/S4306402524","display_name":"Leibniz-Zentrum f\u00fcr Informatik (Schloss Dagstuhl)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.icalp.2026.82","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.icalp.2026.82","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26471","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.82","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.82/LIPIcs.ICALP.2026.82.pdf","source":{"id":"https://openalex.org/S4306402524","display_name":"Leibniz-Zentrum f\u00fcr Informatik (Schloss Dagstuhl)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7166872652.pdf","grobid_xml":"https://content.openalex.org/works/W7166872652.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"A":[0],"vertex":[1,31,115,139,179],"in":[2,94,168,180],"a":[3,21,29,51,74,83,86,104,132,137,172,177],"graph":[4,22,75,111],"is":[5,24,38,81,103,140,171],"called":[6],"central":[7,30,52,138,178],"if":[8],"it":[9,37,80],"minimizes":[10],"its":[11,147],"maximum":[12],"distance":[13,27,117],"to":[14,49,82,123],"the":[15,25,33,43,56,60,70,95,124,156,169,181,190,200,208],"other":[16,34,125],"vertices.":[17],"The":[18],"radius":[19],"of":[20,59,73,89,97,160,183,192],"G":[23,112],"largest":[26],"between":[28],"and":[32,36],"vertices,":[35],"denoted":[39],"by":[40],"rad(G).":[41],"In":[42,100],"center":[44,61],"problem,":[45],"we":[46,187],"are":[47],"asked":[48],"find":[50],"vertex.":[53],"We":[54],"study":[55],"fine-grained":[57],"complexity":[58],"problem":[62],"on":[63],"graphs":[64,154],"with":[65],"small":[66],"Gromov":[67,71],"hyperbolicity.":[68],"Roughly,":[69],"hyperbolicity":[72],"represents":[76],"how":[77],"close,":[78],"locally,":[79],"tree,":[84],"from":[85],"metric":[87],"point":[88],"view.":[90],"It":[91],"has":[92],"applications":[93],"design":[96],"approximation":[98],"algorithms.":[99],"particular,":[101],"there":[102],"linear-time":[105,133,173],"algorithm":[106,134,174,195],"that":[107],"for":[108,135,143,152,175,196],"every":[109],"\u03b4-hyperbolic":[110],"outputs":[113],"some":[114],"at":[116,118],"most":[119],"rad(G)":[120],"+":[121],"5\u03b4":[122],"vertices":[126],"[Chepoi":[127],"et":[128,162],"al,":[129,163],"SoCG'08].":[130],"However,":[131],"computing":[136,176],"known":[141],"only":[142],"0-hyperbolic":[144],"graphs,":[145,198],"whereas":[146],"existence":[148,191],"was":[149],"ruled":[150],"out":[151,189],"2-hyperbolic":[153],"under":[155,199],"Hitting":[157,201],"Set":[158,202],"Conjecture":[159],"[Abboud":[161],"SODA'16].":[164],"Our":[165],"main":[166],"contribution":[167],"paper":[170],"class":[182],"1/2-hyperbolic":[184],"graphs.":[185],"Furthermore,":[186],"rule":[188],"such":[193],"an":[194],"1-hyperbolic":[197],"Conjecture,":[203],"thus":[204],"completely":[205],"settling":[206],"all":[207],"cases":[209],"left":[210],"open.":[211]},"counts_by_year":[],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2026-07-02T00:00:00"}