| Publication | Date of Publication | Type |
|---|
| Separation by convex pseudo-circles | 2021-04-29 | Paper |
| Separation by Convex Pseudo-Circles | 2018-04-23 | Paper |
| Araucaria Trees: Construction and Grafting Theorems | 2013-06-27 | Paper |
| CENTROID TRIANGULATIONS FROM k-SETS | 2012-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5445184 | 2008-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3416098 | 2007-01-19 | Paper |
| Machines, Computations, and Universality | 2005-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5465068 | 2005-08-22 | Paper |
| Two optimal parallel algorithms on the commutation class of a word | 2004-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4547809 | 2002-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4504033 | 2000-09-14 | Paper |
| A bijection between cliques in graphs and factorizations in free monoids | 2000-06-15 | Paper |
| Angular properties of Delaunay diagrams in any dimension | 1999-12-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4347985 | 1997-11-24 | Paper |
| Meta-resolution: An algorithmic formalisation | 1997-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4712101 | 1992-06-25 | Paper |
| Merging in maps and in pavings | 1991-01-01 | Paper |
| Construction of Voronoi diagrams in the plane by using maps | 1990-01-01 | Paper |
| Every finitely generated submonoid of a free monoid has a finite Malcev's presentation | 1989-01-01 | Paper |
| Sur les automates qui reconnaissent une famille de langages. (On the automata which accept a family of languages) | 1989-01-01 | Paper |
| La reconnaissance des facteurs d'un langage fini dans un texte en temps linéaire. (Recognition of the factors of a finite language in a text in linear time) | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3828202 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3804220 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3805932 | 1988-01-01 | Paper |
| La reconnaissance des facteurs d'un mot dans un texte | 1986-01-01 | Paper |
| Le calcul rapide des mélanges de deux mots. (Fast computing of the shuffle of two words) | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3727406 | 1986-01-01 | Paper |
| Systèmes entiers d'équations sur un alphabet fini et conjecture d'Ehrenfeucht | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3722740 | 1985-01-01 | Paper |
| Sur la classification syntaxique | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3921412 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4200394 | 1979-01-01 | Paper |
| Presentations et presentations simplifiables d'un monoide simplifiable | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4095073 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4103736 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4082676 | 1975-01-01 | Paper |
| Quelques constructions et algorithmes rélatifs aux sous-monoides d'un monoide libre | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4405370 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4771450 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5666766 | 1973-01-01 | Paper |
| Demi-groupes prelibres | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5648571 | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5659766 | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5566552 | 1969-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5538991 | 1968-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5549091 | 1968-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5552766 | 1967-01-01 | Paper |
