Finding long paths and cycles in sparse Hamiltonian graphs
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
An approximation algorithm for finding a long path in Hamiltonian graphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient approximation algorithms for the subset-sums equality problem
Journal of Computer and System Sciences
Spanning Trees with Bounded Number of Branch Vertices
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
An approximation algorithm for finding long paths in Hamiltonian graphs
Journal of Algorithms - Special issue: SODA 2000
Algorithms for long paths in graphs
Theoretical Computer Science
There are spanning spiders in dense graphs (and we know how to find them)
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Hi-index | 0.00 |