-
Algorithms Seminar, 2000-2001
These seminar notes constitute the proceedings of a seminar devoted to the analysis of algorithms and related topics. The subjects covered include combinatorics,... -
Fiedler Vectors and Elongation of Graphs: A Threshold Phenomenon on a Particu...
Let G be a graph. Its laplacian matrix L(G) is positive and we consider eigenvectors of its first non-null eigenvalue that are called Fiedler vector. They have been... -
Algorithms Seminar, 1999-2000
These seminar notes constitute the proceedings of a seminar devoted to the analysis of algorithms and related topics. The subjects covered include combinatorics,... -
Polynomial Ideals for Sandpiles and their Gröbner Bases
A polynomial ideal encoding topplings in the abelian sandpile model on a graph is introduced. A Gröbner basis of this ideal is interpreted combinator- ially in terms... -
Algorithms seminar, 1998-1999
These seminar notes represent the proceedings of a seminar devoted to the analysis of algorithms and related topics. The subjects covered include combinatorics,... -
1 803 601 800 : de l'art des nombres à l'analyse, une autre voie ?
The number in the title appears in a problem proposed to Pierre Fermat by M. de Saint-Martin, a member of the Mersenne's circle. I reconstitute what is at stakes in... -
Dynamic programming for graphs on surfaces
International audience -
Identification problems in graphs
In this thesis, we study problems on vertices identification of graphs. To identify the vertices of a graph consists in giving to each vertex of the graph an object... -
Algebraic combinatorics on trees
This thesis comes within the scope of algebraic combinatorics and deals with the construction of several combinatorial and algebraic structures on different tree... -
Yeast ancestral genome reconstructions: the possibilities of computational me...
International audience -
Reaction Motifs in Metabolic Networks
The classic view of metabolism as a collection of metabolic pathways is being questioned with the currently available possibility of studying whole networks. Novel... -
Algorithms Seminar, 2002-2004
These seminar notes constitute the proceedings of a seminar devoted to the analysis of algorithms and related topics. The subjects covered include combinatorics,... -
Identification de sommets dans les graphes
The work presented in this document deals with identifying codes in graphs. This notion, introduced in the late 1990's, models fault-detection problems in networks. An... -
A note on Sturmian words
International audience -
Counting and generating lambda terms
Lambda calculus is the basis of functional programming and higher order proof assistants. However, little is known about combinatorial properties of lambda terms, in... -
On the combinatorics of suffix arrays
International audience -
Counting and generating lambda terms
International audience
