-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
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
A spectral lower bound for the treewidth of a graph and its consequences
Information Processing Letters
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
Journal of Computer and System Sciences
Journal of Combinatorial Theory Series B
Maximum independent sets in graphs of low degree
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Boundary classes of planar graphs
Combinatorics, Probability and Computing
Note: An improved algorithm for the longest induced path problem on k-chordal graphs
Discrete Applied Mathematics
Connected graph searching in chordal graphs
Discrete Applied Mathematics
Recent developments on graphs of bounded clique-width
Discrete Applied Mathematics
Exponential time algorithms for the minimum dominating set problem on some graph classes
ACM Transactions on Algorithms (TALG)
Binarization of synchronous context-free grammars
Computational Linguistics
Tree-width and optimization in bounded degree graphs
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Greedy routing in tree-decomposed graphs
ESA'05 Proceedings of the 13th annual European conference on Algorithms
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
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
| Hi-index | 0.00 |