Learning Markov networks: maximum bounded tree-width graphs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Colored Tutte polynomials and Kaufman brackets for graphs of bounded tree width
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Deciding first-order properties of locally tree-decomposable structures
Journal of the ACM (JACM)
Theoretical Computer Science
Listing all potential maximal cliques of a graph
Theoretical Computer Science
Counting H-colorings of partial k-trees
Theoretical Computer Science
Approximation of pathwidth of outerplanar graphs
Journal of Algorithms
Mini-buckets: A general scheme for bounded inference
Journal of the ACM (JACM)
Definability and Descriptive Complexity on Databases of Bounded Tree-Width
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Subgraph Isomorphism, log-Bounded Fragmentation and Graphs of (Locally) Bounded Treewidth
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Fixed Parameter Algorithms for PLANAR DOMINATING SET and Related Problems
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Deciding First-Order Properties of Locally Tree-Decomposalbe Graphs
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
On Consistency and Width Notions for Constraint Programs with Algebraic Constraints
FLOPS '02 Proceedings of the 6th International Symposium on Functional and Logic Programming
Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
A Framework for Network Reliability Problems on Graphs of Bounded Treewidth
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Improved Tree Decomposition Based Algorithms for Domination-like Problems
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Listing All Potential Maximal Cliques of a Graph
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Counting H-Colorings of Partial k-Trees
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Approximation of Pathwidth of Outerplanar Graphs
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Descriptive and Parameterized Complexity
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
A Polynomial Time Algorithm for the Cutwidth of Bounded Degree Graphs with Small Treewidth
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Pure Nash equilibria: hard and easy games
Proceedings of the 9th conference on Theoretical aspects of rationality and knowledge
Algorithms for graphs with small octopus
Discrete Applied Mathematics
The parametrized complexity of knot polynomials
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Parameterized complexity: exponential speed-up for planar graph problems
Journal of Algorithms
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
Journal of Computer and System Sciences
On the choice of regions for generalized belief propagation
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Tree-decompositions of small pathwidth
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Space-efficient construction variants of dynamic programming
Nordic Journal of Computing
Marginal contribution nets: a compact representation scheme for coalitional games
Proceedings of the 6th ACM conference on Electronic commerce
CATS '05 Proceedings of the 2005 Australasian symposium on Theory of computing - Volume 41
Cutwidth II: algorithms for partial w-trees of bounded degree
Journal of Algorithms
Space Complexity of Estimation of Distribution Algorithms
Evolutionary Computation
DAG-width: connectivity measure for directed graphs
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Exact algorithms and applications for Tree-like Weighted Set Cover
Journal of Discrete Algorithms
Online promise problems with online width metrics
Journal of Computer and System Sciences
AND/OR search spaces for graphical models
Artificial Intelligence
Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth
Journal of Computer and System Sciences
Planar Branch Decompositions I: The Ratcatcher
INFORMS Journal on Computing
The relative clique-width of a graph
Journal of Combinatorial Theory Series B
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Digraph measures: Kelly decompositions, games, and orderings
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Predecessor existence problems for finite discrete dynamical systems
Theoretical Computer Science
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
Digraph measures: Kelly decompositions, games, and orderings
Theoretical Computer Science
Digraph Decompositions and Monotonicity in Digraph Searching
Graph-Theoretic Concepts in Computer Science
The parameterized complexity of the induced matching problem
Discrete Applied Mathematics
Complexity results for minimum sum edge coloring
Discrete Applied Mathematics
Derivation of algorithms for cutwidth and related graph layout parameters
Journal of Computer and System Sciences
Semi-nice tree-decompositions: The best of branchwidth, treewidth and pathwidth with one algorithm
Discrete Applied Mathematics
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Approximate compilation for embedded model-based reasoning
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Pure Nash equilibria: hard and easy games
Journal of Artificial Intelligence Research
An algebraic graphical model for decision with uncertainties, feasibilities, and utilities
Journal of Artificial Intelligence Research
A comparison of structural CSP decomposition methods
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Computational aspects of analyzing social network dynamics
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
ACM Transactions on Algorithms (TALG)
Tree-decompositions of small pathwidth
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Cutwidth II: Algorithms for partial w-trees of bounded degree
Journal of Algorithms
Complexity of the packing coloring problem for trees
Discrete Applied Mathematics
Dynamic programming and planarity: Improved tree-decomposition based algorithms
Discrete Applied Mathematics
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
The Necessity of Bounded Treewidth for Efficient Inference in Bayesian Networks
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Improved approximation algorithms for the minimum latency problem via prize-collecting strolls
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Cluster Tree Elimination for Distributed Constraint Optimization with Quality Guarantees
Fundamenta Informaticae - RCRA 2008 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
Upper and lower bounds for finding connected motifs in vertex-colored graphs
Journal of Computer and System Sciences
The complexity status of problems related to sparsest cuts
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systems
Theoretical Computer Science
Tight bounds and a fast FPT algorithm for directed Max-Leaf Spanning Tree
ACM Transactions on Algorithms (TALG)
Digraph decompositions and monotonicity in digraph searching
Theoretical Computer Science
Consensus models: Computational complexity aspects in modern approaches to the list coloring problem
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
Efficient approximation for triangulation of minimum treewidth
UAI'01 Proceedings of the Seventeenth conference on Uncertainty in artificial intelligence
SIAM Journal on Discrete Mathematics
Generation of graphs with bounded branchwidth
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Directed nowhere dense classes of graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Phase transition of tractability in constraint satisfaction and bayesian network inference
UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence
Treewidth in verification: local vs. global
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Greedy routing in tree-decomposed graphs
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Approximation and complexity of k–splittable flows
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Approximate model-based diagnosis using preference-based compilation
SARA'05 Proceedings of the 6th international conference on Abstraction, Reformulation and Approximation
Improved algorithms and complexity results for power domination in graphs
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
On the effective enumerability of NP problems
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Small drawings of series-parallel graphs and other subclasses of planar graphs
GD'09 Proceedings of the 17th international conference on Graph Drawing
Capacitated confluent flows: complexity and algorithms
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Two birds with one stone: the best of branchwidth and treewidth with one algorithm
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
The complexity of finding uniform sparsest cuts in various graph classes
Journal of Discrete Algorithms
The point-set embeddability problem for plane graphs
Proceedings of the twenty-eighth annual symposium on Computational geometry
The dag-width of directed graphs
Journal of Combinatorial Theory Series B
Survey: Subexponential parameterized algorithms
Computer Science Review
Tree decompositions of graphs: Saving memory in dynamic programming
Discrete Optimization
On the algorithmic effectiveness of digraph decompositions and complexity measures
Discrete Optimization
Scheduling of pipelined operator graphs
Journal of Scheduling
Algorithms for bandwidth consecutive multicolorings of graphs
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
FPT results for signed domination
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Fixed-Parameter tractability of treewidth and pathwidth
The Multivariate Algorithmic Revolution and Beyond
WABI'12 Proceedings of the 12th international conference on Algorithms in Bioinformatics
Parameterized top-K algorithms
Theoretical Computer Science
Decomposing combinatorial auctions and set packing problems
Journal of the ACM (JACM)
Parameterized complexity results for exact bayesian network structure learning
Journal of Artificial Intelligence Research
Faster algorithms for markov decision processes with low treewidth
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
TREEWIDTH and PATHWIDTH parameterized by the vertex cover number
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Polynomial-time algorithms for special cases of the maximum confluent flow problem
Discrete Applied Mathematics
Model Checking for Successor-Invariant First-Order Logic on Minor-Closed Graph Classes
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width
Fundamenta Informaticae - MFCS & CSL 2010 Satellite Workshops: Selected Papers
| Hi-index | 0.01 |