Journals in DBLP
Pankaj K. Agarwal , Hongyan Wang Approximation Algorithms for Curvature-Constrained Shortest Paths. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2000, v:30, n:6, pp:1739-1772 [Journal ] Farhad Shahrokhi , Ondrej Sýkora , László A. Székely , Imrich Vrto On Bipartite Drawings and the Linear Arrangement Problem. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2000, v:30, n:6, pp:1773-1789 [Journal ] Alan M. Frieze Edge-Disjoint Paths in Expander Graphs. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2000, v:30, n:6, pp:1790-1801 [Journal ] Omer Berkman , Michal Parnas , Jiri Sgall Efficient Dynamic Traitor Tracing. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2000, v:30, n:6, pp:1802-1828 [Journal ] Harry Buhrman , Richard Cleve , Wim van Dam Quantum Entanglement and Communication Complexity. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2000, v:30, n:6, pp:1829-1841 [Journal ] Noga Alon , Michael Krivelevich , Ilan Newman , Mario Szegedy Regular Languages are Testable with a Constant Number of Queries. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2000, v:30, n:6, pp:1842-1862 [Journal ] Sanjeev Khanna , Madhu Sudan , Luca Trevisan , David P. Williamson The Approximability of Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2000, v:30, n:6, pp:1863-1920 [Journal ] Waleed Meleis Dual-Issue Scheduling for Binary Trees with Spills and Pipelined Loads. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2000, v:30, n:6, pp:1921-1941 [Journal ] Tao Jiang , Paul E. Kearney , Ming Li A Polynomial Time Approximation Scheme for Inferring Evolutionary Trees from Quartet Topologies and Its Application. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2000, v:30, n:6, pp:1942-1961 [Journal ] Martin E. Dyer , Leslie Ann Goldberg , Catherine S. Greenhill , Mark Jerrum , Michael Mitzenmacher An Extension of Path Coupling and Its Application to the Glauber Dynamics for Graph Colorings. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2000, v:30, n:6, pp:1962-1975 [Journal ] Carlo Mereghetti , Giovanni Pighizzini Optimal Simulations between Unary Automata. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2000, v:30, n:6, pp:1976-1992 [Journal ] Mao-cheng Cai , Xiaotie Deng , Wenan Zang An Approximation Algorithm for Feedback Vertex Sets in Tournaments. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2000, v:30, n:6, pp:1993-2007 [Journal ] Daniele Micciancio The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2000, v:30, n:6, pp:2008-2035 [Journal ] Endre Boros , Vladimir Gurvich , Leonid Khachiyan , Kazuhisa Makino Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2000, v:30, n:6, pp:2036-2050 [Journal ] Aravind Srinivasan , Chung-Piaw Teo A Constant-Factor Approximation Algorithm for Packet Routing and Balancing Local vs. Global Criteria. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2000, v:30, n:6, pp:2051-2068 [Journal ] Chengbin Chu , Rémy La Variable-Sized Bin Packing: Tight Absolute Worst-Case Performance Ratios for Four Approximation Algorithms. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2000, v:30, n:6, pp:2069-2083 [Journal ] Grazyna Mirkowska , Andrzej Salwicki , Marian Srebrny , Andrzej Tarlecki First-Order Specifications of Programmable Data Types. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2000, v:30, n:6, pp:2084-2096 [Journal ]