{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T15:43:27Z","timestamp":1725637407629},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642258695"},{"type":"electronic","value":"9783642258701"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-25870-1_26","type":"book-chapter","created":{"date-parts":[[2011,11,30]],"date-time":"2011-11-30T08:32:45Z","timestamp":1322641965000},"page":"283-294","source":"Crossref","is-referenced-by-count":3,"title":["Hanani-Tutte and Monotone Drawings"],"prefix":"10.1007","author":[{"given":"Radoslav","family":"Fulek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael J.","family":"Pelsmajer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcus","family":"Schaefer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"\u0160tefankovi\u010d","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"26_CR1","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1002\/jgt.3190170308","volume":"17","author":"D. Bienstock","year":"1993","unstructured":"Bienstock, D., Dean, N.: Bounds for rectilinear crossing numbers. J. Graph Theory\u00a017(3), 333\u2013348 (1993)","journal-title":"J. Graph Theory"},{"issue":"2","key":"26_CR2","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/PL00009495","volume":"23","author":"G. Cairns","year":"2000","unstructured":"Cairns, G., Nikolayevsky, Y.: Bounds for generalized thrackles. Discrete Comput. Geom.\u00a023(2), 191\u2013206 (2000)","journal-title":"Discrete Comput. Geom."},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Di Battista, G., Nardelli, E.: Hierarchies and planarity theory. IEEE Trans. Systems Man Cybernet.\u00a018(6), 1035\u20131046 (1988, 1989)","DOI":"10.1109\/21.23105"},{"issue":"1","key":"26_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-004-1144-8","volume":"44","author":"P. Eades","year":"2006","unstructured":"Eades, P., Feng, Q., Lin, X., Nagamochi, H.: Straight-line drawing algorithms for hierarchical graphs and clustered graphs. Algorithmica\u00a044(1), 1\u201332 (2006)","journal-title":"Algorithmica"},{"key":"26_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-642-11805-0_9","volume-title":"Graph Drawing","author":"A. Estrella-Balderrama","year":"2010","unstructured":"Estrella-Balderrama, A., Fowler, J.J., Kobourov, S.G.: On the Characterization of Level Planar Trees by Minimal Patterns. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol.\u00a05849, pp. 69\u201380. Springer, Heidelberg (2010)"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Chojnacki, C., (Hanani, H.).: \u00dcber wesentlich unpl\u00e4ttbare Kurven im drei-dimensionalen Raume. Fundamenta Mathematicae\u00a023, 135\u2013142 (1934)","DOI":"10.4064\/fm-23-1-135-142"},{"issue":"1","key":"26_CR7","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/0095-8956(76)90032-0","volume":"21","author":"D.J. Kleitman","year":"1976","unstructured":"Kleitman, D.J.: A note on the parity of the number of crossings of a graph. J. Combinatorial Theory Ser. B\u00a021(1), 88\u201389 (1976)","journal-title":"J. Combinatorial Theory Ser. B"},{"issue":"3","key":"26_CR8","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1016\/S0304-3975(02)00031-2","volume":"292","author":"X. Lin","year":"2003","unstructured":"Lin, X., Eades, P.: Towards area requirements for drawing hierarchically planar graphs. Theor. Comput. Sci.\u00a0292(3), 679\u2013695 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"#cr-split#-26_CR9.1","unstructured":"Matou\u0161ek, J.: Using the Borsuk-Ulam theorem. Universitext. Springer, Berlin (2003);"},{"key":"#cr-split#-26_CR9.2","unstructured":"Lectures on topological methods in combinatorics and geometry, Written in cooperation with Anders Bj\u00f6rner and G\u00fcnter M. Ziegler"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Matousek, J., Tancer, M., Wagner, U.: Hardness of embedding simplicial complexes in \u211d d . In: Mathieu, C. (ed.) Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, pp. 855\u2013864. SIAM (2009)","DOI":"10.1137\/1.9781611973068.93"},{"issue":"2","key":"26_CR11","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1006\/jctb.2000.1978","volume":"80","author":"J. Pach","year":"2000","unstructured":"Pach, J., T\u00f3th, G.: Which crossing number is it anyway? J. Combin. Theory Ser. B\u00a080(2), 225\u2013246 (2000)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1","key":"26_CR12","doi-asserted-by":"publisher","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 Theory\u00a046(1), 39\u201347 (2004)","journal-title":"J. Graph Theory"},{"key":"26_CR13","unstructured":"Pach, J., T\u00f3th Monotone, G.: Drawings of planar graphs. ArXiv e-prints (January 2011)"},{"key":"26_CR14","unstructured":"Pach, J., T\u00f3th, G.: Monotone crossing number. In: Graph Drawing (to appear, 2011)"},{"issue":"4","key":"26_CR15","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1016\/j.jctb.2006.08.001","volume":"97","author":"M.J. Pelsmajer","year":"2007","unstructured":"Pelsmajer, M.J., Schaefer, M., \u0160tefankovi\u010d, D.: Removing even crossings. J. Combin. Theory Ser. B\u00a097(4), 489\u2013500 (2007)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1","key":"26_CR16","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/s00454-008-9058-x","volume":"39","author":"M.J. Pelsmajer","year":"2008","unstructured":"Pelsmajer, M.J., Schaefer, M., \u0160tefankovi\u010d, D.: Odd crossing number and crossing number are not the same. Discrete Comput. Geom.\u00a039(1), 442\u2013454 (2008)","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"26_CR17","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1137\/090765729","volume":"24","author":"M.J. Pelsmajer","year":"2010","unstructured":"Pelsmajer, M.J., Schaefer, M., \u0160tefankovi\u010d, D.: Removing independently even crossings. SIAM Journal on Discrete Mathematics\u00a024(2), 379\u2013393 (2010)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"26_CR18","unstructured":"Schaefer, M.: Hanani-Tutte and related results. To appear in Bolyai Memorial Volume"},{"key":"26_CR19","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/S0021-9800(70)80007-2","volume":"8","author":"W.T. Tutte","year":"1970","unstructured":"Tutte, W.T.: Toward a theory of crossing numbers. J. Combinatorial Theory\u00a08, 45\u201353 (1970)","journal-title":"J. Combinatorial Theory"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25870-1_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T00:04:44Z","timestamp":1560989084000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25870-1_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642258695","9783642258701"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25870-1_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}