{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T03:34:48Z","timestamp":1772508888714,"version":"3.50.1"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[1993,6,1]],"date-time":"1993-06-01T00:00:00Z","timestamp":738892800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1993,6]]},"DOI":"10.1007\/bf01190161","type":"journal-article","created":{"date-parts":[[2005,2,17]],"date-time":"2005-02-17T22:43:07Z","timestamp":1108680187000},"page":"649-668","source":"Crossref","is-referenced-by-count":6,"title":["Splitting a configuration in a simplex"],"prefix":"10.1007","volume":"9","author":[{"given":"Kazumiti","family":"Numata","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takeshi","family":"Tokuyama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. V. Aho","year":"1974","unstructured":"Aho, A. V., Hopcroft, J. E., and Ullman, J. D.,The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974."},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"Avis, D., On the Partitionability of Point Sets in Space,Proc. 1st ACM Symp. on Computational Geometry, 1985, pp. 116?120.","DOI":"10.1145\/323233.323249"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF02187874","volume":"2","author":"D. Avis","year":"1987","unstructured":"Avis, D., and ElGindy, H., Triangulating Point Sets in Space,Discrete Comput. Geom.,2 (1987), 99?111.","journal-title":"Discrete Comput. Geom."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1016\/S0022-0000(73)80033-9","volume":"7","author":"M. Blum","year":"1972","unstructured":"Blum, M., Floyd, R. W., Pratt, V. R., Rivest, R. L., and Tarjan, R. E., Time Bounds for Selection,J. Comput. System Sci.,7 (1972), 448?461.","journal-title":"J. Comput. System Sci."},{"key":"CR5","volume-title":"Algorithms in Combinatorial Geometry","author":"H. Edelsbrunner","year":"1986","unstructured":"Edelsbrunner, H.,Algorithms in Combinatorial Geometry, Springer-Verlag, New York, 1986."},{"key":"CR6","volume-title":"Report F138","author":"H. Edelsbrunner","year":"1984","unstructured":"Edelsbrunner, H., and Huber, F., Dissecting Sets of Points in Two and Three Dimensions, Report F138, Inst. Informationsverarb., Techn. Univ. Graz, Austria, 1984."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M. Fredman","year":"1987","unstructured":"Fredman, M., and Tarjan, R., Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms,J. Assoc. Comput. Mach.,34 (1987), 596?615.","journal-title":"J. Assoc. Comput. Mach."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1137\/0212052","volume":"12","author":"N. Megiddo","year":"1983","unstructured":"Megiddo, N., Linear Time Algorithms for Linear Programming in ?3 and Related Problems,SIAM J. Comput.,12 (1983), 759?776.","journal-title":"SIAM J. Comput."},{"key":"CR9","unstructured":"Nakano, J., and Tokuyama, T., Efficient Algorithms for the Hitchcock Transportation Problem,Proc. 3rd ACM-SIAM Symp. on Discrete Algorithms, 1992, pp. 175?184."},{"key":"CR10","first-page":"233","volume":"32","author":"K. Numata","year":"1989","unstructured":"Numata, K., Property of the Optimum Relaxed Solution for Problem to Schedule Independent Tasks on Unrelated Processors,J. Oper. Res. Soc. Japan,32 (1989), 233?259.","journal-title":"J. Oper. Res. Soc. Japan"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0196-6774(90)90007-2","volume":"11","author":"E. Ronn","year":"1990","unstructured":"Ronn, E., NP-Complete Stable Matching Problems,J. Algorithms,11 (1990), 285?304.","journal-title":"J. Algorithms"},{"key":"CR12","unstructured":"Tamura, A., A Property of the Divorce Digraph for a Stable Marriage,J. Combin. Theory, to appear. Available as a Research Report on Information Science, Tokyo Institute of Technology, 1990."},{"key":"CR13","doi-asserted-by":"crossref","unstructured":"Tokuyama, T., and Nakano, J., Geometric Algorithms for an Assignment Problem,Proc. 7th ACM Symp. on Computational Geometry, 1991, pp. 262?271.","DOI":"10.1145\/109648.109678"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01190161.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01190161\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01190161","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T20:40:39Z","timestamp":1586119239000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01190161"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,6]]},"references-count":13,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1993,6]]}},"alternative-id":["BF01190161"],"URL":"https:\/\/doi.org\/10.1007\/bf01190161","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,6]]}}}