{"id":"https://openalex.org/W1964064059","doi":"https://doi.org/10.1007/s00453-008-9233-8","title":"Chordal Deletion is Fixed-Parameter Tractable","display_name":"Chordal Deletion is Fixed-Parameter Tractable","publication_year":2008,"publication_date":"2008-10-29","ids":{"openalex":"https://openalex.org/W1964064059","doi":"https://doi.org/10.1007/s00453-008-9233-8","mag":"1964064059"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-008-9233-8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-008-9233-8","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","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/A5012849997","display_name":"D\u00e1niel Marx","orcid":"https://orcid.org/0000-0002-5686-8314"},"institutions":[{"id":"https://openalex.org/I29770179","display_name":"Budapest University of Technology and Economics","ror":"https://ror.org/02w42ss30","country_code":"HU","type":"education","lineage":["https://openalex.org/I29770179"]}],"countries":["HU"],"is_corresponding":true,"raw_author_name":"D\u00e1niel Marx","raw_affiliation_strings":["Department of Computer Science and Information Theory, Budapest University of Technology and Economics, Budapest, Hungary","Budapest University of Technology and Economics Department of Computer Science and Information Theory 1521 Budapest Hungary"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Theory, Budapest University of Technology and Economics, Budapest, Hungary","institution_ids":["https://openalex.org/I29770179"]},{"raw_affiliation_string":"Budapest University of Technology and Economics Department of Computer Science and Information Theory 1521 Budapest Hungary","institution_ids":["https://openalex.org/I29770179"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5012849997"],"corresponding_institution_ids":["https://openalex.org/I29770179"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":5.1307,"has_fulltext":false,"cited_by_count":95,"citation_normalized_percentile":{"value":0.94984067,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"57","issue":"4","first_page":"747","last_page":"768"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994000196456909,"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.9994000196456909,"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/T13664","display_name":"Genome Rearrangement Algorithms","score":0.9840999841690063,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9817000031471252,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.8696672916412354},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.8458226919174194},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7839888334274292},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7600119709968567},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6791622638702393},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6182135939598083},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.5526776313781738},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5006239414215088},{"id":"https://openalex.org/keywords/interval-graph","display_name":"Interval graph","score":0.49848341941833496},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.49533024430274963},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47202008962631226},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4458353519439697},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.3019997477531433},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.18744900822639465},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.14878761768341064},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.09655427932739258},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.06975388526916504}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8696672916412354},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.8458226919174194},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7839888334274292},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7600119709968567},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6791622638702393},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6182135939598083},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.5526776313781738},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5006239414215088},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.49848341941833496},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.49533024430274963},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47202008962631226},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4458353519439697},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.3019997477531433},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.18744900822639465},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.14878761768341064},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.09655427932739258},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.06975388526916504},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00453-008-9233-8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-008-9233-8","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W36639738","https://openalex.org/W1586744224","https://openalex.org/W1971393213","https://openalex.org/W2004181701","https://openalex.org/W2005079828","https://openalex.org/W2008238596","https://openalex.org/W2012067448","https://openalex.org/W2016088388","https://openalex.org/W2027566319","https://openalex.org/W2036159029","https://openalex.org/W2040404604","https://openalex.org/W2051856222","https://openalex.org/W2083578892","https://openalex.org/W2086119402","https://openalex.org/W2106097003","https://openalex.org/W2130673833","https://openalex.org/W2132750992","https://openalex.org/W2143474538","https://openalex.org/W2144050783","https://openalex.org/W2157295389","https://openalex.org/W2163101585","https://openalex.org/W2165662279","https://openalex.org/W2287816539","https://openalex.org/W2401216365","https://openalex.org/W2571453178","https://openalex.org/W2798579874","https://openalex.org/W2913688336","https://openalex.org/W2986773320","https://openalex.org/W4213236916","https://openalex.org/W4213368513","https://openalex.org/W4292230561","https://openalex.org/W4299866835"],"related_works":["https://openalex.org/W1987143101","https://openalex.org/W2963009577","https://openalex.org/W2788975631","https://openalex.org/W2903402681","https://openalex.org/W4387704327","https://openalex.org/W2251679127","https://openalex.org/W1480846237","https://openalex.org/W1544821268","https://openalex.org/W2407722793","https://openalex.org/W1548014395"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":10},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":10},{"year":2012,"cited_by_count":11}],"updated_date":"2026-08-11T07:18:39.950985","created_date":"2025-10-10T00:00:00"}