Marcel Wild - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 22 from 22

2022

Compression with Wildcards: From CNFs to Orthogonal DNFs by Imposing the Clauses One-by-OneMarcel Wild. cj, 65(5):1073-1087, 2022. [doi]

2017

The joy of implications, aka pure Horn formulas: Mainly a surveyMarcel Wild. TCS, 658:264-292, 2017. [doi]

2014

Output-Polynomial Enumeration of All Fixed-Cardinality Ideals of a Poset, Respectively All Fixed-Cardinality Subtrees of a TreeMarcel Wild. order, 31(1):121-135, 2014. [doi]

Counting or Producing All Fixed Cardinality TransversalsMarcel Wild. algorithmica, 69(1):117-129, 2014. [doi]

2013

Computing the Output Distribution and Selection Probabilities of a Stack Filter from the DNF of Its Positive Boolean FunctionMarcel Wild. jmiv, 46(1):66-73, 2013. [doi]

Coupon collecting and transversals of hypergraphsMarcel Wild, Svante Janson, Stephan G. Wagner, Dirk Laurie. dmtcs, 15(2):259-270, 2013. [doi]

2012

n into n isomorphic edge-disjoint treesStephan G. Wagner, Marcel Wild. DM, 312(10):1819-1822, 2012. [doi]

Compactly Generating All Satisfying Truth Assignments of a Horn FormulaMarcel Wild. jsat, 8(1/2):63-82, 2012. [doi]

2010

Realization of abstract convex geometries by point configurationsKira V. Adaricheva, Marcel Wild. ejc, 31(1):379-400, 2010. [doi]

2008

Weakly submodular rank functions, supermatroids, and the flat lattice of a distributive supermatroidMarcel Wild. DM, 308(7):999-1017, 2008. [doi]

Generating all cycles, chordless cycles, and Hamiltonian cycles with the principle of exclusionMarcel Wild. jda, 6(1):93-102, 2008. [doi]

2005

The many benefits of putting stack filters into disjunctive or conjunctive normal formMarcel Wild. DAM, 149(1-3):174-191, 2005. [doi]

On Rank Functions of LatticesMarcel Wild. order, 22(4):357-370, 2005. [doi]

The Asymptotic Number of Binary Codes and Binary MatroidsMarcel Wild. siamdm, 19(3):691-699, 2005. [doi]

The Groups of Order Sixteen Made EasyMarcel Wild. tamm, 112(1):20-31, 2005. [doi]

2003

Idempotent and co-idempotent stack filters and min-max operatorsMarcel Wild. TCS, 1-3(299):603-631, 2003. [doi]

2001

On the Idempotency and Co-idempotency of the Morphological CenterMarcel Wild. ijprai, 15(7):1119-1128, 2001.

1996

A Polynomial Algorithm for Testing Congruence ModularityChristian Herrmann, Marcel Wild. ijac, 6(4):379-388, 1996. [doi]

Consequences of the Brylawski-Lucas Theorem for Binary MatroidsMarcel Wild. ejc, 17(2-3):309-316, 1996. [doi]

Base exchange properties of graphic matroidsMarcel Wild. DM, 148(1-3):253-264, 1996. [doi]

1995

Computations with Finite Closure Systems and ImplicationsMarcel Wild. cocoon 1995: 111-120

1993

Cover preserving embedding of modular lattices into partition latticesMarcel Wild. DM, 112(1-3):207-244, 1993. [doi]

Sign in or sign up to see more results.

runs on WebDSL