{"id":"https://openalex.org/W2089362834","doi":"https://doi.org/10.1016/s0166-218x(01)00256-6","title":"Short trees in polygons","display_name":"Short trees in polygons","publication_year":2002,"publication_date":"2002-04-01","ids":{"openalex":"https://openalex.org/W2089362834","doi":"https://doi.org/10.1016/s0166-218x(01)00256-6","mag":"2089362834"},"language":"en","primary_location":{"id":"doi:10.1016/s0166-218x(01)00256-6","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0166-218x(01)00256-6","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","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/A5030887041","display_name":"Pawe\u0142 Winter","orcid":"https://orcid.org/0000-0003-2669-0524"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Pawel Winter","raw_affiliation_strings":["Department of Computer Science, University of Copenhagen, Universitetsparken 1, DK-2100 Copenhagen \u00d8, Denmark","Department of Computer Science, University of Copenhagen, Universitetsparken 1, DK-2100 Copenhagen \u00d8, Denmark#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Copenhagen, Universitetsparken 1, DK-2100 Copenhagen \u00d8, Denmark","institution_ids":["https://openalex.org/I124055696"]},{"raw_affiliation_string":"Department of Computer Science, University of Copenhagen, Universitetsparken 1, DK-2100 Copenhagen \u00d8, Denmark#TAB#","institution_ids":["https://openalex.org/I124055696"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057902603","display_name":"Martin Zachariasen","orcid":"https://orcid.org/0000-0002-2329-3606"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Martin Zachariasen","raw_affiliation_strings":["Department of Computer Science, University of Copenhagen, Universitetsparken 1, DK-2100 Copenhagen \u00d8, Denmark","Department of Computer Science, University of Copenhagen, Universitetsparken 1, DK-2100 Copenhagen \u00d8, Denmark#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Copenhagen, Universitetsparken 1, DK-2100 Copenhagen \u00d8, Denmark","institution_ids":["https://openalex.org/I124055696"]},{"raw_affiliation_string":"Department of Computer Science, University of Copenhagen, Universitetsparken 1, DK-2100 Copenhagen \u00d8, Denmark#TAB#","institution_ids":["https://openalex.org/I124055696"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004448192","display_name":"Jens Cosedis Nielsen","orcid":null},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Jens Nielsen","raw_affiliation_strings":["Department of Computer Science, University of Copenhagen, Universitetsparken 1, DK-2100 Copenhagen \u00d8, Denmark","Department of Computer Science, University of Copenhagen, Universitetsparken 1, DK-2100 Copenhagen \u00d8, Denmark#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Copenhagen, Universitetsparken 1, DK-2100 Copenhagen \u00d8, Denmark","institution_ids":["https://openalex.org/I124055696"]},{"raw_affiliation_string":"Department of Computer Science, University of Copenhagen, Universitetsparken 1, DK-2100 Copenhagen \u00d8, Denmark#TAB#","institution_ids":["https://openalex.org/I124055696"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5030887041"],"corresponding_institution_ids":["https://openalex.org/I124055696"],"apc_list":{"value":2750,"currency":"USD","value_usd":2750},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.14390295,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"118","issue":"1-2","first_page":"55","last_page":"72"},"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.9998000264167786,"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.9998000264167786,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9914000034332275,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9890999794006348,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7724721431732178},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.7148473262786865},{"id":"https://openalex.org/keywords/concatenation","display_name":"Concatenation (mathematics)","score":0.6939154863357544},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6903272867202759},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6009742021560669},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5239232182502747},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5044494867324829},{"id":"https://openalex.org/keywords/simple-polygon","display_name":"Simple polygon","score":0.46732938289642334},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.4316321611404419},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.42931488156318665},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.4265042543411255},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3713078498840332},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36130931973457336},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.3064624071121216},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.26870131492614746},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.18515655398368835}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7724721431732178},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.7148473262786865},{"id":"https://openalex.org/C87619178","wikidata":"https://www.wikidata.org/wiki/Q126002","display_name":"Concatenation (mathematics)","level":2,"score":0.6939154863357544},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6903272867202759},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6009742021560669},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5239232182502747},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5044494867324829},{"id":"https://openalex.org/C197949415","wikidata":"https://www.wikidata.org/wiki/Q782746","display_name":"Simple polygon","level":3,"score":0.46732938289642334},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.4316321611404419},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.42931488156318665},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.4265042543411255},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3713078498840332},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36130931973457336},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3064624071121216},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.26870131492614746},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.18515655398368835},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1016/s0166-218x(01)00256-6","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0166-218x(01)00256-6","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.146.4591","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.146.4591","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.diku.dk/users/pawel/pawel/short_trees.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.44.5463","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.44.5463","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.diku.dk/~pawel/short_trees.ps","raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/d1b95ad0-74c0-11db-bee9-02004c4f4f50","is_oa":false,"landing_page_url":"https://curis.ku.dk/portal/da/publications/short-trees-in-polygons(d1b95ad0-74c0-11db-bee9-02004c4f4f50).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Winter , P , Zachariasen , M & Nielsen , J 2002 , ' Short Trees in Polygons ' , Discrete Applied Mathematics , no. vol. 118 , pp. 55-72 .","raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W55191700","https://openalex.org/W100746185","https://openalex.org/W136556473","https://openalex.org/W1485262373","https://openalex.org/W1508240458","https://openalex.org/W1538049595","https://openalex.org/W1558703235","https://openalex.org/W1598916021","https://openalex.org/W2011065039","https://openalex.org/W2011703460","https://openalex.org/W2022150791","https://openalex.org/W2058250759","https://openalex.org/W2071945466","https://openalex.org/W2088172021","https://openalex.org/W2139606248","https://openalex.org/W2156153879","https://openalex.org/W2251833106","https://openalex.org/W2491756698","https://openalex.org/W6604172876","https://openalex.org/W6630303308","https://openalex.org/W6632265289"],"related_works":["https://openalex.org/W2883608652","https://openalex.org/W4289743499","https://openalex.org/W2017321526","https://openalex.org/W1730635092","https://openalex.org/W2062138633","https://openalex.org/W2357233526","https://openalex.org/W2047412641","https://openalex.org/W2063600012","https://openalex.org/W2089362834","https://openalex.org/W2949470583"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}