Due to its versatility, copositive optimization receives increasing interest in the Operational
Research community, and is a rapidly expanding and fertile field of research. It is a special …

Get an In-Depth Understanding of Graph Drawing Techniques, Algorithms, Software, and
Applications The Handbook of Graph Drawing and Visualization provides a broad, up-to …

The crossing number is a popular tool in graph drawing and visualization, but there is not
really just one crossing number; there is a large family of crossing number notions of which …

Crossing Numbers of Graphs is the first book devoted to the crossing number, an
increasingly popular object of study with surprising connections. The field has matured into a …

We consider semidefinite programming problems on which a permutation group is acting.
We describe a general technique to reduce the size of such problems, exploiting the …

Invariant Semidefinite Programs | SpringerLink Skip to main content Advertisement Springer
Nature Link Account Menu Find a journal Publish with us Track your research Search Cart 1.Home …

We consider the computational complexity of optimizing various classes of continuous
functions over a simplex, hypercube or sphere. These relatively simple optimization …

We consider semidefinite programming relaxations of the quadratic assignment problem,
and show how to exploit group symmetry in the problem data. Thus we are able to compute …

We present, to the best of the authors' knowledge, all known results for the (planar) crossing
numbers of specific graphs and graph families. The results are separated into various …

Semidefinite programming (SDP) may be seen as a generalization of linear programming
(LP). In particular, one may extend interior point algorithms for LP to SDP, but it has proven …