#### Filter Results:

- Full text PDF available (76)

#### Publication Year

1987

2019

- This year (12)
- Last 5 years (87)
- Last 10 years (147)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack
- J. ACM
- 2005

In this article, we present an approximation algorithm for solving the single source shortest paths problem on weighted polyhedral surfaces. We consider a polyhedral surface P as consisting of n… (More)

Let P be a simple polyhedron, possibly non-convex, whose boundary is composed of n triangular faces, and in which each face has an associated positive weight. The cost of travel through each face is… (More)

- Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack
- Symposium on Computational Geometry
- 1997

Shortest path problems are among the fundamental prob lems studied in computational geometry. In this video, we consider the problem of computing a shortest cost path between two points s and t on a… (More)

We consider the classical geometric problem of determining a shortest path through a weighted domain. We present approximation algorithms that compute e-short paths, i.e., paths whose costs are… (More)

- David A. Hutchinson, Anil Maheshwari, Norbert Zeh
- COCOON
- 1998

We present results related to satisfying shortest path queries on a planar graph stored in external memory. In particular, we show how to store rooted trees in external memory so that bottom-up paths… (More)

- Prosenjit Bose, Meng He, Anil Maheshwari, Pat Morin
- WADS
- 2009

We present a succinct representation of a set of n points on an n ×n grid using $n\lg n + o(n\lg n)$ bits to support orthogonal range counting in $O(\lg n /\lg\lg n)$ time, and range reporting in… (More)

- Anil Maheshwari, Norbert Zeh
- SODA
- 2002

We present I/O-optimal algorithms for several fundamental problems on planar graphs. Our main contribution is an I/O-efficient algorithm for computing a small vertex separator of an unweighted planar… (More)

- Lyudmil Aleksandrov, Hristo N. Djidjev, Hua Guo, Anil Maheshwari
- ALENEX
- 2002

A graph separator is a set of vertices or edges whose removal divides an input graph into components of bounded size. This paper describes new algorithms for computing separators in planar graphs as… (More)

The research reported here represents part of an on-going project. Family businesses participating in the Partnership with Family Business at the Weatherhead School of Management, Case Western… (More)

In this thesis, we study I/O-efficient algorithms for problems related to computing shortest paths in outerplanar and planar graphs and in spanner graphs for point sets in d-dimensional space and… (More)