| A theory of finite closure spaces based on implications M Wild Advances in Mathematics 108 (1), 118-139, 1994 | 102 | 1994 |
| Computations with finite closure systems and implications M Wild International Computing and Combinatorics Conference, 111-120, 1995 | 65 | 1995 |
| The groups of order sixteen made easy M Wild The American Mathematical Monthly 112 (1), 20-31, 2005 | 47 | 2005 |
| The joy of implications, aka pure Horn formulas: mainly a survey M Wild Theoretical Computer Science 658, 264-292, 2017 | 46 | 2017 |
| The joy of implications, aka pure Horn functions: mainly a survey M Wild arXiv preprint arXiv:1411.6432, 2014 | 46* | 2014 |
| Generating all cycles, chordless cycles, and hamiltonian cycles with the principle of exclusion M Wild Journal of Discrete Algorithms 6 (1), 93-102, 2008 | 37 | 2008 |
| Optimal implicational bases for finite modular lattices M Wild Quaestiones Mathematicae 23 (2), 153-161, 2000 | 31 | 2000 |
| On Rota's problem about n bases in a rank n matroid M Wild Advances in Mathematics 108 (2), 336-345, 1994 | 31 | 1994 |
| Natural alternatives for one dimensional median filtering CH Rohwer, M Wild Quaestiones Mathematicae 25 (2), 135-162, 2002 | 30 | 2002 |
| LULU theory, idempotent stack filters, and the mathematics of vision of Marr CH Rohwer, M Wild Advances in imaging and electron physics 146, 57-162, 2007 | 28 | 2007 |
| Compactly generating all satisfying truth assignments of a Horn formula M Wild arXiv preprint arXiv:1012.1769, 2010 | 24 | 2010 |
| Cover preserving embedding of modular lattices into partition lattices M Wild Discrete mathematics 112 (1-3), 207-244, 1993 | 23 | 1993 |
| Decomposing the hypercube Qn into n isomorphic edge-disjoint trees S Wagner, M Wild Discrete Mathematics 312 (10), 1819-1822, 2012 | 21 | 2012 |
| Acyclic modular lattices and their representations C Herrmann, M Wild Journal of Algebra 136 (1), 17-36, 1991 | 21 | 1991 |
| Structural matrix algebras and their lattices of invariant subspaces M Akkurt, GP Barker, M Wild Linear algebra and its applications 394, 25-38, 2005 | 19 | 2005 |
| Cover-preserving order embeddings into Boolean lattices M Wild Order 9 (3), 209-232, 1992 | 18 | 1992 |
| Counting or producing all fixed cardinality transversals M Wild Algorithmica 69 (1), 117-129, 2014 | 17 | 2014 |
| The asymptotic number of inequivalent binary codes and nonisomorphic binary matroids M Wild Finite Fields and Their Applications 6 (2), 192-202, 2000 | 17 | 2000 |
| Idempotent and co-idempotent stack filters and min–max operators M Wild Theoretical Computer Science 299 (1-3), 603-631, 2003 | 16 | 2003 |
| Output-polynomial enumeration of all fixed-cardinality ideals of a poset, respectively all fixed-cardinality subtrees of a tree M Wild Order 31 (1), 121-135, 2014 | 15 | 2014 |
