Cover Image

An Improved Bound for Plane Covering Paths

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Akitaya, Hugo A., Aloupis, Greg, Biniaz, Ahmad, Bose, Prosenjit, De Carufel, Jean-Lou, Gavoille, Cyril, Iacono, John, Kleist, Linda, Smid, Michiel, Souvaine, Diane, Theocharous, Leonidas
Format:	Preprint
Published:	2025
Subjects:	Computational Geometry
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Noncrossing Longest Paths and Cycles
by: Aloupis, Greg, et al.
Published: (2024)

Metric and Geometric Spanners that are Resilient to Degree-Bounded Edge Faults
by: Biniaz, Ahmad, et al.
Published: (2024)

Tight Bounds on the Number of Closest Pairs in Vertical Slabs
by: Biniaz, Ahmad, et al.
Published: (2025)

On Separating Path and Tree Systems in Graphs
by: Biniaz, Ahmad, et al.
Published: (2023)

Euclidean Maximum Matchings in the Plane---Local to Global
by: Biniaz, Ahmad, et al.
Published: (2024)

Minimum Plane Bichromatic Spanning Trees
by: Akitaya, Hugo A., et al.
Published: (2024)

On the Doubling Dimension and the Perimeter of Geodesically Convex Sets in Fat Polygons
by: de Berg, Mark, et al.
Published: (2026)

Polychromatic Coloring of Tuples in Hypergraphs
by: Biniaz, Ahmad, et al.
Published: (2025)

On 1-Planar Graphs with Bounded Cop-Number
by: Bose, Prosenjit, et al.
Published: (2024)

Tight Routing and Spanning Ratios of Arbitrary Triangle Delaunay Graphs
by: Bose, Prosenjit, et al.
Published: (2025)

The Exact Spanning Ratio of the Parallelogram Delaunay Graph
by: Bose, Prosenjit, et al.
Published: (2023)

The Spanning Ratio of the Directed $Θ_6$-Graph is 5
by: Bose, Prosenjit, et al.
Published: (2026)

Computing shortest paths amid non-overlapping weighted disks
by: Bose, Prosenjit, et al.
Published: (2024)

Lower Bounds for Induced-Universal Graphs
by: Gavoille, Cyril, et al.
Published: (2025)

On the Connectivity of the Flip Graph of Plane Spanning Paths
by: Kleist, Linda, et al.
Published: (2024)

Facet-Hamiltonicity
by: Akitaya, Hugo, et al.
Published: (2024)

Deciding if a DAG is Interesting is Hard
by: De Carufel, Jean-Lou, et al.
Published: (2025)

Realizing Metric Spaces with Convex Obstacles
by: Kisfaludi-Bak, Sándor, et al.
Published: (2025)

A Coreset for Approximate Furthest-Neighbor Queries in a Simple Polygon
by: de Berg, Mark, et al.
Published: (2024)

A Clique-Based Separator for Intersection Graphs of Geodesic Disks in $\mathbb{R}^2$
by: Aronov, Boris, et al.
Published: (2024)

Isometric-Universal Graphs for Trees
by: Baucher, Edgar, et al.
Published: (2025)

Augmenting Plane Straight-Line Graphs to Meet Parity Constraints
by: Christiansen, Aleksander Bjørn Grodt, et al.
Published: (2025)

The Price of Connectivity Augmentation on Planar Graphs
by: Akitaya, Hugo A., et al.
Published: (2025)

Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors
by: Bonamy, Marthe, et al.
Published: (2025)

Distributed Approximation Algorithms for Minimum Dominating Set in Locally Nice Graphs
by: Bonamy, Marthe, et al.
Published: (2025)

Freeze-Tag in $L_1$ has Wake-up Time Five
by: Bonichon, Nicolas, et al.
Published: (2024)

So Long Sucker: Endgame Analysis
by: De Carufel, Jean-Lou, et al.
Published: (2024)

Cops and Robbers for Graphs on Surfaces with Crossings
by: Bose, Prosenjit, et al.
Published: (2025)

Computing Vertex and Edge Connectivity of Graphs Embedded with Crossings
by: Biedl, Therese, et al.
Published: (2024)

On the $d$-independence number in 1-planar graphs
by: Biedl, Therese, et al.
Published: (2024)

Computational aspects of disks enclosing many points
by: Bose, Prosenjit, et al.
Published: (2026)

Distributed Freeze Tag: a Sustainable Solution to Discover and Wake-up a Robot Swarm
by: Gavoille, Cyril, et al.
Published: (2025)

Clustering with Few Disks to Minimize the Sum of Radii
by: Abrahamsen, Mikkel, et al.
Published: (2023)

Completely Independent Steiner Trees
by: Maheshwari, Anil, et al.
Published: (2026)

Linear-Time $(1+\varepsilon)$-Approximation Algorithms for Two-Line-Center Problems
by: Chung, Chaeyoon, et al.
Published: (2026)

Flip Distance of Non-Crossing Spanning Trees: NP-Hardness and Improved Bounds
by: Bjerkevik, Håvard Bakke, et al.
Published: (2026)

Approximating the Smallest $k$-Enclosing Geodesic Disc in a Simple Polygon
by: Bose, Prosenjit, et al.
Published: (2024)

Input-Sensitive Reconfiguration of Sliding Cubes
by: Akitaya, Hugo, et al.
Published: (2025)

Gaussian Processes with Sample Paths in Reproducing Kernel Banach Spaces
by: Karvonen, Toni, et al.
Published: (2026)

Online Packing of Orthogonal Polygons
by: Gerlach, Tim, et al.
Published: (2026)