The quantum approximate optimization algorithm (QAOA) is a hybrid quantum-classical
variational algorithm designed to tackle combinatorial optimization problems. Despite its …

The Handbook of Discrete and Computational Geometry is intended as a reference book
fully accessible to nonspecialists as well as specialists, covering all major aspects of both …

Graph drawing comprises all aspects of visualizing structural relations between objects. The
range of topics dealt with extends from graph theory, graph algorithms, geometry, and …

Rydberg atom arrays are among the leading contenders for the demonstration of quantum
speedups. Motivated by recent experiments with up to 289 qubits [Ebadi, Science 376, 1209 …

A disk graph is the intersection graph of a set of disks with arbitrary diameters in the plane.
For the case that the disk representation is given, we present polynomial-time approximation …

Approximation algorithms and parameterized complexity are usually considered to be two
separate ways of dealing with hard algorithmic problems. In this paper, our aim is to …

We present approximation algorithms for maximum independent set of pseudo-disks in the
plane, both in the weighted and unweighted cases. For the unweighted case, we prove that …

We describe and analyze an architecture for quantum optimization to solve maximum
independent set (MIS) problems using neutral atom arrays trapped in optical tweezers …

We consider two problems: given a collection of n fat objects in a fixed
dimension,(1)(packing) find the maximum subcollection of pairwise disjoint objects, and …

This paper discusses algorithms for labeling sets of points in the plane, where labels are not
restricted to some finite number of positions. We show that continuously sliding labels allows …