{"id":"https://openalex.org/W2024244897","doi":"https://doi.org/10.1007/bf00625277","title":"Some modified algorithms for Dijkstra's longest upsequence problem","display_name":"Some modified algorithms for Dijkstra's longest upsequence problem","publication_year":1982,"publication_date":"1982-01-01","ids":{"openalex":"https://openalex.org/W2024244897","doi":"https://doi.org/10.1007/bf00625277","mag":"2024244897"},"language":"en","primary_location":{"id":"doi:10.1007/bf00625277","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf00625277","pdf_url":null,"source":{"id":"https://openalex.org/S84409463","display_name":"Acta Informatica","issn_l":"0001-5903","issn":["0001-5903","1432-0525"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Acta Informatica","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/A5108359099","display_name":"Robert Dewar","orcid":null},"institutions":[{"id":"https://openalex.org/I36672615","display_name":"Courant Institute of Mathematical Sciences","ror":"https://ror.org/037tm7f56","country_code":"US","type":"education","lineage":["https://openalex.org/I36672615","https://openalex.org/I57206974"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Robert B. K. Dewar","raw_affiliation_strings":["Department of Computer Science, Courant Institute of Mathematical Sciences, New York University, 251 Mercer Street, 10012, New York, USA","Department of Computer Science, Courant Institute of Mathematical Sciences, New York University, New York, USA 10012#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Courant Institute of Mathematical Sciences, New York University, 251 Mercer Street, 10012, New York, USA","institution_ids":["https://openalex.org/I36672615"]},{"raw_affiliation_string":"Department of Computer Science, Courant Institute of Mathematical Sciences, New York University, New York, USA 10012#TAB#","institution_ids":["https://openalex.org/I36672615"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035365859","display_name":"Susan M. Merritt","orcid":null},"institutions":[{"id":"https://openalex.org/I36672615","display_name":"Courant Institute of Mathematical Sciences","ror":"https://ror.org/037tm7f56","country_code":"US","type":"education","lineage":["https://openalex.org/I36672615","https://openalex.org/I57206974"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Susan M. Merritt","raw_affiliation_strings":["Department of Computer Science, Courant Institute of Mathematical Sciences, New York University, 251 Mercer Street, 10012, New York, USA","Department of Computer Science, Courant Institute of Mathematical Sciences, New York University, New York, USA 10012#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Courant Institute of Mathematical Sciences, New York University, 251 Mercer Street, 10012, New York, USA","institution_ids":["https://openalex.org/I36672615"]},{"raw_affiliation_string":"Department of Computer Science, Courant Institute of Mathematical Sciences, New York University, New York, USA 10012#TAB#","institution_ids":["https://openalex.org/I36672615"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055296785","display_name":"Micha Sharir","orcid":"https://orcid.org/0000-0002-2541-3763"},"institutions":[{"id":"https://openalex.org/I36672615","display_name":"Courant Institute of Mathematical Sciences","ror":"https://ror.org/037tm7f56","country_code":"US","type":"education","lineage":["https://openalex.org/I36672615","https://openalex.org/I57206974"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Micha Sharir","raw_affiliation_strings":["Department of Computer Science, Courant Institute of Mathematical Sciences, New York University, 251 Mercer Street, 10012, New York, USA","Department of Computer Science, Courant Institute of Mathematical Sciences, New York University, New York, USA 10012#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Courant Institute of Mathematical Sciences, New York University, 251 Mercer Street, 10012, New York, USA","institution_ids":["https://openalex.org/I36672615"]},{"raw_affiliation_string":"Department of Computer Science, Courant Institute of Mathematical Sciences, New York University, New York, USA 10012#TAB#","institution_ids":["https://openalex.org/I36672615"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5108359099"],"corresponding_institution_ids":["https://openalex.org/I36672615"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":1.9652,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.87694989,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"18","issue":"1","first_page":"1","last_page":"15"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10126","display_name":"Logic, programming, and type systems","score":0.9930999875068665,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.984499990940094,"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/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.8599085211753845},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.7491552829742432},{"id":"https://openalex.org/keywords/merge-algorithm","display_name":"Merge algorithm","score":0.6958563923835754},{"id":"https://openalex.org/keywords/merge","display_name":"Merge (version control)","score":0.6697262525558472},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6240953207015991},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5534173846244812},{"id":"https://openalex.org/keywords/sorting-algorithm","display_name":"Sorting algorithm","score":0.48481884598731995},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.33118945360183716},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.29650047421455383},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.1973710060119629},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1690036952495575},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.16098672151565552}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.8599085211753845},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7491552829742432},{"id":"https://openalex.org/C140086265","wikidata":"https://www.wikidata.org/wiki/Q11341754","display_name":"Merge algorithm","level":4,"score":0.6958563923835754},{"id":"https://openalex.org/C197129107","wikidata":"https://www.wikidata.org/wiki/Q1921621","display_name":"Merge (version control)","level":2,"score":0.6697262525558472},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6240953207015991},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5534173846244812},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.48481884598731995},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.33118945360183716},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.29650047421455383},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.1973710060119629},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1690036952495575},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.16098672151565552}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf00625277","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf00625277","pdf_url":null,"source":{"id":"https://openalex.org/S84409463","display_name":"Acta Informatica","issn_l":"0001-5903","issn":["0001-5903","1432-0525"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Acta Informatica","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W195677578","https://openalex.org/W602059256","https://openalex.org/W1996508547","https://openalex.org/W2039556858","https://openalex.org/W2046831192","https://openalex.org/W2069153338","https://openalex.org/W2075852544","https://openalex.org/W2079473850","https://openalex.org/W2124010945","https://openalex.org/W2135436879","https://openalex.org/W2999688130","https://openalex.org/W3198160809"],"related_works":["https://openalex.org/W4320925713","https://openalex.org/W1997715509","https://openalex.org/W2925598649","https://openalex.org/W2190513794","https://openalex.org/W19461966","https://openalex.org/W2595864772","https://openalex.org/W2511099490","https://openalex.org/W4389428824","https://openalex.org/W2902545100","https://openalex.org/W2140238930"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}