{"id":"https://openalex.org/W2077970810","doi":"https://doi.org/10.1145/1721837.1721840","title":"Finding shortest contractible and shortest separating cycles in embedded graphs","display_name":"Finding shortest contractible and shortest separating cycles in embedded graphs","publication_year":2010,"publication_date":"2010-03-01","ids":{"openalex":"https://openalex.org/W2077970810","doi":"https://doi.org/10.1145/1721837.1721840","mag":"2077970810"},"language":"en","primary_location":{"id":"doi:10.1145/1721837.1721840","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1721837.1721840","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","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/A5034923438","display_name":"Sergio Cabello","orcid":"https://orcid.org/0000-0002-3183-4126"},"institutions":[{"id":"https://openalex.org/I153976015","display_name":"University of Ljubljana","ror":"https://ror.org/05njb9z20","country_code":"SI","type":"education","lineage":["https://openalex.org/I153976015"]}],"countries":["SI"],"is_corresponding":true,"raw_author_name":"Sergio Cabello","raw_affiliation_strings":["University of Ljubljana and IMFM, Ljubljana, Slovenia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Ljubljana and IMFM, Ljubljana, Slovenia","institution_ids":["https://openalex.org/I153976015"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5034923438"],"corresponding_institution_ids":["https://openalex.org/I153976015"],"apc_list":null,"apc_paid":null,"fwci":3.0445,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.91298081,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"6","issue":"2","first_page":"1","last_page":"18"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"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.9997000098228455,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/combinatorics","display_name":"Combinatorics","score":0.7397774457931519},{"id":"https://openalex.org/keywords/contractible-space","display_name":"Contractible space","score":0.7363592982292175},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7274085283279419},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5119332075119019},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4406780004501343},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4396648705005646}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7397774457931519},{"id":"https://openalex.org/C169611556","wikidata":"https://www.wikidata.org/wiki/Q230689","display_name":"Contractible space","level":2,"score":0.7363592982292175},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7274085283279419},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5119332075119019},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4406780004501343},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4396648705005646}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1721837.1721840","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1721837.1721840","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W272982077","https://openalex.org/W411619626","https://openalex.org/W594463866","https://openalex.org/W1522210445","https://openalex.org/W1527709704","https://openalex.org/W1591127925","https://openalex.org/W1931404780","https://openalex.org/W1973952022","https://openalex.org/W1974358136","https://openalex.org/W2006152944","https://openalex.org/W2011039300","https://openalex.org/W2017996596","https://openalex.org/W2025861110","https://openalex.org/W2026368027","https://openalex.org/W2026605623","https://openalex.org/W2030509174","https://openalex.org/W2041603746","https://openalex.org/W2050289388","https://openalex.org/W2083049364","https://openalex.org/W2093766264","https://openalex.org/W2147508044","https://openalex.org/W2199785256","https://openalex.org/W2325434603","https://openalex.org/W2561675875","https://openalex.org/W2569270235","https://openalex.org/W2762935521","https://openalex.org/W3022694456","https://openalex.org/W3040586665","https://openalex.org/W4389615663","https://openalex.org/W4389615664"],"related_works":["https://openalex.org/W2211338636","https://openalex.org/W2026367875","https://openalex.org/W2134180805","https://openalex.org/W1994605870","https://openalex.org/W1548439725","https://openalex.org/W2963401074","https://openalex.org/W3201591009","https://openalex.org/W1514668917","https://openalex.org/W4302301829","https://openalex.org/W4286973566"],"abstract_inverted_index":{"We":[0,48],"give":[1],"a":[2,7,12,19,23,27,38,43,53,65],"polynomial-time":[3],"algorithm":[4],"to":[5],"find":[6],"shortest":[8,39,54],"contractible":[9,40],"cycle":[10,41,56],"(i.e.,":[11],"closed":[13],"walk":[14],"without":[15],"repeated":[16],"vertices)":[17],"in":[18,22,57],"graph":[20,60],"embedded":[21,59],"surface.":[24],"This":[25,63],"answers":[26,64],"question":[28,66],"posed":[29,67],"by":[30,68],"Hutchinson.":[31],"In":[32],"contrast,":[33],"we":[34],"show":[35,50],"that":[36,51],"finding":[37,52],"through":[42],"given":[44],"vertex":[45],"is":[46,61],"NP-hard.":[47,62],"also":[49],"separating":[55],"an":[58],"Mohar":[69],"and":[70],"Thomassen.":[71]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}