Saved in:
| Main Authors: | Banik, Aritra, Parthasarathi, Mano Prakash, Raman, Venkatesh, Roy, Diya, Sahu, Abhishek |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2512.12860 |
| 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)
Kidney Exchange: Faster Parameterized Algorithms and Tighter Lower Bounds
by: Banik, Aritra, et al.
Published: (2025)
by: Banik, Aritra, 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)
Hitting Axis-Parallel Segments with Weighted Points
by: Raman, Rajiv, et al.
Published: (2026)
by: Raman, Rajiv, et al.
Published: (2026)
Computing Maximum Cliques in Unit Disk Graphs
by: Tkachenko, Anastasiia, et al.
Published: (2025)
by: Tkachenko, Anastasiia, et al.
Published: (2025)
On the Parameterized Tractability of Packing Vertex-Disjoint A-Paths with Length Constraints
by: Bandopadhyay, Susobhan, et al.
Published: (2026)
by: Bandopadhyay, Susobhan, et al.
Published: (2026)
Computing Dominating Sets in Disk Graphs with Centers in Convex Position
by: Tkachenko, Anastasiia, et al.
Published: (2026)
by: Tkachenko, Anastasiia, et al.
Published: (2026)
Computing Diameter +1 in Truly Subquadratic Time for Unit-Disk Graphs
by: Chang, Hsien-Chih, et al.
Published: (2024)
by: Chang, Hsien-Chih, et al.
Published: (2024)
Data Structures for Approximate Discrete Fréchet Distance
by: van der Hoog, Ivor, et al.
Published: (2022)
by: van der Hoog, Ivor, et al.
Published: (2022)
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)
Data Structures for Range Sorted Consecutive Occurrence Queries
by: Akram, Waseem, et al.
Published: (2024)
by: Akram, Waseem, et al.
Published: (2024)
Conflict and Fairness in Resource Allocation
by: Bandopadhyay, Susobhan, et al.
Published: (2024)
by: Bandopadhyay, Susobhan, et al.
Published: (2024)
Fast Algorithms for Minimum Homology Basis
by: Dhar, Amritendu, et al.
Published: (2021)
by: Dhar, Amritendu, et al.
Published: (2021)
Sublinear Data Structures for Nearest Neighbor in Ultra High Dimensions
by: Herold, Martin G., et al.
Published: (2025)
by: Herold, Martin G., et al.
Published: (2025)
On Computing Vertex Connectivity of 1-Plane Graphs
by: Biedl, Therese, et al.
Published: (2022)
by: Biedl, Therese, et al.
Published: (2022)
Approximation Schemes and Structural Barriers for the Two-Dimensional Knapsack Problem with Rotations
by: Kar, Debajyoti, et al.
Published: (2026)
by: Kar, Debajyoti, et al.
Published: (2026)
Improved Online Hitting Set Algorithms for Structured and Geometric Set Systems
by: Bhore, Sujoy, et al.
Published: (2026)
by: Bhore, Sujoy, et al.
Published: (2026)
Near-tight Bounds for Computing the Fréchet Distance in d-Dimensional Grid Graphs and the Implications for λ-low Dense Curves
by: Conradi, Jacobus, et al.
Published: (2026)
by: Conradi, Jacobus, et al.
Published: (2026)
Structure and Independence in Hyperbolic Uniform Disk Graphs
by: Bläsius, Thomas, et al.
Published: (2024)
by: Bläsius, Thomas, et al.
Published: (2024)
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)
Computing Diverse and Nice Triangulations
by: Gálvez, Waldo, et al.
Published: (2025)
by: Gálvez, Waldo, et al.
Published: (2025)
A Task-Parallel Approach for Localized Topological Data Structures
by: Liu, Guoxi, et al.
Published: (2023)
by: Liu, Guoxi, et al.
Published: (2023)
Dynamic Connectivity in Disk Graphs
by: Baumann, Alexander, et al.
Published: (2021)
by: Baumann, Alexander, et al.
Published: (2021)
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)
Algorithms for Computing Closest Points for Segments
by: Wang, Haitao
Published: (2024)
by: Wang, Haitao
Published: (2024)
Unit-length Rectangular Drawings of Graphs
by: Alegria, Carlos, et al.
Published: (2022)
by: Alegria, Carlos, et al.
Published: (2022)
Clustered Planarity Variants for Level Graphs
by: Fink, Simon D., et al.
Published: (2024)
by: Fink, Simon D., et al.
Published: (2024)
Computing crossing numbers with topological and geometric restrictions
by: Hamm, Thekla, et al.
Published: (2024)
by: Hamm, Thekla, et al.
Published: (2024)
Sparse Outerstring Graphs Have Logarithmic Treewidth
by: An, Shinwoo, et al.
Published: (2024)
by: An, Shinwoo, et al.
Published: (2024)
Parameterized Geometric Graph Modification with Disk Scaling
by: Fomin, Fedor V., et al.
Published: (2024)
by: Fomin, Fedor V., et al.
Published: (2024)
Shortest Path Separators in Unit Disk Graphs
by: Harb, Elfarouk, et al.
Published: (2024)
by: Harb, Elfarouk, et al.
Published: (2024)
An Optimal Algorithm for Shortest Paths in Unweighted Disk Graphs
by: Brewer, Bruce W., et al.
Published: (2025)
by: Brewer, Bruce W., et al.
Published: (2025)
Morphing Planar Graph Drawings Through 3D
by: Buchin, Kevin, et al.
Published: (2022)
by: Buchin, Kevin, et al.
Published: (2022)
Ranking and Unranking of the Planar Embeddings of a Planar Graph
by: Di Battista, Giuseppe, et al.
Published: (2024)
by: Di Battista, Giuseppe, et al.
Published: (2024)
Computing largest minimum color-spanning intervals of imprecise points
by: Acharyya, Ankush, et al.
Published: (2024)
by: Acharyya, Ankush, et al.
Published: (2024)
Single-Source Shortest Path Problem in Weighted Disk Graphs
by: An, Shinwoo, et al.
Published: (2025)
by: An, Shinwoo, et al.
Published: (2025)
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)
An Improved Algorithm for Shortest Paths in Weighted Unit-Disk Graphs
by: Brewer, Bruce W., et al.
Published: (2024)
by: Brewer, Bruce W., et al.
Published: (2024)
Maximum Independent Sets in Disk Graphs with Disks in Convex Position
by: Tkachenko, Anastasiia, et al.
Published: (2026)
by: Tkachenko, Anastasiia, et al.
Published: (2026)
ETH-Tight Algorithm for Cycle Packing on Unit Disk Graphs
by: An, Shinwoo, et al.
Published: (2024)
by: An, Shinwoo, et al.
Published: (2024)
Similar Items
-
New Complexity and Algorithmic Bounds for Minimum Consistent Subsets
by: Banik, Aritra, et al.
Published: (2024) -
Kidney Exchange: Faster Parameterized Algorithms and Tighter Lower Bounds
by: Banik, Aritra, 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) -
Hitting Axis-Parallel Segments with Weighted Points
by: Raman, Rajiv, et al.
Published: (2026) -
Computing Maximum Cliques in Unit Disk Graphs
by: Tkachenko, Anastasiia, et al.
Published: (2025)