{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T21:44:20Z","timestamp":1770068660092,"version":"3.49.0"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"S1","license":[{"start":{"date-parts":[[2007,6,1]],"date-time":"2007-06-01T00:00:00Z","timestamp":1180656000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2007,6]]},"DOI":"10.1007\/s00373-007-0716-1","type":"journal-article","created":{"date-parts":[[2007,7,2]],"date-time":"2007-07-02T07:26:17Z","timestamp":1183361177000},"page":"331-341","source":"Crossref","is-referenced-by-count":11,"title":["Some Combinatorial and Algorithmic Applications of the Borsuk\u2013Ulam Theorem"],"prefix":"10.1007","volume":"23","author":[{"given":"Sambuddha","family":"Roy","sequence":"first","affiliation":[]},{"given":"William","family":"Steiger","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"716_CR1","doi-asserted-by":"crossref","unstructured":"Akiyama, J., Alon, N.: Disjoint simplices and geometric hypergraphs. In: Blum, G.S., Graham, R.L., Malkevitch, J. (eds.) Combinatorial mathematics. Proceedings of the Third International Conference, New York, NY 1985. Annals of the New York Academy of Sciences, vol. 555, pp. 1\u20133 (1989)","DOI":"10.1111\/j.1749-6632.1989.tb22429.x"},{"key":"716_CR2","unstructured":"Alon, N.: Splitting necklaces. Adv. Math. 63, 247\u2013253 (1987)"},{"key":"716_CR3","doi-asserted-by":"crossref","unstructured":"Alon, N.: Some recent combinatorial applications of Borsuk-type theorems. In: Deza, M.M., Frankl, P., Rosenberg, I.G. (eds.) Algebraic, extremal and metric combinatorics, Cambridge University Press, Cambridge, England, pp. 1\u201312 (1988)","DOI":"10.1017\/CBO9780511758881.003"},{"key":"716_CR4","unstructured":"Alon, N., West, D.: The Borsuk\u2013Ulam theorem and bisection of necklaces. Proc. Amer. Math. Soc. 98, 623\u2013628 (1986)"},{"key":"716_CR5","doi-asserted-by":"crossref","unstructured":"Avis, D.: On the partitionability of point sets in space. Proceedings of First ACM Symposium on Computational Geometry, pp. 116\u2013120 (1985)","DOI":"10.1145\/323233.323249"},{"key":"716_CR6","doi-asserted-by":"crossref","unstructured":"B\u00e1r\u00e1ny, I.: Geometric and combinatorial applications of Borsuk\u2019s theorem. New trends in discrete and computational geometry. In: Pach, J. (ed.) Algorithms and combinatorics, vol. 10, pp. 235\u2013249, Springer, Berlin (1993)","DOI":"10.1007\/978-3-642-58043-7_10"},{"key":"716_CR7","unstructured":"B\u00e1r\u00e1ny, I., Matou\u0161ek, J.: Simultaneous partitions of measures by k-fans. Discrete Comput. Geom. 25, 317\u2013334 (2001)"},{"key":"716_CR8","unstructured":"B\u00e1r\u00e1ny, I., Matou\u0161ek, J.: Equipartition of two measures by a 4-fan. Discrete Comput. Geom. 27, 293\u2013301 (2002)"},{"key":"716_CR9","unstructured":"Bereg, S.: Equipartitions of measures by 2-fans. Discrete Comput. Geom. 34(1), 87\u201396 (2005)"},{"key":"716_CR10","unstructured":"Bespamyatnikh, S., Kirkpatrick, D., Snoeyink, J.: Generalizing ham-sandwich cuts to equitable subdivisions. Discrete Comput. Geom. 24, 605\u2013622 (2000)"},{"key":"716_CR11","unstructured":"Bose, P., Langerman, S.: Weighted ham-sandwich cuts. In: Kano, M., Akiyama, J. (eds.) Lecture Notes in Computer Science (JCDCG 2004: Japan Conference on Discrete and Computational Geometry, Tokyo, Japan, Springer, Heidelberg, (2005) (to appear)"},{"key":"716_CR12","doi-asserted-by":"crossref","unstructured":"Bose, P., Demaine, E., Hurtado, F., Iaconc, J., Langerman, S., Morin, P.: Geodesic ham-sandwich cuts. In: Proceedings of 20th ACM Symposium on Computational Geometry, pp. 1\u20139 (2004)","DOI":"10.1145\/997817.997821"},{"key":"716_CR13","unstructured":"Buck, R., Buck, E.: Equipartitioning of convex sets. Math. Mag. 22, 195\u2013198 (1987)"},{"key":"716_CR14","unstructured":"Cole, R., Sharir, M., Yap, C.: On k-hulls and related topics. SIAM J. Comput. 16, 61\u201377 (1987)"},{"key":"716_CR15","unstructured":"Cole, R., Salowe, J., Steiger, W., Szemer\u00e9di, E.: An optimal time algorithm for slope selection. SIAM J. Comp. 18, 792\u2013810 (1989)"},{"key":"716_CR16","unstructured":"Courant, R., Robbins, H.: What is mathematics? Oxford University Press, New York (1941)"},{"key":"716_CR17","unstructured":"Dey, T.: Improved bounds for planar k-sets and related problems. Discrete Comput. Geom. 19, 373\u2013382 (1998)"},{"key":"716_CR18","unstructured":"Dobkin, D., Edelsbrunner, H.: Ham-sandwich theorems applied to intersection problems. In: Proceedings of 10th International Workshop on Graph Theoretic Concepts in Computer Science, pp. 88\u201399 (1984)"},{"key":"716_CR19","doi-asserted-by":"crossref","unstructured":"Edelsbrunner, H.: Algorithms in combinatorial geometry. Springer, Berlin, (1987)","DOI":"10.1007\/978-3-642-61568-9"},{"key":"716_CR20","doi-asserted-by":"crossref","unstructured":"Ito, H., Uehara, H., Yokoyama, M.: Two dimensional ham-sandwich theorem for partitioning into three convex pieces. In: Kano, M., Akiyama, J. (eds.) Lecture Notes in Computer Science 1763 JCDCG 1998: Japan Conference on Discrete and Computational Geometry, Tokyo, Japan, Springer, Heidelberg (2000)","DOI":"10.1007\/978-3-540-46515-7_11"},{"key":"716_CR21","unstructured":"Kaneko, A., Kano, M.: Balanced partitions of two sets of points in the plane. Comput. Geom. Theory Appl. 13, 253\u2013261 (1999)"},{"key":"716_CR22","doi-asserted-by":"crossref","unstructured":"Langerman, S., Steiger, W.: Optimization in Arrangements. In: Alt, H., Habib, M. (eds.) Lecture Notes in Computer Science 2607 (STACS 2003: 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, pp. 50\u201361, Springer, Heidelberg (2003)","DOI":"10.1007\/3-540-36494-3_6"},{"key":"716_CR23","unstructured":"Lo, C.-Y., Matou\u0161ek, J., Steiger, W.: Algorithms for ham-sandwich cuts. Discrete Comput. Geom. 11, 433\u2013452 (1994)"},{"key":"716_CR24","unstructured":"Matou\u0161ek, J.: Using the Borsuk\u2013Ulam theorem. Springer, Heidelberg (2003)"},{"key":"716_CR25","doi-asserted-by":"crossref","unstructured":"Megiddo, N.: Partitioning with two lines in the plane. J. Algorithms 6, 430\u2013433 (1985)","DOI":"10.1016\/0196-6774(85)90011-2"},{"key":"716_CR26","doi-asserted-by":"crossref","unstructured":"Sakai, T.: Balanced convex partitions of measures in R2. Graphs Comb. 18, 169\u2013192 (2002)","DOI":"10.1007\/s003730200011"},{"key":"716_CR27","unstructured":"Schulman. L.: An equipartition of planar sets. Discrete Comput. Geom. 9, 257\u2013266 (1992)"},{"key":"716_CR28","unstructured":"Sharir, M., Smorodinsky, S., Tardos, G.: An improved bound for k-sets in three dimensions. Discrete Comput. Geom. 26, 195\u2013204 (2001)"},{"key":"716_CR29","unstructured":"Willard, D.: Polygon retrieval. SIAM J. Comput. 11, 149\u2013165 (1982)"},{"key":"716_CR30","unstructured":"Yao, F., Dobkin, D., Edelsbrunner, H., Paterson, M.: Partitioning space for range queries. SIAM J. Comput. 18, 371\u2013384 (1989)"},{"key":"716_CR31","unstructured":"Goldberg, C., West, D.: Bisection of circle colorings. SIAM J. Matrix Analysis App. 6, 93\u2013106 (1985)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-007-0716-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-007-0716-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-007-0716-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T10:58:27Z","timestamp":1559041107000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-007-0716-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6]]},"references-count":31,"journal-issue":{"issue":"S1","published-print":{"date-parts":[[2007,6]]}},"alternative-id":["716"],"URL":"https:\/\/doi.org\/10.1007\/s00373-007-0716-1","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,6]]}}}