Publications

Recent papers



  • Hybrid algorithms for candidate keys enumeration for a relational schema
    K. Ennaoui and L. Nourine
    * Manuscript, 2016

  • Partial Duplication of Convex Sets in Lattices
    L. Beaudou and L. Nourine
    * CLA 2016

  • Extended Dualization on Geometric Objects
    L. Nourine, JM. Petit and T. uno
    * Manuscript, 2016

  • Algorithms for computing the Shapley value of cooperative games on lattices
    K. Maafa, L. Nourine and MS. Radjef
    * Manuscript, 2016

  • Complexity aspects of web services composition
    K. Ennaoui, L. Nourine and F. Toumani
    * Manuscript, 2013

  • A representation theorem for lattices via set-colored posets
    M. Habib and L. Nourine
    * Manuscript, 2013

Encyclopedia

  • L. Nourine and JM. Petit   : Beyond Hypergraph Dualization Encyclopedia of Algorithms (2015)
  • M.M. Kanté and L. Nourine  : Minimal Dominating Set Enumeration Encyclopedia of Algorithms (2015)

Journal

  • L. Nourine and J-M Petit   : Extended dualization: Application to maximal pattern mining , Theo- retical Computer Science, Volume 618, 7 March 2016, Pages 107-121. .
  • L. Beaudou, A. Mary and L. Nourine   : Algorithms for k-meet-semidistributive lattice , Theoretical computer science, in Press, to appear 2016 .
  • M.M. Kanté and L. Nourine   : Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs , SIAM Journal on Discrete Mathematics, In Press, to appear 2016 .
  • M.M. Kanté, A. Mary, V. Limouzy and L. Nourine  : On the Enumeration of Minimal Dominating Sets and Related Notions, SIAM Journal on Discrete Mathematics, 28(4):1916-1929, 2014. .
  • J. David and L. Nourine  : A parameterizable enumeration algorithm for sequence mining., Theoretical Computer Science, Volume 468, 14 January 2013, Pages 59-68 .
  • R. Missaoui and L. Nourine and Y. Renaud  : Computing Implications with Negation from a Formal Context, Fundam. Inform. vol 115 No 4, 2012 pages 357-375 .
  • A. Gély, R. medina and L. Nourine  : Representing lattices using many-valued relations, Information and Science vol 179 No 16, 2009, pages 2729-2739 .
  • 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. .


  • Lhouari Nourine and Jean-Marc Petit, Dualization on Partially Ordered Sets: Preliminary Results. Communications in Computer and Information Science, Springer, 2015, International Workshop, ISIP 2014, Kuala Lumpur, Malaysia, October 11-13, 2014 .
  • M.M. Kanté, A. Mary, V. Limouzy, L. Nourine and T. Uno, A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs To appear WG 2015 .
  • Lhouari Nourine, Alain Quilliot, Héléne Toussaint:, Partial Enumeration of Minimal Transversals of a Hypergraph. CLA 2015: 123-134 .
  • Lakhdar Akroun, Nourine Lhouari and Farouk Toumani, Reasoning in description logics with variables: preliminary results regarding the EL logic Proceedings of the 28th International Workshop on Description Logics, Athens,Greece, June 7-10, 2015. CEUR Workshop Proceedings 1350, CEUR-WS.org 2015.
  • M.M. Kanté, A. Mary, V. Limouzy, L. Nourine and T. Uno, Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings. Lecture Notes in Computer Science 9214: 446-457. .
  • Lakhdar Akroun and Boualem Benatallah and Lhouari Nourine and Farouk Toumani, Decidability and Complexity of Simulation Preorder for Data-Centric Web Services, ICSOC 2014: 535-542..
  • Dmitry Gnatyshak and Dmitry I. Ignatov and Sergei O. Kuznetsov and Lhouari Nourine, A One-pass Triclustering Approach: Is There any Room for Big Data?, CLA 2014: 231-242..
  • L. Nourine and F. Toumani, Formal Approaches for Synthesis of Web Service Business Protocols, Web Services and Formal Methods. Springer Berlin Heidelberg, 2013. 1-15..
  • M.M. Kanté and L. Nourine, Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs, In : SOFSEM 2013: Theory and Practice of Computer Science. Springer Berlin Heidelberg, 2013. p. 268-279..
  • M.M. Kanté, A. Mary, V. Limouzy and L. Nourine, On the Neighbourhood Helly of some Graph Classes and Applications to the Enumeration of Minimal Dominating Sets, 23rd International Symposium, ISAAC 2012, Taipei, Taiwan, December 19-21, 2012. Lecture Notes in Computer Science No:7676 , pp 289-298
  • L. Beaudou, M.M. Kanté and L. Nourine, The Lattice of all Betweenness Relations : Structure and Properties, CLA 2012: 317-326.
  • L. Akroun, B. Benatallah, L. Nourine and Farouk Toumani, On decidability of simulation in data-centric business protocols,To appear Data- & Artifact-centric BPM workshop series.
  • L. Nourine and J.M. Petit, Extending Set-based Dualization: Application to Pattern Mining,ECAI 2012, IOS Press pages 630-635.
  • M.M. Kanté, A. Mary, V. Limouzy and L. Nourine, Enumeration of Minimal Dominating Sets and Variants ,18th International Symposium on Fundamentals of Computer Theory, LNCS vol. 6914(2011), 298-309.
  • R. Medina, L. Nourine, Conditional Functional Dependencies: An FCA Point of View,International Conférence on Formal Concept Analysis (ICFCA), LNCS 5986, 2010 pages 161-176.
  • A. Gély and R. Medina and L. Nourine, About the Enumeration Algorithms of Closed Sets,International Conférence on Formal Concept Analysis (ICFCA), LNCS 5986, 2010 pages 1-16.
  • 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. 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.