
Journals in DBLP
Algorithmica 2006, volume: 44, number: 3
 Mark Huber
Exact Sampling from Perfect Matchings of Dense Regular Bipartite Graphs. [Citation Graph (0, 0)][DBLP] Algorithmica, 2006, v:44, n:3, pp:183193 [Journal]
 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:195211 [Journal]
 Zeev Nutov
Approximating Rooted Connectivity Augmentation Problems. [Citation Graph (0, 0)][DBLP] Algorithmica, 2006, v:44, n:3, pp:213231 [Journal]
 Therese C. Biedl, Torsten Thiele, David R. Wood
ThreeDimensional Orthogonal Graph Drawing with Optimal Volume. [Citation Graph (0, 0)][DBLP] Algorithmica, 2006, v:44, n:3, pp:233255 [Journal]
 Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki
Augmenting a (k1)VertexConnected Multigraph lEdgeConnected and kVertexConnected Multigraph. [Citation Graph (0, 0)][DBLP] Algorithmica, 2006, v:44, n:3, pp:257280 [Journal]
