Related papers: Shortest Paths, Convexity, and Treewidth in Regula…
Inspired by artistic practices such as beadwork and himmeli, we study the problem of threading a single string through a set of tubes, so that pulling the string forms a desired graph. More precisely, given a connected graph (where edges…
We give the first Congested Clique algorithm that computes a sparse hopset with polylogarithmic hopbound in polylogarithmic time. Given a graph $G=(V,E)$, a $(\beta,\epsilon)$-hopset $H$ with "hopbound" $\beta$, is a set of edges added to…
Cutwidth is a widely studied parameter that quantifies how well a graph can be decomposed along small edge-cuts. It complements pathwidth, which captures decomposition by small vertex separators, and it is well-known that cutwidth…
In this paper, we study the problem of finding a minimum weight spanning tree that contains each vertex in a given subset $V_{\rm NT}$ of vertices as an internal vertex. This problem, called Minimum Weight Non-Terminal Spanning Tree,…
Given a set of well-formed terminal pairs on the external face of an undirected planar graph with unit edge weights, we give a linear-time algorithm for computing the union of non-crossing shortest paths joining each terminal pair, where…
We develop a geometric framework to study the structure and function of complex networks. We assume that hyperbolic geometry underlies these networks, and we show that with this assumption, heterogeneous degree distributions and strong…
In this paper, we investigate basic geometric quantities of a random hyperbolic surface of genus $g$ with respect to the Weil-Petersson measure on the moduli space $\mathcal{M}_g$. We show that as $g$ goes to infinity, a generic surface…
How much cutting is needed to simplify the topology of a surface? We provide bounds for several instances of this question, for the minimum length of topologically non-trivial closed curves, pants decompositions, and cut graphs with a given…
Given a set $P$ of $n$ points in the plane, we solve the problems of constructing a geometric planar graph spanning $P$ 1) of minimum degree 2, and 2) which is 2-edge connected, respectively, and has max edge length bounded by a factor of 2…
Let $S_{g,n}$ be a surface of genus $g $ with $n$ marked points. Let $X$ be a complete hyperbolic metric on $S_{g,n}$ with $n$ cusps. Every isotopy class $[\gamma]$ of a closed curve $\gamma \in \pi_{1}(S_{g,n})$ contains a unique closed…
Discrete geometries in hyperbolic space are of longstanding interest in pure mathematics and have come to recent attention in holography, quantum information, and condensed matter physics. Working at a purely geometric level, we describe…
In this article we study the double dimer model on hyperbolic Temperleyan graphs via circle packings. We prove that on such graphs, the weak limit of the dimer model exists if and only if the removed black vertex from the boundary of the…
We give an $n^{2+o(1)}$-time algorithm for finding $s$-$t$ min-cuts for all pairs of vertices $s$ and $t$ in a simple, undirected graph on $n$ vertices. We do so by constructing a Gomory-Hu tree (or cut equivalent tree) in the same running…
We study the parameterized complexity of the classical Edge Hamiltonian Path problem and give several fixed-parameter tractability results. First, we settle an open question of Demaine et al. by showing that Edge Hamiltonian Path is FPT…
In this paper, we study the problem of computing a minimum-width axis-aligned cubic shell that encloses a given set of $n$ points in a three-dimensional space. A cubic shell is a closed volume between two concentric and face-parallel cubes.…
We give almost-linear-time algorithms for approximating rooted minimum cut and maximum arborescence packing in directed graphs, two problems that are dual to each other [Edm73]. More specifically, for an $n$-vertex, $m$-edge directed graph…
We find an upper bound for the asymptotic dimension of a hyperbolic metric space with a set of geodesics satisfying a certain boundedness condition studied by Bowditch. The primary example is a collection of tight geodesics on the curve…
For hyperbolic surfaces with geodesic boundary, we study the orthosystole, i.e. the length of a shortest essential arc from the boundary to the boundary. We recover and extend work by Bavard completely characterizing the surfaces maximizing…
We introduce and study the complexity of Path Packing. Given a graph $G$ and a list of paths, the task is to embed the paths edge-disjoint in $G$. This generalizes the well known Hamiltonian-Path problem. Since Hamiltonian Path is…
We study Helly graphs of finite combinatorial dimension, i.e. whose injective hull is finite-dimensional. We describe very simple fine simplicial subdivisions of the injective hull of a Helly graph, following work of Lang. We also give a…