Marcel Wild - RankMe

43 papers Misc 1Journal 42

Year	Rank	Type	Title / Venue / Authors
2024	J	`jnl`	Compression with wildcards: All induced metric subgraphs. CoRR Marcel Wild
2024	J	`jnl`	Compression with wildcards: All induced subgraphs that are (respectively) connected, chordal, bipartite, or forests. CoRR Marcel Wild
2024	J	`jnl`	Enumerating all geodesics. CoRR Marcel Wild
2022	J	`jnl`	Compression with Wildcards: From CNFs to Orthogonal DNFs by Imposing the Clauses One-by-One. Comput. J. Marcel Wild
2020	J	`jnl`	Compression with wildcards: All exact, or all minimal hitting sets. CoRR Marcel Wild
2020	J	`jnl`	Compression with wildcards: All spanning trees. CoRR Marcel Wild
2019	J	`jnl`	ALLSAT compressed with wildcards: Frequent Set Mining. CoRR Marcel Wild
2018	J	`jnl`	ALLSAT compressed with wildcards: Partitionings and face-numbers of simplicial complexes. CoRR Marcel Wild
2017	J	`jnl`	ALLSAT compressed with wildcards. Part 2: All k-models of a BDD. CoRR Marcel Wild
2017	J	`jnl`	ALLSAT compressed with wildcards. Part 4: An invitation for C-programmers. CoRR Marcel Wild
2017	J	`jnl`	An efficient data structure for counting all linear extensions of a poset, calculating its jump number, and the likes. CoRR Marcel Wild
2017	J	`jnl`	The joy of implications, aka pure Horn formulas: Mainly a survey. Theor. Comput. Sci. Marcel Wild
2016	J	`jnl`	ALLSAT compressed with wildcards. Part 1: Converting CNF's to orthogonal DNF's. CoRR Marcel Wild
2014	J	`jnl`	Compressed representation of learning spaces. CoRR Marcel Wild
2014	J	`jnl`	Counting or Producing All Fixed Cardinality Transversals. Algorithmica Marcel Wild
2014	J	`jnl`	Output-Polynomial Enumeration of All Fixed-Cardinality Ideals of a Poset, Respectively All Fixed-Cardinality Subtrees of a Tree. Order Marcel Wild
2014	J	`jnl`	The joy of implications, aka pure Horn functions: mainly a survey. CoRR Marcel Wild
2013	J	`jnl`	Computing the Output Distribution and Selection Probabilities of a Stack Filter from the DNF of Its Positive Boolean Function. J. Math. Imaging Vis. Marcel Wild
2013	J	`jnl`	Coupon collecting and transversals of hypergraphs. Discret. Math. Theor. Comput. Sci. Marcel Wild, Svante Janson, Stephan G. Wagner, Dirk Laurie
2013	J	`jnl`	Inclusion-exclusion meets exclusion. CoRR Marcel Wild
2012	J	`jnl`	Compactly Generating All Satisfying Truth Assignments of a Horn Formula. J. Satisf. Boolean Model. Comput. Marcel Wild
2012	J	`jnl`	Decomposing the hypercube Q Discret. Math. Stephan G. Wagner, Marcel Wild
2012	J	`jnl`	Revisitin the enumeration of all models of a Boolean 2-CNF CoRR Marcel Wild
2011	J	`jnl`	Counting or producing all fixed cardinality transversals CoRR Marcel Wild
2011	J	`jnl`	Coupons collecting with or without replacement, and with multipurpose coupons CoRR Marcel Wild
2010	J	`jnl`	Compactly generating all satisfying truth assignments of a Horn formula CoRR Marcel Wild
2010	J	`jnl`	Computing the output distribution of a stack filter from the DNF of its positive Boolean function CoRR Marcel Wild
2010	J	`jnl`	Realization of abstract convex geometries by point configurations. Eur. J. Comb. Kira V. Adaricheva, Marcel Wild
2009	J	`jnl`	Improving upon Maximum Independent Set by five orders of magnitude CoRR Marcel Wild
2008	J	`jnl`	Generating all cycles, chordless cycles, and Hamiltonian cycles with the principle of exclusion. J. Discrete Algorithms Marcel Wild
2008	J	`jnl`	Weakly submodular rank functions, supermatroids, and the flat lattice of a distributive supermatroid. Discret. Math. Marcel Wild
2005	J	`jnl`	On Rank Functions of Lattices. Order Marcel Wild
2005	J	`jnl`	The Asymptotic Number of Binary Codes and Binary Matroids. SIAM J. Discret. Math. Marcel Wild
2005	J	`jnl`	The Groups of Order Sixteen Made Easy. Am. Math. Mon. Marcel Wild
2005	J	`jnl`	The many benefits of putting stack filters into disjunctive or conjunctive normal form. Discret. Appl. Math. Marcel Wild
2004	J	`jnl`	The asymptotic number of binary codes and binary matroids CoRR Marcel Wild
2003	J	`jnl`	Idempotent and co-idempotent stack filters and min-max operators. Theor. Comput. Sci. Marcel Wild
2001	J	`jnl`	On the Idempotency and Co-idempotency of the Morphological Center Int. J. Pattern Recognit. Artif. Intell. Marcel Wild
1996	J	`jnl`	A Polynomial Algorithm for Testing Congruence Modularity. Int. J. Algebra Comput. Christian Herrmann, Marcel Wild
1996	J	`jnl`	Base exchange properties of graphic matroids. Discret. Math. Marcel Wild
1996	J	`jnl`	Consequences of the Brylawski-Lucas Theorem for Binary Matroids. Eur. J. Comb. Marcel Wild
1995	Misc	`conf`	Computations with Finite Closure Systems and Implications. COCOON Marcel Wild
1993	J	`jnl`	Cover preserving embedding of modular lattices into partition lattices. Discret. Math. Marcel Wild