On the approximability of the traveling salesman problem (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
The labeled perfect matching in bipartite graphs
Information Processing Letters
Multichromosomal Genome Median and Halving Problems
WABI '08 Proceedings of the 8th international workshop on Algorithms in Bioinformatics
An explicit lower bound for TSP with distances one and two
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Inapproximability results for the lateral gene transfer problem
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
| Hi-index | 0.00 |