{"id":"https://openalex.org/W2054926952","doi":"https://doi.org/10.1007/bf01190507","title":"The complexity of induced minors and related problems","display_name":"The complexity of induced minors and related problems","publication_year":1995,"publication_date":"1995-03-01","ids":{"openalex":"https://openalex.org/W2054926952","doi":"https://doi.org/10.1007/bf01190507","mag":"2054926952"},"language":"en","primary_location":{"id":"doi:10.1007/bf01190507","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01190507","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/A5054676766","display_name":"Michael R. Fellows","orcid":"https://orcid.org/0000-0002-6148-9212"},"institutions":[{"id":"https://openalex.org/I212119943","display_name":"University of Victoria","ror":"https://ror.org/04s5mat29","country_code":"CA","type":"education","lineage":["https://openalex.org/I212119943"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"M. R. Fellows","raw_affiliation_strings":["Department of Computer Science, University of Victoria, P.O. Box 3055, V8W 3P6, Victoria, BC","Department of Computer Science, University of Victoria, Victoria,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Victoria, P.O. Box 3055, V8W 3P6, Victoria, BC","institution_ids":["https://openalex.org/I212119943"]},{"raw_affiliation_string":"Department of Computer Science, University of Victoria, Victoria,","institution_ids":["https://openalex.org/I212119943"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066646775","display_name":"Jan Kratochv\u0131\u0301l","orcid":"https://orcid.org/0000-0002-2620-6133"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"J. Kratochvil","raw_affiliation_strings":["Charles University, Prague, Czechoslovakia","Charles University Prague, Czechoslovakia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Charles University, Prague, Czechoslovakia","institution_ids":["https://openalex.org/I21250087"]},{"raw_affiliation_string":"Charles University Prague, Czechoslovakia","institution_ids":["https://openalex.org/I21250087"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5004143017","display_name":"Matthias Middendorf","orcid":null},"institutions":[{"id":"https://openalex.org/I180923762","display_name":"University of Cologne","ror":"https://ror.org/00rcxh774","country_code":"DE","type":"education","lineage":["https://openalex.org/I180923762"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"M. Middendorf","raw_affiliation_strings":["University of Cologne, Cologne, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Cologne, Cologne, Germany","institution_ids":["https://openalex.org/I180923762"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073265538","display_name":"Frank Pfeiffer","orcid":"https://orcid.org/0000-0001-9215-4362"},"institutions":[{"id":"https://openalex.org/I180923762","display_name":"University of Cologne","ror":"https://ror.org/00rcxh774","country_code":"DE","type":"education","lineage":["https://openalex.org/I180923762"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"F. Pfeiffer","raw_affiliation_strings":["University of Cologne, Cologne, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Cologne, Cologne, Germany","institution_ids":["https://openalex.org/I180923762"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":1.0684,"has_fulltext":false,"cited_by_count":86,"citation_normalized_percentile":{"value":0.76599214,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"13","issue":"3","first_page":"266","last_page":"282"},"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.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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9969000220298767,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.8454035520553589},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7233356237411499},{"id":"https://openalex.org/keywords/minor","display_name":"Minor (academic)","score":0.7061031460762024},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6389397978782654},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.6074705719947815},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.5796046853065491},{"id":"https://openalex.org/keywords/clique-sum","display_name":"Clique-sum","score":0.5128181576728821},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5025730133056641},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.49960803985595703},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4802977740764618},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4787689745426178},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.47380226850509644},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.4615708589553833},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.44452568888664246},{"id":"https://openalex.org/keywords/partial-k-tree","display_name":"Partial k-tree","score":0.44060513377189636},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.4405658543109894},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.4115352928638458},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.2916032075881958},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2611704468727112},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2401004135608673},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.20933657884597778},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.06634590029716492}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.8454035520553589},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7233356237411499},{"id":"https://openalex.org/C2779760435","wikidata":"https://www.wikidata.org/wiki/Q5396169","display_name":"Minor (academic)","level":2,"score":0.7061031460762024},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6389397978782654},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.6074705719947815},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.5796046853065491},{"id":"https://openalex.org/C186942658","wikidata":"https://www.wikidata.org/wiki/Q5134410","display_name":"Clique-sum","level":5,"score":0.5128181576728821},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5025730133056641},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.49960803985595703},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4802977740764618},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4787689745426178},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.47380226850509644},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.4615708589553833},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.44452568888664246},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.44060513377189636},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4405658543109894},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.4115352928638458},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2916032075881958},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2611704468727112},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2401004135608673},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.20933657884597778},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.06634590029716492},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/bf01190507","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01190507","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"},{"id":"pmh:oai:e-archive.informatik.uni-koeln.de:101","is_oa":false,"landing_page_url":"http://e-archive.informatik.uni-koeln.de/101/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401304","display_name":"Computer Science Publication Server (University of Cologne)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I180923762","host_organization_name":"University of Cologne","host_organization_lineage":["https://openalex.org/I180923762"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W100926944","https://openalex.org/W1965771814","https://openalex.org/W1968569343","https://openalex.org/W1976285925","https://openalex.org/W1989650529","https://openalex.org/W1997237635","https://openalex.org/W2011039300","https://openalex.org/W2024291212","https://openalex.org/W2028357390","https://openalex.org/W2059563583","https://openalex.org/W2060765530","https://openalex.org/W2066577300","https://openalex.org/W2081580682","https://openalex.org/W2327315803","https://openalex.org/W2569646339","https://openalex.org/W2582833684","https://openalex.org/W2729501290","https://openalex.org/W4210246355","https://openalex.org/W4210377846","https://openalex.org/W4254086873","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W1976784955","https://openalex.org/W2029854525","https://openalex.org/W1582492864","https://openalex.org/W2091382007","https://openalex.org/W2889180046","https://openalex.org/W1585579706","https://openalex.org/W1544821268","https://openalex.org/W2803227791","https://openalex.org/W2567822775","https://openalex.org/W2012687409"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":11}],"updated_date":"2026-06-19T17:40:00.097472","created_date":"2025-10-10T00:00:00"}