{"id":"https://openalex.org/W2173232259","doi":"https://doi.org/10.1007/978-3-642-33090-2_54","title":"Parameterized Complexity of Induced H-Matching on Claw-Free Graphs","display_name":"Parameterized Complexity of Induced H-Matching on Claw-Free Graphs","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W2173232259","doi":"https://doi.org/10.1007/978-3-642-33090-2_54","mag":"2173232259"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-33090-2_54","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-33090-2_54","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/A5052950579","display_name":"Danny Hermelin","orcid":"https://orcid.org/0000-0002-6379-0383"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Danny Hermelin","raw_affiliation_strings":["Max Planck Institute for Informatics, Saarbr\u00fccken, Germany"],"affiliations":[{"raw_affiliation_string":"Max Planck Institute for Informatics, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053266341","display_name":"Matthias Mnich","orcid":"https://orcid.org/0000-0002-4721-5354"},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Matthias Mnich","raw_affiliation_strings":["Cluster of Excellence \u201cMultimodal Computing and Interaction\u201d, Saarland University, Saarbr\u00fccken, Germany","Cluster of Excellence \"Multimodal Computing and Interaction\", Saarland University, Saarbr\u00fccken, Germany"],"affiliations":[{"raw_affiliation_string":"Cluster of Excellence \u201cMultimodal Computing and Interaction\u201d, Saarland University, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I91712215"]},{"raw_affiliation_string":"Cluster of Excellence \"Multimodal Computing and Interaction\", Saarland University, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I91712215"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041371022","display_name":"Erik Jan van Leeuwen","orcid":"https://orcid.org/0000-0001-5240-7257"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Erik Jan van Leeuwen","raw_affiliation_strings":["Dept.\u00a0Computer, Control, Managm. Eng., Sapienza University of Rome, Italy"],"affiliations":[{"raw_affiliation_string":"Dept.\u00a0Computer, Control, Managm. Eng., Sapienza University of Rome, Italy","institution_ids":["https://openalex.org/I861853513"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5052950579"],"corresponding_institution_ids":["https://openalex.org/I4210109712"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.1538,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.77457203,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"624","last_page":"635"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9993000030517578,"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.9993000030517578,"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.9914000034332275,"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.9779999852180481,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.7657102346420288},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7653007507324219},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.6105992794036865},{"id":"https://openalex.org/keywords/cograph","display_name":"Cograph","score":0.5744584202766418},{"id":"https://openalex.org/keywords/split-graph","display_name":"Split graph","score":0.5696478486061096},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5528549551963806},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.516960084438324},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5009562969207764},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.49187564849853516},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4751565158367157},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.44179999828338623},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.43260663747787476},{"id":"https://openalex.org/keywords/clique-problem","display_name":"Clique problem","score":0.4219669699668884},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.4157373905181885},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3722827434539795},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.22056207060813904},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.19041815400123596},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.08092454075813293}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7657102346420288},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7653007507324219},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.6105992794036865},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.5744584202766418},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.5696478486061096},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5528549551963806},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.516960084438324},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5009562969207764},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.49187564849853516},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4751565158367157},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.44179999828338623},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43260663747787476},{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.4219669699668884},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.4157373905181885},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3722827434539795},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.22056207060813904},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.19041815400123596},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.08092454075813293},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/978-3-642-33090-2_54","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-33090-2_54","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.419.4195","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.419.4195","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mpi-inf.mpg.de/~hermelin/Conference Publications/ClawFreeHMatching.pdf","raw_type":"text"},{"id":"pmh:oai:pure.mpg.de:item_1858489","is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-0014-BD54-2","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms - ESA 2012","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:tore.tuhh.de:11420/4584","is_oa":false,"landing_page_url":"http://hdl.handle.net/11420/4584","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":"Conference Paper"},{"id":"pmh:um:oai:cris.maastrichtuniversity.nl:publications/30c32ee1-f3aa-4ff9-b6bc-8e67dbe73a40","is_oa":false,"landing_page_url":"https://cris.maastrichtuniversity.nl/en/publications/30c32ee1-f3aa-4ff9-b6bc-8e67dbe73a40","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":"Algorithms - ESA 2012: 20th Annual European Symposium Ljubljana, Slovenia, September 2012 Proceedings, 624 - 635","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W184144034","https://openalex.org/W285041758","https://openalex.org/W1510609119","https://openalex.org/W1519122062","https://openalex.org/W1558167226","https://openalex.org/W1812837484","https://openalex.org/W1821538950","https://openalex.org/W1925626563","https://openalex.org/W1999341643","https://openalex.org/W2003981436","https://openalex.org/W2005475011","https://openalex.org/W2011039300","https://openalex.org/W2032987509","https://openalex.org/W2038358424","https://openalex.org/W2051064851","https://openalex.org/W2051627428","https://openalex.org/W2061237693","https://openalex.org/W2092366448","https://openalex.org/W2099990859","https://openalex.org/W2152550583","https://openalex.org/W2162282183","https://openalex.org/W2165295755","https://openalex.org/W2296148711","https://openalex.org/W2913688336","https://openalex.org/W3098486139","https://openalex.org/W3147303226","https://openalex.org/W4233401035","https://openalex.org/W4234503811","https://openalex.org/W4253689634","https://openalex.org/W4285719527","https://openalex.org/W4292230561"],"related_works":["https://openalex.org/W2029818886","https://openalex.org/W2088153883","https://openalex.org/W3037934538","https://openalex.org/W1985573889","https://openalex.org/W2595228924","https://openalex.org/W1975220870","https://openalex.org/W2929047994","https://openalex.org/W1969119072","https://openalex.org/W4206838519","https://openalex.org/W2521882261"],"abstract_inverted_index":null,"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}