Journals in DBLP

SIAM J. Comput.
1995, volume: 24, number: 5

1. Arthur W. Chou, Ker-I Ko
   Computational Complexity of Two-Dimensional Regions. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1995, v:24, n:5, pp:923-947 [Journal]
   
2. Mark Giesbrecht
   Nearly Optimal Algorithms for Canonical Matrix Forms. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1995, v:24, n:5, pp:948-969 [Journal]
   
3. Robert F. Cohen, Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis
   Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar ST-Digraphs. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1995, v:24, n:5, pp:970-1001 [Journal]
   
4. Gary L. Miller, Joseph Naor
   Flow in Planar Graphs with Multiple Sources and Sinks. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1995, v:24, n:5, pp:1002-1017 [Journal]
   
5. Bernd Gärtner
   A Subexponential Algorithm for Abstract Optimization Problems. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1995, v:24, n:5, pp:1018-1035 [Journal]
   
6. Suresh Chari, Pankaj Rohatgi, Aravind Srinivasan
   Randomness-Optimal Unique Element Isolation with Applications to Perfect Matching and Related Problems. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1995, v:24, n:5, pp:1036-1050 [Journal]
   
7. Franz Höfting, Egon Wanke
   Minimum Cost Paths in Periodic Graphs. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1995, v:24, n:5, pp:1051-1067 [Journal]
   
8. Mitsunori Ogihara
   Polynomial-Time Membership Comparable Sets. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1995, v:24, n:5, pp:1068-1081 [Journal]
   
9. Bin Fu
   With Quasilinear Queries EXP Is Not Polynomial Time Turing Reducible to Sparse Sets. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1995, v:24, n:5, pp:1082-1090 [Journal]
   
10. Arne Andersson, Thomas Ottmann
    New Tight Bounds on Uniquely Represented Dictionaries. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:5, pp:1091-1101 [Journal]
    
11. Ching-Chih Han, Kwei-Jay Lin, Jane W.-S. Liu
    Scheduling Jobs with Temporal Distance Constraints. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:5, pp:1102-1121 [Journal]
    
12. Tao Jiang, Ming Li
    On the Approximation of Shortest Common Supersequences and Longest Common Subsequences. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:5, pp:1122-1139 [Journal]