:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Dutta, Madhura, Maheshwari, Anil, Nandy, Subhas C., Roy, Bodhayan
Formato:	Preprint
Publicado:	2025
Materias:	Computational Geometry
Acceso en línea:	https://arxiv.org/abs/2505.15949
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

New Complexity and Algorithmic Bounds for Minimum Consistent Subsets
por: Banik, Aritra, et al.
Publicado: (2024)

Further Results on Rendering Geometric Intersection Graphs Sparse by Dispersion
por: Honorato-Droguett, Nicolás, et al.
Publicado: (2025)

Witness Set: A Visibility Problem in $NP\cap XP$
por: Jana, Satyabrata, et al.
Publicado: (2026)

On Approximating the Dynamic and Discrete Network Flow Problem
por: Manna, Bubai, et al.
Publicado: (2024)

Some New Results in Geometric Analysis
por: Coiculescu, Matei P.
Publicado: (2021)

Algorithms and Hardness Results for the $(k,\ell)$-Cover Problem
por: Madani, Amirali, et al.
Publicado: (2025)

Metric and Geometric Spanners that are Resilient to Degree-Bounded Edge Faults
por: Biniaz, Ahmad, et al.
Publicado: (2024)

Hop-Spanners for Geometric Intersection Graphs
por: Conroy, Jonathan B., et al.
Publicado: (2021)

Approximating Densest Subgraph in Geometric Intersection Graphs
por: Har-Peled, Sariel, et al.
Publicado: (2024)

Online Class Cover Problem
por: De, Minati, et al.
Publicado: (2023)

Linear-Time $(1+\varepsilon)$-Approximation Algorithms for Two-Line-Center Problems
por: Chung, Chaeyoon, et al.
Publicado: (2026)

Minimum Selective Subset on Some Graph Classes
por: Manna, Bubai
Publicado: (2025)

Euclidean Maximum Matchings in the Plane---Local to Global
por: Biniaz, Ahmad, et al.
Publicado: (2024)

Sparse Bounded Hop-Spanners for Geometric Intersection Graphs
por: Bhore, Sujoy, et al.
Publicado: (2025)

Multipacking in Euclidean Metric Space
por: Das, Arun Kumar, et al.
Publicado: (2024)

Some Computational Results on Koszul-Vinberg Cochain Complexes
por: Liu, Hanwen, et al.
Publicado: (2024)

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

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

The Complexity of Intersection Graphs of Lines in Space and Circle Orders
por: Cardinal, Jean
Publicado: (2024)

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

Computing shortest paths amid non-overlapping weighted disks
por: Bose, Prosenjit, et al.
Publicado: (2024)

On Subexponential Parameterized Algorithms for Steiner Tree on Intersection Graphs of Geometric Objects
por: Bhore, Sujoy, et al.
Publicado: (2025)

Approximation Schemes for Subset TSP and Steiner Tree on Geometric Intersection Graphs
por: Kisfaludi-Bak, Sándor, et al.
Publicado: (2026)

Small Independent Sets versus Small Separator in Geometric Intersection Graphs
por: Marin, Malory, et al.
Publicado: (2026)

Some Foundational Results In Adic Geometry
por: Zavyalov, Bogdan
Publicado: (2024)

Charting the Diameter Computation Landscape of Geometric Intersection Graphs in Three Dimensions and Higher
por: Chan, Timothy M., et al.
Publicado: (2026)

Contiguous Boundary Guarding
por: Biniaz, Ahmad, et al.
Publicado: (2024)

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

Computing the Girth of a Segment Intersection Graph
por: Chan, Timothy M., et al.
Publicado: (2026)

Polychromatic Coloring of Tuples in Hypergraphs
por: Biniaz, Ahmad, et al.
Publicado: (2025)

Computing Oriented Spanners and their Dilation
por: Buchin, Kevin, et al.
Publicado: (2024)

Improved Total Domination and Total Roman Domination in Unit Disk Graphs
por: Rout, Sasmita, et al.
Publicado: (2024)

Fully-Adaptive Dynamic Connectivity of Square Intersection Graphs
por: van der Hoog, Ivor, et al.
Publicado: (2024)

Charting the Diameter Computation Landscape on Intersection Graphs in the Plane
por: Chan, Timothy M., et al.
Publicado: (2026)

Some Lower Bounds on the Reach of an Algebraic Variety
por: La Valle, Chris, et al.
Publicado: (2024)

Deciding if a DAG is Interesting is Hard
por: De Carufel, Jean-Lou, et al.
Publicado: (2025)

Intersection Graphs with and without Product Structure
por: Merker, Laura, et al.
Publicado: (2024)

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)

Star-Based Separators for Intersection Graphs of $c$-Colored Pseudo-Segments
por: de Berg, M., et al.
Publicado: (2025)

Maximum Cut on Interval Graphs of Interval Count Two is NP-complete
por: Barsukov, Alexey, et al.
Publicado: (2022)