Journals in DBLP

J. Algorithms
1999, volume: 33, number: 1

1. David Pisinger
   Linear Time Algorithms for Knapsack Problems with Bounded Weights. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1999, v:33, n:1, pp:1-14 [Journal]
   
2. Joseph Cheriyan, Ramakrishna Thurimella
   Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1999, v:33, n:1, pp:15-50 [Journal]
   
3. Lisa Fleischer
   Building Chain and Cactus Representations of All Minimum Cuts from Hao-Orlin in the Same Asymptotic Run Time. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1999, v:33, n:1, pp:51-72 [Journal]
   
4. Moses Charikar, Chandra Chekuri, To-Yat Cheung, Zuo Dai, Ashish Goel, Sudipto Guha, Ming Li
   Approximation Algorithms for Directed Steiner Problems. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1999, v:33, n:1, pp:73-91 [Journal]
   
5. Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi, Ravi Sundaram, Hans-Christoph Wirth
   Improving Minimum Cost Spanning Trees by Upgrading Nodes. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1999, v:33, n:1, pp:92-111 [Journal]
   
6. C. R. Subramanian
   Minimum Coloring k-Colorable Graphs in Polynomial Average Time. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1999, v:33, n:1, pp:112-123 [Journal]
   
7. Anders Yeo
   A Polynomial Time Algorithm for Finding a Cycle Covering a Given Set of Vertices in a Semicomplete Multipartite Digraph. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1999, v:33, n:1, pp:124-139 [Journal]
   
8. Mario A. Lopez, Shlomo Reisner
   Algorithms for Polyhedral Approximation of Multidimensional Ellipsoids. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1999, v:33, n:1, pp:140-165 [Journal]
   
9. Alan M. Frieze, Michael Molloy
   Splitting an Expander Graph. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1999, v:33, n:1, pp:166-172 [Journal]
   
10. Noga Alon, Benny Sudakov
    On Two Segmentation Problems. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1999, v:33, n:1, pp:173-184 [Journal]