Journals in DBLP

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

1. Julien Cervelle, Enrico Formenti, Benoît Masson
   From sandpiles to sand automata. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:381, n:1-3, pp:1-28 [Journal]
   
2. Feng Wang 0002, David Hongwei Du, Xiaohua Jia, Ping Deng, Weili Wu, David Maccallum
   Non-unique probe selection and group testing. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:381, n:1-3, pp:29-32 [Journal]
   
3. Helmut Jürgensen, Ludwig Staiger, Hideki Yamasaki
   Finite automata encoding geometric figures. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:381, n:1-3, pp:33-43 [Journal]
   
4. Dimitrios Koukopoulos, Marios Mavronicolas, Paul G. Spirakis
   The increase of the instability of networks due to Quasi-Static link capacities. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:381, n:1-3, pp:44-56 [Journal]
   
5. Celina M. Herrera de Figueiredo, Luerbio Faria, Sulamita Klein, R. Sritharan
   On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:381, n:1-3, pp:57-67 [Journal]
   
6. Domingo Gómez, Jaime Gutierrez, Álvar Ibeas
   Optimal routing in double loop networks. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:381, n:1-3, pp:68-85 [Journal]
   
7. Frédérique Bassino, Cyril Nicaud
   Enumeration and random generation of accessible automata. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:381, n:1-3, pp:86-104 [Journal]
   
8. David Doty, Jared Nichols
   Pushdown dimension. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:381, n:1-3, pp:105-123 [Journal]
   
9. Mingxia Chen, Jianbo Li, Jianping Li, Weidong Li, Lusheng Wang
   Some approximation algorithms for the clique partition problem in weighted interval graphs. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:381, n:1-3, pp:124-133 [Journal]
   
10. A. Amiraslani, D. A. Aruliah, Robert M. Corless
    Block LU factors of generalized companion matrix pencils. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:381, n:1-3, pp:134-147 [Journal]
    
11. Ker-I Ko, Fuxiang Yu
    Jordan curves with polynomial inverse moduli of continuity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:381, n:1-3, pp:148-161 [Journal]
    
12. Tamás Fleiner, Robert W. Irving, David Manlove
    Efficient algorithms for generalized Stable Marriage and Roommates problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:381, n:1-3, pp:162-176 [Journal]
    
13. Dalia Krieger, Jeffrey Shallit
    Every real number greater than 1 is a critical exponent. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:381, n:1-3, pp:177-182 [Journal]
    
14. Michal Parnas, Dana Ron
    Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:381, n:1-3, pp:183-196 [Journal]
    
15. Carme Àlvarez, Rafel Cases, Josep Díaz, Jordi Petit, Maria J. Serna
    Communication tree problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:381, n:1-3, pp:197-217 [Journal]
    
16. Cheng-Kuan Lin, Jimmy J. M. Tan, D. Frank Hsu, Lih-Hsing Hsu
    On the spanning connectivity and spanning laceability of hypercube-like networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:381, n:1-3, pp:218-229 [Journal]
    
17. Jianliang Wu, Jianfeng Hou, Guizhen Liu
    The linear arboricity of planar graphs with no short cycles. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:381, n:1-3, pp:230-233 [Journal]
    
18. Cheng He, Yixun Lin, Jinjiang Yuan
    Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:381, n:1-3, pp:234-240 [Journal]
    
19. Weiping Shang, Peng-Jun Wan, F. Frances Yao, Xiaodong Hu
    Algorithms for minimum m-connected k-tuple dominating set problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:381, n:1-3, pp:241-247 [Journal]
    
20. Katerina Asdre, Stavros D. Nikolopoulos
    NP-completeness results for some problems on subclasses of bipartite and chordal graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:381, n:1-3, pp:248-259 [Journal]
    
21. Andreas Brandstädt, Elaine M. Eschen, R. Sritharan
    The induced matching and chain subgraph cover problems for convex bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:381, n:1-3, pp:260-265 [Journal]
    
22. Sylvain Lavallée, Christophe Reutenauer
    On a zeta function associated with automata and codes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:381, n:1-3, pp:266-273 [Journal]
    
23. Christian Choffrut, Flavio D'Alessandro, Stefano Varricchio
    On the separability of sparse context-free languages and of bounded rational relations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:381, n:1-3, pp:274-279 [Journal]
    
24. Vincenzo Bonifaci
    An adversarial queueing model for online server routing. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:381, n:1-3, pp:280-287 [Journal]
    
25. Sun-Yuan Hsieh, Shih-Cheng Yang
    Approximating the selected-internal Steiner tree. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:381, n:1-3, pp:288-291 [Journal]
    
26. Xinmao Wang, Yaokun Wu
    Minimum light number of lit-only sigma-game on a tree. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:381, n:1-3, pp:292-300 [Journal]