Structure and Independence in Hyperbolic Uniform Disk Graphs
Fuente:
arXiv
Saved in:
| Main Authors: | Bläsius, Thomas, von der Heydt, Jean-Pierre, Kisfaludi-Bak, Sándor, Wilhelm, Marcus, van Wordragen, Geert |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Approximation Schemes for Subset TSP and Steiner Tree on Geometric Intersection Graphs
by: Kisfaludi-Bak, Sándor, et al.
Published: (2026)
by: Kisfaludi-Bak, Sándor, et al.
Published: (2026)
Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs
by: de Berg, Mark, et al.
Published: (2026)
by: de Berg, Mark, et al.
Published: (2026)
A Quadtree, a Steiner Spanner, and Approximate Nearest Neighbours in Hyperbolic Space
by: Kisfaludi-Bak, Sándor, et al.
Published: (2023)
by: Kisfaludi-Bak, Sándor, et al.
Published: (2023)
Maximum Polygon Packing: The CG:SHOP Challenge 2024
by: Fekete, Sándor P., et al.
Published: (2024)
by: Fekete, Sándor P., et al.
Published: (2024)
Minimum Non-Obtuse Triangulations: The CG:SHOP Challenge 2025
by: Fekete, Sándor P., et al.
Published: (2025)
by: Fekete, Sándor P., et al.
Published: (2025)
Online Maximum Independent Set of Hyperrectangles
by: Advani, Rishi, et al.
Published: (2023)
by: Advani, Rishi, et al.
Published: (2023)
Smallest Enclosing Disk Queries Using Farthest-Point Voronoi Diagrams
by: Buchin, Kevin, et al.
Published: (2026)
by: Buchin, Kevin, et al.
Published: (2026)
Central Triangulation under Parallel Flip Operations: The CG:SHOP Challenge 2026
by: Aichholzer, Oswin, et al.
Published: (2026)
by: Aichholzer, Oswin, et al.
Published: (2026)
Coordinated Motion Planning: Multi-Agent Path Finding in a Densely Packed, Bounded Domain
by: Fekete, Sándor P., et al.
Published: (2024)
by: Fekete, Sándor P., et al.
Published: (2024)
Guarding Offices with Maximum Dispersion
by: Fekete, Sándor P., et al.
Published: (2025)
by: Fekete, Sándor P., et al.
Published: (2025)
Approximating the Maximum Independent Set of Convex Polygons with a Bounded Number of Directions
by: Grandoni, Fabrizio, et al.
Published: (2024)
by: Grandoni, Fabrizio, et al.
Published: (2024)
Sliding Squares in Parallel
by: Akitaya, Hugo A., et al.
Published: (2024)
by: Akitaya, Hugo A., et al.
Published: (2024)
Efficiently Reconfiguring a Connected Swarm of Labeled Robots
by: Fekete, Sándor P., et al.
Published: (2022)
by: Fekete, Sándor P., et al.
Published: (2022)
Customizable Contraction Hierarchies -- A Survey
by: Bläsius, Thomas, et al.
Published: (2025)
by: Bläsius, Thomas, et al.
Published: (2025)
Near-Optimal Dynamic Steiner Spanners for Constant-Curvature Spaces
by: Kisfaludi-Bak, Sándor, et al.
Published: (2025)
by: Kisfaludi-Bak, Sándor, et al.
Published: (2025)
A Gap-ETH-Tight Approximation Scheme for Euclidean TSP
by: Kisfaludi-Bak, Sándor, et al.
Published: (2020)
by: Kisfaludi-Bak, Sándor, et al.
Published: (2020)
Single-Source Shortest Paths and Almost Exact Diameter in Pseudodisk Graphs
by: de Berg, Mark, et al.
Published: (2026)
by: de Berg, Mark, et al.
Published: (2026)
Efficient Reconfiguration of Tile Arrangements by a Single Active Robot
by: Becker, Aaron T., et al.
Published: (2025)
by: Becker, Aaron T., et al.
Published: (2025)
A Tail Estimate with Exponential Decay for the Randomized Incremental Construction of Search Structures
by: Gudmundsson, Joachim, et al.
Published: (2021)
by: Gudmundsson, Joachim, et al.
Published: (2021)
Shortest Paths, Convexity, and Treewidth in Regular Hyperbolic Tilings
by: Kisfaludi-Bak, Sándor, et al.
Published: (2025)
by: Kisfaludi-Bak, Sándor, et al.
Published: (2025)
Protecting the Connectivity of a Graph Under Non-Uniform Edge Failures
by: Hommelsheim, Felix, et al.
Published: (2025)
by: Hommelsheim, Felix, et al.
Published: (2025)
Approximating the Average-Case Graph Search Problem with Non-Uniform Costs
by: Szyfelbein, Michał
Published: (2025)
by: Szyfelbein, Michał
Published: (2025)
Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the $Ω(\log n)$ Lightness Barrier
by: Le, Hung, et al.
Published: (2023)
by: Le, Hung, et al.
Published: (2023)
The Voronoi Diagram of Weakly Smooth Planar Point Sets in $O(\log n)$ Deterministic Rounds on the Congested Clique
by: Jansson, Jesper, et al.
Published: (2024)
by: Jansson, Jesper, et al.
Published: (2024)
The Constrained Layer Tree Problem and Applications to Solar Farm Cabling
by: Bläsius, Thomas, et al.
Published: (2024)
by: Bläsius, Thomas, et al.
Published: (2024)
Towards a Unified Theory of Light Spanners I: Fast (Yet Optimal) Constructions
by: Le, Hung, et al.
Published: (2021)
by: Le, Hung, et al.
Published: (2021)
Optimal Window Queries on Line Segments using the Trapezoidal Search DAG
by: Brankovic, Milutin, et al.
Published: (2021)
by: Brankovic, Milutin, et al.
Published: (2021)
Approximating Multiplicatively Weighted Voronoi Diagrams: Efficient Construction with Linear Size
by: Gudmundsson, Joachim, et al.
Published: (2021)
by: Gudmundsson, Joachim, et al.
Published: (2021)
Coordinated Motion Planning is FPT on Discretized Simple Polygons
by: Deligkas, Argyrios, et al.
Published: (2026)
by: Deligkas, Argyrios, et al.
Published: (2026)
Guarding Polyominoes Under $k$-Hop Visibility
by: Filtser, Omrit, et al.
Published: (2023)
by: Filtser, Omrit, et al.
Published: (2023)
A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems
by: Gálvez, Waldo, et al.
Published: (2025)
by: Gálvez, Waldo, et al.
Published: (2025)
A Framework for Algorithm Stability
by: Meulemans, Wouter, et al.
Published: (2017)
by: Meulemans, Wouter, et al.
Published: (2017)
Planar Network Diversion
by: Bentert, Matthias, et al.
Published: (2025)
by: Bentert, Matthias, et al.
Published: (2025)
Gap-ETH-Tight Algorithms for Hyperbolic TSP and Steiner Tree
by: Kisfaludi-Bak, Sándor, et al.
Published: (2026)
by: Kisfaludi-Bak, Sándor, et al.
Published: (2026)
Charting the Diameter Computation Landscape of Geometric Intersection Graphs in Three Dimensions and Higher
by: Chan, Timothy M., et al.
Published: (2026)
by: Chan, Timothy M., et al.
Published: (2026)
Truly Subquadratic Time Algorithms for Diameter and Related Problems in Graphs of Bounded VC-dimension
by: Chan, Timothy M., et al.
Published: (2025)
by: Chan, Timothy M., et al.
Published: (2025)
On Hardness and Approximation of Broadcasting in Structured Graphs
by: Bringolf, Jeffrey, et al.
Published: (2025)
by: Bringolf, Jeffrey, et al.
Published: (2025)
Maximum Matchings in Geometric Intersection Graphs
by: Bonnet, Édouard, et al.
Published: (2019)
by: Bonnet, Édouard, et al.
Published: (2019)
Touring a Sequence of Orthogonal Polygons
by: Casel, Katrin, et al.
Published: (2026)
by: Casel, Katrin, et al.
Published: (2026)
An O(log n)-Approximation Algorithm for (p,q)-Flexible Graph Connectivity via Independent Rounding
by: Ibrahimpur, Sharat, et al.
Published: (2025)
by: Ibrahimpur, Sharat, et al.
Published: (2025)
Similar Items
-
Approximation Schemes for Subset TSP and Steiner Tree on Geometric Intersection Graphs
by: Kisfaludi-Bak, Sándor, et al.
Published: (2026) -
Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs
by: de Berg, Mark, et al.
Published: (2026) -
A Quadtree, a Steiner Spanner, and Approximate Nearest Neighbours in Hyperbolic Space
by: Kisfaludi-Bak, Sándor, et al.
Published: (2023) -
Maximum Polygon Packing: The CG:SHOP Challenge 2024
by: Fekete, Sándor P., et al.
Published: (2024) -
Minimum Non-Obtuse Triangulations: The CG:SHOP Challenge 2025
by: Fekete, Sándor P., et al.
Published: (2025)