Carlos J. Luz

According to our database, Carlos J. Luz authored at least 10 papers between 1995 and 2016.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2016

A characterization of the weighted Lovász number based on convex quadratic programming.

Carlos J. Luz

Optim. Lett., 2016

A simplex like approach based on star sets for recognizing convex-QP adverse graphs.

Domingos M. Cardoso, Carlos J. Luz

J. Comb. Optim., 2016

Efficient domination through eigenvalues.

Domingos M. Cardoso, Vadim V. Lozin, Carlos J. Luz, Maria F. Pacheco

Discret. Appl. Math., 2016

2015

A characterization of the weighted version of McEliece-Rodemich-Rumsey-Schrijver number based on convex quadratic programming.

Carlos J. Luz

Discret. Math. Algorithms Appl., 2015

2011

Improving an upper bound on the size of k-regular induced subgraphs.

Carlos J. Luz

J. Comb. Optim., 2011

2005

A Convex Quadratic Characterization of the Lovász Theta Number.

Carlos J. Luz, Alexander Schrijver

SIAM J. Discret. Math., 2005

Improving an Upper Bound on the Stability Number of a Graph.

Carlos J. Luz

J. Glob. Optim., 2005

2001

A quadratic programming approach to the determination of an upper bound on the weighted stability number.

Carlos J. Luz, Domingos M. Cardoso

Eur. J. Oper. Res., 2001

1998

A generalization of the Hoffman - Lovász upper boundon the independence number of a regular graph.

Carlos J. Luz, Domingos M. Cardoso

Ann. Oper. Res., 1998

1995

An upper bound on the independence number of a graph computable in polynomial-time.

Carlos J. Luz

Oper. Res. Lett., 1995