
Exact and Approximation Algorithms for ManyToMany Point Matching in the Plane
Given two sets S and T of points in the plane, of total size n, a manyt...
read it

A lineartime algorithm for semitotal domination in strongly chordal graphs
In a graph G=(V,E) with no isolated vertex, a dominating set D ⊆ V, is c...
read it

Constant Delay Lattice Train Schedules
The following geometric vehicle scheduling problem has been considered: ...
read it

A Simple Randomized O(n log n)–Time ClosestPair Algorithm in Doubling Metrics
Consider a metric space (P,dist) with N points whose doubling dimension ...
read it

Linear Size Planar Manhattan Network for Convex Point Sets
Let G = (V, E) be an edgeweighted geometric graph such that every edge ...
read it

Maximum Bipartite Subgraph of Geometric Intersection Graphs
We study the Maximum Bipartite Subgraph(MBS) problem, which is defined a...
read it

Packing BoundaryAnchored Rectangles and Squares
Consider a set P of n points on the boundary of an axisaligned square Q...
read it

Color spanning Localized query
Let P be a set of n points and each of the points is colored with one of...
read it

Flip Distance to some Plane Configurations
We study an old geometric optimization problem in the plane. Given a per...
read it

Computing Maximum Independent Set on Outerstring Graphs and Their Relatives
A graph G with n vertices is called an outerstring graph if it has an in...
read it

On the Minimum Consistent Subset Problem
Let P be a set of n colored points in the plane. Introduced by Hart (196...
read it

Plane and Planarity Thresholds for Random Geometric Graphs
A random geometric graph, G(n,r), is formed by choosing n points indepen...
read it

Approximability of Covering Cells with Line Segments
In COCOA 2015, Korman et al. studied the following geometric covering pr...
read it

Rectilinear Shortest Paths Among Transient Obstacles
This paper presents an optimal Θ(n n) algorithm for determining timemi...
read it

TimeDependent Shortest Path Queries Among Growing Discs
The determination of timedependent collisionfree shortest paths has re...
read it

Approximating Dominating Set on Intersection Graphs of Rectangles and Lframes
We consider the Minimum Dominating Set (MDS) problem on the intersection...
read it

Approximating Dominating Set on Intersection Graphs of Lframes
We consider the Dominating Set (DS) problem on the intersection graphs o...
read it

Faster Algorithms for some Optimization Problems on Collinear Points
We propose faster algorithms for the following three optimization proble...
read it

Expanding Visibility Polygons by Mirrors upto at least K units
We consider extending visibility polygon (VP) of a given point q (VP(q))...
read it

Compatible 4Holes in Point Sets
Counting interiordisjoint empty convex polygons in a point set is a typ...
read it

Analysis of Farthest Point Sampling for Approximating Geodesics in a Graph
A standard way to approximate the distance between any two vertices p an...
read it

Similarity of Polygonal Curves in the Presence of Outliers
The Fréchet distance is a well studied and commonly used measure to capt...
read it

An Approximation Algorithm for Computing Shortest Paths in Weighted 3d Domains
We present the first polynomial time approximation algorithm for computi...
read it

Customer Appeasement Scheduling
Almost all of the current process scheduling algorithms which are used i...
read it
Anil Maheshwari
is this you? claim profile