{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T03:34:51Z","timestamp":1772508891922,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,9,26]],"date-time":"2012-09-26T00:00:00Z","timestamp":1348617600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2013,1]]},"DOI":"10.1007\/s00454-012-9464-y","type":"journal-article","created":{"date-parts":[[2012,9,26]],"date-time":"2012-09-26T00:43:03Z","timestamp":1348620183000},"page":"74-88","source":"Crossref","is-referenced-by-count":6,"title":["A Center Transversal Theorem for Hyperplanes and Applications to Graph Drawing"],"prefix":"10.1007","volume":"49","author":[{"given":"Vida","family":"Dujmovi\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Langerman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,9,26]]},"reference":[{"key":"9464_CR1","series-title":"Wiley-Interscience Series in Discrete Mathematics and Optimization","volume-title":"Combinatorial Geometry","author":"P.K. Agarwal","year":"1995","unstructured":"Agarwal, P.K., Pach, J.: Combinatorial Geometry. Wiley-Interscience Series in Discrete Mathematics and Optimization (1995)"},{"key":"9464_CR2","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01215345","volume":"14","author":"B. Aronov","year":"1994","unstructured":"Aronov, B., Erd\u0151s, P., Goddard, W., Kleitman, D.J., Klugerman, M., Pach, J., Schulman, L.J.: Crossing families. Combinatorica 14, 127\u2013134 (1994)","journal-title":"Combinatorica"},{"key":"9464_CR3","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1007\/s00454-008-9125-3","volume":"42","author":"P. Bose","year":"2009","unstructured":"Bose, P., Dujmovi\u0107, V., Hurtado, F., Langerman, S., Morin, P., Wood, D.: A polynomial bound for untangling geometric planar graphs. Discrete Comput. Geom. 42, 570\u2013585 (2009)","journal-title":"Discrete Comput. Geom."},{"key":"9464_CR4","volume-title":"\u00c9l\u00e9ments de Math\u00e9matique. Alg\u00e8bre","author":"N. Bourbaki","year":"2007","unstructured":"Bourbaki, N.: \u00c9l\u00e9ments de Math\u00e9matique. Alg\u00e8bre. Springer, Berlin (2007), Chapitres\u00a01 \u00e0\u00a03"},{"issue":"3","key":"9464_CR5","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF02122778","volume":"10","author":"B. Chazelle","year":"1990","unstructured":"Chazelle, B., Friedman, J.: A deterministic view of random sampling and its use in geometry. Combinatorica 10(3), 229\u2013249 (1990)","journal-title":"Combinatorica"},{"issue":"4","key":"9464_CR6","doi-asserted-by":"crossref","first-page":"792","DOI":"10.1137\/0218055","volume":"18","author":"R. Cole","year":"1989","unstructured":"Cole, R., Salowe, J., Steiger, W., Szemer\u00e9di, E.: An optimal-time algorithm for slope selection. SIAM J. Comput. 18(4), 792\u2013810 (1989)","journal-title":"SIAM J. Comput."},{"key":"9464_CR7","first-page":"177","volume-title":"Proceedings of the 18th Symposium on Graph Drawing (GD\u201910)","author":"V. Dujmovi\u0107","year":"2011","unstructured":"Dujmovi\u0107, V., Evans, W., Kobourov, S.G., Liotta, G., Weibel, C., Wismath, S.: On graphs supported by line sets. In: Proceedings of the 18th Symposium on Graph Drawing (GD\u201910), vol.\u00a06502, pp.\u00a0177\u2013182 (2011)"},{"key":"9464_CR8","first-page":"426","volume-title":"Proceedings 20th Symposium on Theory of Computing (STOC)","author":"H. Fraysseix de","year":"1988","unstructured":"de Fraysseix, H., Pach, J., Pollack, R.: Small sets supporting Fary embeddings of planar graphs. In: Proceedings 20th Symposium on Theory of Computing (STOC), pp. 426\u2013433 (1988)"},{"issue":"1","key":"9464_CR9","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H. Fraysseix de","year":"1990","unstructured":"de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10(1), 41\u201351 (1990)","journal-title":"Combinatorica"},{"key":"9464_CR10","doi-asserted-by":"crossref","first-page":"771","DOI":"10.1007\/BF01236771","volume":"52","author":"V.L. Dol\u2019nikov","year":"1992","unstructured":"Dol\u2019nikov, V.L.: A generalization of the ham sandwich theorem. Math. Notes 52, 771\u2013779 (1992)","journal-title":"Math. Notes"},{"issue":"6\u20137","key":"9464_CR11","doi-asserted-by":"crossref","first-page":"704","DOI":"10.1016\/j.comgeo.2008.12.006","volume":"42","author":"A. Estrella-Balderrama","year":"2009","unstructured":"Estrella-Balderrama, A., Fowler, J.J., Kobourov, S.G.: Characterization of unlabeled level planar trees. Comput. Geom. Theory Appl. 42(6\u20137), 704\u2013721 (2009)","journal-title":"Comput. Geom. Theory Appl."},{"key":"9464_CR12","first-page":"463","volume":"2","author":"P. Erd\u0151s","year":"1935","unstructured":"Erd\u0151s, P., Szekeres, G.: A combinatorial problem in geometry. Compos. Math. 2, 463\u2013470 (1935)","journal-title":"Compos. Math."},{"issue":"2","key":"9464_CR13","doi-asserted-by":"crossref","first-page":"165","DOI":"10.2307\/2323956","volume":"98","author":"P. Gritzmann","year":"1991","unstructured":"Gritzmann, P., Mohar, B., Pach, J., Pollack, R.: Embedding a planar triangulation with vertices at specified points. Am. Math. Mon. 98(2), 165\u2013166 (1991)","journal-title":"Am. Math. Mon."},{"key":"9464_CR14","series-title":"LNCS","first-page":"50","volume-title":"Proceedings of the 20th International Symposium on Theoretical Aspects of Computer Science (STACS 2003)","author":"S. Langerman","year":"2003","unstructured":"Langerman, S., Steiger, W.: Optimization in arrangements. In: Proceedings of the 20th International Symposium on Theoretical Aspects of Computer Science (STACS 2003). LNCS, vol.\u00a02607, pp.\u00a050\u201361. Springer, Berlin (2003)"},{"key":"9464_CR15","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1007\/BF02187804","volume":"5","author":"J. Matou\u0161ek","year":"1990","unstructured":"Matou\u0161ek, J.: Construction of \u03f5-nets. Discrete Comput. Geom. 5, 427\u2013448 (1990)","journal-title":"Discrete Comput. Geom."},{"key":"9464_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0039-7","volume-title":"Lectures on Discrete Geometry","author":"J. Matou\u0161ek","year":"2002","unstructured":"Matou\u0161ek, J.: Lectures on Discrete Geometry. Springer, New York (2002)"},{"issue":"1","key":"9464_CR17","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1002\/jgt.10168","volume":"46","author":"J. Pach","year":"2004","unstructured":"Pach, J., Toth, G.: Monotone drawings of planar graphs. J. Graph Theory 46(1), 39\u201347 (2004)","journal-title":"J. Graph Theory"},{"key":"9464_CR18","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1007\/PL00007258","volume":"17","author":"J. Pach","year":"2001","unstructured":"Pach, J., Wenger, R.: Embedding planar graphs at fixed vertex locations. Graphs Comb. 17, 717\u2013728 (2001)","journal-title":"Graphs Comb."},{"issue":"4","key":"9464_CR19","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/BF02187706","volume":"1","author":"P. Rosenstiehl","year":"1986","unstructured":"Rosenstiehl, P., Tarjan, R.E.: Rectilinear planar layouts and bipolar orientations of planar graphs. Discrete Comput. Geom. 1(4), 343\u2013353 (1986)","journal-title":"Discrete Comput. Geom."},{"key":"9464_CR20","series-title":"Algorithms and Combinatorics","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1007\/978-3-642-60406-5_30","volume-title":"The Mathematics of Paul Erd\u0151s II","author":"P. Valtr","year":"1997","unstructured":"Valtr, P.: On mutually avoiding sets. In: The Mathematics of Paul Erd\u0151s II. Algorithms and Combinatorics, vol. 14, pp. 324\u2013332 (1997)"},{"key":"9464_CR21","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1112\/blms\/22.2.183","volume":"22","author":"R.T. \u017divaljevi\u0107","year":"1990","unstructured":"\u017divaljevi\u0107, R.T., Vre\u0107ica, S.T.: An extension of the ham sandwich theorem. Bull. Lond. Math. Soc. 22, 183\u2013186 (1990)","journal-title":"Bull. Lond. Math. Soc."}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-012-9464-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-012-9464-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-012-9464-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T23:50:36Z","timestamp":1559087436000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-012-9464-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,26]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,1]]}},"alternative-id":["9464"],"URL":"https:\/\/doi.org\/10.1007\/s00454-012-9464-y","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,9,26]]}}}