Journals in DBLP

Theor. Comput. Sci.
1999, volume: 225, number: 1-2

1. Maryse Pelletier, Jacques Sakarovitch
   On the Representation of Finite Deterministic 2-Tape Automata. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1999, v:225, n:1-2, pp:1-63 [Journal]
   
2. Pierluigi Crescenzi, Luca Trevisan
   Max NP-completeness Made Easy. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1999, v:225, n:1-2, pp:65-79 [Journal]
   
3. Zsuzsanna Róka
   Simulations between Cellular Automata on Cayley Graphs. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1999, v:225, n:1-2, pp:81-111 [Journal]
   
4. Andrea E. F. Clementi, Luca Trevisan
   Improved Non-Approximability Results for Minimum Vertex Cover with Density Constraints. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1999, v:225, n:1-2, pp:113-128 [Journal]
   
5. Wai-fong Chuan
   Sturmian Morphisms and alpha-Words. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1999, v:225, n:1-2, pp:129-148 [Journal]
   
6. Ismo Hakala, Juha Kortelainen
   On the System of Word Equations x₀uⁱ₁x₁uⁱ₂x₂uⁱ₃x₃=y₀v< [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1999, v:225, n:1-2, pp:149-161 [Journal]
   
7. Pak-Ken Wong
   Optimal Path Cover Problem on Block Graphs. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1999, v:225, n:1-2, pp:163-169 [Journal]
   
8. Josep M. Basart, Pere Guitart
   A Solution for the Coloured Cubes Problem. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1999, v:225, n:1-2, pp:171-176 [Journal]
   
9. Manfred Göbel
   The "Smallest" Ring of Polynomial Invariants of a Permutation Group which has No Finite SAGBI Bases w.r.t. Any Admissible Order. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1999, v:225, n:1-2, pp:177-184 [Journal]
   
10. Jack H. Lutz, David L. Schweizer
    Feasible Reductions to Kolmogorov-Loveland Stochastic Sequences. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:225, n:1-2, pp:185-194 [Journal]