Journal: Theory Comput. Syst.

Volume 62, Issue 6

1349 -- 1350Veli Mäkinen, Simon J. Puglisi. Editorial: Special Issue on "Combinatorial Algorithms" (IWOCA 2016)
1351 -- 1365Pawel Gawrychowski, Lukasz Zatorski. Speeding up dynamic programming in the line-constrained k-median
1366 -- 1391Martin Böhm, Pavel Veselý. Online Chromatic Number is PSPACE-Complete
1392 -- 1408Yuya Higashikawa, Siu-Wing Cheng, Tsunehiko Kameda, Naoki Katoh, Shun Saburi. Minimax Regret 1-Median Problem in Dynamic Path Networks
1409 -- 1426Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart. Finding Cactus Roots in Polynomial Time
1427 -- 1442Peter Damaschke. The Solution Space of Sorting with Recurring Comparison Faults
1443 -- 1469Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen. Weighted Online Problems with Advice
1470 -- 1489Kaushik Sarkar, Charles J. Colbourn, Annalisa De Bonis, Ugo Vaccaro. Partial Covering Arrays: Algorithms and Asymptotics
1490 -- 1524Adrian Dumitrescu, Ritankar Mandal, Csaba D. Tóth. Monotone Paths in Geometric Triangulations
1525 -- 1552Xujin Chen, Zhuo Diao, Xiaodong Hu, Zhongzheng Tang. Covering Triangles in Edge-Weighted Graphs