default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLhouari Nourine
Person information
SPARQL queries 
🛈 Please note that only 71% of the records listed on this page have a DOI. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j32]Lhouari Nourine, Jean-Marc Petit
, Simon Vilmin:
Towards declarative comparabilities: Application to functional dependencies. J. Comput. Syst. Sci. 146: 103576 (2024)- [c40]Mohammed Elaroussi, Lhouari Nourine, Simon Vilmin:
Half-Space Separation in Monophonic Convexity. MFCS 2024: 51:1-51:16 - [i17]Kira V. Adaricheva, Lhouari Nourine, Simon Vilmin:
Computing the D-base and D-relation in finite closure systems. CoRR abs/2404.07037 (2024) - [i16]Mohammed Elaroussi, Lhouari Nourine, Simon Vilmin:
Half-space separation in monophonic convexity. CoRR abs/2404.17564 (2024) - 2023
- [j31]Mohammed Elaroussi, Lhouari Nourine, Mohammed Said Radjef:
Lattice point of view for argumentation framework. Ann. Math. Artif. Intell. 91(5): 691-711 (2023) - [j30]Mohammed Elaroussi, Lhouari Nourine, Mohammed Said Radjef, Simon Vilmin:
On the preferred extensions of argumentation frameworks: Bijections with naive sets. Inf. Process. Lett. 181: 106354 (2023) - [j29]Karima Ennaoui, Khaled Maafa, Lhouari Nourine:
Representations for the Largest Extension of a Closure System. Order 40(1): 29-45 (2023) - [j28]Lhouari Nourine, Simon Vilmin:
Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements. Theor. Comput. Sci. 969: 114030 (2023) - [i15]Laurent Beaudou, Florent Foucaud, Florent R. Madelaine, Lhouari Nourine, Gaétan Richard:
Complexity of conjunctive regular path query homomorphisms. CoRR abs/2305.07271 (2023) - 2022
- [i14]Mohammed Elaroussi, Lhouari Nourine, Mohammed Said Radjef, Simon Vilmin:
On the preferred extensions of argumentation frameworks: bijections with naive extensions. CoRR abs/2202.05506 (2022) - [i13]Lhouari Nourine, Simon Vilmin:
The enumeration of meet-irreducible elements based on hierarchical decompositions of implicational bases. CoRR abs/2202.05536 (2022) - 2021
- [j27]Oscar Defrain, Lhouari Nourine, Takeaki Uno:
On the dualization in distributive lattices and related problems. Discret. Appl. Math. 300: 85-96 (2021) - [j26]Oscar Defrain, Lhouari Nourine, Simon Vilmin:
Translating between the representations of a ranked convex geometry. Discret. Math. 344(7): 112399 (2021) - [c39]Lhouari Nourine, Simon Vilmin:
Enumerating Maximal Consistent Closed Sets in Closure Systems. ICFCA 2021: 57-73 - [c38]Simon Coumes, Tassadit Bouadi, Lhouari Nourine, Alexandre Termier:
Skyline Groups Are Ideals. An Efficient Algorithm for Enumerating Skyline Groups. IWOCA 2021: 223-236 - [i12]Lhouari Nourine, Simon Vilmin:
Enumerating maximal consistent closed sets in closure systems. CoRR abs/2102.04245 (2021) - 2020
- [j25]Oscar Defrain, Lhouari Nourine:
Dualization in lattices given by implicational bases. Theor. Comput. Sci. 814: 169-176 (2020) - [c37]Simon Vilmin, Lhouari Nourine:
Dihypergraph Decomposition: Application to Closure System Representations. FCA4AI@ECAI 2020: 31-44 - [c36]Lhouari Nourine, Simon Vilmin:
Hierarchical Decompositions of Dihypergraphs. ICTCS 2020: 158-171 - [i11]Karima Ennaoui, Khaled Maafa, Lhouari Nourine:
Representations for the largest Extension of a closure system. CoRR abs/2002.07680 (2020) - [i10]Marthe Bonamy, Oscar Defrain, Piotr Micek, Lhouari Nourine:
Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets. CoRR abs/2004.07214 (2020) - [i9]Lhouari Nourine, Simon Vilmin:
Hierarchical Decompositions of dihypergraphs. CoRR abs/2006.11831 (2020)
2010 – 2019
- 2019
- [j24]Arnaud Mary, Vincent Limouzy, Lhouari Nourine:
WEPA 2016 preface. Discret. Appl. Math. 268: 178 (2019) - [c35]Laurent Beaudou, Florent Foucaud, Florent R. Madelaine, Lhouari Nourine, Gaétan Richard:
Complexity of Conjunctive Regular Path Query Homomorphisms. CiE 2019: 108-119 - [c34]Oscar Defrain, Lhouari Nourine:
Dualization in Lattices Given by Implicational Bases. ICFCA 2019: 89-98 - [c33]Oscar Defrain, Lhouari Nourine:
Neighborhood Inclusions for Minimal Dominating Sets Enumeration: Linear and Polynomial Delay Algorithms in P7-Free and P8-Free Chordal Graphs. ISAAC 2019: 63:1-63:16 - [i8]Oscar Defrain, Lhouari Nourine:
Dualization in lattices given by implicational bases. CoRR abs/1901.07503 (2019) - [i7]Oscar Defrain, Lhouari Nourine, Takeaki Uno:
On the dualization in distributive lattices and related problems. CoRR abs/1902.07004 (2019) - [i6]Oscar Defrain, Lhouari Nourine, Simon Vilmin:
Translating between the representations of a ranked convex geometry. CoRR abs/1907.09433 (2019) - [i5]Lhouari Nourine, Jean-Marc Petit:
Possible/Certain Functional Dependencies. CoRR abs/1909.12656 (2019) - 2018
- [j23]Michel Habib, Lhouari Nourine:
Representation of lattices via set-colored posets. Discret. Appl. Math. 249: 64-73 (2018) - [j22]Khaled Maafa, Lhouari Nourine, Mohammed Said Radjef:
Algorithms for computing the Shapley value of cooperative games on lattices. Discret. Appl. Math. 249: 91-105 (2018) - [j21]Karima Ennaoui, Lhouari Nourine, Farouk Toumani:
Complexity Aspects of Web Services Composition. Trans. Petri Nets Other Model. Concurr. 13: 116-135 (2018) - [e1]Dmitry I. Ignatov, Lhouari Nourine:
Proceedings of the Fourteenth International Conference on Concept Lattices and Their Applications, CLA 2018, Olomouc, Czech Republic, June 12-14, 2018. CEUR Workshop Proceedings 2123, CEUR-WS.org 2018 [contents] - [i4]Oscar Defrain, Lhouari Nourine:
Neighborhood preferences for minimal dominating sets enumeration. CoRR abs/1805.02412 (2018) - 2017
- [j20]Laurent Beaudou, Arnaud Mary, Lhouari Nourine:
Algorithms for k-meet-semidistributive lattices. Theor. Comput. Sci. 658: 391-398 (2017) - [c32]Karima Ennaoui, Lhouari Nourine, Farouk Toumani:
Complexity Aspects of Web Services Composition. PNSE @ Petri Nets 2017: 85-104 - 2016
- [j19]Lhouari Nourine, Ramy Ragab Hassen, Farouk Toumani:
Decidability and Complexity of Web Service Business Protocol Synthesis. Int. J. Cooperative Inf. Syst. 25(3): 1650008:1-1650008:43 (2016) - [j18]Mourad Baïou, Michel Habib, Lhouari Nourine:
Preface. RAIRO Oper. Res. 50(2): 221-222 (2016) - [j17]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): 311-326 (2016) - [j16]Lhouari Nourine, Jean-Marc Petit:
Extended dualization: Application to maximal pattern mining. Theor. Comput. Sci. 618: 107-121 (2016) - [c31]Laurent Beaudou, Lhouari Nourine:
Partial Duplication of Convex Sets in Lattices. CLA 2016: 33-43 - [c30]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: 18-32 - [r2]Lhouari Nourine, Jean-Marc Petit:
Beyond Hypergraph Dualization. Encyclopedia of Algorithms 2016: 189-192 - [r1]Mamadou Moustapha Kanté, Lhouari Nourine:
Minimal Dominating Set Enumeration. Encyclopedia of Algorithms 2016: 1287-1291 - 2015
- [c29]Lhouari Nourine, Alain Quilliot, Hélène Toussaint:
Partial Enumeration of Minimal Transversals of a Hypergraph. CLA 2015: 123-134 - [c28]Lakhdar Akroun, Lhouari Nourine, Farouk Toumani:
Reasoning in description logics with variables: preliminary results regarding the EL logic. Description Logics 2015 - [c27]Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno:
Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs. WADS 2015: 446-457 - [c26]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: 138-153 - 2014
- [j15]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): 1916-1929 (2014) - [c25]Dmitry Gnatyshak, Dmitry I. Ignatov, Sergei O. Kuznetsov, Lhouari Nourine:
A One-pass Triclustering Approach: Is There any Room for Big Data? CLA 2014: 231-242 - [c24]Lakhdar Akroun, Boualem Benatallah, Lhouari Nourine, Farouk Toumani:
Decidability and Complexity of Simulation Preorder for Data-Centric Web Services. ICSOC 2014: 535-542 - [c23]Lhouari Nourine, Jean-Marc Petit:
Dualization on Partially Ordered Sets: Preliminary Results. ISIP 2014: 23-34 - [i3]Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno:
Polynomial Delay Algorithm for Listing Minimal Edge Dominating sets in Graphs. CoRR abs/1404.3501 (2014) - [i2]Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno:
A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs. CoRR abs/1407.2036 (2014) - [i1]Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine:
On the Enumeration of Minimal Dominating Sets and Related Notions. CoRR abs/1407.2053 (2014) - 2013
- [j14]J. David, Lhouari Nourine:
A parameterizable enumeration algorithm for sequence mining. Theor. Comput. Sci. 468: 59-68 (2013) - [c22]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: 339-349 - [c21]Mamadou Moustapha Kanté, Lhouari Nourine:
Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs. SOFSEM 2013: 268-279 - 2012
- [j13]Rokia Missaoui, Lhouari Nourine, Yoan Renaud:
Computing Implications with Negation from a Formal Context. Fundam. Informaticae 115(4): 357-375 (2012) - [c20]Lakhdar Akroun, Boualem Benatallah, Lhouari Nourine, Farouk Toumani:
On Decidability of Simulation in Data-Centeric Business Protocols. Business Process Management Workshops 2012: 352-363 - [c19]Laurent Beaudou, Mamadou Moustapha Kanté, Lhouari Nourine:
The Lattice of all Betweenness Relations: Structure and Properties. CLA 2012: 317-326 - [c18]Lhouari Nourine, Jean-Marc Petit:
Extending Set-based Dualization: Application to Pattern Mining. ECAI 2012: 630-635 - [c17]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: 289-298 - [c16]Lhouari Nourine, Farouk Toumani:
Formal Approaches for Synthesis of Web Service Business Protocols. WS-FM 2012: 1-15 - 2011
- [c15]Lhouari Nourine:
Difficultés de résolution de problèmes. CIIA 2011 - [c14]Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine:
Enumeration of Minimal Dominating Sets and Variants. FCT 2011: 298-309 - 2010
- [c13]Rokia Missaoui, Lhouari Nourine, Yoan Renaud:
An Inference System for Exhaustive Generation of Mixed and Purely Negative Implications from Purely Positive Ones. CLA 2010: 271-282 - [c12]Alain Gély, Raoul Medina, Lhouari Nourine:
About the Enumeration Algorithms of Closed Sets. ICFCA 2010: 1-16 - [c11]Raoul Medina, Lhouari Nourine:
Conditional Functional Dependencies: An FCA Point of View. ICFCA 2010: 161-176
2000 – 2009
- 2009
- [j12]Alain Gély, Lhouari Nourine, Bachir Sadi:
Enumeration aspects of maximal cliques and bicliques. Discret. Appl. Math. 157(7): 1447-1459 (2009) - [j11]Alain Gély, Raoul Medina, Lhouari Nourine:
Representing lattices using many-valued relations. Inf. Sci. 179(16): 2729-2739 (2009) - [c10]Raoul Medina, Lhouari Nourine:
A Unified Hierarchy for Functional Dependencies, Conditional Functional Dependencies and Association Rules. ICFCA 2009: 98-113 - 2008
- [c9]Pierre Colomb, Lhouari Nourine:
About Keys of Formal Context and Conformal Hypergraph. ICFCA 2008: 140-149 - [c8]Rokia Missaoui, Lhouari Nourine, Yoan Renaud:
Generating Positive and Negative Exact Rules Using Formal Concept Analysis: Problems and Solutions. ICFCA 2008: 169-181 - [c7]Ramy Ragab Hassen, Lhouari Nourine, Farouk Toumani:
Protocol-Based Web Service Composition. ICSOC 2008: 38-53 - [c6]Ramy Ragab Hassen, Farouk Toumani, Lhouari Nourine:
Web services composition is decidable. WebDB 2008 - 2006
- [j10]Philippe Janssen, Lhouari Nourine:
Minimum implicational basis for meet-semidistributive lattices. Inf. Process. Lett. 99(5): 199-202 (2006) - [c5]Raoul Medina, Lhouari Nourine, Olivier Raynaud:
Interactive Association Rules Discovery. ICFCA 2006: 177-190 - [c4]Alain Gély, Lhouari Nourine:
About the Family of Closure Systems Preserving Non-unit Implications in the Guigues-Duquenne Base. ICFCA 2006: 191-204 - 2005
- [j9]Michel Habib, Lhouari Nourine:
The number of Moore families on n=6. Discret. Math. 294(3): 291-296 (2005) - [c3]Alain Gély, Raoul Medina, Lhouari Nourine, Yoan Renaud:
Uncovering and Reducing Hidden Combinatorics in Guigues-Duquenne Bases. ICFCA 2005: 235-248 - 2004
- [j8]Michel Habib, Lhouari Nourine, Olivier Raynaud, Eric Thierry:
Computational aspects of the 2-dimension of partially ordered sets. Theor. Comput. Sci. 312(2-3): 401-431 (2004) - 2002
- [j7]Lhouari Nourine, Olivier Raynaud:
A fast incremental algorithm for building lattices. J. Exp. Theor. Artif. Intell. 14(2-3): 217-227 (2002) - 2001
- [j6]Michel Habib, Raoul Medina, Lhouari Nourine, George Steiner:
Efficient algorithms on distributive lattices. Discret. Appl. Math. 110(2-3): 169-187 (2001)
1990 – 1999
- 1999
- [j5]Yves Caseau, Michel Habib, Lhouari Nourine, Olivier Raynaud:
Encoding of Multiple Inheritance Hierarchies and Partial Orders. Comput. Intell. 15: 50-62 (1999) - [j4]Lhouari Nourine, Olivier Raynaud:
A Fast Algorithm for Building Lattices. Inf. Process. Lett. 71(5-6): 199-204 (1999) - 1997
- [j3]Michel Habib, Lhouari Nourine, George Steiner:
Gray Codes for the Ideals of Interval Orders. J. Algorithms 25(1): 52-66 (1997) - [j2]Colin de la Higuera, Lhouari Nourine:
Drawing and Encoding Two-Dimensional Posets. Theor. Comput. Sci. 175(2): 293-308 (1997) - 1996
- [j1]Michel Habib, Lhouari Nourine:
Tree Structure for Distributive Lattices and its Applications. Theor. Comput. Sci. 165(2): 391-405 (1996) - 1995
- [c2]Roland Jégou, Raoul Medina, Lhouari Nourine:
Linear Space Algorithm for On-line Detection of Global Predicates. STRICT 1995: 175-189 - 1994
- [c1]Michel Habib, Lhouari Nourine:
Bit-Vector Encoding for Partially Ordered Sets. ORDAL 1994: 1-12
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 21:10 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
