{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T04:28:31Z","timestamp":1777868911025,"version":"3.51.4"},"reference-count":45,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100004281","name":"National Science Centre Poland","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004281","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1016\/j.tcs.2026.115850","type":"journal-article","created":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T07:44:40Z","timestamp":1772005480000},"page":"115850","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Searching in trees with monotonic query times"],"prefix":"10.1016","volume":"1071","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4000-4818","authenticated-orcid":false,"given":"Dariusz","family":"Dereniowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0292-0479","authenticated-orcid":false,"given":"Izajasz","family":"Wrosz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.115850_bib0001","series-title":"MFCS 2022","first-page":"42:1","article-title":"Constant-factor approximation algorithm for binary search in trees with monotonic query times","author":"Dereniowski","year":"2022"},{"key":"10.1016\/j.tcs.2026.115850_bib0002","series-title":"The Art of Computer Programming, Volume III: Sorting and Searching","author":"Knuth","year":"1973"},{"key":"10.1016\/j.tcs.2026.115850_bib0003","series-title":"Icalp 2023","first-page":"26:1","article-title":"The geometry of tree-based sorting","author":"Blelloch","year":"2023"},{"key":"10.1016\/j.tcs.2026.115850_bib0004","series-title":"Artificial Intelligence - a Modern Approach, Third International Edition","author":"Russell","year":"2010"},{"issue":"1","key":"10.1016\/j.tcs.2026.115850_bib0005","first-page":"1","article-title":"SEARCH GAMES: LITERATURE AND SURVEY","volume":"59","author":"Hohzaki","year":"2016","journal-title":"J. Oper. Res. Soc. Jpn."},{"issue":"9","key":"10.1016\/j.tcs.2026.115850_bib0006","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1145\/3434642","article-title":"The future is big graphs: a community view on graph processing systems","volume":"64","author":"Sakr","year":"2021","journal-title":"Commun. ACM."},{"issue":"3","key":"10.1016\/j.tcs.2026.115850_bib0007","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/j.ipl.2005.12.006","article-title":"Vertex rankings of chordal graphs and weighted trees","volume":"98","author":"Dereniowski","year":"2006","journal-title":"Inf. Process. Lett."},{"issue":"13","key":"10.1016\/j.tcs.2026.115850_bib0008","doi-asserted-by":"crossref","first-page":"2493","DOI":"10.1016\/j.dam.2008.03.007","article-title":"Edge ranking and searching in partial orders","volume":"156","author":"Dereniowski","year":"2008","journal-title":"Discret. Appl. Math."},{"key":"10.1016\/j.tcs.2026.115850_bib0009","series-title":"PPAM 2003","first-page":"985","article-title":"Cholesky factorization of matrices in parallel and ranking of graphs","author":"Dereniowski","year":"2003"},{"issue":"2","key":"10.1016\/j.tcs.2026.115850_bib0010","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1006\/jagm.2000.1143","article-title":"On minimum edge ranking spanning trees","volume":"38","author":"Makino","year":"2001","journal-title":"J. Algorithms."},{"issue":"2","key":"10.1016\/j.tcs.2026.115850_bib0011","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0020-0190(92)90017-P","article-title":"On a graph partition problem with application to VLSI layout","volume":"43","author":"Arunabha","year":"1992","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.tcs.2026.115850_bib0012","series-title":"Nips 2017","first-page":"7082","article-title":"A general framework for robust interactive learning","author":"Emamjomeh-Zadeh","year":"2017"},{"key":"10.1016\/j.tcs.2026.115850_bib0013","series-title":"ALT 2020","first-page":"277","article-title":"Interactive learning of a dynamic structure","author":"Emamjomeh-Zadeh","year":"2020"},{"issue":"6","key":"10.1016\/j.tcs.2026.115850_bib0014","doi-asserted-by":"crossref","first-page":"2090","DOI":"10.1137\/S009753979731858X","article-title":"Optimal search in trees","volume":"28","author":"Ben-Asher","year":"1999","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/j.tcs.2026.115850_bib0015","doi-asserted-by":"crossref","first-page":"15:1","DOI":"10.1145\/3448305","article-title":"Navigating in trees with permanently noisy advice","volume":"17","author":"Boczkowski","year":"2021","journal-title":"ACM Trans. Algorithms."},{"key":"10.1016\/j.tcs.2026.115850_bib0016","series-title":"STOC 1987","first-page":"305","article-title":"A model for hierarchical memory","author":"Aggarwal","year":"1987"},{"issue":"2","key":"10.1016\/j.tcs.2026.115850_bib0017","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/s004530010010","article-title":"Binary searching with nonuniform costs and its application to text retrieval","volume":"27","author":"Navarro","year":"2000","journal-title":"Algorithmica."},{"key":"10.1016\/j.tcs.2026.115850_bib0018","article-title":"Shortest path queries, graph partitioning, and covering problems in worst and beyond worst case settings","volume":"abs\/1807.09389","author":"Angelidakis","year":"2018","journal-title":"CoRR."},{"key":"10.1016\/j.tcs.2026.115850_bib0019","series-title":"FCT 2021","first-page":"100","article-title":"The complexity of bicriteria tree-depth","author":"Borowiecki","year":"2021"},{"key":"10.1016\/j.tcs.2026.115850_bib0020","series-title":"WADS 2011","first-page":"255","article-title":"Binary identification problems for weighted trees","author":"Cicalese","year":"2011"},{"key":"10.1016\/j.tcs.2026.115850_bib0021","series-title":"SODA 1998","first-page":"436","article-title":"Optimal edge ranking of trees in linear time","author":"Lam","year":"1998"},{"key":"10.1016\/j.tcs.2026.115850_bib0022","series-title":"SODA 2008","first-page":"1096","article-title":"Finding an optimal tree searching strategy in linear time","author":"Mozes","year":"2008"},{"key":"10.1016\/j.tcs.2026.115850_bib0023","series-title":"Icalp 2017","first-page":"84:1","article-title":"Approximation strategies for generalized binary search in weighted trees","author":"Dereniowski","year":"2017"},{"issue":"15","key":"10.1016\/j.tcs.2026.115850_bib0024","doi-asserted-by":"crossref","first-page":"2089","DOI":"10.1016\/j.dam.2012.03.015","article-title":"LIFO-Search: a min-max theorem and a searching game for cycle-rank and tree-depth","volume":"160","author":"Giannopoulou","year":"2012","journal-title":"Discrete Appl. Math."},{"issue":"1\u20133","key":"10.1016\/j.tcs.2026.115850_bib0025","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0012-365X(93)E0216-Q","article-title":"Ordered colourings","volume":"142","author":"Katchalski","year":"1995","journal-title":"Discret. Math."},{"key":"10.1016\/j.tcs.2026.115850_bib0026","series-title":"WG 1991","first-page":"1","article-title":"Approximating treewidth, pathwidth, and minimum elimination tree height","author":"Bodlaender","year":"1991"},{"issue":"5","key":"10.1016\/j.tcs.2026.115850_bib0027","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0020-0190(88)90194-9","article-title":"Optimal node ranking of trees","volume":"28","author":"Iyer","year":"1988","journal-title":"Inf. Process. Lett."},{"issue":"6","key":"10.1016\/j.tcs.2026.115850_bib0028","doi-asserted-by":"crossref","first-page":"1022","DOI":"10.1016\/j.ejc.2005.01.010","article-title":"Tree-depth, subgraph coloring and homomorphism bounds","volume":"27","author":"Ne\u0161et\u0159il","year":"2006","journal-title":"Eur. J. Comb."},{"issue":"1","key":"10.1016\/j.tcs.2026.115850_bib0029","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0166-218X(91)90012-L","article-title":"On an edge ranking problem of trees and graphs","volume":"30","author":"Iyer","year":"1991","journal-title":"Discret. Appl. Math."},{"key":"10.1016\/j.tcs.2026.115850_bib0030","series-title":"Focs 2006","first-page":"379","article-title":"Generalization of binary search: searching in trees and forest-like partial orders","author":"Onak","year":"2006"},{"issue":"8","key":"10.1016\/j.tcs.2026.115850_bib0031","doi-asserted-by":"crossref","first-page":"1198","DOI":"10.1016\/j.dam.2005.11.005","article-title":"Edge ranking of weighted trees","volume":"154","author":"Dereniowski","year":"2006","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"10.1016\/j.tcs.2026.115850_bib0032","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0020-0190(89)90161-0","article-title":"Optimal node ranking of trees in linear time","volume":"33","author":"Sch\u00e4ffer","year":"1989","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.tcs.2026.115850_bib0033","series-title":"STOC 2016","first-page":"519","article-title":"Deterministic and probabilistic binary search in graphs","author":"Emamjomeh-Zadeh","year":"2016"},{"key":"10.1016\/j.tcs.2026.115850_bib0034","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/j.tcs.2016.07.019","article-title":"On the tree search problem with non-uniform costs","volume":"647","author":"Cicalese","year":"2016","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"10.1016\/j.tcs.2026.115850_bib0035","doi-asserted-by":"crossref","first-page":"1022","DOI":"10.1137\/S0097539700381991","article-title":"On binary searching with nonuniform costs","volume":"31","author":"Laber","year":"2002","journal-title":"SIAM J. Comput."},{"issue":"16","key":"10.1016\/j.tcs.2026.115850_bib0036","doi-asserted-by":"crossref","first-page":"2402","DOI":"10.1016\/j.dam.2006.04.016","article-title":"NP-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem","volume":"154","author":"Miyata","year":"2006","journal-title":"Discret. Appl. Math."},{"issue":"6","key":"10.1016\/j.tcs.2026.115850_bib0037","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0020-0190(95)00172-7","article-title":"Generalized vertex-rankings of trees","volume":"56","author":"Zhou","year":"1995","journal-title":"Inf. Process. Lett."},{"issue":"1\u20132","key":"10.1016\/j.tcs.2026.115850_bib0038","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/S0304-3975(01)00303-6","article-title":"Searching games with errors \u2014 fifty years of coping with liars","volume":"270","author":"Pelc","year":"2002","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115850_bib0039","series-title":"SODA 2022","first-page":"1875","article-title":"Splay trees on trees","author":"Berendsohn","year":"2022"},{"issue":"4","key":"10.1016\/j.tcs.2026.115850_bib0040","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1007\/s00453-009-9325-0","article-title":"An approximation algorithm for binary searching in trees","volume":"59","author":"Laber","year":"2011","journal-title":"Algorithmica."},{"issue":"3","key":"10.1016\/j.tcs.2026.115850_bib0041","doi-asserted-by":"crossref","first-page":"273","DOI":"10.3233\/FUN-2006-69302","article-title":"Efficient parallel query processing by graph ranking","volume":"69","author":"Dereniowski","year":"2006","journal-title":"Fundam. Informaticae."},{"key":"10.1016\/j.tcs.2026.115850_bib0042","series-title":"WG 1996","first-page":"390","article-title":"Generalized edge-ranking of trees (extended abstract)","author":"Zhou","year":"1996"},{"issue":"5","key":"10.1016\/j.tcs.2026.115850_bib0043","doi-asserted-by":"crossref","first-page":"1757","DOI":"10.1007\/s00453-018-0501-y","article-title":"Binary search in graphs revisited","volume":"81","author":"Deligkas","year":"2019","journal-title":"Algorithmica."},{"key":"10.1016\/j.tcs.2026.115850_bib0044","series-title":"IWOCA 2021","first-page":"265","article-title":"An efficient noisy binary search in graphs via median approximation","author":"Dereniowski","year":"2021"},{"key":"10.1016\/j.tcs.2026.115850_bib0045","series-title":"SOSA@SODA 2019","first-page":"4:1","article-title":"A framework for searching in graphs in the presence of errors","author":"Dereniowski","year":"2019"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439752600109X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439752600109X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T12:51:41Z","timestamp":1777553501000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439752600109X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":45,"alternative-id":["S030439752600109X"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115850","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Searching in trees with monotonic query times","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115850","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"115850"}}