{"id":"https://openalex.org/W2151950239","doi":"https://doi.org/10.1007/978-3-642-11269-0_9","title":"Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover","display_name":"Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W2151950239","doi":"https://doi.org/10.1007/978-3-642-11269-0_9","mag":"2151950239"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-11269-0_9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-11269-0_9","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/A5056718928","display_name":"Peter Damaschke","orcid":"https://orcid.org/0000-0003-4047-7594"},"institutions":[{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Peter Damaschke","raw_affiliation_strings":["Department of Computer Science and Engineering, Chalmers University, 41296, G\u00f6teborg, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Chalmers University, 41296, G\u00f6teborg, Sweden","institution_ids":["https://openalex.org/I66862912"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5056718928"],"corresponding_institution_ids":["https://openalex.org/I66862912"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.9775,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.78919142,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"110","last_page":"121"},"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.9987000226974487,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9937999844551086,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.8927423357963562},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.6768457889556885},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.6684500575065613},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5988976359367371},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5901627540588379},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.5657933950424194},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.5430083274841309},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.49174025654792786},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4673381745815277},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.463922381401062},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4401877224445343},{"id":"https://openalex.org/keywords/pareto-optimal","display_name":"Pareto optimal","score":0.4397445321083069},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3791866600513458},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.367311954498291},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34108680486679077},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2796463370323181},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.1999952793121338}],"concepts":[{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.8927423357963562},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.6768457889556885},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.6684500575065613},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5988976359367371},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5901627540588379},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.5657933950424194},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.5430083274841309},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.49174025654792786},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4673381745815277},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.463922381401062},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4401877224445343},{"id":"https://openalex.org/C2986314615","wikidata":"https://www.wikidata.org/wiki/Q36829","display_name":"Pareto optimal","level":3,"score":0.4397445321083069},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3791866600513458},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.367311954498291},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34108680486679077},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2796463370323181},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.1999952793121338},{"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/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","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},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/978-3-642-11269-0_9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-11269-0_9","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:CiteSeerX.psu:10.1.1.156.9340","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.156.9340","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.chalmers.se/~ptr/paretof.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.545.3241","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.545.3241","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://faculty.cs.tamu.edu/chen/iwpec2009/images/11.pdf","raw_type":"text"},{"id":"pmh:oai:publications.lib.chalmers.se:106565","is_oa":false,"landing_page_url":"http://publications.lib.chalmers.se/publication/106565-pareto-complexity-of-two-parameter-fpt-problems-a-case-study-for-partial-vertex-cover","pdf_url":null,"source":{"id":"https://openalex.org/S4377196470","display_name":"Chalmers Publication Library (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text.Article.Conference.PeerReviewed"},{"id":"pmh:oai:research.chalmers.se:106565","is_oa":false,"landing_page_url":"https://research.chalmers.se/en/publication/106565","pdf_url":null,"source":{"id":"https://openalex.org/S4306402469","display_name":"Chalmers Research (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1517036688","https://openalex.org/W1525118263","https://openalex.org/W1566660502","https://openalex.org/W1574082713","https://openalex.org/W1972577597","https://openalex.org/W2045561016","https://openalex.org/W2106412619","https://openalex.org/W2129858303","https://openalex.org/W2133729430","https://openalex.org/W2147466109","https://openalex.org/W2477307258","https://openalex.org/W2561675875","https://openalex.org/W2781499036","https://openalex.org/W2913688336","https://openalex.org/W4292230561"],"related_works":["https://openalex.org/W2949255922","https://openalex.org/W2036594069","https://openalex.org/W4244658307","https://openalex.org/W2156896570","https://openalex.org/W2038655901","https://openalex.org/W1627181101","https://openalex.org/W2043560626","https://openalex.org/W1558145674","https://openalex.org/W1566660502","https://openalex.org/W2907689753"],"abstract_inverted_index":null,"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}