Journals in DBLP

Theor. Comput. Sci.
2003, volume: 296, number: 1

1. Jie Wang
   Preface. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:296, n:1, pp:1-2 [Journal]
   
2. Oswin Aichholzer, Franz Aurenhammer, Ferran Hurtado, Hannes Krasser
   Towards compatible triangulations. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:296, n:1, pp:3-13 [Journal]
   
3. Jin-yi Cai, Eric Bach
   On testing for zero polynomials by a set of points with bounded precision. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:296, n:1, pp:15-25 [Journal]
   
4. Wun-Tat Chan, Tak Wah Lam, Hing-Fung Ting, Prudence W. H. Wong
   On-line stream merging in a general setting. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:296, n:1, pp:27-46 [Journal]
   
5. Otfried Cheong, Chan-Su Shin, Antoine Vigneron
   Computing farthest neighbors on a convex polytope. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:296, n:1, pp:47-58 [Journal]
   
6. Zhe Dang, Oscar H. Ibarra, Richard A. Kemmerer
   Generalized discrete timed automata: decidable approximations for safety verificatio. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:296, n:1, pp:59-74 [Journal]
   
7. Rob Duncan, Jianbo Qian, Antoine Vigneron, Binhai Zhu
   Polynomial time algorithms for three-label point labeling. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:296, n:1, pp:75-87 [Journal]
   
8. Liying Kang, Hong Qiao, Erfang Shan, Ding-Zhu Du
   Lower bounds on the minus domination and k-subdomination numbers. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:296, n:1, pp:89-98 [Journal]
   
9. Wen-Lian Hsu, Ross M. McConnell
   PC trees and circular-ones arrangements. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:296, n:1, pp:99-116 [Journal]
   
10. Michal Koucký
    Log-space constructible universal traversal sequences for cycles of length O(n^4.03). [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:296, n:1, pp:117-144 [Journal]
    
11. Xiang-Yang Li
    Generating well-shaped d-dimensional Delaunay Meshes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:296, n:1, pp:145-165 [Journal]
    
12. Enrico Nardelli, Guido Proietti, Peter Widmayer
    Finding the most vital node of a shortest path. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:296, n:1, pp:167-177 [Journal]
    
13. Bodo Manthey
    Non-approximability of weighted multiple sequence alignment. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:296, n:1, pp:179-192 [Journal]