Approximating k-spanner problems for k 2
Theoretical Computer Science
Computing almost shortest paths
ACM Transactions on Algorithms (TALG)
On graph problems in a semi-streaming model
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Plane spanners of maximum degree six
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Approximate shortest paths guided by a small index
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
| Hi-index | 0.00 |