Cover preserving embedding of modular lattices into partition lattices. - Marcel Wild (Discret. Math., 1993)

Computations with Finite Closure Systems and Implications. - Marcel Wild (COCOON, 1995)

Base exchange properties of graphic matroids. - Marcel Wild (Discret. Math., 1996)

Consequences of the Brylawski-Lucas Theorem for Binary Matroids. - Marcel Wild (Eur. J. Comb., 1996)

A Polynomial Algorithm for Testing Congruence Modularity. - Christian Herrmann 003; Marcel Wild (Int. J. Algebra Comput., 1996)

On the Idempotency and Co-idempotency of the Morphological Center - Marcel Wild (Int. J. Pattern Recognit. Artif. Intell., 2001)

Idempotent and co-idempotent stack filters and min-max operators. - Marcel Wild (Theor. Comput. Sci., 2003)

The many benefits of putting stack filters into disjunctive or conjunctive normal form. - Marcel Wild (Discret. Appl. Math., 2005)

On Rank Functions of Lattices. - Marcel Wild (Order, 2005)

The Asymptotic Number of Binary Codes and Binary Matroids. - Marcel Wild (SIAM J. Discret. Math., 2005)

The Groups of Order Sixteen Made Easy. - Marcel Wild (Am. Math. Mon., 2005)

Weakly submodular rank functions, supermatroids, and the flat lattice of a distributive supermatroid. - Marcel Wild (Discret. Math., 2008)

Generating all cycles, chordless cycles, and Hamiltonian cycles with the principle of exclusion. - Marcel Wild (J. Discrete Algorithms, 2008)

Improving upon Maximum Independent Set by five orders of magnitude - Marcel Wild (CoRR, 2009)

Computing the output distribution of a stack filter from the DNF of its positive Boolean function - Marcel Wild (CoRR, 2010)

Realization of abstract convex geometries by point configurations. - Kira V. Adaricheva; Marcel Wild (Eur. J. Comb., 2010)

Coupons collecting with or without replacement, and with multipurpose coupons - Marcel Wild (CoRR, 2011)

Revisitin the enumeration of all models of a Boolean 2-CNF - Marcel Wild (CoRR, 2012)

Decomposing the hypercube Qn into n isomorphic edge-disjoint trees. - Stephan G. Wagner; Marcel Wild (Discret. Math., 2012)

Compactly Generating All Satisfying Truth Assignments of a Horn Formula. - Marcel Wild (J. Satisf. Boolean Model. Comput., 2012)

Inclusion-exclusion meets exclusion. - Marcel Wild (CoRR, 2013)

Coupon collecting and transversals of hypergraphs. - Marcel Wild; Svante Janson; Stephan G. Wagner; Dirk Laurie (Discret. Math. Theor. Comput. Sci., 2013)

Computing the Output Distribution and Selection Probabilities of a Stack Filter from the DNF of Its Positive Boolean Function. - Marcel Wild (J. Math. Imaging Vis., 2013)

Counting or Producing All Fixed Cardinality Transversals. - Marcel Wild (Algorithmica, 2014)

Compressed representation of learning spaces. - Marcel Wild (CoRR, 2014)

The joy of implications, aka pure Horn functions: mainly a survey. - Marcel Wild (CoRR, 2014)

Output-Polynomial Enumeration of All Fixed-Cardinality Ideals of a Poset, Respectively All Fixed-Cardinality Subtrees of a Tree. - Marcel Wild (Order, 2014)

ALLSAT compressed with wildcards. Part 1: Converting CNF's to orthogonal DNF's. - Marcel Wild (CoRR, 2016)

ALLSAT compressed with wildcards. Part 2: All k-models of a BDD. - Marcel Wild (CoRR, 2017)

An efficient data structure for counting all linear extensions of a poset, calculating its jump number, and the likes. - Marcel Wild (CoRR, 2017)

ALLSAT compressed with wildcards. Part 4: An invitation for C-programmers. - Marcel Wild (CoRR, 2017)

The joy of implications, aka pure Horn formulas: Mainly a survey. - Marcel Wild (Theor. Comput. Sci., 2017)

ALLSAT compressed with wildcards: Partitionings and face-numbers of simplicial complexes. - Marcel Wild (CoRR, 2018)

ALLSAT compressed with wildcards: Frequent Set Mining. - Marcel Wild (CoRR, 2019)

Compression with wildcards: All spanning trees. - Marcel Wild (CoRR, 2020)

Compression with wildcards: All exact, or all minimal hitting sets. - Marcel Wild (CoRR, 2020)

Compression with Wildcards: From CNFs to Orthogonal DNFs by Imposing the Clauses One-by-One. - Marcel Wild (Comput. J., 2022)

Compression with wildcards: All induced metric subgraphs. - Marcel Wild (CoRR, 2024)

Enumerating all geodesics. - Marcel Wild (CoRR, 2024)

Compression with wildcards: All induced subgraphs that are (respectively) connected, chordal, bipartite, or forests. - Marcel Wild (CoRR, 2024)