default search action
Marcel Wild
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i20]Marcel Wild:
Compression with wildcards: All induced metric subgraphs. CoRR abs/2409.08363 (2024) - [i19]Marcel Wild:
Enumerating all geodesics. CoRR abs/2409.16955 (2024) - 2022
- [j21]Marcel Wild:
Compression with Wildcards: From CNFs to Orthogonal DNFs by Imposing the Clauses One-by-One. Comput. J. 65(5): 1073-1087 (2022) - 2020
- [i18]Marcel Wild:
Compression with wildcards: All spanning trees. CoRR abs/2002.09707 (2020) - [i17]Marcel Wild:
Compression with wildcards: All exact, or all minimal hitting sets. CoRR abs/2008.08996 (2020)
2010 – 2019
- 2019
- [i16]Marcel Wild:
ALLSAT compressed with wildcards: Frequent Set Mining. CoRR abs/1910.14508 (2019) - 2018
- [i15]Marcel Wild:
ALLSAT compressed with wildcards: Partitionings and face-numbers of simplicial complexes. CoRR abs/1812.02570 (2018) - 2017
- [j20]Marcel Wild:
The joy of implications, aka pure Horn formulas: Mainly a survey. Theor. Comput. Sci. 658: 264-292 (2017) - [i14]Marcel Wild:
ALLSAT compressed with wildcards. Part 2: All k-models of a BDD. CoRR abs/1703.08511 (2017) - [i13]Marcel Wild:
An efficient data structure for counting all linear extensions of a poset, calculating its jump number, and the likes. CoRR abs/1704.07708 (2017) - [i12]Marcel Wild:
ALLSAT compressed with wildcards. Part 4: An invitation for C-programmers. CoRR abs/1712.00751 (2017) - 2016
- [i11]Marcel Wild:
ALLSAT compressed with wildcards. Part 1: Converting CNF's to orthogonal DNF's. CoRR abs/1608.08472 (2016) - 2014
- [j19]Marcel Wild:
Counting or Producing All Fixed Cardinality Transversals. Algorithmica 69(1): 117-129 (2014) - [j18]Marcel Wild:
Output-Polynomial Enumeration of All Fixed-Cardinality Ideals of a Poset, Respectively All Fixed-Cardinality Subtrees of a Tree. Order 31(1): 121-135 (2014) - [i10]Marcel Wild:
Compressed representation of learning spaces. CoRR abs/1407.6327 (2014) - [i9]Marcel Wild:
The joy of implications, aka pure Horn functions: mainly a survey. CoRR abs/1411.6432 (2014) - 2013
- [j17]Marcel Wild, Svante Janson, Stephan G. Wagner, Dirk Laurie:
Coupon collecting and transversals of hypergraphs. Discret. Math. Theor. Comput. Sci. 15(2): 259-270 (2013) - [j16]Marcel Wild:
Computing the Output Distribution and Selection Probabilities of a Stack Filter from the DNF of Its Positive Boolean Function. J. Math. Imaging Vis. 46(1): 66-73 (2013) - [i8]Marcel Wild:
Inclusion-exclusion meets exclusion. CoRR abs/1309.6927 (2013) - 2012
- [j15]Stephan G. Wagner, Marcel Wild:
Decomposing the hypercube Qn into n isomorphic edge-disjoint trees. Discret. Math. 312(10): 1819-1822 (2012) - [j14]Marcel Wild:
Compactly Generating All Satisfying Truth Assignments of a Horn Formula. J. Satisf. Boolean Model. Comput. 8(1/2): 63-82 (2012) - [i7]Marcel Wild:
Revisitin the enumeration of all models of a Boolean 2-CNF. CoRR abs/1208.2559 (2012) - 2011
- [i6]Marcel Wild:
Counting or producing all fixed cardinality transversals. CoRR abs/1106.0141 (2011) - [i5]Marcel Wild:
Coupons collecting with or without replacement, and with multipurpose coupons. CoRR abs/1107.1401 (2011) - 2010
- [j13]Kira V. Adaricheva
, Marcel Wild:
Realization of abstract convex geometries by point configurations. Eur. J. Comb. 31(1): 379-400 (2010) - [i4]Marcel Wild:
Computing the output distribution of a stack filter from the DNF of its positive Boolean function. CoRR abs/1001.2416 (2010) - [i3]Marcel Wild:
Compactly generating all satisfying truth assignments of a Horn formula. CoRR abs/1012.1769 (2010)
2000 – 2009
- 2009
- [i2]Marcel Wild:
Improving upon Maximum Independent Set by five orders of magnitude. CoRR abs/0901.4417 (2009) - 2008
- [j12]Marcel Wild:
Weakly submodular rank functions, supermatroids, and the flat lattice of a distributive supermatroid. Discret. Math. 308(7): 999-1017 (2008) - [j11]Marcel Wild:
Generating all cycles, chordless cycles, and Hamiltonian cycles with the principle of exclusion. J. Discrete Algorithms 6(1): 93-102 (2008) - 2005
- [j10]Marcel Wild:
The many benefits of putting stack filters into disjunctive or conjunctive normal form. Discret. Appl. Math. 149(1-3): 174-191 (2005) - [j9]Marcel Wild:
On Rank Functions of Lattices. Order 22(4): 357-370 (2005) - [j8]Marcel Wild:
The Asymptotic Number of Binary Codes and Binary Matroids. SIAM J. Discret. Math. 19(3): 691-699 (2005) - [j7]Marcel Wild:
The Groups of Order Sixteen Made Easy. Am. Math. Mon. 112(1): 20-31 (2005) - 2004
- [i1]Marcel Wild:
The asymptotic number of binary codes and binary matroids. CoRR cs.IT/0408011 (2004) - 2003
- [j6]Marcel Wild:
Idempotent and co-idempotent stack filters and min-max operators. Theor. Comput. Sci. 299(1-3): 603-631 (2003) - 2001
- [j5]Marcel Wild:
On the Idempotency and Co-idempotency of the Morphological Center. Int. J. Pattern Recognit. Artif. Intell. 15(7): 1119-1128 (2001)
1990 – 1999
- 1996
- [j4]Marcel Wild:
Base exchange properties of graphic matroids. Discret. Math. 148(1-3): 253-264 (1996) - [j3]Marcel Wild:
Consequences of the Brylawski-Lucas Theorem for Binary Matroids. Eur. J. Comb. 17(2-3): 309-316 (1996) - [j2]Christian Herrmann, Marcel Wild:
A Polynomial Algorithm for Testing Congruence Modularity. Int. J. Algebra Comput. 6(4): 379-388 (1996) - 1995
- [c1]Marcel Wild:
Computations with Finite Closure Systems and Implications. COCOON 1995: 111-120 - 1993
- [j1]Marcel Wild:
Cover preserving embedding of modular lattices into partition lattices. Discret. Math. 112(1-3): 207-244 (1993)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-08 01:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: