Volume 8, Number 1, January 2012
Volume 8, Number 2, April 2012
: How to trim a MST: A 2-Approximation algorithm for minimum cost-tree cover.
Volume 8, Number 3, July 2012
, Norbert Zeh
: I/O-efficient shortest path algorithms for undirected graphs with random or bounded edge lengths.
Volume 8, Number 4, September 2012
Timothy M. Chan
: All-pairs shortest paths for unweighted undirected graphs in o(mn) time.
: The effectiveness of stackelberg strategies and tolls for network congestion games.