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
Embeddings of k-Connected Graphs of Pathwidth k
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Path-Width and Three-Dimensional Straight-Line Grid Drawings of Graphs
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Embeddings of k-connected graphs of pathwidth k
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs
ACM Transactions on Algorithms (TALG)
Confronting hardness using a hybrid approach
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Approximating the maximum clique minor and some subgraph homeomorphism problems
Theoretical Computer Science
Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth
Journal of Computer and System Sciences
Embeddings of k-connected graphs of pathwidth k
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Fixed-parameter algorithms for the (k, r)-center in planar graphs and map graphs
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
| Hi-index | 0.00 |