Fullerenes are carbon molecules that form polyhedral cages. Their bond structures are
exactly the planar cubic graphs that have only pentagon and hexagon faces. Strikingly, a …

The purpose of this survey is to serve both as a gentle introduction and a coherent overview
of state-of-the-art Frank--Wolfe algorithms, also called conditional gradient algorithms, for …

Detecting instances of unknown categories is an important task for a multitude of problems
such as object recognition, event detection, and defect localization. This article investigates …

In the 19th century there arose a real need to deal with an important practical problems on
the design of steam engines—here we speak about the famous Watt parallelogram, which …

A few properties of minimax and maximin optimal designs in a compact subset of Rd are
presented, and connections with other space-filling constructions are indicated. Several …

The approximation of concrete function classes is the most common subject in the theory of
approximations of functions. An important particular case of this is the problem of the …

Fullerene (Version 4.4) is a general purpose open‐source program that can generate any
fullerene isomer, perform topological and graph theoretical analysis, as well as calculate a …

We present a new algorithm for domain adaptation improving upon a discrepancy
minimization algorithm,(DM), previously shown to outperform a number of algorithms for this …

The continuous k-center problem aims at finding k balls with the smallest radius to cover a
finite number of given points in R^ n R n. In this paper, we propose and study the following …

Invented some 65 years ago in a seminal paper by Marguerite Straus-Frank and Philip
Wolfe, the Frank–Wolfe method recently enjoys a remarkable revival, fuelled by the need of …