Saved in:
| Main Authors: | Dutta, Madhura, Maheshwari, Anil, Nandy, Subhas C., Roy, Bodhayan |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2505.15949 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
New Complexity and Algorithmic Bounds for Minimum Consistent Subsets
by: Banik, Aritra, et al.
Published: (2024)
by: Banik, Aritra, et al.
Published: (2024)
Further Results on Rendering Geometric Intersection Graphs Sparse by Dispersion
by: Honorato-Droguett, Nicolás, et al.
Published: (2025)
by: Honorato-Droguett, Nicolás, et al.
Published: (2025)
Witness Set: A Visibility Problem in $NP\cap XP$
by: Jana, Satyabrata, et al.
Published: (2026)
by: Jana, Satyabrata, et al.
Published: (2026)
On Approximating the Dynamic and Discrete Network Flow Problem
by: Manna, Bubai, et al.
Published: (2024)
by: Manna, Bubai, et al.
Published: (2024)
Some New Results in Geometric Analysis
by: Coiculescu, Matei P.
Published: (2021)
by: Coiculescu, Matei P.
Published: (2021)
Algorithms and Hardness Results for the $(k,\ell)$-Cover Problem
by: Madani, Amirali, et al.
Published: (2025)
by: Madani, Amirali, et al.
Published: (2025)
Metric and Geometric Spanners that are Resilient to Degree-Bounded Edge Faults
by: Biniaz, Ahmad, et al.
Published: (2024)
by: Biniaz, Ahmad, et al.
Published: (2024)
Hop-Spanners for Geometric Intersection Graphs
by: Conroy, Jonathan B., et al.
Published: (2021)
by: Conroy, Jonathan B., et al.
Published: (2021)
Approximating Densest Subgraph in Geometric Intersection Graphs
by: Har-Peled, Sariel, et al.
Published: (2024)
by: Har-Peled, Sariel, et al.
Published: (2024)
Online Class Cover Problem
by: De, Minati, et al.
Published: (2023)
by: De, Minati, et al.
Published: (2023)
Linear-Time $(1+\varepsilon)$-Approximation Algorithms for Two-Line-Center Problems
by: Chung, Chaeyoon, et al.
Published: (2026)
by: Chung, Chaeyoon, et al.
Published: (2026)
Minimum Selective Subset on Some Graph Classes
by: Manna, Bubai
Published: (2025)
by: Manna, Bubai
Published: (2025)
Euclidean Maximum Matchings in the Plane---Local to Global
by: Biniaz, Ahmad, et al.
Published: (2024)
by: Biniaz, Ahmad, et al.
Published: (2024)
Sparse Bounded Hop-Spanners for Geometric Intersection Graphs
by: Bhore, Sujoy, et al.
Published: (2025)
by: Bhore, Sujoy, et al.
Published: (2025)
Multipacking in Euclidean Metric Space
by: Das, Arun Kumar, et al.
Published: (2024)
by: Das, Arun Kumar, et al.
Published: (2024)
Some Computational Results on Koszul-Vinberg Cochain Complexes
by: Liu, Hanwen, et al.
Published: (2024)
by: Liu, Hanwen, et al.
Published: (2024)
Robust Algorithms for Path and Cycle Problems in Geometric Intersection Graphs
by: Marin, Malory, et al.
Published: (2025)
by: Marin, Malory, et al.
Published: (2025)
Better Diameter Algorithms for Bounded VC-dimension Graphs and Geometric Intersection Graphs
by: Duraj, Lech, et al.
Published: (2023)
by: Duraj, Lech, et al.
Published: (2023)
The Complexity of Intersection Graphs of Lines in Space and Circle Orders
by: Cardinal, Jean
Published: (2024)
by: Cardinal, Jean
Published: (2024)
Maximum Matchings in Geometric Intersection Graphs
by: Bonnet, Édouard, et al.
Published: (2019)
by: Bonnet, Édouard, et al.
Published: (2019)
Computing shortest paths amid non-overlapping weighted disks
by: Bose, Prosenjit, et al.
Published: (2024)
by: Bose, Prosenjit, et al.
Published: (2024)
On Subexponential Parameterized Algorithms for Steiner Tree on Intersection Graphs of Geometric Objects
by: Bhore, Sujoy, et al.
Published: (2025)
by: Bhore, Sujoy, et al.
Published: (2025)
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)
Small Independent Sets versus Small Separator in Geometric Intersection Graphs
by: Marin, Malory, et al.
Published: (2026)
by: Marin, Malory, et al.
Published: (2026)
Some Foundational Results In Adic Geometry
by: Zavyalov, Bogdan
Published: (2024)
by: Zavyalov, Bogdan
Published: (2024)
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)
Contiguous Boundary Guarding
by: Biniaz, Ahmad, et al.
Published: (2024)
by: Biniaz, Ahmad, et al.
Published: (2024)
Quantum Speedup for Some Geometric 3SUM-Hard Problems and Beyond
by: Keil, J. Mark, et al.
Published: (2024)
by: Keil, J. Mark, et al.
Published: (2024)
Computing the Girth of a Segment Intersection Graph
by: Chan, Timothy M., et al.
Published: (2026)
by: Chan, Timothy M., et al.
Published: (2026)
Polychromatic Coloring of Tuples in Hypergraphs
by: Biniaz, Ahmad, et al.
Published: (2025)
by: Biniaz, Ahmad, et al.
Published: (2025)
Computing Oriented Spanners and their Dilation
by: Buchin, Kevin, et al.
Published: (2024)
by: Buchin, Kevin, et al.
Published: (2024)
Improved Total Domination and Total Roman Domination in Unit Disk Graphs
by: Rout, Sasmita, et al.
Published: (2024)
by: Rout, Sasmita, et al.
Published: (2024)
Fully-Adaptive Dynamic Connectivity of Square Intersection Graphs
by: van der Hoog, Ivor, et al.
Published: (2024)
by: van der Hoog, Ivor, et al.
Published: (2024)
Charting the Diameter Computation Landscape on Intersection Graphs in the Plane
by: Chan, Timothy M., et al.
Published: (2026)
by: Chan, Timothy M., et al.
Published: (2026)
Some Lower Bounds on the Reach of an Algebraic Variety
by: La Valle, Chris, et al.
Published: (2024)
by: La Valle, Chris, et al.
Published: (2024)
Deciding if a DAG is Interesting is Hard
by: De Carufel, Jean-Lou, et al.
Published: (2025)
by: De Carufel, Jean-Lou, et al.
Published: (2025)
Intersection Graphs with and without Product Structure
by: Merker, Laura, et al.
Published: (2024)
by: Merker, Laura, et al.
Published: (2024)
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)
Star-Based Separators for Intersection Graphs of $c$-Colored Pseudo-Segments
by: de Berg, M., et al.
Published: (2025)
by: de Berg, M., et al.
Published: (2025)
Maximum Cut on Interval Graphs of Interval Count Two is NP-complete
by: Barsukov, Alexey, et al.
Published: (2022)
by: Barsukov, Alexey, et al.
Published: (2022)
Similar Items
-
New Complexity and Algorithmic Bounds for Minimum Consistent Subsets
by: Banik, Aritra, et al.
Published: (2024) -
Further Results on Rendering Geometric Intersection Graphs Sparse by Dispersion
by: Honorato-Droguett, Nicolás, et al.
Published: (2025) -
Witness Set: A Visibility Problem in $NP\cap XP$
by: Jana, Satyabrata, et al.
Published: (2026) -
On Approximating the Dynamic and Discrete Network Flow Problem
by: Manna, Bubai, et al.
Published: (2024) -
Some New Results in Geometric Analysis
by: Coiculescu, Matei P.
Published: (2021)