Lhouari Nourine
Lhouari Nourine
University Clermont Auvergne
Bestätigte E-Mail-Adresse bei isima.fr
Titel
Zitiert von
Zitiert von
Jahr
A fast algorithm for building lattices
L Nourine, O Raynaud
Information processing letters 71 (5-6), 199-204, 1999
3461999
Enumeration aspects of maximal cliques and bicliques
A Gély, L Nourine, B Sadi
Discrete applied mathematics 157 (7), 1447-1459, 2009
742009
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
722014
Bit-vector encoding for partially ordered sets
M Habib, L Nourine
International Workshop on Orders, Algorithms, and Applications, 1-12, 1994
541994
A fast incremental algorithm for building lattices
L Nourine, O Raynaud
Journal of Experimental & Theoretical Artificial Intelligence 14 (2-3), 217-227, 2002
522002
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
492011
Efficient algorithms on distributive lattices
M Habib, R Medina, L Nourine, G Steiner
Discrete Applied Mathematics 110 (2-3), 169-187, 2001
482001
Tree structure for distributive lattices and its applications
M Habib, L Nourine
Theoretical Computer Science 165 (2), 391-405, 1996
461996
Linear space algorithm for on-line detection of global predicates
R Jegou, R Medina, L Nourine
Structures in Concurrency Theory, 175-189, 1995
461995
Linear space algorithm for on-line detection of global predicates
R Jegou, R Medina, L Nourine
Structures in Concurrency Theory, 175-189, 1995
461995
Protocol-based web service composition
RR Hassen, L Nourine, F Toumani
International Conference on Service-Oriented Computing, 38-53, 2008
422008
Encoding of multiple inheritance hierarchies and partial orders
Y Caseau, M Habib, L Nourine, O Raynaud
Computational Intelligence 15 (1), 50-62, 1999
391999
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
322009
On the enumeration and counting of minimal dominating sets in interval and permutation graphs
MM Kanté, V Limouzy, A Mary, L Nourine, T Uno
International Symposium on Algorithms and Computation, 339-349, 2013
282013
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
International Symposium on Algorithms and Computation, 289-298, 2012
282012
Uncovering and reducing hidden combinatorics in guigues-duquenne bases
A Gély, R Medina, L Nourine, Y Renaud
International Conference on Formal Concept Analysis, 235-248, 2005
282005
Embedding partially ordered sets into chain-products
M Habib, M Huchard, L Nourine
University of California, 1995
281995
The number of Moore families on n= 6
M Habib, L Nourine
Discrete Mathematics 294 (3), 291-296, 2005
242005
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
232015
Computing implications with negation from a formal context
R Missaoui, L Nourine, Y Renaud
Fundamenta Informaticae 115 (4), 357-375, 2012
222012
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20