{"id":"https://openalex.org/W1759963290","doi":"https://doi.org/10.1007/978-3-540-73001-9_28","title":"The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number","display_name":"The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number","publication_year":2007,"publication_date":"2007-01-01","ids":{"openalex":"https://openalex.org/W1759963290","doi":"https://doi.org/10.1007/978-3-540-73001-9_28","mag":"1759963290"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-73001-9_28","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-73001-9_28","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":"conference-paper","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/I190082696","display_name":"Durham University","ror":"https://ror.org/01v29qb04","country_code":"GB","type":"education","lineage":["https://openalex.org/I190082696"]},{"id":"https://openalex.org/I78757542","display_name":"University of Newcastle Australia","ror":"https://ror.org/00eae9z71","country_code":"AU","type":"education","lineage":["https://openalex.org/I78757542"]}],"countries":["AU","GB"],"is_corresponding":false,"raw_author_name":"Michael Fellows","raw_affiliation_strings":["Durham University, Institute of Advanced Study, Durham DH1 3RL, United Kingdom","University of Newcastle, Callaghan NSW 2308, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Durham University, Institute of Advanced Study, Durham DH1 3RL, United Kingdom","institution_ids":["https://openalex.org/I190082696"]},{"raw_affiliation_string":"University of Newcastle, Callaghan NSW 2308, Australia","institution_ids":["https://openalex.org/I78757542"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047322831","display_name":"Frances Rosamond","orcid":"https://orcid.org/0000-0002-5097-9929"},"institutions":[{"id":"https://openalex.org/I78757542","display_name":"University of Newcastle Australia","ror":"https://ror.org/00eae9z71","country_code":"AU","type":"education","lineage":["https://openalex.org/I78757542"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Frances Rosamond","raw_affiliation_strings":["University of Newcastle, Callaghan NSW 2308, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Newcastle, Callaghan NSW 2308, Australia","institution_ids":["https://openalex.org/I78757542"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"268","last_page":"277"},"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.9962000250816345,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9937000274658203,"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.8859306573867798},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.8703081011772156},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6668280363082886},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.48825716972351074},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.47526806592941284},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.45986247062683105},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.45539915561676025},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44098642468452454},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4336685240268707},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.43279507756233215},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4247358441352844},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.27142971754074097},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2651456594467163},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.09543514251708984}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8859306573867798},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.8703081011772156},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6668280363082886},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.48825716972351074},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.47526806592941284},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.45986247062683105},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45539915561676025},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44098642468452454},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4336685240268707},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43279507756233215},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4247358441352844},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.27142971754074097},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2651456594467163},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.09543514251708984},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":8,"locations":[{"id":"doi:10.1007/978-3-540-73001-9_28","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-73001-9_28","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"},{"id":"pmh:oai:espace.cdu.edu.au:cdu:10066","is_oa":false,"landing_page_url":"http://espace.cdu.edu.au/view/cdu:10066","pdf_url":null,"source":{"id":"https://openalex.org/S4306401536","display_name":"CDU eSpace Institutional Repository (Charles Darwin University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I29894533","host_organization_name":"Charles Darwin University","host_organization_lineage":["https://openalex.org/I29894533"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"},{"id":"pmh:oai:espace.cdu.edu.au:cdu:9661","is_oa":false,"landing_page_url":"http://espace.cdu.edu.au/view/cdu:9661","pdf_url":null,"source":{"id":"https://openalex.org/S4306401536","display_name":"CDU eSpace Institutional Repository (Charles Darwin University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I29894533","host_organization_name":"Charles Darwin University","host_organization_lineage":["https://openalex.org/I29894533"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference Paper"},{"id":"pmh:650735","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=650735","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:1432-4350 1433-0490","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.144.1502","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.144.1502","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ii.uib.no/~daniello/papers/ecology1.pdf","raw_type":"text"},{"id":"pmh:oai:cris.maastrichtuniversity.nl:openaire_cris_publications/2350edf7-feca-49ae-a7f9-36a9290d2675","is_oa":false,"landing_page_url":"https://cris.maastrichtuniversity.nl/en/publications/2350edf7-feca-49ae-a7f9-36a9290d2675","pdf_url":null,"source":{"id":"https://openalex.org/S4306402616","display_name":"Research Publications (Maastricht University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I34352273","host_organization_name":"Maastricht University","host_organization_lineage":["https://openalex.org/I34352273"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Fellows , M R , Lokshtanov , D , Misra , N , Mnich , M , Rosamond , F & Saurabh , S 2009 , ' The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number ' , Theory of Computing Systems , vol. 45 , no. 4 , pp. 822-848 . https://doi.org/10.1007/s00224-009-9167-9","raw_type":"article"},{"id":"pmh:oai:library.tue.nl:650735","is_oa":false,"landing_page_url":"http://repository.tue.nl/650735","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:1432-4350 1433-0490","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:tore.tuhh.de:11420/4557","is_oa":false,"landing_page_url":"http://hdl.handle.net/11420/4557","pdf_url":null,"source":{"id":"https://openalex.org/S4306401751","display_name":"tub.dok (Hamburg University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I884043246","host_organization_name":"Hamburg University of Technology","host_organization_lineage":["https://openalex.org/I884043246"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Life in Land","score":0.4300000071525574,"id":"https://metadata.un.org/sdg/15"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W36639738","https://openalex.org/W75155422","https://openalex.org/W272087405","https://openalex.org/W561119072","https://openalex.org/W1501904253","https://openalex.org/W1517036688","https://openalex.org/W1553002612","https://openalex.org/W1555478065","https://openalex.org/W1558630420","https://openalex.org/W1559081432","https://openalex.org/W1570425181","https://openalex.org/W1580414818","https://openalex.org/W1585860847","https://openalex.org/W1804016314","https://openalex.org/W1819973606","https://openalex.org/W1983798870","https://openalex.org/W2013415302","https://openalex.org/W2021180976","https://openalex.org/W2028357390","https://openalex.org/W2042509875","https://openalex.org/W2059372025","https://openalex.org/W2064796716","https://openalex.org/W2093762675","https://openalex.org/W2096495231","https://openalex.org/W2127485201","https://openalex.org/W2158584754","https://openalex.org/W2171984098","https://openalex.org/W2476613922","https://openalex.org/W2490706771","https://openalex.org/W2591986491","https://openalex.org/W2608065487","https://openalex.org/W2715404671","https://openalex.org/W2913688336","https://openalex.org/W2991385428","https://openalex.org/W3001416644","https://openalex.org/W4292230561","https://openalex.org/W4389615663"],"related_works":["https://openalex.org/W2780415142","https://openalex.org/W1875643871","https://openalex.org/W2050719228","https://openalex.org/W4375870117","https://openalex.org/W3105392741","https://openalex.org/W4292557868","https://openalex.org/W2952680644","https://openalex.org/W2100346402","https://openalex.org/W1599634910","https://openalex.org/W2261299644"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}