Closures of database hypergraphs
Journal of the ACM (JACM)
One flavor assumption and gamma-acyclicity for universal relation views
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
The equivalence of solving queries and producing tree projections (extended abstract)
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
Sagiv,Y-On finite FD-acyclicity
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
Doubly lexical orderings of matrices
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Fast parallel algorithms for chordal graphs
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
NC Algorithms for Recognizing Chordal Graphs and k Trees
IEEE Transactions on Computers
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Solving queries by tree projections
ACM Transactions on Database Systems (TODS)
Perspectives on database theory
ACM SIGACT News
Graph-theoretic methods in database theory
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Hypertree decompositions and tractable queries
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A wide-range efficient algorithm for minimal triangulation
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Fully dynamic algorithms for chordal graphs
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Solution Techniques for Constraint Satisfaction Problems: Advanced Approaches
Artificial Intelligence Review
The complexity of acyclic conjunctive queries
Journal of the ACM (JACM)
A simple paradigm for graph recognition: application to cographs and distance hereditary graphs
Theoretical Computer Science
New results on monotone dualization and generating hypergraph transversals
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Computational Properties of Two Exact Algorithms for Bayesian Networks
Applied Intelligence
Resolution versus Search: Two Strategies for SAT
Journal of Automated Reasoning
Decomposing Bayesian networks: triangulation of the moral graph with genetic algorithms
Statistics and Computing
A hypergraph-theoretic analysis of collapsibility and decomposability for extended log-linear models
Statistics and Computing
Query evaluation via tree-decompositions
Journal of the ACM (JACM)
On graph powers for leaf-labeled trees
Journal of Algorithms
Searching for the best elimination sequence in Bayesian networks by using ant colony optimization
Pattern Recognition Letters
Optimizing exact genetic linkage computations
RECOMB '03 Proceedings of the seventh annual international conference on Research in computational molecular biology
On finding minimum-diameter clique trees
Nordic Journal of Computing
Query Evaluation via Tree-Decompositions
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Hypertree Decompositions: A Survey
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
On Graph Powers for Leaf-Labeled Trees
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Linear Time Algorithms on Chordal Bipartite and Strongly Chordal Graphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
LexBFS-Ordering in Asteroidal Triple-Free Graphs
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Phylogenetic k-Root and Steiner k-Root
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
A Linear Time Algorithm for Enumerating All the Minimum and Minimal Separators of a Chordal Graph
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Random 3-SAT and BDDs: The Plot Thickens Further
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Complexity Classification of Some Edge Modification Problems
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Maximum Cardinality Search for Computing Minimal Triangulations
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Line Graph of Gamma-Acyclic Database Schems and its Recognition Algorithm
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
Graph connectivity and its augmentation: applications of MA orderings
Discrete Applied Mathematics
Hybrid backtracking bounded by tree-decomposition of constraint networks
Artificial Intelligence
A linear time recognition algorithm for proper interval graphs
Information Processing Letters
Learning equivalence classes of bayesian-network structures
The Journal of Machine Learning Research
Generating and characterizing the perfect elimination orderings of a chordal graph
Theoretical Computer Science - Random generation of combinatorial objects and bijective combinatorics
Hole and antihole detection in graphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A Framework for Constrained Functional Verification
Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
On the structure of (P5,gem)-free graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Chordal co-gem-free and (P5,gem)-freegraphs have bounded clique-width
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Query answering exploiting structural properties
ACM SIGMOD Record
Unifying tree decompositions for reasoning in graphical models
Artificial Intelligence
Parallel recognition algorithms for chordal_planar graphs and planar k-trees
Journal of Parallel and Distributed Computing
A wide-range algorithm for minimal triangulation from an arbitrary ordering
Journal of Algorithms
Chordless paths through three vertices
Theoretical Computer Science - Parameterized and exact computation
Decomposition of structural learning about directed acyclic graphs
Artificial Intelligence
Symbolic Techniques in Satisfiability Solving
Journal of Automated Reasoning
Approximating interval coloring and max-coloring in chordal graphs
Journal of Experimental Algorithmics (JEA)
Local Propagation in Conditional Gaussian Bayesian Networks
The Journal of Machine Learning Research
Exact algorithms and applications for Tree-like Weighted Set Cover
Journal of Discrete Algorithms
Prim-based support-graph preconditioners for min-cost flow problems
Computational Optimization and Applications
On the maximum cardinality search lower bound for treewidth
Discrete Applied Mathematics
Partition search for non-binary constraint satisfaction
Information Sciences: an International Journal
On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs
Theoretical Computer Science
An optimistic and conservative register assignment heuristic for chordal graphs
CASES '07 Proceedings of the 2007 international conference on Compilers, architecture, and synthesis for embedded systems
Extracting constrained 2-interval subsets in 2-interval sets
Theoretical Computer Science
Tree decomposition and discrete optimization problems: A survey
Cybernetics and Systems Analysis
Optimal polynomial-time interprocedural register allocation for high-level synthesis and ASIP design
Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
Two fixed-parameter algorithms for Vertex Covering by Paths on Trees
Information Processing Letters
International Journal of Computational Science and Engineering
Counting the number of independent sets in chordal graphs
Journal of Discrete Algorithms
On the complexity of deriving schema mappings from database instances
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Fully dynamic algorithms for chordal graphs and split graphs
ACM Transactions on Algorithms (TALG)
A Recursive Method for Structural Learning of Directed Acyclic Graphs
The Journal of Machine Learning Research
Discrete Applied Mathematics
Alternative Aggregates in Mizar
Calculemus '07 / MKM '07 Proceedings of the 14th symposium on Towards Mechanized Mathematical Assistants: 6th International Conference
On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Structure and linear-time recognition of 4-leaf powers
ACM Transactions on Algorithms (TALG)
Covariance selection for nonchordal graphs via chordal embedding
Optimization Methods & Software - Mathematical programming in data mining and machine learning
Theoretical Computer Science
Iterative proportional scaling via decomposable submodels for contingency tables
Computational Statistics & Data Analysis
Enumerating the decomposable neighbors of a decomposable graph under a simple perturbation scheme
Computational Statistics & Data Analysis
Approximating maximum weight K-colorable subgraphs in chordal graphs
Information Processing Letters
Uniform Constraint Satisfaction Problems and Database Theory
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 Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Linear-time certifying recognition algorithms and forbidden induced subgraphs
Nordic Journal of Computing
Laminar structure of ptolemaic graphs with applications
Discrete Applied Mathematics
The clique-separator graph for chordal graphs
Discrete Applied Mathematics
Triangulation Heuristics for BN2O Networks
ECSQARU '09 Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Tractable Optimization Problems through Hypergraph-Based Structural Restrictions
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Exploiting tree decomposition and soft local consistency in weighted CSP
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
On the complexity of signed and minus total domination in graphs
Information Processing Letters
Exploiting causal independence in Bayesian network inference
Journal of Artificial Intelligence Research
HUGIN: a shell for building Bayesian belief universes for expert systems
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
Dynamic heuristics for backtrack search on tree-decomposition of CSPs
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
On a generalization of triangulated graphs for domains decomposition of CSPs
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Unifying tree decompositions for reasoning in graphical models
Artificial Intelligence
Decomposition of structural learning about directed acyclic graphs
Artificial Intelligence
Schema mapping discovery from data instances
Journal of the ACM (JACM)
Proceedings of the 42nd Annual IEEE/ACM International Symposium on Microarchitecture
On the structure of (P5,gem)-free graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Chordal co-gem-free and (P5,gem)-free graphs have bounded clique-width
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
A wide-range algorithm for minimal triangulation from an arbitrary ordering
Journal of Algorithms
Theoretical Computer Science
The induced path function, monotonicity and betweenness
Discrete Applied Mathematics
Treewidth computations I. Upper bounds
Information and Computation
A note on minimal d-separation trees for structural learning
Artificial Intelligence
Dynamic programming and planarity: Improved tree-decomposition based algorithms
Discrete Applied Mathematics
Generation of tree decompositions by iterated local search
EvoCOP'07 Proceedings of the 7th European conference on Evolutionary computation in combinatorial optimization
How to use planarity efficiently: new tree-decomposition based algorithms
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
On listing, sampling, and counting the chordal graphs with edge constraints
Theoretical Computer Science
Wheel-free deletion is W[2]-hard
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
Enumeration of the perfect sequences of a chordal graph
Theoretical Computer Science
The logic of representing dependencies by directed graphs
AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 1
The logic of representing dependencies by directed graphs
AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 1
Constructor: a system for the induction of probabilistic models
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 2
Default logic, propositional logic and constraints
AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 1
A General Label Search to investigate classical graph search algorithms
Discrete Applied Mathematics
Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism
Journal of Experimental Algorithmics (JEA)
New min-max theorems for weakly chordal and dually hordal graphs
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph
Information Processing Letters
Treewidth computations II. Lower bounds
Information and Computation
Path-based supports for hypergraphs
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Blocks of hypergraphs: applied to hypergraphs and outerplanarity
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Fast minimal triangulation algorithm using minimum degree criterion
Theoretical Computer Science
Data generation using declarative constraints
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts
Computers and Operations Research
Satisfiability of acyclic and almost acyclic CNF formulas (II)
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Minimizing fuel cost in gas transmission networks by dynamic programming and adaptive discretization
Computers and Industrial Engineering
New multithreaded ordering and coloring algorithms for multicore architectures
Euro-Par'11 Proceedings of the 17th international conference on Parallel processing - Volume Part II
Polynomial kernels for proper interval completion and related problems
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Constructing perfect phylogenies and proper triangulations for three-state characters
WABI'11 Proceedings of the 11th international conference on Algorithms in bioinformatics
Efficiently solvable perfect phylogeny problems on binary and k-state data with missing values
WABI'11 Proceedings of the 11th international conference on Algorithms in bioinformatics
Pre-processing for triangulation of probabilistic networks
UAI'01 Proceedings of the Seventeenth conference on Uncertainty in artificial intelligence
Marginalizing in undirected graph and hypergraph models
UAI'98 Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence
Inference with causal independence in the CPSC network
UAI'95 Proceedings of the Eleventh conference on Uncertainty in artificial intelligence
Coherent knowledge processing at maximum entropy by spirit
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
A probabilistic approach to hierarchical model-based diagnosis
UAI'94 Proceedings of the Tenth international conference on Uncertainty in artificial intelligence
Intercausal independence and heterogeneous factorization
UAI'94 Proceedings of the Tenth international conference on Uncertainty in artificial intelligence
An algorithm for deciding if a set of observed independencies has a causal explanation
UAI'92 Proceedings of the Eighth international conference on Uncertainty in artificial intelligence
Arboricity: An acyclic hypergraph decomposition problem motivated by database theory
Discrete Applied Mathematics
Extension Preservation Theorems on Classes of Acyclic Finite Structures
SIAM Journal on Computing
Triangulation of bayesian networks using an adaptive genetic algorithm
ISMIS'06 Proceedings of the 16th international conference on Foundations of Intelligent Systems
Learning approximate MRFs from large transaction data
PKDD'06 Proceedings of the 10th European conference on Principle and Practice of Knowledge Discovery in Databases
An extension of complexity bounds and dynamic heuristics for tree-decompositions of CSP
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Treewidth: characterizations, applications, and computations
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
A faster algorithm to recognize even-hole-free graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Linear-Time algorithms for tree root problems
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Register allocation via coloring of chordal graphs
APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
Symbolic probabilistic inference with continuous variables
UAI'91 Proceedings of the Seventh conference on Uncertainty in Artificial Intelligence
From relational databases to belief networks
UAI'91 Proceedings of the Seventh conference on Uncertainty in Artificial Intelligence
Experimental evaluation of classical automata constructions
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Search vs. symbolic techniques in satisfiability solving
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
iSAM2: Incremental smoothing and mapping using the Bayes tree
International Journal of Robotics Research
Ultimate generalizations of LexBFS and LEX m
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Optimal hypergraph tree-realization
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
On finding acyclic subhypergraphs
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Lexicographic breadth first search – a survey
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
On the maximum cardinality search lower bound for treewidth
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
On planar supports for hypergraphs
GD'09 Proceedings of the 17th international conference on Graph Drawing
Ant colony optimization for tree decompositions
EvoCOP'10 Proceedings of the 10th European conference on Evolutionary Computation in Combinatorial Optimization
Improved exponential-time algorithms for treewidth and minimum fill-in
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Efficient algorithms for network localization using cores of underlying graphs
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Finding contractions and induced minors in chordal graphs via disjoint paths
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Path-based supports for hypergraphs
Journal of Discrete Algorithms
Fully dynamic algorithm for chordal graphs with O(1) query-time and O(n 2) update-time
Theoretical Computer Science
Tree decompositions of graphs: Saving memory in dynamic programming
Discrete Optimization
A REVIEW OF TREE CONVEX SETS TEST
Computational Intelligence
Graph transformations preserving the stability number
Discrete Applied Mathematics
Computing all-pairs shortest paths by leveraging low treewidth
Journal of Artificial Intelligence Research
On exact algorithms for treewidth
ACM Transactions on Algorithms (TALG)
On the L(h, k)-labeling of co-comparability graphs
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Evaluating tree-decomposition based algorithms for answer set programming
LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
Triangulation and clique separator decomposition of claw-free graphs
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Satisfiability of acyclic and almost acyclic CNF formulas
Theoretical Computer Science
Semantic acyclicity on graph databases
Proceedings of the 32nd symposium on Principles of database systems
Moplex orderings generated by the LexDFS algorithm
Discrete Applied Mathematics
Decomposing combinatorial auctions and set packing problems
Journal of the ACM (JACM)
Computing cooperative solution concepts in coalitional skill games
Artificial Intelligence
Semiring labelled decision diagrams, revisited: canonicity and spatial efficiency issues
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Polynomial kernels for Proper Interval Completion and related problems
Information and Computation
Contracting chordal graphs and bipartite graphs to paths and trees
Discrete Applied Mathematics
| Hi-index | 0.01 |