Lhouari Nourine
Lhouari Nourine
University Clermont Auvergne
Verified email at
Cited by
Cited by
A fast algorithm for building lattices
L Nourine, O Raynaud
Information processing letters 71 (5-6), 199-204, 1999
On the enumeration of minimal dominating sets and related notions
MM Kanté, V Limouzy, A Mary, L Nourine
SIAM Journal on Discrete Mathematics 28 (4), 1916-1929, 2014
Enumeration aspects of maximal cliques and bicliques
A Gély, L Nourine, B Sadi
Discrete applied mathematics 157 (7), 1447-1459, 2009
Efficient algorithms on distributive lattices
M Habib, R Medina, L Nourine, G Steiner
Discrete Applied Mathematics 110 (2-3), 169-187, 2001
Bit-vector encoding for partially ordered sets
M Habib, L Nourine
International Workshop on Orders, Algorithms, and Applications, 1-12, 1994
A fast incremental algorithm for building lattices
L Nourine, O Raynaud
Journal of Experimental & Theoretical Artificial Intelligence 14 (2-3), 217-227, 2002
Enumeration of minimal dominating sets and variants
MM Kanté, V Limouzy, A Mary, L Nourine
International Symposium on Fundamentals of Computation Theory, 298-309, 2011
Tree structure for distributive lattices and its applications
M Habib, L Nourine
Theoretical Computer Science 165 (2), 391-405, 1996
Linear space algorithm for on-line detection of global predicates
R Jegou, R Medina, L Nourine
Structures in Concurrency Theory: Proceedings of the International Workshop …, 1995
Protocol-based web service composition
R Ragab Hassen, L Nourine, F Toumani
Service-Oriented Computing–ICSOC 2008: 6th International Conference, Sydney …, 2008
Encoding of multiple inheritance hierarchies and partial orders
Y Caseau, M Habib, L Nourine, O Raynaud
Computational Intelligence 15 (1), 50-62, 1999
A polynomial delay algorithm for enumerating minimal dominating sets in chordal graphs
MM Kanté, V Limouzy, A Mary, L Nourine, T Uno
Graph-Theoretic Concepts in Computer Science: 41st International Workshop …, 2016
Polynomial delay algorithm for listing minimal edge dominating sets in graphs
MM Kanté, V Limouzy, A Mary, L Nourine, T Uno
Workshop on Algorithms and Data Structures, 446-457, 2015
A unified hierarchy for functional dependencies, conditional functional dependencies and association rules
R Medina, L Nourine
International Conference on Formal Concept Analysis, 98-113, 2009
Computing implications with negation from a formal context
R Missaoui, L Nourine, Y Renaud
Fundamenta Informaticae 115 (4), 357-375, 2012
On the enumeration and counting of minimal dominating sets in interval and permutation graphs
MM Kanté, V Limouzy, A Mary, L Nourine, T Uno
Algorithms and Computation: 24th International Symposium, ISAAC 2013, Hong …, 2013
Uncovering and reducing hidden combinatorics in Guigues-Duquenne bases
A Gély, R Medina, L Nourine, Y Renaud
Formal Concept Analysis: Third International Conference, ICFCA 2005, Lens …, 2005
Embedding partially ordered sets into chain-products
M Habib, M Huchard, L Nourine
Proceedings of KRUSE 95, 147-161, 1995
On the neighbourhood helly of some graph classes and applications to the enumeration of minimal dominating sets
MM Kanté, V Limouzy, A Mary, L Nourine
Algorithms and Computation: 23rd International Symposium, ISAAC 2012, Taipei …, 2012
The number of Moore families on n= 6
M Habib, L Nourine
Discrete Mathematics 294 (3), 291-296, 2005
The system can't perform the operation now. Try again later.
Articles 1–20