Imagen de Portada

Algorithms for Distance Problems in Continuous Graphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Cabello, Sergio, Garijo, Delia, Kalb, Antonia, Klute, Fabian, Parada, Irene, Silveira, Rodrigo I.
Formato:	Preprint
Publicado:	2025
Materias:	Computational Geometry Data Structures and Algorithms F.2
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Computing crossing numbers with topological and geometric restrictions
por: Hamm, Thekla, et al.
Publicado: (2024)

Maximum Matchings in Geometric Intersection Graphs
por: Bonnet, Édouard, et al.
Publicado: (2019)

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems
por: Gálvez, Waldo, et al.
Publicado: (2025)

A Framework for Algorithm Stability
por: Meulemans, Wouter, et al.
Publicado: (2017)

Structure and Independence in Hyperbolic Uniform Disk Graphs
por: Bläsius, Thomas, et al.
Publicado: (2024)

A Deterministic Bicriteria Approximation Algorithm for the Art Gallery Problem
por: Elbassioni, Khaled
Publicado: (2025)

Single-Source Shortest Paths and Almost Exact Diameter in Pseudodisk Graphs
por: de Berg, Mark, et al.
Publicado: (2026)

Improved Algorithms for Distance Selection and Related Problems
por: Wang, Haitao, et al.
Publicado: (2023)

Line Cover and Related Problems
por: Bentert, Matthias, et al.
Publicado: (2025)

A Tight Subexponential-time Algorithm for Two-Page Book Embedding
por: Ganian, Robert, et al.
Publicado: (2024)

Towards a Unified Theory of Light Spanners I: Fast (Yet Optimal) Constructions
por: Le, Hung, et al.
Publicado: (2021)

Smallest Enclosing Disk Queries Using Farthest-Point Voronoi Diagrams
por: Buchin, Kevin, et al.
Publicado: (2026)

Maximum Polygon Packing: The CG:SHOP Challenge 2024
por: Fekete, Sándor P., et al.
Publicado: (2024)

Minimum Non-Obtuse Triangulations: The CG:SHOP Challenge 2025
por: Fekete, Sándor P., et al.
Publicado: (2025)

Optimal Window Queries on Line Segments using the Trapezoidal Search DAG
por: Brankovic, Milutin, et al.
Publicado: (2021)

Online Maximum Independent Set of Hyperrectangles
por: Advani, Rishi, et al.
Publicado: (2023)

Approximating the Maximum Independent Set of Convex Polygons with a Bounded Number of Directions
por: Grandoni, Fabrizio, et al.
Publicado: (2024)

Approximating Multiplicatively Weighted Voronoi Diagrams: Efficient Construction with Linear Size
por: Gudmundsson, Joachim, et al.
Publicado: (2021)

Coordinated Motion Planning is FPT on Discretized Simple Polygons
por: Deligkas, Argyrios, et al.
Publicado: (2026)

Guarding Polyominoes Under $k$-Hop Visibility
por: Filtser, Omrit, et al.
Publicado: (2023)

Sliding Squares in Parallel
por: Akitaya, Hugo A., et al.
Publicado: (2024)

A Tail Estimate with Exponential Decay for the Randomized Incremental Construction of Search Structures
por: Gudmundsson, Joachim, et al.
Publicado: (2021)

Guarding Offices with Maximum Dispersion
por: Fekete, Sándor P., et al.
Publicado: (2025)

Central Triangulation under Parallel Flip Operations: The CG:SHOP Challenge 2026
por: Aichholzer, Oswin, et al.
Publicado: (2026)

Coordinated Motion Planning: Multi-Agent Path Finding in a Densely Packed, Bounded Domain
por: Fekete, Sándor P., et al.
Publicado: (2024)

Planar Network Diversion
por: Bentert, Matthias, et al.
Publicado: (2025)

Robust Algorithms for Path and Cycle Problems in Geometric Intersection Graphs
por: Marin, Malory, et al.
Publicado: (2025)

The Voronoi Diagram of Weakly Smooth Planar Point Sets in $O(\log n)$ Deterministic Rounds on the Congested Clique
por: Jansson, Jesper, et al.
Publicado: (2024)

Even Faster Algorithm for the Chamfer Distance
por: Feng, Ying, et al.
Publicado: (2025)

Quantum Speedup for Some Geometric 3SUM-Hard Problems and Beyond
por: Keil, J. Mark, et al.
Publicado: (2024)

Efficiently Reconfiguring a Connected Swarm of Labeled Robots
por: Fekete, Sándor P., et al.
Publicado: (2022)

Efficient Reconfiguration of Tile Arrangements by a Single Active Robot
por: Becker, Aaron T., et al.
Publicado: (2025)

An Algorithmic Bridge Between Hamming and Levenshtein Distances
por: Goldenberg, Elazar, et al.
Publicado: (2022)

On the Complexity of the Ordered Covering Problem in Distance Geometry
por: Souza, Michael, et al.
Publicado: (2025)

Delaunay Triangulations with Predictions
por: Cabello, Sergio, et al.
Publicado: (2026)

Truly Subquadratic Time Algorithms for Diameter and Related Problems in Graphs of Bounded VC-dimension
por: Chan, Timothy M., et al.
Publicado: (2025)

Computing largest minimum color-spanning intervals of imprecise points
por: Acharyya, Ankush, et al.
Publicado: (2024)

The Complexity of Geodesic Spanners using Steiner Points
por: de Berg, Sarita, et al.
Publicado: (2024)

Finding a Largest-Area Triangle in a Terrain in Near-Linear Time
por: Cabello, Sergio, et al.
Publicado: (2021)

An Algorithm for a Variation of the Shortest Common Superstring Problem
por: Gilfanov, Arthur
Publicado: (2024)