Exact Sampling from Perfect Matchings of Dense Regular Bipartite Graphs Mark Huber OriginalPaper 30 September 2005 Pages: 183 - 193
An Efficient Algorithm for Finding Maximum Cycle Packings in Reducible Flow Graphs Xujin ChenWenan Zang OriginalPaper 14 June 2005 Pages: 195 - 211
Approximating Rooted Connectivity Augmentation Problems Zeev Nutov OriginalPaper 18 April 2005 Pages: 213 - 231
Three-Dimensional Orthogonal Graph Drawing with Optimal Volume Therese BiedlTorsten ThieleDavid R. Wood OriginalPaper 02 May 2005 Pages: 233 - 255
Augmenting a (k - 1)-Vertex-Connected Multigraph ℓ-Edge-Connected and k-Vertex-Connected Multigraph Toshimasa IshiiHiroshi NagamochiToshihide Ibaraki OriginalPaper 18 April 2005 Pages: 257 - 280