default search action
Juan C. Vera 0001
Person information
- affiliation: Tilburg University, Department of Econometrics and Operations Research, The Netherlands
- affiliation (2007 - 2010): University of Waterloo, Department of Management Sciences, Canada
- affiliation (2006 - 2007): Georgia Institute of Technology, College of Computing, Atlanta, GA, USA
- affiliation (PhD 2006): Carnegie Mellon University, Department of Mathematical Sciences, Pittsburgh, PA, USA
Other persons with the same name
- Juan Vera — disambiguation page
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j42]Olga Kuryatnikova
, Juan C. Vera
Reducing Nonnegativity over General Semialgebraic Sets to Nonnegativity over Simple Sets. SIAM J. Optim. 34(2): 1970-2006 (2024) - 2023
- [j41]Rosember Guerra-Urzola
Sparsifying the least-squares approach to PCA: comparison of lasso and cardinality constraint. Adv. Data Anal. Classif. 17(1): 269-286 (2023) - [j40]Anne G. Balter
Contingent Capital with Stock Price Triggers in Interbank Networks. Math. Oper. Res. 48(1): 520-543 (2023) - 2022
- [j39]Olga Kuryatnikova
The Maximum k-Colorable Subgraph Problem and Related Problems. INFORMS J. Comput. 34(1): 656-669 (2022) - 2021
- [j38]Luciano N. Grippo
On the $P_3$-Hull Number of Kneser Graphs. Electron. J. Comb. 28(3) (2021) - [j37]Javier Peña
New characterizations of Hoffman constants for systems of linear constraints. Math. Program. 187(1): 79-109 (2021) - 2020
- [j36]Flavia Bonomo-Braberman
A note on homomorphisms of Kneser hypergraphs. Appl. Math. Comput. 366 (2020) - [j35]Wei Xia, Juan-Carlos Vera
Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques. INFORMS J. Comput. 32(1): 40-56 (2020) - [j34]Olga Kuryatnikova
New Bounds for Truthful Scheduling on Two Unrelated Selfish Machines. Theory Comput. Syst. 64(2): 199-226 (2020)
2010 – 2019
- 2018
- [j33]Onur Babat
Computing near-optimal Value-at-Risk portfolios using integer programming techniques. Eur. J. Oper. Res. 266(1): 304-315 (2018) - [j32]Denis Aßmann
Deciding Robust Feasibility and Infeasibility Using a Set Containment Approach: An Application to Stationary Passive Gas Network Operations. SIAM J. Optim. 28(3): 2489-2517 (2018) - 2017
- [j31]Frédérique Bassino, Flavia Bonomo, Lionel Pournin, Mario Valencia-Pabon, Juan C. Vera
LAGOS 2017 - IX Latin and American Algorithms, Graphs, and Optimization Symposium. Electron. Notes Discret. Math. 62: 1-2 (2017) - [j30]Olga Kuryatnikova
Approximating the cone of copositive kernels to estimate the stability number of infinite graphs. Electron. Notes Discret. Math. 62: 303-308 (2017) - [j29]Etienne de Klerk
On the convergence rate of grid search for polynomial optimization over the simplex. Optim. Lett. 11(3): 597-608 (2017) - [j28]Thijs Verhaegh, Dennis Huisman, Pieter-Jan Fioole, Juan C. Vera
A heuristic for real-time crew rescheduling during small disruptions. Public Transp. 9(1-2): 325-342 (2017) - 2016
- [j27]Bissan Ghaddar
A dynamic inequality generation scheme for polynomial programming. Math. Program. 156(1-2): 21-57 (2016) - 2015
- [j26]Javier Peña, Juan Carlos Vera
Completely positive reformulations for polynomial optimization. Math. Program. 151(2): 405-431 (2015) - [j25]Cristian Dobre
Exploiting symmetry in copositive programs via semidefinite hierarchies. Math. Program. 151(2): 659-680 (2015) - [j24]Thomas P. Hayes, Juan Carlos Vera
Randomly coloring planar graphs with fewer colors than the maximum degree. Random Struct. Algorithms 47(4): 731-759 (2015) - [j23]Juan Carlos Vera
Improved Bounds on the Phase Transition for the Hard-Core Model in 2 Dimensions. SIAM J. Discret. Math. 29(4): 1895-1915 (2015) - 2014
- [j22]Ricardo Restrepo, Daniel Stefankovic
Phase Transition for Glauber Dynamics for Independent Sets on Regular Trees. SIAM J. Discret. Math. 28(2): 835-861 (2014) - 2013
- [c14]Juan Carlos Vera
Improved Bounds on the Phase Transition for the Hard-Core Model in 2-Dimensions. APPROX-RANDOM 2013: 699-713 - [i2]Juan Carlos Vera, Eric Vigoda, Linji Yang:
Improved Bounds on the Phase Transition for the Hard-Core Model in 2-Dimensions. CoRR abs/1306.0431 (2013) - 2012
- [j21]Javier Peña, Juan Carlos Vera
Computing arbitrage upper bounds on basket options in the presence of bid-ask spreads. Eur. J. Oper. Res. 222(2): 369-376 (2012) - [j20]Qi-Ming He, Hanqin Zhang, Juan C. Vera
Majorization and Extremal PH-Distributions (abstract only). SIGMETRICS Perform. Evaluation Rev. 39(4): 27 (2012) - 2011
- [j19]Nayantara Bhatnagar, Juan Carlos Vera, Eric Vigoda, Dror Weitz:
Reconstruction for Colorings on Trees. SIAM J. Discret. Math. 25(2): 809-826 (2011) - [j18]Bissan Ghaddar
Second-Order Cone Relaxations for Binary Quadratic Polynomial Programs. SIAM J. Optim. 21(1): 391-414 (2011) - [c13]Bissan Ghaddar
An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming. IPCO 2011: 207-222 - [c12]Qi-Ming He, Hanqin Zhang, Juan C. Vera
Majorization and Extremal PH Distributions. MAM 2011: 107-121 - [c11]Ricardo Restrepo, Daniel Stefankovic, Juan Carlos Vera, Eric Vigoda, Linji Yang:
Phase Transition for Glauber Dynamics for Independent Sets on Regular Trees. SODA 2011: 945-956 - 2010
- [j17]Javier Peña, Xavier Saynac, Juan Carlos Vera, Luis Fernando Zuluaga:
Computing general static-arbitrage bounds for European basket options via Dantzig-Wolfe decomposition. Algorithmic Oper. Res. 5(2): 65-74 (2010) - [j16]Alan M. Frieze, Santosh S. Vempala, Juan Vera:
Logconcave Random Graphs. Electron. J. Comb. 17(1) (2010) - [c10]Prasad Tetali, Juan Carlos Vera, Eric Vigoda, Linji Yang:
Phase Transition for the Mixing Time of the Glauber Dynamics for Coloring Regular Trees. SODA 2010: 1646-1656 - [i1]Ricardo Restrepo, Daniel Stefankovic, Juan Carlos Vera, Eric Vigoda, Linji Yang:
Phase Transition for Glauber Dynamics for Independent Sets on Regular Trees. CoRR abs/1007.2255 (2010)
2000 – 2009
- 2008
- [j15]Qiaoming Han, Donglei Du
Improved Bounds for the Symmetric Rendezvous Value on the Line. Oper. Res. 56(3): 772-782 (2008) - [j14]Javier Peña, Juan Carlos Vera
Exploiting equalities in polynomial programming. Oper. Res. Lett. 36(2): 223-228 (2008) - [c9]Alan M. Frieze, Santosh S. Vempala, Juan Vera:
Logconcave random graphs. STOC 2008: 779-788 - 2007
- [j13]Abraham D. Flaxman, Alan M. Frieze
Adversarial Deletion in a Scale-Free Random Graph Process. Comb. Probab. Comput. 16(2): 261-270 (2007) - [j12]Abraham D. Flaxman, Alan M. Frieze
On the Average Case Performance of Some Greedy Approximation Algorithms For the Uncapacitated Facility Location Problem. Comb. Probab. Comput. 16(5): 713-732 (2007) - [j11]Abraham D. Flaxman, Alan M. Frieze, Juan Vera
A Geometric Preferential Attachment Model of Networks. Internet Math. 3(2): 187-205 (2007) - [j10]Alan M. Frieze, Juan Vera
The Influence of Search Engines on Preferential Attachment. Internet Math. 3(3): 361-381 (2007) - [j9]Abraham D. Flaxman, Alan M. Frieze, Juan Vera
A Geometric Preferential Attachment Model of Networks II. Internet Math. 4(1): 87-111 (2007) - [j8]Juan Carlos Vera
A primal-dual symmetric relaxation for homogeneous conic systems. J. Complex. 23(2): 245-261 (2007) - [j7]Javier Peña, Juan Carlos Vera
Computing the Stability Number of a Graph Via Linear and Semidefinite Programming. SIAM J. Optim. 18(1): 87-105 (2007) - [c8]Qiaoming Han, Donglei Du, Juan Carlos Vera, Luis Fernando Zuluaga:
Improved bounds for the symmetric rendezvous value on the line. SODA 2007: 69-78 - [c7]Thomas P. Hayes, Juan Carlos Vera
Randomly coloring planar graphs with fewer colors than the maximum degree. STOC 2007: 450-458 - [c6]Abraham D. Flaxman, Juan Vera:
Bias Reduction in Traceroute Sampling - Towards a More Accurate Map of the Internet. WAW 2007: 1-15 - [c5]Abraham D. Flaxman, Alan M. Frieze, Juan Vera
A Geometric Preferential Attachment Model of Networks II. WAW 2007: 41-55 - 2006
- [j6]Mario Valencia-Pabon, Juan Vera
Independence and coloring properties of direct products of some vertex-transitive graphs. Discret. Math. 306(18): 2275-2281 (2006) - [j5]Alan M. Frieze
On randomly colouring locally sparse graphs. Discret. Math. Theor. Comput. Sci. 8(1): 121-128 (2006) - [j4]Luis Fernando Zuluaga, Juan Carlos Vera
LMI Approximations for Cones of Positive Semidefinite Forms. SIAM J. Optim. 16(4): 1076-1091 (2006) - 2005
- [j3]Sylvie Corteel, Mario Valencia-Pabon, Juan-Carlos Vera
On approximating the b-chromatic number. Discret. Appl. Math. 146(1): 106-110 (2005) - [j2]Mario Valencia-Pabon, Juan-Carlos Vera
On the diameter of Kneser graphs. Discret. Math. 305(1-3): 383-385 (2005) - [c4]Abraham Flaxman, Alan M. Frieze, Juan Vera:
Adversarial deletion in a scale free random graph process. SODA 2005: 287-292 - [c3]Soumen Chakrabarti, Alan M. Frieze, Juan Vera:
The influence of search engines on preferential attachment. SODA 2005: 293-300 - [c2]Abraham Flaxman, Alan M. Frieze, Juan Carlos Vera
On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem. STOC 2005: 441-449 - 2004
- [c1]Abraham Flaxman, Alan M. Frieze, Juan Vera:
A Geometric Preferential Attachment Model of Networks. WAW 2004: 44-55 - 2003
- [j1]Colin Cooper, Alan M. Frieze, Juan Vera
Random Deletion in a Scale-Free Random Graph Process. Internet Math. 1(4): 463-483 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: