Journals in DBLP

Theor. Comput. Sci.
2007, volume: 374, number: 1-3

1. M. Murakami, Masao Hara, Makoto Yamamoto, Seiichi Tani
   Fast algorithms for computing Jones polynomials of certain links. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:374, n:1-3, pp:1-24 [Journal]
   
2. S. Nicolay, M. Rigo
   About frequencies of letters in generalized automatic sequences. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:374, n:1-3, pp:25-40 [Journal]
   
3. Biao Wu, Enyue Yao
   k-Partitioning problems with partition matroid constraint. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:374, n:1-3, pp:41-48 [Journal]
   
4. Ji Tian, Ruyan Fu, Jinjiang Yuan
   On-line scheduling with delivery time on a single batch machine. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:374, n:1-3, pp:49-57 [Journal]
   
5. Jamie Simpson
   Intersecting periodic words. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:374, n:1-3, pp:58-65 [Journal]
   
6. Yongxi Cheng
   Lattice grids and prisms are antimagic. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:374, n:1-3, pp:66-73 [Journal]
   
7. Erzsébet Csuhaj-Varjú, Ion Petre, György Vaszil
   Self-assembly of strings and languages. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:374, n:1-3, pp:74-81 [Journal]
   
8. Gerard J. Chang, Sen-Peng Eu, Chung-Heng Yeh
   On the (n, t)-antipodal Gray codes. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:374, n:1-3, pp:82-90 [Journal]
   
9. Estela Maris Rodrigues, Marie-France Sagot, Yoshiko Wakabayashi
   The maximum agreement forest problem: Approximation algorithms and computational experiments. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:374, n:1-3, pp:91-110 [Journal]
   
10. Niklas Eriksen
    Reversal and transposition medians. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:374, n:1-3, pp:111-126 [Journal]
    
11. Dietrich Kuske
    Weighted asynchronous cellular automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:374, n:1-3, pp:127-148 [Journal]
    
12. Noga Alon, Andrzej Lingas, Martin Wahlen
    Approximating the maximum clique minor and some subgraph homeomorphism problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:374, n:1-3, pp:149-158 [Journal]
    
13. L. L. Liu, C. T. Ng, T. C. Edwin Cheng
    Scheduling jobs with agreeable processing times and due dates on a single batch processing machine. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:374, n:1-3, pp:159-169 [Journal]
    
14. Jun-Ho Her, R. S. Ramakrishna
    An external-memory depth-first search algorithm for general grid graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:374, n:1-3, pp:170-180 [Journal]
    
15. Qiqi Yan
    Classifying regular languages by a split game. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:374, n:1-3, pp:181-190 [Journal]
    
16. Wenbin Chen 0002, Jiangtao Meng
    Hardness of approximating the Minimum Solutions of Linear Diophantine Equations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:374, n:1-3, pp:191-195 [Journal]
    
17. Ruyan Fu, Tian Ji, Jinjiang Yuan, Yixun Lin
    Online scheduling in a parallel batch processing system to minimize makespan using restarts. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:374, n:1-3, pp:196-202 [Journal]
    
18. Rastislav Kralovic, Peter Ruzicka
    Ranks of graphs: The size of acyclic orientation cover for deadlock-free packet routing. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:374, n:1-3, pp:203-213 [Journal]
    
19. Ina Mäurer
    Characterizations of recognizable picture series. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:374, n:1-3, pp:214-228 [Journal]
    
20. Dario Catalano, Ivan Visconti
    Hybrid commitments and their applications to zero-knowledge proof systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:374, n:1-3, pp:229-260 [Journal]
    
21. Stelvio Cimato, Roberto De Prisco, Alfredo De Santis
    Colored visual cryptography without color darkening. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:374, n:1-3, pp:261-276 [Journal]
    
22. Jerzy Mycka, José Félix Costa
    A new conceptual framework for analog computation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:374, n:1-3, pp:277-290 [Journal]