{"id":"https://openalex.org/W6888583508","doi":"https://doi.org/10.20382/jocg.v14i2a3","title":"Hop-spanners for geometric intersection graphs","display_name":"Hop-spanners for geometric intersection graphs","publication_year":2023,"publication_date":"2023-10-30","ids":{"openalex":"https://openalex.org/W6888583508","doi":"https://doi.org/10.20382/jocg.v14i2a3"},"language":"en","primary_location":{"id":"pmh:oai:ojs.library.carleton.ca:article/4475","is_oa":true,"landing_page_url":"https://jocg.org/index.php/jocg/article/view/4475","pdf_url":"https://jocg.org/index.php/jocg/article/download/4475/3398","source":{"id":"https://openalex.org/S4306400962","display_name":"Journal of Computational Geometry (Carleton University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67031392","host_organization_name":"Carleton University","host_organization_lineage":["https://openalex.org/I67031392"],"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":"Journal of Computational Geometry; Vol. 14 No. 2 (2023): Special Issue of Selected Papers from SoCG 2022; 26\u201364","raw_type":"info:eu-repo/semantics/article"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://jocg.org/index.php/jocg/article/download/4475/3398","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Conroy, Jonathan","orcid":null},"institutions":[{"id":"https://openalex.org/I107672454","display_name":"Dartmouth College","ror":"https://ror.org/049s0rh22","country_code":"US","type":"education","lineage":["https://openalex.org/I107672454"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Conroy, Jonathan","raw_affiliation_strings":["Department of Computer Science, Dartmouth College, Hanover, NH, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Dartmouth College, Hanover, NH, USA","institution_ids":["https://openalex.org/I107672454"]}]},{"author_position":"last","author":{"id":null,"display_name":"T\u00f3th, Csaba","orcid":null},"institutions":[{"id":"https://openalex.org/I121934306","display_name":"Tufts University","ror":"https://ror.org/05wvpxv85","country_code":"US","type":"education","lineage":["https://openalex.org/I121934306"]},{"id":"https://openalex.org/I157638225","display_name":"California State University, Northridge","ror":"https://ror.org/005f5hv41","country_code":"US","type":"education","lineage":["https://openalex.org/I157638225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"T\u00f3th, Csaba","raw_affiliation_strings":["Department of Mathematics, California State University Northridge, Los Angeles, CA; and Department of Computer Science, Tufts University, Medford, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, California State University Northridge, Los Angeles, CA; and Department of Computer Science, Tufts University, Medford, MA, USA","institution_ids":["https://openalex.org/I121934306","https://openalex.org/I157638225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6569,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.79725925,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9876999855041504,"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.9876999855041504,"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.003000000026077032,"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.002199999988079071,"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/intersection-graph","display_name":"Intersection graph","score":0.6922000050544739},{"id":"https://openalex.org/keywords/spanner","display_name":"Spanner","score":0.675000011920929},{"id":"https://openalex.org/keywords/geometric-graph-theory","display_name":"Geometric graph theory","score":0.5228999853134155},{"id":"https://openalex.org/keywords/unit-disk-graph","display_name":"Unit disk graph","score":0.5185999870300293},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41499999165534973},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4034000039100647},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.390500009059906},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.37770000100135803},{"id":"https://openalex.org/keywords/distance-hereditary-graph","display_name":"Distance-hereditary graph","score":0.36169999837875366}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.868399977684021},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7343999743461609},{"id":"https://openalex.org/C54540088","wikidata":"https://www.wikidata.org/wiki/Q3498041","display_name":"Intersection graph","level":4,"score":0.6922000050544739},{"id":"https://openalex.org/C2779585601","wikidata":"https://www.wikidata.org/wiki/Q4049850","display_name":"Spanner","level":2,"score":0.675000011920929},{"id":"https://openalex.org/C173547177","wikidata":"https://www.wikidata.org/wiki/Q1503271","display_name":"Geometric graph theory","level":5,"score":0.5228999853134155},{"id":"https://openalex.org/C130184317","wikidata":"https://www.wikidata.org/wiki/Q3115549","display_name":"Unit disk graph","level":4,"score":0.5185999870300293},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4805999994277954},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41499999165534973},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4034000039100647},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.390500009059906},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.37770000100135803},{"id":"https://openalex.org/C147792647","wikidata":"https://www.wikidata.org/wiki/Q5282847","display_name":"Distance-hereditary graph","level":5,"score":0.36169999837875366},{"id":"https://openalex.org/C103368685","wikidata":"https://www.wikidata.org/wiki/Q638846","display_name":"Intersection number","level":3,"score":0.35199999809265137},{"id":"https://openalex.org/C43413943","wikidata":"https://www.wikidata.org/wiki/Q4927193","display_name":"Block graph","level":5,"score":0.3474999964237213},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.3418999910354614},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.33660000562667847},{"id":"https://openalex.org/C53471067","wikidata":"https://www.wikidata.org/wiki/Q7574076","display_name":"Spatial network","level":2,"score":0.32760000228881836},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3199999928474426},{"id":"https://openalex.org/C30609935","wikidata":"https://www.wikidata.org/wiki/Q7291969","display_name":"Random geometric graph","level":5,"score":0.28349998593330383},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.27720001339912415},{"id":"https://openalex.org/C125792925","wikidata":"https://www.wikidata.org/wiki/Q3115604","display_name":"Outerplanar graph","level":5,"score":0.27160000801086426},{"id":"https://openalex.org/C134912446","wikidata":"https://www.wikidata.org/wiki/Q5166516","display_name":"Convex body","level":4,"score":0.2696000039577484},{"id":"https://openalex.org/C36038622","wikidata":"https://www.wikidata.org/wiki/Q5428703","display_name":"Factor-critical graph","level":5,"score":0.2678000032901764},{"id":"https://openalex.org/C2777724877","wikidata":"https://www.wikidata.org/wiki/Q2548661","display_name":"Crossing number (knot theory)","level":3,"score":0.2565000057220459}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:ojs.library.carleton.ca:article/4475","is_oa":true,"landing_page_url":"https://jocg.org/index.php/jocg/article/view/4475","pdf_url":"https://jocg.org/index.php/jocg/article/download/4475/3398","source":{"id":"https://openalex.org/S4306400962","display_name":"Journal of Computational Geometry (Carleton University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67031392","host_organization_name":"Carleton University","host_organization_lineage":["https://openalex.org/I67031392"],"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":"Journal of Computational Geometry; Vol. 14 No. 2 (2023): Special Issue of Selected Papers from SoCG 2022; 26\u201364","raw_type":"info:eu-repo/semantics/article"},{"id":"doi:10.20382/jocg.v14i2a3","is_oa":true,"landing_page_url":"https://doi.org/10.20382/jocg.v14i2a3","pdf_url":null,"source":{"id":"https://openalex.org/S4306400962","display_name":"Journal of Computational Geometry (Carleton University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67031392","host_organization_name":"Carleton University","host_organization_lineage":["https://openalex.org/I67031392"],"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":"JournalArticle"}],"best_oa_location":{"id":"pmh:oai:ojs.library.carleton.ca:article/4475","is_oa":true,"landing_page_url":"https://jocg.org/index.php/jocg/article/view/4475","pdf_url":"https://jocg.org/index.php/jocg/article/download/4475/3398","source":{"id":"https://openalex.org/S4306400962","display_name":"Journal of Computational Geometry (Carleton University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67031392","host_organization_name":"Carleton University","host_organization_lineage":["https://openalex.org/I67031392"],"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":"Journal of Computational Geometry; Vol. 14 No. 2 (2023): Special Issue of Selected Papers from SoCG 2022; 26\u201364","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W6888583508.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"A":[0],"$t$-spanner":[1],"of":[2,14,90,129,136,158,166,186],"a":[3,7,12,32,118,142,156,175,191],"graph":[4,30,115,135,165,185],"$G=(V,E)$":[5],"is":[6,25,43,54,152],"subgraph":[8],"$H=(V,E')$":[9],"that":[10,27],"contains":[11],"$uv$-path":[13],"length":[15],"at":[16],"most":[17],"$t$":[18],"for":[19,37,47,67,71],"every":[20,28],"$uv":[21],"\\in":[22,69],"E$.":[23],"It":[24],"known":[26,82],"$n$-vertex":[29,112],"admits":[31,117,141,174,190],"$(2k-1)$-spanner":[33],"with":[34,121,145,178,194],"$O(n^{1+1/k})$":[35],"edges":[36],"$k":[38],"\\geq":[39],"1$.":[40],"This":[41],"bound":[42,128,151],"the":[44,76,88,99,107,126,172],"best":[45],"possible":[46],"$1":[48],"\\leq":[49,51],"k":[50],"9$":[52],"and":[53,149],"conjectured":[55],"to":[56,60,86,95,155],"be":[57],"optimal":[58],"due":[59],"Erd\u0151s'":[61],"girth":[62],"conjecture.":[63],"We":[64,105],"study":[65],"$t$-spanners":[66],"$t":[68],"\\{2,3\\}$":[70],"geometric":[72,100],"intersection":[73,134,164,184],"graphs":[74],"in":[75,171],"plane.":[77],"These":[78],"spanners":[79,85],"are":[80],"also":[81],"as":[83],"$t$-hop":[84],"emphasize":[87],"use":[89],"graph-theoretic":[91],"distances":[92,97],"(as":[93],"opposed":[94],"Euclidean":[96],"between":[98],"objects":[101],"or":[102],"their":[103],"centers).":[104],"obtain":[106],"following":[108],"results:":[109],"(1)":[110],"Every":[111],"unit":[113],"disk":[114],"(UDG)":[116],"2-hop":[119,143],"spanner":[120,144,177,193],"$O(n)$":[122],"edges;":[123],"improving":[124],"upon":[125],"previous":[127],"$O(n\\log":[130,146,179],"n)$.":[131],"(2)":[132],"The":[133,163,183],"$n$":[137,167,187],"axis-aligned":[138,188],"fat":[139,168],"rectangles":[140,189],"n)$":[147,180,196],"edges,":[148],"this":[150],"tight":[153],"up":[154],"factor":[157],"$\\log":[159],"\\log":[160],"n$.":[161],"(3)":[162],"convex":[169],"bodies":[170],"plane":[173],"3-hop":[176,192],"edges.":[181,197],"(4)":[182],"$O(n\\log^2":[195]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}