Quantum low-density parity-check (LDPC) codes are an important class of quantum error
correcting codes. In such codes, each qubit only affects a constant number of syndrome bits …

We study the query complexity of geodesically convex (g-convex) optimization on a
manifold. To isolate the effect of that manifold's curvature, we primarily focus on hyperbolic …

Let F be a set of n objects in the plane and let G×(F) be its intersection graph. A balanced
clique-based separator of G×(F) is a set S consisting of cliques whose removal partitions …

The hyperbolicity of a graph, informally, measures how close a graph is (metrically) to a tree.
Hence, it is intuitively similar to treewidth, but the measures are formally incomparable …

A graph G is a (Euclidean) unit disk graph if it is the intersection graph of unit disks in the
Euclidean plane $\mathbb {R}^ 2$. Recognizing them is known to be $\exists\mathbb {R} …

We consider intersection graphs of disks of radius $ r $ in the hyperbolic plane. Unlike the
Euclidean setting, these graph classes are different for different values of $ r $, where very …

We study the problem of finding the smallest graph that does not occur as an induced
subgraph of a given graph. This missing induced subgraph has at most logarithmic size and …

We study the traveling salesman problem in the hyperbolic plane of Gaussian curvature $-
1$. Let $\alpha $ denote the minimum distance between any two input points. Using a new …

The class of Euclidean unit disk graphs is one of the most fundamental and well-studied
graph classes with underlying geometry. In this paper, we identify this class as a special …

We consider a variant of treewidth that we call clique-partitioned treewidth in which each
bag is partitioned into cliques. This is motivated by the recent development of FPT …