{"id":"https://openalex.org/W2989004153","doi":"https://doi.org/10.1007/978-3-030-34029-2_7","title":"Engineering a PTAS for Minimum Feedback Vertex Set in Planar Graphs","display_name":"Engineering a PTAS for Minimum Feedback Vertex Set in Planar Graphs","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2989004153","doi":"https://doi.org/10.1007/978-3-030-34029-2_7","mag":"2989004153"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-34029-2_7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-34029-2_7","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5108529502","display_name":"Glencora Borradaile","orcid":null},"institutions":[{"id":"https://openalex.org/I131249849","display_name":"Oregon State University","ror":"https://ror.org/00ysfqy60","country_code":"US","type":"education","lineage":["https://openalex.org/I131249849"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Glencora Borradaile","raw_affiliation_strings":["Oregon State University, Corvallis, OR, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Oregon State University, Corvallis, OR, USA","institution_ids":["https://openalex.org/I131249849"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050273950","display_name":"Hung Le","orcid":"https://orcid.org/0000-0001-8223-9944"},"institutions":[{"id":"https://openalex.org/I131249849","display_name":"Oregon State University","ror":"https://ror.org/00ysfqy60","country_code":"US","type":"education","lineage":["https://openalex.org/I131249849"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hung Le","raw_affiliation_strings":["Oregon State University, Corvallis, OR, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Oregon State University, Corvallis, OR, USA","institution_ids":["https://openalex.org/I131249849"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091077640","display_name":"Baigong Zheng","orcid":null},"institutions":[{"id":"https://openalex.org/I131249849","display_name":"Oregon State University","ror":"https://ror.org/00ysfqy60","country_code":"US","type":"education","lineage":["https://openalex.org/I131249849"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Baigong Zheng","raw_affiliation_strings":["Oregon State University, Corvallis, OR, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Oregon State University, Corvallis, OR, USA","institution_ids":["https://openalex.org/I131249849"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I131249849"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.4895,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.68873026,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"98","last_page":"113"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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/T10374","display_name":"Advanced Graph Theory Research","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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9990000128746033,"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/T12288","display_name":"Optimization and Search Problems","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/treewidth","display_name":"Treewidth","score":0.5952795743942261},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.5295618176460266},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.49664241075515747},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.48864346742630005},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.4846104085445404},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.46817249059677124},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.46262383460998535},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.4317131042480469},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4296170175075531},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4153686761856079},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33529263734817505},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3178187906742096},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30552470684051514},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3035430610179901},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.06787905097007751}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.5952795743942261},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.5295618176460266},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.49664241075515747},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.48864346742630005},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.4846104085445404},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46817249059677124},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.46262383460998535},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.4317131042480469},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4296170175075531},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4153686761856079},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33529263734817505},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3178187906742096},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30552470684051514},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3035430610179901},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.06787905097007751}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-030-34029-2_7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-34029-2_7","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W352901865","https://openalex.org/W1485262373","https://openalex.org/W1489273657","https://openalex.org/W1524920060","https://openalex.org/W1546924356","https://openalex.org/W1548756387","https://openalex.org/W1829289780","https://openalex.org/W1855543298","https://openalex.org/W1966100573","https://openalex.org/W1982180670","https://openalex.org/W2013522700","https://openalex.org/W2015905456","https://openalex.org/W2034377062","https://openalex.org/W2038643780","https://openalex.org/W2039826584","https://openalex.org/W2042509875","https://openalex.org/W2042977557","https://openalex.org/W2045749371","https://openalex.org/W2062254875","https://openalex.org/W2081880478","https://openalex.org/W2121655825","https://openalex.org/W2130481157","https://openalex.org/W2132169470","https://openalex.org/W2145062394","https://openalex.org/W2152486395","https://openalex.org/W2156760067","https://openalex.org/W2165454009","https://openalex.org/W2170069407","https://openalex.org/W2401610261","https://openalex.org/W2417586110","https://openalex.org/W2496261944","https://openalex.org/W2521012255","https://openalex.org/W2563156040","https://openalex.org/W2570081448","https://openalex.org/W2570206580","https://openalex.org/W2750610069","https://openalex.org/W2796888425","https://openalex.org/W2950450493","https://openalex.org/W2963253390","https://openalex.org/W2963780386","https://openalex.org/W4240982445"],"related_works":["https://openalex.org/W2012687409","https://openalex.org/W2029854525","https://openalex.org/W143512583","https://openalex.org/W1976463682","https://openalex.org/W1585579706","https://openalex.org/W1520984708","https://openalex.org/W4298440031","https://openalex.org/W2949147445","https://openalex.org/W2567822775","https://openalex.org/W2133160845"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}