{"id":"https://openalex.org/W171428035","doi":"https://doi.org/10.1007/978-3-662-44465-8_29","title":"Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth","display_name":"Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W171428035","doi":"https://doi.org/10.1007/978-3-662-44465-8_29","mag":"171428035"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-662-44465-8_29","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-662-44465-8_29","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/A5055834958","display_name":"Kristoffer Arnsfelt Hansen","orcid":"https://orcid.org/0000-0002-1155-8072"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Kristoffer Arnsfelt Hansen","raw_affiliation_strings":["Aarhus University, Denmark"],"affiliations":[{"raw_affiliation_string":"Aarhus University, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030291460","display_name":"Balagopal Komarath","orcid":null},"institutions":[{"id":"https://openalex.org/I24676775","display_name":"Indian Institute of Technology Madras","ror":"https://ror.org/03v0r5n49","country_code":"IN","type":"facility","lineage":["https://openalex.org/I24676775"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Balagopal Komarath","raw_affiliation_strings":["IIT Madras, Chennai, India"],"affiliations":[{"raw_affiliation_string":"IIT Madras, Chennai, India","institution_ids":["https://openalex.org/I24676775"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001731932","display_name":"Jayalal Sarma","orcid":null},"institutions":[{"id":"https://openalex.org/I24676775","display_name":"Indian Institute of Technology Madras","ror":"https://ror.org/03v0r5n49","country_code":"IN","type":"facility","lineage":["https://openalex.org/I24676775"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Jayalal Sarma","raw_affiliation_strings":["IIT Madras, Chennai, India"],"affiliations":[{"raw_affiliation_string":"IIT Madras, Chennai, India","institution_ids":["https://openalex.org/I24676775"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5017408163","display_name":"Sven Skyum","orcid":null},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Sven Skyum","raw_affiliation_strings":["Aarhus University, Denmark"],"affiliations":[{"raw_affiliation_string":"Aarhus University, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019353955","display_name":"Navid Talebanfard","orcid":"https://orcid.org/0000-0002-3524-9282"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Navid Talebanfard","raw_affiliation_strings":["Aarhus University, Denmark"],"affiliations":[{"raw_affiliation_string":"Aarhus University, Denmark","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5055834958"],"corresponding_institution_ids":["https://openalex.org/I204337017"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.3989,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.59254061,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"336","last_page":"347"},"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.9994000196456909,"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.9990000128746033,"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/bipartite-graph","display_name":"Bipartite graph","score":0.7510156035423279},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7030649185180664},{"id":"https://openalex.org/keywords/planarity-testing","display_name":"Planarity testing","score":0.6646720767021179},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5804607272148132},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.556209146976471},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5496705770492554},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5439836978912354},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5244098901748657},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5098583102226257},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.47648996114730835},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47296637296676636},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.42667266726493835},{"id":"https://openalex.org/keywords/list-coloring","display_name":"List coloring","score":0.41734546422958374},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4052581787109375},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.37530750036239624},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.16912078857421875},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.10035467147827148},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.06200343370437622}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7510156035423279},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7030649185180664},{"id":"https://openalex.org/C68260962","wikidata":"https://www.wikidata.org/wiki/Q7200967","display_name":"Planarity testing","level":2,"score":0.6646720767021179},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5804607272148132},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.556209146976471},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5496705770492554},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5439836978912354},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5244098901748657},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5098583102226257},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.47648996114730835},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47296637296676636},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.42667266726493835},{"id":"https://openalex.org/C199594403","wikidata":"https://www.wikidata.org/wiki/Q1130404","display_name":"List coloring","level":5,"score":0.41734546422958374},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4052581787109375},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.37530750036239624},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.16912078857421875},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.10035467147827148},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.06200343370437622},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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":3,"locations":[{"id":"doi:10.1007/978-3-662-44465-8_29","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-662-44465-8_29","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.715.8515","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.715.8515","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://cs.au.dk/%7Enavid/planar-cutwidth.pdf","raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:publications/9d37b6eb-65a2-4f2b-81c3-d69c0d3ea326","is_oa":false,"landing_page_url":"http://link.springer.com/chapter/10.1007/978-3-662-44465-8_29","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Hansen, K A, Komarath, B, Sarma M. N., J, Talebanfard, N & Skyum, S 2014, Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth. in E Csuhaj-Varj\u00fa, M Dietzfelbinger & Z \u00c9sik (eds), Mathematical Foundations of Computer Science 2014 : 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part II. Springer VS, Lecture Notes in Computer Science, vol. 8635, pp. 336-347 , International Symposium on Mathematical Foundations of Computer Science, Budapest, Hungary, 25/08/2014. https://doi.org/10.1007/978-3-662-44465-8_29","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.6899999976158142,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W177373862","https://openalex.org/W194684792","https://openalex.org/W1491169489","https://openalex.org/W1592405134","https://openalex.org/W1593030677","https://openalex.org/W2005079828","https://openalex.org/W2009994177","https://openalex.org/W2010465749","https://openalex.org/W2017434030","https://openalex.org/W2022124805","https://openalex.org/W2030087828","https://openalex.org/W2049516232","https://openalex.org/W2050579693","https://openalex.org/W2055336889","https://openalex.org/W2075848688","https://openalex.org/W2087818742","https://openalex.org/W2104952158","https://openalex.org/W2132474868","https://openalex.org/W2170478756","https://openalex.org/W2569646339","https://openalex.org/W4240781210","https://openalex.org/W4253676159"],"related_works":["https://openalex.org/W2373079339","https://openalex.org/W2108284102","https://openalex.org/W3047848516","https://openalex.org/W4287691299","https://openalex.org/W183093845","https://openalex.org/W4297837089","https://openalex.org/W2959817076","https://openalex.org/W2951726931","https://openalex.org/W3134933682","https://openalex.org/W2964235359"],"abstract_inverted_index":null,"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}