An efficient algorithm for the transversal hypergraph generation. Kavvadias, Dimitris J, and Elias C Stavropoulos. 2005. “An Efficient Algorithm For The Transversal Hypergraph Generation.”. J. Graph Algorithms Appl. 9: 239–264.
Monotone boolean dualization is in co-NP [log 2 n] Kavvadias, Dimitris J, and Elias C Stavropoulos. 2003. “Monotone Boolean Dualization Is In Co-Np [Log 2 N]”. Information Processing Letters 85: 1–6.
Checking monotone Boolean duality with limited nondeterminism Kavvadias, Dimitris J, and Elias C Stavropoulos. 2003. “Checking Monotone Boolean Duality With Limited Nondeterminism”.
TECHNICAL REPORT No. TR2001/12/03 Kavvadias, Dimitris J, and Elias C Stavropoulos. 2001. Technical Report No. Tr2001/12/03. Citeseer.
Generating all maximal models of a Boolean expression Kavvadias, Dimitris J, Martha Sideri, and Elias C Stavropoulos. 2000. “Generating All Maximal Models Of A Boolean Expression”. Information Processing Letters 74: 157–162.
Evaluation of an algorithm for the transversal hypergraph problem Kavvadias, Dimitris J, and Elias C Stavropoulos. 1999. “Evaluation Of An Algorithm For The Transversal Hypergraph Problem”. In Algorithm Engineering, Algorithm Engineering, Springer, 72–84.
On a resolution theorem for maximal models Kavvadias, Dimitris J, and Elias C Stavropoulos. 1998. On A Resolution Theorem For Maximal Models. Citeseer.
On the maximal models of Horn formulas Kavvadias, Dimitris J, Martha Sideri, and Elias C Stavropoulos. 1998. On The Maximal Models Of Horn Formulas. Citeseer.