Juan C. Vera

Math. Oper. Res., February, 2023

2022

The Maximum <i>k</i>-Colorable Subgraph Problem and Related Problems.

[BibT_eX]

[DOI]

Olga Kuryatnikova

Renata Sotirov

INFORMS J. Comput., 2022

2021

New characterizations of Hoffman constants for systems of linear constraints.

[BibT_eX]

[DOI]

Math. Program., 2021

On the $P_3$-Hull Number of Kneser Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2021

2020

New Bounds for Truthful Scheduling on Two Unrelated Selfish Machines.

[BibT_eX]

[DOI]

Olga Kuryatnikova

Theory Comput. Syst., 2020

Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques.

[BibT_eX]

[DOI]

Wei Xia

Juan-Carlos Vera

INFORMS J. Comput., 2020

A note on homomorphisms of Kneser hypergraphs.

[BibT_eX]

[DOI]

Flavia Bonomo-Braberman

Mitre Costa Dourado

Appl. Math. Comput., 2020

2018

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

[BibT_eX]

[DOI]

SIAM J. Optim., 2018

Computing near-optimal Value-at-Risk portfolios using integer programming techniques.

[BibT_eX]

[DOI]

Onur Babat

Eur. J. Oper. Res., 2018

2017

A heuristic for real-time crew rescheduling during small disruptions.

[BibT_eX]

[DOI]

Public Transp., 2017

On the convergence rate of grid search for polynomial optimization over the simplex.

[BibT_eX]

[DOI]

Optim. Lett., 2017

Approximating the cone of copositive kernels to estimate the stability number of infinite graphs.

[BibT_eX]

[DOI]

Olga Kuryatnikova

Juan Carlos Vera Lizcano

Electron. Notes Discret. Math., 2017

LAGOS 2017 - IX Latin and American Algorithms, Graphs, and Optimization Symposium.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

2016

A dynamic inequality generation scheme for polynomial programming.

[BibT_eX]

[DOI]

Bissan Ghaddar

Miguel F. Anjos

Math. Program., 2016

2015

Improved Bounds on the Phase Transition for the Hard-Core Model in 2 Dimensions.

[BibT_eX]

[DOI]

Eric Vigoda

Linji Yang

SIAM J. Discret. Math., 2015

Randomly coloring planar graphs with fewer colors than the maximum degree.

[BibT_eX]

[DOI]

Thomas P. Hayes

Eric Vigoda

Random Struct. Algorithms, 2015

Completely positive reformulations for polynomial optimization.

[BibT_eX]

[DOI]

Math. Program., 2015

Exploiting symmetry in copositive programs via semidefinite hierarchies.

[BibT_eX]

[DOI]

Cristian Dobre

Math. Program., 2015

2014

Phase Transition for Glauber Dynamics for Independent Sets on Regular Trees.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2014

2012

Majorization and Extremal <i>PH</i>-Distributions (abstract only).

[BibT_eX]

[DOI]

Qi-Ming He

Hanqin Zhang

SIGMETRICS Perform. Evaluation Rev., 2012

Computing arbitrage upper bounds on basket options in the presence of bid-ask spreads.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2012

2011

Second-Order Cone Relaxations for Binary Quadratic Polynomial Programs.

[BibT_eX]

[DOI]

Bissan Ghaddar

Miguel F. Anjos

SIAM J. Optim., 2011

Reconstruction for Colorings on Trees.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2011

Majorization and Extremal PH Distributions.

[BibT_eX]

[DOI]

Qi-Ming He

Hanqin Zhang

Proceedings of the Matrix-Analytic Methods in Stochastic Models, 2011

An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming.

[BibT_eX]

[DOI]

Bissan Ghaddar

Miguel F. Anjos

Proceedings of the Integer Programming and Combinatoral Optimization, 2011

2010

Logconcave Random Graphs.

[BibT_eX]

[DOI]

Santosh S. Vempala

Electron. J. Comb., 2010

Computing general static-arbitrage bounds for European basket options via Dantzig-Wolfe decomposition.

[BibT_eX]

[DOI]

Xavier Saynac

Algorithmic Oper. Res., 2010

Phase Transition for the Mixing Time of the Glauber Dynamics for Coloring Regular Trees.

[BibT_eX]

[DOI]

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

2008

Exploiting equalities in polynomial programming.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2008

Improved Bounds for the Symmetric Rendezvous Value on the Line.

[BibT_eX]

[DOI]

Qiaoming Han

Donglei Du

Oper. Res., 2008

2007

Computing the Stability Number of a Graph Via Linear and Semidefinite Programming.

[BibT_eX]

[DOI]

SIAM J. Optim., 2007

A primal-dual symmetric relaxation for homogeneous conic systems.

[BibT_eX]

[DOI]

J. Complex., 2007

The Influence of Search Engines on Preferential Attachment.

[BibT_eX]

[DOI]

Soumen Chakrabarti

Internet Math., 2007

A Geometric Preferential Attachment Model of Networks II.

[BibT_eX]

[DOI]

Internet Math., 2007

A Geometric Preferential Attachment Model of Networks.

[BibT_eX]

[DOI]

Internet Math., 2007

On the Average Case Performance of Some Greedy Approximation Algorithms For the Uncapacitated Facility Location Problem.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2007

Adversarial Deletion in a Scale-Free Random Graph Process.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2007

Bias Reduction in Traceroute Sampling - Towards a More Accurate Map of the Internet.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Models for the Web-Graph, 5th International Workshop, 2007

2006

LMI Approximations for Cones of Positive Semidefinite Forms.

[BibT_eX]

[DOI]

SIAM J. Optim., 2006

On randomly colouring locally sparse graphs.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2006

Independence and coloring properties of direct products of some vertex-transitive graphs.

[BibT_eX]

[DOI]

Discret. Math., 2006

2005

On the diameter of Kneser graphs.

[BibT_eX]

[DOI]

Juan-Carlos Vera

Discret. Math., 2005

On approximating the b-chromatic number.

[BibT_eX]

[DOI]

Sylvie Corteel

Juan-Carlos Vera

Discret. Appl. Math., 2005

2003

Random Deletion in a Scale-Free Random Graph Process.

[BibT_eX]

[DOI]

Colin Cooper