Journals in DBLP

SIAM J. Comput.
2005, volume: 35, number: 3

1. Klaus Jansen, Lorant Porkolab
   General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2005, v:35, n:3, pp:519-530 [Journal]
   
2. Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Sándor P. Fekete, Joseph S. B. Mitchell, Saurabh Sethia
   Optimal Covering Tours with Turn Costs. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2005, v:35, n:3, pp:531-566 [Journal]
   
3. Darin Goldstein, Kojiro Kobayashi
   On the Complexity of Network Synchronization. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2005, v:35, n:3, pp:567-589 [Journal]
   
4. Ernst-Erich Doberkat
   Stochastic Relations: Congruences, Bisimulations and the Hennessy--Milner Theorem. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2005, v:35, n:3, pp:590-626 [Journal]
   
5. Bernard Chazelle, Ding Liu, Avner Magen
   Sublinear Geometric Algorithms. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2005, v:35, n:3, pp:627-646 [Journal]
   
6. Bjørn Kjos-Hanssen, André Nies, Frank Stephan
   Lowness for the Class of Schnorr Random Reals. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2005, v:35, n:3, pp:647-657 [Journal]
   
7. Minming Li, F. Frances Yao
   An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2005, v:35, n:3, pp:658-671 [Journal]
   
8. Michael Elkin, Guy Kortsarz
   A Combinatorial Logarithmic Approximation Algorithm for the Directed Telephone Broadcast Problem. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2005, v:35, n:3, pp:672-689 [Journal]
   
9. Dirk L. Vertigan
   The Computational Complexity of Tutte Invariants for Planar Graphs. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2005, v:35, n:3, pp:690-712 [Journal]
   
10. Chandra Chekuri, Sanjeev Khanna
    A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:35, n:3, pp:713-728 [Journal]
    
11. Weiping Shi, Chen Su
    The Rectilinear Steiner Arborescence Problem Is NP-Complete. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:35, n:3, pp:729-740 [Journal]
    
12. Meghanad D. Wagh, Osman Guzide
    Mapping Cycles and Trees on Wrap-Around Butterfly Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:35, n:3, pp:741-765 [Journal]
    
13. Hung Quang Ngo
    WDM Switching Networks, Rearrangeable and Nonblocking [w, f]-connectors. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:35, n:3, pp:766-785 [Journal]