{"id":"https://openalex.org/W1521970865","doi":"https://doi.org/10.1007/978-3-540-39890-5_27","title":"Feedback Vertex Set and Longest Induced Path on AT-Free Graphs","display_name":"Feedback Vertex Set and Longest Induced Path on AT-Free Graphs","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W1521970865","doi":"https://doi.org/10.1007/978-3-540-39890-5_27","mag":"1521970865"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-39890-5_27","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-39890-5_27","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/A5109894460","display_name":"Dieter Kratsch","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Dieter Kratsch","raw_affiliation_strings":["LITA, Universit\u00e9 de Metz, 57045, Metz Cedex 01, France"],"affiliations":[{"raw_affiliation_string":"LITA, Universit\u00e9 de Metz, 57045, Metz Cedex 01, France","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069794832","display_name":"Haiko M\u00fcller","orcid":"https://orcid.org/0000-0002-1123-1774"},"institutions":[{"id":"https://openalex.org/I130828816","display_name":"University of Leeds","ror":"https://ror.org/024mrxd33","country_code":"GB","type":"education","lineage":["https://openalex.org/I130828816"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Haiko M\u00fcller","raw_affiliation_strings":["School of Computing, University of Leeds, Leeds, LS2 9JT, United Kingdom"],"affiliations":[{"raw_affiliation_string":"School of Computing, University of Leeds, Leeds, LS2 9JT, United Kingdom","institution_ids":["https://openalex.org/I130828816"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081733098","display_name":"Ioan Todinca","orcid":"https://orcid.org/0000-0002-3466-859X"},"institutions":[{"id":"https://openalex.org/I12449238","display_name":"Universit\u00e9 d'Orl\u00e9ans","ror":"https://ror.org/014zrew76","country_code":"FR","type":"education","lineage":["https://openalex.org/I12449238"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Ioan Todinca","raw_affiliation_strings":["LIFO, Universit\u00e9 d\u2019Orl\u00e9ans, BP 6759, 45067, Orl\u00e9ans Cedex 2, France","LIFO, Universit\u00e9 d'Orl\u00e9ans, BP 6759, 45067, Orl\u00e9ans Cedex 2, France"],"affiliations":[{"raw_affiliation_string":"LIFO, Universit\u00e9 d\u2019Orl\u00e9ans, BP 6759, 45067, Orl\u00e9ans Cedex 2, France","institution_ids":["https://openalex.org/I12449238"]},{"raw_affiliation_string":"LIFO, Universit\u00e9 d'Orl\u00e9ans, BP 6759, 45067, Orl\u00e9ans Cedex 2, France","institution_ids":["https://openalex.org/I12449238"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5109894460"],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.3555,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.60491905,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"309","last_page":"321"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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.9991000294685364,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9962999820709229,"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/vertex","display_name":"Vertex (graph theory)","score":0.719241738319397},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.6262792944908142},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5730641484260559},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5233808755874634},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5072886347770691},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5007531642913818},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4658995568752289},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4404880702495575},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4391844868659973},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.4362347722053528},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.42313581705093384},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.40241503715515137},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3516950011253357},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30650413036346436},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2960824966430664},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.294756680727005},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.28082817792892456}],"concepts":[{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.719241738319397},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.6262792944908142},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5730641484260559},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5233808755874634},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5072886347770691},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5007531642913818},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4658995568752289},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4404880702495575},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4391844868659973},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.4362347722053528},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.42313581705093384},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40241503715515137},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3516950011253357},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30650413036346436},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2960824966430664},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.294756680727005},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.28082817792892456},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-540-39890-5_27","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-39890-5_27","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":22,"referenced_works":["https://openalex.org/W639947448","https://openalex.org/W1505308503","https://openalex.org/W1598992176","https://openalex.org/W1970088964","https://openalex.org/W1991300627","https://openalex.org/W2003998639","https://openalex.org/W2011039300","https://openalex.org/W2011576340","https://openalex.org/W2024517697","https://openalex.org/W2053991811","https://openalex.org/W2065908606","https://openalex.org/W2080076699","https://openalex.org/W2083197082","https://openalex.org/W2089749235","https://openalex.org/W2105257834","https://openalex.org/W2118382442","https://openalex.org/W2125540896","https://openalex.org/W2154520530","https://openalex.org/W2913688336","https://openalex.org/W3152126650","https://openalex.org/W4285719527","https://openalex.org/W4292230561"],"related_works":["https://openalex.org/W3003449463","https://openalex.org/W2963989216","https://openalex.org/W2804969619","https://openalex.org/W4301100693","https://openalex.org/W2145212918","https://openalex.org/W2964258819","https://openalex.org/W2574748442","https://openalex.org/W2892180138","https://openalex.org/W2951429970","https://openalex.org/W2742166337"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}