Journals in DBLP

Theor. Comput. Sci.
2003, volume: 307, number: 2

1. Didier Arquès, Anne Micheli
   A generalization of the language of ukasiewicz coding rooted planar hypermaps. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:307, n:2, pp:221-239 [Journal]
   
2. Nicolas Bonichon, Mohamed Mosbah
   Watermelon uniform random generation with applications. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:307, n:2, pp:241-256 [Journal]
   
3. Mireille Bousquet-Mélou, Marko Petkovsek
   Walks confined in a quadrant are not always D-finite. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:307, n:2, pp:257-276 [Journal]
   
4. Michel Bousquet, Cedric Chauve, Gilbert Labelle, Pierre Leroux
   Two bijective proofs for the arborescent form of the Good-Lagrange formula and some applications to colored rooted trees and cacti. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:307, n:2, pp:277-302 [Journal]
   
5. L. Sunil Chandran, Louis Ibarra, Frank Ruskey, Joe Sawada
   Generating and characterizing the perfect elimination orderings of a chordal graph. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:307, n:2, pp:303-317 [Journal]
   
6. Emeric Deutsch, Helmut Prodinger
   A bijection between directed column-convex polyominoes and ordered trees of height at most three. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:307, n:2, pp:319-325 [Journal]
   
7. Luca Ferrari, Elisabetta Grazzini, Elisa Pergola, Simone Rinaldi
   Some bijective results about the area of Schröder paths. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:307, n:2, pp:327-335 [Journal]
   
8. Gilbert Labelle, Cédric Lamathe, Pierre Leroux
   A classification of plane and planar 2-trees. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:307, n:2, pp:337-363 [Journal]
   
9. Marc Noy
   Graphs determined by polynomial invariants. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:307, n:2, pp:365-384 [Journal]
   
10. Dominique Poulalhon, Gilles Schaeffer
    A bijection for triangulations of a polygon with interior points and multiple edges. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:307, n:2, pp:385-401 [Journal]
    
11. Louis W. Shapiro
    Bijections and the Riordan group. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:307, n:2, pp:403-413 [Journal]
    
12. Vincent Vajnovszki
    A loopless algorithm for generating the permutations of a multiset. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:307, n:2, pp:415-431 [Journal]
    
13. Markus Vöge, Anthony J. Guttmann
    On the number of hexagonal polyominoes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:307, n:2, pp:433-453 [Journal]