Saved in:
| Main Authors: | Gao, Jie, Gawrychowski, Pawel, Giannopoulos, Panos, Mulzer, Wolfgang, Singh, Satyam, Staals, Frank, Zehavi, Meirav |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2512.09899 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Parameterized Geometric Graph Modification with Disk Scaling
by: Fomin, Fedor V., et al.
Published: (2024)
by: Fomin, Fedor V., et al.
Published: (2024)
Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3
by: Lokshtanov, Daniel, et al.
Published: (2024)
by: Lokshtanov, Daniel, et al.
Published: (2024)
Robust Algorithms for Finding Triangles and Computing the Girth in Unit Disk and Transmission Graphs
by: Klost, Katharina, et al.
Published: (2024)
by: Klost, Katharina, et al.
Published: (2024)
Parameterized Approaches to Orthogonal Compaction
by: Didimo, Walter, et al.
Published: (2022)
by: Didimo, Walter, et al.
Published: (2022)
Maximum Matchings in Geometric Intersection Graphs
by: Bonnet, Édouard, et al.
Published: (2019)
by: Bonnet, Édouard, et al.
Published: (2019)
Computing Maximum Cliques in Unit Disk Graphs
by: Tkachenko, Anastasiia, et al.
Published: (2025)
by: Tkachenko, Anastasiia, et al.
Published: (2025)
Tight Parameterized (In)tractability of Layered Crossing Minimization: Subexponential Algorithms and Kernelization
by: Fomin, Fedor V., et al.
Published: (2025)
by: Fomin, Fedor V., et al.
Published: (2025)
Searching in Euclidean Spaces with Predictions
by: Cabello, Sergio, et al.
Published: (2024)
by: Cabello, Sergio, et al.
Published: (2024)
Dynamic Connectivity in Disk Graphs
by: Baumann, Alexander, et al.
Published: (2021)
by: Baumann, Alexander, et al.
Published: (2021)
Exact Algorithms for Clustered Planarity with Linear Saturators
by: Da Lozzo, Giordano, et al.
Published: (2024)
by: Da Lozzo, Giordano, et al.
Published: (2024)
Approximate Dynamic Nearest Neighbor Searching in a Polygonal Domain
by: van der Laan, Joost, et al.
Published: (2026)
by: van der Laan, Joost, et al.
Published: (2026)
Online Hitting Sets for Disks of Bounded Radii
by: De, Minati, et al.
Published: (2024)
by: De, Minati, et al.
Published: (2024)
Smallest Enclosing Disk Queries Using Farthest-Point Voronoi Diagrams
by: Buchin, Kevin, et al.
Published: (2026)
by: Buchin, Kevin, et al.
Published: (2026)
The Maximum Clique Problem in a Disk Graph Made Easy
by: Keil, J. Mark, et al.
Published: (2024)
by: Keil, J. Mark, et al.
Published: (2024)
Delaunay Triangulations with Predictions
by: Cabello, Sergio, et al.
Published: (2026)
by: Cabello, Sergio, et al.
Published: (2026)
Nearest Neighbor Searching in a Dynamic Simple Polygon
by: de Berg, Sarita, et al.
Published: (2025)
by: de Berg, Sarita, et al.
Published: (2025)
On strictly output sensitive color frequency reporting
by: Glazenburg, Erwin, et al.
Published: (2026)
by: Glazenburg, Erwin, et al.
Published: (2026)
Hybrid k-Clustering: Blending k-Median and k-Center
by: Fomin, Fedor V., et al.
Published: (2024)
by: Fomin, Fedor V., 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)
Convexity Helps Iterated Search in 3D
by: Afshani, Peyman, et al.
Published: (2025)
by: Afshani, Peyman, et al.
Published: (2025)
Subexponential Algorithms for Clique Cover on Unit Disk and Unit Ball Graphs
by: Koana, Tomohiro, et al.
Published: (2024)
by: Koana, Tomohiro, et al.
Published: (2024)
Learning Small Decision Trees with Few Outliers: A Parameterized Perspective
by: Gahlawat, Harmender, et al.
Published: (2025)
by: Gahlawat, Harmender, et al.
Published: (2025)
Long Plane Trees
by: Cabello, Sergio, et al.
Published: (2021)
by: Cabello, Sergio, et al.
Published: (2021)
Maximum Partial List H-Coloring on P_5-free graphs in polynomial time
by: Lokshtanov, Daniel, et al.
Published: (2024)
by: Lokshtanov, Daniel, 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)
A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees
by: Jacob, Ashwin, et al.
Published: (2024)
by: Jacob, Ashwin, et al.
Published: (2024)
A Clique-Based Separator for Intersection Graphs of Geodesic Disks in $\mathbb{R}^2$
by: Aronov, Boris, et al.
Published: (2024)
by: Aronov, Boris, et al.
Published: (2024)
Fast Conformal Parameterization of Disks and Sphere Sectors
by: Gilat, Tom, et al.
Published: (2020)
by: Gilat, Tom, et al.
Published: (2020)
Online Hitting of Unit Balls and Hypercubes in $\mathbb{R}^d$ using Points from $\mathbb{Z}^d$
by: De, Minati, et al.
Published: (2023)
by: De, Minati, et al.
Published: (2023)
Parameterized Approximation of Rectangle Stabbing
by: Chu, Huairui, et al.
Published: (2026)
by: Chu, Huairui, et al.
Published: (2026)
Treewidth Parameterized by Feedback Vertex Number
by: Molter, Hendrik, et al.
Published: (2025)
by: Molter, Hendrik, et al.
Published: (2025)
Fine-Grained Complexity of Earth Mover's Distance under Translation
by: Bringmann, Karl, et al.
Published: (2024)
by: Bringmann, Karl, et al.
Published: (2024)
Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal Domain
by: de Berg, Sarita, et al.
Published: (2023)
by: de Berg, Sarita, et al.
Published: (2023)
On Kernelization with Access to NP-Oracles
by: Molter, Hendrik, et al.
Published: (2025)
by: Molter, Hendrik, et al.
Published: (2025)
A Parameterized Perspective on Uniquely Restricted Matchings
by: Chaudhary, Juhi, et al.
Published: (2025)
by: Chaudhary, Juhi, et al.
Published: (2025)
Parameterized Analysis of Bribery in Challenge the Champ Tournaments
by: Chaudhary, Juhi, et al.
Published: (2024)
by: Chaudhary, Juhi, et al.
Published: (2024)
Approximating Robot Configuration Spaces with few Convex Sets using Clique Covers of Visibility Graphs
by: Werner, Peter, et al.
Published: (2023)
by: Werner, Peter, et al.
Published: (2023)
Exact solutions to the Weighted Region Problem
by: de Berg, Sarita, et al.
Published: (2024)
by: de Berg, Sarita, et al.
Published: (2024)
The Complexity of Geodesic Spanners
by: de Berg, Sarita, et al.
Published: (2023)
by: de Berg, Sarita, et al.
Published: (2023)
Online Algorithms for Geometric Independent Set
by: De, Minati, et al.
Published: (2026)
by: De, Minati, et al.
Published: (2026)
Similar Items
-
Parameterized Geometric Graph Modification with Disk Scaling
by: Fomin, Fedor V., et al.
Published: (2024) -
Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3
by: Lokshtanov, Daniel, et al.
Published: (2024) -
Robust Algorithms for Finding Triangles and Computing the Girth in Unit Disk and Transmission Graphs
by: Klost, Katharina, et al.
Published: (2024) -
Parameterized Approaches to Orthogonal Compaction
by: Didimo, Walter, et al.
Published: (2022) -
Maximum Matchings in Geometric Intersection Graphs
by: Bonnet, Édouard, et al.
Published: (2019)