Small Independent Sets versus Small Separator in Geometric Intersection Graphs
Fuente:
arXiv
Saved in:
| Main Authors: | Marin, Malory, Watrigant, Rémi |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
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)
Subcoloring of (Unit) Disk Graphs
by: Marin, Malory, et al.
Published: (2025)
by: Marin, Malory, et al.
Published: (2025)
Channel allocation revisited through 1-extendability of graphs
by: Busson, Anthony, et al.
Published: (2024)
by: Busson, Anthony, et al.
Published: (2024)
Subexponential and Parameterized Mixing Times of Glauber Dynamics on Independent Sets
by: Marin, Malory
Published: (2025)
by: Marin, Malory
Published: (2025)
Online Algorithms for Geometric Independent Set
by: De, Minati, et al.
Published: (2026)
by: De, Minati, et al.
Published: (2026)
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)
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)
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)
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)
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)
Fast Static and Dynamic Approximation Algorithms for Geometric Optimization Problems: Piercing, Independent Set, Vertex Cover, and Matching
by: Bhore, Sujoy, et al.
Published: (2024)
by: Bhore, Sujoy, et al.
Published: (2024)
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)
Light Spanners with Small Hop-Diameter
by: Bhore, Sujoy, et al.
Published: (2025)
by: Bhore, Sujoy, et al.
Published: (2025)
Extraction Theorems With Small Extraction Numbers
by: Agarwal, Arjun, et al.
Published: (2024)
by: Agarwal, Arjun, 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)
Shortest Path Separators in Unit Disk Graphs
by: Harb, Elfarouk, et al.
Published: (2024)
by: Harb, Elfarouk, et al.
Published: (2024)
Unweighted Geometric Hitting Set for Line-Constrained Disks and Related Problems
by: Liu, Gang, et al.
Published: (2024)
by: Liu, Gang, 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)
Internally-Convex Drawings of Outerplanar Graphs in Small Area
by: Bekos, Michael A., et al.
Published: (2025)
by: Bekos, Michael A., et al.
Published: (2025)
Counting Unit Circular Arc Intersections
by: Wang, Haitao
Published: (2026)
by: Wang, Haitao
Published: (2026)
Approximation Algorithms for Smallest Intersecting Balls
by: Zheng, Jiaqi, et al.
Published: (2024)
by: Zheng, Jiaqi, et al.
Published: (2024)
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)
Polynomial-Time Approximation Schemes for Independent Packing Problems on Fractionally Tree-Independence-Number-Fragile Graphs
by: Galby, Esther, et al.
Published: (2023)
by: Galby, Esther, et al.
Published: (2023)
Using Ray-shooting Queries for Sublinear Algorithms for Dominating Sets in RDV Graphs
by: Biedl, Therese, et al.
Published: (2026)
by: Biedl, Therese, et al.
Published: (2026)
Maximum Matchings in Geometric Intersection Graphs
by: Bonnet, Édouard, et al.
Published: (2019)
by: Bonnet, Édouard, et al.
Published: (2019)
Approximately: Independence Implies Vertex Cover
by: Har-Peled, Sariel
Published: (2023)
by: Har-Peled, Sariel
Published: (2023)
Reconstructing Riemannian Metrics From Random Geometric Graphs
by: Huang, Han, et al.
Published: (2025)
by: Huang, Han, et al.
Published: (2025)
An Algorithmic Solution for Computing Circle Intersection Areas and its Applications to Wireless Communications
by: Librino, Federico, et al.
Published: (2012)
by: Librino, Federico, et al.
Published: (2012)
Unfairly Splitting Separable Necklaces
by: Schnider, Patrick, et al.
Published: (2024)
by: Schnider, Patrick, et al.
Published: (2024)
Faster Algorithms for Reverse Shortest Path in Unit-Disk Graphs and Related Geometric Optimization Problems: Improving the Shrink-and-Bifurcate Technique
by: Chan, Timothy M., et al.
Published: (2025)
by: Chan, Timothy M., et al.
Published: (2025)
Online Maximum Independent Set of Hyperrectangles
by: Advani, Rishi, et al.
Published: (2023)
by: Advani, Rishi, et al.
Published: (2023)
Enclosing Points with Geometric Objects
by: Chan, Timothy M., et al.
Published: (2024)
by: Chan, Timothy M., et al.
Published: (2024)
Range Counting Oracles for Geometric Problems
by: Driemel, Anne, et al.
Published: (2025)
by: Driemel, Anne, et al.
Published: (2025)
On the Line-Separable Unit-Disk Coverage and Related Problems
by: Liu, Gang, et al.
Published: (2023)
by: Liu, Gang, et al.
Published: (2023)
On Line-Separable Weighted Unit-Disk Coverage and Related Problems
by: Liu, Gang, et al.
Published: (2024)
by: Liu, Gang, et al.
Published: (2024)
An Optimal Algorithm for Half-plane Hitting Set
by: Liu, Gang, et al.
Published: (2025)
by: Liu, Gang, et al.
Published: (2025)
Minimum-Weight Half-Plane Hitting Set
by: Liu, Gang, et al.
Published: (2025)
by: Liu, Gang, et al.
Published: (2025)
An $O(n \log n)$-Time Approximation Scheme for Geometric Many-to-Many Matching
by: Bandyapadhyay, Sayan, et al.
Published: (2024)
by: Bandyapadhyay, Sayan, et al.
Published: (2024)
Structure and Independence in Hyperbolic Uniform Disk Graphs
by: Bläsius, Thomas, et al.
Published: (2024)
by: Bläsius, Thomas, et al.
Published: (2024)
Exact Subquadratic Algorithm for Many-to-Many Matching on Planar Point Sets with Integer Coordinates
by: Park, Seongbin, et al.
Published: (2026)
by: Park, Seongbin, et al.
Published: (2026)
Similar Items
-
Robust Algorithms for Path and Cycle Problems in Geometric Intersection Graphs
by: Marin, Malory, et al.
Published: (2025) -
Subcoloring of (Unit) Disk Graphs
by: Marin, Malory, et al.
Published: (2025) -
Channel allocation revisited through 1-extendability of graphs
by: Busson, Anthony, et al.
Published: (2024) -
Subexponential and Parameterized Mixing Times of Glauber Dynamics on Independent Sets
by: Marin, Malory
Published: (2025) -
Online Algorithms for Geometric Independent Set
by: De, Minati, et al.
Published: (2026)