Planar Embeddings with Small and Uniform Faces

Motivated by finding planar embeddings that lead to drawings with favorable aesthetics, we study the problems MINMAXFACE and UNIFORMFACES of embedding a given biconnected multi-graph such that the largest face is as small as possible and such that all faces have the same size, respectively. We prove a complexity dichotomy for MINMAXFACE and show that deciding whether the maximum is at most $k$ is polynomial-time solvable for $k \leq 4$ and NP-complete for $k \geq 5$. Further, we give a 6-approximation for minimizing the maximum face in a planar embedding. For UNIFORMFACES, we show that the problem is NP-complete for odd $k \geq 7$ and even $k \geq 10$. Moreover, we characterize the biconnected planar multi-graphs admitting 3- and 4-uniform embeddings (in a $k$-uniform embedding all faces have size $k$) and give an efficient algorithm for testing the existence of a 6-uniform embedding.Comment: 23 pages, 5 figures, extended version of 'Planar Embeddings with Small and Uniform Faces' (The 25th International Symposium on Algorithms and Computation, 2014

A Breezing Proof of the KMW Bound

In their seminal paper from 2004, Kuhn, Moscibroda, and Wattenhofer (KMW) proved a hardness result for several fundamental graph problems in the LOCAL model: For any (randomized) algorithm, there are input graphs with $n$ nodes and maximum degree $\Delta$ on which $\Omega(\min\{\sqrt{\log n/\log \log n},\log \Delta/\log \log \Delta\})$ (expected) communication rounds are required to obtain polylogarithmic approximations to a minimum vertex cover, minimum dominating set, or maximum matching. Via reduction, this hardness extends to symmetry breaking tasks like finding maximal independent sets or maximal matchings. Today, more than $15$ years later, there is still no proof of this result that is easy on the reader. Setting out to change this, in this work, we provide a fully self-contained and $\mathit{simple}$ proof of the KMW lower bound. The key argument is algorithmic, and it relies on an invariant that can be readily verified from the generation rules of the lower bound graphs.Comment: 21 pages, 6 figure

Finite Type Invariants of w-Knotted Objects II: Tangles, Foams and the Kashiwara-Vergne Problem

This is the second in a series of papers dedicated to studying w-knots, and more generally, w-knotted objects (w-braids, w-tangles, etc.). These are classes of knotted objects that are wider but weaker than their "usual" counterparts. To get (say) w-knots from usual knots (or u-knots), one has to allow non-planar "virtual" knot diagrams, hence enlarging the the base set of knots. But then one imposes a new relation beyond the ordinary collection of Reidemeister moves, called the "overcrossings commute" relation, making w-knotted objects a bit weaker once again. Satoh studied several classes of w-knotted objects (under the name "weakly-virtual") and has shown them to be closely related to certain classes of knotted surfaces in R4. In this article we study finite type invariants of w-tangles and w-trivalent graphs (also referred to as w-tangled foams). Much as the spaces A of chord diagrams for ordinary knotted objects are related to metrized Lie algebras, the spaces Aw of "arrow diagrams" for w-knotted objects are related to not-necessarily-metrized Lie algebras. Many questions concerning w-knotted objects turn out to be equivalent to questions about Lie algebras. Most notably we find that a homomorphic universal finite type invariant of w-foams is essentially the same as a solution of the Kashiwara-Vergne conjecture and much of the Alekseev-Torossian work on Drinfel'd associators and Kashiwara-Vergne can be re-interpreted as a study of w-foams.Comment: 57 pages. Improvements to the exposition following a referee repor