Carlos J. Luz

MaRDI QIDQ194435zbMATH OpenFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
New results for recognizing convex-\(QP\) adverse graphs Optimization	2020-01-13	Paper
Efficient domination through eigenvalues Discrete Applied Mathematics	2016-09-30	Paper
A simplex like approach based on star sets for recognizing convex-\(QP\) adverse graphs Journal of Combinatorial Optimization	2016-02-23	Paper
A characterization of the weighted Lovász number based on convex quadratic programming Optimization Letters	2016-02-23	Paper
A characterization of the weighted version of McEliece-Rodemich-Rumsey-Schrijver number based on convex quadratic programming Discrete Mathematics, Algorithms and Applications	2016-02-22	Paper
Approximating the maximum size of a \(k\)-regular induced subgraph by an upper bound on the co-\(k\)-plex number Journal of Mathematical Sciences (New York)	2012-11-28	Paper
Improving an upper bound on the size of \(k\)-regular induced subgraphs Journal of Combinatorial Optimization	2012-04-04	Paper
A heuristic for the stability number of a graph based on convex quadratic programming and tabu search Journal of Mathematical Sciences (New York)	2010-01-19	Paper
A characterization of Delsarte's linear programming bound as a ratio bound Linear Algebra and its Applications	2007-04-18	Paper
A Convex Quadratic Characterization of the Lovász Theta Number SIAM Journal on Discrete Mathematics	2006-06-01	Paper
scientific article; zbMATH DE number 2211755 (Why is no real title available?)	2005-10-04	Paper
Improving an upper bound on the stability number of a graph Journal of Global Optimization	2005-06-13	Paper
A quadratic programming approach to the determination of an upper bound on the weighted stability number European Journal of Operational Research	2001-01-01	Paper
A generalization of the Hoffman-Lovász upper bound on the independence number of a regular graph Annals of Operations Research	1998-09-27	Paper
An upper bound on the independence number of a graph computable in polynomial-time Operations Research Letters	1997-02-11	Paper
scientific article; zbMATH DE number 3918119 (Why is no real title available?)	1985-01-01	Paper

Research outcomes over time

This page was built for person: Carlos J. Luz