• Publications
  • Influence
The Operator Psi for the Chromatic Number of a Graph
TLDR
We investigate hierarchies of semidefinite approximations for the chromatic number $\chi(G)$ of a graph $G$, improving the classic Lovasz theta number (and its strengthenings obtained by adding nonnegativity and triangle inequalities); experimental results are given in the follow-up paper. Expand
  • 31
  • 2
Computing Semidefinite Programming Lower Bounds for the (Fractional) Chromatic Number Via Block-Diagonalization
TLDR
We present here our experimental results with these relaxed bounds for Hamming graphs, Kneser graphs, and DIMACS benchmark graphs. Expand
  • 23
  • 2
  • PDF
Partitioning a call graph
TLDR
Splitting a large software system into smaller and more manageable units has become an important problem for many organizations. Expand
  • 18
  • 1
  • PDF
Semidefinite bounds for the stability number of a graph via sums of squares of polynomials
TLDR
Lovász and Schrijver (SIAM J. Optim. 1:166–190, 1991) have constructed semidefinite relaxations for the stable set polytope of a graph G = (V,E) by a sequence of lift-and-project operations. Expand
  • 12
  • 1
Block-diagonal semidefinite programming hierarchies for 0/1 programming
TLDR
We propose two new, block-diagonal hierarchies of semidefinite programming relaxations, which are at least as strong as the Lovasz-Schrijver hierarchy, but less costly to compute. Expand
  • 18
  • 1
  • PDF
A TIME SERIES ANALYSIS OF FOUR MAJOR CRYPTOCURRENCIES
Because of increasing interest in cryptocurrency investments, there is a need to quantify their variation over time. Therefore, in this paper we try to answer a few important questions related to aExpand
  • 5
  • 1
Semidefinite Bounds for the Stability Number of a Graph via Sums of Squares of Polynomials
TLDR
We construct a hierarchy of semidefinite relaxations for the stable set polytope of a graph G = (V,E) by a sequence of lift-and-project operations, where α(G) is the stability number of G. Expand
  • 27
  • PDF
Approximating the stability number and the chromatic number of a graph via semidefinite programming
Disclaimer/Complaints regulations If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons.Expand
  • 12
  • PDF
New heuristics for the vertex coloring problem based on semidefinite programming
TLDR
We propose two vertex coloring heuristics based on $$\varPsi _K(G)$$ and present numerical results on medium sized graphs. Expand
  • 3
An extension of the GQM+Strategies approach with formal causal reasoning
TLDR
This paper extends the existing GQM + Strategies knowledge base by further elaborating and clarifying the process of creating grids by introducing causality theory. Expand
  • 4
...
1
2
...