Abstract is missing.
- Decomposition schemes for symmetric n-ary bandsJimmy Devillet, Pierre Mathonet. 13-19 [doi]
- Linearly definable classes of Boolean functionsMiguel Couceiro, Erkko Lehtonen. 21-28 [doi]
- snomial coefficients and generalized Catalan numbersHacène Belbachir, Oussama Igueroufa. 29-36 [doi]
- Graphs containing finite induced paths of unbounded lengthMaurice Pouzet, Imed Zaguia. 37-40 [doi]
- Monotonic computation rules for nonassociative calculusMiguel Couceiro, Michel Grabisch. 41-47 [doi]
- Structures with no finite monomorphic decomposition: application to the profile of hereditary classesDjamila Oudrar, Maurice Pouzet. 49-53 [doi]
- A note on the Boolean dimension of a graph and other related parametersMaurice Pouzet, Hamza Si Kaddour, Bhalchandra D. Thatte. 55-59 [doi]
- Bijective proofs for Eulerian numbers in types B and DLuigi Santocanale. 63-75 [doi]
- Polymorphism-homogeneity and universal algebraic geometryEndre Tóth, Tamás Waldhauser. 77-86 [doi]
- Termination of graph rewriting systems through language theoryGuillaume Bonfante, Miguel Couceiro. 87-99 [doi]
- Inversion number of an oriented graph and related parametersJørgen Bang-Jensen, Jonas Costa Ferreira da Silva, Frédéric Havet. 101-121 [doi]
- Tackling scalability issues in mining path patterns from knowledge graphs: a preliminary studyPierre Monnin, Emmanuel Bresso, Miguel Couceiro, Malika Smaïl-Tabbone, Amedeo Napoli, Adrien Coulet. 123-137 [doi]