Journals in DBLP
Preface. [Citation Graph (, )][DBLP ] Combinatoire des mots et étude quantitative de la sérialisabilité: Application à la concurrence d'accès à une base de données. [Citation Graph (, )][DBLP ] A new color change to improve the coloring of a graph. [Citation Graph (, )][DBLP ] Algorithms for sequential generation of combinatorial structures. [Citation Graph (, )][DBLP ] Average sizes of suffix trees and DAWGs. [Citation Graph (, )][DBLP ] Learning faster than promised by the Vapnik-Chervonenkis dimension. [Citation Graph (, )][DBLP ] Matchings and -matroids. [Citation Graph (, )][DBLP ] König-Egerváry graphs, 2-bicritical graphs and fractional matchings. [Citation Graph (, )][DBLP ] Enumeration of factors in the Thue-Morse word. [Citation Graph (, )][DBLP ] Induced matchings. [Citation Graph (, )][DBLP ] Coding for write-unidirectional memories and conflict resolution. [Citation Graph (, )][DBLP ] Elementary proofs of (relatively) recent characterizations of Eulerian graphs. [Citation Graph (, )][DBLP ] Fixpoint strategies for deductive databases. [Citation Graph (, )][DBLP ] Maximal partial clones determined by the areflexive relations. [Citation Graph (, )][DBLP ] Codes and matrices in studies on designs. [Citation Graph (, )][DBLP ] Factorisations courtes dans un groupe fini. [Citation Graph (, )][DBLP ] TC operations and Latin bricks. [Citation Graph (, )][DBLP ] Fault-tolerant routings in Kautz and de Bruijn networks. [Citation Graph (, )][DBLP ] Anti-commutative languages and n-codes. [Citation Graph (, )][DBLP ] Extensions de réseaux de connexité donnée. [Citation Graph (, )][DBLP ] Dyck paths of knight moves. [Citation Graph (, )][DBLP ] Concurrency measure in commutation monoids. [Citation Graph (, )][DBLP ] Finite automata for languages of combinatorial interest: An order theoretical point of view. [Citation Graph (, )][DBLP ] An algebraic point of view of the data structures of database systems. [Citation Graph (, )][DBLP ] 