Volume 307, Number 1, 26 September 2003
- Jean-Paul Allouche, Jeffrey Shallit:
The ring of k-regular sequences, II.
3-29
- Ali Aberkane:
Words whose complexity satisfies lim p(n)/n = 1.
31-46
- Boris Adamczewski:
Balances for fixed points of primitive substitutions.
47-75
- Dimitry S. Ananichev, Alessandra Cherubini, Mikhail V. Volkov:
Image reducing words and subgroups of free groups.
77-92
- Tullio Ceccherini-Silberstein, Antonio Machi, Fabio Scarabotti:
On the entropy of regular languages.
93-102
- Tullio Ceccherini-Silberstein, Wolfgang Woess:
Growth-sensitivity of context-free languages.
103-116
- Wit Forys, Tomasz Krawczyk, James A. Anderson:
Semiretracts--a counterexample and some results.
117-127
- Yannick Guesnet:
On maximal synchronous codes.
129-138
- Tero Harju, Dirk Nowotka:
On the independence of equations in three variables.
139-172
- Christophe Hohlweg, Christophe Reutenauer:
Lyndon words, permutations and trees.
173-178
- Patrice Séébold:
Lyndon factorization of the Prouhet words.
179-197
- Pedro V. Silva:
The homomorphism problem for trace monoids.
199-215
Volume 307, Number 2, 7 October 2003
Random Generation of Combinatorial Objects and Bijective Combinatorics Certosa, Italy, 18 November - 20 November 2001
- Didier Arquès, Anne Micheli:
A generalization of the language of ukasiewicz coding rooted planar hypermaps.
221-239
- Nicolas Bonichon, Mohamed Mosbah:
Watermelon uniform random generation with applications.
241-256
- Mireille Bousquet-Mélou, Marko Petkovsek:
Walks confined in a quadrant are not always D-finite.
257-276
- 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.
277-302
- L. Sunil Chandran, Louis Ibarra, Frank Ruskey, Joe Sawada:
Generating and characterizing the perfect elimination orderings of a chordal graph.
303-317
- Emeric Deutsch, Helmut Prodinger:
A bijection between directed column-convex polyominoes and ordered trees of height at most three.
319-325
- Luca Ferrari, Elisabetta Grazzini, Elisa Pergola, Simone Rinaldi:
Some bijective results about the area of Schröder paths.
327-335
- Gilbert Labelle, Cédric Lamathe, Pierre Leroux:
A classification of plane and planar 2-trees.
337-363
- Marc Noy:
Graphs determined by polynomial invariants.
365-384
- Dominique Poulalhon, Gilles Schaeffer:
A bijection for triangulations of a polygon with interior points and multiple edges.
385-401
- Louis W. Shapiro:
Bijections and the Riordan group.
403-413
- Vincent Vajnovszki:
A loopless algorithm for generating the permutations of a multiset.
415-431
- Markus Vöge, Anthony J. Guttmann:
On the number of hexagonal polyominoes.
433-453
Volume 307, Number 3, 14 October 2003
- L. H. Harper:
Accidental combinatorist, an autobiography.
457-472
- Sergei L. Bezrukov, Robert Elsässer:
Edge-isoperimetric problems for cartesian powers of regular graphs.
473-492
- Béla Bollobás, Imre Leader:
Union of shadows.
493-502
- Tiziana Calamoneri, Annalisa Massini, Imrich Vrto:
New results on edge-bandwidth.
503-513
- E. Rodney Canfield:
Integer partitions and the Sperner property.
515-529
- Josep Díaz, Norman Do, Maria J. Serna, Nicholas C. Wormald:
Bounds on the max and min bisection of random cubic and random 4-regular graphs.
531-547
- Robert Elsässer, Rastislav Kralovic, Burkhard Monien:
Sparse topologies with small spectrum size.
549-565
- David Muradian:
The bandwidth minimization problem for cyclic caterpillars with hair length 1 is NP-complete.
567-572
Last update Sat May 18 20:57:04 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
