Allocating Modules to Processors in a Distributed System
IEEE Transactions on Software Engineering
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Finding approximate separators and computing tree width quickly
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
An algebraic theory of graph reduction
Journal of the ACM (JACM)
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
Safe Reduction Rules for Weighted Treewidth
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
The complexity of finding small triangulations of convex 3-polytopes
Journal of Algorithms - Special issue: SODA 2000
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
Journal of Computer and System Sciences
A semidefinite programming approach to tensegrity theory and realizability of graphs
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth
Journal of Computer and System Sciences
Computational properties of argument systems satisfying graph-theoretic constraints
Artificial Intelligence
Tree decomposition and discrete optimization problems: A survey
Cybernetics and Systems Analysis
Solving problems on recursively constructed graphs
ACM Computing Surveys (CSUR)
Treewidth: structure and algorithms
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
New lower and upper bounds for graph treewidth
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
Efficient frequent connected subgraph mining in graphs of bounded tree-width
Theoretical Computer Science
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
Treewidth computations II. Lower bounds
Information and Computation
Exploiting bounded signal flow for graph orientation based on cause-effect pairs
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
An experimental evaluation of treewidth at most four reductions
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Pre-processing for triangulation of probabilistic networks
UAI'01 Proceedings of the Seventeenth 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
Treewidth: characterizations, applications, and computations
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Proper and planar drawings of graphs on three layers
GD'05 Proceedings of the 13th international conference on Graph Drawing
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Fixed-Parameter tractability of treewidth and pathwidth
The Multivariate Algorithmic Revolution and Beyond
Characterizing graphs of small carving-width
Discrete Applied Mathematics
| Hi-index | 0.00 |