Efficient algorithms for combinatorial problems on graphs with bounded, decomposability—a survey
BIT - Ellis Horwood series in artificial intelligence
Interval representations of planar graphs
Journal of Combinatorial Theory Series B
Linear time algorithms for NP-hard problems restricted to partial k-trees
Discrete Applied Mathematics
Grid intersection graphs and boxicity
Discrete Mathematics - Special issue on combinatorics and algorithms
A special planar satisfiability problem and a consequence of its NP-completeness
Discrete Applied Mathematics
Graph minors. XIII: the disjoint paths problem
Journal of Combinatorial Theory Series B
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
SIAM Journal on Computing
Treewidth for graphs with small chordality
Proceedings of the 4th Twente workshop on Graphs and combinatorial optimization
Parallel Algorithms with Optimal Speedup for Bounded Treewidth
SIAM Journal on Computing
Graph classes: a survey
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Tree-width and circumference of graphs
Journal of Graph Theory
Note: Boxicity and maximum degree
Journal of Combinatorial Theory Series B
Maximum independent set of rectangles
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Boxicity of graphs with bounded degree
European Journal of Combinatorics
Dimension-2 poset competition numbers and dimension-2 poset double competition numbers
Discrete Applied Mathematics
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Treewidth computations II. Lower bounds
Information and Computation
SIAM Journal on Discrete Mathematics
Integer realizations of disk and segment graphs
Journal of Combinatorial Theory Series B
Polynomial time and parameterized approximation algorithms for boxicity
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Cubicity, degeneracy, and crossing number
European Journal of Combinatorics
| Hi-index | 0.00 |
An axis-parallel b-dimensional box is a Cartesian product R"1xR"2x...xR"b where R"i (for 1=