{"id":"https://openalex.org/W2033123200","doi":"https://doi.org/10.1007/s00454-007-9025-y","title":"Tight Bounds for Connecting Sites Across Barriers","display_name":"Tight Bounds for Connecting Sites Across Barriers","publication_year":2008,"publication_date":"2008-02-04","ids":{"openalex":"https://openalex.org/W2033123200","doi":"https://doi.org/10.1007/s00454-007-9025-y","mag":"2033123200"},"language":"en","primary_location":{"id":"doi:10.1007/s00454-007-9025-y","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00454-007-9025-y","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00454-007-9025-y.pdf","source":{"id":"https://openalex.org/S103671469","display_name":"Discrete & Computational Geometry","issn_l":"0179-5376","issn":["0179-5376","1432-0444"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete & Computational Geometry","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://link.springer.com/content/pdf/10.1007/s00454-007-9025-y.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5083263074","display_name":"David W. Krumme","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"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"David Krumme","raw_affiliation_strings":["Department of Computer Science, Tufts University, Medford, MA, 02155, USA","Tufts University, Department of Computer Science, 02155, Medford, MA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Tufts University, Medford, MA, 02155, USA","institution_ids":["https://openalex.org/I121934306"]},{"raw_affiliation_string":"Tufts University, Department of Computer Science, 02155, Medford, MA, USA","institution_ids":["https://openalex.org/I121934306"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054701787","display_name":"Eynat Rafalin","orcid":null},"institutions":[{"id":"https://openalex.org/I1291425158","display_name":"Google (United States)","ror":"https://ror.org/00njsd438","country_code":"US","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210128969"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Eynat Rafalin","raw_affiliation_strings":["Google Inc., Mountain View, CA, 94043, USA","Google Inc., 94043, Mountain View, CA, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Google Inc., Mountain View, CA, 94043, USA","institution_ids":["https://openalex.org/I1291425158"]},{"raw_affiliation_string":"Google Inc., 94043, Mountain View, CA, USA#TAB#","institution_ids":["https://openalex.org/I1291425158"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069555175","display_name":"Diane L. Souvaine","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"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Diane L. Souvaine","raw_affiliation_strings":["Department of Computer Science, Tufts University, Medford, MA, 02155, USA","Tufts University, Department of Computer Science, 02155, Medford, MA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Tufts University, Medford, MA, 02155, USA","institution_ids":["https://openalex.org/I121934306"]},{"raw_affiliation_string":"Tufts University, Department of Computer Science, 02155, Medford, MA, USA","institution_ids":["https://openalex.org/I121934306"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030799674","display_name":"Csaba D. T\u00f3th","orcid":"https://orcid.org/0000-0002-8769-3190"},"institutions":[{"id":"https://openalex.org/I168635309","display_name":"University of Calgary","ror":"https://ror.org/03yjb2x39","country_code":"CA","type":"education","lineage":["https://openalex.org/I168635309"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Csaba D. T\u00f3th","raw_affiliation_strings":["Department of Mathematics, University of Calgary, Calgary, Canada","University of Calgary, Department of Mathematics, 94043, Calgary, CA, Canada#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Calgary, Calgary, Canada","institution_ids":["https://openalex.org/I168635309"]},{"raw_affiliation_string":"University of Calgary, Department of Mathematics, 94043, Calgary, CA, Canada#TAB#","institution_ids":["https://openalex.org/I168635309"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5083263074"],"corresponding_institution_ids":["https://openalex.org/I121934306"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":1.4887,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.86298775,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"40","issue":"3","first_page":"377","last_page":"394"},"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.9998999834060669,"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.9998999834060669,"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.9944000244140625,"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/T11830","display_name":"Point processes and geometric inequalities","score":0.9897000193595886,"subfield":{"id":"https://openalex.org/subfields/2604","display_name":"Applied Mathematics"},"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/combinatorics","display_name":"Combinatorics","score":0.822516143321991},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.8035731911659241},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.786348819732666},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6752041578292847},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6286425590515137},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.61949622631073},{"id":"https://openalex.org/keywords/line-segment","display_name":"Line segment","score":0.5439337491989136},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.5269083380699158},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.5264626145362854},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.5000960826873779},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.466410756111145},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.46575647592544556},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.4626494348049164},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.44245558977127075},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36171939969062805},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.22744235396385193},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.135819673538208},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.07713335752487183},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.07112330198287964}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.822516143321991},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.8035731911659241},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.786348819732666},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6752041578292847},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6286425590515137},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.61949622631073},{"id":"https://openalex.org/C182124507","wikidata":"https://www.wikidata.org/wiki/Q166154","display_name":"Line segment","level":2,"score":0.5439337491989136},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.5269083380699158},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.5264626145362854},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.5000960826873779},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.466410756111145},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.46575647592544556},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.4626494348049164},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.44245558977127075},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36171939969062805},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.22744235396385193},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.135819673538208},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.07713335752487183},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.07112330198287964}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00454-007-9025-y","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00454-007-9025-y","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00454-007-9025-y.pdf","source":{"id":"https://openalex.org/S103671469","display_name":"Discrete & Computational Geometry","issn_l":"0179-5376","issn":["0179-5376","1432-0444"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete & Computational Geometry","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s00454-007-9025-y","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00454-007-9025-y","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00454-007-9025-y.pdf","source":{"id":"https://openalex.org/S103671469","display_name":"Discrete & Computational Geometry","issn_l":"0179-5376","issn":["0179-5376","1432-0444"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete & Computational Geometry","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.6399999856948853,"display_name":"Sustainable cities and communities"}],"awards":[{"id":"https://openalex.org/G6295503073","display_name":"Impact on Computational Geometry on Depth-Based Statistics","funder_award_id":"0431027","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2033123200.pdf","grobid_xml":"https://content.openalex.org/works/W2033123200.grobid-xml"},"referenced_works_count":16,"referenced_works":["https://openalex.org/W57036744","https://openalex.org/W73369637","https://openalex.org/W1568814373","https://openalex.org/W1964691748","https://openalex.org/W2006673860","https://openalex.org/W2009263755","https://openalex.org/W2011297770","https://openalex.org/W2025809050","https://openalex.org/W2052165970","https://openalex.org/W2095880112","https://openalex.org/W2126876121","https://openalex.org/W2128427107","https://openalex.org/W2132026455","https://openalex.org/W2146448055","https://openalex.org/W2156144124","https://openalex.org/W4235042979"],"related_works":["https://openalex.org/W2081066931","https://openalex.org/W4254335849","https://openalex.org/W2911818503","https://openalex.org/W620960161","https://openalex.org/W2045244794","https://openalex.org/W2039611868","https://openalex.org/W2621339359","https://openalex.org/W4390962175","https://openalex.org/W2513418505","https://openalex.org/W2809830069"],"abstract_inverted_index":null,"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}