Publications & Preprints

Search
Author Title [ Type(Asc)] Year
Journal Article
Miller, G. L. , Teng, S. - H. , Thurston, W. , & Vavasis, S. A. . (1997). Separators for sphere-packings and nearest neighbor graphs. J. ACM, 44, 1-29.
Vavasis, S. A. . (1996). Stable finite elements for problems with wild coefficients. SIAM J. Numer. Anal., 33, 890–916.
Vavasis, S. A. , & Ye, Y. . (1996). Identifying an Optimal Basis in Linear Programming. Annals of Operations Research, 62, 565–572.
Vavasis, S. A. , & Ye, Y. . (1996). A primal-dual interior point method whose running time depends only on the constraint matrix. Mathematical Programming, 74, 79–120.
Vavasis, S. A. , & Ye, Y. . (1995). Condition Numbers for Polyhedra with Real Number Data. Operations Research Letters, 17, 209-214.
Vavasis, S. A. . (1994). Stable numerical algorithms for equilibrium systems. SIAM J. Matrix Anal. Appl, 15, 1108–1131.
Stern, J. M. , & Vavasis, S. A. . (1993). Nested dissection for sparse nullspace bases. simax, 14, 766–775.
Stern, J. M. , & Vavasis, S. A. . (1993). Active set methods for problems in column block angular form. Matemática Aplicada e Computacional, 12, 199–226.
Vavasis, S. A. . (1993). Black-box complexity of local minimization. SIAM Journal on Optimization, 3, 60–80.
Vavasis, S. A. . (1992). Local minima for indefinite quadratic knapsack problems. matpro, 54, 127–153.
Vavasis, S. A. . (1992). Preconditioners for boundary integral equations, 13, 905–925.
Vavasis, S. A. . (1992). Approximation algorithms for indefinite quadratic programming, 57, 279–311.
Moré, J. J. , & Vavasis, S. A. . (1991). On the solution of concave knapsack problems. matpro, 49, 397–411.
Vavasis, S. A. . (1991). Automatic domain partitioning in three dimensions, 12, 950–970.
Pardalos, P. M. , & Vavasis, S. A. . (1991). Quadratic programming with one negative eigenvalue is NP-hard. Journal of Global Optimization, 1, 15–22.
Vavasis, S. A. . (1990). Quadratic programming is in NP. Information Processing Letters, 36, 73–77.
Vavasis, S. A. . (1989). Gaussian elimination with pivoting is P-complete. SIAM Journal on Discrete Mathematics, 2, 412–423.
Hirsch, M. D. , Papadimitriou, C. H. , & Vavasis, S. A. . (1989). Exponential lower bounds for finding Brouwer fixed points. Journal of Complexity, 5, 379–416.
Conference Paper
Majmudar, J. , & Vavasis, S. . (2020). Provable overlapping community detection in weighted graphs. In Neural Information Processing Systems (NeurIPS) (Vol. 2020). Retrieved from https://proceedings.neurips.cc/paper/2020
Sastry, S. , Shontz, S. , & Vavasis, S. . (2012). A log-barrier method for mesh quality improvement. In Proceedings of 20th International Meshing Roundtable (pp. 329-346). Springer.

Pages