{"id":"https://openalex.org/W2342665464","doi":"https://doi.org/10.1007/s00453-016-0150-y","title":"Finding Dominating Induced Matchings in $$P_8$$ P 8 -Free Graphs in Polynomial Time","display_name":"Finding Dominating Induced Matchings in $$P_8$$ P 8 -Free Graphs in Polynomial Time","publication_year":2016,"publication_date":"2016-04-25","ids":{"openalex":"https://openalex.org/W2342665464","doi":"https://doi.org/10.1007/s00453-016-0150-y","mag":"2342665464"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-016-0150-y","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-016-0150-y","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","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/A5085372854","display_name":"Andreas Brandst\u00e4dt","orcid":null},"institutions":[{"id":"https://openalex.org/I4665924","display_name":"University of Rostock","ror":"https://ror.org/03zdwsf69","country_code":"DE","type":"education","lineage":["https://openalex.org/I4665924"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Andreas Brandst\u00e4dt","raw_affiliation_strings":["Institut f\u00fcr Informatik, Universit\u00e4t Rostock, A.-Einstein-Str. 22, 18051, Rostock, Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t Rostock, A.-Einstein-Str. 22, 18051, Rostock, Germany","institution_ids":["https://openalex.org/I4665924"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5040644152","display_name":"Raffaele Mosca","orcid":null},"institutions":[{"id":"https://openalex.org/I39387349","display_name":"University of Chieti-Pescara","ror":"https://ror.org/00qjgza05","country_code":"IT","type":"education","lineage":["https://openalex.org/I39387349"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Raffaele Mosca","raw_affiliation_strings":["Dipartimento di Economia, Universit\u00e1 degli Studi \u201cG. D\u2019Annunzio\u201d, 65121, Pescara, Italy","Dipartimento di Economia, Universit\u00e1 degli Studi \"G. D'Annunzio\", 65121, Pescara, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Economia, Universit\u00e1 degli Studi \u201cG. D\u2019Annunzio\u201d, 65121, Pescara, Italy","institution_ids":["https://openalex.org/I39387349"]},{"raw_affiliation_string":"Dipartimento di Economia, Universit\u00e1 degli Studi \"G. D'Annunzio\", 65121, Pescara, Italy","institution_ids":["https://openalex.org/I39387349"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5085372854"],"corresponding_institution_ids":["https://openalex.org/I4665924"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":2.517,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.89925184,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"77","issue":"4","first_page":"1283","last_page":"1302"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"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.9994999766349792,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9911999702453613,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9878000020980835,"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/combinatorics","display_name":"Combinatorics","score":0.8738757371902466},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7693966031074524},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7289279103279114},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5811575651168823},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.5521343350410461},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.4856456518173218},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.4806039035320282},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4804653525352478},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.46585923433303833},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.4579871892929077},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.4303142726421356},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.43008726835250854},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.37221503257751465},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.3080877959728241},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.08007436990737915},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.07281991839408875}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8738757371902466},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7693966031074524},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7289279103279114},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5811575651168823},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.5521343350410461},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.4856456518173218},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.4806039035320282},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4804653525352478},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.46585923433303833},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.4579871892929077},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.4303142726421356},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.43008726835250854},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.37221503257751465},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.3080877959728241},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.08007436990737915},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.07281991839408875},{"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/s00453-016-0150-y","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-016-0150-y","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1546403474","https://openalex.org/W1577910185","https://openalex.org/W1977889556","https://openalex.org/W1978626345","https://openalex.org/W1996995804","https://openalex.org/W2010608390","https://openalex.org/W2047747666","https://openalex.org/W2065769612","https://openalex.org/W2092503911","https://openalex.org/W2093628106","https://openalex.org/W2444140751","https://openalex.org/W2950544972"],"related_works":["https://openalex.org/W300018836","https://openalex.org/W2935770235","https://openalex.org/W2906881967","https://openalex.org/W2991587872","https://openalex.org/W3118753906","https://openalex.org/W2954109725","https://openalex.org/W2952723382","https://openalex.org/W2391238671","https://openalex.org/W4301177232","https://openalex.org/W3037291746"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}