◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

A. Maheshwari

55 papers hereh-index 283.1k citations244 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author5
  • middle author45
  • last author4

Across the 54 of 55 papers where every author was matched, so the position is known.

fields
  • cs.CG47
  • cs.DM3
  • cs.DS3
  • cs.OS1
  • math.CO1
same name
  • A. Maheshwari — 4 papers, h 3
  • A. Maheshwari — 2 papers, h 2
  • A. Maheshwari — 2 papers, h 3
  • A. Maheshwari — 2 papers, h 8
  • A. Maheshwari — 1 paper, h 7

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20072023
most citedAnalysis of Farthest Point Sampling for Approximating Geodesics in a Graph

40 citations · 98 across the 42 of their papers we have counts for

collaborators
Showing 2012Show all

4 papers · 1 filter

cs.CG2012★ 2 cited

Similarity of Polygonal Curves in the Presence of Outliers

Jean-Lou De Carufel, Amin Gheibi, Anil Maheshwari +2

The Fréchet distance is a well studied and commonly used measure to capture the similarity of polygonal curves. Unfortunately, it exhibits a high sensitivity to the presence of out…

cs.CG2012★ 1 cited

Visiting All Sites with Your Dog

Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz

Given a polygonal curve P, a pointset S, and an ε> 0, we study the problem of finding a polygonal curve Q whose vertices are from S and has a Frechet distance less or equal to εto…

cs.CG2012★ 2 cited

Fixed-Orientation Equilateral Triangle Matching of Point Sets

Jasine Babu, Ahmad Biniaz, Anil Maheshwari +1

Given a point set P and a class C of geometric objects, GC​(P) is a geometric graph with vertex set P such that any two vertices p and q are adjacen…

cs.CG2012★ 6 cited

Space-efficient Algorithms for Visibility Problems in Simple Polygon

Minati De, Anil Maheshwari, Subhas C. Nandy

Given a simple polygon P consisting of n vertices, we study the problem of designing space-efficient algorithms for computing (i) the visibility polygon of a point inside P,…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.