{"id":"https://openalex.org/W1498496583","doi":"https://doi.org/10.1007/11534273_10","title":"Parameterized Counting Algorithms for General Graph Covering Problems","display_name":"Parameterized Counting Algorithms for General Graph Covering Problems","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W1498496583","doi":"https://doi.org/10.1007/11534273_10","mag":"1498496583"},"language":"en","primary_location":{"id":"doi:10.1007/11534273_10","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11534273_10","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/A5112513881","display_name":"Naomi Nishimura","orcid":null},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Naomi Nishimura","raw_affiliation_strings":["School of Computer Science, University of Waterloo, Waterloo, Ontario, N2L 3G1, Canada","School of Computer Science; University of Waterloo; Waterloo Ontario Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, University of Waterloo, Waterloo, Ontario, N2L 3G1, Canada","institution_ids":["https://openalex.org/I151746483"]},{"raw_affiliation_string":"School of Computer Science; University of Waterloo; Waterloo Ontario Canada","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020761165","display_name":"Prabhakar Ragde","orcid":"https://orcid.org/0000-0003-1023-9261"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Prabhakar Ragde","raw_affiliation_strings":["School of Computer Science, University of Waterloo, Waterloo, Ontario, N2L 3G1, Canada","School of Computer Science; University of Waterloo; Waterloo Ontario Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, University of Waterloo, Waterloo, Ontario, N2L 3G1, Canada","institution_ids":["https://openalex.org/I151746483"]},{"raw_affiliation_string":"School of Computer Science; University of Waterloo; Waterloo Ontario Canada","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085447779","display_name":"Dimitrios M. Thilikos","orcid":"https://orcid.org/0000-0003-0470-1800"},"institutions":[{"id":"https://openalex.org/I9617848","display_name":"Universitat Polit\u00e8cnica de Catalunya","ror":"https://ror.org/03mb6wj31","country_code":"ES","type":"education","lineage":["https://openalex.org/I9617848"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Dimitrios M. Thilikos","raw_affiliation_strings":["Departament de Llenguatges i Sistemes Inform\u00e0tics, Universitat Polit\u00e8cnica de Catalunya, Campus Nord, Desp. \u03a9-228, c/Jordi Girona Salgado, 1-3., E-08034, Barcelona, Spain","Departament de Llenguatges i Sistemes Inform\u00e1tics, Universitat Polit\u00e8cnica de Catalunya, Barcelona, Spain"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Departament de Llenguatges i Sistemes Inform\u00e0tics, Universitat Polit\u00e8cnica de Catalunya, Campus Nord, Desp. \u03a9-228, c/Jordi Girona Salgado, 1-3., E-08034, Barcelona, Spain","institution_ids":["https://openalex.org/I9617848"]},{"raw_affiliation_string":"Departament de Llenguatges i Sistemes Inform\u00e1tics, Universitat Polit\u00e8cnica de Catalunya, Barcelona, Spain","institution_ids":["https://openalex.org/I9617848"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.8329,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.72345624,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"99","last_page":"109"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9984999895095825,"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.9984999895095825,"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/T12288","display_name":"Optimization and Search Problems","score":0.9979000091552734,"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"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.995199978351593,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/combinatorics","display_name":"Combinatorics","score":0.8541911840438843},{"id":"https://openalex.org/keywords/kernelization","display_name":"Kernelization","score":0.8249049186706543},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.8242467641830444},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6426729559898376},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.6300806999206543},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5478070974349976},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5262512564659119},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4999525547027588},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.48851001262664795},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.4376026391983032},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.43066126108169556},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4092200994491577}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8541911840438843},{"id":"https://openalex.org/C207225210","wikidata":"https://www.wikidata.org/wiki/Q1759539","display_name":"Kernelization","level":3,"score":0.8249049186706543},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8242467641830444},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6426729559898376},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.6300806999206543},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5478070974349976},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5262512564659119},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4999525547027588},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.48851001262664795},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.4376026391983032},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.43066126108169556},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4092200994491577},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/11534273_10","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11534273_10","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1506292197","https://openalex.org/W1539502146","https://openalex.org/W1565660154","https://openalex.org/W1973852671","https://openalex.org/W2106787542","https://openalex.org/W2137874581","https://openalex.org/W2483610301","https://openalex.org/W2505201213","https://openalex.org/W2571635053","https://openalex.org/W2630731240","https://openalex.org/W2913688336"],"related_works":["https://openalex.org/W2381408042","https://openalex.org/W189387296","https://openalex.org/W33845589","https://openalex.org/W3020640542","https://openalex.org/W4388276051","https://openalex.org/W2161286454","https://openalex.org/W2964273883","https://openalex.org/W2886237949","https://openalex.org/W2355184605","https://openalex.org/W2122202324"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}