| A fast algorithm for building lattices L Nourine, O Raynaud Information processing letters 71 (5-6), 199-204, 1999 | 390 | 1999 |
| A fast incremental algorithm for building lattices L Nourine, O Raynaud Journal of Experimental & Theoretical Artificial Intelligence 14 (2-3), 217-227, 2002 | 55 | 2002 |
| Encoding of multiple inheritance hierarchies and partial orders Y Caseau, M Habib, L Nourine, O Raynaud Computational Intelligence 15 (1), 50-62, 1999 | 42 | 1999 |
| A quasi optimal bit-vector encoding of tree hierarchies. application to efficient type inclusion tests O Raynaud, E Thierry ECOOP 2001—Object-Oriented Programming: 15th European Conference Budapest …, 2001 | 29 | 2001 |
| Computational aspects of the 2-dimension of partially ordered sets M Habib, L Nourine, O Raynaud, E Thierry Theoretical Computer Science 312 (2-3), 401-431, 2004 | 27 | 2004 |
| Counting of Moore families for n= 7 P Colomb, A Irlande, O Raynaud Formal Concept Analysis: 8th International Conference, ICFCA 2010, Agadir …, 2010 | 26 | 2010 |
| A new lattice-based heuristic for taxonomy encoding M Habib, L Nourine, O Raynaud Proc. KRUSE 97, 60-71, 1997 | 20 | 1997 |
| Efficient algorithms for clone items detection. R Medina, C Noyer, O Raynaud CLA 5, 70-81, 2005 | 17 | 2005 |
| Pruning graphs with digital search trees. application to distance hereditary graphs JM Lanlignel, O Raynaud, E Thierry STACS 2000: 17th Annual Symposium on Theoretical Aspects of Computer Science …, 2000 | 15 | 2000 |
| Practical use of formal concept analysis in service-oriented computing S Chollet, V Lestideau, Y Maurel, E Gandrille, P Lalanda, O Raynaud Formal Concept Analysis: 10th International Conference, ICFCA 2012, Leuven …, 2012 | 13 | 2012 |
| The complexity of embedding orders into small products of chains O Raynaud, E Thierry Order 27 (3), 365-381, 2010 | 11 | 2010 |
| A closed sets based learning classifier for implicit authentication in web browsing D Dia, G Kahn, F Labernia, Y Loiseau, O Raynaud Discrete Applied Mathematics 273, 65-80, 2020 | 9 | 2020 |
| Interactive association rules discovery R Medina, L Nourine, O Raynaud Formal Concept Analysis: 4th International Conference, ICFCA 2006, Dresden …, 2006 | 9 | 2006 |
| Building fca-based decision trees for the selection of heterogeneous services S Chollet, V Lestideau, P Lalanda, Y Maurel, P Colomb, O Raynaud 2011 IEEE International Conference on Services Computing, 616-623, 2011 | 7 | 2011 |
| Semantic mediation for a posteriori log analysis F Dernaika, N Cuppens-Boulahia, F Cuppens, O Raynaud Proceedings of the 14th International Conference on Availability …, 2019 | 6 | 2019 |
| Accountability in the A posteriori access control: A requirement and a mechanism F Dernaika, N Cuppens-Boulahia, F Cuppens, O Raynaud Quality of Information and Communications Technology: 13th International …, 2020 | 5 | 2020 |
| Twins vertices in hypergraphs R Medina, C Noyer, O Raynaud Electronic Notes in Discrete Mathematics 27, Pages 87-89, 2006 | 5 | 2006 |
| A tool for classification of sequential data G Kahn, Y Loiseau, O Raynaud ECAI 2016 (Workshop FCA4AI), 2016 | 4 | 2016 |
| Generalized polychotomic encoding: A very short bit-vector encoding of tree hierarchies P Colomb, O Raynaud, E Thierry International Conference on Modelling, Computation and Optimization in …, 2008 | 4 | 2008 |
| Encoding partial orders through modular decomposition L Beaudou, K Ghazi, G Kahn, O Raynaud, E Thierry Journal of Computational Science 25, 446-455, 2018 | 3 | 2018 |
Lhouari NourineUniversity Clermont AuvergneAdresse e-mail validée de isima.fr
