Systèmes Entiers d'Équations sur un Alphabet Fini et Conjecture d'Ehrenfeucht. - Jean-Claude Spehner (Theor. Comput. Sci., 1985)

Un Algorithme Determinant les Melanges de Deux Mots. - Jean-Claude Spehner (ICALP, 1986)

Le Calcul Rapide des Melanges de Deux Mots. - Jean-Claude Spehner (Theor. Comput. Sci., 1986)

La Reconnaissance des Facteurs d'un Mot dans un Texte. - Jean-Claude Spehner (Theor. Comput. Sci., 1986)

La Reconnaissance des Facteurs d'un Language Fini dans un Texte en Temps Lineaire (Resume). - Jean-Claude Spehner (ICALP, 1988)

La Reconnaissance des Facteurs d'un Langage Fini dans un Texte en Temps Lineaire. - Jean-Claude Spehner (Theor. Comput. Sci., 1988)

Construction of Voronoi Diagrams in the Plane by Using Maps. - Mounir Elbaz; Jean-Claude Spehner (Theor. Comput. Sci., 1990)

Merging in Maps and in Pavings. - Jean-Claude Spehner (Theor. Comput. Sci., 1991)

On Equiangularity of Delaunay Diagrams in Every Dimension. - Dominique Schmitt; Jean-Claude Spehner (CCCG, 1993)

A Bijection Between Cliques in Graphs and Factorizations in Free Monoids. - Jean-Claude Spehner (Theor. Comput. Sci., 1994)

Fast and Robust Computation of Molecular Surfaces. - Michel F. Sanner; Arthur J. Olson; Jean-Claude Spehner (SCG, 1995)

Meta-Resolution: An Algorithmic Formalisation. - Jean-Denis Fouks; Jean-Claude Spehner (Theor. Comput. Sci., 1996)

An increasing-circle sweep-algorithm to construct the delaunay diagram in the plane. - Bruno Adam; Pierre Kauffmann; Dominique Schmitt; Jean-Claude Spehner (CCCG, 1997)

A shrinking-circle sweep-algorithm to construct the farthest site delaunay diagram in the plane. - Bruno Adam; Pierre Kauffmann; Dominique Schmitt; Jean-Claude Spehner (CCCG, 1998)

Order-k Voronoi Diagrams, k-Sections, and k-Sets. - Dominique Schmitt; Jean-Claude Spehner (JCDCG, 1998)

Angular Properties of Delaunay Diagrams in Any Dimension. - Dominique Schmitt; Jean-Claude Spehner (Discret. Comput. Geom., 1999)

The Construction of Delaunay Diagrams by Lob Reduction. - Pierre Kauffmann; Jean-Claude Spehner (JCDCG, 2000)

On the Minimal Automaton of the Shuffle of Words and Araucarias. - René Schott; Jean-Claude Spehner (MCU, 2004)

Two optimal parallel algorithms on the commutation class of a word. - René Schott; Jean-Claude Spehner (Theor. Comput. Sci., 2004)

k-set polytopes and order-k Delaunay diagrams. - Dominique Schmitt; Jean-Claude Spehner (ISVD, 2006)

Shuffle of Words and Araucaria Trees. - René Schott; Jean-Claude Spehner (Fundam. Informaticae, 2006)

Erratum for "Shuffle of Words and Araucaria Trees". - René Schott; Jean-Claude Spehner (Fundam. Informaticae, 2007)

Centroid Triangulations from k-Sets. - Wael El Oraiby; Dominique Schmitt; Jean-Claude Spehner (Int. J. Comput. Geom. Appl., 2011)

Araucaria Trees: Construction and Grafting Theorems. - Dominique Schmitt; Jean-Claude Spehner (Fundam. Informaticae, 2013)

Separation by Convex Pseudo-Circles. - Nicolas Chevallier; Augustin Fruchard; Dominique Schmitt; Jean-Claude Spehner (Discret. Comput. Geom., 2021)