| 2005 |
|---|
| 12 | EE | Bertrand Cuissart,
Jean-Jacques Hébrard:
A Direct Algorithm to Find a Largest Common Connected Induced Subgraph of Two Graphs.
GbRPR 2005: 162-171 |
| 2003 |
|---|
| 11 | | Emmanuel Benoist,
Jean-Jacques Hébrard:
Recognition of Simple Enlarged Horn Formulas and Simple Extended Horn Formulas.
Ann. Math. Artif. Intell. 37(3): 251-272 (2003) |
| 10 | EE | Jean-Jacques Hébrard,
Bruno Zanuttini:
An efficient algorithm for Horn description.
Inf. Process. Lett. 88(4): 177-182 (2003) |
| 2002 |
|---|
| 9 | EE | Bruno Zanuttini,
Jean-Jacques Hébrard:
A unified framework for structure identification.
Inf. Process. Lett. 81(6): 335-339 (2002) |
| 2001 |
|---|
| 8 | | Bertrand Cuissart,
Bruno Crémilleux,
Jean-Jacques Hébrard,
Frédérique Touffet:
Prédiction de la biodégradabilité des composés chimiques : un apport des méthodes d'arbre de décision.
EGC 2001: 351 |
| 1998 |
|---|
| 7 | | Jean-Jacques Hébrard,
Philippe Luquet:
The Horn Basis of a Set of Clauses.
J. Log. Program. 34(1): 59-66 (1998) |
| 1997 |
|---|
| 6 | | Nadia Creignou,
Jean-Jacques Hébrard:
On Generating All Solutions of Generalized Satisfiability Problems.
ITA 31(6): 499-511 (1997) |
| 1995 |
|---|
| 5 | EE | Jean-Jacques Hébrard:
Unique Horn Renaming an Unique 2-Satisfiability.
Inf. Process. Lett. 54(4): 235-239 (1995) |
| 1994 |
|---|
| 4 | | Jean-Jacques Hébrard:
A Linear Algorithm for Renaming a Set of Clauses as a Horn Set.
Theor. Comput. Sci. 124(2): 343-350 (1994) |
| 1991 |
|---|
| 3 | | Jean-Jacques Hébrard:
An Algorithm for Distinguishing Efficiently Bit-Strings by their Subsequences.
Theor. Comput. Sci. 82(1): 35-49 (1991) |
| 1990 |
|---|
| 2 | | Yves Auffray,
Patrice Enjalbert,
Jean-Jacques Hébrard:
Strategies for Modal Resolution: Results and Problems.
J. Autom. Reasoning 6(1): 1-38 (1990) |
| 1986 |
|---|
| 1 | | Jean-Jacques Hébrard,
Maxime Crochemore:
Calcul de La Distance Par Les Sous-Mots.
ITA 20(4): 441-456 (1986) |
