Journals in DBLP
Haripriyan Hampapuram , Michael L. Fredman Optimal Biweighted Binary Trees and the Complexity of Maintaining Partial Sums. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1998, v:28, n:1, pp:1-9 [Journal ] Johannes A. La Poutré , Jeffery Westbrook Dynamic 2-Connectivity with Backtracking. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1998, v:28, n:1, pp:10-26 [Journal ] Gregorio Malajovich , Klaus Meer On the Structure of NP_C. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1998, v:28, n:1, pp:27-35 [Journal ] Marius Zimand Weighted NP Optimization Problems: Logical Definability and Approximation Properties. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1998, v:28, n:1, pp:36-56 [Journal ] Tomás Feder , Moshe Y. Vardi The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1998, v:28, n:1, pp:57-104 [Journal ] Thomas H. Cormen , Thomas Sundquist , Leonard F. Wisniewski Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1998, v:28, n:1, pp:105-136 [Journal ] Lance Fortnow , Judy Goldsmith , Matthew A. Levy , Stephen R. Mahaney L-Printable Sets. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1998, v:28, n:1, pp:137-151 [Journal ] Dimitris J. Kavvadias , Martha Sideri The Inverse Satisfiability Problem. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1998, v:28, n:1, pp:152-163 [Journal ] Sanjeev Khanna , Rajeev Motwani , Madhu Sudan , Umesh V. Vazirani On Syntactic versus Computational Views of Approximability. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1998, v:28, n:1, pp:164-191 [Journal ] Stefan Felsner , Lorenz Wernisch Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1998, v:28, n:1, pp:192-209 [Journal ] Edith Cohen Fast Algorithms for Constructing t-Spanners and Paths with Stretch t. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1998, v:28, n:1, pp:210-236 [Journal ] Uwe Schwiegelshohn , Walter Ludwig , Joel L. Wolf , John Turek , Philip S. Yu Smart SMART Bounds for Weighted Response Time Scheduling. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1998, v:28, n:1, pp:237-253 [Journal ] Baruch Awerbuch , Yossi Azar , Avrim Blum , Santosh Vempala New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1998, v:28, n:1, pp:254-262 [Journal ] Baruch Awerbuch , Bonnie Berger , Lenore Cowen , David Peleg Near-Linear Time Construction of Sparse Neighborhood Covers. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1998, v:28, n:1, pp:263-277 [Journal ] David Avis , Bryan Beresford-Smith , Luc Devroye , Hossam A. ElGindy , Eric Guévremont , Ferran Hurtado , Binhai Zhu Unoriented Theta-Maxima in the Plane: Complexity and Algorithms. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1998, v:28, n:1, pp:278-296 [Journal ] Jonathan E. Atkins , Erik G. Boman , Bruce Hendrickson A Spectral Algorithm for Seriation and the Consecutive Ones Problem. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1998, v:28, n:1, pp:297-310 [Journal ] Johannes Köbler , Osamu Watanabe New Collapse Consequences of NP Having Small Circuits. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1998, v:28, n:1, pp:311-324 [Journal ] Viliam Geffert , Carlo Mereghetti , Giovanni Pighizzini Sublogarithmic Bounds on Space and Reversals. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1998, v:28, n:1, pp:325-340 [Journal ] David Eppstein , Zvi Galil , Giuseppe F. Italiano , Thomas H. Spencer Separator-Based Sparsification II: Edge and Vertex Connectivity. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1998, v:28, n:1, pp:341-381 [Journal ]