Yoan Renaud

According to our database1, Yoan Renaud authored at least 11 papers between 2005 and 2014.

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

2014
Recursive decomposition tree of a Moore co-family and closure algorithm.
Ann. Math. Artif. Intell., 2014

2013
Recursive decomposition and bounds of the lattice of Moore co-families.
Ann. Math. Artif. Intell., 2013

2012
DroPNet: a web portal for integrated analysis of <i>Drosophila</i> protein-protein interaction networks.
Nucleic Acids Res., 2012

Computing Implications with Negation from a Formal Context.
Fundam. Informaticae, 2012

2011
On Armstrong-compliant logical query languages.
Proceedings of the 4th International Workshop on Logic in Databases, 2011

A Closure Algorithm Using a Recursive Decomposition of the Set of Moore Co-families.
Proceedings of The Eighth International Conference on Concept Lattices and Their Applications, 2011

2010
An Inference System for Exhaustive Generation of Mixed and Purely Negative Implications from Purely Positive Ones.
Proceedings of the 7th International Conference on Concept Lattices and Their Applications, 2010

2008
Quelques aspects algorithmiques sur les systèmes de fermeture. (Some algoritmic aspects on closure systems).
PhD thesis, 2008

Join on Closure Systems Using Direct Implicational Basis Representation.
Proceedings of the Modelling, 2008

Generating Positive and Negative Exact Rules Using Formal Concept Analysis: Problems and Solutions.
Proceedings of the Formal Concept Analysis, 6th International Conference, 2008

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


  Loading...