Preuves combinatoires des identites d'Abel. - Jean Françon (Discret. Math., 1974)

Acyclic and Parking Functions. - Jean Françon (J. Comb. Theory A, 1975)

Arbres Binaires de Recherche: Propriétés Combinatioires et Applications. - Jean Françon (RAIRO Theor. Informatics Appl., 1976)

On the Analysis of Algorithms for Trees. - Jean Françon (Theor. Comput. Sci., 1977)

Description and Analysis of an Efficient Priority Queue Representation - Jean Françon; Gérard Viennot; Jean Vuillemin (FOCS, 1978)

Histoire de fichiers. - Jean Françon (RAIRO Theor. Informatics Appl., 1978)

Towards Analysing Sequences of Operations for Dynamic Data Structures (Preliminary Version) - Philippe Flajolet; Jean Françon; Jean Vuillemin (FOCS, 1979)

Computing Integrated Costs of Sequences of Operations with Application to Dictionaries - Philippe Flajolet; Jean Françon; Jean Vuillemin (STOC, 1979)

Permutations selon leurs pics, creux, doubles montées et double descentes, nombres d'euler et nombres de Genocchi. - Jean Françon; Gérard Viennot (Discret. Math., 1979)

Sequence of Operations Analysis for Dynamic Data Structures. - Philippe Flajolet; Jean Françon; Jean Vuillemin (J. Algorithms, 1980)

Arbres Bien Etiquetes et Fractions Multicontinues. - Didier Arquès; Jean Françon (CAAP, 1984)

Histoires de Files de Priorite avec Fusions. - Jean Françon; Claude Puech (CAAP, 1984)

Sur Le Nombre de Registres Nécessaires a L'évaluation D'une Expression Arithmétique. - Jean Françon (RAIRO Theor. Informatics Appl., 1984)

Une Approche Quantitative de L'Exclusion Mutuelle. - Jean Françon (RAIRO Theor. Informatics Appl., 1986)

Analysis of Dynamic Algorithms in D. E. Knuth's Model. - Jean Françon; B. Randrianarimanana; René Schott (CAAP, 1988)

Plant models faithful to botanical structure and developmentr. - Philippe de Reffye; Claude Edelin; Jean Françon; Marc Jaeger 002; Claude Puech (SIGGRAPH, 1988)

Comparison of Algorithms Controlling Concurrent Access to a Database: A Combinatorial Approach. - Didier Arquès; Jean Françon; M. T. Guichet; P. Guichet (Theor. Comput. Sci., 1988)

Dynamic Data Structures with Finite Population: A Combinatorial Analysis. - Jean Françon; B. Randrianarimanana; René Schott (FCT, 1989)

Elliptic Functions, Continued Fractions and Doubled Permutations. - Philippe Flajolet; Jean Françon (Eur. J. Comb., 1989)

Analysis of Dynamic Algorithms in Knuth's Model. - Jean Françon; B. Randrianarimanana; René Schott (Theor. Comput. Sci., 1990)

Algebraic Specification and Development in Geometric Modeling. - Yves Bertrand; Jean-François Dufourd; Jean Françon; Pascal Lienhardt (TAPSOFT, 1993)

Discrete Combinatorial Surfaces. - Jean Françon (CVGIP Graph. Model. Image Process., 1995)

On recent trends in discrete geometry in computer science. - Jean Françon (DGCI, 1996)

Recognizing arithmetic straight lines and planes. - Jean Françon; Jean-Maurice Schramm; Mohamed Tajine (DGCI, 1996)

Sur la topologie d'un plan arithmétique. - Jean Françon (Theor. Comput. Sci., 1996)

Supercover of Straight Lines, Planes and Triangles. - Eric Andres; Philippe Nehlig; Jean Françon (DGCI, 1997)

Tunnel-Free Supercover 3D Polygons and Polyhedra. - Eric Andres; Philippe Nehlig; Jean Françon (Comput. Graph. Forum, 1997)

Polyhedrization of the Boundary of a Voxel Object. - Jean Françon; Laurent Papier (DGCI, 1999)

Topological 3D-manifolds: a statistical study of the cells. - Jean Françon; Yves Bertrand (Theor. Comput. Sci., 2000)

A Symbolic Method to Analyse Patterns in Plant Structure. - Cedric Loi; Paul-Henry Cournède; Jean Françon (Comb. Probab. Comput., 2014)