ACM Transactions on Algorithms, Volume 5
Volume 5, Number 1, November 2008
: Approximating rank-width and clique-width quickly.
Volume 5, Number 2, March 2009
: Testing bipartiteness of geometric intersection graphs.
, Dana Ron
: Approximating the distance to properties in bounded-degree and general sparse graphs.
Volume 5, Number 3, July 2009
: Squarepants in a tree: Sum of subtree clustering and hyperbolic pants decomposition.
: Instability of FIFO in the permanent sessions model at arbitrarily small network loads.
Volume 5, Number 4, October 2009
: A generalized minimum cost k-clustering.
: All maximal independent sets and dynamic dominance for sparse graphs.