Håkan Jonsson A Robust and Fast Algorithm for Computing Exact and Approximate Shortest Visiting Routes. [Citation Graph (0, 0)][DBLP] ICCSA (3), 2004, pp:168-177 [Conf]
Håkan Jonsson The Traveling Salesman Problem for lines in the plane. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2002, v:82, n:3, pp:137-142 [Journal]
Håkan Jonsson An approximative solution to the Zookeeper's Problem. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2003, v:87, n:6, pp:301-307 [Journal]
Search in 0.001secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP