Polynomial space polynomial delay algorithms for listing families of graphs
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Generating all maximal independent sets of bounded-degree hypergraphs
COLT '97 Proceedings of the tenth annual conference on Computational learning theory
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Computing intersections of Horn theories for reasoning with models
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Graph orientations with no sink and an approximation for a hard case of #SAT
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
New results on monotone dualization and generating hypergraph transversals
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Decision lists and related Boolean functions
Theoretical Computer Science
Recognition of Simple Enlarged Horn Formulas and Simple Extended Horn Formulas
Annals of Mathematics and Artificial Intelligence
On kernels, defaults and even graphs
Annals of Mathematics and Artificial Intelligence
A formal framework for evaluating heuristic programs
Annals of Mathematics and Artificial Intelligence
On frequent sets of Boolean matrices
Annals of Mathematics and Artificial Intelligence
Machine Learning on the Basis of Formal Concept Analysis
Automation and Remote Control
On the complexity of bicoloring clique hypergraphs of graphs
Journal of Algorithms
Generating and Approximating Nondominated Coteries
IEEE Transactions on Parallel and Distributed Systems
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
Approximation of Relations by Propositional Formulas: Complexity and Semantics
Proceedings of the 5th International Symposium on Abstraction, Reformulation and Approximation
Algorithms for the Construction of Concept Lattices and Their Diagram Graphs
PKDD '01 Proceedings of the 5th European Conference on Principles of Data Mining and Knowledge Discovery
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
Generalized Model-Checking Problems for First-Order Logic
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Evaluation of an Algorithm for the Transversal Hypergraph Problem
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
Worst-case time bounds for coloring and satisfiability problems
Journal of Algorithms
Greedy algorithms, H-colourings and a complexity-theoretic dichotomy
Theoretical Computer Science
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
Version spaces and the consistency problem
Artificial Intelligence
Consensus algorithms for the generation of all maximal bicliques
Discrete Applied Mathematics - The fourth international colloquium on graphs and optimisation (GO-IV)
Journal of Algorithms
An incremental algorithm for computing ranked full disjunctions
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Inverting abstract unification for set-sharing
PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
All maximal independent sets and dynamic dominance for sparse graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Generating bicliques of a graph in lexicographic order
Theoretical Computer Science
Interconnection semantics for keyword search in XML
Proceedings of the 14th ACM international conference on Information and knowledge management
Generating all vertices of a polyhedron is hard
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Fault tolerance of switch blocks and switch block arrays in FPGA
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
Theoretical Computer Science - Parameterized and exact computation
Spanned patterns for the logical analysis of data
Discrete Applied Mathematics - Special issue: Discrete mathematics & data mining II (DM & DM II)
Finding and approximating top-k answers in keyword proximity search
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Frequent subgraph mining in outerplanar graphs
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Full disjunctions: polynomial-delay iterators in action
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
An incremental algorithm for computing ranked full disjunctions
Journal of Computer and System Sciences
On the fixed-parameter tractability of the equivalence test of monotone normal forms
Information Processing Letters
Maximally joining probabilistic data
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Satisfiability of mixed Horn formulas
Discrete Applied Mathematics
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
First-order queries on structures of bounded degree are computable with constant delay
ACM Transactions on Computational Logic (TOCL)
Theoretical Computer Science
Rethinking custom ISE identification: a new processor-agnostic method
CASES '07 Proceedings of the 2007 international conference on Compilers, architecture, and synthesis for embedded systems
An exact algorithm for the minimum dominating clique problem
Theoretical Computer Science
Self-correcting queries for xml
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem
Theoretical Computer Science
Matching twigs in probabilistic XML
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Semi-automatic schema integration in Clio
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Counting truth assignments of formulas of bounded tree-width or clique-width
Discrete Applied Mathematics
Maximum weight edge-constrained matchings
Discrete Applied Mathematics
Efficiently enumerating results of keyword search over data graphs
Information Systems
Complexity of DNF minimization and isomorphism testing for monotone formulas
Information and Computation
Query efficiency in probabilistic XML models
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Interactive generation of integrated schemas
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Keyword proximity search in complex data graphs
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Computer Networks: The International Journal of Computer and Telecommunications Networking
Computational Complexity
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
Inductive Logic Programming
Pinpointing in the Description Logic $\mathcal {EL}^+$
KI '07 Proceedings of the 30th annual German conference on Advances in Artificial Intelligence
Efficient Closed Pattern Mining in Strongly Accessible Set Systems (Extended Abstract)
PKDD 2007 Proceedings of the 11th European conference on Principles and Practice of Knowledge Discovery in Databases
A Linear Delay Algorithm for Building Concept Lattices
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Iterative Compression and Exact Algorithms
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Efficient Frequent Connected Subgraph Mining in Graphs of Bounded Treewidth
ECML PKDD '08 Proceedings of the 2008 European Conference on Machine Learning and Knowledge Discovery in Databases - Part I
Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties
Journal of Computer and System Sciences
Listing minimal edge-covers of intersecting families with applications to connectivity problems
Discrete Applied Mathematics
On Independent Sets and Bicliques in Graphs
Graph-Theoretic Concepts in Computer Science
Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help?
Complexity of Constraints
On Generating All Maximal Acyclic Subhypergraphs with Polynomial Delay
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
A scalable, parallel algorithm for maximal clique enumeration
Journal of Parallel and Distributed Computing
Enumeration aspects of maximal cliques and bicliques
Discrete Applied Mathematics
Lower bounds for three algorithms for transversal hypergraph generation
Discrete Applied Mathematics
Modeling and querying probabilistic XML data
ACM SIGMOD Record
Combinatorial optimization in system configuration design
Automation and Remote Control
A game-theoretic approach to partial clique enumeration
Image and Vision Computing
Pareto Optima of Multicriteria Integer Linear Programs
INFORMS Journal on Computing
Some Computational Problems Related to Pseudo-intents
ICFCA '09 Proceedings of the 7th International Conference on Formal Concept Analysis
Theoretical and Computational Properties of Preference-based Argumentation
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Spectrum allocation and scheduling in dynamic spectrum access wireless networks
The Fourth International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness & Workshops
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
Information Systems
Information Systems
All maximal independent sets and dynamic dominance for sparse graphs
ACM Transactions on Algorithms (TALG)
Towards the Complexity of Recognizing Pseudo-intents
ICCS '09 Proceedings of the 17th International Conference on Conceptual Structures: Conceptual Structures: Leveraging Semantic Technologies
Incremental recompilation of knowledge
Journal of Artificial Intelligence Research
Query evaluation over probabilistic XML
The VLDB Journal — The International Journal on Very Large Data Bases
The Helly property and satisfiability of Boolean formulas defined on set families
European Journal of Combinatorics
Note: Listing closed sets of strongly accessible set systems with applications to data mining
Theoretical Computer Science
Aproximating size of maximal clique in a node's neighbourhood in the ad hoc networks
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
On the Complexity of Constraint-Based Theory Extraction
DS '09 Proceedings of the 12th International Conference on Discovery Science
Comparison of Data Structures for Computing Formal Concepts
MDAI '09 Proceedings of the 6th International Conference on Modeling Decisions for Artificial Intelligence
Exact Algorithms for Dominating Clique Problems
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Spanned patterns for the logical analysis of data
Discrete Applied Mathematics - Special issue: Discrete mathematics & data mining II (DM & DM II)
3-coloring in time O (1.3289n)
Journal of Algorithms
Iterative compression and exact algorithms
Theoretical Computer Science
Minimum fill-in and treewidth of split+ke and split+kv graphs
Discrete Applied Mathematics
Enumerating all solutions for constraint satisfaction problems
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
On the diffvierence of horn theories
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Algorithms for variable-weighted 2-SAT and dual problems
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Lower bounds for three algorithms for the transversal hypergraph generation
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
WAW'07 Proceedings of the 5th international conference on Algorithms and models for the web-graph
Minimum fill-in and treewidth of split+ke and split+kv graphs
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Theoretical underpinnings for maximal clique enumeration on perturbed graphs
Theoretical Computer Science
On the complexity of computing generators of closed sets
ICFCA'08 Proceedings of the 6th international conference on Formal concept analysis
Some fixed-parameter tractable classes of hypergraph duality and related problems
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Exact algorithms for edge domination
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Understanding queries in a search database system
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient frequent connected subgraph mining in graphs of bounded tree-width
Theoretical Computer Science
Fast, nearly optimal ISE identification with I/O serialization through maximal clique enumeration
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Computing the lattice of all fixpoints of a fuzzy closure operator
IEEE Transactions on Fuzzy Systems - Special section on computing with words
Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph
Discrete Applied Mathematics
Enumeration of the perfect sequences of a chordal graph
Theoretical Computer Science
Frequent subgraph mining in outerplanar graphs
Data Mining and Knowledge Discovery
Complexity of Axiom Pinpointing in the DL-Lite Family of Description Logics
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Version spaces without boundary sets
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Enumeration of the monomials of a polynomial and related complexity classes
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Towards certain fixes with editing rules and master data
Proceedings of the VLDB Endowment
EURASIP Journal on Wireless Communications and Networking
Shopping for products you don't know you need
Proceedings of the fourth ACM international conference on Web search and data mining
Parallel algorithm for computing fixpoints of Galois connections
Annals of Mathematics and Artificial Intelligence
On the optimal approximation of queries using tractable propositional languages
Proceedings of the 14th International Conference on Database Theory
On the complexity of enumerating pseudo-intents
Discrete Applied Mathematics
Left-to-Right Multiplication for Monotone Boolean Dualization
SIAM Journal on Computing
Parameterized edge dominating set in cubic graphs
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Enumerating all solutions of a boolean CSP by non-decreasing weight
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
New parameterized algorithms for the edge dominating set problem
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Enumeration of minimal dominating sets and variants
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Information Sciences: an International Journal
Combining incompleteness and ranking in tree queries
ICDT'07 Proceedings of the 11th international conference on Database Theory
A branch-and-reduce algorithm for finding a minimum independent dominating set in graphs
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Efficiently enumerating results of keyword search
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
Worst case bounds for some NP-Complete modified Horn-SAT problems
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Finding kernels or solving SAT
Journal of Discrete Algorithms
Journal of Computer and System Sciences
A new algorithm for the hypergraph transversal problem
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
A new algorithm for enumerating all maximal cliques in complex network
ADMA'06 Proceedings of the Second international conference on Advanced Data Mining and Applications
About the enumeration algorithms of closed sets
ICFCA'10 Proceedings of the 8th international conference on Formal Concept Analysis
An abstract framework for generating maximal answers to queries
ICDT'05 Proceedings of the 10th international conference on Database Theory
Counting all solutions of minimum weight exact satisfiability
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
On multipath routing with transit hubs
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
New applications of clique separator decomposition for the maximum weight stable set problem
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Randomized approximations of parameterized counting problems
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
An exact algorithm for the minimum dominating clique problem
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Incrementally computing ordered answers of acyclic conjunctive queries
NGITS'06 Proceedings of the 6th international conference on Next Generation Information Technologies and Systems
Branching and treewidth based exact algorithms
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Fast algorithms for min independent dominating set
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Crisply generated fuzzy concepts
ICFCA'05 Proceedings of the Third international conference on Formal Concept Analysis
Constraints on the number of maximal independent sets in graphs
Journal of Graph Theory
Fuzzy relational equations with min-biimplication composition
Fuzzy Optimization and Decision Making
A refined exact algorithm for edge dominating set
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Algorithms for dominating clique problems
Theoretical Computer Science
Computing Formal Concepts by Attribute Sorting
Fundamenta Informaticae - Concept Lattices and Their Applications
Algorithms and limits for compact plan representations
Journal of Artificial Intelligence Research
Generating minimal k-vertex connected spanning subgraphs
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
A parameterizable enumeration algorithm for sequence mining
Theoretical Computer Science
Parameterized top-K algorithms
Theoretical Computer Science
The complexity of mining maximal frequent subgraphs
Proceedings of the 32nd symposium on Principles of database systems
Completing causal networks by meta-level abduction
Machine Learning
Maximal cliques based rigid body motion segmentation with a RGB-D camera
ACCV'12 Proceedings of the 11th Asian conference on Computer Vision - Volume Part II
Closure-based constraints in formal concept analysis
Discrete Applied Mathematics
Static analysis and optimization of semantic web queries
ACM Transactions on Database Systems (TODS) - Invited papers issue
One size does not fit all: multi-granularity search of web forums
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Cliques in odd-minor-free graphs
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
An incremental polynomial time algorithm to enumerate all minimal edge dominating sets
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Parameterized edge dominating set in graphs with degree bounded by 3
Theoretical Computer Science
Computer Networks: The International Journal of Computer and Telecommunications Networking
On Enumerating Monomials and Other Combinatorial Structures by Polynomial Interpolation
Theory of Computing Systems
New parameterized algorithms for the edge dominating set problem
Theoretical Computer Science
Anytime approximation in probabilistic databases
The VLDB Journal — The International Journal on Very Large Data Bases
Scheduling modular projects on a bottleneck resource
Journal of Scheduling
| Hi-index | 0.91 |