External Links

    Journal: Algorithmica

    Volume 44, Issue 3

    183 -- 193Mark Huber. Exact Sampling from Perfect Matchings of Dense Regular Bipartite Graphs
    195 -- 211Xujin Chen, Wenan Zang. An Efficient Algorithm for Finding Maximum Cycle Packings in Reducible Flow Graphs
    213 -- 231Zeev Nutov. Approximating Rooted Connectivity Augmentation Problems
    233 -- 255Therese C. Biedl, Torsten Thiele, David R. Wood. Three-Dimensional Orthogonal Graph Drawing with Optimal Volume
    257 -- 280Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki. Augmenting a (k-1)-Vertex-Connected Multigraph l-Edge-Connected and k-Vertex-Connected Multigraph
    runs on