Sergei A. Obiedkov

Sergei A. Obiedkov: Modeling Ceteris Paribus Preferences in Formal Concept Analysis. ICFCA 2013: 188-202

Marzena Kryszkiewicz, Sergei A. Obiedkov, Zbigniew W. Ras: Preface. Fundam. Inform. 115(4) (2012)

Sergei A. Obiedkov: Modeling Preferences over Attribute Sets in Formal Concept Analysis. ICFCA 2012: 227-243

Konstantin Bazhanov, Sergei A. Obiedkov: Comparing Performance of Algorithms for Generating the Duquenne-Guigues Basis. CLA 2011: 43-57

Mikhail Klimushkin, Sergei A. Obiedkov, Camille Roth: Approaches to the Selection of Relevant Concepts in the Case of Noisy Data. ICFCA 2010: 255-266

Marzena Kryszkiewicz, Sergei A. Obiedkov (Eds.): Proceedings of the 7th International Conference on Concept Lattices and Their Applications, Sevilla, Spain, October 19-21, 2010. CEUR Workshop Proceedings 672, CEUR-WS.org 2010

Sergei A. Obiedkov, Derrick G. Kourie, Jan H. P. Eloff: Building access control models with attribute exploration. Computers & Security 28(1-2): 2-7 (2009)

Derrick G. Kourie, Sergei A. Obiedkov, Bruce W. Watson, Dean van der Merwe: An incremental algorithm to construct a lattice of set intersections. Sci. Comput. Program. 74(3): 128-142 (2009)

Sergei O. Kuznetsov, Sergei A. Obiedkov: Some decision and counting problems of the Duquenne-Guigues basis of implications. Discrete Applied Mathematics 156(11): 1994-2003 (2008)

Camille Roth, Sergei A. Obiedkov, Derrick G. Kourie: On Succinct Representation of Knowledge Community Taxonomies with Formal Concept Analysis. Int. J. Found. Comput. Sci. 19(2): 383-404 (2008)

Raoul Medina, Sergei A. Obiedkov (Eds.): Formal Concept Analysis, 6th International Conference, ICFCA 2008, Montreal, Canada, February 25-28, 2008, Proceedings. Lecture Notes in Computer Science 4933, Springer 2008, isbn 978-3-540-78136-3

Sergei A. Obiedkov, Vincent Duquenne: Attribute-incremental construction of the canonical implication basis. Ann. Math. Artif. Intell. 49(1-4): 77-99 (2007)

Sergei O. Kuznetsov, Sergei A. Obiedkov, Camille Roth: Reducing the Representation Complexity of Lattice-Based Taxonomies. ICCS 2007: 241-254

Loek G. Cleophas, Bruce W. Watson, Derrick G. Kourie, Andrew Boake, Sergei A. Obiedkov: TABASCO: using concept-based taxonomies in domain engineering. South African Computer Journal 37: 30-40 (2006)

Camille Roth, Sergei A. Obiedkov, Derrick G. Kourie: Towards Concise Representation for Taxonomies of Epistemic Communities. CLA 2006: 240-255

Sergei A. Obiedkov, Derrick G. Kourie, Jan H. P. Eloff: On Lattices in Access Control Models. ICCS 2006: 374-387

Sergei O. Kuznetsov, Sergei A. Obiedkov: Counting Pseudo-intents and #P-completeness. ICFCA 2006: 306-308

Bernhard Ganter, Sergei A. Obiedkov: Implications in Triadic Formal Contexts. ICCS 2004: 186-195

Dean van der Merwe, Sergei A. Obiedkov, Derrick G. Kourie: AddIntent: A New Incremental Algorithm for Constructing Concept Lattices. ICFCA 2004: 372-385

Sergei O. Kuznetsov, Sergei A. Obiedkov: Comparing performance of algorithms for generating concept lattices. J. Exp. Theor. Artif. Intell. 14(2-3): 189-216 (2002)

Sergei A. Obiedkov: Modal Logic for Evaluating Formulas in Incomplete Contexts. ICCS 2002: 314-325

Sergei O. Kuznetsov, Sergei A. Obiedkov: Algorithms for the Construction of Concept Lattices and Their Diagram Graphs. PKDD 2001: 289-300