Approximating the minimum degree spanning tree to within one from the optimal degree
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
On Approximating the Longest Path in a Graph (Preliminary Version)
WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Finding long paths and cycles in sparse Hamiltonian graphs
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
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
Finding a Path of Superlogarithmic Length
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Algorithms for long paths in graphs
Theoretical Computer Science
Longest Path Problems on Ptolemaic Graphs
IEICE - Transactions on Information and Systems
Algorithm for two disjoint long paths in 2-connected graphs
Theoretical Computer Science
Efficient algorithms for the longest path problem
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
| Hi-index | 0.00 |