Allocating Modules to Processors in a Distributed System
IEEE Transactions on Software Engineering
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Triangulating three-colored graphs
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
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)
On Polynomial-Time Testable Combinational Circuits
IEEE Transactions on Computers
On the minimality and global consistency of row-convex constraint networks
Journal of the ACM (JACM)
Constructing evolutionary trees in the presence of polymorphic characters
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
An algorithm for the recovery of both target joint beliefs and full belief from Bayesian networks
ACM-SE 36 Proceedings of the 36th annual Southeast regional conference
Triangulating vertex colored graphs
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Make it practical: a generic linear-time algorithm for solving maximum-weightsum problems
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Decomposable negation normal form
Journal of the ACM (JACM)
Listing all potential maximal cliques of a graph
Theoretical Computer Science
Counting H-colorings of partial k-trees
Theoretical Computer Science
Exploiting structure in quantified formulas
Journal of Algorithms
Embedding graphs with bounded treewidth into their optimal hypercubes
Journal of Algorithms
Computational Properties of Two Exact Algorithms for Bayesian Networks
Applied Intelligence
Resolution versus Search: Two Strategies for SAT
Journal of Automated Reasoning
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)
Optimizing exact genetic linkage computations
RECOMB '03 Proceedings of the seventh annual international conference on Research in computational molecular biology
Definability and Descriptive Complexity on Databases of Bounded Tree-Width
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
On the Complements of Partial k-Trees
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
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 for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Some Prospects for Efficient Fixed Parameter Algorithms
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
NP-Completeness of Some Tree-Clustering Problems
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Optimal Solutions for Frequency Assignment Problems via Tree Decomposition
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Efficient Analysis of Graphs with Small Minimal Separators
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
An Improved Algorithm for Finding Tree Decompositions of Small Width
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Approximating the Treewidth of AT-Free Graphs
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
On the Relationship between Clique-Width and Treewidth
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Safe Reduction Rules for Weighted Treewidth
WG '02 Revised Papers from the 28th 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 Linear-Time Algorithm for Constructing an Optimal Node-Search Strategy of a Tree
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
Hybrid backtracking bounded by tree-decomposition of constraint networks
Artificial Intelligence
Parameterized complexity of vertex colouring
Discrete Applied Mathematics
Interval degree and bandwidth of a graph
Discrete Applied Mathematics
Approximating the treewidth of AT-free graphs
Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
Splitting a graph into disjoint induced paths or cycles
Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
On Synthesis of Easily Testable (k, K) Circuits
IEEE Transactions on Computers
The parametrized complexity of knot polynomials
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
The complexity of finding small triangulations of convex 3-polytopes
Journal of Algorithms - Special issue: SODA 2000
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
PAC-learning bounded tree-width graphical models
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Information Processing Letters
Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable
Journal of Computer and System Sciences
Tree decompositions with small cost
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Tree-decompositions of small pathwidth
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Computing the branchwidth of interval graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
CATS '05 Proceedings of the 2005 Australasian symposium on Theory of computing - Volume 41
A Tree-Decomposition Approach to Protein Structure Prediction
CSB '05 Proceedings of the 2005 IEEE Computational Systems Bioinformatics Conference
Intelligent light control using sensor networks
Proceedings of the 3rd international conference on Embedded networked sensor systems
Clique-width minimization is NP-hard
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Computing pure nash equilibria in graphical games via markov random fields
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
An exact method for graph coloring
Computers and Operations Research
Degree-constrained decompositions of graphs: bounded treewidth and planarity
Theoretical Computer Science
Trees, grids, and MSO decidability: from graphs to matroids
Theoretical Computer Science - Parameterized and exact computation
Header-size lower bounds for end-to-end communication in memoryless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking - Web dynamics
Resource allocation among agents with preferences induced by factored MDPs
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Fast and accurate algorithms for protein side-chain packing
Journal of the ACM (JACM)
Symbolic Techniques in Satisfiability Solving
Journal of Automated Reasoning
ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
Online promise problems with online width metrics
Journal of Computer and System Sciences
Achievable sets, brambles, and sparse treewidth obstructions
Discrete Applied Mathematics
Traversing the machining graph
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
On exact algorithms for treewidth
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Computational properties of argument systems satisfying graph-theoretic constraints
Artificial Intelligence
Visualizing SAT Instances and Runs of the DPLL Algorithm
Journal of Automated Reasoning
Tree decomposition and discrete optimization problems: A survey
Cybernetics and Systems Analysis
Node-searching problem on block graphs
Discrete Applied Mathematics
Belief updating in Bayesian networks by using a criterion of minimum time
Pattern Recognition Letters
Counting truth assignments of formulas of bounded tree-width or clique-width
Discrete Applied Mathematics
Optimal branch-decomposition of planar graphs in O(n3) Time
ACM Transactions on Algorithms (TALG)
Distributed chasing of network intruders
Theoretical Computer Science
An annotated bibliography on guaranteed graph searching
Theoretical Computer Science
Monotonicity of non-deterministic graph searching
Theoretical Computer Science
A Recursive Method for Structural Learning of Directed Acyclic Graphs
The Journal of Machine Learning Research
Probabilistic processing of interval-valued sensor data
Proceedings of the 5th workshop on Data management for sensor networks
Using the Simulated Annealing Algorithm for Multiagent Decision Making
RoboCup 2006: Robot Soccer World Cup X
Solving problems on recursively constructed graphs
ACM Computing Surveys (CSUR)
Treewidth: A Useful Marker of Empirical Hardness in Quantified Boolean Logic Encodings
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Searching for a Visible, Lazy Fugitive
Graph-Theoretic Concepts in Computer Science
A Logical Approach to Constraint Satisfaction
Complexity of Constraints
Triangulation of Bayesian networks with recursive estimation of distribution algorithms
International Journal of Approximate Reasoning
Factored value iteration converges
Acta Cybernetica
Querying Protein-Protein Interaction Networks
ISBRA '09 Proceedings of the 5th International Symposium on Bioinformatics Research and Applications
An exact almost optimal algorithm for target set selection in social networks
Proceedings of the 10th ACM conference on Electronic commerce
Power Indices in Spanning Connectivity Games
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Combinatorial auctions with structured item graphs
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Factored planning: how, when, and when not
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Computing Bond Types in Molecule Graphs
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Best-first search for treewidth
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Macroscopic models of clique tree growth for Bayesian networks
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Efficient solution algorithms for factored MDPs
Journal of Artificial Intelligence Research
Exploiting causal independence in Bayesian network inference
Journal of Artificial Intelligence Research
On a generalization of triangulated graphs for domains decomposition of CSPs
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Duplicate avoidance in depth-first search with applications to treewidth
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Combining breadth-first and depth-first strategies in searching for treewidth
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Binarization of synchronous context-free grammars
Computational Linguistics
On minimal tree realizations of linear codes
IEEE Transactions on Information Theory
Hard QBF Encodings Made Easy: Dream or Reality?
AI*IA '09: Proceedings of the XIth International Conference of the Italian Association for Artificial Intelligence Reggio Emilia on Emergent Perspectives in Artificial Intelligence
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Tree decompositions with small cost
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Tree-decompositions of small pathwidth
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Computing the branchwidth of interval graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Approximating the treewidth of AT-free graphs
Discrete Applied Mathematics
Splitting a graph into disjoint induced paths or cycles
Discrete Applied Mathematics
Constraint complexity of realizations of linear codes on arbitrary graphs
IEEE Transactions on Information Theory
Minimum fill-in and treewidth of split+ke and split+kv graphs
Discrete Applied Mathematics
Treewidth: structure and algorithms
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Generation of tree decompositions by iterated local search
EvoCOP'07 Proceedings of the 7th European conference on Evolutionary computation in combinatorial optimization
A distributed system for genetic linkage analysis
GCCB'06 Proceedings of the 2006 international conference on Distributed, high-performance and grid computing in computational biology
On the treewidth and pathwidth of biconvex bipartite graphs
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Shorter implicit representation for planar graphs and bounded treewidth graphs
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Minimum fill-in and treewidth of split+ke and split+kv graphs
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Weighted treewidth algorithmic techniques and results
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
The "Art of trellis decoding" is NP-hard
AAECC'07 Proceedings of the 17th international conference on Applied algebra, algebraic algorithms and error-correcting codes
Computing branch decomposition of large planar graphs
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Exploiting problem structure for solution counting
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
TEDI: efficient shortest path query answering on graphs
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Scalable formula decomposition for propositional satisfiability
Proceedings of the Third C* Conference on Computer Science and Software Engineering
Understanding the scalability of Bayesian network inference using clique tree growth curves
Artificial Intelligence
Treewidth and minimum fill-in on permutation graphs in linear time
Theoretical Computer Science
Exact and approximate bandwidth
Theoretical Computer Science
Efficient Heuristics for Discriminative Structure Learning of Bayesian Network Classifiers
The Journal of Machine Learning Research
Reasoning in Argumentation Frameworks of Bounded Clique-Width
Proceedings of the 2010 conference on Computational Models of Argument: Proceedings of COMMA 2010
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
A space-time tradeoff for permutation problems
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Monadic second order logic on graphs with local cardinality constraints
ACM Transactions on Computational Logic (TOCL)
Decomposition width of matroids
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Efficient graph reachability query answering using tree decomposition
RP'10 Proceedings of the 4th international conference on Reachability problems
An Empirical Study of QBF Encodings: from Treewidth Estimation to Useful Preprocessing
Fundamenta Informaticae - RCRA 2008 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
Querying Graphs in Protein-Protein Interactions Networks Using Feedback Vertex Set
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Computing bond orders in molecule graphs
Theoretical Computer Science
Quantum Computation and the Evaluation of Tensor Networks
SIAM Journal on Computing
Upper and lower bounds for finding connected motifs in vertex-colored graphs
Journal of Computer and System Sciences
Grammar factorization by tree decomposition
Computational Linguistics
Theoretical Computer Science
An experimental evaluation of treewidth at most four reductions
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Graphs of bounded treewidth can be canonized in AC1
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
An extended tree-width notion for directed graphs related to the computation of permanents
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Generic solution construction in valuation-based systems
Canadian AI'11 Proceedings of the 24th Canadian conference on Advances in artificial intelligence
Join tree propagation utilizing both arc reversal and variable elimination
International Journal of Approximate Reasoning
Preprocessing for treewidth: a combinatorial analysis through kernelization
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
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
Pre-processing for triangulation of probabilistic networks
UAI'01 Proceedings of the Seventeenth conference on Uncertainty in artificial intelligence
A hybrid algorithm to compute marginal and joint beliefs in Bayesian networks and its complexity
UAI'98 Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence
Empirical evaluation of approximation algorithms for probabilistic decoding
UAI'98 Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence
Clustering without (thinking about) triangulation
UAI'95 Proceedings of the Eleventh 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
Propagation of 2-monotone lower probabilities on an undirected graph
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
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
UAI'94 Proceedings of the Tenth 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
Computing graph polynomials on graphs of bounded clique-width
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Approximate tree decompositions of planar graphs in linear time
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Distributed chasing of network intruders
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
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
A fusion algorithm for solving Bayesian decision problems
UAI'91 Proceedings of the Seventh conference on Uncertainty in Artificial Intelligence
Search vs. symbolic techniques in satisfiability solving
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Optimal branch-decomposition of planar graphs in O(n3) time
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Treewidth lower bounds with brambles
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
Graph searching and search time
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Sharp separation and applications to exact and parameterized algorithms
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
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
The structure of tractable constraint satisfaction problems
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Nondeterministic graph searching: from pathwidth to treewidth
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Minimizing nLC-width is nP-complete
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Computing treewidth and minimum fill-in for permutation graphs in linear time
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
An O(n2)-time algorithm for the minimal interval completion problem
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Rapid protein side-chain packing via tree decomposition
RECOMB'05 Proceedings of the 9th Annual international conference on Research in Computational Molecular Biology
Degree-Based treewidth lower bounds
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
New upper bound heuristics for treewidth
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Decomposition width of matroids
Discrete Applied Mathematics
Functional treewidth: bounding complexity in the presence of functional dependencies
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Faster computation of the Robinson-Foulds distance between phylogenetic networks
Information Sciences: an International Journal
Pathwidth and searching in parameterized threshold graphs
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Improved steiner tree algorithms for bounded treewidth
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Improved exponential-time algorithms for treewidth and minimum fill-in
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
A polynomial time algorithm for bounded directed pathwidth
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Charge group partitioning in biomolecular simulation
RECOMB'12 Proceedings of the 16th Annual international conference on Research in Computational Molecular Biology
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
On the tractability of query compilation and bounded treewidth
Proceedings of the 15th International Conference on Database Theory
Exact algorithms for a discrete metric labeling problem
Discrete Optimization
Treewidth governs the complexity of target set selection
Discrete Optimization
Fixed-Parameter tractability of treewidth and pathwidth
The Multivariate Algorithmic Revolution and Beyond
k-chordal graphs: from cops and robber to compact routing via treewidth
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Improved Steiner tree algorithms for bounded treewidth
Journal of Discrete Algorithms
Kernel bounds for structural parameterizations of pathwidth
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Cluster vertex deletion: a parameterization between vertex cover and clique-width
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Minimal separators in extended P4-laden graphs
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)
Drawing planar 3-trees with given face areas
Computational Geometry: Theory and Applications
WABI'12 Proceedings of the 12th international conference on Algorithms in Bioinformatics
The exact distance to destination in undirected world
The VLDB Journal — The International Journal on Very Large Data Bases
Evaluating tree-decomposition based algorithms for answer set programming
LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
On the stable degree of graphs
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
On the complexity of planning for agent teams and its implications for single agent planning
Artificial Intelligence
Sparsest cut on bounded treewidth graphs: algorithms and hardness results
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
An O( n2)-time algorithm for the minimal interval completion problem
Theoretical Computer Science
Proceedings of the 2nd ACM SIGPLAN workshop on Functional high-performance computing
Subchannel allocation for the OFDMA-based femtocell system
Computer Networks: The International Journal of Computer and Telecommunications Networking
The complexity of optimal monotonic planning: the bad, the good, and the causal graph
Journal of Artificial Intelligence Research
Digraphs of bounded elimination width
Discrete Applied Mathematics
| Hi-index | 0.14 |