Alain Gély

Orcid: 0000-0002-3820-6616

According to our database1, Alain Gély authored at least 18 papers between 2005 and 2022.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
A study of algorithms relating distributive lattices, median graphs, and Formal Concept Analysis.
Int. J. Approx. Reason., 2022

Towards Distributivity in FCA for Phylogenetic Data.
Proceedings of the Complex Data Analytics with Formal Concept Analysis, 2022

2020
Steps in the Representation of Concept Lattices and Median Graphs.
Proceedings of the Fifthteenth International Conference on Concept Lattices and Their Applications, 2020

2018
Contribution à l'étude de la distributivité d'un treillis de concepts.
Proceedings of the Extraction et Gestion des Connaissances, 2018

K-spectral centroid: extension and optimizations.
Proceedings of the 26th European Symposium on Artificial Neural Networks, 2018

Steps Towards Achieving Distributivity in Formal Concept Analysis.
Proceedings of the Fourteenth International Conference on Concept Lattices and Their Applications, 2018

2017
K-Spectral Centroïd pour des données massives.
Proceedings of the 17ème Journées Francophones Extraction et Gestion des Connaissances, 2017

2016
DC Programming and DCA for Transmit Beamforming and Power Allocation in Multicasting Relay Network.
Proceedings of the Advanced Computational Methods for Knowledge Engineering, 2016

DC Programming and DCA for Enhancing Physical Layer Security via Relay Beamforming Strategies.
Proceedings of the Intelligent Information and Database Systems - 8th Asian Conference, 2016

2011
Crown-free Lattices and Their Related Graphs.
Order, 2011

Links between Modular Decomposition of Concept Lattice and Bimodular Decomposition of a Context.
Proceedings of The Eighth International Conference on Concept Lattices and Their Applications, 2011

2010
About the Enumeration Algorithms of Closed Sets.
Proceedings of the Formal Concept Analysis, 8th International Conference, 2010

2009
Representing lattices using many-valued relations.
Inf. Sci., 2009

Enumeration aspects of maximal cliques and bicliques.
Discret. Appl. Math., 2009

Parsimonious cluster systems.
Adv. Data Anal. Classif., 2009

2006
About the Family of Closure Systems Preserving Non-unit Implications in the Guigues-Duquenne Base.
Proceedings of the Formal Concept Analysis, 4th International Conference, 2006

2005
Uncovering and Reducing Hidden Combinatorics in Guigues-Duquenne Bases.
Proceedings of the Formal Concept Analysis, Third International Conference, 2005

A Generic Algorithm for Generating Closed Sets of a Binary Relation.
Proceedings of the Formal Concept Analysis, Third International Conference, 2005


  Loading...