{"id":"https://openalex.org/W1545429529","doi":"https://doi.org/10.1007/978-3-540-27810-8_42","title":"Simplified External Memory Algorithms for Planar DAGs","display_name":"Simplified External Memory Algorithms for Planar DAGs","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W1545429529","doi":"https://doi.org/10.1007/978-3-540-27810-8_42","mag":"1545429529"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-27810-8_42","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-27810-8_42","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/A5084056010","display_name":"Lars Arge","orcid":null},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lars Arge","raw_affiliation_strings":["Duke University, Durham, NC, 27708, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Duke University, Durham, NC, 27708, USA","institution_ids":["https://openalex.org/I170897317"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103550036","display_name":"Laura Toma","orcid":null},"institutions":[{"id":"https://openalex.org/I135474949","display_name":"Bowdoin College","ror":"https://ror.org/03gh96r95","country_code":"US","type":"education","lineage":["https://openalex.org/I135474949"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Laura Toma","raw_affiliation_strings":["Bowdoin College, Brunswick, ME, 04011, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bowdoin College, Brunswick, ME, 04011, USA","institution_ids":["https://openalex.org/I135474949"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.8261,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.73103851,"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":"493","last_page":"503"},"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.9968000054359436,"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.9968000054359436,"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.9965000152587891,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9952999949455261,"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/topological-sorting","display_name":"Topological sorting","score":0.8150575160980225},{"id":"https://openalex.org/keywords/sort","display_name":"sort","score":0.7045390605926514},{"id":"https://openalex.org/keywords/sorting-algorithm","display_name":"Sorting algorithm","score":0.6853733062744141},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6704353094100952},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6210144758224487},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.6144009828567505},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.5410313606262207},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.5384634733200073},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.5368229746818542},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5187845230102539},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44401755928993225},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4187816381454468},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3326304256916046},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29350537061691284},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.23961392045021057}],"concepts":[{"id":"https://openalex.org/C176032523","wikidata":"https://www.wikidata.org/wiki/Q753127","display_name":"Topological sorting","level":3,"score":0.8150575160980225},{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.7045390605926514},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.6853733062744141},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6704353094100952},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6210144758224487},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.6144009828567505},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.5410313606262207},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.5384634733200073},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.5368229746818542},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5187845230102539},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44401755928993225},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4187816381454468},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3326304256916046},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29350537061691284},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.23961392045021057},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"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":4,"locations":[{"id":"doi:10.1007/978-3-540-27810-8_42","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-27810-8_42","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.367.6297","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.367.6297","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.win.tue.nl/~hermanh/onderwijs/2IL00/arge-planar-dags.pdf","raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:publications/11da2620-bcc6-11df-bd09-000ea68e967b","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/11da2620-bcc6-11df-bd09-000ea68e967b","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Arge, L A & Toma, L 2004, Simplified External Memory Algorithms for Planar DAGs. in T Hagerup & J Katajainen (eds), Algorithm Theory - SWAT 2004 : 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004. Proceedings. Springer, Lecture Notes in Computer Science, vol. 3111, pp. 493-503, Scandinavian Workshop on Algorithm THeory. SWAT '04, Humlebaek, Denmark, 08/07/2004. https://doi.org/10.1007/978-3-540-27810-8_42","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.atira.dk:publications/5141d820-9362-11dc-bee9-02004c4f4f50","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/5141d820-9362-11dc-bee9-02004c4f4f50","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Arge, L & Toma, L 2004, Simplified External Memory Algorithms for Planar DAGS. in Proceedings of the 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004.. 3111 i Lecture Notes in Computer Science edn, vol. 3111/2004, Springer, pp. 493-503, 9th Scandinavian Workshop on Algorithm Theory (SWAT '04), Humleb\u00e6k, Denmark, 08/07/2004.","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":16,"referenced_works":["https://openalex.org/W29653294","https://openalex.org/W1485508724","https://openalex.org/W1487258612","https://openalex.org/W1982231222","https://openalex.org/W2020158648","https://openalex.org/W2037688351","https://openalex.org/W2038142281","https://openalex.org/W2038643780","https://openalex.org/W2057839002","https://openalex.org/W2083801185","https://openalex.org/W2090103608","https://openalex.org/W2116580117","https://openalex.org/W2120424341","https://openalex.org/W2141883265","https://openalex.org/W3145128584","https://openalex.org/W6629262294"],"related_works":["https://openalex.org/W2084763084","https://openalex.org/W1519800400","https://openalex.org/W2908348257","https://openalex.org/W2994182992","https://openalex.org/W2952392475","https://openalex.org/W2350549588","https://openalex.org/W4281648223","https://openalex.org/W2085265870","https://openalex.org/W2392446010","https://openalex.org/W2362374543"],"abstract_inverted_index":null,"counts_by_year":[{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}