{"id":"https://openalex.org/W1508943152","doi":"https://doi.org/10.1007/978-3-642-15155-2_53","title":"Parity Games with Partial Information Played on Graphs of Bounded Complexity","display_name":"Parity Games with Partial Information Played on Graphs of Bounded Complexity","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W1508943152","doi":"https://doi.org/10.1007/978-3-642-15155-2_53","mag":"1508943152"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-15155-2_53","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-15155-2_53","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/A5002148975","display_name":"Bernd Puchala","orcid":null},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Bernd Puchala","raw_affiliation_strings":["Mathematische Grundlagen der Informatik, RWTH Aachen University,"],"affiliations":[{"raw_affiliation_string":"Mathematische Grundlagen der Informatik, RWTH Aachen University,","institution_ids":["https://openalex.org/I887968799"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073512540","display_name":"Roman Rabinovich","orcid":null},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Roman Rabinovich","raw_affiliation_strings":["Mathematische Grundlagen der Informatik, RWTH Aachen University,"],"affiliations":[{"raw_affiliation_string":"Mathematische Grundlagen der Informatik, RWTH Aachen University,","institution_ids":["https://openalex.org/I887968799"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5002148975"],"corresponding_institution_ids":["https://openalex.org/I887968799"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.7271,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.68815559,"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":"604","last_page":"615"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9991999864578247,"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.9991999864578247,"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.9979000091552734,"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/T11567","display_name":"semigroups and automata theory","score":0.9977999925613403,"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/bounded-function","display_name":"Bounded function","score":0.7853833436965942},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.5973257422447205},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5247535705566406},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.515340268611908},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4833216667175293},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.47132185101509094},{"id":"https://openalex.org/keywords/parity","display_name":"Parity (physics)","score":0.4694024622440338},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.44073864817619324},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.4367034435272217},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4246545433998108},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4222126603126526},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.3579707443714142},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3366404175758362},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.33568403124809265},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1451772153377533}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7853833436965942},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.5973257422447205},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5247535705566406},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.515340268611908},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4833216667175293},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.47132185101509094},{"id":"https://openalex.org/C2777151079","wikidata":"https://www.wikidata.org/wiki/Q141160","display_name":"Parity (physics)","level":2,"score":0.4694024622440338},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.44073864817619324},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.4367034435272217},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4246545433998108},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4222126603126526},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.3579707443714142},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3366404175758362},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.33568403124809265},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1451772153377533},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C109214941","wikidata":"https://www.wikidata.org/wiki/Q18334","display_name":"Particle physics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/978-3-642-15155-2_53","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-15155-2_53","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.174.6878","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.174.6878","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://logic.rwth-aachen.de/%7Epuchala/bounded_partial.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.175.3489","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.175.3489","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://logic.rwth-aachen.de/%7Erabinovich/bounded_imperfect.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.397.6136","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.397.6136","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://logic.rwth-aachen.de/~puchala/bounded_partial.pdf","raw_type":"text"},{"id":"pmh:oai:publications.rwth-aachen.de:119912","is_oa":false,"landing_page_url":"https://publications.rwth-aachen.de/record/119912","pdf_url":null,"source":{"id":"https://openalex.org/S4306401033","display_name":"RWTH Publications (RWTH Aachen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887968799","host_organization_name":"RWTH Aachen University","host_organization_lineage":["https://openalex.org/I887968799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Mathematical foundations of computer science 2010 : 35th international symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010 ; proceedings / Petr Hlin\u011bn\u00fd; Anton\u00edn Ku\u010dera (eds.)<br/>35. international symposium: Mathematical foundations of computer science 2010, MFCS 2010, Brno, Czech Republic, 2010-08-23 - 2010-08-27","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1481109946","https://openalex.org/W1487444734","https://openalex.org/W1567990440","https://openalex.org/W1606555018","https://openalex.org/W1821241631","https://openalex.org/W1976676758","https://openalex.org/W1982335876","https://openalex.org/W2011911122","https://openalex.org/W2054167510","https://openalex.org/W2092977061","https://openalex.org/W2124672580","https://openalex.org/W2132750992","https://openalex.org/W2147830304","https://openalex.org/W2154965599","https://openalex.org/W2163940503","https://openalex.org/W2184756528","https://openalex.org/W2401216365","https://openalex.org/W2493860389","https://openalex.org/W2497620028","https://openalex.org/W2949612215","https://openalex.org/W3101550233","https://openalex.org/W4240256729"],"related_works":["https://openalex.org/W2016277208","https://openalex.org/W4283803822","https://openalex.org/W2028363955","https://openalex.org/W2183941833","https://openalex.org/W2031366744","https://openalex.org/W2113292309","https://openalex.org/W1490274792","https://openalex.org/W2768348963","https://openalex.org/W1964113132","https://openalex.org/W3120639636"],"abstract_inverted_index":null,"counts_by_year":[{"year":2014,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}