{"id":"https://openalex.org/W1977227483","doi":"https://doi.org/10.1007/s00037-009-0266-4","title":"Space-Efficient Counting in Graphs on Surfaces","display_name":"Space-Efficient Counting in Graphs on Surfaces","publication_year":2009,"publication_date":"2009-09-23","ids":{"openalex":"https://openalex.org/W1977227483","doi":"https://doi.org/10.1007/s00037-009-0266-4","mag":"1977227483"},"language":"en","primary_location":{"id":"doi:10.1007/s00037-009-0266-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00037-009-0266-4","pdf_url":null,"source":{"id":"https://openalex.org/S193995496","display_name":"Computational Complexity","issn_l":"1016-3328","issn":["1016-3328","1420-8954"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320186","host_organization_name":"Birkh\u00e4user","host_organization_lineage":["https://openalex.org/P4310320186","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Birkh\u00e4user","Springer Science+Business Media"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"computational complexity","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/A5042816355","display_name":"Mark Braverman","orcid":"https://orcid.org/0000-0003-1276-6081"},"institutions":[{"id":"https://openalex.org/I4400600948","display_name":"Microsoft Research New England (United States)","ror":"https://ror.org/010wkqn50","country_code":null,"type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4400600948"]},{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Mark Braverman","raw_affiliation_strings":["Department of Computer Science, University of Toronto, Toronto, Ontario, M5S 3G4, Canada","University of Toronto, Department of Computer Science, M5S 3G4, Toronto, Ontario, Canada and Microsoft Research New England, One Memorial Drive, Cambridge, MA 02142, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Toronto, Toronto, Ontario, M5S 3G4, Canada","institution_ids":["https://openalex.org/I185261750"]},{"raw_affiliation_string":"University of Toronto, Department of Computer Science, M5S 3G4, Toronto, Ontario, Canada and Microsoft Research New England, One Memorial Drive, Cambridge, MA 02142, USA#TAB#","institution_ids":["https://openalex.org/I185261750","https://openalex.org/I4400600948"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109451514","display_name":"Raghav Kulkarni","orcid":null},"institutions":[{"id":"https://openalex.org/I40347166","display_name":"University of Chicago","ror":"https://ror.org/024mw5h28","country_code":"US","type":"education","lineage":["https://openalex.org/I40347166"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Raghav Kulkarni","raw_affiliation_strings":["Department of Computer Science, University of Chicago, 1100 E 58th Street, Chicago, IL, 60637, USA","University of Chicago, Department of Computer Science, 1100 E 58th Street, 60637, Chicago, IL, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Chicago, 1100 E 58th Street, Chicago, IL, 60637, USA","institution_ids":["https://openalex.org/I40347166"]},{"raw_affiliation_string":"University of Chicago, Department of Computer Science, 1100 E 58th Street, 60637, Chicago, IL, USA#TAB#","institution_ids":["https://openalex.org/I40347166"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110192164","display_name":"Sambuddha Roy","orcid":null},"institutions":[{"id":"https://openalex.org/I4210103279","display_name":"IBM Research - India","ror":"https://ror.org/014wt7r80","country_code":"IN","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210103279","https://openalex.org/I4210114115"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Sambuddha Roy","raw_affiliation_strings":["India Research Lab, IBM India Pvt. Ltd., New Delhi, 110 070, India","IBM India Pvt. Ltd., India Research Lab, 110 070, New Delhi, India#TAB#"],"affiliations":[{"raw_affiliation_string":"India Research Lab, IBM India Pvt. Ltd., New Delhi, 110 070, India","institution_ids":["https://openalex.org/I4210103279"]},{"raw_affiliation_string":"IBM India Pvt. Ltd., India Research Lab, 110 070, New Delhi, India#TAB#","institution_ids":["https://openalex.org/I4210103279"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5042816355"],"corresponding_institution_ids":["https://openalex.org/I185261750","https://openalex.org/I4400600948"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":1.0571,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.7572037,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"18","issue":"4","first_page":"601","last_page":"649"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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.9997000098228455,"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.9983999729156494,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.7647645473480225},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7354409098625183},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7096681594848633},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.666655957698822},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5207697749137878},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.4640606641769409},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.447682648897171},{"id":"https://openalex.org/keywords/counting-problem","display_name":"Counting problem","score":0.4370185434818268},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3335787057876587}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7647645473480225},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7354409098625183},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7096681594848633},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.666655957698822},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5207697749137878},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.4640606641769409},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.447682648897171},{"id":"https://openalex.org/C16592021","wikidata":"https://www.wikidata.org/wiki/Q5177154","display_name":"Counting problem","level":2,"score":0.4370185434818268},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3335787057876587},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00037-009-0266-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00037-009-0266-4","pdf_url":null,"source":{"id":"https://openalex.org/S193995496","display_name":"Computational Complexity","issn_l":"1016-3328","issn":["1016-3328","1420-8954"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320186","host_organization_name":"Birkh\u00e4user","host_organization_lineage":["https://openalex.org/P4310320186","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Birkh\u00e4user","Springer Science+Business Media"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"computational complexity","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.189.3752","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.189.3752","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.toronto.edu/%7Embraverm/Papers/SurfCount.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W42771637","https://openalex.org/W143000018","https://openalex.org/W247697463","https://openalex.org/W1501027479","https://openalex.org/W1687766689","https://openalex.org/W1976579818","https://openalex.org/W1990870868","https://openalex.org/W2006912660","https://openalex.org/W2021238854","https://openalex.org/W2024091095","https://openalex.org/W2065813152","https://openalex.org/W2145664670","https://openalex.org/W2166162093","https://openalex.org/W2798588639","https://openalex.org/W2798799102","https://openalex.org/W3040586665","https://openalex.org/W3126588943"],"related_works":["https://openalex.org/W2117548279","https://openalex.org/W2371352078","https://openalex.org/W2070252991","https://openalex.org/W2807449856","https://openalex.org/W2941201715","https://openalex.org/W2025727968","https://openalex.org/W238211858","https://openalex.org/W2953461625","https://openalex.org/W2803761277","https://openalex.org/W4297742300"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}