default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlain Sigayret
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[j6]Anne Berry, Alain Gutierrez, Marianne Huchard
, Amedeo Napoli, Alain Sigayret:
Hermes: a simple and efficient algorithm for building the AOC-poset of a binary relation. Ann. Math. Artif. Intell. 72(1-2): 45-71 (2014)- 2013
- [c10]Anne Berry, Alain Sigayret:
Dismantlable Lattices in the Mirror. ICFCA 2013: 44-59 - 2012
- [c9]Anne Berry, Marianne Huchard, Amedeo Napoli, Alain Sigayret:
Hermes: an Efficient Algorithm for Building Galois Sub-hierarchies. CLA 2012: 21-32 - [c8]Anne Berry, Alain Sigayret:
A Peep through the Looking Glass: Articulation Points in Lattices. ICFCA 2012: 45-60 - 2011
- [c7]Anne Berry, Romain Pogorelcnik, Alain Sigayret:
Vertical Decomposition of a Lattice Using Clique Separators. CLA 2011: 15-29
2000 – 2009
- 2007
- [j5]Anne Berry, Jean Paul Bordat, Alain Sigayret:
A local approach to concept generation. Ann. Math. Artif. Intell. 49(1-4): 117-136 (2007) - [j4]Bangaly Kaba, Nicolas Pinet, Gaëlle Lelandais, Alain Sigayret, Anne Berry:
Clustering Gene Expression Data Using Graph Separators. Silico Biol. 7(4-5): 433-452 (2007) - [c6]Elaine M. Eschen, Nicolas Pinet, Alain Sigayret:
Consecutive-ones: Handling Lattice Planarity Efficiently. CLA 2007 - [c5]Gabriela Arévalo, Anne Berry, Marianne Huchard, Guillaume Perrot, Alain Sigayret:
Performances of Galois Sub-hierarchy-building Algorithms. ICFCA 2007: 166-180 - 2006
- [j3]Anne Berry, Eric SanJuan, Alain Sigayret:
Generalized domination in closure systems. Discret. Appl. Math. 154(7): 1064-1084 (2006) - [j2]Anne Berry, Alain Sigayret, Christine Sinoquet:
Maximal sub-triangulation in pre-processing phylogenetic data. Soft Comput. 10(5): 461-468 (2006) - [c4]Anne Berry, Ross M. McConnell, Alain Sigayret, Jeremy P. Spinrad:
Very Fast Instances for Concept Generation. ICFCA 2006: 119-129 - 2005
- [c3]Anne Berry, Marianne Huchard, Ross M. McConnell, Alain Sigayret, Jeremy P. Spinrad:
Efficiently Computing a Linear Extension of the Sub-hierarchy of a Concept Lattice. ICFCA 2005: 208-222 - [c2]Anne Berry, Alain Sigayret, Jeremy P. Spinrad:
Faster Dynamic Algorithms for Chordal Graphs, and an Application to Phylogeny. WG 2005: 445-455 - 2004
- [j1]Anne Berry, Alain Sigayret:
Representing a concept lattice by a graph. Discret. Appl. Math. 144(1-2): 27-42 (2004) - 2002
- [b1]Alain Sigayret:
Data Mining : une approche par les graphes. (Data Mining : using a graph approach). Blaise Pascal University, Clermont-Ferrand, France, 2002 - [c1]Anne Berry, Alain Sigayret:
Maintaining Class Membership Information. OOIS Workshops 2002: 13-23
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 2024-04-24 22:50 CEST 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:
