{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:16:47Z","timestamp":1763468207358,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662439470"},{"type":"electronic","value":"9783662439487"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43948-7_44","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T16:10:36Z","timestamp":1402503036000},"page":"525-537","source":"Crossref","is-referenced-by-count":2,"title":["Improved Submatrix Maximum Queries in Monge Matrices"],"prefix":"10.1007","author":[{"given":"Pawe\u0142","family":"Gawrychowski","sequence":"first","affiliation":[]},{"given":"Shay","family":"Mozes","sequence":"additional","affiliation":[]},{"given":"Oren","family":"Weimann","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"44_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0166-218X(90)90124-U","volume":"27","author":"A. Aggarwal","year":"1990","unstructured":"Aggarwal, A., Klawe, M.: Applications of generalized matrix searching to geometric algorithms. Discrete Appl. Math.\u00a027, 3\u201323 (1990)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"44_CR2","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/BF01840359","volume":"2","author":"A. Aggarwal","year":"1987","unstructured":"Aggarwal, A., Klawe, M.M., Moran, S., Shor, P., Wilber, R.: Geometric applications of a matrix-searching algorithm. Algorithmica\u00a02(1), 195\u2013208 (1987)","journal-title":"Algorithmica"},{"key":"44_CR3","doi-asserted-by":"crossref","unstructured":"Aggarwal, A., Park, J.: Notes on searching in multidimensional monotone arrays. In: 29th FOCS, pp. 497\u2013512 (1988)","DOI":"10.1109\/SFCS.1988.21966"},{"key":"44_CR4","doi-asserted-by":"crossref","unstructured":"Alstrup, S., Brodal, G.S., Rauhe, T.: New data structures for orthogonal range searching. In: 41st FOCS, pp. 198\u2013207 (2000)","DOI":"10.1109\/SFCS.2000.892088"},{"key":"44_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-540-73437-6_29","volume-title":"Combinatorial Pattern Matching","author":"A. Amir","year":"2007","unstructured":"Amir, A., Fischer, J., Lewenstein, M.: Two-dimensional range minimum queries. In: Ma, B., Zhang, K. (eds.) CPM 2007. LNCS, vol.\u00a04580, pp. 286\u2013294. Springer, Heidelberg (2007)"},{"key":"44_CR6","doi-asserted-by":"crossref","unstructured":"Borradaile, G., Klein, P.N., Mozes, S., Nussbaum, Y., Wulff-Nilsen, C.: Multiple-source multiple-sink maximum flow in directed planar graphs in near-linear time. In: 52nd FOCS, pp. 170\u2013179 (2011)","DOI":"10.1109\/FOCS.2011.73"},{"key":"44_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/978-3-642-33090-2_20","volume-title":"Algorithms \u2013 ESA 2012","author":"G.S. Brodal","year":"2012","unstructured":"Brodal, G.S., Davoodi, P., Lewenstein, M., Raman, R., Srinivasa Rao, S.: Two dimensional range minimum queries and fibonacci lattices. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol.\u00a07501, pp. 217\u2013228. Springer, Heidelberg (2012)"},{"key":"44_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-642-15781-3_15","volume-title":"Algorithms \u2013 ESA 2010","author":"G.S. Brodal","year":"2010","unstructured":"Brodal, G.S., Davoodi, P., Rao, S.S.: On space efficient two dimensional range minimum data structures. In: de Berg, M., Meyer, U. (eds.) ESA 2010, Part II. LNCS, vol.\u00a06347, pp. 171\u2013182. Springer, Heidelberg (2010)"},{"key":"44_CR9","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0166-218X(95)00103-X","volume":"70","author":"R.E. Burkard","year":"1996","unstructured":"Burkard, R.E., Klinz, B., Rudolf, R.: Perspectives of Monge properties in optimization. Discrete Appl. Math.\u00a070, 95\u2013161 (1996)","journal-title":"Discrete Appl. Math."},{"key":"44_CR10","doi-asserted-by":"crossref","unstructured":"Chan, T.M., Larsen, K.G., P\u01cetra\u015fcu, M.: Orthogonal range searching on the RAM. In: 27th SOCG, pp. 354\u2013363 (2011) (revisited)","DOI":"10.1145\/1998196.1998198"},{"key":"44_CR11","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1137\/0217026","volume":"17","author":"B. Chazelle","year":"1988","unstructured":"Chazelle, B.: A functional approach to data structures and its use in multidimensional searching. SICOMP\u00a017, 427\u2013462 (1988)","journal-title":"SICOMP"},{"key":"44_CR12","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF01840440","volume":"1","author":"B. Chazelle","year":"1986","unstructured":"Chazelle, B., Guibas, L.J.: Fractional cascading: I. A data structuring technique. Algorithmica\u00a01, 133\u2013162 (1986)","journal-title":"Algorithmica"},{"key":"44_CR13","doi-asserted-by":"crossref","unstructured":"Chazelle, B., Rosenberg, B.: Computing partial sums in multidimensional arrays. In: 5th SOCG, pp. 131\u2013139 (1989)","DOI":"10.1145\/73833.73848"},{"key":"44_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-642-02927-1_29","volume-title":"Automata, Languages and Programming","author":"E.D. Demaine","year":"2009","unstructured":"Demaine, E.D., Landau, G.M., Weimann, O.: On cartesian trees and range minimum queries. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part I. LNCS, vol.\u00a05555, pp. 341\u2013353. Springer, Heidelberg (2009)"},{"key":"44_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-642-31594-7_28","volume-title":"Automata, Languages, and Programming","author":"A. Farzan","year":"2012","unstructured":"Farzan, A., Munro, J.I., Raman, R.: Succinct indices for range queries with applications to orthogonal range maxima. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part I. LNCS, vol.\u00a07391, pp. 327\u2013338. Springer, Heidelberg (2012)"},{"issue":"3","key":"44_CR16","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/S0022-0000(05)80064-9","volume":"48","author":"M.L. Fredman","year":"1994","unstructured":"Fredman, M.L., Willard, D.E.: Trans-dichotomous algorithms for minimum spanning trees and shortest paths. J. Comput. Syst. Sci.\u00a048(3), 533\u2013551 (1994)","journal-title":"J. Comput. Syst. Sci."},{"key":"44_CR17","doi-asserted-by":"crossref","unstructured":"Gabow, H., Bentley, J.L., Tarjan, R.E.: Scaling and related techniques for geometry problems. In: 16th STOC, pp. 135\u2013143 (1984)","DOI":"10.1145\/800057.808675"},{"key":"44_CR18","doi-asserted-by":"crossref","unstructured":"Gawrychowski, P., Mozes, S., Weimann, O.: Improved submatrix maximum queries in Monge matrices. arXiv:1307.2313 (2013)","DOI":"10.1007\/978-3-662-43948-7_44"},{"issue":"2","key":"44_CR19","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D. Harel","year":"1984","unstructured":"Harel, D., Tarjan, R.E.: Fast algorithms for finding nearest common ancestors. SICOMP\u00a013(2), 338\u2013355 (1984)","journal-title":"SICOMP"},{"key":"44_CR20","doi-asserted-by":"crossref","unstructured":"Hoffman, A.J.: On simple linear programming problems. In: Proc. Symp. Pure Math., vol.\u00a0VII, pp. 317\u2013327. Amer. Math. Soc. (1963)","DOI":"10.1090\/pspum\/007\/0157778"},{"key":"44_CR21","doi-asserted-by":"crossref","unstructured":"Kaplan, H., Mozes, S., Nussbaum, Y., Sharir, M.: Submatrix maximum queries in monge matrices and monge partial matrices, and their applications. In: 23rd SODA, pp. 338\u2013355 (2012)","DOI":"10.1137\/1.9781611973099.31"},{"key":"44_CR22","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1137\/0403009","volume":"3","author":"M.M. Klawe","year":"1990","unstructured":"Klawe, M.M., Kleitman, D.J.: An almost linear time algorithm for generalized matrix searching. SIAM J. Discrete Math.\u00a03, 81\u201397 (1990)","journal-title":"SIAM J. Discrete Math."},{"key":"44_CR23","unstructured":"Monge, G.: M\u00e9moire sur la th\u00e9orie des d\u00e9blais et des remblais. In: Histoire de l\u2019Acad\u00e9mie Royale des Science, pp. 666\u2013704 (1781)"},{"issue":"4","key":"44_CR24","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1016\/j.comgeo.2008.09.001","volume":"42","author":"Y. Nekrich","year":"2009","unstructured":"Nekrich, Y.: Orthogonal range searching in linear and almost-linear space. Comput. Geom.\u00a042(4), 342\u2013351 (2009)","journal-title":"Comput. Geom."},{"issue":"5","key":"44_CR25","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0020-0190(91)90118-2","volume":"40","author":"J.K. Park","year":"1991","unstructured":"Park, J.K.: A special case of the n-vertex traveling-salesman problem that can be solved in O(n) time. Inf. Process. Lett.\u00a040(5), 247\u2013254 (1991)","journal-title":"Inf. Process. Lett."},{"key":"44_CR26","volume-title":"Davenport-Schinzel sequences and their geometric applications","author":"M. Sharir","year":"1995","unstructured":"Sharir, M., Agarwal, P.K.: Davenport-Schinzel sequences and their geometric applications. Cambridge University Press, New York (1995)"},{"key":"44_CR27","doi-asserted-by":"crossref","unstructured":"Tiskin, A.: Fast distance multiplication of unit-monge matrices. In: 21st SODA, pp. 1287\u20131296 (2010)","DOI":"10.1137\/1.9781611973075.103"},{"key":"44_CR28","doi-asserted-by":"crossref","unstructured":"Yuan, H., Atallah, M.J.: Data structures for range minimum queries in multidimensional arrays. In: 21st SODA, pp. 150\u2013160 (2010)","DOI":"10.1137\/1.9781611973075.14"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43948-7_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T09:31:01Z","timestamp":1746264661000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43948-7_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439470","9783662439487"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43948-7_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}