{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T18:36:28Z","timestamp":1770921388250,"version":"3.50.1"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032178008","type":"print"},{"value":"9783032178015","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-17801-5_2","type":"book-chapter","created":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T17:52:59Z","timestamp":1770918779000},"page":"16-30","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Solutions to\u00a0Variants of\u00a0Inversion Problems of\u00a0Range Minimum Queries"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-8288-7280","authenticated-orcid":false,"given":"Souta","family":"Kobayashi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8721-4444","authenticated-orcid":false,"given":"Dominik","family":"K\u00f6ppl","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5175-465X","authenticated-orcid":false,"given":"Ryo","family":"Yoshinaka","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4978-8316","authenticated-orcid":false,"given":"Ayumi","family":"Shinohara","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,2,13]]},"reference":[{"key":"2_CR1","volume-title":"The design and analysis of computer algorithms","author":"AV Aho","year":"1974","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The design and analysis of computer algorithms. Addison-Wesley Series in Computer Science and Information Processing, Addison-Wesley, Reading, Massachusetts (1974)"},{"key":"2_CR2","unstructured":"Alba, D.E., Leal, J.A.R.: Algorithms for competitive programming. DND Learning (2023). https:\/\/books.google.co.jp\/books?id=Uhz50AEACAAJ"},{"issue":"3","key":"2_CR3","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/S00224-004-1155-5","volume":"37","author":"S Alstrup","year":"2004","unstructured":"Alstrup, S., Gavoille, C., Kaplan, H., Rauhe, T.: Nearest common ancestors: a survey and a new algorithm for a distributed environment. Theory Comput. Syst. 37(3), 441\u2013456 (2004). https:\/\/doi.org\/10.1007\/S00224-004-1155-5","journal-title":"Theory Comput. Syst."},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF00383170","volume":"7","author":"MD Atkinson","year":"1990","unstructured":"Atkinson, M.D.: On computing the number of linear extensions of a tree. Order 7, 23\u201325 (1990). https:\/\/doi.org\/10.1007\/BF00383170","journal-title":"Order"},{"issue":"2","key":"2_CR5","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.jalgor.2005.08.001","volume":"57","author":"MA Bender","year":"2005","unstructured":"Bender, M.A., Farach-Colton, M., Pemmasani, G., Skiena, S., Sumazin, P.: Lowest common ancestors in trees and directed acyclic graphs. J. Algorithms 57(2), 75\u201394 (2005). https:\/\/doi.org\/10.1016\/j.jalgor.2005.08.001","journal-title":"J. Algorithms"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"de\u00a0Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational geometry: algorithms and applications. Springer (2008). https:\/\/books.google.de\/books?id=tkyG8W2163YC","DOI":"10.1007\/978-3-540-77974-2"},{"issue":"2","key":"2_CR7","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1137\/0222017","volume":"22","author":"O Berkman","year":"1993","unstructured":"Berkman, O., Vishkin, U.: Recursive star-tree parallel data structure. SIAM J. Comput. 22(2), 221\u2013242 (1993). https:\/\/doi.org\/10.1137\/0222017","journal-title":"SIAM J. Comput."},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/BF00383444","volume":"8","author":"G Brightwell","year":"1991","unstructured":"Brightwell, G., Winkler, P.: Counting linear extensions. Order 8, 225\u2013242 (1991). https:\/\/doi.org\/10.1007\/BF00383444","journal-title":"Order"},{"key":"2_CR9","doi-asserted-by":"publisher","unstructured":"Fischer, J., Heun, V.: Theoretical and practical improvements on the RMQ-problem, with applications to LCA and LCE. In: Lewenstein, M., Valiente, G. (eds.) Combinatorial Pattern Matching, pp. 36\u201348. Springer Berlin Heidelberg, Berlin, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11780441_5","DOI":"10.1007\/11780441_5"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/978-3-540-74450-4_41","volume-title":"Combinatorics, Algorithms, Probabilistic and Experimental Methodologies","author":"J Fischer","year":"2007","unstructured":"Fischer, J., Heun, V.: A new succinct representation of RMQ-information and improvements in the enhanced suffix array. In: Chen, B., Paterson, M., Zhang, G. (eds.) ESCAPE 2007. LNCS, vol. 4614, pp. 459\u2013470. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74450-4_41"},{"key":"2_CR11","doi-asserted-by":"publisher","unstructured":"Gabow, H.N., Bentley, J.L., Tarjan, R.E.: Scaling and related techniques for geometry problems. In: DeMillo, R.A. (ed.) Proc. STOC, pp. 135\u2013143. ACM (1984).https:\/\/doi.org\/10.1145\/800057.808675","DOI":"10.1145\/800057.808675"},{"issue":"2","key":"2_CR12","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0022-0000(85)90014-5","volume":"30","author":"HN Gabow","year":"1985","unstructured":"Gabow, H.N., Tarjan, R.E.: A linear-time algorithm for a special case of disjoint set union. J. Comput. Syst. Sci. 30(2), 209\u2013221 (1985). https:\/\/doi.org\/10.1016\/0022-0000(85)90014-5","journal-title":"J. Comput. Syst. Sci."},{"key":"2_CR13","doi-asserted-by":"publisher","unstructured":"M\u00f6hring, R.H.: Computationally tractable classes of ordered sets. In: Rival, I. (ed.) Algorithms and Order, NATO ASI Series C: Mathematical and Physical Sciences, vol.\u00a0255, pp. 105\u2013193. Springer, Dordrecht (1989). https:\/\/doi.org\/10.1007\/978-94-009-2639-4_4","DOI":"10.1007\/978-94-009-2639-4_4"},{"key":"2_CR14","doi-asserted-by":"publisher","unstructured":"Ono, A., Nakano, S.i.: Constant time generation of linear extensions. In: Li\u015bkiewicz, M., Reischuk, R. (eds.) Fundamentals of Computation Theory, pp. 445\u2013453. Springer, Berlin, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11537311_39","DOI":"10.1007\/11537311_39"},{"issue":"1","key":"2_CR15","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/J.JDA.2006.03.011","volume":"5","author":"K Sadakane","year":"2007","unstructured":"Sadakane, K.: Succinct data structures for flexible text retrieval systems. J. Discrete Algorithms 5(1), 12\u201322 (2007). https:\/\/doi.org\/10.1016\/J.JDA.2006.03.011","journal-title":"J. Discrete Algorithms"},{"issue":"2","key":"2_CR16","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1145\/321879.321884","volume":"22","author":"RE Tarjan","year":"1975","unstructured":"Tarjan, R.E.: Efficiency of a good but not linear set union algorithm. J. ACM 22(2), 215\u2013225 (1975). https:\/\/doi.org\/10.1145\/321879.321884","journal-title":"J. ACM"},{"key":"2_CR17","doi-asserted-by":"publisher","unstructured":"Uno, T.: A fast algorithm for enumerating bipartite perfect matchings. In: Eades, P., Takaoka, T. (eds.) Algorithms and Computation (ISAAC 2001), pp. 367\u2013379. Springer, Berlin, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45678-3_32","DOI":"10.1007\/3-540-45678-3_32"},{"key":"2_CR18","unstructured":"Inverse range minimum query. https:\/\/eolymp.com\/en\/problems\/3080, Accessed 01 Dec 2025"},{"key":"2_CR19","unstructured":"No.1675 Strange Minimum Query. https:\/\/yukicoder.me\/problems\/no\/1675, Accessed 27 Nov 2025"},{"key":"2_CR20","unstructured":"No.1675 Strange Minimum Query kaisetsu (editorial). https:\/\/yukicoder.me\/problems\/no\/1675\/editorial, Accessed 27 Nov 2025"},{"key":"2_CR21","unstructured":"Nordic Olympiad in Informatics. https:\/\/nordic.progolymp.se\/, Accessed 27 Nov 2025"},{"key":"2_CR22","unstructured":"xiaoliebao1115: P11505 [nordicoi 2018] mysterious array. https:\/\/www.luogu.com.cn\/article\/j9714zmg (2025), Accessed 27 Nov 2025"},{"key":"2_CR23","unstructured":"The Singapore National Olympiad in Informatics. https:\/\/noisg.comp.nus.edu.sg\/, problem archive available at https:\/\/github.com\/noisg\/sg_noi_archive, Accessed 27 Nov 2025"},{"key":"2_CR24","unstructured":"https:\/\/github.com\/noisg\/sg_noi_archive\/blob\/master\/2017\/solution_writeup\/NOI2017_solutions.pdf , Accessed 01 Dec 2025"},{"key":"2_CR25","unstructured":"Haybale guessing. https:\/\/www.acmicpc.net\/problem\/6153, originally USACO 2008 January Contest, Gold Division; Accessed 27 Nov 2025"},{"key":"2_CR26","unstructured":"[ P2898][USACO08JAN] Haybale Guessing Haybale Guessing. https:\/\/www.programmersought.com\/article\/60757109923\/, Accessed 01 Dec 2025"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2026: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-17801-5_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T17:53:02Z","timestamp":1770918782000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-17801-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032178008","9783032178015"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-17801-5_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"13 February 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Krakow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 February 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 February 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"51","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sofsem.uj.edu.pl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}