{"id":"https://openalex.org/W1972414329","doi":"https://doi.org/10.1137/s0097539705446925","title":"I/O-Efficient Planar Separators","display_name":"I/O-Efficient Planar Separators","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W1972414329","doi":"https://doi.org/10.1137/s0097539705446925","mag":"1972414329"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539705446925","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539705446925","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on 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/A5103136561","display_name":"Anil Maheshwari","orcid":"https://orcid.org/0000-0002-1274-4598"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Anil Maheshwari","raw_affiliation_strings":["maheshwa@scs.carleton.ca#TAB#"],"affiliations":[{"raw_affiliation_string":"maheshwa@scs.carleton.ca#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019738080","display_name":"Norbert Zeh","orcid":"https://orcid.org/0000-0002-0562-1629"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Norbert Zeh","raw_affiliation_strings":["[email\u00a0protected]#TAB#"],"affiliations":[{"raw_affiliation_string":"[email\u00a0protected]#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5103136561"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.2348,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.79241275,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"38","issue":"3","first_page":"767","last_page":"801"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9993000030517578,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9993000030517578,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9991000294685364,"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.996999979019165,"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.7134871482849121},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.6479644179344177},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.5354284048080444},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4534464478492737},{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.4478576183319092},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4463973939418793},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3444820046424866},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.29988694190979004},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12950196862220764}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7134871482849121},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.6479644179344177},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.5354284048080444},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4534464478492737},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.4478576183319092},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4463973939418793},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3444820046424866},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.29988694190979004},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12950196862220764},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/s0097539705446925","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539705446925","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.225.1260","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.225.1260","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://users.cs.dal.ca/%7Enzeh/Publications/planar_separators_sicomp08.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":19,"referenced_works":["https://openalex.org/W1968647828","https://openalex.org/W1974876810","https://openalex.org/W1987374783","https://openalex.org/W2017376066","https://openalex.org/W2020158648","https://openalex.org/W2024491681","https://openalex.org/W2038643780","https://openalex.org/W2046441184","https://openalex.org/W2049142782","https://openalex.org/W2049413646","https://openalex.org/W2073558110","https://openalex.org/W2074383890","https://openalex.org/W2088116875","https://openalex.org/W2091252880","https://openalex.org/W2120424341","https://openalex.org/W2136354771","https://openalex.org/W2140883685","https://openalex.org/W2170069407","https://openalex.org/W2175110005"],"related_works":["https://openalex.org/W3216105633","https://openalex.org/W2082479932","https://openalex.org/W1701875187","https://openalex.org/W2990956612","https://openalex.org/W1798304401","https://openalex.org/W2476624396","https://openalex.org/W4302177579","https://openalex.org/W1606013690","https://openalex.org/W4293743430","https://openalex.org/W3006156235"],"abstract_inverted_index":{"We":[0],"present":[1],"I/O-efficient":[2,75,108,145,188,224,298,328,398],"algorithms":[3,146,264,299],"for":[4,85,107,147,194,230,265,300,337],"computing":[5],"optimal":[6],"separator":[7,33,335,387,405,411],"partitions":[8,40],"of":[9,34,47,93,152,200,207,236,243,270,305,359,392,403],"planar":[10,19,76,116,148,196,232,266,301,351],"graphs.":[11],"Our":[12,322],"main":[13],"result":[14,103,324],"shows":[15,325],"that,":[16,326],"given":[17,327],"a":[18,31,333,404],"graph":[20],"G":[21,41],"with":[22,73,339,353],"N":[23],"vertices":[24,345],"and":[25,52,121,129,142,161,185,191,221,227,253,258,295,314,341,355,366],"an":[26,74],"integer":[27],"$r":[28],">":[29],"0$,":[30],"vertex":[32],"size":[35,48,54],"O$(N":[36,43],"/":[37,44],"\\sqrt{r})$":[38],"that":[39,66],"into":[42],"r)$":[45],"subgraphs":[46],"at":[49],"most":[50],"r":[51,419],"boundary":[53],"O$(\\sqrt{r})$":[55],"can":[56,381],"be":[57,382],"computed":[58],"in":[59,80,150,159,198,234,268,280,303,312,357,370,420],"O$(\\operatorname{sort}(N))$":[60],"I/Os.":[61],"This":[62],"bound":[63],"holds":[64],"provided":[65],"$M":[67],"\\ge":[68],"56r":[69],"\\log^2":[70],"B$.":[71],"Together":[72],"embedding":[77],"algorithm":[78,336],"presented":[79],"[N.":[81],"Zeh,":[82,144,187,223,297],"I/O-Efficient":[83],"Algorithms":[84,160,177,313],"Shortest":[86],"Path":[87],"Related":[88],"Problems,":[89],"Ph.D.":[90],"thesis,":[91],"School":[92],"Computer":[94,208,244],"Science,":[95,209,245],"Carleton":[96],"University,":[97],"Ottawa,":[98],"ON,":[99],"Canada,":[100],"2002],":[101],"this":[102,393],"is":[104],"the":[105,153,201,237,271,306,360,401,423],"basis":[106],"solutions":[109,329],"to":[110,330,422],"many":[111],"other":[112],"fundamental":[113],"problems":[114],"on":[115,157,205,241,275,310,343,363,418],"graphs,":[117,197,233],"including":[118],"breadth-first":[119],"search":[120,170,193,229],"shortest":[122],"paths":[123],"[L.":[124,171,219,256,346],"Arge,":[125,139,292],"G.":[126],"S.":[127],"Brodal,":[128],"L.":[130,138,140,183,259,291,293],"Toma,":[131,141,260,294],"J.":[132,175],"Algorithms,":[133],"53":[134],"(2004),":[135],"pp.":[136,167,181,215,251,289,320,379],"186\u2013206;":[137],"N.":[143,186,222,296],"digraphs,":[149,302],"Proceedings":[151,199,235,269,304,358],"15th":[154,307],"ACM":[155,308],"Symposium":[156,204,240,309],"Parallelism":[158,311],"Architectures,":[162,315],"ACM,":[163,316],"New":[164,286,317,376],"York,":[165,287,318,377],"2003,":[166,214,250,319],"85\u201393],":[168],"depth-first":[169,192,228],"Arge":[172,184,220,257],"et":[173,348],"al.,":[174,349],"Graph":[176],"Appl.,":[178],"7":[179],"(2003),":[180],"105\u2013129;":[182],"strong":[189,217,225],"connectivity":[190,218,226],"directed":[195,231],"44th":[202,238],"IEEE":[203,210,239,246],"Foundations":[206,242],"Press,":[211,247],"Piscataway,":[212,248],"NJ,":[213,249],"261\u2013270],":[216,252],"topological":[254],"sorting":[255],"Simplified":[261],"external":[262],"memory":[263,424],"DAGs,":[267],"9th":[272],"Scandinavian":[273],"Workshop":[274,362],"Algorithm":[276,364],"Theory,":[277],"Lecture":[278,368],"Notes":[279,369],"Comput.":[281,371],"Sci.":[282,372],"3111,":[283],"Springer-Verlag,":[284,374],"Berlin,":[285,375],"2004,":[288],"493\u2013503;":[290],"85\u201393].":[321],"second":[323],"these":[331],"problems,":[332],"general":[334],"graphs":[338,352],"costs":[340,354],"weights":[342],"their":[344],"Aleksandrov":[347],"Partitioning":[350],"weights,":[356],"4th":[361],"Engineering":[365],"Experiments,":[367],"2409,":[373],"2002,":[378],"98\u2013107]":[380],"made":[383],"I/O-efficient.":[384],"Many":[385],"classical":[386],"theorems":[388],"are":[389],"special":[390],"cases":[391],"result.":[394],"In":[395],"particular,":[396],"our":[397,409],"version":[399],"allows":[400],"computation":[402],"as":[406],"produced":[407],"by":[408],"first":[410],"algorithm,":[412],"but":[413],"without":[414],"placing":[415],"any":[416],"constraints":[417],"relation":[421],"size.":[425]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}