{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T12:13:40Z","timestamp":1778328820639,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540664086","type":"print"},{"value":"9783540483403","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48340-3_37","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T13:04:52Z","timestamp":1184591092000},"page":"410-418","source":"Crossref","is-referenced-by-count":10,"title":["Football Elimination Is Hard to Decide Under the 3-Point-Rule"],"prefix":"10.1007","author":[{"given":"Thorsten","family":"Bernholt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"G\u00fclich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Hofmeister","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Niels","family":"Schmitt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"37_CR1","unstructured":"R. K. Ahuja, T. L. Magnanti and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications. Prentice Hall, 1993."},{"key":"37_CR2","series-title":"Tech. Report","volume-title":"The Structure and Complexity of Sports Elimination Numbers","author":"D. Gusfield","year":"1999","unstructured":"D. Gusfield and C. Martel, The Structure and Complexity of Sports Elimination Numbers, Tech. Report CSE-99-1, CS Department, Univ. of California, Davis, January 1999."},{"key":"37_CR3","doi-asserted-by":"crossref","unstructured":"S. T. McCormick, Fast algorithms for parametric scheduling come from extensions to parametric maximum flow. In: Proc. of the 28th Annual ACM Symp. on the Theory of Computing (STOC), 319\u2013328, 1996.","DOI":"10.1145\/237814.237978"},{"key":"37_CR4","unstructured":"K. D. Wayne, A New Property and a Faster Algorithm for Baseball Elimination, In: Proc. of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1999. Preprint available as a link under the URL \n                    http:\/\/www.cs.princeton.edu\/~wayne\/research.html"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1999"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48340-3_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T22:50:21Z","timestamp":1550443821000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48340-3_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540664086","9783540483403"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/3-540-48340-3_37","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1999]]}}}