Allocating Modules to Processors in a Distributed System
IEEE Transactions on Software Engineering
Finding approximate separators and computing tree width quickly
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
A linear time algorithm for finding tree-decompositions of small treewidth
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
An algebraic theory of graph reduction
Journal of the ACM (JACM)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Hypertree decompositions and tractable queries
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Fully dynamic output bounded single source shortest path problem
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
ACM Computing Surveys (CSUR)
Decomposable negation normal form
Journal of the ACM (JACM)
Stochastic lambda calculus and monads of probability distributions
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Backjump-based backtracking for constraint satisfaction problems
Artificial Intelligence
Counting H-colorings of partial k-trees
Theoretical Computer Science
Mini-buckets: A general scheme for bounded inference
Journal of the ACM (JACM)
The longest common subsequence problem for sequences with nested arc annotations
Journal of Computer and System Sciences - Computational biology 2002
On the complexity of the maximum cut problem
Nordic Journal of Computing
Optimizing exact genetic linkage computations
RECOMB '03 Proceedings of the seventh annual international conference on Research in computational molecular biology
Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex Cover
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Separators Are as Simple as Cutsets
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
The Longest Common Subsequence Problem for Sequences with Nested Arc Annotations
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Counting H-Colorings of Partial k-Trees
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Boosting Search with Variable Elimination
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
A General Scheme for Multiple Lower Bound Computation in Constraint Optimization
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Deriving Formulas for Domination Numbers of Fasciagraphs and Rotagraphs
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Generating random solutions for constraint satisfaction problems
Eighteenth national conference on Artificial intelligence
Tree approximation for belief updating
Eighteenth national conference on Artificial intelligence
A spectral lower bound for the treewidth of a graph and its consequences
Information Processing Letters
Splitting a graph into disjoint induced paths or cycles
Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
Annals of Mathematics and Artificial Intelligence
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Journal of Combinatorial Theory Series B
Partition-based logical reasoning for first-order and propositional theories
Artificial Intelligence - Special volume on reformulation
Unifying tree decompositions for reasoning in graphical models
Artificial Intelligence
Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover
Discrete Applied Mathematics
Degree-constrained decompositions of graphs: bounded treewidth and planarity
Theoretical Computer Science
Header-size lower bounds for end-to-end communication in memoryless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking - Web dynamics
AND/OR search spaces for graphical models
Artificial Intelligence
Approximating the maximum clique minor and some subgraph homeomorphism problems
Theoretical Computer Science
Generalized hypertree decompositions: np-hardness and tractable variants
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Journal of Combinatorial Theory Series B
A logical approach to efficient Max-SAT solving
Artificial Intelligence
Exploiting shared correlations in probabilistic databases
Proceedings of the VLDB Endowment
Solving problems on recursively constructed graphs
ACM Computing Surveys (CSUR)
Generalized hypertree decompositions: NP-hardness and tractable variants
Journal of the ACM (JACM)
Bounded treewidth as a key to tractability of knowledge representation and reasoning
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Mini-buckets: a general scheme for generating approximations in automated reasoning
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Cutset sampling for Bayesian networks
Journal of Artificial Intelligence Research
M-DPOP: faithful distributed implementation of efficient social choice problems
Journal of Artificial Intelligence Research
On the space-time trade-off in solving constraint satisfaction problems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
On problems without polynomial kernels
Journal of Computer and System Sciences
Solving weighted constraint satisfaction problems with memetic/exact hybrid algorithms
Journal of Artificial Intelligence Research
A scalable method for multiagent constraint optimization
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
PrDB: managing and exploiting rich correlations in probabilistic databases
The VLDB Journal — The International Journal on Very Large Data Bases
Partition-based logical reasoning for first-order and propositional theories
Artificial Intelligence - Special volume on reformulation
Unifying tree decompositions for reasoning in graphical models
Artificial Intelligence
Bounded treewidth as a key to tractability of knowledge representation and reasoning
Artificial Intelligence
Dynamic configuration of agent organizations
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover
Discrete Applied Mathematics
Splitting a graph into disjoint induced paths or cycles
Discrete Applied Mathematics
Treewidth computations I. Upper bounds
Information and Computation
Treewidth: structure and algorithms
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Efficient recognition of acyclic clustered constraint satisfaction problems
CSCLP'06 Proceedings of the constraint solving and contraint logic programming 11th annual ERCIM international conference on Recent advances in constraints
A note on root choice for parallel processing of tree decompositions
KES-AMSTA'08 Proceedings of the 2nd KES International conference on Agent and multi-agent systems: technologies and applications
Join-graph propagation algorithms
Journal of Artificial Intelligence Research
Complexity of K-tree structured constraint satisfaction problems
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
A practical algorithm for finding optimal triangulations
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Dynamic programming for graphs on surfaces
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
A complexity analysis of space-bounded learning algorithms for the constraint satisfaction problem
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Read-once functions and query evaluation in probabilistic databases
Proceedings of the VLDB Endowment
Journal of Automated Reasoning
Upper and lower bounds for finding connected motifs in vertex-colored graphs
Journal of Computer and System Sciences
Treewidth computations II. Lower bounds
Information and Computation
Iterative join-graph propagation
UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
Hybrid processing of beliefs and constraints
UAI'01 Proceedings of the Seventeenth conference on Uncertainty in artificial intelligence
A scheme for approximating probabilistic inference
UAI'97 Proceedings of the Thirteenth conference on Uncertainty in artificial intelligence
A sufficiently fast algorithm for finding close to optimal junction trees
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
Bucket elimination: a unifying framework for probabilistic inference
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
Topological parameters for time-space tradeoff
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
An evaluation of structural parameters for probabilistic reasoning: results on benchmark circuits
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
Treewidth: characterizations, applications, and computations
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
On switching classes, NLC-width, cliquewidth and treewidth
Theoretical Computer Science
Fixed-Parameter tractability of treewidth and pathwidth
The Multivariate Algorithmic Revolution and Beyond
Sharp tractability borderlines for finding connected motifs in vertex-colored graphs
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Dynamic programming for graphs on surfaces
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |