Maximum Centre-Disjoint Mergeable Disks
Fuente:
arXiv
Saved in:
| Main Author: | Rudi, Ali Gholami |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
On the Diameter of Arrangements of Topological Disks
by: Abiad, Aida, et al.
Published: (2025)
by: Abiad, Aida, et al.
Published: (2025)
Finding Complex Patterns in Trajectory Data via Geometric Set Cover
by: Conradi, Jacobus, et al.
Published: (2023)
by: Conradi, Jacobus, et al.
Published: (2023)
Point Location in Constant Time
by: Chaganti, Sairam, et al.
Published: (2023)
by: Chaganti, Sairam, et al.
Published: (2023)
Lozenge Tiling by Computing Distances
by: Favreau, Jean-Marie, et al.
Published: (2026)
by: Favreau, Jean-Marie, et al.
Published: (2026)
Recognizing Penny and Marble Graphs is Hard for Existential Theory of the Reals
by: Lubiw, Anna, et al.
Published: (2025)
by: Lubiw, Anna, et al.
Published: (2025)
An efficient algorithm for identifying rainbow ortho-convex 4-sets in k-colored point sets
by: Flores-Peñaloza, David, et al.
Published: (2024)
by: Flores-Peñaloza, David, et al.
Published: (2024)
The Li-Chao Tree: Algorithm Specification and Analysis
by: Li, Chao
Published: (2026)
by: Li, Chao
Published: (2026)
Clustering with Few Disks to Minimize the Sum of Radii
by: Abrahamsen, Mikkel, et al.
Published: (2023)
by: Abrahamsen, Mikkel, et al.
Published: (2023)
Folding One Polyhedral Metric Graph into Another
by: Chung, Lily, et al.
Published: (2024)
by: Chung, Lily, et al.
Published: (2024)
Computing the second and third systoles of a combinatorial surface
by: Ebbens, Matthijs, et al.
Published: (2024)
by: Ebbens, Matthijs, et al.
Published: (2024)
Computing shortest closed curves on non-orientable surfaces
by: Bulavka, Denys, et al.
Published: (2024)
by: Bulavka, Denys, et al.
Published: (2024)
Optimal Bridge, Twin Bridges and Beyond: Inserting Edges into a Road Network to Minimize the Constrained Diameters
by: Feng, Zhidan, et al.
Published: (2024)
by: Feng, Zhidan, et al.
Published: (2024)
Maximum Matchings in Geometric Intersection Graphs
by: Bonnet, Édouard, et al.
Published: (2019)
by: Bonnet, Édouard, et al.
Published: (2019)
General Strong Bound on the Uncrossed Number via a Tight Bound for the Maximum Uncrossed Subgraph Number
by: Charvy, Gaspard, et al.
Published: (2025)
by: Charvy, Gaspard, et al.
Published: (2025)
Maximum Solow--Polasky Diversity Subset Selection Is NP-hard Even in the Euclidean Plane
by: Emmerich, Michael T. M., et al.
Published: (2026)
by: Emmerich, Michael T. M., et al.
Published: (2026)
Ortho-unit polygons can be guarded with at most $\lfloor \frac{n-4}{8} \rfloor$ guards
by: Díaz-Báñez, J. M., et al.
Published: (2022)
by: Díaz-Báñez, J. M., et al.
Published: (2022)
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)
The Presort Hierarchy for Geometric Problems
by: van der Hoog, Ivor, et al.
Published: (2026)
by: van der Hoog, Ivor, et al.
Published: (2026)
Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes
by: Golovach, Petr A., et al.
Published: (2022)
by: Golovach, Petr A., et al.
Published: (2022)
On the MST-ratio: Theoretical Bounds and Complexity of Finding the Maximum
by: Ameli, Afrouz Jabal, et al.
Published: (2024)
by: Ameli, Afrouz Jabal, et al.
Published: (2024)
Subtrajectory Clustering and Coverage Maximization in Cubic Time, or Better
by: Conradi, Jacobus, et al.
Published: (2025)
by: Conradi, Jacobus, et al.
Published: (2025)
Robust Bichromatic Classification using Two Lines
by: Glazenburg, Erwin, et al.
Published: (2024)
by: Glazenburg, Erwin, et al.
Published: (2024)
Continuous Flattening and Reversing of Convex Polyhedral Linkages
by: Demaine, Erik D., et al.
Published: (2024)
by: Demaine, Erik D., et al.
Published: (2024)
Computing the Polytope Diameter is Even Harder than NP-hard (Already for Perfect Matchings)
by: Wulf, Lasse
Published: (2025)
by: Wulf, Lasse
Published: (2025)
Selecting a Maximum Solow-Polasky Diversity Subset in General Metric Spaces Is NP-hard
by: Emmerich, Michael T. M., et al.
Published: (2026)
by: Emmerich, Michael T. M., et al.
Published: (2026)
Optimal Bounds for the k-Disjoint Paths Problem
by: Cavallaro, Dario, et al.
Published: (2026)
by: Cavallaro, Dario, et al.
Published: (2026)
On the difficulty of order constrained pattern matching with applications to feature matching based malware detection
by: Liyanage, Adiesha, et al.
Published: (2025)
by: Liyanage, Adiesha, et al.
Published: (2025)
Realizability of Rectangular Euler Diagrams
by: Dürrschnabel, Dominik, et al.
Published: (2024)
by: Dürrschnabel, Dominik, et al.
Published: (2024)
On the Average-Case Performance of Greedy for Maximum Coverage
by: Balkanski, Eric, et al.
Published: (2026)
by: Balkanski, Eric, et al.
Published: (2026)
The Directed Disjoint Paths Problem with Congestion
by: Bentert, Matthias, et al.
Published: (2025)
by: Bentert, Matthias, et al.
Published: (2025)
The Spanning Ratio of the Directed $Θ_6$-Graph is 5
by: Bose, Prosenjit, et al.
Published: (2026)
by: Bose, Prosenjit, et al.
Published: (2026)
Minimizing an Uncrossed Collection of Drawings
by: Hliněný, Petr, et al.
Published: (2023)
by: Hliněný, Petr, et al.
Published: (2023)
On the Uncrossed Number of Graphs
by: Balko, Martin, et al.
Published: (2024)
by: Balko, Martin, et al.
Published: (2024)
X-SYS: A Reference Architecture for Interactive Explanation Systems
by: Labarta, Tobias, et al.
Published: (2026)
by: Labarta, Tobias, et al.
Published: (2026)
On the Complexity of Minimum Riesz s-Energy Subset Selection in Euclidean and Ultrametric Spaces
by: Emmerich, Michael T. M., et al.
Published: (2026)
by: Emmerich, Michael T. M., et al.
Published: (2026)
DAG Scheduling in the BSP Model
by: Papp, Pál András, et al.
Published: (2023)
by: Papp, Pál András, et al.
Published: (2023)
ETH-Tight Complexity of Optimal Morse Matching on Bounded-Treewidth Complexes
by: Philip, Geevarghese, et al.
Published: (2026)
by: Philip, Geevarghese, et al.
Published: (2026)
An $11/6$-Approximation Algorithm for Vertex Cover on String Graphs
by: Bonnet, Édouard, et al.
Published: (2024)
by: Bonnet, Édouard, et al.
Published: (2024)
Induced Disjoint Paths Without an Induced Minor
by: Aboulker, Pierre, et al.
Published: (2025)
by: Aboulker, Pierre, et al.
Published: (2025)
Rotation-Invariant Vectorized Shape Representations
by: Shafieasl, Hamid, et al.
Published: (2026)
by: Shafieasl, Hamid, et al.
Published: (2026)
Similar Items
-
On the Diameter of Arrangements of Topological Disks
by: Abiad, Aida, et al.
Published: (2025) -
Finding Complex Patterns in Trajectory Data via Geometric Set Cover
by: Conradi, Jacobus, et al.
Published: (2023) -
Point Location in Constant Time
by: Chaganti, Sairam, et al.
Published: (2023) -
Lozenge Tiling by Computing Distances
by: Favreau, Jean-Marie, et al.
Published: (2026) -
Recognizing Penny and Marble Graphs is Hard for Existential Theory of the Reals
by: Lubiw, Anna, et al.
Published: (2025)