Special Issue on Combinatorial Algorithms
ISSN:
1432-4350 (Print)
1433-0490 (Online)
In this topical collection (10 articles)
-
EditorialNotes
Editorial: Special Issue on “Combinatorial Algorithms” (IWOCA 2016)
Veli Mäkinen, Simon J. Puglisi Pages 1349-1350 -
OriginalPaper
Speeding up dynamic programming in the line-constrained k-median
Paweł Gawrychowski, Łukasz Zatorski Pages 1351-1365 -
OriginalPaper
Minimax Regret 1-Median Problem in Dynamic Path Networks
Yuya Higashikawa, Siu-Wing Cheng, Tsunehiko Kameda… Pages 1392-1408 -
OriginalPaper
Finding Cactus Roots in Polynomial Time
Petr A. Golovach, Dieter Kratsch, Daniël Paulusma… Pages 1409-1426 -
OriginalPaper
The Solution Space of Sorting with Recurring Comparison Faults
Peter Damaschke Pages 1427-1442 -
OriginalPaper
Weighted Online Problems with Advice
Joan Boyar, Lene M. Favrholdt, Christian Kudahl… Pages 1443-1469 -
OriginalPaper
Partial Covering Arrays: Algorithms and Asymptotics
Kaushik Sarkar, Charles J. Colbourn, Annalisa De Bonis… Pages 1470-1489 -
OriginalPaper
Monotone Paths in Geometric Triangulations
Adrian Dumitrescu, Ritankar Mandal, Csaba D. Tóth Pages 1490-1524 -
OriginalPaper
Covering Triangles in Edge-Weighted Graphs
Xujin Chen, Zhuo Diao, Xiaodong Hu, Zhongzheng Tang Pages 1525-1552
Continue reading...
To view the rest of this content please follow the download PDF link above.