{"id":"https://openalex.org/W2401987567","doi":"https://doi.org/10.1007/978-3-319-28678-5_5","title":"Plane Geodesic Spanning Trees, Hamiltonian Cycles, and Perfect Matchings in a Simple Polygon","display_name":"Plane Geodesic Spanning Trees, Hamiltonian Cycles, and Perfect Matchings in a Simple Polygon","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2401987567","doi":"https://doi.org/10.1007/978-3-319-28678-5_5","mag":"2401987567"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-28678-5_5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-28678-5_5","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://inria.hal.science/hal-01446264","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5015212072","display_name":"Ahmad Biniaz","orcid":"https://orcid.org/0000-0002-6396-4494"},"institutions":[{"id":"https://openalex.org/I67031392","display_name":"Carleton University","ror":"https://ror.org/02qtvee93","country_code":"CA","type":"education","lineage":["https://openalex.org/I67031392"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Ahmad Biniaz","raw_affiliation_strings":["Carleton University, Ottawa, Canada"],"affiliations":[{"raw_affiliation_string":"Carleton University, Ottawa, Canada","institution_ids":["https://openalex.org/I67031392"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013674788","display_name":"Prosenjit Bose","orcid":"https://orcid.org/0000-0002-8906-0573"},"institutions":[{"id":"https://openalex.org/I67031392","display_name":"Carleton University","ror":"https://ror.org/02qtvee93","country_code":"CA","type":"education","lineage":["https://openalex.org/I67031392"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Prosenjit Bose","raw_affiliation_strings":["Carleton University, Ottawa, Canada"],"affiliations":[{"raw_affiliation_string":"Carleton University, Ottawa, Canada","institution_ids":["https://openalex.org/I67031392"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103136561","display_name":"Anil Maheshwari","orcid":"https://orcid.org/0000-0002-1274-4598"},"institutions":[{"id":"https://openalex.org/I67031392","display_name":"Carleton University","ror":"https://ror.org/02qtvee93","country_code":"CA","type":"education","lineage":["https://openalex.org/I67031392"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Anil Maheshwari","raw_affiliation_strings":["Carleton University, Ottawa, Canada"],"affiliations":[{"raw_affiliation_string":"Carleton University, Ottawa, Canada","institution_ids":["https://openalex.org/I67031392"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108374265","display_name":"Michiel Smid","orcid":null},"institutions":[{"id":"https://openalex.org/I67031392","display_name":"Carleton University","ror":"https://ror.org/02qtvee93","country_code":"CA","type":"education","lineage":["https://openalex.org/I67031392"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Michiel Smid","raw_affiliation_strings":["Carleton University, Ottawa, Canada"],"affiliations":[{"raw_affiliation_string":"Carleton University, Ottawa, Canada","institution_ids":["https://openalex.org/I67031392"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5015212072"],"corresponding_institution_ids":["https://openalex.org/I67031392"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":{"value":5000,"currency":"EUR","value_usd":5392},"fwci":0.7279,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.64741036,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"56","last_page":"71"},"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.9828000068664551,"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/T11106","display_name":"Data Management and Algorithms","score":0.9635000228881836,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/simple-polygon","display_name":"Simple polygon","score":0.8166900873184204},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8044666051864624},{"id":"https://openalex.org/keywords/geodesic","display_name":"Geodesic","score":0.7253215312957764},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.6662524938583374},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.5312609076499939},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5307424068450928},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.49023014307022095},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.48082435131073},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.338769793510437},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3314055800437927},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.1765625774860382},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.16329124569892883}],"concepts":[{"id":"https://openalex.org/C197949415","wikidata":"https://www.wikidata.org/wiki/Q782746","display_name":"Simple polygon","level":3,"score":0.8166900873184204},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8044666051864624},{"id":"https://openalex.org/C165818556","wikidata":"https://www.wikidata.org/wiki/Q213488","display_name":"Geodesic","level":2,"score":0.7253215312957764},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.6662524938583374},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.5312609076499939},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5307424068450928},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.49023014307022095},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.48082435131073},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.338769793510437},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3314055800437927},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.1765625774860382},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.16329124569892883}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-319-28678-5_5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-28678-5_5","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:HAL:hal-01446264v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01446264","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"1st International Conference on Theoretical Computer Science (TTCS), Aug 2015, Tehran, Iran. pp.56-71, ⟨10.1007/978-3-319-28678-5_5⟩","raw_type":"Conference papers"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-01446264v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01446264","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"1st International Conference on Theoretical Computer Science (TTCS), Aug 2015, Tehran, Iran. pp.56-71, ⟨10.1007/978-3-319-28678-5_5⟩","raw_type":"Conference papers"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W4368930","https://openalex.org/W100746185","https://openalex.org/W1001549597","https://openalex.org/W1162809776","https://openalex.org/W1557776940","https://openalex.org/W2125861228","https://openalex.org/W2126876121","https://openalex.org/W2132339863","https://openalex.org/W2150122711","https://openalex.org/W2367144953","https://openalex.org/W3136448411","https://openalex.org/W4205821313"],"related_works":["https://openalex.org/W2506111601","https://openalex.org/W2766044635","https://openalex.org/W2943988667","https://openalex.org/W4300757011","https://openalex.org/W2981995226","https://openalex.org/W2489438003","https://openalex.org/W2493913654","https://openalex.org/W1610448541","https://openalex.org/W4285781485","https://openalex.org/W2951071105"],"abstract_inverted_index":{"Let":[0],"S":[1,27,66],"be":[2,52,74],"a":[3,12,22,43,85],"finite":[4],"set":[5,26,30],"of":[6,11,98,111],"points":[7,64],"in":[8,57,65],"the":[9,39,55,63,96],"interior":[10],"simple":[13],"polygon":[14],"P.":[15,47],"A":[16],"geodesic":[17,103],"graph,":[18],"$$G_P(S,E)$$":[19],",":[20,84],"is":[21,38,49,71],"graph":[23],"with":[24],"vertex":[25],"and":[28,44,86,108],"edge":[29,35,81],"E":[31,58],"such":[32],"that":[33],"each":[34,80],"$$(a,b)\\in":[36,82],"E$$":[37,83],"shortest":[40],"path":[41],"between":[42],"b":[45,87],"inside":[46],"$$G_P$$":[48,70],"said":[50,72],"to":[51,73],"plane":[53,102],"if":[54],"edges":[56],"do":[59],"not":[60],"cross.":[61],"If":[62],"are":[67],"colored,":[68],"then":[69],"properly":[75],"colored":[76],"provided":[77],"that,":[78],"for":[79],"have":[88],"different":[89],"colors.":[90],"In":[91],"this":[92],"paper":[93],"we":[94],"consider":[95],"problem":[97],"computing":[99],"(properly":[100],"colored)":[101],"perfect":[104],"matchings,":[105],"Hamiltonian":[106],"cycles,":[107],"spanning":[109],"trees":[110],"maximum":[112],"degree":[113],"three.":[114]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}