The complexity of the characterization of networks supporting shortest-path interval routing
Theoretical Computer Science
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
Journal of Computer and System Sciences
Treewidth: structure and algorithms
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Hitting and harvesting pumpkins
ESA'11 Proceedings of the 19th European conference on Algorithms
| Hi-index | 0.01 |