Journals in DBLP

Theor. Comput. Sci.
2005, volume: 337, number: 1-3

1. Roberto Giacobazzi, Isabella Mastroeni
   Transforming semantics by abstract interpretation. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:337, n:1-3, pp:1-50 [Journal]
   
2. Gennaro Costagliola, Filomena Ferrucci, Carmine Gravino
   Adding symbolic information to picture models: definitions and properties. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:337, n:1-3, pp:51-104 [Journal]
   
3. Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter
   On the complexity of decidable cases of the commutation problem of languages. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:337, n:1-3, pp:105-118 [Journal]
   
4. Ian McQuillan
   The generative capacity of block-synchronized context-free grammars. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:337, n:1-3, pp:119-133 [Journal]
   
5. T. C. Edwin Cheng, Hans Kellerer, Vladimir Kotov
   Semi-on-line multiprocessor scheduling with given total processing time. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:337, n:1-3, pp:134-146 [Journal]
   
6. Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, Peter Widmayer
   Gathering of asynchronous robots with limited visibility. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:337, n:1-3, pp:147-168 [Journal]
   
7. Wai-fong Chuan
   Factors of characteristic words of irrational numbers. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:337, n:1-3, pp:169-182 [Journal]
   
8. Etsuro Moriya, Dieter Hofbauer, Maria Huber, Friedrich Otto
   On state-alternating context-free grammars. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:337, n:1-3, pp:183-216 [Journal]
   
9. Philip Bille
   A survey on tree edit distance and related problems. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:337, n:1-3, pp:217-239 [Journal]
   
10. Vânia M. F. Dias, Celina M. Herrera de Figueiredo, Jayme Luiz Szwarcfiter
    Generating bicliques of a graph in lexicographic order. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:337, n:1-3, pp:240-248 [Journal]
    
11. Michael Elkin, David Peleg
    Approximating k-spanner problems for kge2. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:337, n:1-3, pp:249-277 [Journal]
    
12. Dimitar P. Guelev, Dang Van Hung
    On the completeness and decidability of duration calculus with iteration. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:337, n:1-3, pp:278-304 [Journal]
    
13. Jianer Chen, Iyad A. Kanj
    On approximating minimum vertex cover for graphs with perfect matching. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:337, n:1-3, pp:305-318 [Journal]
    
14. Martin Aigner, Gianluca De Marco, Manuela Montangero
    The plurality problem with three colors and more. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:337, n:1-3, pp:319-330 [Journal]
    
15. Bodo Manthey, Rüdiger Reischuk
    The intractability of computing the Hamming distance. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:337, n:1-3, pp:331-346 [Journal]
    
16. Shlomo Hoory, Stefan Szeider
    Computing unsatisfiable k-SAT instances with few occurrences per variable. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:337, n:1-3, pp:347-359 [Journal]
    
17. Arthur W. Chou, Ker-I Ko
    The computational complexity of distance functions of two-dimensional domains. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:337, n:1-3, pp:360-369 [Journal]
    
18. Sun-Yuan Hsieh
    Embedding longest fault-free paths onto star graphs with more vertex faults. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:337, n:1-3, pp:370-378 [Journal]
    
19. Henk Bruin, Oksan Volkova
    The complexity of Fibonacci-like kneading sequences. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:337, n:1-3, pp:379-389 [Journal]
    
20. Li-Sha Huang, Minming Li, Bo Zhang
    Approximation of Walrasian equilibrium in single-minded auctions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:337, n:1-3, pp:390-398 [Journal]