Journals in DBLP
Wen-Lian Hsu O(M*N) Algorithms for the Recognition and Isomorphism Problems on Circular-Arc Graphs. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1995, v:24, n:3, pp:411-439 [Journal ] Ajit Agrawal , Philip N. Klein , R. Ravi When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1995, v:24, n:3, pp:440-456 [Journal ] Chung-Do Yang , D. T. Lee , C. K. Wong Rectilinear Path Problems among Rectilinear Obstacles Revisited. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1995, v:24, n:3, pp:457-472 [Journal ] Jürg Ganz Evaluation of Polynomials Using the Structure of the Coefficients. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1995, v:24, n:3, pp:473-483 [Journal ] Alan M. Frieze , Richard M. Karp , Bruce A. Reed When is the Assignment Bound Tight for the Asymmetric Traveling-Salesman Problem? [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1995, v:24, n:3, pp:484-493 [Journal ] Andrew V. Goldberg Scaling Algorithms for the Shortest Paths Problem. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1995, v:24, n:3, pp:494-504 [Journal ] András A. Benczúr Counterexamples for Directed and Node Capacitated Cut-Trees. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1995, v:24, n:3, pp:505-510 [Journal ] Sampath Kannan , Tandy Warnow Tree Reconstruction from Partial Orders. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1995, v:24, n:3, pp:511-519 [Journal ] Raffaele Giancarlo A Generalization of the Suffix Tree to Square Matrices, with Applications. [Citation Graph (1, 0)][DBLP ] SIAM J. Comput., 1995, v:24, n:3, pp:520-562 [Journal ] Takeshi Tokuyama , Jun Nakano Efficient Algorithms for the Hitchcock Transportation Problem. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1995, v:24, n:3, pp:563-578 [Journal ] Edith Cohen Approximate Max-Flow on Small Depth Networks. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1995, v:24, n:3, pp:579-597 [Journal ] Richard A. Duke , Hanno Lefmann , Vojtech Rödl A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1995, v:24, n:3, pp:598-620 [Journal ] Henri-M. Méjean , Henri Morel , Gerard Reynaud A Variational Method for Analysing Unit Clause Search. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1995, v:24, n:3, pp:621-649 [Journal ] Ioannis Z. Emiris , John F. Canny A General Approach to Removing Degeneracies. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1995, v:24, n:3, pp:650-664 [Journal ] Timothy Law Snyder , J. Michael Steele A Priori Bounds on the Euclidean Traveling Salesman. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1995, v:24, n:3, pp:665-671 [Journal ]