:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Madireddy, Raghunath Reddy, Mudgal, Apurva, Pandit, Supantha
Format:	Preprint
Published:	2025
Subjects:	Computational Geometry
Online Access:	https://arxiv.org/abs/2504.12022
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A greedy maximal sweepline algorithm for a Jordan curve
by: Mudgal, Apurva
Published: (2026)

A proof of Jordan curve theorem based on the sweepline algorithm for trapezoidal decomposition of a polygon
by: Mudgal, Apurva
Published: (2026)

Convexity of near-optimal orthogonal-pair-free sets on the unit sphere
by: Mudgal, Apurva
Published: (2024)

Asymmetric Separation Problem for Bichromatic Point Set
by: Maji, Sukanya, et al.
Published: (2024)

Improved Hardness of Approximation for Geometric Bin Packing
by: Ray, Arka, et al.
Published: (2023)

Approximation Schemes for Geometric Knapsack for Packing Spheres and Fat Objects
by: Acharya, Pritam, et al.
Published: (2024)

A Framework for Efficient Approximation Schemes on Geometric Packing Problems of $d$-dimensional Fat Objects
by: Chagas, Vítor Gomes, et al.
Published: (2024)

Hardness of Packing, Covering and Partitioning Simple Polygons with Unit Squares
by: Abrahamsen, Mikkel, et al.
Published: (2024)

Approximation and Hardness of Polychromatic TSP
by: Schibler, Thomas, et al.
Published: (2025)

Polynomial-Time Approximation Schemes for Independent Packing Problems on Fractionally Tree-Independence-Number-Fragile Graphs
by: Galby, Esther, et al.
Published: (2023)

On Approximation Schemes for Stabbing Rectilinear Polygons
by: Khan, Arindam, et al.
Published: (2024)

Location-Aware Dispersion on Anonymous Graphs
by: Himani, et al.
Published: (2026)

Improved Approximation Algorithms for Three-Dimensional Bin Packing
by: Kar, Debajyoti, et al.
Published: (2025)

A Fast Unsupervised Scheme for Polygonal Approximation
by: Ray, Bimal Kumar
Published: (2025)

Faster Approximation Scheme for Euclidean $k$-TSP
by: van Wijland, Ernest, et al.
Published: (2023)

How Packed Is It, Really?
by: Har-Peled, Sariel, et al.
Published: (2021)

Dominating Set, Independent Set, Discrete $k$-Center, Dispersion, and Related Problems for Planar Points in Convex Position
by: Tkachenko, Anastasiia, et al.
Published: (2024)

Dimension-Free Parameterized Approximation Schemes for Hybrid Clustering
by: Gadekar, Ameet, et al.
Published: (2025)

Online Packing of Orthogonal Polygons
by: Gerlach, Tim, et al.
Published: (2026)

On Approximating the Dynamic and Discrete Network Flow Problem
by: Manna, Bubai, et al.
Published: (2024)

Data Structures for Approximate Discrete Fréchet Distance
by: van der Hoog, Ivor, et al.
Published: (2022)

A Gap-ETH-Tight Approximation Scheme for Euclidean TSP
by: Kisfaludi-Bak, Sándor, et al.
Published: (2020)

Packing d-dimensional balls into a d+1-dimensional container
by: Alt, Helmut, et al.
Published: (2021)

Separator for $c$-Packed Segments and Curves
by: Har-Peled, Sariel
Published: (2026)

Shadoks Approach to Knapsack Polygonal Packing
by: da Fonseca, Guilherme D., et al.
Published: (2024)

Approximation Schemes for Subset TSP and Steiner Tree on Geometric Intersection Graphs
by: Kisfaludi-Bak, Sándor, et al.
Published: (2026)

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

FPT Approximation Schemes for Min-Sum Radii and Min-Sum Diameters Clustering
by: Grandoni, Fabrizio, et al.
Published: (2026)

Improved Total Domination and Total Roman Domination in Unit Disk Graphs
by: Rout, Sasmita, et al.
Published: (2024)

Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces
by: Abbasi, Fateme, et al.
Published: (2023)

An $O(n \log n)$-Time Approximation Scheme for Geometric Many-to-Many Matching
by: Bandyapadhyay, Sayan, et al.
Published: (2024)

The Discrete Schwarz-Pick Lemma For Circle Packings Revisited
by: Lodha, Arham Rajendra
Published: (2025)

Report on Nearest Dominating Point Queries
by: Mishra, Naman, et al.
Published: (2025)

Square Packing with Asymptotically Smallest Waste Only Needs Good Squares
by: Bui, Hong Duc
Published: (2025)

Who Needs Crossings?: Noncrossing Linkages are Universal, and Deciding (Global) Rigidity is Hard
by: Abel, Zachary, et al.
Published: (2025)

Packing unequal disks in the Euclidean plane
by: Fernique, Thomas
Published: (2023)

Solution-Hashing Search Based on Layout-Graph Transformation for Unequal Circle Packing
by: Zhou, Jianrong, et al.
Published: (2024)

Hierarchical Rectangle Packing Solved by Multi-Level Recursive Logic-based Benders Decomposition
by: Grus, Josef, et al.
Published: (2025)

Online Sorting and Translational Packing of Convex Polygons
by: Aamand, Anders, et al.
Published: (2021)

Flipping Matchings is Hard
by: Binucci, Carla, et al.
Published: (2025)