Journals in DBLP

Algorithmica
2006, volume: 44, number: 3

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