
Journals in DBLP
 Naveen Garg, Vijay V. Vazirani, Mihalis Yannakakis
Approximate MaxFlow Min(Multi)Cut Theorems and Their Applications. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1996, v:25, n:2, pp:235251 [Journal]
 Ronitt Rubinfeld, Madhu Sudan
Robust Characterizations of Polynomials with Applications to Program Testing. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1996, v:25, n:2, pp:252271 [Journal]
 Vineet Bafna, Pavel A. Pevzner
Genome Rearrangements and Sorting by Reversals. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1996, v:25, n:2, pp:272289 [Journal]
 Appajosyula Satyanarayana, R. Kevin Wood, L. Camarinopoulos, G. Pampoukis
Note on "A LinearTime Algorithm for Computing KTerminal Reliability in a SeriesParallel Network". [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1996, v:25, n:2, pp:290 [Journal]
 Michael D. Hutton, Anna Lubiw
Upward Planning of SingleSource Acyclic Digraphs. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1996, v:25, n:2, pp:291311 [Journal]
 Vijaya Ramachandran, Honghua Yang
An Efficient Parallel Algorithm for the General Planar Monotone Circuit Value Problem. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1996, v:25, n:2, pp:312339 [Journal]
 Richard Chang, Jim Kadin
The Boolean Hierarchy and the Polynomial Hierarchy: A Closer Connection. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1996, v:25, n:2, pp:340354 [Journal]
 Samir Khuller, Balaji Raghavachari, Neal E. Young
LowDegree Spanning Trees of Small Weight. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1996, v:25, n:2, pp:355368 [Journal]
 Hagit Attiya, Amir Herzberg, Sergio Rajsbaum
Optimal Clock Synchronization under Different Delay Assumptions. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1996, v:25, n:2, pp:369389 [Journal]
 Xiaotie Deng, Pavol Hell, Jing Huang
LinearTime Representation Algorithms for Proper CircularArc Graphs and Proper Interval Graphs. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1996, v:25, n:2, pp:390403 [Journal]
 Chong Jye Rhee, Y. Daniel Liang, Sudarshan K. Dhall, S. Lakshmivarahan
An O(N+M)Time Algorithm for Finding a MinimumWeight Dominating Set in a Permutation Graph. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1996, v:25, n:2, pp:404419 [Journal]
 Anmol Mathur, Edward M. Reingold
Generalized Kraft's Inequality and Discrete kModal Search. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1996, v:25, n:2, pp:420447 [Journal]
 Richard Edwin Stearns, Harry B. Hunt III
An Algebraic Model for Combinatorial Problems. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1996, v:25, n:2, pp:448476 [Journal]
