| 1 | -- | 3 | Amedeo Napoli. Preface to the special issue on "Concept Lattice and their Applications" (CLA-2011) |
| 5 | -- | 24 | Konstantin Bazhanov, Sergei A. Obiedkov. Optimizations in computing the Duquenne-Guigues basis of implications |
| 25 | -- | 53 | Uwe Ryssel, Felix Distel, Daniel Borchmann. Fast algorithms for implication bases and attribute exploration using proper premises |
| 55 | -- | 79 | Mehdi Kaytoue, Sergei O. Kuznetsov, Juraj Macko, Amedeo Napoli. Biclustering meets triadic concept analysis |
| 81 | -- | 105 | Laszlo Szathmary, Petko Valtchev, Amedeo Napoli, Robert Godin, Alix Boc, Vladimir Makarenkov. A fast compound algorithm for mining generators, closed itemsets, and computing links between equivalence classes |
| 107 | -- | 122 | Pierre Colomb, Alexis Irlande, Olivier Raynaud, Yoan Renaud. Recursive decomposition tree of a Moore co-family and closure algorithm |
| 123 | -- | 150 | Ingrid Falk, Claire Gardent. Combining formal concept analysis and translation to assign frames and semantic role sets to French verbs |
| 151 | -- | 184 | Radim Belohlávek, Dhouha Grissa, Sylvie Guillaume, Engelbert Mephu Nguifo, Jan Outrata. Boolean factors as a means of clustering of interestingness measures of association rules |