{"id":"https://openalex.org/W2106457067","doi":"https://doi.org/10.1007/s00453-004-1145-7","title":"Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems","display_name":"Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems","publication_year":2005,"publication_date":"2005-02-16","ids":{"openalex":"https://openalex.org/W2106457067","doi":"https://doi.org/10.1007/s00453-004-1145-7","mag":"2106457067"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-004-1145-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-004-1145-7","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"Algorithmica","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/A5023394727","display_name":"Jianer Chen","orcid":"https://orcid.org/0000-0003-0898-1643"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jianer Chen","raw_affiliation_strings":["Department of Computer Science, Texas A&M University, College Station, TX 77843-3112, USA","Dept. of Computer Science, Texas A&M University, College Station, TX 77843\u20103112, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Texas A&M University, College Station, TX 77843-3112, USA","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"Dept. of Computer Science, Texas A&M University, College Station, TX 77843\u20103112, USA","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009111693","display_name":"Iyad Kanj","orcid":"https://orcid.org/0000-0003-1698-8829"},"institutions":[{"id":"https://openalex.org/I118353179","display_name":"DePaul University","ror":"https://ror.org/04xtx5t16","country_code":"US","type":"education","lineage":["https://openalex.org/I118353179"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Iyad A. Kanj","raw_affiliation_strings":["School of CTI, DePaul University, 243 S. Wabash Avenue, Chicago, IL 60604-2301, USA"],"affiliations":[{"raw_affiliation_string":"School of CTI, DePaul University, 243 S. Wabash Avenue, Chicago, IL 60604-2301, USA","institution_ids":["https://openalex.org/I118353179"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112078381","display_name":"Ge Xia","orcid":"https://orcid.org/0000-0001-7536-0826"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ge Xia","raw_affiliation_strings":["Department of Computer Science, Texas A&M University, College Station, TX 77843-3112, USA","Dept. of Computer Science, Texas A&M University, College Station, TX 77843\u20103112, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Texas A&M University, College Station, TX 77843-3112, USA","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"Dept. of Computer Science, Texas A&M University, College Station, TX 77843\u20103112, USA","institution_ids":["https://openalex.org/I91045830"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5023394727"],"corresponding_institution_ids":["https://openalex.org/I91045830"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":2.3601,"has_fulltext":false,"cited_by_count":55,"citation_normalized_percentile":{"value":0.89147174,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"43","issue":"4","first_page":"245","last_page":"273"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9991999864578247,"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.9991999864578247,"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.9987999796867371,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9728999733924866,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.8034980297088623},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.7152808308601379},{"id":"https://openalex.org/keywords/amortized-analysis","display_name":"Amortized analysis","score":0.7151466012001038},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5936888456344604},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5827277898788452},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5668085217475891},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5530977249145508},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5452074408531189},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5177732706069946},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.504269003868103},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.5024261474609375},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.4568730890750885},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.45339301228523254},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.45200178027153015},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44433754682540894},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.42676854133605957},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4208071529865265},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.37102359533309937},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.29763540625572205},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.28823500871658325},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.2858932614326477}],"concepts":[{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.8034980297088623},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7152808308601379},{"id":"https://openalex.org/C142417499","wikidata":"https://www.wikidata.org/wiki/Q331716","display_name":"Amortized analysis","level":3,"score":0.7151466012001038},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5936888456344604},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5827277898788452},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5668085217475891},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5530977249145508},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5452074408531189},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5177732706069946},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.504269003868103},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.5024261474609375},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.4568730890750885},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.45339301228523254},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.45200178027153015},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44433754682540894},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42676854133605957},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4208071529865265},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37102359533309937},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.29763540625572205},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.28823500871658325},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.2858932614326477},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"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/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00453-004-1145-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-004-1145-7","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"Algorithmica","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1513769081","https://openalex.org/W1517722749","https://openalex.org/W1598441350","https://openalex.org/W1655990431","https://openalex.org/W1969884720","https://openalex.org/W1971756951","https://openalex.org/W1972577597","https://openalex.org/W1972845596","https://openalex.org/W1973852671","https://openalex.org/W1983330102","https://openalex.org/W1994556169","https://openalex.org/W1995725694","https://openalex.org/W1996359073","https://openalex.org/W2013415302","https://openalex.org/W2026771935","https://openalex.org/W2027049731","https://openalex.org/W2027999353","https://openalex.org/W2073025989","https://openalex.org/W2097844290","https://openalex.org/W2527702230","https://openalex.org/W2607539118","https://openalex.org/W2799004609","https://openalex.org/W2913688336","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W1994773828","https://openalex.org/W4300069928","https://openalex.org/W2950011768","https://openalex.org/W4293689459","https://openalex.org/W2140874208","https://openalex.org/W4309397562","https://openalex.org/W2098464890","https://openalex.org/W2766740319","https://openalex.org/W2106457067","https://openalex.org/W1513944945"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}