Imagen de Portada

Revisiting Graph Modification via Disk Scaling: From One Radius to Interval-Based Radii

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Depian, Thomas, Sommer, Frank
Formato:	Preprint
Publicado:	2026
Materias:	Computational Geometry Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Parameterized Geometric Graph Modification with Disk Scaling
por: Fomin, Fedor V., et al.
Publicado: (2024)

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms
por: Depian, Thomas, et al.
Publicado: (2025)

The Peculiarities of Extending Queue Layouts
por: Depian, Thomas, et al.
Publicado: (2025)

The Parameterized Complexity of Extending Stack Layouts
por: Depian, Thomas, et al.
Publicado: (2024)

Visualizing Treewidth
por: Chiu, Alvin, et al.
Publicado: (2025)

Maximum Independent Sets in Disk Graphs with Disks in Convex Position
por: Tkachenko, Anastasiia, et al.
Publicado: (2026)

FPT Constant Approximation Algorithms for Colorful Sum of Radii
por: Liu, Shuilian, et al.
Publicado: (2025)

Dynamic Connectivity in Disk Graphs
por: Baumann, Alexander, et al.
Publicado: (2021)

FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii
por: Bandyapadhyay, Sayan, et al.
Publicado: (2023)

Computing Maximum Cliques in Unit Disk Graphs
por: Tkachenko, Anastasiia, et al.
Publicado: (2025)

Shortest Path Separators in Unit Disk Graphs
por: Harb, Elfarouk, et al.
Publicado: (2024)

FPT Approximation Schemes for Min-Sum Radii and Min-Sum Diameters Clustering
por: Grandoni, Fabrizio, et al.
Publicado: (2026)

An Optimal Algorithm for Shortest Paths in Unweighted Disk Graphs
por: Brewer, Bruce W., et al.
Publicado: (2025)

Computing Dominating Sets in Disk Graphs with Centers in Convex Position
por: Tkachenko, Anastasiia, et al.
Publicado: (2026)

Single-Source Shortest Path Problem in Weighted Disk Graphs
por: An, Shinwoo, et al.
Publicado: (2025)

An Improved Algorithm for Shortest Paths in Weighted Unit-Disk Graphs
por: Brewer, Bruce W., et al.
Publicado: (2024)

ETH-Tight Algorithm for Cycle Packing on Unit Disk Graphs
por: An, Shinwoo, et al.
Publicado: (2024)

Computing Diameter +1 in Truly Subquadratic Time for Unit-Disk Graphs
por: Chang, Hsien-Chih, et al.
Publicado: (2024)

Subexponential Algorithms for Clique Cover on Unit Disk and Unit Ball Graphs
por: Koana, Tomohiro, et al.
Publicado: (2024)

Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3
por: Lokshtanov, Daniel, et al.
Publicado: (2024)

Subcoloring of (Unit) Disk Graphs
por: Marin, Malory, et al.
Publicado: (2025)

Top-k Stabbing Interval Queries
por: Akram, Waseem, et al.
Publicado: (2024)

Dynamic Unit-Disk Range Reporting
por: Wang, Haitao, et al.
Publicado: (2024)

Faster Algorithms for Reverse Shortest Path in Unit-Disk Graphs and Related Geometric Optimization Problems: Improving the Shrink-and-Bifurcate Technique
por: Chan, Timothy M., et al.
Publicado: (2025)

On the Line-Separable Unit-Disk Coverage and Related Problems
por: Liu, Gang, et al.
Publicado: (2023)

On Line-Separable Weighted Unit-Disk Coverage and Related Problems
por: Liu, Gang, et al.
Publicado: (2024)

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

Unweighted Geometric Hitting Set for Line-Constrained Disks and Related Problems
por: Liu, Gang, et al.
Publicado: (2024)

Simple Grid Polygon Online Exploration Revisited
por: Brock, Maximilian, et al.
Publicado: (2024)

Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings
por: Dobler, Alexander, et al.
Publicado: (2024)

Distributed-Memory Parallel Algorithms for Fixed-Radius Near Neighbor Graph Construction
por: Raulet, Gabriel, et al.
Publicado: (2025)

Triangle Detection in Worst-Case Sparse Graphs via Local Sketching
por: Duan, Hongyi, et al.
Publicado: (2025)

Scalable Exact Hierarchical Agglomerative Clustering via Sparse Geographic Distance Graphs
por: Maus, Victor, et al.
Publicado: (2026)

Reconstructing Riemannian Metrics From Random Geometric Graphs
por: Huang, Han, et al.
Publicado: (2025)

Better Diameter Algorithms for Bounded VC-dimension Graphs and Geometric Intersection Graphs
por: Duraj, Lech, et al.
Publicado: (2023)

Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs
por: de Berg, Mark, et al.
Publicado: (2026)

Unit-length Rectangular Drawings of Graphs
por: Alegria, Carlos, et al.
Publicado: (2022)

Clustered Planarity Variants for Level Graphs
por: Fink, Simon D., et al.
Publicado: (2024)

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

Sparse Outerstring Graphs Have Logarithmic Treewidth
por: An, Shinwoo, et al.
Publicado: (2024)