MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for authors named "Anil Maheshwari" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

40 documents found, showing 1 through 10. Next 10 →

ATOM

I/O-efficient algorithms for bounded treewidth graphs
by Anil Maheshwari, Norbert Zeh — 2001 — In Proc. ACM-SIAM Symp. on Discrete Algorithms
…I/O-Efficient Algorithms for Bounded Treewidth Graphs Anil Maheshwari Norbert Zeh August 6, 2000…
Cited by 1 (0 self) – Add To MetaCart

I/O-efficient shortest path queries in geometric spanners
by Anil Maheshwari, Michiel Smid — 2001 — In Proceedings of the 7th International Workshop on Algorithms and Data Structures
…I/O-Efficient Shortest Path Queries in Geometric Spanners Anil Maheshwari1 ¡ , Michiel Smid2…
Cited by 1 (0 self) – Add To MetaCart

A Simple Optimal Parallel Algorithm for Reporting Paths in a Tree
by Anil Maheshwari, Andrzej Lingas, Andrzej Lingas — 1994
… of Computer Science Lund University Box 118, Lund. S-22 100, Sweden Andrzej.Lingas@(email omitted); Anil Maheshwari…
Cited by 1 (1 self) – Add To MetaCart

Fast approximations for sums of distances, clustering and the Fermat-Weber problem
by Anil Maheshwari, Pat Morin — 2002 — Computational Geometry: Theory and Apllications
… Bose z Carleton University Anil Maheshwari z Carleton University Pat Morin x McGill University…
Cited by 11 (2 self) – Add To MetaCart

External memory algorithms for outerplanar graphs
by Anil Maheshwari, Norbert Zeh — 1999 — In Proceedings of the 10th International Symposium on Algorithms and Computation
… External Memory Algorithms for Outerplanar Graphs Anil Maheshwari ? and Norbert Zeh School…
Cited by 15 (4 self) – Add To MetaCart

I/O-Efficient Algorithms for Graphs of Bounded Treewidth
by Anil Maheshwari, Norbert Zeh — 2000
…I/O-Ecient Algorithms for Graphs of Bounded Treewidth Anil Maheshwari Norbert Zeh October 19…
Cited by 12 (4 self) – Add To MetaCart

An improved algorithm for Hausdorff Voronoi diagram for non-crossing sets ∗†‡
by Frank Dehne, Anil Maheshwari, Ryan Taylor — 2006
…An improved algorithm for Hausdorff Voronoi diagram for non-crossing sets ∗†‡ Frank Dehne, Anil…
Add To MetaCart

Fast Approximation of Sums of Distances
by Prosenjit Bose, Anil Maheshwari, Pat Morin
…Fast Approximation of Sums of Distances Prosenjit Bose y Anil Maheshwari y Pat Morin y…
Add To MetaCart

On Reverse Nearest Neighbor Queries
by Extended Anil, Anil Maheshwari, Norbert Zeh — 2002
…On Reverse Nearest Neighbor Queries (extended abstract) Anil Maheshwari Jan Vahrenhold y…
Add To MetaCart

Shortest Anisotropic Paths on Terrains
by Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack — 1999 — In Proceedings of the 26th International Colloquium on Automata, Languages and Programming
…Shortest Anisotropic Paths on Terrains ? Mark Lanthier, Anil Maheshwari, Jorg-Rudiger Sack School…
Cited by 9 (1 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB