SIGACT News columns
-
41: 2023 in review, Aflatoun Amouzandeh, Sören Schmitt, Rob van Stee.
-
40: 2022 in review, Aflatoun Amouzandeh, Sören Schmitt, Rob van Stee.
-
39: Online List Scheduling for Makespan Minimization: A Review of the State-of-the-art Results, Research Challenges and Open Problems, Debasis Dwibedy, Rakesh Mohanty.
-
38: 2021 in review, Felix Höhne, Sören Schmitt, Rob van Stee
-
37: The 2-competitive algorithm problem, Pavel Vesely
-
36: 2020 in review, Felix Höhne, Sören Schmitt, Rob van Stee
-
35: 2019 in review, Felix Höhne, Sören Schmitt, Rob van Stee
-
34: 2018 in review, Rob van Stee
-
33: The reordering buffer problem on the line revisited, Matthias Englert
-
32: 2017 in review, Rob van Stee
-
31: Offline list update is NP hard, Christoph Ambühl
-
30: 2016 in review, Rob van Stee
-
29: Online algorithms with advice: a survey, Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Kim S. Larsen, Jesper W. Mikkelsen
-
28: Online matching on the line, part 2, Rob van Stee
-
27: Online matching on the line, part 1, Rob van Stee
-
26: Bin packing in multiple dimensions, Rob van Stee
-
25: Online primal dual: beyond linear programs, Zhiyi Huang
-
24: 2014 so far, Rob van Stee
-
23: Online aggregation problems, Marek Chrobak
-
22: The matroid secretary problem, Michael Dinitz
-
21: APPROX and ALGO, Rob van Stee
-
20: The power of harmony, Rob van Stee