Journals in DBLP

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

1. Andrew Lim, Brian Rodrigues, Fan Wang, Zhou Xu
   k-Center problems with minimum coverage. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:332, n:1-3, pp:1-17 [Journal]
   
2. Alain Daurat
   Determination of Q-convex sets by X-rays. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:332, n:1-3, pp:19-45 [Journal]
   
3. Lila Kari, Petr Sosík
   Aspects of shuffle and deletion on trajectories. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:332, n:1-3, pp:47-61 [Journal]
   
4. Steven S. Seiden, Peter P. Chen, R. F. Lax, Jianhua Chen, Guoli Ding
   New bounds for randomized busing. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:332, n:1-3, pp:63-81 [Journal]
   
5. Marc Demange, Vangelis Th. Paschos
   On-line vertex-covering. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:332, n:1-3, pp:83-108 [Journal]
   
6. Qingmin Shi, Joseph JáJá
   A new framework for addressing temporal range queries and some preliminary results. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:332, n:1-3, pp:109-121 [Journal]
   
7. Maria J. Serna, Luca Trevisan, Fatos Xhafa
   The approximability of non-Boolean satisfiability problems and restricted integer programming. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:332, n:1-3, pp:123-139 [Journal]
   
8. Sylvain Lombardy, Jacques Sakarovitch
   Derivatives of rational expressions with multiplicity. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:332, n:1-3, pp:141-177 [Journal]
   
9. Jean Berstel, Luc Boasson, Michel Latteux
   Mixed languages. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:332, n:1-3, pp:179-198 [Journal]
   
10. Franz-Josef Brandenburg, Konstantin Skodinis
    Finite graph automata for linear and boundary graph languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:332, n:1-3, pp:199-232 [Journal]
    
11. Salvatore La Torre, Aniello Murano, Margherita Napoli
    Weak Muller acceptance conditions for tree automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:332, n:1-3, pp:233-250 [Journal]
    
12. Bernhard Fuchs, Winfried Hochstättler, Walter Kern
    Online matching on a line. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:332, n:1-3, pp:251-264 [Journal]
    
13. Vilhelm Dahllöf, Peter Jonsson, Magnus Wahlström
    Counting models for 2SAT and 3SAT formulae. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:332, n:1-3, pp:265-291 [Journal]
    
14. Nikola Jevtic, Alon Orlitsky, Narayana P. Santhanam
    A lower bound on compression of unknown alphabets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:332, n:1-3, pp:293-311 [Journal]
    
15. Marco Pedicini
    Greedy expansions and sets with deleted digits. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:332, n:1-3, pp:313-336 [Journal]
    
16. Klaus Weihrauch, Ning Zhong 0002
    Computing the solution of the Korteweg-de Vries equation with arbitrary precision on Turing. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:332, n:1-3, pp:337-366 [Journal]
    
17. A. Cincotti
    Three-player partizan games. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:332, n:1-3, pp:367-389 [Journal]
    
18. Longtao He, Binxing Fang, Jie Sui
    The wide window string matching algorithm. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:332, n:1-3, pp:391-404 [Journal]
    
19. Jean Cardinal, Stefan Langerman
    Designing small keyboards is hard. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:332, n:1-3, pp:405-415 [Journal]
    
20. Hiroshi Nagamochi
    On the one-sided crossing minimization in a bipartite graph with large degrees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:332, n:1-3, pp:417-446 [Journal]
    
21. Hong-Gwa Yeh, Xuding Zhu
    Resource-sharing system scheduling and circular chromatic number. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:332, n:1-3, pp:447-460 [Journal]
    
22. H. J. Huang, Li Jiao, To-Yat Cheung
    Property-preserving subnet reductions for designing manufacturing systems with shared resources. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:332, n:1-3, pp:461-485 [Journal]
    
23. Harumichi Nishimura, Masanao Ozawa
    Uniformity of quantum circuit families for error-free algorithms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:332, n:1-3, pp:487-496 [Journal]
    
24. Cristina Bazgan, Jérôme Monnot, Vangelis Th. Paschos, Fabrice Serrière
    On the differential approximation of MIN SET COVER. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:332, n:1-3, pp:497-513 [Journal]
    
25. Jesper Makholm Byskov, Bolette Ammitzbøll Madsen, Bjarke Skjernaa
    New algorithms for Exact Satisfiability. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:332, n:1-3, pp:515-541 [Journal]
    
26. Reza Gharavi, V. Anantharam
    An upper bound for the largest Lyapunov exponent of a Markovian product of nonnegative matrices. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:332, n:1-3, pp:543-557 [Journal]
    
27. Dekel Tsur
    Sequencing by hybridization with errors: handling longer sequences. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:332, n:1-3, pp:559-566 [Journal]
    
28. Maxime Crochemore, Jacques Désarménien, Dominique Perrin
    A note on the Burrows - CWheeler transformation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:332, n:1-3, pp:567-572 [Journal]
    
29. Ali Aberkane, James D. Currie
    The Thue-Morse word contains circular 5/2+ power free words of every length. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:332, n:1-3, pp:573-581 [Journal]