Image de couverture de livre

Geometric spanners of bounded tree-width

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Buchin, Kevin, Rehs, Carolin, Scheele, Torben
Format:	Preprint
Publié:	2024
Sujets:	Computational Geometry
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Compatible Triangulations of Simple Polygons
par: Afshani, Peyman, et autres
Publié: (2026)

Computing Oriented Spanners and their Dilation
par: Buchin, Kevin, et autres
Publié: (2024)

Oriented Spanners
par: Buchin, Kevin, et autres
Publié: (2023)

Algorithms and Lower Bounds for the Maximum Overlap of Two Polygons Under Translation
par: Abrahamsen, Mikkel, et autres
Publié: (2025)

On Small Pair Decompositions for Point Sets
par: Buchin, Kevin, et autres
Publié: (2026)

Bicriteria approximation for minimum dilation graph augmentation
par: Buchin, Kevin, et autres
Publié: (2024)

Fundamentals of Computing Continuous Dynamic Time Warping in 2D under Different Norms
par: Buchin, Kevin, et autres
Publié: (2025)

A Constant-Factor Approximation for Continuous Dynamic Time Warping in 2D
par: Buchin, Kevin, et autres
Publié: (2026)

Faster Fréchet Distance under Transformations
par: Buchin, Kevin, et autres
Publié: (2025)

Orienteering (with Time Windows) on Restricted Graph Classes
par: Buchin, Kevin, et autres
Publié: (2024)

A note on optimal degree-three spanners of the square lattice
par: Galant, Damien, et autres
Publié: (2020)

Computing $L_\infty$ Hausdorff Distances Under Translations: The Interplay of Dimensionality, Symmetry and Discreteness
par: Angrick, Sebastian, et autres
Publié: (2026)

Reconfiguration of unit squares and disks: PSPACE-hardness in simple settings
par: Abrahamsen, Mikkel, et autres
Publié: (2024)

Map-Matching Queries under Fréchet Distance on Low-Density Spanners
par: Buchin, Kevin, et autres
Publié: (2024)

A dynamic $(1+\varepsilon)$-spanner for disk intersection graphs
par: de Berg, Sarita, et autres
Publié: (2026)

Smallest Enclosing Disk Queries Using Farthest-Point Voronoi Diagrams
par: Buchin, Kevin, et autres
Publié: (2026)

Property Testing of Curve Similarity
par: Afshani, Peyman, et autres
Publié: (2025)

Morphing Planar Graph Drawings Through 3D
par: Buchin, Kevin, et autres
Publié: (2022)

Computing Planar Convex Hulls with a Promise
par: Aghamolaei, Sepideh, et autres
Publié: (2026)

Performance bounds for nearest neighbor search with k-d trees
par: Bazzani, Marco, et autres
Publié: (2026)

Online Geometric Covering and Piercing
par: De, Minati, et autres
Publié: (2023)

Saturated Drawings of Geometric Thickness k
par: Bachmann, Patricia, et autres
Publié: (2025)

Minimum spanning blob-trees
par: Klost, Katharina, et autres
Publié: (2025)

New parallelism and heuristic approaches for generating tree t‐spanners in graphs
par: Luís Cunha, et autres
Publié: (2024)

Geometric Bipartite Matching is in NC
par: Bhore, Sujoy, et autres
Publié: (2024)

Pathways to Tractability for Geometric Thickness
par: Depian, Thomas, et autres
Publié: (2024)

Fully Dynamic Geometric Vertex Cover and Matching
par: Bhore, Sujoy, et autres
Publié: (2024)

Approximating Densest Subgraph in Geometric Intersection Graphs
par: Har-Peled, Sariel, et autres
Publié: (2024)

On Stable Approximation Algorithms for Geometric Coverage Problems
par: de Berg, Mark, et autres
Publié: (2024)

Robust Geometric Predicates for Bivariate Computational Topology
par: Hristov, Petar, et autres
Publié: (2025)

Fast and simple multiplication of bounded twin-width matrices
par: Kozma, László, et autres
Publié: (2026)

The Parameterized Complexity of Geometric 1-Planarity
par: Firbas, Alexander
Publié: (2026)

Dynamic Geometric Connectivity in the Plane with Constant Query Time
par: Chan, Timothy M., et autres
Publié: (2024)

Minimum Membership Geometric Set Cover in the Continuous Setting
par: Govindarajan, Sathish, et autres
Publié: (2025)

Swept Volume Computation with Enhanced Geometric Detail Preservation
par: Wang, Pengfei, et autres
Publié: (2025)

Approximation Schemes for Geometric Knapsack for Packing Spheres and Fat Objects
par: Acharya, Pritam, et autres
Publié: (2024)

Metric and Geometric Spanners that are Resilient to Degree-Bounded Edge Faults
par: Biniaz, Ahmad, et autres
Publié: (2024)

Geometric Bipartite Matching Based Exact Algorithms for Server Problems
par: Raghvendra, Sharath, et autres
Publié: (2025)

Further Results on Rendering Geometric Intersection Graphs Sparse by Dispersion
par: Honorato-Droguett, Nicolás, et autres
Publié: (2025)

High-Order Continuous Geometrical Validity
par: Sichetti, Federico, et autres
Publié: (2024)