Image de couverture de livre

Algorithms for Distance Problems in Continuous Graphs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Cabello, Sergio, Garijo, Delia, Kalb, Antonia, Klute, Fabian, Parada, Irene, Silveira, Rodrigo I.
Format:	Preprint
Publié:	2025
Sujets:	Computational Geometry Data Structures and Algorithms F.2
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Computing crossing numbers with topological and geometric restrictions
par: Hamm, Thekla, et autres
Publié: (2024)

Maximum Matchings in Geometric Intersection Graphs
par: Bonnet, Édouard, et autres
Publié: (2019)

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems
par: Gálvez, Waldo, et autres
Publié: (2025)

A Framework for Algorithm Stability
par: Meulemans, Wouter, et autres
Publié: (2017)

Structure and Independence in Hyperbolic Uniform Disk Graphs
par: Bläsius, Thomas, et autres
Publié: (2024)

A Deterministic Bicriteria Approximation Algorithm for the Art Gallery Problem
par: Elbassioni, Khaled
Publié: (2025)

Single-Source Shortest Paths and Almost Exact Diameter in Pseudodisk Graphs
par: de Berg, Mark, et autres
Publié: (2026)

Improved Algorithms for Distance Selection and Related Problems
par: Wang, Haitao, et autres
Publié: (2023)

Line Cover and Related Problems
par: Bentert, Matthias, et autres
Publié: (2025)

A Tight Subexponential-time Algorithm for Two-Page Book Embedding
par: Ganian, Robert, et autres
Publié: (2024)

Towards a Unified Theory of Light Spanners I: Fast (Yet Optimal) Constructions
par: Le, Hung, et autres
Publié: (2021)

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

Maximum Polygon Packing: The CG:SHOP Challenge 2024
par: Fekete, Sándor P., et autres
Publié: (2024)

Minimum Non-Obtuse Triangulations: The CG:SHOP Challenge 2025
par: Fekete, Sándor P., et autres
Publié: (2025)

Optimal Window Queries on Line Segments using the Trapezoidal Search DAG
par: Brankovic, Milutin, et autres
Publié: (2021)

Online Maximum Independent Set of Hyperrectangles
par: Advani, Rishi, et autres
Publié: (2023)

Approximating the Maximum Independent Set of Convex Polygons with a Bounded Number of Directions
par: Grandoni, Fabrizio, et autres
Publié: (2024)

Approximating Multiplicatively Weighted Voronoi Diagrams: Efficient Construction with Linear Size
par: Gudmundsson, Joachim, et autres
Publié: (2021)

Coordinated Motion Planning is FPT on Discretized Simple Polygons
par: Deligkas, Argyrios, et autres
Publié: (2026)

Guarding Polyominoes Under $k$-Hop Visibility
par: Filtser, Omrit, et autres
Publié: (2023)

Sliding Squares in Parallel
par: Akitaya, Hugo A., et autres
Publié: (2024)

A Tail Estimate with Exponential Decay for the Randomized Incremental Construction of Search Structures
par: Gudmundsson, Joachim, et autres
Publié: (2021)

Guarding Offices with Maximum Dispersion
par: Fekete, Sándor P., et autres
Publié: (2025)

Central Triangulation under Parallel Flip Operations: The CG:SHOP Challenge 2026
par: Aichholzer, Oswin, et autres
Publié: (2026)

Coordinated Motion Planning: Multi-Agent Path Finding in a Densely Packed, Bounded Domain
par: Fekete, Sándor P., et autres
Publié: (2024)

Planar Network Diversion
par: Bentert, Matthias, et autres
Publié: (2025)

Robust Algorithms for Path and Cycle Problems in Geometric Intersection Graphs
par: Marin, Malory, et autres
Publié: (2025)

The Voronoi Diagram of Weakly Smooth Planar Point Sets in $O(\log n)$ Deterministic Rounds on the Congested Clique
par: Jansson, Jesper, et autres
Publié: (2024)

Even Faster Algorithm for the Chamfer Distance
par: Feng, Ying, et autres
Publié: (2025)

Quantum Speedup for Some Geometric 3SUM-Hard Problems and Beyond
par: Keil, J. Mark, et autres
Publié: (2024)

Efficiently Reconfiguring a Connected Swarm of Labeled Robots
par: Fekete, Sándor P., et autres
Publié: (2022)

Efficient Reconfiguration of Tile Arrangements by a Single Active Robot
par: Becker, Aaron T., et autres
Publié: (2025)

An Algorithmic Bridge Between Hamming and Levenshtein Distances
par: Goldenberg, Elazar, et autres
Publié: (2022)

On the Complexity of the Ordered Covering Problem in Distance Geometry
par: Souza, Michael, et autres
Publié: (2025)

Delaunay Triangulations with Predictions
par: Cabello, Sergio, et autres
Publié: (2026)

Truly Subquadratic Time Algorithms for Diameter and Related Problems in Graphs of Bounded VC-dimension
par: Chan, Timothy M., et autres
Publié: (2025)

Computing largest minimum color-spanning intervals of imprecise points
par: Acharyya, Ankush, et autres
Publié: (2024)

The Complexity of Geodesic Spanners using Steiner Points
par: de Berg, Sarita, et autres
Publié: (2024)

Finding a Largest-Area Triangle in a Terrain in Near-Linear Time
par: Cabello, Sergio, et autres
Publié: (2021)

An Algorithm for a Variation of the Shortest Common Superstring Problem
par: Gilfanov, Arthur
Publié: (2024)