{"id":"https://openalex.org/W2910676681","doi":"https://doi.org/10.1007/978-3-030-10801-4_37","title":"Algorithms and Complexity Results for the Capacitated Vertex Cover Problem","display_name":"Algorithms and Complexity Results for the Capacitated Vertex Cover Problem","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2910676681","doi":"https://doi.org/10.1007/978-3-030-10801-4_37","mag":"2910676681"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-10801-4_37","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-10801-4_37","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/A5015620244","display_name":"Sebastiaan B. van Rooij","orcid":null},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Sebastiaan B. van Rooij","raw_affiliation_strings":["Department of Information and Computing Sciences, Utrecht University, PO Box 80.089, 3508 TB, Utrecht, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Information and Computing Sciences, Utrecht University, PO Box 80.089, 3508 TB, Utrecht, The Netherlands","institution_ids":["https://openalex.org/I193662353"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055143803","display_name":"Johan M. M. van Rooij","orcid":"https://orcid.org/0000-0001-9149-4162"},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Johan M. M. van Rooij","raw_affiliation_strings":["Department of Information and Computing Sciences, Utrecht University, PO Box 80.089, 3508 TB, Utrecht, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Information and Computing Sciences, Utrecht University, PO Box 80.089, 3508 TB, Utrecht, The Netherlands","institution_ids":["https://openalex.org/I193662353"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5015620244"],"corresponding_institution_ids":["https://openalex.org/I193662353"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.9809,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.72973559,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"473","last_page":"489"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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.9998000264167786,"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.9998000264167786,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9991999864578247,"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/combinatorics","display_name":"Combinatorics","score":0.7824432253837585},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.7278581261634827},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.6622955799102783},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6330655813217163},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.5814841389656067},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.5390289425849915},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5099092721939087},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.4805608093738556},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.4774214029312134},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.47048261761665344},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.4604770243167877},{"id":"https://openalex.org/keywords/tree-depth","display_name":"Tree-depth","score":0.41369760036468506},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.41150784492492676},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.3222307860851288},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2954576015472412},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.15832018852233887}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7824432253837585},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.7278581261634827},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.6622955799102783},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6330655813217163},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5814841389656067},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.5390289425849915},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5099092721939087},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.4805608093738556},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.4774214029312134},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.47048261761665344},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.4604770243167877},{"id":"https://openalex.org/C69284658","wikidata":"https://www.wikidata.org/wiki/Q7837500","display_name":"Tree-depth","level":5,"score":0.41369760036468506},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.41150784492492676},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3222307860851288},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2954576015472412},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.15832018852233887},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-030-10801-4_37","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-10801-4_37","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:uu:oai:dspace.library.uu.nl:1874/387753","is_oa":false,"landing_page_url":"https://dspace.library.uu.nl/handle/1874/387753","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SOFSEM 2019: Theory and Practice of Computer Science, 11376, 473. SPRING","raw_type":"info:eu-repo/semantics/bookpart"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W1439548790","https://openalex.org/W1500603002","https://openalex.org/W1518653692","https://openalex.org/W1690875420","https://openalex.org/W1971756951","https://openalex.org/W1985572324","https://openalex.org/W1993301031","https://openalex.org/W1995725694","https://openalex.org/W1999216089","https://openalex.org/W2005059149","https://openalex.org/W2015963099","https://openalex.org/W2020112047","https://openalex.org/W2035633339","https://openalex.org/W2044104853","https://openalex.org/W2046192139","https://openalex.org/W2059273723","https://openalex.org/W2059451253","https://openalex.org/W2069751859","https://openalex.org/W2070684734","https://openalex.org/W2073025989","https://openalex.org/W2074417667","https://openalex.org/W2075727870","https://openalex.org/W2076595213","https://openalex.org/W2089074354","https://openalex.org/W2089718638","https://openalex.org/W2096495231","https://openalex.org/W2097844290","https://openalex.org/W2136595209","https://openalex.org/W2153667368","https://openalex.org/W2156896570","https://openalex.org/W2157486268","https://openalex.org/W2163751818","https://openalex.org/W2170702810","https://openalex.org/W4213368513"],"related_works":["https://openalex.org/W1554245510","https://openalex.org/W2497554862","https://openalex.org/W2012687409","https://openalex.org/W2029854525","https://openalex.org/W2797680869","https://openalex.org/W2952421273","https://openalex.org/W2158584754","https://openalex.org/W4244449240","https://openalex.org/W69484320","https://openalex.org/W1502166895"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"cited_by_count":2}],"updated_date":"2026-04-04T08:04:53.788161","created_date":"2025-10-10T00:00:00"}