Juan C. Vera

Orcid: 0000-0003-1394-3422

Affiliations:
  • Tilburg University, Department of Econometrics and Operations Research, The Netherlands
  • University of Waterloo, Department of Management Sciences, Canada (2007 - 2010)
  • Georgia Institute of Technology, College of Computing, Atlanta, GA, USA (2006 - 2007)
  • Carnegie Mellon University, Department of Mathematical Sciences, Pittsburgh, PA, USA (PhD 2006)


According to our database1, Juan C. Vera authored at least 46 papers between 2003 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Reducing Nonnegativity over General Semialgebraic Sets to Nonnegativity over Simple Sets.
SIAM J. Optim., 2024

2023
Sparsifying the least-squares approach to PCA: comparison of lasso and cardinality constraint.
Adv. Data Anal. Classif., March, 2023

Contingent Capital with Stock Price Triggers in Interbank Networks.
Math. Oper. Res., February, 2023

2022
The Maximum <i>k</i>-Colorable Subgraph Problem and Related Problems.
INFORMS J. Comput., 2022

2021
New characterizations of Hoffman constants for systems of linear constraints.
Math. Program., 2021

On the $P_3$-Hull Number of Kneser Graphs.
Electron. J. Comb., 2021

2020
New Bounds for Truthful Scheduling on Two Unrelated Selfish Machines.
Theory Comput. Syst., 2020

Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques.
INFORMS J. Comput., 2020

A note on homomorphisms of Kneser hypergraphs.
Appl. Math. Comput., 2020

2018
Deciding Robust Feasibility and Infeasibility Using a Set Containment Approach: An Application to Stationary Passive Gas Network Operations.
SIAM J. Optim., 2018

Computing near-optimal Value-at-Risk portfolios using integer programming techniques.
Eur. J. Oper. Res., 2018

2017
A heuristic for real-time crew rescheduling during small disruptions.
Public Transp., 2017

On the convergence rate of grid search for polynomial optimization over the simplex.
Optim. Lett., 2017

Approximating the cone of copositive kernels to estimate the stability number of infinite graphs.
Electron. Notes Discret. Math., 2017

LAGOS 2017 - IX Latin and American Algorithms, Graphs, and Optimization Symposium.
Electron. Notes Discret. Math., 2017

2016
A dynamic inequality generation scheme for polynomial programming.
Math. Program., 2016

2015
Improved Bounds on the Phase Transition for the Hard-Core Model in 2 Dimensions.
SIAM J. Discret. Math., 2015

Randomly coloring planar graphs with fewer colors than the maximum degree.
Random Struct. Algorithms, 2015

Completely positive reformulations for polynomial optimization.
Math. Program., 2015

Exploiting symmetry in copositive programs via semidefinite hierarchies.
Math. Program., 2015

2014
Phase Transition for Glauber Dynamics for Independent Sets on Regular Trees.
SIAM J. Discret. Math., 2014

2012
Majorization and Extremal <i>PH</i>-Distributions (abstract only).
SIGMETRICS Perform. Evaluation Rev., 2012

Computing arbitrage upper bounds on basket options in the presence of bid-ask spreads.
Eur. J. Oper. Res., 2012

2011
Second-Order Cone Relaxations for Binary Quadratic Polynomial Programs.
SIAM J. Optim., 2011

Reconstruction for Colorings on Trees.
SIAM J. Discret. Math., 2011

Majorization and Extremal PH Distributions.
Proceedings of the Matrix-Analytic Methods in Stochastic Models, 2011

An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming.
Proceedings of the Integer Programming and Combinatoral Optimization, 2011

2010
Logconcave Random Graphs.
Electron. J. Comb., 2010

Computing general static-arbitrage bounds for European basket options via Dantzig-Wolfe decomposition.
Algorithmic Oper. Res., 2010

Phase Transition for the Mixing Time of the Glauber Dynamics for Coloring Regular Trees.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

2008
Exploiting equalities in polynomial programming.
Oper. Res. Lett., 2008

Improved Bounds for the Symmetric Rendezvous Value on the Line.
Oper. Res., 2008

2007
Computing the Stability Number of a Graph Via Linear and Semidefinite Programming.
SIAM J. Optim., 2007

A primal-dual symmetric relaxation for homogeneous conic systems.
J. Complex., 2007

The Influence of Search Engines on Preferential Attachment.
Internet Math., 2007

A Geometric Preferential Attachment Model of Networks II.
Internet Math., 2007

A Geometric Preferential Attachment Model of Networks.
Internet Math., 2007

On the Average Case Performance of Some Greedy Approximation Algorithms For the Uncapacitated Facility Location Problem.
Comb. Probab. Comput., 2007

Adversarial Deletion in a Scale-Free Random Graph Process.
Comb. Probab. Comput., 2007

Bias Reduction in Traceroute Sampling - Towards a More Accurate Map of the Internet.
Proceedings of the Algorithms and Models for the Web-Graph, 5th International Workshop, 2007

2006
LMI Approximations for Cones of Positive Semidefinite Forms.
SIAM J. Optim., 2006

On randomly colouring locally sparse graphs.
Discret. Math. Theor. Comput. Sci., 2006

Independence and coloring properties of direct products of some vertex-transitive graphs.
Discret. Math., 2006

2005
On the diameter of Kneser graphs.
Discret. Math., 2005

On approximating the b-chromatic number.
Discret. Appl. Math., 2005

2003
Random Deletion in a Scale-Free Random Graph Process.
Internet Math., 2003


  Loading...