Publications & Preprints

Search
Author Title Type [ Year(Asc)]
1991
Miller, G. L. , Teng, S. - H. , & Vavasis, S. A. . (1991). A unified geometric approach to graph separators. In Proceedings of the Symposium on Foundations of Computer Science (pp. 538–547).
Vavasis, S. A. . (1991). Automatic domain partitioning in three dimensions, 12, 950–970.
Miller, G. L. , & Vavasis, S. A. . (1991). Density graphs and separators. In Proc. SIAM-ACM Symposium on Discrete Algorithms.
Moré, J. J. , & Vavasis, S. A. . (1991). On the solution of concave knapsack problems. matpro, 49, 397–411.
Vavasis, S. A. . (1991). Nonlinear Optimization: Complexity Issues. Oxford University Press.
Pardalos, P. M. , & Vavasis, S. A. . (1991). Quadratic programming with one negative eigenvalue is NP-hard. Journal of Global Optimization, 1, 15–22.
1990
Vavasis, S. A. . (1990). A note on wavelet bases for two-dimensional surfaces. Department of Computer Science, Cornell University.
Vavasis, S. A. , & Zippel, R. . (1990). Proving polynomial-time for sphere-constrained quadratic programming. Department of Computer Science, Cornell University.
Vavasis, S. A. . (1990). Quadratic programming is in NP. Information Processing Letters, 36, 73–77.
1989
Hirsch, M. D. , Papadimitriou, C. H. , & Vavasis, S. A. . (1989). Exponential lower bounds for finding Brouwer fixed points. Journal of Complexity, 5, 379–416.
Vavasis, S. A. . (1989). Gaussian elimination with pivoting is P-complete. SIAM Journal on Discrete Mathematics, 2, 412–423.
1987
Hirsch, M. D. , & Vavasis, S. A. . (1987). Exponential lower bounds for finding Brouwer fixed points. In Proceedings 28th Symposium on Foundations of Computer Science (p. 401–-410). IEEE Computer Society Press.
1982
Lieberherr, K. J. , & Vavasis, S. A. . (1982). Analysis of polynomial approximation algorithms for constraint expressions. In Theoretical Computer Science: 6th GI conference, Dortmund (Vol. 145). Springer Verlag.

Pages