{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T02:10:55Z","timestamp":1740103855994,"version":"3.37.3"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,9,11]],"date-time":"2022-09-11T00:00:00Z","timestamp":1662854400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,9,11]],"date-time":"2022-09-11T00:00:00Z","timestamp":1662854400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2022,10]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Gerhard Woeginger has passed away. His colleagues Jan Karel Lenstra, Franz Rendl, Frits Spieksma and Marc Uetz commemorate a great scientist and dear friend.<\/jats:p>","DOI":"10.1007\/s10951-022-00748-4","type":"journal-article","created":{"date-parts":[[2022,9,11]],"date-time":"2022-09-11T12:02:30Z","timestamp":1662897750000},"page":"503-505","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["In memoriam Gerhard Woeginger"],"prefix":"10.1007","volume":"25","author":[{"given":"Jan Karel","family":"Lenstra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Franz","family":"Rendl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frits","family":"Spieksma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4223-2435","authenticated-orcid":false,"given":"Marc","family":"Uetz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,11]]},"reference":[{"key":"748_CR1","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1002\/(SICI)1099-1425(199806)1:1<55::AID-JOS2>3.0.CO;2-J","volume":"1","author":"N Alon","year":"1998","unstructured":"Alon, N., Azar, Y., Woeginger, G. J., & Yadid, T. (1998). Approximation schemes for scheduling on parallel machines. Journal of Scheduling, 1, 55\u201366.","journal-title":"Journal of Scheduling"},{"key":"748_CR2","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1137\/S0036144596297514","volume":"40","author":"RE Burkard","year":"1998","unstructured":"Burkard, R. E., Deineko, V. G., van Dal, R., van der Veen, J. A. A., & Woeginger, G. J. (1998). Well-solvable special cases of the traveling salesman problem: A survey. SIAM Review, 40, 496\u2013546.","journal-title":"SIAM Review"},{"key":"748_CR3","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BFb0029568","volume-title":"Online algorithms: The state of the art; LNCS 1442","author":"J Csirik","year":"1998","unstructured":"Csirik, J., & Woeginger, G. J. (1998). On-line packing and covering problems. In A. Fiat & G. J. Woeginger (Eds.), Online algorithms: The state of the art; LNCS 1442 (pp. 147\u2013177). Springer."},{"key":"748_CR4","unstructured":"Duijvestijn, A. J. W. (1962). Electronic computation of squared rectangles. PhD thesis, Technische Hogeschool Eindhoven."},{"key":"748_CR5","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1287\/ijoc.13.2.157.10520","volume":"13","author":"H Hoogeveen","year":"2001","unstructured":"Hoogeveen, H., Schuurman, P., & Woeginger, G. J. (2001). Non-approximability results for scheduling problems with minsum criteria. INFORMS Journal on Computing, 13, 157\u2013168.","journal-title":"INFORMS Journal on Computing"},{"key":"748_CR6","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s10107-002-0324-z","volume":"94","author":"H Hoogeveen","year":"2003","unstructured":"Hoogeveen, H., Skutella, M., & Woeginger, G. J. (2003). Preemptive scheduling with rejection. Mathematical Programming, 94, 361\u2013374.","journal-title":"Mathematical Programming"},{"key":"748_CR7","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"HW Lenstra Jr","year":"1983","unstructured":"Lenstra, H. W., Jr. (1983). Integer programming with a fixed number of variables. Mathematics of Operations Research, 8, 538\u2013548.","journal-title":"Mathematics of Operations Research"},{"key":"748_CR8","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1002\/(SICI)1099-1425(199909\/10)2:5<203::AID-JOS26>3.0.CO;2-5","volume":"2","author":"P Schuurman","year":"1999","unstructured":"Schuurman, P., & Woeginger, G. J. (1999). Polynomial time approximation algorithms for machine scheduling: Ten open problems. Journal of Scheduling, 2, 203\u2013213.","journal-title":"Journal of Scheduling"},{"key":"748_CR9","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1287\/moor.25.1.63.15212","volume":"25","author":"M Skutella","year":"2000","unstructured":"Skutella, M., & Woeginger, G. J. (2000). A PTAS for minimizing the total weighted completion time on identical parallel machines. Mathematics of Operations Research, 25, 63\u201375.","journal-title":"Mathematics of Operations Research"},{"key":"748_CR10","unstructured":"Woeginger, G. J. (1991). Geometric clustering, reconstruction and embedding problems: Combinatorial properties and algorithms. PhD thesis, Technische Universit\u00e4t Graz."},{"key":"748_CR11","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0167-6377(96)00055-7","volume":"20","author":"GJ Woeginger","year":"1997","unstructured":"Woeginger, G. J. (1997). A polynomial-time approximation scheme for maximizing the minimum machine completion time. Operations Research Letters, 20, 149\u2013154.","journal-title":"Operations Research Letters"},{"key":"748_CR12","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1287\/ijoc.12.1.57.11901","volume":"12","author":"GJ Woeginger","year":"2000","unstructured":"Woeginger, G. J. (2000). When does a dynamic programming formulation guarantee the existence of a fully polynomial time approximation scheme (FPTAS)? INFORMS Journal on Computing, 12, 57\u201374.","journal-title":"INFORMS Journal on Computing"},{"key":"748_CR13","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/3-540-36478-1_17","volume-title":"Combinatorial optimization\u2014Eureka, you shrink! LNCS 2570","author":"GJ Woeginger","year":"2003","unstructured":"Woeginger, G. J. (2003). Exact algorithms for NP-hard problems: A survey. In M. J\u00fcnger, G. Reinelt, & G. Rinaldi (Eds.), Combinatorial optimization\u2014Eureka, you shrink! LNCS 2570 (pp. 185\u2013207). Springer."},{"key":"748_CR14","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/j.mathsocsci.2008.03.001","volume":"56","author":"GJ Woeginger","year":"2008","unstructured":"Woeginger, G. J. (2008a). An axiomatic characterization of the Hirsch-index. Mathematical Social Sciences, 56, 224\u2013232.","journal-title":"Mathematical Social Sciences"},{"key":"748_CR15","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1016\/j.joi.2008.05.002","volume":"2","author":"GJ Woeginger","year":"2008","unstructured":"Woeginger, G. J. (2008b). An axiomatic analysis of Egghe\u2019s g-index. Journal of Informetrics, 2, 364\u2013368.","journal-title":"Journal of Informetrics"},{"key":"748_CR16","doi-asserted-by":"publisher","first-page":"1267","DOI":"10.1002\/asi.21061","volume":"60","author":"GJ Woeginger","year":"2009","unstructured":"Woeginger, G. J. (2009). Generalizations of Egghe\u2019s g-index. Journal of the American Society for Information Science and Technology, 60, 1267\u20131273.","journal-title":"Journal of the American Society for Information Science and Technology"},{"key":"748_CR17","unstructured":"Woeginger, G. J. (2016). The P-versus-NP page. https:\/\/www.win.tue.nl\/~gwoegi\/P-versus-NP.htm."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-022-00748-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10951-022-00748-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-022-00748-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,29]],"date-time":"2022-09-29T08:19:12Z","timestamp":1664439552000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10951-022-00748-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,11]]},"references-count":17,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["748"],"URL":"https:\/\/doi.org\/10.1007\/s10951-022-00748-4","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"type":"print","value":"1094-6136"},{"type":"electronic","value":"1099-1425"}],"subject":[],"published":{"date-parts":[[2022,9,11]]},"assertion":[{"value":"13 May 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 September 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}