Anil Maheshwari

Bing Citeseer DBLP Google Google Scholar Kosmix Wikipedia Yahoo!
Loading Google Thumbnails...
2011
31An Approximation Algorithm for the Noah's Ark Problem with Random Feature Loss. Glenn Hickey, Mathieu Blanchette, Paz Carmi, Anil Maheshwari, Norbert Zeh. IEEE/ACM Trans. Comput. Biology Bioinform. (8): 551-556 (2011). Web SearchBibTeXDownload
2009
30I/O-Efficient Algorithms for Graphs of Bounded Treewidth. Anil Maheshwari, Norbert Zeh. Algorithmica (54): 413-469 (2009). Web SearchBibTeXDownload
29Geometric spanners with small chromatic number. Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh. Comput. Geom. (42): 134-146 (2009). Web SearchBibTeXDownload
28I/O and Space-Efficient Path Traversal in Planar Graphs. Craig Dillabaugh, Meng He, Anil Maheshwari, Norbert Zeh. ISAAC 2009, 1175-1184. Web SearchBibTeXDownload
2008
27I/O-efficient algorithms for computing planar geometric spanners. Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh. Comput. Geom. (40): 252-271 (2008). Web SearchBibTeXDownload
26I/O-Efficient Planar Separators. Anil Maheshwari, Norbert Zeh. SIAM J. Comput. (38): 767-801 (2008). Web SearchBibTeXDownload
25NAPX: A Polynomial Time Approximation Scheme for the Noah's Ark Problem. Glenn Hickey, Paz Carmi, Anil Maheshwari, Norbert Zeh. WABI 2008, 76-86. Web SearchBibTeXDownload
2007
24Space-efficient geometric divide-and-conquer algorithms. Prosenjit Bose, Anil Maheshwari, Pat Morin, Jason Morrison, Michiel H. M. Smid, Jan Vahrenhold. Comput. Geom. (37): 209-227 (2007). Web SearchBibTeXDownload
23Geometric Spanners With Small Chromatic Number. Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh. CoRR (abs/0711.0114) (2007). Web SearchBibTeXDownload
22Geometric Spanners with Small Chromatic Number. Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh. WAOA 2007, 75-88. Web SearchBibTeXDownload
2006
21I/O-Efficient Well-Separated Pair Decomposition and Applications. Sathish Govindarajan, Tamás Lukovszki, Anil Maheshwari, Norbert Zeh. Algorithmica (45): 585-614 (2006). Web SearchBibTeXDownload
20A Coarse Grained Parallel Algorithm for Hausdorff Voronoi Diagrams. Frank K. H. A. Dehne, Anil Maheshwari, Ryan Taylor. ICPP 2006, 497-504. Web SearchBibTeXDownload
2004
19Approximating geometric bottleneck shortest paths. Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel H. M. Smid, Norbert Zeh. Comput. Geom. (29): 233-249 (2004). Web SearchBibTeXDownload
18I/O-Optimal Algorithms for Outerplanar Graphs. Anil Maheshwari, Norbert Zeh. J. Graph Algorithms Appl. (8): 47-87 (2004). Web SearchBibTeXDownload
2003
17An external memory data structure for shortest path queries. David A. Hutchinson, Anil Maheshwari, Norbert Zeh. Discrete Applied Mathematics (126): 55-82 (2003). Web SearchBibTeXDownload
16Approximating Geometric Bottleneck Shortest Paths. Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel H. M. Smid, Norbert Zeh. STACS 2003, 38-49. Web SearchBibTeXDownload
2002
15A Survey of Techniques for Designing I/O-Efficient Algorithms. Anil Maheshwari, Norbert Zeh. Algorithms for Memory Hierarchies 2002, 36-61. Web SearchBibTeXDownload
14On reverse nearest neighbor queries. Anil Maheshwari, Jan Vahrenhold, Norbert Zeh. CCCG 2002, 128-132. Web SearchBibTeXDownload
13I/O-optimal algorithms for planar graphs using separators. Anil Maheshwari, Norbert Zeh. SODA 2002, 372-381. Web SearchBibTeXDownload
12Bulk Synchronous Parallel Algorithms for the External Memory Model. Frank K. H. A. Dehne, Wolfgang Dittrich, David A. Hutchinson, Anil Maheshwari. Theory Comput. Syst. (35): 567-597 (2002). Web SearchBibTeXDownload
2001
11I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems. Tamás Lukovszki, Anil Maheshwari, Norbert Zeh. FSTTCS 2001, 244-255. Web SearchBibTeXDownload
10I/O-efficient algorithms for graphs of bounded treewidth. Anil Maheshwari, Norbert Zeh. SODA 2001, 89-90. Web SearchBibTeXDownload
9I/O-Efficient Shortest Path Queries in Geometric Spanners. Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh. WADS 2001, 287-299. Web SearchBibTeXDownload
2000
8I/O-Efficient Well-Separated Pair Decomposition and Its Applications. Sathish Govindarajan, Tamás Lukovszki, Anil Maheshwari, Norbert Zeh. ESA 2000, 220-231. Web SearchBibTeXDownload
1999
7An External Memory Data Structure for Shortest Path Queries. David A. Hutchinson, Anil Maheshwari, Norbert Zeh. COCOON 1999, 51-60. Web SearchBibTeXDownload
6Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms. Frank K. H. A. Dehne, David A. Hutchinson, Anil Maheshwari, Wolfgang Dittrich. IPPS/SPDP 1999, 14-20. Web SearchBibTeXDownload
5External Memory Algorithms for Outerplanar Graphs. Anil Maheshwari, Norbert Zeh. ISAAC 1999, 307-316. Web SearchBibTeXDownload
4Parallel Virtual Memory. Frank K. H. A. Dehne, Wolfgang Dittrich, David A. Hutchinson, Anil Maheshwari. SODA 1999, 889-890. Web SearchBibTeXDownload
1995
3NC-Algorithms for Minimum Link Path and Related Problems. Vijay Chandru, Subir Kumar Ghosh, Anil Maheshwari, V. T. Rajan, Sanjeev Saluja. J. Algorithms (19): 173-203 (1995). Web SearchBibTeX
1993
2Characterizing and Recognizing Weak Visibility Polygons. Subir Kumar Ghosh, Anil Maheshwari, Sudebkumar Prasant Pal, Sanjeev Saluja, C. E. Veni Madhavan. Comput. Geom. (3): 213-233 (1993). Web SearchBibTeXDownload
1991
1Computing the Shortest Path Tree in a Weak Visibility Polygon. Subir Kumar Ghosh, Anil Maheshwari, Sudebkumar Prasant Pal, Sanjeev Saluja, C. E. Veni Madhavan. FSTTCS 1991, 369-389. Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research