1. Lecture Notes in Computer Science;A. Aazami,2007
2. Arora, S., Babai, L., Stern, J., Sweedyk, Z.: The hardness of approximate optima in lattices, codes, and systems of linear equations. J. Comput. System Sci. 54, 317–331 (1997)
3. Bhattacharyya, A., Grigorescu, E., Jung, K., Raskhodnikova, S., Woodruff, D.P.: Transitive-Closure Spanners, ArXiv e-prints (2008)
4. Breslau, L., Diakonikolas, I., Duffield, N., Gu, Y., Hajiaghayi, M., Johnson, D., Karloff, H., Resende, M., Sen, S.: Optimal Node Placement For Path-Disjoint Network Monitoring (manuscript) (2008)
5. Chen, N.: On the approximability of influence in social networks. In: SODA, pp. 1029–1037 (2008)