Jean-Claude Spehner

27 papers A* 3C 1Journal 15Unranked 8
YearRankTypeTitle / Venue / Authors
2021 J jnl
Separation by Convex Pseudo-Circles.
Discret. Comput. Geom.
Nicolas Chevallier, Augustin Fruchard, Dominique Schmitt, Jean-Claude Spehner
2014 A* conf
Separation by Convex Pseudo-Circles.
SoCG
Nicolas Chevallier, Augustin Fruchard, Dominique Schmitt, Jean-Claude Spehner
2013 J jnl
Araucaria Trees: Construction and Grafting Theorems.
Fundam. Informaticae
Dominique Schmitt, Jean-Claude Spehner
2011 J jnl
Centroid Triangulations from k-Sets.
Int. J. Comput. Geom. Appl.
Wael El Oraiby, Dominique Schmitt, Jean-Claude Spehner
2007 J jnl
Erratum for "Shuffle of Words and Araucaria Trees".
Fundam. Informaticae
René Schott, Jean-Claude Spehner
2006 J jnl
Shuffle of Words and Araucaria Trees.
Fundam. Informaticae
René Schott, Jean-Claude Spehner
2006 — conf
k-set polytopes and order-k Delaunay diagrams.
ISVD
Dominique Schmitt, Jean-Claude Spehner
2004 C conf
On the Minimal Automaton of the Shuffle of Words and Araucarias.
MCU
René Schott, Jean-Claude Spehner
2004 J jnl
Two optimal parallel algorithms on the commutation class of a word.
Theor. Comput. Sci.
René Schott, Jean-Claude Spehner
2000 — conf
The Construction of Delaunay Diagrams by Lob Reduction.
JCDCG
Pierre Kauffmann, Jean-Claude Spehner
2000 — conf
Two Optimal Parallel Algorithms on the Commutation Class of a Word.
Words, Languages & Combinatorics
René Schott, Jean-Claude Spehner
1999 J jnl
Angular Properties of Delaunay Diagrams in Any Dimension.
Discret. Comput. Geom.
Dominique Schmitt, Jean-Claude Spehner
1998 — conf
A shrinking-circle sweep-algorithm to construct the farthest site delaunay diagram in the plane.
CCCG
Bruno Adam, Pierre Kauffmann, Dominique Schmitt, Jean-Claude Spehner
1998 — conf
Order-
JCDCG
Dominique Schmitt, Jean-Claude Spehner
1997 — conf
An increasing-circle sweep-algorithm to construct the delaunay diagram in the plane.
CCCG
Bruno Adam, Pierre Kauffmann, Dominique Schmitt, Jean-Claude Spehner
1996 J jnl
Meta-Resolution: An Algorithmic Formalisation.
Theor. Comput. Sci.
Jean-Denis Fouks, Jean-Claude Spehner
1995 — conf
Fast and Robust Computation of Molecular Surfaces.
SCG
Michel F. Sanner, Arthur J. Olson, Jean-Claude Spehner
1994 J jnl
A Bijection Between Cliques in Graphs and Factorizations in Free Monoids.
Theor. Comput. Sci.
Jean-Claude Spehner
1993 — conf
On Equiangularity of Delaunay Diagrams in Every Dimension.
CCCG
Dominique Schmitt, Jean-Claude Spehner
1991 J jnl
Merging in Maps and in Pavings.
Theor. Comput. Sci.
Jean-Claude Spehner
1990 J jnl
Construction of Voronoi Diagrams in the Plane by Using Maps.
Theor. Comput. Sci.
Mounir Elbaz, Jean-Claude Spehner
1988 J jnl
La Reconnaissance des Facteurs d'un Langage Fini dans un Texte en Temps Lineaire.
Theor. Comput. Sci.
Jean-Claude Spehner
1988 A* conf
La Reconnaissance des Facteurs d'un Language Fini dans un Texte en Temps Lineaire (Resume).
ICALP
Jean-Claude Spehner
1986 J jnl
La Reconnaissance des Facteurs d'un Mot dans un Texte.
Theor. Comput. Sci.
Jean-Claude Spehner
1986 J jnl
Le Calcul Rapide des Melanges de Deux Mots.
Theor. Comput. Sci.
Jean-Claude Spehner
1986 A* conf
Un Algorithme Determinant les Melanges de Deux Mots.
ICALP
Jean-Claude Spehner
1985 J jnl
Systèmes Entiers d'Équations sur un Alphabet Fini et Conjecture d'Ehrenfeucht.
Theor. Comput. Sci.
Jean-Claude Spehner