Lhouari Nourine

Publication Activity (10 Years)

Years Active: 1994-2024
Publications (10 Years): 41

Top Topics

Partially Ordered Sets

Functional Dependencies

Polynomial Delay

Web Services Composition

Top Venues

Discret. Appl. Math.

Theor. Comput. Sci.

Publications

Mohammed Elaroussi, Lhouari Nourine, Simon Vilmin
Half-space separation in monophonic convexity. CoRR (2024)
Kira V. Adaricheva, Lhouari Nourine, Simon Vilmin
-relation in finite closure systems. CoRR (2024)
Mohammed Elaroussi, Lhouari Nourine, Simon Vilmin
Half-Space Separation in Monophonic Convexity. MFCS (2024)
Karima Ennaoui, Khaled Maafa, Lhouari Nourine
Representations for the Largest Extension of a Closure System. Order 40 (1) (2023)
Mohammed Elaroussi, Lhouari Nourine, Mohammed Said Radjef
Lattice point of view for argumentation framework. Ann. Math. Artif. Intell. 91 (5) (2023)
Mohammed Elaroussi, Lhouari Nourine, Mohammed Said Radjef, Simon Vilmin
On the preferred extensions of argumentation frameworks: Bijections with naive sets. Inf. Process. Lett. 181 (2023)
Laurent Beaudou, Florent Foucaud, Florent R. Madelaine, Lhouari Nourine, Gaétan Richard
Complexity of conjunctive regular path query homomorphisms. CoRR (2023)
Lhouari Nourine, Simon Vilmin
Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements. Theor. Comput. Sci. 969 (2023)
Mohammed Elaroussi, Lhouari Nourine, Mohammed Said Radjef, Simon Vilmin
On the preferred extensions of argumentation frameworks: bijections with naive extensions. CoRR (2022)
Lhouari Nourine, Simon Vilmin
The enumeration of meet-irreducible elements based on hierarchical decompositions of implicational bases. CoRR (2022)
Lhouari Nourine, Simon Vilmin
Enumerating maximal consistent closed sets in closure systems. CoRR (2021)
Oscar Defrain, Lhouari Nourine, Simon Vilmin
Translating between the representations of a ranked convex geometry. Discret. Math. 344 (7) (2021)
Simon Coumes, Tassadit Bouadi, Lhouari Nourine, Alexandre Termier
Skyline Groups Are Ideals. An Efficient Algorithm for Enumerating Skyline Groups. IWOCA (2021)
Lhouari Nourine, Simon Vilmin
Enumerating Maximal Consistent Closed Sets in Closure Systems. ICFCA (2021)
Oscar Defrain, Lhouari Nourine, Takeaki Uno
On the dualization in distributive lattices and related problems. Discret. Appl. Math. 300 (2021)
Lhouari Nourine, Simon Vilmin
Hierarchical Decompositions of dihypergraphs. CoRR (2020)
Karima Ennaoui, Khaled Maafa, Lhouari Nourine
Representations for the largest Extension of a closure system. CoRR (2020)
Oscar Defrain, Lhouari Nourine
Dualization in lattices given by implicational bases. Theor. Comput. Sci. 814 (2020)
Marthe Bonamy, Oscar Defrain, Piotr Micek, Lhouari Nourine
Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets. CoRR (2020)
Simon Vilmin, Lhouari Nourine
Dihypergraph Decomposition: Application to Closure System Representations. FCA4AI@ECAI (2020)
Lhouari Nourine, Simon Vilmin
Hierarchical Decompositions of Dihypergraphs. ICTCS (2020)
Oscar Defrain, Lhouari Nourine
Dualization in lattices given by implicational bases. CoRR (2019)
Laurent Beaudou, Florent Foucaud, Florent R. Madelaine, Lhouari Nourine, Gaétan Richard
Complexity of Conjunctive Regular Path Query Homomorphisms. CiE (2019)
Oscar Defrain, Lhouari Nourine, Takeaki Uno
On the dualization in distributive lattices and related problems. CoRR (2019)
Oscar Defrain, Lhouari Nourine, Simon Vilmin
Translating between the representations of a ranked convex geometry. CoRR (2019)
Arnaud Mary, Vincent Limouzy, Lhouari Nourine
WEPA 2016 preface. Discret. Appl. Math. 268 (2019)
Lhouari Nourine, Jean-Marc Petit
Possible/Certain Functional Dependencies. CoRR (2019)
Oscar Defrain, Lhouari Nourine
Dualization in Lattices Given by Implicational Bases. ICFCA (2019)
Oscar Defrain, Lhouari Nourine
-Free Chordal Graphs. ISAAC (2019)
Michel Habib, Lhouari Nourine
Representation of lattices via set-colored posets. Discret. Appl. Math. 249 (2018)
Oscar Defrain, Lhouari Nourine
Neighborhood preferences for minimal dominating sets enumeration. CoRR (2018)
Khaled Maafa, Lhouari Nourine, Mohammed Said Radjef
Algorithms for computing the Shapley value of cooperative games on lattices. Discret. Appl. Math. 249 (2018)
Karima Ennaoui, Lhouari Nourine, Farouk Toumani
Complexity Aspects of Web Services Composition. Trans. Petri Nets Other Model. Concurr. 13 (2018)
Laurent Beaudou, Arnaud Mary, Lhouari Nourine
Algorithms for k-meet-semidistributive lattices. Theor. Comput. Sci. 658 (2017)
Karima Ennaoui, Lhouari Nourine, Farouk Toumani
Complexity Aspects of Web Services Composition. PNSE @ Petri Nets (2017)
Laurent Beaudou, Lhouari Nourine
Partial Duplication of Convex Sets in Lattices. CLA (2016)
Lhouari Nourine, Ramy Ragab Hassen, Farouk Toumani
Decidability and Complexity of Web Service Business Protocol Synthesis. Int. J. Cooperative Inf. Syst. 25 (3) (2016)
Nicu-Razvan Stancioiu, Lhouari Nourine, Jean-Marc Petit, Vasile-Marian Scuturici, Dominique Fouchez, Emmanuel Gangler, Philippe Gris
Discovering Injective Mapping Between Relations in Astrophysics Databases. ISIP (2016)
Lhouari Nourine, Jean-Marc Petit
Extended dualization: Application to maximal pattern mining. Theor. Comput. Sci. 618 (2016)
Mourad Baïou, Michel Habib, Lhouari Nourine
Preface. RAIRO Oper. Res. 50 (2) (2016)
Mamadou Moustapha Kanté, Lhouari Nourine
Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs. SIAM J. Discret. Math. 30 (1) (2016)
Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno
Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs. WADS (2015)
Lakhdar Akroun, Lhouari Nourine, Farouk Toumani
Reasoning in description logics with variables: preliminary results regarding the EL logic. Description Logics (2015)
Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno
A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs. WG (2015)
Lhouari Nourine, Alain Quilliot, Hélène Toussaint
Partial Enumeration of Minimal Transversals of a Hypergraph. CLA (2015)
Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine
On the Enumeration of Minimal Dominating Sets and Related Notions. SIAM J. Discret. Math. 28 (4) (2014)
Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno
Polynomial Delay Algorithm for Listing Minimal Edge Dominating sets in Graphs. CoRR (2014)
Lakhdar Akroun, Boualem Benatallah, Lhouari Nourine, Farouk Toumani
Decidability and Complexity of Simulation Preorder for Data-Centric Web Services. ICSOC (2014)
Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno
A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs. CoRR (2014)
Dmitry Gnatyshak, Dmitry I. Ignatov, Sergei O. Kuznetsov, Lhouari Nourine
A One-pass Triclustering Approach: Is There any Room for Big Data? CLA (2014)
Lhouari Nourine, Jean-Marc Petit
Dualization on Partially Ordered Sets: Preliminary Results. ISIP (2014)
Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine
On the Enumeration of Minimal Dominating Sets and Related Notions. CoRR (2014)
J. David, Lhouari Nourine
A parameterizable enumeration algorithm for sequence mining. Theor. Comput. Sci. 468 (2013)
Mamadou Moustapha Kanté, Lhouari Nourine
Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs. SOFSEM (2013)
Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno
On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs. ISAAC (2013)
Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine
On the Neighbourhood Helly of Some Graph Classes and Applications to the Enumeration of Minimal Dominating Sets. ISAAC (2012)
Rokia Missaoui, Lhouari Nourine, Yoan Renaud
Computing Implications with Negation from a Formal Context. Fundam. Informaticae 115 (4) (2012)
Lakhdar Akroun, Boualem Benatallah, Lhouari Nourine, Farouk Toumani
On Decidability of Simulation in Data-Centeric Business Protocols. Business Process Management Workshops (2012)
Laurent Beaudou, Mamadou Moustapha Kanté, Lhouari Nourine
The Lattice of all Betweenness Relations: Structure and Properties. CLA (2012)
Lhouari Nourine, Farouk Toumani
Formal Approaches for Synthesis of Web Service Business Protocols. WS-FM (2012)
Lhouari Nourine, Jean-Marc Petit
Extending Set-based Dualization: Application to Pattern Mining. ECAI (2012)
Lhouari Nourine
Difficultés de résolution de problèmes. CIIA (2011)
Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine
Enumeration of Minimal Dominating Sets and Variants. FCT (2011)
Rokia Missaoui, Lhouari Nourine, Yoan Renaud
An Inference System for Exhaustive Generation of Mixed and Purely Negative Implications from Purely Positive Ones. CLA (2010)
Raoul Medina, Lhouari Nourine
Conditional Functional Dependencies: An FCA Point of View. ICFCA (2010)
Alain Gély, Raoul Medina, Lhouari Nourine
About the Enumeration Algorithms of Closed Sets. ICFCA (2010)
Alain Gély, Lhouari Nourine, Bachir Sadi
Enumeration aspects of maximal cliques and bicliques. Discret. Appl. Math. 157 (7) (2009)
Alain Gély, Raoul Medina, Lhouari Nourine
Representing lattices using many-valued relations. Inf. Sci. 179 (16) (2009)
Raoul Medina, Lhouari Nourine
A Unified Hierarchy for Functional Dependencies, Conditional Functional Dependencies and Association Rules. ICFCA (2009)
Ramy Ragab Hassen, Lhouari Nourine, Farouk Toumani
Protocol-Based Web Service Composition. ICSOC (2008)
Ramy Ragab Hassen, Farouk Toumani, Lhouari Nourine
Web services composition is decidable. WebDB (2008)
Rokia Missaoui, Lhouari Nourine, Yoan Renaud
Generating Positive and Negative Exact Rules Using Formal Concept Analysis: Problems and Solutions. ICFCA (2008)
Pierre Colomb, Lhouari Nourine
About Keys of Formal Context and Conformal Hypergraph. ICFCA (2008)
Alain Gély, Lhouari Nourine
About the Family of Closure Systems Preserving Non-unit Implications in the Guigues-Duquenne Base. ICFCA (2006)
Raoul Medina, Lhouari Nourine, Olivier Raynaud
Interactive Association Rules Discovery. ICFCA (2006)
Philippe Janssen, Lhouari Nourine
Minimum implicational basis for meet-semidistributive lattices. Inf. Process. Lett. 99 (5) (2006)
Alain Gély, Raoul Medina, Lhouari Nourine, Yoan Renaud
Uncovering and Reducing Hidden Combinatorics in Guigues-Duquenne Bases. ICFCA (2005)
Michel Habib, Lhouari Nourine
=6. Discret. Math. 294 (3) (2005)
Michel Habib, Lhouari Nourine, Olivier Raynaud, Eric Thierry
Computational aspects of the 2-dimension of partially ordered sets. Theor. Comput. Sci. 312 (2-3) (2004)
Lhouari Nourine, Olivier Raynaud
A fast incremental algorithm for building lattices. J. Exp. Theor. Artif. Intell. 14 (2-3) (2002)
Michel Habib, Raoul Medina, Lhouari Nourine, George Steiner
Efficient algorithms on distributive lattices. Discret. Appl. Math. 110 (2-3) (2001)
Lhouari Nourine, Olivier Raynaud
A Fast Algorithm for Building Lattices. Inf. Process. Lett. 71 (5-6) (1999)
Yves Caseau, Michel Habib, Lhouari Nourine, Olivier Raynaud
Encoding of Multiple Inheritance Hierarchies and Partial Orders. Comput. Intell. 15 (1999)
Colin de la Higuera, Lhouari Nourine
Drawing and Encoding Two-Dimensional Posets. Theor. Comput. Sci. 175 (2) (1997)
Michel Habib, Lhouari Nourine, George Steiner
Gray Codes for the Ideals of Interval Orders. J. Algorithms 25 (1) (1997)
Michel Habib, Lhouari Nourine
Tree Structure for Distributive Lattices and its Applications. Theor. Comput. Sci. 165 (2) (1996)
Roland Jégou, Raoul Medina, Lhouari Nourine
Linear Space Algorithm for On-line Detection of Global Predicates. STRICT (1995)
Michel Habib, Lhouari Nourine
Bit-Vector Encoding for Partially Ordered Sets. ORDAL (1994)