1. N. Alon, S. Arora, R. Manokaran, D. Moshkovitz, O. Weinstein, Inapproximability of densest κ-subgraph from average case hardness, Preprint, 2011.
2. Certification of an optimal TSP tour through 85,900 cities;Applegate;Oper. Res. Lett.,2009
3. Approximation algorithms for deadline-TSP and vehicle routing with time-windows;Bansal,2004
4. Polynomial integrality gaps for strong SDP relaxations of densest k-subgraph;Bhaskara,2012
5. Approximation algorithms for orienteering and discounted-reward TSP;Blum;SIAM J. Comput.,2007