Publications

Journal

• A. Gély, R. medina and L. Nourine  : Representing lattices using many-valued relations, Article in Press, Accepted Manuscript in Journal of Information and Science (http://dx.doi.org/10.1016/j.ins.2009.03.018 ).
  
  
• A. Gély, L. Nourine  and B. Sadi : Algorithmic Aspect of maximal cliques and bicliques, Discrete Applied Mathematics > Volume 157, Issue 7, Pages 1447-1459 (2009).
  
  
• A. Gély, L. Nourine : Algorithmique d'énumération : Cliques, Bicliques, Itemset Fermés, Information - Interaction - Intelligence (I3), Juin 2007.
  
• P. Janssen, L. Nourine : Minimum implicational basis for meet-semidistributive lattices, Information Processing Letters Volume 99 , Issue 5 (September 2006) pages 199 - 202.
  
• M. Habib and L. Nourine : The number of Moore families on n=6, Discrete Mathematics, 294 (2005) pages 291-296.
  
• M. Habib, L. Nourine, O. Raynaud and E. Thierry : Computational aspects of the 2-dimension of partially ordered sets, Theoritical Computer Science , Volume 312, Issues 2-3, 30 January 2004, Pages 401-431.
  
• P. Janssen, L. Nourine : A simplicial elimination scheme for meet-semidistributive lattices and interval collapsing, Algebra Universalis, vol 50, Number 2 (december 2003) pages 171-178.
  
• L. Nourine and 0. Raynaud : A fast incremental algorithm for building lattices,  Journal of Experimental & Theoritical Artificial Intelligence, volume 14(2002) Pages 217-227.
  
• M. Habib and R. Medina and L. Nourine and G. Steiner : Efficient algorithms on distributive lattices, Discrete Applied Mathematics , Vol. 110, Issue 2-3, 15 juin (2001), pp:169-18.
   
• L. Nourine and 0. Raynaud : A fast algorithm for building lattices, Information Processing Letters, volume 71(1999) Pages 199-204.
  
• Y. Caseau, M. Habib, L. Nourine and O. Raynaud : Encoding of multiple inheritance hierarchy and partial orders, Computational intelligence, volume 15, No 1(1999) 50-62.
  
• C. de la Higuera and L. Nourine : Drawing and Encoding Two Dimensional Posets, Theoritical Computer Science,  Vol 175 (1997) pp:293-308.
  
• M. Habib and L. Nourine and G. Steiner : Gray Codes for the Ideals of Interval Orders, Journal of Algorithms, Vol 25, No 1 pp:52-66, 1997.
  
• M. Habib and L. Nourine : Tree Structure for Distributive Lattices and Applications, Theoritical Computer Science, Vol 165, No 2, pp:391-405, 1996.
  
• M. Morvan and L. Nourine : Simplicial Elimination Shemes, Extremal Lattices and Maximal AntcihainsLattice, Journal of the theory of ordered sets and its applications, vol 13, No 2, pp:159-173, 1996.
  
• R. Medina and L. Nourine : Algorithme efficace de Generation des ideux d'un ensemble ordonné,  C. R. Acad. Sci. Paris, t. 319 serie I,(1994), 1115-1120.
  
• M. Morvan and L. Nourine : Sur la distributivite du treillis des antichaines maximales d'un ensemble ordonné C. R. Acad. Sci. Paris, t. 317 serie I,(1993), 129-133.

Conferences

Some publications are available in compressed PostScript format, by clicking on the title. .

• R. Medina, L. Nourine, A Unified Hierarchy for Functional Dependencies, Conditional Functional Dependencies and Association Rules.,International Conférence on Formal Concept Analysis (ICFCA), Darmstadt Germany, 2009.
  
• R. Ragab, L. Nourine and F. Toumani, Protocol-based Automatic composition of web services, 6th International Conference on Service Oriented Computing(ICSOC 2008), LNCS 5364 pages 38-53 (2008)
  
• R. Ragab, L. Nourine and F. Toumani, On the decidability of web services composition, BDA 2008.
  
• R. Ragab, L. Nourine and F. Toumani, Web services composition is decidable, Proceedings of the 11th International Workshop on Web and Databases (WebDB 2008), June 13, 2008, Vancouver, Canada.
  
• P. Colomb and L. Nourine, About Keys of Formal Context and Conformal Hypergraph. International Conférence on Formal Concept Analysis (ICFCA), Montréal Canada, LNAI  4933  pages 140-149, 2008.

• R. Missaoui and L. Nourine and Y. Renaud, Generating Positive and Negative Exact Rules Using Formal Concept Analysis: Problems and Solutions. International Conférence on Formal Concept Analysis (ICFCA), LNAI 4933 pages 169-181,  2008.
• R. Medina, L. . Nourine et O. Raynaud : Interactive Association rules Discovery . Proceedings of ICFCA (International Conference on Formal Concept Analysis), LNAI 3874 pages 177-190, 2006
• A. y et L. Nourine : About the Family of Closure Systems Preserving non Unit Implications in the Guigues-Duquenne Base. Proceedings of ICFCA (International Conference on Formal Concept Analysis), LNAI 3874 pages 191-204, 2006
• A. Gély, R. Medina: L. Nourine and Y.renaud, Uncovering and Reducing Hodden Combinatorics in Guigues-Duquenne Bases. International Conference on Formal Concept Analysis, LNAI 3403, pages 234-247, 2005.
• K. Bertet, R. Medina, L. Nourine et O. Raynaud : Algorithmique combinatoire dans les bases de données massives. AFIA-2003.
• M. Habib and L. Nourine and O. Raynaud : A new lattice-based heuristic for taxonomy encoding. International KRUSE Symposium : Knowledge Retrieval, Use and Storage for Efficiency. Vancouver (1997), 60-71.
• M. Habib and L. Nourine: Bit-Vector Encoding for Partially Ordered Sets. ORDAL`94, LNCS No 831, pp:1-12,1994.
• R. Jégou and R. Medina and L. Nourine : Linear Space Algorithm for On-line Detection of Global Predicates, In: Desel, J.: Structures in Concurrency Theory, Proceedings of the International Workshop on Structures in Concurrency Theory (STRICT), Berlin, 11-13 May 1995, pages 175-189.
• M. Habib, M. Huchard, L. Nourine : Embedding partially ordered sets into chain-product. InProceedings of symposium on Knowledge Retrieval, Use and Storage for Efficiency(KRUSE'95), Santa Cruz, pages 147-161. 1995.
• K. Bertet and M. Morvan and L. Nourine : Lazy Completion of a partial order to the smallest Lattice, In International KRUSE Symposium: Knowledge Retrieval, Use and Storage for Efficiency. University of Vancouver, pages: 72-81, (1997).
• R. Medina, L. Nourine : Detection incrementale de Definitely (fi). RenPar'6: Sixiemes Rencontres Francophones du Parallélisme,Lyon, France, juin 1994.
• R. Medina, L.Nourine : Growing and pruning the consistent cuts tree. ORDAL'94: Orders and Algorithms, Lyon, France, July 1994.
• M. Habib , L. Nourine : A new dimension parameter and a removal theorem for boolean dimension. 4th Workshop on Graphs and Combinatorial Optimization, Twente, Holland, June 1995, pp. 127-132.

Not Published

• M. Habib and L. Nourine : A Linear Time Algorithm to Recognize Distributive Lattices, RR LIRMM, No 92-012, 1992.
• M.Morvan and L. Nourine : Generating Minimal Interval Extesions. RR LIRMM, No 92-015, 1992.

Thesis

• L. Nourine, Quelques Propriétes algorithmiques des Treillis, Doctorat en informatique , Université Montpellier II, Juin 1993.
• L. Nourine, Une structuration Algorithmique de la Theorie des treillis, Habilitation en informatique, Université Montpellier II, Juillet 2000.

 

Last revised: November 2008.