{"id":"https://openalex.org/W2462688741","doi":"https://doi.org/10.1137/1.9781611973105","title":"Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms","display_name":"Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms","publication_year":2013,"publication_date":"2013-01-06","ids":{"openalex":"https://openalex.org/W2462688741","doi":"https://doi.org/10.1137/1.9781611973105","mag":"2462688741"},"language":"en","primary_location":{"id":"doi:10.1137/1.9781611973105","is_oa":false,"landing_page_url":"http://doi.org/10.1137/1.9781611973105","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"proceedings"},"type":"paratext","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/A5039619350","display_name":"Sanjeev Khanna","orcid":"https://orcid.org/0009-0000-2601-1689"},"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":"Khanna, Sanjeev","raw_affiliation_strings":["Aarhus University, Natural Sciences, Department of Computer Science, DK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Aarhus University, Natural Sciences, Department of Computer Science, DK","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Association for Computing Machinery","orcid":null},"institutions":[{"id":"https://openalex.org/I4210116091","display_name":"Department of Physics, Mathematics and Informatics","ror":"https://ror.org/023sm4k53","country_code":"BY","type":"facility","lineage":["https://openalex.org/I151823869","https://openalex.org/I4210116091"]}],"countries":["BY"],"is_corresponding":false,"raw_author_name":"Association for Computing Machinery","raw_affiliation_strings":["SDU, Faculty of Science, Department of Mathematics and Computer Science, DK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"SDU, Faculty of Science, Department of Mathematics and Computer Science, DK","institution_ids":["https://openalex.org/I4210116091"]}]},{"author_position":"last","author":{"id":null,"display_name":"Symposium on Discrete Algorithms 2013 New Orleans, La.","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":"Symposium on Discrete Algorithms 2013 New Orleans, La.","raw_affiliation_strings":["Aarhus University, Natural Sciences, Department of Computer Science, DK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Aarhus University, Natural Sciences, Department of Computer Science, DK","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":96,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":true,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.6029000282287598,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.6029000282287598,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.5812000036239624,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.5390999913215637,"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/computer-science","display_name":"Computer science","score":0.566949725151062},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45683783292770386}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.566949725151062},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45683783292770386}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/1.9781611973105","is_oa":false,"landing_page_url":"http://doi.org/10.1137/1.9781611973105","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"proceedings"},{"id":"pmh:oai:sdu.dk:publications/fd1a3c3f-d583-4c83-a3bb-f65e2b4bcd2e","is_oa":false,"landing_page_url":"https://portal.findresearcher.sdu.dk/da/publications/fd1a3c3f-d583-4c83-a3bb-f65e2b4bcd2e","pdf_url":null,"source":{"id":"https://openalex.org/S4306400423","display_name":"University of Southern Denmark Research Portal (University of Southern Denmark)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177969490","host_organization_name":"University of Southern Denmark","host_organization_lineage":["https://openalex.org/I177969490"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Brodal, G S, Fagerberg, R, Mailund, T, Pedersen, C N S & Sand, A 2013, Efficient algorithms for computing the triplet and quartet distance between trees of arbitrary degree. in S Khanna (ed.), Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, pp. 1814-1832, 24th Annual ACM-SIAM Symposium on Discrete Algorithms , New Orleans, United States, 06/01/2013. https://doi.org/10.1137/1.9781611973105","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:aleph.bib-bvb.de:BVB01-032668678","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611973105","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"software, multimedia"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109"],"abstract_inverted_index":{"This":[0],"symposium":[1],"focuses":[2],"on":[3,64],"research":[4],"topics":[5],"related":[6,38],"to":[7,18,39],"efficient":[8],"algorithms":[9],"and":[10,24,34,51,72],"data":[11,65],"structures":[12],"for":[13],"discrete":[14],"problems.":[15],"In":[16],"addition":[17],"the":[19,26,35],"design":[20],"of":[21],"such":[22],"methods":[23],"structures,":[25],"scope":[27],"also":[28],"includes":[29],"their":[30,40],"use,":[31],"performance":[32,79],"analysis,":[33],"mathematical":[36],"problems":[37],"development":[41],"or":[42,49,55,62],"limitations.":[43],"Performance":[44],"analyses":[45],"may":[46,52,73],"be":[47,60],"analytical":[48],"experimental":[50],"address":[53,74],"worst-case":[54],"expected-case":[56],"performance.":[57],"Studies":[58],"can":[59],"theoretical":[61],"based":[63],"sets":[66],"that":[67],"have":[68],"arisen":[69],"in":[70,78],"practice":[71],"methodological":[75],"issues":[76],"involved":[77],"analysis":[80]},"counts_by_year":[{"year":2025,"cited_by_count":9},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":11},{"year":2020,"cited_by_count":20},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":6},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-04T07:58:01.006859","created_date":"2016-07-22T00:00:00"}