{"id":"https://openalex.org/W1993725177","doi":"https://doi.org/10.1007/s00607-008-0005-8","title":"A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs","display_name":"A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs","publication_year":2008,"publication_date":"2008-05-26","ids":{"openalex":"https://openalex.org/W1993725177","doi":"https://doi.org/10.1007/s00607-008-0005-8","mag":"1993725177"},"language":"en","primary_location":{"id":"doi:10.1007/s00607-008-0005-8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00607-008-0005-8","pdf_url":null,"source":{"id":"https://openalex.org/S35593046","display_name":"Computing","issn_l":"0010-485X","issn":["0010-485X","1436-5057"],"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":"Computing","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/A5080986291","display_name":"Elisabeth Gassner","orcid":null},"institutions":[{"id":"https://openalex.org/I4092182","display_name":"Graz University of Technology","ror":"https://ror.org/00d7xrm67","country_code":"AT","type":"education","lineage":["https://openalex.org/I4092182"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Elisabeth Gassner","raw_affiliation_strings":["Department of Optimization and Discrete Mathematics, Graz University of Technology, Steyrergasse 30, 8010, Graz, Austria","Graz University of Technology, Department of Optimization and Discrete Mathematics, Steyrergasse 30, 8010, Graz, Austria#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Optimization and Discrete Mathematics, Graz University of Technology, Steyrergasse 30, 8010, Graz, Austria","institution_ids":["https://openalex.org/I4092182"]},{"raw_affiliation_string":"Graz University of Technology, Department of Optimization and Discrete Mathematics, Steyrergasse 30, 8010, Graz, Austria#TAB#","institution_ids":["https://openalex.org/I4092182"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076807251","display_name":"Johannes Hatzl","orcid":null},"institutions":[{"id":"https://openalex.org/I4092182","display_name":"Graz University of Technology","ror":"https://ror.org/00d7xrm67","country_code":"AT","type":"education","lineage":["https://openalex.org/I4092182"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Johannes Hatzl","raw_affiliation_strings":["Department of Optimization and Discrete Mathematics, Graz University of Technology, Steyrergasse 30, 8010, Graz, Austria","Graz University of Technology, Department of Optimization and Discrete Mathematics, Steyrergasse 30, 8010, Graz, Austria#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Optimization and Discrete Mathematics, Graz University of Technology, Steyrergasse 30, 8010, Graz, Austria","institution_ids":["https://openalex.org/I4092182"]},{"raw_affiliation_string":"Graz University of Technology, Department of Optimization and Discrete Mathematics, Steyrergasse 30, 8010, Graz, Austria#TAB#","institution_ids":["https://openalex.org/I4092182"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5080986291"],"corresponding_institution_ids":["https://openalex.org/I4092182"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.8258,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.74410385,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"82","issue":"2-3","first_page":"171","last_page":"187"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9814000129699707,"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/combinatorics","display_name":"Combinatorics","score":0.8028233051300049},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7150675654411316},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.7049464583396912},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.6717731952667236},{"id":"https://openalex.org/keywords/neighbourhood","display_name":"Neighbourhood (mathematics)","score":0.6240570545196533},{"id":"https://openalex.org/keywords/clique-sum","display_name":"Clique-sum","score":0.5609407424926758},{"id":"https://openalex.org/keywords/partial-k-tree","display_name":"Partial k-tree","score":0.5578935146331787},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5024399757385254},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.49363577365875244},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.4880131781101227},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.47928470373153687},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4511130452156067},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.4055880904197693},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2533414959907532},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.0958649218082428}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8028233051300049},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7150675654411316},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.7049464583396912},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.6717731952667236},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.6240570545196533},{"id":"https://openalex.org/C186942658","wikidata":"https://www.wikidata.org/wiki/Q5134410","display_name":"Clique-sum","level":5,"score":0.5609407424926758},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.5578935146331787},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5024399757385254},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49363577365875244},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.4880131781101227},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.47928470373153687},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4511130452156067},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.4055880904197693},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2533414959907532},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0958649218082428},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00607-008-0005-8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00607-008-0005-8","pdf_url":null,"source":{"id":"https://openalex.org/S35593046","display_name":"Computing","issn_l":"0010-485X","issn":["0010-485X","1436-5057"],"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":"Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.699999988079071,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W92251871","https://openalex.org/W179577048","https://openalex.org/W625072069","https://openalex.org/W1495879230","https://openalex.org/W1583096422","https://openalex.org/W1975858062","https://openalex.org/W1981303423","https://openalex.org/W1981356557","https://openalex.org/W1994706865","https://openalex.org/W2013491634","https://openalex.org/W2014318504","https://openalex.org/W2028357390","https://openalex.org/W2029448190","https://openalex.org/W2040405987","https://openalex.org/W2041910029","https://openalex.org/W2064796716","https://openalex.org/W2067665576","https://openalex.org/W2070698547","https://openalex.org/W2102260416","https://openalex.org/W2108808715","https://openalex.org/W2113994674","https://openalex.org/W2157955289","https://openalex.org/W2986773320","https://openalex.org/W6683227944"],"related_works":["https://openalex.org/W2029854525","https://openalex.org/W1578113210","https://openalex.org/W1544821268","https://openalex.org/W2012687409","https://openalex.org/W2113292309","https://openalex.org/W2766499403","https://openalex.org/W4298647581","https://openalex.org/W3094955858","https://openalex.org/W3134208201","https://openalex.org/W2105749797"],"abstract_inverted_index":null,"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}