On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions

Efficient dualization of O(log n)-term monotone disjunctive normal forms

Discrete Applied Mathematics

Matroid Intersections, Polymatroid Inequalities, and Related Problems

MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science

Generating Partial and Multiple Transversals of a Hypergraph

ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming

On Dualization in Products of Forests

STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science

On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets

STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science

An Algorithm for Dualization in Products of Lattices and Its Applications

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms

On Maximal Frequent and Minimal Infrequent Sets in Binary Matrices

Annals of Mathematics and Artificial Intelligence

An inequality for polymatroid functions and its applications

Discrete Applied Mathematics - Submodularity

An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation

Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University

Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data

Theoretical Computer Science

Complexity of DNF minimization and isomorphism testing for monotone formulas

Information and Computation

An improvement on the complexity of factoring read-once Boolean functions

Discrete Applied Mathematics

Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions

Discrete Applied Mathematics

Computational aspects of monotone dualization: A brief survey

Discrete Applied Mathematics

On the complexity of monotone dualization and generating minimal hypergraph transversals

Discrete Applied Mathematics

Scientific contributions of Leo Khachiyan (a short overview)

Discrete Applied Mathematics

Stability of two player game structures

Discrete Applied Mathematics

On the relation between fuzzy max-Archimedean t-norm relational equations and the covering problem

Fuzzy Sets and Systems

Minimal Conflicting Sets for the Consecutive Ones Property in Ancestral Genome Reconstruction

RECOMB-CG '09 Proceedings of the International Workshop on Comparative Genomics

An intersection inequality for discrete distributions and related generation problems

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming

A complete characterization of Nash-solvability of bimatrix games in terms of the exclusion of certain 2 × 2 subgames

CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications

On fuzzy relational equations and the covering problem

Information Sciences: an International Journal

Extending the fault classification hierarchy for software with relational operators

ACS'06 Proceedings of the 6th WSEAS international conference on Applied computer science

On the readability of monotone Boolean formulae

Journal of Combinatorial Optimization

Generating all minimal integral solutions to monotone ∧,∨-systems of linear, transversal and polymatroid inequalities

MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science

Finding all minimal infrequent multi-dimensional intervals

LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics

Discovering all associations in discrete data using frequent minimally infrequent attribute sets

Discrete Applied Mathematics