Journals in DBLP

Theor. Comput. Sci.
2001, volume: 263, number: 1-2

1. Gerard J. Chang, Michel Deza, Yannis Manoussakis, Jean-Marc Steyaert
   Preface. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2001, v:263, n:1-2, pp:1- [Journal]
   
2. Hong-Gwa Yeh, Gerard J. Chang
   Weighted connected k-domination and weighted k-dominating clique in distance-hereditary graphs. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2001, v:263, n:1-2, pp:3-8 [Journal]
   
3. Komei Fukuda, Alain Prodon, Tadashi Sakuma
   Notes on acyclic orientations and the shelling lemma. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2001, v:263, n:1-2, pp:9-16 [Journal]
   
4. Frank Nielsen
   On point covers of c-oriented polygons. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2001, v:263, n:1-2, pp:17-29 [Journal]
   
5. Philippe Cara, Serge Lehman, Dmitrii V. Pasechnik
   On the number of inductively minimal geometries. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2001, v:263, n:1-2, pp:31-35 [Journal]
   
6. Dmitrii V. Pasechnik
   On computing Hilbert bases via the Elliot-MacMahon algorithm. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2001, v:263, n:1-2, pp:37-46 [Journal]
   
7. Reinhardt Euler
   Characterizing bipartite Toeplitz graphs. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2001, v:263, n:1-2, pp:47-58 [Journal]
   
8. V. Yegnanarayanan
   Graph colourings and partitions. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2001, v:263, n:1-2, pp:59-74 [Journal]
   
9. Yannis Manoussakis, Zsolt Tuza
   Ramsey numbers for tournaments. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2001, v:263, n:1-2, pp:75-85 [Journal]
   
10. Gyula Károlyi, Vera Rosta
    Generalized and geometric Ramsey numbers for cycles. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:263, n:1-2, pp:87-98 [Journal]
    
11. Guillaume Damiand, Michel Habib, Christophe Paul
    A simple paradigm for graph recognition: application to cographs and distance hereditary graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:263, n:1-2, pp:99-111 [Journal]
    
12. Bor-Kuan Lu, Fang-Rong Hsu, Chuan Yi Tang
    Finding the shortest boundary guard of a simple polygon. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:263, n:1-2, pp:113-121 [Journal]
    
13. Edward G. Belaga
    Mod 3 arithmetic on triangulated Riemann surfaces. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:263, n:1-2, pp:123-137 [Journal]
    
14. Li-Da Tong, Frank K. Hwang, Gerard J. Chang
    Channel graphs of bit permutation networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:263, n:1-2, pp:139-143 [Journal]
    
15. Hsien-Kuei Hwang
    Uniform asymptotics of some Abel sums arising in coding theory. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:263, n:1-2, pp:145-158 [Journal]
    
16. Eric Angel, Vassilis Zissimopoulos
    On the landscape ruggedness of the quadratic assignment problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:263, n:1-2, pp:159-172 [Journal]
    
17. Rabah Harbane, Marie-Claude Heydemann
    Efficient reconfiguration algorithms of de Bruijn and Kautz networks into linear arrays. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:263, n:1-2, pp:173-189 [Journal]
    
18. A. Quilliot
    Convexity and global optimization: a theoretical link. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:263, n:1-2, pp:191-204 [Journal]
    
19. Seiya Negami
    Note on Ramsey theorems for spatial graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:263, n:1-2, pp:205-210 [Journal]
    
20. Frank K. Hwang
    A complementary survey on double-loop networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:263, n:1-2, pp:211-229 [Journal]
    
21. Bruno Martin
    A simulation of cellular automata on hexagons by cellular automata on rings. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:263, n:1-2, pp:231-234 [Journal]
    
22. Patrice Calégari, Frédéric Guidec, Pierre Kuonen, Frank Nielsen
    Combinatorial optimization algorithms for radio network planning. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:263, n:1-2, pp:235-245 [Journal]
    
23. Odile Favaron, Y. Redouane
    Neighborhood unions and regularity in graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:263, n:1-2, pp:247-254 [Journal]
    
24. Cristina Bazgan, Amel Harkat-Benhamdine, Hao Li, Mariusz Wozniak
    Partitioning vertices of 1-tough graphs into paths. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:263, n:1-2, pp:255-261 [Journal]
    
25. C. Indermitte, Thomas M. Liebling, M. Troyanov, H. Clémençon
    Voronoi diagrams on piecewise flat surfaces and an application to biological growth. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:263, n:1-2, pp:263-274 [Journal]
    
26. Roger K. Yeh
    Finite-dimensional T-colorings of graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:263, n:1-2, pp:275-281 [Journal]
    
27. Mordecai J. Golin
    A combinatorial approach to Golomb forests. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:263, n:1-2, pp:283-304 [Journal]
    
28. Yasuko Matsui, Tomomi Matsui
    NP-completeness for calculating power indices of weighted majority games. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:263, n:1-2, pp:305-310 [Journal]
    
29. Michio Ozeki
    On the covering radius problem for ternary self-dual codes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:263, n:1-2, pp:311-332 [Journal]
    
30. Hao Li, Jianping Li
    Independent triangles covering given vertices of a graph. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:263, n:1-2, pp:333-344 [Journal]
    
31. Hiroshi Maehara, Norihide Tokushige
    When does a planar bipartite framework admit a continuous deformation? [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:263, n:1-2, pp:345-354 [Journal]
    
32. Szu-En Cheng, Ko-Wei Lih
    An improvement on a spernerity proof of Horrocks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:263, n:1-2, pp:355-377 [Journal]