8 citations · 8 across the 6 of their papers we have counts for
11 papers
Visibility Queries in Simple Polygons
Sujoy Bhore, Chih-Hung Liu, Anurag Murty Naredla +6
Given a simple polygon with vertices, we consider the problem of constructing a data structure for visibility queries: for any query point , compute the visibility…
The Art of Being Difficult: Combining Human and AI Strengths to Find Adversarial Instances for Heuristics
Henri Nikoleit, Ankit Anand, Anurag Murty Naredla +1
We demonstrate the power of human-LLM collaboration in tackling open problems in theoretical computer science. Focusing on combinatorial optimization, we refine outputs from the Fu…
Separating Two Points with Obstacles in the Plane: Improved Upper and Lower Bounds
Jack Spalding-Jamieson, Anurag Murty Naredla
Given two points in the plane, and a set of "obstacles" given as curves through the plane with assigned weights, we consider the point-separation problem, which asks for the minimu…
Faster Approximation Algorithms for k-Center via Data Reduction
Arnold Filtser, Shaofeng H. -C. Jiang, Yi Li +4
We study efficient algorithms for the Euclidean -Center problem, focusing on the regime of large . We take the approach of data reduction by considering -coreset, which is…
Finding Increasingly Large Extremal Graphs with AlphaZero and Tabu Search
Abbas Mehrabian, Ankit Anand, Hyunjik Kim +16
This work studies a central extremal graph theory problem inspired by a 1975 conjecture of Erdős, which aims to find graphs with a given size (number of nodes) that maximize the nu…
The geodesic edge center of a simple polygon
Anna Lubiw, Anurag Murty Naredla
The geodesic edge center of a polygon is a point c inside the polygon that minimizes the maximum geodesic distance from c to any edge of the polygon, where geodesic distance is the…
Shortest Beer Path Queries in Interval Graphs
Rathish Das, Meng He, Eitan Kondratovsky +3
Our interest is in paths between pairs of vertices that go through at least one of a subset of the vertices known as beer vertices. Such a path is called a beer path, and the beer…
Distant Representatives for Rectangles in the Plane
Therese Biedl, Anna Lubiw, Anurag Murty Naredla +2
The input to the distant representatives problem is a set of objects in the plane and the goal is to find a representative point from each object while maximizing the distance…
The Visibility Center of a Simple Polygon
Anna Lubiw, Anurag Murty Naredla
We introduce the \emph{visibility center} of a set of points inside a polygon -- a point such that the maximum geodesic distance from to see any point in the set is min…
Reconstructing a Polyhedron between Polygons in Parallel Slices
Therese Biedl, Pavle Bulatovic, Veronika Irvine +3
Given two -vertex polygons, lying in the -plane at , and lying in the -plane at , a banded surface is a triang…
Token Swapping on Trees
Ahmad Biniaz, Kshitij Jain, Anna Lubiw +6
The input to the token swapping problem is a graph with vertices , and tokens with labels , one on each vertex. The goal is to get token…