{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T16:53:40Z","timestamp":1772297620188,"version":"3.50.1"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319334608","type":"print"},{"value":"9783319334615","type":"electronic"}],"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-33461-5_15","type":"book-chapter","created":{"date-parts":[[2016,5,24]],"date-time":"2016-05-24T22:35:59Z","timestamp":1464129359000},"page":"178-189","source":"Crossref","is-referenced-by-count":2,"title":["Round-Robin Tournaments Generated by the Circle Method Have Maximum Carry-Over"],"prefix":"10.1007","author":[{"given":"Erik","family":"Lambrechts","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Annette M. C.","family":"Ficker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dries R.","family":"Goossens","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frits C. R.","family":"Spieksma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,5,25]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198500292.001.0001","volume-title":"Combinatorial Designs and Tournaments","author":"I Anderson","year":"1997","unstructured":"Anderson, I.: Combinatorial Designs and Tournaments. Oxford University Press, Oxford (1997)"},{"key":"15_CR2","series-title":"Research Notes in Mathematics","first-page":"1","volume-title":"Combinatorial Designs and Their Applications","author":"I Anderson","year":"1997","unstructured":"Anderson, I.: Balancing carry-over effects in tournaments. In: Holroyd, F., Quinn, K., Rowley, C., Webb, B. (eds.) Combinatorial Designs and Their Applications. Research Notes in Mathematics, vol. 403, pp. 1\u201316. CRC Press, Boca Raton (1997)"},{"key":"15_CR3","series-title":"Dolciani Mathematical Expositions","doi-asserted-by":"crossref","first-page":"203","DOI":"10.5948\/UPO9781614442004.018","volume-title":"Mathematics and Sports","author":"D Froncek","year":"2010","unstructured":"Froncek, D.: Scheduling a tournament. In: Gallian, J.A. (ed.) Mathematics and Sports. Dolciani Mathematical Expositions, vol. 43, pp. 203\u2013216. Mathematical Association of America, Washington DC (2010)"},{"key":"15_CR4","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/0166-218X(80)90028-1","volume":"2","author":"D Werra De","year":"1980","unstructured":"De Werra, D.: Geography, games and graphs. Discrete Appl. Math. 2, 327\u2013337 (1980)","journal-title":"Discrete Appl. Math."},{"key":"15_CR5","series-title":"Annals of Discrete Mathematics","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/S0304-0208(08)73478-9","volume-title":"Studies on Graphs and Discrete Programming","author":"D Werra De","year":"1981","unstructured":"De Werra, D.: Scheduling in sports. In: Hansen, P. (ed.) Studies on Graphs and Discrete Programming. Annals of Discrete Mathematics, vol. 11, pp. 381\u2013395. North-Holland, Amsterdam (1981)"},{"key":"15_CR6","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1007\/s10951-011-0238-9","volume":"15","author":"DR Goossens","year":"2012","unstructured":"Goossens, D.R., Spieksma, F.C.R.: Soccer schedules in Europe: an overview. J. Sched. 15, 641\u2013651 (2012)","journal-title":"J. Sched."},{"key":"15_CR7","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1177\/1527002511402932","volume":"13","author":"DR Goossens","year":"2012","unstructured":"Goossens, D.R., Spieksma, F.C.R.: The carry-over effect does not influence football results. J. Sports Econ. 13, 288\u2013305 (2012)","journal-title":"J. Sports Econ."},{"key":"15_CR8","first-page":"65","volume":"18","author":"T Griggs","year":"1996","unstructured":"Griggs, T., Rosa, A.: A tour of european soccer schedules, or testing the popularity of $$GK_{2n}$$ . Bull. Inst. Comb. Appl. 18, 65\u201368 (1996)","journal-title":"Bull. Inst. Comb. Appl."},{"key":"15_CR9","unstructured":"Januario, T., Urrutia, S., Ribeiro, C., de Werra, D.: A Tutorial on Edge Coloring in Graphs for Sports Scheduling. http:\/\/www2.ic.uff.br\/~celso\/artigos\/ejor_single_file.pdf . Accessed 3 Nov 2015"},{"key":"15_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.cor.2009.05.013","volume":"37","author":"G Kendall","year":"2010","unstructured":"Kendall, G., Knust, S., Ribeiro, C., Urrutia, S.: Scheduling in sports: an annotated bibliography. Comput. Oper. Res. 37, 1\u201319 (2010)","journal-title":"Comput. Oper. Res."},{"key":"15_CR11","first-page":"191","volume":"2","author":"TP Kirkman","year":"1847","unstructured":"Kirkman, T.P.: On a problem in combinatorics. Camb. Dublin Math. J. 2, 191\u2013204 (1847)","journal-title":"Camb. Dublin Math. J."},{"key":"15_CR12","unstructured":"Lambrechts, E., Ficker, A.M.C., Goossens, D.R., Spieksma, F.C.R.: Round-robin tournaments generated by the circle method have maximum carry-over. Research report, KBI_1603, KU Leuven"},{"key":"15_CR13","unstructured":"Miyashiro, R., Matsui, T.: Minimizing the carry-over effects value in a round-robin tournament. In: Burke, E.K., Rudov\u00e1, H. (eds.) Proceedings of the 6th International Conference on the Practice and Theory of Automated Timetabling, pp. 460\u2013463 (2006)"},{"issue":"1","key":"15_CR14","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1093\/biomet\/67.1.127","volume":"67","author":"KG Russell","year":"1980","unstructured":"Russell, K.G.: Balancing carry-over effects in round robin tournaments. Biometrika 67(1), 127\u2013131 (1980)","journal-title":"Biometrika"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-33461-5_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T03:04:15Z","timestamp":1718593455000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-33461-5_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319334608","9783319334615"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-33461-5_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}