Constant factor approximation of vertex-cuts in planar graphs
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
Subexponential parameterized algorithms on graphs of bounded-genus and H-minor-free graphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Logic-based subsumption architecture
Artificial Intelligence - Special issue on logical formalizations and commonsense reasoning
Node deletion sequences in influence diagrams using genetic algorithms
Statistics and Computing
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
Journal of Computer and System Sciences
A complete anytime algorithm for treewidth
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Improved approximation algorithms for minimum-weight vertex separators
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Bidimensionality: new connections between FPT algorithms and PTASs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Partition-based logical reasoning for first-order and propositional theories
Artificial Intelligence - Special volume on reformulation
Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs
Journal of the ACM (JACM)
Guiding CNF-SAT search via efficient constraint partitioning
Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design
Header-size lower bounds for end-to-end communication in memoryless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking - Web dynamics
Fast and accurate algorithms for protein side-chain packing
Journal of the ACM (JACM)
Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth
Information Processing Letters
Quickly deciding minor-closed parameters in general graphs
European Journal of Combinatorics
On the maximum cardinality search lower bound for treewidth
Discrete Applied Mathematics
Approximation algorithms via contraction decomposition
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Tree decomposition and discrete optimization problems: A survey
Cybernetics and Systems Analysis
Counting truth assignments of formulas of bounded tree-width or clique-width
Discrete Applied Mathematics
Semiring induced valuation algebras: Exact and approximate local computation algorithms
Artificial Intelligence
Solving problems on recursively constructed graphs
ACM Computing Surveys (CSUR)
An exact almost optimal algorithm for target set selection in social networks
Proceedings of the 10th ACM conference on Electronic commerce
Compact propositional encoding of first-order theories
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Stochastic filtering in a probabilistic action model
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Practical partition-based theorem proving for large knowledge bases
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Compact propositional encodings of first-order theories
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Partition-based logical reasoning for first-order and propositional theories
Artificial Intelligence - Special volume on reformulation
Combining planning and motion planning
ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth
Information Processing Letters
Treewidth computations I. Upper bounds
Information and Computation
Decomposition, approximation, and coloring of odd-minor-free graphs
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Dynamic programming for graphs on surfaces
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Imbalance is fixed parameter tractable
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Autonomous Agents and Multi-Agent Systems
Grammar factorization by tree decomposition
Computational Linguistics
Contraction decomposition in h-minor-free graphs and algorithmic applications
Proceedings of the forty-third annual ACM symposium on Theory of computing
Kernel bounds for disjoint cycles and disjoint paths
Theoretical Computer Science
Parity games on graphs with medium tree-width
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Treewidth: characterizations, applications, and computations
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
A branch and bound algorithm for exact, upper, and lower bounds on treewidth
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Hi-index | 0.00 |