Marcel Wild

According to our database¹, Marcel Wild authored at least 38 papers between 1993 and 2023.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2023

Enumerating all minimal hitting sets in polynomial total time.

[BibT_eX]

[DOI]

Marcel Wild

CoRR, 2023

2022

Compression with Wildcards: From CNFs to Orthogonal DNFs by Imposing the Clauses One-by-One.

[BibT_eX]

[DOI]

Marcel Wild

Comput. J., 2022

2020

Compression with wildcards: All exact, or all minimal hitting sets.

[BibT_eX]

[DOI]

Marcel Wild

CoRR, 2020

Compression with wildcards: All spanning trees.

[BibT_eX]

[DOI]

Marcel Wild

CoRR, 2020

2019

ALLSAT compressed with wildcards: Frequent Set Mining.

[BibT_eX]

[DOI]

Marcel Wild

CoRR, 2019

2018

ALLSAT compressed with wildcards: Partitionings and face-numbers of simplicial complexes.

[BibT_eX]

[DOI]

Marcel Wild

CoRR, 2018

2017

The joy of implications, aka pure Horn formulas: Mainly a survey.

[BibT_eX]

[DOI]

Marcel Wild

Theor. Comput. Sci., 2017

ALLSAT compressed with wildcards. Part 4: An invitation for C-programmers.

[BibT_eX]

[DOI]

Marcel Wild

CoRR, 2017

An efficient data structure for counting all linear extensions of a poset, calculating its jump number, and the likes.

[BibT_eX]

[DOI]

Marcel Wild

CoRR, 2017

ALLSAT compressed with wildcards. Part 2: All k-models of a BDD.

[BibT_eX]

[DOI]

Marcel Wild

CoRR, 2017

2016

ALLSAT compressed with wildcards. Part 1: Converting CNF's to orthogonal DNF's.

[BibT_eX]

[DOI]

Marcel Wild

CoRR, 2016

2014

Output-Polynomial Enumeration of All Fixed-Cardinality Ideals of a Poset, Respectively All Fixed-Cardinality Subtrees of a Tree.

[BibT_eX]

[DOI]

Marcel Wild

Order, 2014

The joy of implications, aka pure Horn functions: mainly a survey.

[BibT_eX]

[DOI]

Marcel Wild

CoRR, 2014

Compressed representation of learning spaces.

[BibT_eX]

[DOI]

Marcel Wild

CoRR, 2014

Counting or Producing All Fixed Cardinality Transversals.

[BibT_eX]

[DOI]

Marcel Wild

Algorithmica, 2014

2013

Computing the Output Distribution and Selection Probabilities of a Stack Filter from the DNF of Its Positive Boolean Function.

[BibT_eX]

[DOI]

Marcel Wild

J. Math. Imaging Vis., 2013

Coupon collecting and transversals of hypergraphs.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2013

Inclusion-exclusion meets exclusion.

[BibT_eX]

[DOI]

Marcel Wild

CoRR, 2013

2012

Compactly Generating All Satisfying Truth Assignments of a Horn Formula.

[BibT_eX]

[DOI]

Marcel Wild

J. Satisf. Boolean Model. Comput., 2012

Decomposing the hypercube Q<sub>n</sub> into n isomorphic edge-disjoint trees.

[BibT_eX]

[DOI]

Stephan G. Wagner

Marcel Wild

Discret. Math., 2012

Revisitin the enumeration of all models of a Boolean 2-CNF

[BibT_eX]

[DOI]

Marcel Wild

CoRR, 2012

2011

Coupons collecting with or without replacement, and with multipurpose coupons

[BibT_eX]

[DOI]

Marcel Wild

CoRR, 2011

2010

Realization of abstract convex geometries by point configurations.

[BibT_eX]

[DOI]

Kira V. Adaricheva

Marcel Wild

Eur. J. Comb., 2010

Computing the output distribution of a stack filter from the DNF of its positive Boolean function

[BibT_eX]

[DOI]

Marcel Wild

CoRR, 2010

2009

Improving upon Maximum Independent Set by five orders of magnitude

[BibT_eX]

[DOI]

Marcel Wild

CoRR, 2009

2008

Generating all cycles, chordless cycles, and Hamiltonian cycles with the principle of exclusion.

[BibT_eX]

[DOI]

Marcel Wild

J. Discrete Algorithms, 2008

Weakly submodular rank functions, supermatroids, and the flat lattice of a distributive supermatroid.

[BibT_eX]

[DOI]

Marcel Wild

Discret. Math., 2008

2005

The Groups of Order Sixteen Made Easy.

[BibT_eX]

[DOI]

Marcel Wild

Am. Math. Mon., 2005

The Asymptotic Number of Binary Codes and Binary Matroids.

[BibT_eX]

[DOI]

Marcel Wild

SIAM J. Discret. Math., 2005

On Rank Functions of Lattices.

[BibT_eX]

[DOI]

Marcel Wild

Order, 2005

The many benefits of putting stack filters into disjunctive or conjunctive normal form.

[BibT_eX]

[DOI]

Marcel Wild

Discret. Appl. Math., 2005

2003

Idempotent and co-idempotent stack filters and min-max operators.

[BibT_eX]

[DOI]

Marcel Wild

Theor. Comput. Sci., 2003

2001

On the Idempotency and Co-idempotency of the Morphological Center

[BibT_eX]

[DOI]

Marcel Wild

Int. J. Pattern Recognit. Artif. Intell., 2001

1996

A Polynomial Algorithm for Testing Congruence Modularity.

[BibT_eX]

[DOI]

Christian Herrmann

Marcel Wild

Int. J. Algebra Comput., 1996

Consequences of the Brylawski-Lucas Theorem for Binary Matroids.

[BibT_eX]

[DOI]

Marcel Wild

Eur. J. Comb., 1996

Base exchange properties of graphic matroids.

[BibT_eX]

[DOI]

Marcel Wild

Discret. Math., 1996

1995

Computations with Finite Closure Systems and Implications.

[BibT_eX]

[DOI]

Marcel Wild

Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1993

Cover preserving embedding of modular lattices into partition lattices.

[BibT_eX]

[DOI]

Marcel Wild

Discret. Math., 1993

Marcel Wild

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...