A survey of graph layout problems
ACM Computing Surveys (CSUR)
Tree Decompositions with Small Cost
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
-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
Efficient Analysis of Graphs with Small Minimal Separators
WG '99 Proceedings of the 25th 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
Computing Optimal Linear Layouts of Trees in Linear Time
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
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
Parallel algorithms for Hamiltonian problems on quasi-threshold graphs
Journal of Parallel and Distributed Computing
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
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)
Chordal co-gem-free and (P5,gem)-freegraphs have bounded clique-width
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Efficient parallel recognition of cographs
Discrete Applied Mathematics - Special issue: Max-algebra
Approximating the maximum clique minor and some subgraph homeomorphism problems
Theoretical Computer Science
Node-searching problem on block graphs
Discrete Applied Mathematics
Solving problems on recursively constructed graphs
ACM Computing Surveys (CSUR)
Inference and Learning in Multi-dimensional Bayesian Network Classifiers
ECSQARU '07 Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Reconfiguration of the routing in WDM networks with two classes of services
ONDM'09 Proceedings of the 13th international conference on Optical Network Design and Modeling
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)
Chordal co-gem-free and (P5,gem)-free graphs have bounded clique-width
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Efficient parallel recognition of cographs
Discrete Applied Mathematics
Treewidth computations I. Upper bounds
Information and Computation
Dynamic programming and planarity: Improved tree-decomposition based algorithms
Discrete Applied Mathematics
New lower and upper bounds for graph treewidth
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
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
A characterisation of the minimal triangulations of permutation graphs
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
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
Treewidth and minimum fill-in on permutation graphs in linear time
Theoretical Computer Science
Algorithms and theory of computation handbook
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
Algorithms and complexity results for graph-based pursuit evasion
Autonomous Robots
Treewidth: characterizations, applications, and computations
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Graph searching and search time
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of 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
Fixed-Parameter tractability of treewidth and pathwidth
The Multivariate Algorithmic Revolution and Beyond
Kernel bounds for structural parameterizations of pathwidth
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Computing directed pathwidth in O(1.89n) time
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Probabilistic inference and monadic second order logic
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
| Hi-index | 0.00 |