#### Filter Results:

- Full text PDF available (11)

#### Publication Year

1998

2018

- This year (2)
- Last 5 years (7)
- Last 10 years (7)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Dimitris J. Kavvadias, Elias C. Stavropoulos
- J. Graph Algorithms Appl.
- 2005

The Transversal Hypergraph Generation is the problem of generating, given a hypergraph, the set of its minimal transversals, i.e., the hypergraph whose hyperedges are the minimal hitting sets of theâ€¦ (More)

- Dimitris J. Kavvadias, Elias C. Stavropoulos
- Algorithm Engineering
- 1999

The Transversal Hypergraph Problem is the problem of computing, given a hypergraph, the set of its minimal transversals, i.e. the hypergraph whose hyperedges are all minimal hitting sets of the givenâ€¦ (More)

- Dimitris J. Kavvadias, Martha Sideri, Elias C. Stavropoulos
- Inf. Process. Lett.
- 2000

We examine the computational problem of generating all maximal models of a Boolean expression in CNF. We give a resolution-like method that reduces the unnegated variables of an expression whileâ€¦ (More)

- Dimitris J. Kavvadias, Elias C. Stavropoulos
- Inf. Process. Lett.
- 2003

In 1996, Fredman and Khachiyan [J. Algorithms 21 (1996) 618â€“628] presented a remarkable algorithm for the problem of checking the duality of a pair of monotone Boolean expressions in disjunctiveâ€¦ (More)

- Elias C. Stavropoulos, Vassilios S. Verykios, Vasileios Kagklis
- Knowledge and Information Systems
- 2015

We propose a methodology for hiding all sensitive frequent itemsets in a transaction database. Our methodology relies on a novel technique that enumerates the minimal transversals of a hypergraph inâ€¦ (More)

We give a deterministic polynomial-time algorithm which for any given average degree d and asymptotically almost all random graphs G in G(n, m = d2n ) outputs a cut of G whose ratio (in cardinality)â€¦ (More)

We present an algorithm that checks the duality of a pair of monotone Boolean expressions in disjunctive normal form in polynomial time plus O(log n/ log log n) nondeterministic guesses, where n isâ€¦ (More)

- FormulasDimitris J. Kavvadias, Martha Sideri, Elias C. Stavropoulos
- 1998

We investigate the problem of generating the maximal models of Horn formulas. Based on the Resolution Theorem of Kavvadias and Stavropoulos Computer Technology Institute, CTI TR 98.2.4, Februaryâ€¦ (More)

Generation problems are the problems of enumerating all configurations that satisfy a given specification. Our research is focused on the generation of all maximal satisfying truth assignments ofâ€¦ (More)