{"id":"https://openalex.org/W2146448055","doi":"https://doi.org/10.1007/s00454-003-2853-5","title":"Spanning Trees Crossing Few Barriers","display_name":"Spanning Trees Crossing Few Barriers","publication_year":2003,"publication_date":"2003-10-01","ids":{"openalex":"https://openalex.org/W2146448055","doi":"https://doi.org/10.1007/s00454-003-2853-5","mag":"2146448055"},"language":"en","primary_location":{"id":"doi:10.1007/s00454-003-2853-5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00454-003-2853-5","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00454-003-2853-5.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 and 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-003-2853-5.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5038413661","display_name":"Tetsuo Asano","orcid":"https://orcid.org/0000-0002-4741-0467"},"institutions":[{"id":"https://openalex.org/I177738480","display_name":"Japan Advanced Institute of Science and Technology","ror":"https://ror.org/03frj4r98","country_code":"JP","type":"education","lineage":["https://openalex.org/I177738480"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Tetsuo Asano","raw_affiliation_strings":["Japan Advanced Institute of Science and Technology,\nAsahidai, Tatsunokuchi, Ishikawa, 923-1292, Japan","Japan Advanced Institute of Science and Technology,#N#Asahidai, Tatsunokuchi, Ishikawa, 923-1292"],"affiliations":[{"raw_affiliation_string":"Japan Advanced Institute of Science and Technology,\nAsahidai, Tatsunokuchi, Ishikawa, 923-1292, Japan","institution_ids":["https://openalex.org/I177738480"]},{"raw_affiliation_string":"Japan Advanced Institute of Science and Technology,#N#Asahidai, Tatsunokuchi, Ishikawa, 923-1292","institution_ids":["https://openalex.org/I177738480"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028410825","display_name":"Mark de Berg","orcid":"https://orcid.org/0000-0001-5770-3784"},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Mark de Berg","raw_affiliation_strings":["Institute of Information and Computing Sciences, Utrecht University,\nP.O. Box 80.089, 3508 TB Utrecht, The Netherlands","Institute of Information and Computing Sciences, Utrecht University,#N#P.O. Box 80.089, 3508 TB Utrecht"],"affiliations":[{"raw_affiliation_string":"Institute of Information and Computing Sciences, Utrecht University,\nP.O. Box 80.089, 3508 TB Utrecht, The Netherlands","institution_ids":["https://openalex.org/I193662353"]},{"raw_affiliation_string":"Institute of Information and Computing Sciences, Utrecht University,#N#P.O. Box 80.089, 3508 TB Utrecht","institution_ids":["https://openalex.org/I193662353"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5091366247","display_name":"Otfried Cheong","orcid":"https://orcid.org/0000-0003-4467-7075"},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Otfried Cheong","raw_affiliation_strings":["Institute of Information and Computing Sciences, Utrecht University,\nP.O. Box 80.089, 3508 TB Utrecht, The Netherlands","Institute of Information and Computing Sciences, Utrecht University,#N#P.O. Box 80.089, 3508 TB Utrecht"],"affiliations":[{"raw_affiliation_string":"Institute of Information and Computing Sciences, Utrecht University,\nP.O. Box 80.089, 3508 TB Utrecht, The Netherlands","institution_ids":["https://openalex.org/I193662353"]},{"raw_affiliation_string":"Institute of Information and Computing Sciences, Utrecht University,#N#P.O. Box 80.089, 3508 TB Utrecht","institution_ids":["https://openalex.org/I193662353"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065368881","display_name":"Leonidas Guibas","orcid":"https://orcid.org/0000-0002-8315-4886"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Leonidas J. Guibas","raw_affiliation_strings":["Department of Computer Science, Stanford University, \nStanford, CA 94305, USA","Department of Computer Science, Stanford University, Stanford, CA, 94305"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Stanford University, \nStanford, CA 94305, USA","institution_ids":["https://openalex.org/I97018004"]},{"raw_affiliation_string":"Department of Computer Science, Stanford University, Stanford, CA, 94305","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074061303","display_name":"Jack Snoeyink","orcid":"https://orcid.org/0000-0002-3887-4008"},"institutions":[{"id":"https://openalex.org/I114027177","display_name":"University of North Carolina at Chapel Hill","ror":"https://ror.org/0130frc33","country_code":"US","type":"education","lineage":["https://openalex.org/I114027177"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jack Snoeyink","raw_affiliation_strings":["Department of Computer Science, University of North Carolina at Chapel\nHill, \nNC 27599-3175, USA","Department of Computer Science, University of North Carolina at Chapel#N#Hill, #N#NC 27599-3175"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of North Carolina at Chapel\nHill, \nNC 27599-3175, USA","institution_ids":["https://openalex.org/I114027177"]},{"raw_affiliation_string":"Department of Computer Science, University of North Carolina at Chapel#N#Hill, #N#NC 27599-3175","institution_ids":["https://openalex.org/I114027177"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053315038","display_name":"Hisao Tamaki","orcid":"https://orcid.org/0000-0001-7566-8505"},"institutions":[{"id":"https://openalex.org/I16656306","display_name":"Meiji University","ror":"https://ror.org/02rqvrp93","country_code":"JP","type":"education","lineage":["https://openalex.org/I16656306"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Hisao Tamaki","raw_affiliation_strings":["Department of Computer Science, Meiji University,\nHigashi-Mita, Tama-ku, Kawasaki, 214, Japan","Department of Computer Science, Meiji University,#N#Higashi-Mita, Tama-ku, Kawasaki, 214"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Meiji University,\nHigashi-Mita, Tama-ku, Kawasaki, 214, Japan","institution_ids":["https://openalex.org/I16656306"]},{"raw_affiliation_string":"Department of Computer Science, Meiji University,#N#Higashi-Mita, Tama-ku, Kawasaki, 214","institution_ids":["https://openalex.org/I16656306"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5038413661"],"corresponding_institution_ids":["https://openalex.org/I177738480"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":1.34,"has_fulltext":true,"cited_by_count":12,"citation_normalized_percentile":{"value":0.83826594,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"30","issue":"4","first_page":"591","last_page":"606"},"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/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/T10374","display_name":"Advanced Graph Theory Research","score":0.9958999752998352,"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/spanning-tree","display_name":"Spanning tree","score":0.8889881372451782},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8459409475326538},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.7543069124221802},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7351320385932922},{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.5898817777633667},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5624206066131592},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5385165810585022},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.5122851133346558},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.5101618766784668},{"id":"https://openalex.org/keywords/line-segment","display_name":"Line segment","score":0.4863922894001007},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.45781436562538147},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.4550013542175293},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.44134801626205444},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3353431820869446},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06771430373191833}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.8889881372451782},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8459409475326538},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.7543069124221802},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7351320385932922},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.5898817777633667},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5624206066131592},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5385165810585022},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.5122851133346558},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.5101618766784668},{"id":"https://openalex.org/C182124507","wikidata":"https://www.wikidata.org/wiki/Q166154","display_name":"Line segment","level":2,"score":0.4863922894001007},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.45781436562538147},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.4550013542175293},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.44134801626205444},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3353431820869446},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06771430373191833},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/s00454-003-2853-5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00454-003-2853-5","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00454-003-2853-5.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 and Computational Geometry","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/272023ec-3316-44e9-afe1-e2569b428f19","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/272023ec-3316-44e9-afe1-e2569b428f19","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Asano, T, Berg, de, M, Cheong, O, Guibas, L J, Snoeyink, J & Tamaki, H 2003, 'Spanning trees crossing few barriers', Discrete and Computational Geometry, vol. 30, no. 4, pp. 591-606. https://doi.org/10.1007/s00454-003-2853-5","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:koasas.kaist.ac.kr:10203/307","is_oa":false,"landing_page_url":"http://hdl.handle.net/10203/307","pdf_url":null,"source":{"id":"https://openalex.org/S4306402435","display_name":"KAIST Institutional Repository (KAIST)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I157485424","host_organization_name":"Korea Advanced Institute of Science and Technology","host_organization_lineage":["https://openalex.org/I157485424"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"pmh:tue:oai:pure.tue.nl:publications/272023ec-3316-44e9-afe1-e2569b428f19","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/272023ec-3316-44e9-afe1-e2569b428f19","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Discrete and Computational Geometry, 30(4), 591 - 606. Springer","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1007/s00454-003-2853-5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00454-003-2853-5","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00454-003-2853-5.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 and Computational Geometry","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5548423505","display_name":"Geometric Structure in Geographic Information Systems and Molecular Modeling","funder_award_id":"9988742","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"},{"id":"https://openalex.org/F4320323180","display_name":"University of British Columbia","ror":"https://ror.org/03rmrcq20"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2146448055.pdf","grobid_xml":"https://content.openalex.org/works/W2146448055.grobid-xml"},"referenced_works_count":11,"referenced_works":["https://openalex.org/W1568814373","https://openalex.org/W1570805656","https://openalex.org/W1979838628","https://openalex.org/W1983698126","https://openalex.org/W1994432275","https://openalex.org/W2025809050","https://openalex.org/W2028747718","https://openalex.org/W2072606618","https://openalex.org/W2120039945","https://openalex.org/W2132026455","https://openalex.org/W2502636724"],"related_works":["https://openalex.org/W2149927264","https://openalex.org/W4308416203","https://openalex.org/W2099915933","https://openalex.org/W2307044859","https://openalex.org/W1991421283","https://openalex.org/W2047517090","https://openalex.org/W4220861011","https://openalex.org/W3141326665","https://openalex.org/W2041764189","https://openalex.org/W2014991506"],"abstract_inverted_index":null,"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}