Cover Image

A face cover perspective to $\ell_1$ embeddings of planar graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Filtser, Arnold
Format:	Preprint
Published:	2019
Subjects:	Data Structures and Algorithms Computational Geometry
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On Strong Diameter Padded Decompositions
by: Filtser, Arnold
Published: (2019)

Scattering and Sparse Partitions, and their Applications
by: Filtser, Arnold
Published: (2020)

On Sparse Covers of Minor Free Graphs, Low Dimensional Metric Embeddings, and other applications
by: Filtser, Arnold
Published: (2024)

Dynamic Light Spanners in Doubling Metrics
by: Bhore, Sujoy, et al.
Published: (2026)

Online Duet between Metric Embeddings and Minimum-Weight Perfect Matchings
by: Bhore, Sujoy, et al.
Published: (2023)

Stochastic Embedding of Digraphs into DAGs
by: Filtser, Arnold
Published: (2025)

Hop-Constrained Metric Embeddings and their Applications
by: Filtser, Arnold
Published: (2021)

FPT approximations for Capacitated Sum of Radii and Diameters
by: Filtser, Arnold, et al.
Published: (2024)

How to Protect Yourself from Threatening Skeletons: Optimal Padded Decompositions for Minor-Free Graphs
by: Conroy, Jonathan, et al.
Published: (2025)

The Power of Recursive Embeddings for $\ell_p$ Metrics
by: Krauthgamer, Robert, et al.
Published: (2025)

The Squishy Grid Problem
by: Cai, Zixi, et al.
Published: (2025)

Fast Nearest Neighbor Search for $\ell_p$ Metrics
by: Krauthgamer, Robert, et al.
Published: (2026)

A dynamic $(1+\varepsilon)$-spanner for disk intersection graphs
by: de Berg, Sarita, et al.
Published: (2026)

Highway Dimension: a Metric View
by: Feldmann, Andreas Emil, et al.
Published: (2024)

Near-Resolution of the Tradeoff Conjecture in Distributed Proof Labeling Schemes
by: Filtser, Arnold, et al.
Published: (2026)

Parameterized and approximation algorithms for coverings points with segments in the plane
by: Kowalska, Katarzyna, et al.
Published: (2024)

A new near-linear time algorithm for k-nearest neighbor search using a compressed cover tree
by: Elkin, Yury, et al.
Published: (2021)

On Approximability of Steiner Tree in $\ell_p$-metrics
by: Fleischmann, Henry, et al.
Published: (2023)

Local Routing on Ordered $Θ$-graphs
by: van Renssen, André, et al.
Published: (2025)

Guarding Polyominoes Under $k$-Hop Visibility
by: Filtser, Omrit, et al.
Published: (2023)

Finding maximum matchings in RDV graphs efficiently
by: Biedl, Therese, et al.
Published: (2024)

Dynamic parameterized problems on unit disk graphs
by: An, Shinwoo, et al.
Published: (2024)

Subexponential algorithms in geometric graphs via the subquadratic grid minor property: the role of local radius
by: Berthe, Gaétan, et al.
Published: (2023)

Min-1-Planarity is NP-Hard
by: Okada, Yuto
Published: (2026)

Spanner for the $0/1/\infty$ weighted region problem
by: Gudmundsson, Joachim, et al.
Published: (2024)

Computing Diameter +1 in Truly Subquadratic Time for Unit-Disk Graphs
by: Chang, Hsien-Chih, et al.
Published: (2024)

On Approximability of $\ell_2^2$ Min-Sum Clustering
by: S., Karthik C., et al.
Published: (2024)

Fitting trees to $\ell_1$-hyperbolic distances
by: Yim, Joon-Hyeok, et al.
Published: (2024)

Sequential non-determinism in tile self-assembly: a general framework and an application to efficient temperature-1 self-assembly of squares
by: Furcy, David, et al.
Published: (2024)

Efficient Algorithms and Implementations for Extracting Maximum-Size $(k,\ell)$-Sparse Subgraphs
by: Madarasi, Péter
Published: (2025)

Quadratic-Time Algorithm for the Maximum-Weight $(k, \ell)$-Sparse Subgraph Problem
by: Deák, Bence, et al.
Published: (2025)

A Deterministic Partition Tree and Applications
by: Wang, Haitao
Published: (2025)

A Subquadratic Time Approximation Algorithm for Individually Fair k-Center
by: Ebbens, Matthijs, et al.
Published: (2024)

A Quasi-Polynomial Time Algorithm for 3-Coloring Circle Graphs
by: S, Ajaykrishnan E, et al.
Published: (2025)

A Bouquet of Results on Maximum Range Sum: General Techniques and Hardness Reductions
by: Gusain, Rachana, et al.
Published: (2025)

A PTAS for Travelling Salesman Problem with Neighbourhoods Over Parallel Line Segments of Similar Length
by: Ghaseminia, Benyamin, et al.
Published: (2025)

Internal versus external balancing in the evaluation of graph-based number types
by: Geppert, Hanna, et al.
Published: (2019)

A Dichotomy for 1-Planarity with Restricted Crossing Types Parameterized by Treewidth
by: Cabello, Sergio, et al.
Published: (2025)

Dynamic and Streaming Algorithms for Union Volume Estimation
by: Bhore, Sujoy, et al.
Published: (2026)

Approximation Algorithms for Smallest Intersecting Balls
by: Zheng, Jiaqi, et al.
Published: (2024)