Tree-edges deletion problems with bounded diameter obstruction sets
Discrete Applied Mathematics
Solving problems on recursively constructed graphs
ACM Computing Surveys (CSUR)
The space complexity of k-tree isomorphism
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Hi-index | 0.00 |