Scaling, Granulation, and Fuzzy Attributes in Formal Concept Analysis. - Radim Belohlávek; Jan Konecny 001 (FUZZ-IEEE, 2007)

Operators and Spaces Associated to Matrices with Grades and Their Decompositions II. - Radim Belohlávek; Jan Konecny 001 (CLA, 2010)

General Approach to Triadic Concept Analysis. - Jan Konecny 001; Petr Osicka (CLA, 2010)

Optimal decompositions of matrices with grades into binary and graded matrices. - Eduard Bartl; Radim Belohlávek; Jan Konecny 001 (Ann. Math. Artif. Intell., 2010)

Closure Spaces of Isotone Galois Connections and Their Morphisms. - Radim Belohlávek; Jan Konecny 001 (Australasian Conference on Artificial Intelligence, 2011)

Block Relations in Fuzzy Setting. - Jan Konecny 001; Michal Krupka (CLA, 2011)

Zoom-In/Zoom-Out Algorithms for FCA with Attribute Granularity. - Radim Belohlávek; Bernard De Baets; Jan Konecny 001 (ISCIS, 2011)

Isotone fuzzy Galois connections with hedges. - Jan Konecny 001 (Inf. Sci., 2011)

Using Intensifying Hedges to Reduce Size of Multi-adjoint Concept Lattices with Heterogeneous Conjunctors. - Jan Konecny 001; Jesús Medina 001; Manuel Ojeda-Aciego (CLA, 2012)

Simple Proof of Basic Theorem for General Concept Lattices by Cartesian Representation. - Radim Belohlávek; Jan Konecny 001; Petr Osicka (MDAI, 2012)

Row and Column Spaces of Matrices over Residuated Lattices. - Radim Belohlávek; Jan Konecny 001 (Fundam. Informaticae, 2012)

Concept lattices of isotone vs. antitone Galois connections in graded setting: Mutual reducibility revisited. - Radim Belohlávek; Jan Konecny 001 (Inf. Sci., 2012)

Isotone L-bonds. - Jan Konecny 001; Manuel Ojeda-Aciego (CLA, 2013)

Toward reduction of formal fuzzy context. - Radim Belohlávek; Jan Konecny 001 (IFSA/NAFIPS, 2013)

Formal L-concepts with Rough Intents. - Eduard Bartl; Jan Konecny 001 (CLA, 2014)

Ordinal Factor Analysis of Graded Data. - Cynthia Vera Glodeanu; Jan Konecny 001 (ICFCA, 2014)

Antitone L-bonds. - Jan Konecny 001 (IPMU (3), 2014)

Multi-adjoint concept lattices with heterogeneous conjunctors and hedges. - Jan Konecny 001; Jesús Medina 001; Manuel Ojeda-Aciego (Ann. Math. Artif. Intell., 2014)

Granularity of attributes in formal concept analysis. - Radim Belohlávek; Bernard De Baets; Jan Konecny 001 (Inf. Sci., 2014)

Triadic concept lattices in the framework of aggregation structures. - Jan Konecny 001; Petr Osicka (Inf. Sci., 2014)

Using Linguistic Hedges in L-rough Concept Analysis. - Eduard Bartl; Jan Konecny 001 (CLA, 2015)

Category of Isotone Bonds between L-fuzzy Contexts over Different Structures of Truth Degrees. - Jan Konecny 001; Ondrej Kridlo (CLA, 2015)

Bonds Between L -Fuzzy Contexts Over Different Structures of Truth-Degrees. - Jan Konecny 001 (ICFCA, 2015)

Note on the characterization and reduction of concept lattices through matroid theory. - Jan Konecny 001 (Inf. Sci., 2015)

Attribute-oriented fuzzy concept lattices and standard fuzzy concept lattices induce the same similarity on objects. - Jan Konecny 001 (Fuzzy Sets Syst., 2016)

Block relations in formal fuzzy concept analysis. - Jan Konecny 001; Michal Krupka (Int. J. Approx. Reason., 2016)

On homogeneous L-bonds and heterogeneous L-bonds. - Jan Konecny 001; Manuel Ojeda-Aciego (Int. J. Gen. Syst., 2016)

L-concept analysis with positive and negative attributes. - Eduard Bartl; Jan Konecny 001 (Inf. Sci., 2016)

Bases of closure systems over residuated lattices. - Radim Belohlávek; Jan Konecny 001 (J. Comput. Syst. Sci., 2016)

Fixpoints of fuzzy closure operators via ordinary algorithms. - Radim Belohlávek; Jan Konecny 001 (FUZZ-IEEE, 2017)

Note on Representing attribute reduction and concepts in concepts lattice using graphs. - Jan Konecny 001 (CoRR, 2017)

Complete relations on fuzzy complete lattices. - Jan Konecny 001; Michal Krupka (Fuzzy Sets Syst., 2017)

Rough Fuzzy Concept Analysis. - Eduard Bartl; Jan Konecny 001 (Fundam. Informaticae, 2017)

Preface of the special issue on concept lattices and their applications. - Sadok Ben Yahia; Jan Konecny 001 (Int. J. Gen. Syst., 2017)

On attribute reduction in concept lattices: Methods based on discernibility matrix are outperformed by basic clarification and reduction. - Jan Konecny 001 (Inf. Sci., 2017)

On biconcepts in formal fuzzy concept analysis. - Jan Konecny 001; Ondrej Kridlo (Inf. Sci., 2017)

On efficient factorization of standard fuzzy concept lattices and attribute-oriented fuzzy concept lattices. - Jan Konecny 001 (Fuzzy Sets Syst., 2018)

On attribute reduction in concept lattices: Experimental evaluation shows discernibility matrix based methods inefficient. - Jan Konecny 001; Petr Krajca (Inf. Sci., 2018)

A calculus for containment of fuzzy attributes. - Radim Belohlávek; Jan Konecny 001 (Soft Comput., 2018)

Note on m-polar fuzzy graph representation of concept lattice: How to really compute m-polar fuzzy concepts. - Jan Konecny 001 (Eng. Appl. Artif. Intell., 2019)

A reduction theorem to compute fixpoints of fuzzy closure operators. - Radim Belohlávek; Jan Konecny 001 (Fuzzy Sets Syst., 2019)

L-Concept lattices with positive and negative attributes: Modeling uncertainty and reduction of size. - Eduard Bartl; Jan Konecny 001 (Inf. Sci., 2019)

On attribute reduction in concept lattices: The polynomial time discernibility matrix-based method becomes the CR-method. - Jan Konecny 001; Petr Krajca (Inf. Sci., 2019)

Note on representing attribute reduction and concepts in concept lattice using graphs. - Jan Konecny 001 (Soft Comput., 2019)

LCM is Well Implemented CbO: Study of LCM from FCA Point of View. - Radek Janostik; Jan Konecny 001; Petr Krajca (CLA, 2020)

Pruning in Map-Reduce Style CbO Algorithms. - Jan Konecny 001; Petr Krajca (ICCS, 2020)

Reinventing known results in FCA: Notes on two recently published algorithms for computation of formal concepts. - Jan Konecny 001 (Discret. Appl. Math., 2020)

Interface between Logical Analysis of Data and Formal Concept Analysis. - Radek Janostik; Jan Konecny 001; Petr Krajca (Eur. J. Oper. Res., 2020)

Attribute implications in L-concept analysis with positive and negative attributes: Validity and properties of models. - Jan Konecny 001 (Int. J. Approx. Reason., 2020)

General framework for consistencies in decision contexts. - Radek Janostik; Jan Konecny 001 (Inf. Sci., 2020)

LinCbO: Fast algorithm for computation of the Duquenne-Guigues basis. - Radek Janostik; Jan Konecny 001; Petr Krajca (Inf. Sci., 2021)

Systematic categorization and evaluation of CbO-based algorithms in FCA. - Jan Konecny 001; Petr Krajca (Inf. Sci., 2021)

Boolean Matrix Factorization for Data with Symmetric Variables. - Jan Konecny 001; Martin Trnecka (ICDM, 2022)

On pruning techniques in map-reduce style CbO algorithms. - Jan Konecny 001; Petr Krajca (Ann. Math. Artif. Intell., 2022)

LCM from FCA point of view: A CbO-style algorithm with speed-up features. - Radek Janostik; Jan Konecny 001; Petr Krajca (Int. J. Approx. Reason., 2022)

Pruning techniques in LinCbO for the computation of the Duquenne-Guigues basis. - Radek Janostik; Jan Konecny 001; Petr Krajca (Inf. Sci., 2022)

Boolean matrix factorization for symmetric binary variables. - Jan Konecny 001; Martin Trnecka (Knowl. Based Syst., 2023)