Journals in DBLP

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

1. Xueliang Li, Xiaoyan Zhang
   On the minimum monochromatic or multicolored subgraph partition problems. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:385, n:1-3, pp:1-10 [Journal]
   
2. Yves Andre, Anne-Cécile Caron, Denis Debarbieux, Yves Roos, Sophie Tison
   Path constraints in semistructured data. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:385, n:1-3, pp:11-33 [Journal]
   
3. Shantanu Das, Paola Flocchini, Shay Kutten, Amiya Nayak, Nicola Santoro
   Map construction of unknown graphs by multiple agents. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:385, n:1-3, pp:34-48 [Journal]
   
4. My T. Thai, Ning Zhang, Ravi Tiwari, Xiaochun Xu
   On approximation algorithms of k-connected m-dominating sets in disk graphs. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:385, n:1-3, pp:49-59 [Journal]
   
5. Hajo Broersma, Xueliang Li
   On the complexity of dominating set problems related to the minimum all-ones problem. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:385, n:1-3, pp:60-70 [Journal]
   
6. Weifan Wang, Yongzhu Chen
   A sufficient condition for a planar graph to be class 1. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:385, n:1-3, pp:71-77 [Journal]
   
7. Giulia Galbiati, Francesco Maffioli
   Approximation algorithms for maximum cut with limited unbalance. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:385, n:1-3, pp:78-87 [Journal]
   
8. Ming Yu Hsieh, Shi-Chun Tsai
   On the fairness and complexity of generalized k-in-a-row games. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:385, n:1-3, pp:88-100 [Journal]
   
9. Maleq Khan, Gopal Pandurangan, V. S. Anil Kumar
   A simple randomized scheme for constructing low-weight k-connected spanning subgraphs with applications to distributed algorithms. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2007, v:385, n:1-3, pp:101-114 [Journal]
   
10. V. Y. Popov
    Multiple genome rearrangement by swaps and by element duplications. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:385, n:1-3, pp:115-126 [Journal]
    
11. Joong Chae Na, Kunsoo Park
    Alphabet-independent linear-time construction of compressed suffix arrays using o(nlogn)-bit working space. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:385, n:1-3, pp:127-136 [Journal]
    
12. Arturo Carpi
    On Dejean's conjecture over large alphabets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:385, n:1-3, pp:137-151 [Journal]
    
13. Chiara Epifanio, Alessandra Gabriele, Filippo Mignosi, Antonio Restivo, Marinella Sciortino
    Languages with mismatches. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:385, n:1-3, pp:152-166 [Journal]
    
14. Aduri Pavan, Alan L. Selman, Samik Sengupta, N. V. Vinodchandran
    Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:385, n:1-3, pp:167-178 [Journal]
    
15. Francine Blanchet-Sadri, Nathan D. Wetzler
    Partial words and the critical factorization theorem revisited. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:385, n:1-3, pp:179-192 [Journal]
    
16. Verónica Becher, Serge Grigorieff
    Random reals à la Chaitin with or without prefix-freeness. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:385, n:1-3, pp:193-201 [Journal]
    
17. André Berger, Takuro Fukunaga, Hiroshi Nagamochi, Ojas Parekh
    Approximability of the capacitated b-edge dominating set problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:385, n:1-3, pp:202-213 [Journal]
    
18. Nicolas Bedaride
    Classification of rotations on the torus T². [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:385, n:1-3, pp:214-225 [Journal]
    
19. Dieter Kratsch, Mathieu Liedloff
    An exact algorithm for the minimum dominating clique problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:385, n:1-3, pp:226-240 [Journal]
    
20. Guillaume Blin, Guillaume Fertin, Stéphane Vialette
    Extracting constrained 2-interval subsets in 2-interval sets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:385, n:1-3, pp:241-263 [Journal]
    
21. Francesco M. Malvestuto, Mauro Mezzini, Marina Moscarini
    An analytical approach to the inference of summary data of additive type. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:385, n:1-3, pp:264-285 [Journal]
    
22. Jywe-Fei Fang
    The bipanconnectivity and m-panconnectivity of the folded hypercube. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:385, n:1-3, pp:286-300 [Journal]