{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T06:18:55Z","timestamp":1725862735316},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319445427"},{"type":"electronic","value":"9783319445434"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-44543-4_32","type":"book-chapter","created":{"date-parts":[[2016,8,8]],"date-time":"2016-08-08T11:49:58Z","timestamp":1470656998000},"page":"411-422","source":"Crossref","is-referenced-by-count":1,"title":["Monotone Paths in Geometric Triangulations"],"prefix":"10.1007","author":[{"given":"Adrian","family":"Dumitrescu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ritankar","family":"Mandal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Csaba D.","family":"T\u00f3th","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,9]]},"reference":[{"key":"32_CR1","first-page":"9","volume":"12","author":"M Ajtai","year":"1982","unstructured":"Ajtai, M., Chv\u00e0tal, V., Newborn, M., Szemer\u00e8di, E.: Crossing-free subgraphs. Ann. Discrete Math. 12, 9\u201312 (1982)","journal-title":"Ann. Discrete Math."},{"key":"32_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry: Algorithms and Applications","author":"M Berg de","year":"2008","unstructured":"de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer, Heidelberg (2008)","edition":"3"},{"key":"32_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/978-3-540-73545-8_12","volume-title":"Computing and Combinatorics","author":"K Buchin","year":"2007","unstructured":"Buchin, K., Knauer, C., Kriegel, K., Schulz, A., Seidel, R.: On the number of cycles in planar graphs. COCOON 2007. LNCS, vol. 4598, pp. 97\u2013107. Springer, Heidelberg (2007)"},{"issue":"3","key":"32_CR4","doi-asserted-by":"crossref","first-page":"923","DOI":"10.1007\/s00373-015-1621-7","volume":"32","author":"A Dumitrescu","year":"2016","unstructured":"Dumitrescu, A., L\u00f6ffler, M., Schulz, A., T\u00f3th, C.D.: Counting carambolas. Graphs Combin. 32(3), 923\u2013942 (2016)","journal-title":"Graphs Combin."},{"key":"32_CR5","series-title":"Fields Institute Communications","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/978-3-319-00200-2_6","volume-title":"Discrete Geometry and Optimization","author":"A Dumitrescu","year":"2013","unstructured":"Dumitrescu, A., Rote, G., T\u00f3th, C.D.: Monotone paths in planar convex subdivisions and polytopes. In: Bezdek, K., Deza, A., Ye, Y. (eds.) Discrete Geometry and Optimization. Fields Institute Communications, vol. 69, pp. 79\u2013104. Springer, Cham (2013)"},{"issue":"2","key":"32_CR6","doi-asserted-by":"crossref","first-page":"802","DOI":"10.1137\/110849407","volume":"27","author":"A Dumitrescu","year":"2013","unstructured":"Dumitrescu, A., Schulz, A., Sheffer, A., T\u00f3th, C.D.: Bounds on the maximum multiplicity of some common geometric graphs. SIAM J. Discrete Math. 27(2), 802\u2013826 (2013)","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"32_CR7","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1145\/2421119.2421136","volume":"43","author":"A Dumitrescu","year":"2012","unstructured":"Dumitrescu, A., T\u00f3th, C.D.: Computational geometry column 54. SIGACT News Bull. 43(4), 90\u201397 (2012)","journal-title":"SIGACT News Bull."},{"key":"32_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/978-3-319-21840-3_24","volume-title":"Algorithms and Data Structures","author":"A Dumitrescu","year":"2015","unstructured":"Dumitrescu, A., T\u00f3th, C.D.: Convex polygons in geometric triangulations. In: Dehne, F., Sack, J.R., Stege, U. (eds.) WADS 2015. LNCS, vol. 9214, pp. 289\u2013300. Springer, Cham (2015)"},{"issue":"4","key":"32_CR9","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/S0925-7721(00)00010-9","volume":"16","author":"A Garc\u00eda","year":"2000","unstructured":"Garc\u00eda, A., Noy, M., Tejel, A.: Lower bounds on the number of crossing-free subgraphs of $$K_N$$ . Comput. Geom. 16(4), 211\u2013221 (2000)","journal-title":"Comput. Geom."},{"issue":"1","key":"32_CR10","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1137\/05062370X","volume":"21","author":"B G\u00e4rtner","year":"2007","unstructured":"G\u00e4rtner, B., Kaibel, V.: Two new bounds for the random-edge simplex-algorithm. SIAM J. Discrete Math. 21(1), 178\u2013190 (2007)","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"32_CR11","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1137\/S0097539703434978","volume":"34","author":"V Kaibel","year":"2005","unstructured":"Kaibel, V., Mechtel, R., Sharir, M., Ziegler, G.M.: The simplex algorithm in dimension three. SIAM J. Comput. 34(2), 475\u2013497 (2005)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"32_CR12","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/BF02293053","volume":"8","author":"G Kalai","year":"1992","unstructured":"Kalai, G.: Upper bounds for the diameter and height of graphs of convex polyhedra. Discrete Comput. Geom. 8(4), 363\u2013372 (1992)","journal-title":"Discrete Comput. Geom."},{"key":"32_CR13","first-page":"455","volume-title":"Handbook of Discrete and Computational Geometry","author":"G Kalai","year":"2004","unstructured":"Kalai, G.: Polytope skeletons and paths. In: O\u2019Rourke, J., Goodman, J.E. (eds.) Handbook of Discrete and Computational Geometry, pp. 455\u2013476. CRC Press, Boca Raton (2004)"},{"issue":"4","key":"32_CR14","first-page":"946","volume":"13","author":"V Klee","year":"1965","unstructured":"Klee, V.: Paths on polyhedra I. J. SIAM 13(4), 946\u2013956 (1965)","journal-title":"J. SIAM"},{"key":"32_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1007\/978-3-642-35261-4_20","volume-title":"Algorithms and Computation","author":"M Kreveld van","year":"2012","unstructured":"van Kreveld, M., L\u00f6ffler, M., Pach, J.: How many potatoes are in a mesh? ISAAC 2012. LNCS, vol. 7676, pp. 166\u2013176. Springer, Heidelberg (2012)"},{"issue":"1","key":"32_CR16","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1016\/j.aim.2005.05.021","volume":"204","author":"J Matou\u0161ek","year":"2006","unstructured":"Matou\u0161ek, J., Szab\u00f3, T.: RANDOM EDGE can be exponential on abstract cubes. Adv. Math. 204(1), 262\u2013277 (2006)","journal-title":"Adv. Math."},{"key":"32_CR17","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1002\/jgt.10168","volume":"46","author":"J Pach","year":"2004","unstructured":"Pach, J., T\u00f3th, G.: Monotone drawings of planar graphs. J. Graph Theor. 46, 39\u201347 (2004). Corrected version: arXiv:1101.0967 (2011)","journal-title":"J. Graph Theor."},{"key":"32_CR18","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/j.endm.2008.06.039","volume":"31","author":"A Razen","year":"2008","unstructured":"Razen, A., Snoeyink, J., Welzl, E.: Number of crossing-free geometric graphs vs. triangulations. Electron. Notes Discrete Math. 31, 195\u2013200 (2008)","journal-title":"Electron. Notes Discrete Math."},{"issue":"1","key":"32_CR19","doi-asserted-by":"crossref","first-page":"383","DOI":"10.4007\/annals.2012.176.1.7","volume":"176","author":"F Santos","year":"2012","unstructured":"Santos, F.: A counterexample to the Hirsch conjecture. Ann. Math. 176(1), 383\u2013412 (2012)","journal-title":"Ann. Math."},{"key":"32_CR20","doi-asserted-by":"crossref","first-page":"P70","DOI":"10.37236\/557","volume":"18","author":"M Sharir","year":"2011","unstructured":"Sharir, M., Sheffer, A.: Counting triangulations of planar point sets. Electron. J. Combin. 18, P70 (2011)","journal-title":"Electron. J. Combin."},{"issue":"6","key":"32_CR21","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1017\/S096354831300031X","volume":"22","author":"M Sharir","year":"2013","unstructured":"Sharir, M., Sheffer, A.: Counting plane graphs: cross-graph charging schemes. Combin. Probab. Comput. 22(6), 935\u2013954 (2013)","journal-title":"Combin. Probab. Comput."},{"issue":"4","key":"32_CR22","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1016\/j.jcta.2013.01.002","volume":"120","author":"M Sharir","year":"2013","unstructured":"Sharir, M., Sheffer, A., Welzl, E.: Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn\u2019s technique. J. Combin. Theor. Ser. A 120(4), 777\u2013794 (2013)","journal-title":"J. Combin. Theor. Ser. A"},{"issue":"3","key":"32_CR23","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1137\/050636036","volume":"36","author":"M Sharir","year":"2006","unstructured":"Sharir, M., Welzl, E.: On the number of crossing-free matchings, cycles, and partitions. SIAM J. Comput. 36(3), 695\u2013720 (2006)","journal-title":"SIAM J. Comput."},{"key":"32_CR24","unstructured":"Sheffer, A.: Numbers of plane graphs (2016). https:\/\/adamsheffer.wordpress.com\/numbers-of-plane-graphs\/"},{"issue":"4","key":"32_CR25","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1287\/moor.5.4.599","volume":"5","author":"MJ Todd","year":"1980","unstructured":"Todd, M.J.: The monotonic bounded Hirsch conjecture is false for dimension at least 4. Math. Oper. Res. 5(4), 599\u2013601 (1980)","journal-title":"Math. Oper. Res."},{"key":"32_CR26","series-title":"Graduate Texts in Mathematics","first-page":"83","volume-title":"Lectures on Polytopes","author":"GM Ziegler","year":"1994","unstructured":"Ziegler, G.M.: Lectures on Polytopes. GTM, vol. 152, pp. 83\u201393. Springer, New York (1994)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44543-4_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,24]],"date-time":"2020-09-24T22:37:12Z","timestamp":1600987032000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44543-4_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319445427","9783319445434"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44543-4_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}