:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Chung, Chaeyoon, Maheshwari, Anil, Smid, Michiel
Format:	Preprint
Published:	2026
Subjects:	Computational Geometry
Online Access:	https://arxiv.org/abs/2601.03516
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Euclidean Maximum Matchings in the Plane---Local to Global
by: Biniaz, Ahmad, et al.
Published: (2024)

Tight Bounds on the Number of Closest Pairs in Vertical Slabs
by: Biniaz, Ahmad, et al.
Published: (2025)

Metric and Geometric Spanners that are Resilient to Degree-Bounded Edge Faults
by: Biniaz, Ahmad, et al.
Published: (2024)

Polychromatic Coloring of Tuples in Hypergraphs
by: Biniaz, Ahmad, et al.
Published: (2025)

Computing Oriented Spanners and their Dilation
by: Buchin, Kevin, et al.
Published: (2024)

Online Class Cover Problem
by: De, Minati, et al.
Published: (2023)

Constrained Two-Line Center Problems
by: Ahn, Taehoon, et al.
Published: (2024)

Noncrossing Longest Paths and Cycles
by: Aloupis, Greg, et al.
Published: (2024)

Optimal Algorithm for the Planar Two-Center Problem
by: Cho, Kyungjin, et al.
Published: (2020)

Completely Independent Steiner Trees
by: Maheshwari, Anil, et al.
Published: (2026)

Net and Prune: A Linear Time Algorithm for Euclidean Distance Problems
by: Har-Peled, Sariel, et al.
Published: (2014)

Partial Domination in Some Geometric Intersection Graphs and Some Complexity Results
by: Dutta, Madhura, et al.
Published: (2025)

On Stable Approximation Algorithms for Geometric Coverage Problems
by: de Berg, Mark, et al.
Published: (2024)

A Subquadratic Time Approximation Algorithm for Individually Fair k-Center
by: Ebbens, Matthijs, et al.
Published: (2024)

Computing shortest paths amid non-overlapping weighted disks
by: Bose, Prosenjit, et al.
Published: (2024)

Approximation Algorithms for the Freeze Tag Problem inside Polygons
by: Rajabi-Alni, Fatemeh, et al.
Published: (2024)

A Linear Time Algorithm for the Maximum Overlap of Two Convex Polygons Under Translation
by: Chan, Timothy M., et al.
Published: (2025)

Subquadratic Approximation Algorithms for Separating Two Points with Objects in the Plane
by: Lynch, Jayson, et al.
Published: (2025)

Contiguous Boundary Guarding
by: Biniaz, Ahmad, et al.
Published: (2024)

New Complexity and Algorithmic Bounds for Minimum Consistent Subsets
by: Banik, Aritra, et al.
Published: (2024)

Approximation Algorithms for Minimum Sum of Moving-Distance and Opening-Costs Target Coverage Problem
by: Zhao, Lei, et al.
Published: (2024)

A dynamic $(1+\varepsilon)$-spanner for disk intersection graphs
by: de Berg, Sarita, et al.
Published: (2026)

A Simple 2-Approximation Algorithm For Minimum Manhattan Network Problem
by: Sanim, Md. Musfiqur Rahman, et al.
Published: (2024)

Empirical Analysis Of Heuristic and Approximation Algorithms for the The Mutual-Visibility Problem
by: Stojanović, Vanja, et al.
Published: (2025)

Two Results on LPT: A Near-Linear Time Algorithm and Parcel Delivery using Drones
by: Chandran, L. Sunil, et al.
Published: (2024)

Approximation Schemes and Structural Barriers for the Two-Dimensional Knapsack Problem with Rotations
by: Kar, Debajyoti, et al.
Published: (2026)

Tighter Bounds for the Randomized Polynomial-Time Simplex Algorithm for Linear Programming
by: Gibor, Daniel
Published: (2025)

Approximation Algorithms for Anchored Multiwatchman Routes
by: Mitchell, Joseph S. B., et al.
Published: (2024)

Orthogonal Strip Partitioning of Polygons: Lattice-Theoretic Algorithms and Lower Bounds
by: Chung, Jaehoon
Published: (2026)

An Optimal Algorithm for Computing Many Faces in Line Arrangements
by: Wang, Haitao
Published: (2026)

Fast Approximation Algorithms for Piercing Boxes by Points
by: Agarwal, Pankaj K., et al.
Published: (2023)

An Improved Bound for Plane Covering Paths
by: Akitaya, Hugo A., et al.
Published: (2025)

Deciding if a DAG is Interesting is Hard
by: De Carufel, Jean-Lou, et al.
Published: (2025)

MergeDJD: A Fast Constructive Algorithm with Piece Merging for the Two-Dimensional Irregular Bin Packing Problem
by: Zhou, Yi, et al.
Published: (2026)

Near-Linear and Parameterized Approximations for Maximum Cliques in Disk Graphs
by: Gao, Jie, et al.
Published: (2025)

A Deterministic Bicriteria Approximation Algorithm for the Art Gallery Problem
by: Elbassioni, Khaled
Published: (2025)

A Linear Time Algorithm for Finding Minimum Flip Sequences between Plane Spanning Paths in Convex Point Sets
by: Aichholzer, Oswin, et al.
Published: (2025)

Fast Static and Dynamic Approximation Algorithms for Geometric Optimization Problems: Piercing, Independent Set, Vertex Cover, and Matching
by: Bhore, Sujoy, et al.
Published: (2024)

Computing Topological Transition Sets for Line-Line-Circle Trisectors in $R^3$
by: Park, Eunku
Published: (2026)

Approximation Algorithms for Smallest Intersecting Balls
by: Zheng, Jiaqi, et al.
Published: (2024)