Random Deletion in a Scale-Free Random Graph Process. - Colin Cooper; Alan M. Frieze; Juan Vera 001 (Internet Math., 2003)

On approximating the b-chromatic number. - Sylvie Corteel; Mario Valencia-Pabon; Juan-Carlos Vera 001 (Discret. Appl. Math., 2005)

On the diameter of Kneser graphs. - Mario Valencia-Pabon; Juan-Carlos Vera 001 (Discret. Math., 2005)

Independence and coloring properties of direct products of some vertex-transitive graphs. - Mario Valencia-Pabon; Juan Vera 001 (Discret. Math., 2006)

On randomly colouring locally sparse graphs. - Alan M. Frieze; Juan Vera 001 (Discret. Math. Theor. Comput. Sci., 2006)

LMI Approximations for Cones of Positive Semidefinite Forms. - Luis Fernando Zuluaga; Juan Carlos Vera 001; Javier Peña 001 (SIAM J. Optim., 2006)

Bias Reduction in Traceroute Sampling - Towards a More Accurate Map of the Internet. - Abraham D. Flaxman; Juan Vera 001 (WAW, 2007)

Adversarial Deletion in a Scale-Free Random Graph Process. - Abraham D. Flaxman; Alan M. Frieze; Juan Vera 001 (Comb. Probab. Comput., 2007)

On the Average Case Performance of Some Greedy Approximation Algorithms For the Uncapacitated Facility Location Problem. - Abraham D. Flaxman; Alan M. Frieze; Juan Carlos Vera 001 (Comb. Probab. Comput., 2007)

A Geometric Preferential Attachment Model of Networks. - Abraham D. Flaxman; Alan M. Frieze; Juan Vera 001 (Internet Math., 2007)

A Geometric Preferential Attachment Model of Networks II. - Abraham D. Flaxman; Alan M. Frieze; Juan Vera 001 (Internet Math., 2007)

The Influence of Search Engines on Preferential Attachment. - Alan M. Frieze; Juan Vera 001; Soumen Chakrabarti (Internet Math., 2007)

A primal-dual symmetric relaxation for homogeneous conic systems. - Juan Carlos Vera 001; Juan Carlos Rivera; Javier Peña 001; Yao Hui (J. Complex., 2007)

Computing the Stability Number of a Graph Via Linear and Semidefinite Programming. - Javier Peña 001; Juan Carlos Vera 001; Luis Fernando Zuluaga (SIAM J. Optim., 2007)

Improved Bounds for the Symmetric Rendezvous Value on the Line. - Qiaoming Han; Donglei Du; Juan Carlos Vera 001; Luis Fernando Zuluaga (Oper. Res., 2008)

Exploiting equalities in polynomial programming. - Javier Peña 001; Juan Carlos Vera 001; Luis Fernando Zuluaga (Oper. Res. Lett., 2008)

Phase Transition for the Mixing Time of the Glauber Dynamics for Coloring Regular Trees. - Prasad Tetali; Juan Carlos Vera 001; Eric Vigoda; Linji Yang (SODA, 2010)

Computing general static-arbitrage bounds for European basket options via Dantzig-Wolfe decomposition. - Javier Peña 001; Xavier Saynac; Juan Carlos Vera 001; Luis Fernando Zuluaga (Algorithmic Oper. Res., 2010)

Logconcave Random Graphs. - Alan M. Frieze; Santosh S. Vempala; Juan Vera 001 (Electron. J. Comb., 2010)

An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming. - Bissan Ghaddar; Juan C. Vera 001; Miguel F. Anjos (IPCO, 2011)

Majorization and Extremal PH Distributions. - Qi-Ming He; Hanqin Zhang; Juan C. Vera 001 (MAM, 2011)

Reconstruction for Colorings on Trees. - Nayantara Bhatnagar; Juan Carlos Vera 001; Eric Vigoda; Dror Weitz (SIAM J. Discret. Math., 2011)

Second-Order Cone Relaxations for Binary Quadratic Polynomial Programs. - Bissan Ghaddar; Juan C. Vera 001; Miguel F. Anjos (SIAM J. Optim., 2011)

Computing arbitrage upper bounds on basket options in the presence of bid-ask spreads. - Javier Peña 001; Juan Carlos Vera 001; Luis F. Zuluaga (Eur. J. Oper. Res., 2012)

Majorization and Extremal PH-Distributions (abstract only). - Qi-Ming He; Hanqin Zhang; Juan C. Vera 001 (SIGMETRICS Perform. Evaluation Rev., 2012)

Phase Transition for Glauber Dynamics for Independent Sets on Regular Trees. - Ricardo Restrepo; Daniel Stefankovic; Juan Carlos Vera 001; Eric Vigoda; Linji Yang (SIAM J. Discret. Math., 2014)

Exploiting symmetry in copositive programs via semidefinite hierarchies. - Cristian Dobre; Juan Vera 001 (Math. Program., 2015)

Completely positive reformulations for polynomial optimization. - Javier Peña 001; Juan Carlos Vera 001; Luis Fernando Zuluaga (Math. Program., 2015)

Randomly coloring planar graphs with fewer colors than the maximum degree. - Thomas P. Hayes; Juan Carlos Vera 001; Eric Vigoda (Random Struct. Algorithms, 2015)

Improved Bounds on the Phase Transition for the Hard-Core Model in 2 Dimensions. - Juan Carlos Vera 001; Eric Vigoda; Linji Yang (SIAM J. Discret. Math., 2015)

A dynamic inequality generation scheme for polynomial programming. - Bissan Ghaddar; Juan C. Vera 001; Miguel F. Anjos (Math. Program., 2016)

LAGOS 2017 - IX Latin and American Algorithms, Graphs, and Optimization Symposium. - Frédérique Bassino; Flavia Bonomo; Lionel Pournin; Mario Valencia-Pabon; Juan C. Vera 001 (Electron. Notes Discret. Math., 2017)

Approximating the cone of copositive kernels to estimate the stability number of infinite graphs. - Olga Kuryatnikova; Juan Carlos Vera Lizcano (Electron. Notes Discret. Math., 2017)

On the convergence rate of grid search for polynomial optimization over the simplex. - Etienne de Klerk; Monique Laurent; Zhao Sun; Juan C. Vera 001 (Optim. Lett., 2017)

A heuristic for real-time crew rescheduling during small disruptions. - Thijs Verhaegh; Dennis Huisman; Pieter-Jan Fioole; Juan C. Vera 001 (Public Transp., 2017)

Computing near-optimal Value-at-Risk portfolios using integer programming techniques. - Onur Babat; Juan C. Vera 001; Luis F. Zuluaga (Eur. J. Oper. Res., 2018)

Deciding Robust Feasibility and Infeasibility Using a Set Containment Approach: An Application to Stationary Passive Gas Network Operations. - Denis Aßmann; Frauke Liers; Michael Stingl; Juan C. Vera 001 (SIAM J. Optim., 2018)

A note on homomorphisms of Kneser hypergraphs. - Flavia Bonomo-Braberman; Mitre Costa Dourado; Mario Valencia-Pabon; Juan C. Vera 001 (Appl. Math. Comput., 2020)

Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques. - Wei Xia; Juan-Carlos Vera 001; Luis F. Zuluaga (INFORMS J. Comput., 2020)

New Bounds for Truthful Scheduling on Two Unrelated Selfish Machines. - Olga Kuryatnikova; Juan C. Vera 001 (Theory Comput. Syst., 2020)

On the $P_3$-Hull Number of Kneser Graphs. - Luciano N. Grippo; Adrián Pastine; Pablo Daniel Torres; Mario Valencia-Pabon; Juan C. Vera 001 (Electron. J. Comb., 2021)

New characterizations of Hoffman constants for systems of linear constraints. - Javier Peña 001; Juan C. Vera 001; Luis F. Zuluaga (Math. Program., 2021)

The Maximum k-Colorable Subgraph Problem and Related Problems. - Olga Kuryatnikova; Renata Sotirov; Juan C. Vera 001 (INFORMS J. Comput., 2022)

Contingent Capital with Stock Price Triggers in Interbank Networks. - Anne G. Balter; Nikolaus Schweizer; Juan Carlos Vera 001 (Math. Oper. Res., 2023)

Sparsifying the least-squares approach to PCA: comparison of lasso and cardinality constraint. - Rosember Guerra-Urzola; Niek C. de Schipper; Anya Tonne; Klaas Sijtsma; Juan C. Vera 001; Katrijn Van Deun (Adv. Data Anal. Classif., 2023)

Reducing Nonnegativity over General Semialgebraic Sets to Nonnegativity over Simple Sets. - Olga Kuryatnikova; Juan C. Vera 001; Luis F. Zuluaga (SIAM J. Optim., 2024)