Theory: Approximating fuzzy relation equations through concept lattices -- Doubly-Lexical Order Supports Standardisation and Recursive Partitioning of Formal Context -- Graph-FCA Meets Pattern Structures -- On the commutative diagrams among Galois connections involved in closure structures -- Scaling Dimension -- Three Views on Dependency Covers from an FCA Perspective -- A Triadic Generalisation of the Boolean Concept Lattice -- Applications and Visualization: Computing witnesses for centralising monoids on a three-element set -- Description Quivers for Compact Representation of Concept Lattices and Ensembles of Decision Trees -- Examples of clique closure systems -- On the maximal independence polynomial of the covering graph of the hypercube up to n=6 -- Relational Concept Analysis in Practice: Capitalizing on Data Modeling using Design Patterns -- Representing Concept Lattices with Euler Diagrams.