Generating all maximal independent sets of bounded-degree hypergraphs
COLT '97 Proceedings of the tenth annual conference on Computational learning theory
Identification of gene regulatory networks by strategic gene disruptions and gene overexpressions
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Almost all monotone Boolean functions are polynomially learnable using membership queries
Information Processing Letters
New results on monotone dualization and generating hypergraph transversals
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Classification trees for problems with monotonicity constraints
ACM SIGKDD Explorations Newsletter
Dualization, decision lists and identification of monotone discrete functions
Annals of Mathematics and Artificial Intelligence
On frequent sets of Boolean matrices
Annals of Mathematics and Artificial Intelligence
Efficient dualization of O(log n)-term monotone disjunctive normal forms
Discrete Applied Mathematics
Monotone boolean dualization is in co-NP[log2n]
Information Processing Letters
Translation among CNFs, characteristic models and ordered binary decision diagrams
Information Processing Letters
Matroid Intersections, Polymatroid Inequalities, and Related Problems
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Generating Partial and Multiple Transversals of a Hypergraph
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Hypergraph Transversal Computation and Related Problems in Logic and AI
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
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
Exact Learning when Irrelevant Variables Abound
EuroCOLT '99 Proceedings of the 4th European Conference on Computational Learning Theory
Rough Sets and Ordinal Classification
ALT '00 Proceedings of the 11th International Conference on Algorithmic Learning Theory
Self-Duality of Bounded Monotone Boolean Functions and Related Problems
ALT '00 Proceedings of the 11th International Conference on Algorithmic Learning Theory
An Algorithm for Dualization in Products of Lattices and Its Applications
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Dense Families and Key Functions of Database Relation Instances
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
On computing all abductive explanations
Eighteenth national conference on Artificial intelligence
Discovering all most specific sentences
ACM Transactions on Database Systems (TODS)
On Maximal Frequent and Minimal Infrequent Sets in Binary Matrices
Annals of Mathematics and Artificial Intelligence
Interior and exterior functions of positive Boolean functions
Discrete Applied Mathematics
An inequality for polymatroid functions and its applications
Discrete Applied Mathematics - Submodularity
Pareto-optimal patterns in logical analysis of data
Discrete Applied Mathematics - Discrete mathematics & data mining (DM & DM)
The complexity of modular decomposition of boolean functions
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University
On the fixed-parameter tractability of the equivalence test of monotone normal forms
Information Processing Letters
On the complexity of the multiplication method for monotone CNF/DNF dualization
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
On computing all abductive explanations from a propositional Horn theory
Journal of the ACM (JACM)
Logical analysis of data --- the vision of Peter L. Hammer
Annals of Mathematics and Artificial Intelligence
Self-duality of bounded monotone boolean functions and related problems
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
Tree-Shellability of Restricted DNFs
IEICE - Transactions on Information and Systems
A Fast and Simple Parallel Algorithm for the Monotone Duality Problem
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Translating between Horn representations and their characteristic models
Journal of Artificial Intelligence Research
The complexity of modular decomposition of Boolean functions
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
Pareto-optimal patterns in logical analysis of data
Discrete Applied Mathematics
An intersection inequality for discrete distributions and related generation problems
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
On the fractional chromatic number of monotone self-dual Boolean functions
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
Some fixed-parameter tractable classes of hypergraph duality and related problems
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Left-to-Right Multiplication for Monotone Boolean Dualization
SIAM Journal on Computing
On fuzzy relational equations and the covering problem
Information Sciences: an International Journal
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
A Representation Of Dependence Spaces And Some Basic Algorithms
Fundamenta Informaticae
Hi-index | 0.00 |