Saved in:
| Main Authors: | Biniaz, Ahmad, De Carufel, Jean-Lou, Maheshwari, Anil, Smid, Michiel, Smorodinsky, Shakhar, Stojaković, Miloš |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2503.22449 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Metric and Geometric Spanners that are Resilient to Degree-Bounded Edge Faults
by: Biniaz, Ahmad, et al.
Published: (2024)
by: Biniaz, Ahmad, et al.
Published: (2024)
Euclidean Maximum Matchings in the Plane---Local to Global
by: Biniaz, Ahmad, et al.
Published: (2024)
by: Biniaz, Ahmad, et al.
Published: (2024)
On Separating Path and Tree Systems in Graphs
by: Biniaz, Ahmad, et al.
Published: (2023)
by: Biniaz, Ahmad, et al.
Published: (2023)
Tight Bounds on the Number of Closest Pairs in Vertical Slabs
by: Biniaz, Ahmad, et al.
Published: (2025)
by: Biniaz, Ahmad, et al.
Published: (2025)
Noncrossing Longest Paths and Cycles
by: Aloupis, Greg, et al.
Published: (2024)
by: Aloupis, Greg, et al.
Published: (2024)
A survey of Zarankiewicz problems in geometry
by: Smorodinsky, Shakhar
Published: (2024)
by: Smorodinsky, Shakhar
Published: (2024)
Computing shortest paths amid non-overlapping weighted disks
by: Bose, Prosenjit, et al.
Published: (2024)
by: Bose, Prosenjit, et al.
Published: (2024)
Linear-Time $(1+\varepsilon)$-Approximation Algorithms for Two-Line-Center Problems
by: Chung, Chaeyoon, et al.
Published: (2026)
by: Chung, Chaeyoon, et al.
Published: (2026)
On Zarankiewicz's Problem for Intersection Hypergraphs of Geometric Objects
by: Chan, Timothy M., et al.
Published: (2024)
by: Chan, Timothy M., et al.
Published: (2024)
New Sufficient Conditions for Linear-Sized Epsilon-Nets and $(p,2)$-Theorems
by: Keller, Chaya, et al.
Published: (2025)
by: Keller, Chaya, et al.
Published: (2025)
Extended VC-dimension, and Radon and Tverberg type theorems for unions of convex sets
by: Alon, Noga, et al.
Published: (2025)
by: Alon, Noga, et al.
Published: (2025)
Zarankiewicz's problem via $ε$-t-nets
by: Keller, Chaya, et al.
Published: (2023)
by: Keller, Chaya, et al.
Published: (2023)
An Improved Bound for Plane Covering Paths
by: Akitaya, Hugo A., et al.
Published: (2025)
by: Akitaya, Hugo A., et al.
Published: (2025)
Deciding if a DAG is Interesting is Hard
by: De Carufel, Jean-Lou, et al.
Published: (2025)
by: De Carufel, Jean-Lou, et al.
Published: (2025)
Contiguous Boundary Guarding
by: Biniaz, Ahmad, et al.
Published: (2024)
by: Biniaz, Ahmad, et al.
Published: (2024)
Tight Routing and Spanning Ratios of Arbitrary Triangle Delaunay Graphs
by: Bose, Prosenjit, et al.
Published: (2025)
by: Bose, Prosenjit, et al.
Published: (2025)
The Exact Spanning Ratio of the Parallelogram Delaunay Graph
by: Bose, Prosenjit, et al.
Published: (2023)
by: Bose, Prosenjit, et al.
Published: (2023)
Computing Oriented Spanners and their Dilation
by: Buchin, Kevin, et al.
Published: (2024)
by: Buchin, Kevin, et al.
Published: (2024)
The $ε$-$t$-Net Problem
by: Alon, Noga, et al.
Published: (2020)
by: Alon, Noga, et al.
Published: (2020)
Sparse Bounded Hop-Spanners for Geometric Intersection Graphs
by: Bhore, Sujoy, et al.
Published: (2025)
by: Bhore, Sujoy, et al.
Published: (2025)
The Nesting Bird Box Problem is ER-complete: Sharp Hardness Results for the Hidden Set Problem
by: Meijer, Lucas, et al.
Published: (2026)
by: Meijer, Lucas, et al.
Published: (2026)
Online Class Cover Problem
by: De, Minati, et al.
Published: (2023)
by: De, Minati, et al.
Published: (2023)
The Spanning Ratio of the Directed $Θ_6$-Graph is 5
by: Bose, Prosenjit, et al.
Published: (2026)
by: Bose, Prosenjit, et al.
Published: (2026)
Approximation and Hardness of Polychromatic TSP
by: Schibler, Thomas, et al.
Published: (2025)
by: Schibler, Thomas, et al.
Published: (2025)
On Multicolour Ramsey Numbers and Subset-Colouring of Hypergraphs
by: Jartoux, Bruno, et al.
Published: (2021)
by: Jartoux, Bruno, et al.
Published: (2021)
Optimizing Symbol Visibility through Displacement
by: Gärtner, Bernd, et al.
Published: (2023)
by: Gärtner, Bernd, et al.
Published: (2023)
On 1-Planar Graphs with Bounded Cop-Number
by: Bose, Prosenjit, et al.
Published: (2024)
by: Bose, Prosenjit, et al.
Published: (2024)
On conflict-free colorings of cyclic polytopes and the girth conjecture for graphs
by: Lee, Seunghun, et al.
Published: (2024)
by: Lee, Seunghun, et al.
Published: (2024)
Completely Independent Steiner Trees
by: Maheshwari, Anil, et al.
Published: (2026)
by: Maheshwari, Anil, et al.
Published: (2026)
Minimum Plane Bichromatic Spanning Trees
by: Akitaya, Hugo A., et al.
Published: (2024)
by: Akitaya, Hugo A., et al.
Published: (2024)
Partial Domination in Some Geometric Intersection Graphs and Some Complexity Results
by: Dutta, Madhura, et al.
Published: (2025)
by: Dutta, Madhura, et al.
Published: (2025)
Coloring Geometric Hypergraphs: A Survey
by: Damásdi, Gábor, et al.
Published: (2025)
by: Damásdi, Gábor, et al.
Published: (2025)
So Long Sucker: Endgame Analysis
by: De Carufel, Jean-Lou, et al.
Published: (2024)
by: De Carufel, Jean-Lou, et al.
Published: (2024)
On strong avoiding games
by: Stojaković, Miloš, et al.
Published: (2022)
by: Stojaković, Miloš, et al.
Published: (2022)
Identifiability of Points and Rigidity of Hypergraphs under Algebraic Constraints
by: Cruickshank, James, et al.
Published: (2023)
by: Cruickshank, James, et al.
Published: (2023)
Conflict-Free Colouring of Subsets
by: Jartoux, Bruno, et al.
Published: (2022)
by: Jartoux, Bruno, et al.
Published: (2022)
New Complexity and Algorithmic Bounds for Minimum Consistent Subsets
by: Banik, Aritra, et al.
Published: (2024)
by: Banik, Aritra, et al.
Published: (2024)
Hypergraphs as Metro Maps: Drawing Paths with Few Bends in Trees, Cacti, and Plane 4-Graphs
by: Cornelsen, Sabine, et al.
Published: (2025)
by: Cornelsen, Sabine, et al.
Published: (2025)
Computation of symmetries of rational surfaces
by: Alcázar, Juan Juan Gerardo, et al.
Published: (2024)
by: Alcázar, Juan Juan Gerardo, et al.
Published: (2024)
On the Multi-Robber Damage Number
by: Stojaković, Miloš, et al.
Published: (2022)
by: Stojaković, Miloš, et al.
Published: (2022)
Similar Items
-
Metric and Geometric Spanners that are Resilient to Degree-Bounded Edge Faults
by: Biniaz, Ahmad, et al.
Published: (2024) -
Euclidean Maximum Matchings in the Plane---Local to Global
by: Biniaz, Ahmad, et al.
Published: (2024) -
On Separating Path and Tree Systems in Graphs
by: Biniaz, Ahmad, et al.
Published: (2023) -
Tight Bounds on the Number of Closest Pairs in Vertical Slabs
by: Biniaz, Ahmad, et al.
Published: (2025) -
Noncrossing Longest Paths and Cycles
by: Aloupis, Greg, et al.
Published: (2024)