arXiv:1605.05102v2 [cs.DS] 25 May 2016 Page 1 arXiv:1605.05102v2 [cs.DS] 25 May 2016
Enumeration of Enumeration Algorithms Kunihiro Wasa∗ May 26, 2016 Abstract In this paper …

This report details the reasons for and our experience of applying the relation-and order-
theoretical methods to quantifying the feasibility of solving precedence-constrained traveling …

Two of the most important invariants associated with a poset P are the number of linear
extensions, e (P), and the number of order ideals, i (P). Many important techniques to …

We present a novel technique for converting a Boolean conjunctive normal form (CNF) into
an orthogonal disjunctive normal form (DNF), aka exclusive sum of products. Our method …

This is Part A of four Parts dedicated to modular lattices of finite length. It builds on 1992
notes of the author (available on ResearchGate), and in so doing heeds a wish of the late …

Given are the facets of an abstract (finite) simplicial complex SC. We show how to partition
SC into few pieces, each one compactly encoded by the use of wildcards. Such a …

Skyline queries are multicriteria queries that are of great interest for decision applications.
Skyline Groups extend the idea of skyline to groups of objects. In the recent years, several …

It is known that all models of a 2-CNF formula can be enumerated in output-polynomial time,
yet both the approach of Kawadias-Sideri 1998 (abstract oracle-scheme) and the one of …

Рассматриваемые в диссертации задачи допустимо полагать обобщениями широко
известной задачи коммивояжера (Traveling Salesman Problem), далее TSP: требуется …

Achieving the goals in the title (and others) relies on a cardinality-wise scanning of the
ideals of the poset. Specifically, the relevant numbers attached to the k+ 1 element ideals …