Ausgabe 2/2016
Inhalt (9 Artikel)
Upper Bounds on Number of Steals in Rooted Trees
Charles E. Leiserson, Tao B. Schardl, Warut Suksompong
Open Access
Exact Algorithms for Intervalizing Coloured Graphs
Hans L. Bodlaender, Johan M. M. van Rooij
When Diameter Matters: Parameterized Approximation Algorithms for Bounded Diameter Minimum Steiner Tree Problem
Ali Mashreghi, Alireza Zarei
Speed Scaling for Maximum Lateness
Evripidis Bampis, Dimitrios Letsios, Ioannis Milis, Georgios Zois
Online Scheduling FIFO Policies with Admission and Push-Out
Kirill Kogan, Alejandro López-Ortiz, Sergey I. Nikolenko, Alexander V. Sirotkin
The Outer-connected Domination Number of Sierpiński-like Graphs
Shun-Chieh Chang, Jia-Jie Liu, Yue-Li Wang
Open Access
A Fast Branching Algorithm for Cluster Vertex Deletion
Anudhyan Boral, Marek Cygan, Tomasz Kociumaka, Marcin Pilipczuk