| Publication | Date of Publication | Type |
|---|
| Polynomial delay hybrid algorithms to enumerate candidate keys for a relation | 2024-12-04 | Paper |
| Towards declarative comparabilities: application to functional dependencies | 2024-10-08 | Paper |
| Lattice point of view for argumentation framework | 2023-11-02 | Paper |
| Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements | 2023-08-01 | Paper |
| Representations for the largest extension of a closure system | 2023-06-26 | Paper |
| On the preferred extensions of argumentation frameworks: bijections with naive sets | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875631 | 2023-02-03 | Paper |
| Skyline groups are ideals. An efficient algorithm for enumerating skyline groups | 2022-03-22 | Paper |
| Enumerating maximal consistent closed sets in closure systems | 2022-03-21 | Paper |
| On the preferred extensions of argumentation frameworks: bijections with naive sets | 2022-02-11 | Paper |
| Translating between the representations of a ranked convex geometry | 2021-06-14 | Paper |
| On the dualization in distributive lattices and related problems | 2021-06-07 | Paper |
| Enumerating maximal consistent closed sets in closure systems | 2021-02-05 | Paper |
| Complexity of conjunctive regular path query homomorphisms | 2020-05-12 | Paper |
| Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets | 2020-04-15 | Paper |
| Dualization in lattices given by implicational bases | 2020-03-12 | Paper |
| Dualization in lattices given by implicational bases | 2020-02-11 | Paper |
| On the dualization in distributive lattices and related problems | 2019-02-19 | Paper |
| Algorithms for computing the Shapley value of cooperative games on lattices | 2018-10-23 | Paper |
| Representation of lattices via set-colored posets | 2018-10-23 | Paper |
| Neighborhood inclusions for minimal dominating sets enumeration: linear and polynomial delay algorithms in $P_7$-free and $P_8$-free chordal graphs | 2018-05-07 | Paper |
| Algorithms for \(k\)-meet-semidistributive lattices | 2017-02-06 | Paper |
| A polynomial delay algorithm for enumerating minimal dominating sets in chordal graphs | 2016-10-21 | Paper |
| Polynomial time algorithms for computing a minimum hull set in distance-hereditary and chordal graphs | 2016-03-04 | Paper |
| Extended dualization: application to maximal pattern mining | 2016-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3455594 | 2015-12-11 | Paper |
| Polynomial delay algorithm for listing minimal edge dominating sets in graphs | 2015-10-30 | Paper |
| On the enumeration of minimal dominating sets and related notions | 2015-04-17 | Paper |
| Polynomial time algorithms for computing a minimum hull set in distance-hereditary and chordal graphs | 2014-11-04 | Paper |
| On the enumeration and counting of minimal dominating sets in interval and permutation graphs | 2014-01-14 | Paper |
| On the neighbourhood Helly of some graph classes and applications to the enumeration of minimal dominating sets | 2013-03-21 | Paper |
| Computing implications with negation from a formal context | 2012-06-20 | Paper |
| Enumeration of minimal dominating sets and variants | 2011-08-19 | Paper |
| Conditional functional dependencies: an FCA point of view | 2010-04-14 | Paper |
| About the enumeration algorithms of closed sets | 2010-04-14 | Paper |
| Minimum implicational basis for \(\wedge\)-semidistributive lattices | 2010-01-29 | Paper |
| Representing lattices using many-valued relations | 2009-07-22 | Paper |
| Enumeration aspects of maximal cliques and bicliques | 2009-06-30 | Paper |
| A Unified Hierarchy for Functional Dependencies, Conditional Functional Dependencies and Association Rules | 2009-06-03 | Paper |
| About Keys of Formal Context and Conformal Hypergraph | 2008-03-04 | Paper |
| Generating Positive and Negative Exact Rules Using Formal Concept Analysis: Problems and Solutions | 2008-03-04 | Paper |
| Formal Concept Analysis | 2007-02-12 | Paper |
| Formal Concept Analysis | 2007-02-12 | Paper |
| A simplicial elimination scheme for \(\wedge\)-semidistributive lattices and interval collapsing | 2006-07-12 | Paper |
| Formal Concept Analysis | 2005-12-02 | Paper |
| The number of Moore families on \(n=6\) | 2005-06-10 | Paper |
| Computational aspects of the 2-dimension of partially ordered sets | 2004-10-27 | Paper |
| A fast incremental algorithm for building lattices | 2003-10-28 | Paper |
| A fast algorithm for building lattices | 2002-07-25 | Paper |
| Efficient algorithms on distributive lattices | 2002-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525257 | 2001-01-21 | Paper |
| Drawing and encoding two-dimensional posets | 1998-07-23 | Paper |
| Gray Codes for the Ideals of Interval Orders | 1998-01-07 | Paper |
| Tree structure for distributive lattices and its applications | 1997-09-18 | Paper |
| Simplicial elimination schemes, extremal lattices and maximal antichain lattices | 1997-04-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4318662 | 1995-08-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3142965 | 1994-01-09 | Paper |
| Computing the $D$-base and $D$-relation in finite closure systems | N/A | Paper |
| Half-space separation in monophonic convexity | N/A | Paper |
