1. ASPVAL, B., PLASS, M.F., and TARJAN, R.E. (1979), “A Linear Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas”, Information Processing Letters, 8, 121–123.
2. AGARWALA, R., BAFNA, V., FARACH, M., NARAYANAN, B., PATERSON, M., and THORUP, M. (1999), “On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics)”, SIAM Journal on Computing, 17, 1073–1085.
3. ATKINS, J.E., BOMAN, E.G., and HENDRICKSON, B. (1998), “A Spectral Algorithm for Seriation and the Consecutive Ones Problem”, SIAM Journal on Computing, 28, 297–310.
4. BĂDOIU, M. (2003), “Approximation Algorithm for Embedding Metrics into a Twodimensional Space”, in Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Baltimore 2003, pp. 434–443.
5. BARTHÉLEMY, J.-P. and BRUCKER, F. (2001), “NP-hard Approximation Problems in Overlapping Clustering”, Journal of Classification, 18, 159–183.