Covering planar metrics (and beyond): O (1) trees suffice
While research on the geometry of planar graphs has been active in the past decades, many
properties of planar metrics remain mysterious. This paper studies a fundamental aspect of …
properties of planar metrics remain mysterious. This paper studies a fundamental aspect of …
Shorter labeling schemes for planar graphs
An adjacency labeling scheme for a given class of graphs is an algorithm that for every
graph G from the class, assigns bit strings (labels) to vertices of G so that for any two vertices …
graph G from the class, assigns bit strings (labels) to vertices of G so that for any two vertices …
Hop-constrained metric embeddings and their applications
A Filtser - 2021 IEEE 62nd Annual Symposium on Foundations …, 2022 - ieeexplore.ieee.org
In network design problems, such as compact routing, the goal is to route packets between
nodes using the (approximated) shortest paths. A desirable property of these routes is a …
nodes using the (approximated) shortest paths. A desirable property of these routes is a …
Sketching distances in monotone graph classes
L Esperet, N Harms, A Kupavskii - arXiv preprint arXiv:2202.09253, 2022 - arxiv.org
We study the two-player communication problem of determining whether two vertices $ x, y $
are nearby in a graph $ G $, with the goal of determining the graph structures that allow the …
are nearby in a graph $ G $, with the goal of determining the graph structures that allow the …
Labeled nearest neighbor search and metric spanners via locality sensitive orderings
A Filtser - arXiv preprint arXiv:2211.11846, 2022 - arxiv.org
Chan, Har-Peled, and Jones [SICOMP 2020] developed locality-sensitive orderings (LSO)
for Euclidean space. A $(\tau,\rho) $-LSO is a collection $\Sigma $ of orderings such that for …
for Euclidean space. A $(\tau,\rho) $-LSO is a collection $\Sigma $ of orderings such that for …
Can't see the forest for the trees: Navigating metric spaces by bounded hop-diameter spanners
Spanners for metric spaces have been extensively studied, perhaps most notably in low-
dimensional Euclidean spaces-due to their numerous applications. Euclidean spanners can …
dimensional Euclidean spaces-due to their numerous applications. Euclidean spanners can …
Fully polynomial-time distributed computation in low-treewidth graphs
T Izumi, N Kitamura, T Naruse… - Proceedings of the 34th …, 2022 - dl.acm.org
Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs Page 1 Fully
Polynomial-Time Distributed Computation in Low-Treewidth Graphs Taisuke Izumi ∗ t-izumi@ist.osaka-u.ac.jp …
Polynomial-Time Distributed Computation in Low-Treewidth Graphs Taisuke Izumi ∗ t-izumi@ist.osaka-u.ac.jp …
Better distance labeling for unweighted planar graphs
P Gawrychowski, P Uznański - Algorithmica, 2023 - Springer
A distance labeling scheme is an assignment of labels, that is, binary strings, to all nodes of
a graph, so that the distance between any two nodes can be computed from their labels …
a graph, so that the distance between any two nodes can be computed from their labels …
Value iteration using universal graphs and the complexity of mean payoff games
N Fijalkow, P Gawrychowski… - … Foundations of Computer …, 2020 - cnrs.hal.science
We study the computational complexity of solving mean payoff games. This class of games
can be seen as an extension of parity games, and they have similar complexity status: in …
can be seen as an extension of parity games, and they have similar complexity status: in …
1+ε approximation of tree edit distance in quadratic time
Edit distance is one of the most fundamental problems in computer science. Tree edit
distance is a natural generalization of edit distance to ordered rooted trees. Such a …
distance is a natural generalization of edit distance to ordered rooted trees. Such a …