dblp.uni-trier.dewww.uni-trier.de

Anil Maheshwari Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
99EEProsenjit Bose, Eric Y. Chen, Meng He, Anil Maheshwari, Pat Morin: Succinct geometric indexes supporting point location queries. SODA 2009: 635-644
98EEProsenjit Bose, Meng He, Anil Maheshwari, Pat Morin: Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing. WADS 2009: 98-109
97EESubir Kumar Ghosh, Partha P. Goswami, Anil Maheshwari, Subhas C. Nandy, Sudebkumar Prasant Pal, Swami Sarvattomananda: Algorithms for Computing Diffuse Reflection Paths in Polygons. WALCOM 2009: 47-58
96EEMustaq Ahmed, Anna Lubiw, Anil Maheshwari: Shortest Gently Descending Paths. WALCOM 2009: 59-70
95EEAnil Maheshwari, Norbert Zeh: I/O-Efficient Algorithms for Graphs of Bounded Treewidth. Algorithmica 54(3): 413-469 (2009)
94EEAnil Maheshwari, Stefanie Wuhrer: Geodesic Paths On 3D Surfaces: Survey and Open Problems CoRR abs/0904.2550: (2009)
93EEProsenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh: Geometric spanners with small chromatic number. Comput. Geom. 42(2): 134-146 (2009)
92EETetsuo Asano, Prosenjit Bose, Paz Carmi, Anil Maheshwari, Chang Shu, Michiel H. M. Smid, Stefanie Wuhrer: A linear-space algorithm for distance preserving graph embedding. Comput. Geom. 42(4): 289-304 (2009)
91EERossen Atanassov, Prosenjit Bose, Mathieu Couture, Anil Maheshwari, Pat Morin, Michel Paquette, Michiel H. M. Smid, Stefanie Wuhrer: Algorithms for optimal outlier removal. J. Discrete Algorithms 7(2): 239-248 (2009)
90EEProsenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Pat Morin, Michiel H. M. Smid: Spanners of Complete k-Partite Geometric Graphs. SIAM J. Comput. 38(5): 1803-1820 (2009)
2008
89EEHua Guo, Anil Maheshwari, Jörg-Rüdiger Sack: Shortest Path Queries in Polygonal Domains. AAIM 2008: 200-211
88EECraig Dillabaugh, Meng He, Anil Maheshwari: Succinct and I/O Efficient Data Structures for Traversal in Trees. ISAAC 2008: 112-123
87EEProsenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Pat Morin, Michiel H. M. Smid: Spanners of Complete k -Partite Geometric Graphs. LATIN 2008: 170-181
86EEProsenjit Bose, Paz Carmi, Mohammad Farshi, Anil Maheshwari, Michiel H. M. Smid: Computing the Greedy Spanner in Near-Quadratic Time. SWAT 2008: 390-401
85EEGlenn Hickey, Paz Carmi, Anil Maheshwari, Norbert Zeh: NAPX: A Polynomial Time Approximation Scheme for the Noah's Ark Problem. WABI 2008: 76-86
84EEMustaq Ahmed, Sandip Das, Sachin Lodha, Anna Lubiw, Anil Maheshwari, Sasanka Roy: Approximation Algorithms for Shortest Descending Paths in Terrains CoRR abs/0805.1401: (2008)
83EEGlenn Hickey, Paz Carmi, Anil Maheshwari, Norbert Zeh: NAPX: A Polynomial Time Approximation Scheme for the Noah's Ark Problem CoRR abs/0805.1661: (2008)
82EEProsenjit Bose, Eric Y. Chen, Meng He, Anil Maheshwari, Pat Morin: Succinct Geometric Indexes Supporting Point Location Queries CoRR abs/0805.4147: (2008)
81EEAnil Maheshwari, Michiel H. M. Smid, Norbert Zeh: I/O-efficient algorithms for computing planar geometric spanners. Comput. Geom. 40(3): 252-271 (2008)
80EEProsenjit Bose, Hua Guo, Evangelos Kranakis, Anil Maheshwari, Pat Morin, Jason Morrison, Michiel H. M. Smid, Yihui Tang: On the false-positive rate of Bloom filters. Inf. Process. Lett. 108(4): 210-213 (2008)
79EEAnil Maheshwari, Norbert Zeh: I/O-Efficient Planar Separators. SIAM J. Comput. 38(3): 767-801 (2008)
2007
78 Tetsuo Asano, Prosenjit Bose, Paz Carmi, Anil Maheshwari, Chang Shu, Michiel H. M. Smid, Stefanie Wuhrer: Linear-Space Algorithms for Distance Preserving Embedding. CCCG 2007: 185-188
77 Sasanka Roy, Sachin Lodha, Sandip Das, Anil Maheshwari: Approximate Shortest Descent Path on a Terrain. CCCG 2007: 189-192
76EEMohammad R. Nikseresht, David A. Hutchinson, Anil Maheshwari: Experiments with a Parallel External Memory System. HiPC 2007: 59-70
75EEHua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack: Shortest Path Queries Between Geometric Objects on Surfaces. ICCSA (1) 2007: 82-95
74EEAnil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack, Jiehua Yi: An O ( n 2log n ) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the Plane. ISAAC 2007: 668-680
73EEProsenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh: Geometric Spanners with Small Chromatic Number. WAOA 2007: 75-88
72EEProsenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh: Geometric Spanners With Small Chromatic Number CoRR abs/0711.0114: (2007)
71EEProsenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Pat Morin, Michiel H. M. Smid: Spanners of Complete $k$-Partite Geometric Graphs CoRR abs/0712.0554: (2007)
70EEProsenjit Bose, Anil Maheshwari, Pat Morin, Jason Morrison, Michiel H. M. Smid, Jan Vahrenhold: Space-efficient geometric divide-and-conquer algorithms. Comput. Geom. 37(3): 209-227 (2007)
2006
69EEFrank K. H. A. Dehne, Anil Maheshwari, Ryan Taylor: A Coarse Grained Parallel Algorithm for Hausdorff Voronoi Diagrams. ICPP 2006: 497-504
68EELyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack: Approximate Shortest Path Queries on Weighted Polyhedral Surfaces. MFCS 2006: 98-109
67EELyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil Maheshwari: Partitioning planar graphs with costs and weights. ACM Journal of Experimental Algorithmics 11: (2006)
66EEAnil Maheshwari, Michiel H. M. Smid: A Dynamic Dictionary for Priced Information with Application. Algorithmica 44(2): 151-165 (2006)
65EESathish Govindarajan, Tamás Lukovszki, Anil Maheshwari, Norbert Zeh: I/O-Efficient Well-Separated Pair Decomposition and Applications. Algorithmica 45(4): 585-614 (2006)
2005
64EELyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack: Determining approximate shortest paths on weighted polyhedral surfaces. J. ACM 52(1): 25-53 (2005)
2004
63EEProsenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel H. M. Smid, Norbert Zeh: Approximating geometric bottleneck shortest paths. Comput. Geom. 29(3): 233-249 (2004)
62EEAnil Maheshwari, Norbert Zeh: I/O-Optimal Algorithms for Outerplanar Graphs. J. Graph Algorithms Appl. 8: 47-87 (2004)
2003
61EELyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack: An Improved Approximation Algorithm for Computing Geometric Shortest Paths. FCT 2003: 246-257
60EEAnil Maheshwari, Michiel H. M. Smid: A Dynamic Dictionary for Priced Information with Application. ISAAC 2003: 16-25
59EEProsenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel H. M. Smid, Norbert Zeh: Approximating Geometric Bottleneck Shortest Paths. STACS 2003: 38-49
58 Prosenjit Bose, Anil Maheshwari, Pat Morin: Fast approximations for sums of distances, clustering and the Fermat-Weber problem. Comput. Geom. 24(3): 135-146 (2003)
57 Prosenjit Bose, Marc J. van Kreveld, Anil Maheshwari, Pat Morin, Jason Morrison: Translating a regular grid over a point set. Comput. Geom. 25(1-2): 21-34 (2003)
56 David A. Hutchinson, Anil Maheshwari, Norbert Zeh: An external memory data structure for shortest path queries. Discrete Applied Mathematics 126(1): 55-82 (2003)
2002
55EELyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil Maheshwari: Partitioning Planar Graphs with Costs and Weights. ALENEX 2002: 98-110
54EEAnil Maheshwari, Norbert Zeh: A Survey of Techniques for Designing I/O-Efficient Algorithms. Algorithms for Memory Hierarchies 2002: 36-61
53EEAnil Maheshwari, Jan Vahrenhold, Norbert Zeh: On reverse nearest neighbor queries. CCCG 2002: 128-132
52EEAnil Maheshwari, Norbert Zeh: I/O-optimal algorithms for planar graphs using separators. SODA 2002: 372-381
51EEFrank K. H. A. Dehne, Wolfgang Dittrich, David A. Hutchinson, Anil Maheshwari: Bulk Synchronous Parallel Algorithms for the External Memory Model. Theory Comput. Syst. 35(6): 567-597 (2002)
2001
50EETamás Lukovszki, Anil Maheshwari, Norbert Zeh: I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems. FSTTCS 2001: 244-255
49EEAnil Maheshwari, Norbert Zeh: I/O-efficient algorithms for graphs of bounded treewidth. SODA 2001: 89-90
48EEProsenjit Bose, Anil Maheshwari, Pat Morin, Jason Morrison: The Grid Placement Problem. WADS 2001: 180-191
47EEAnil Maheshwari, Michiel H. M. Smid, Norbert Zeh: I/O-Efficient Shortest Path Queries in Geometric Spanners. WADS 2001: 287-299
46EEMark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack: Approximating Shortest Paths on Weighted Polyhedral Surfaces. Algorithmica 30(4): 527-562 (2001)
45 Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Jörg-Rüdiger Sack, Jorge Urrutia: Ray shooting from convex ranges. Discrete Applied Mathematics 108(3): 259-267 (2001)
44EEWolfgang Dittrich, David A. Hutchinson, Anil Maheshwari: Blocking in Parallel Multisearch Problems. Theory Comput. Syst. 34(2): 145-189 (2001)
2000
43EESathish Govindarajan, Tamás Lukovszki, Anil Maheshwari, Norbert Zeh: I/O-Efficient Well-Separated Pair Decomposition and Its Applications. ESA 2000: 220-231
42EELyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack: Approximation algorithms for geometric shortest path problems. STOC 2000: 286-295
1999
41EEDavid A. Hutchinson, Anil Maheshwari, Norbert Zeh: An External Memory Data Structure for Shortest Path Queries. COCOON 1999: 51-60
40EEMark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack: Shortest Anisotropic Paths on Terrains. ICALP 1999: 524-533
39EEFrank K. H. A. Dehne, David A. Hutchinson, Anil Maheshwari, Wolfgang Dittrich: Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms. IPPS/SPDP 1999: 14-20
38EEAnil Maheshwari, Norbert Zeh: External Memory Algorithms for Outerplanar Graphs. ISAAC 1999: 307-316
37EEFrank K. H. A. Dehne, Wolfgang Dittrich, David A. Hutchinson, Anil Maheshwari: Parallel Virtual Memory. SODA 1999: 889-890
36EEAnil Maheshwari: Database Security for the Web. IS Management 16(2): 85-88 (1999)
35 Anil Maheshwari, Jörg-Rüdiger Sack: Simple Optimal Algorithms for Rectilinear Link Path and Polygon Separation Problems. Parallel Processing Letters 9(1): 31-42 (1999)
1998
34 Prosenjit Bose, Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Anil Maheshwari: Polygon Cutting: Revisited. JCDCG 1998: 81-92
33 Prosenjit Bose, Jurek Czyzowicz, Evangelos Kranakis, Anil Maheshwari: Algorithms for Packing Two Circles in a Convex Polygon. JCDCG 1998: 93-103
32EEWolfgang Dittrich, David A. Hutchinson, Anil Maheshwari: Blocking in Parallel Multisearch Problems (Extended Abstract). SPAA 1998: 98-107
31EELyudmil Aleksandrov, Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack: An epsilon-Approximation for Weighted Shortest Paths on Polyhedral Surfaces. SWAT 1998: 11-22
1997
30EEAnil Maheshwari, Pat Morin, Jörg-Rüdiger Sack: Progressive TINs: Algorithms and Applications. ACM-GIS 1997: 24-29
29EEMark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack: Approximating Weighted Shortest Paths on Polyhedral Surfaces. Symposium on Computational Geometry 1997: 274-283
28EEMark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack: Approximating Weighted Shortest Paths on Polyhedral Surfaces. Symposium on Computational Geometry 1997: 485-486
27EEEvangelos Kranakis, Danny Krizanc, Anil Maheshwari, Marc Noy, Jörg-Rüdiger Sack, Jorge Urrutia: Stage-graph Representations. Discrete Applied Mathematics 75(1): 71-80 (1997)
26EESrinivasa Rao Arikati, Anil Maheshwari, Christos D. Zaroliagis: Efficient Computation of Implicit Representations of Sparse Graphs. Discrete Applied Mathematics 78(1-3): 1-16 (1997)
25 Andrzej Lingas, Anil Maheshwari: A Simple Optimal Parallel Algorithm for Reporting Paths in a Tree. Parallel Processing Letters 7(1): 3-11 (1997)
24EEFrank Bauernöppel, Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Jörg-Rüdiger Sack, Jorge Urrutia: Planar Stage Graphs: Characterizations and Applications. Theor. Comput. Sci. 175(2): 239-255 (1997)
1996
23EEDavid A. Hutchinson, Mark Lanthier, Anil Maheshwari, Doron Nussbaum, David Roytenberg, Jörg-Rüdiger Sack: Parallel Neighbourhood Modelling. ACM-GIS 1996: 25-34
22 David A. Hutchinson, L. Küttner, Mark Lanthier, Anil Maheshwari, Doron Nussbaum, David Roytenberg, Jörg-Rüdiger Sack: Parallel Neighborhood Modeling. SPAA 1996: 204-207
21 Amitava Datta, Anil Maheshwari, Jörg-Rüdiger Sack: Optimal Parallel Algorithms for Direct Dominance Problems. Nord. J. Comput. 3(1): 72-88 (1996)
20EESrinivasa Rao Arikati, Anil Maheshwari: Realizing Degree Sequences in Parallel. SIAM J. Discrete Math. 9(2): 317-338 (1996)
1995
19EEFrank Bauernöppel, Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Marc Noy, Jörg-Rüdiger Sack, Jorge Urrutia: Optimal Shooting: Characterizations and Applications. ICALP 1995: 220-231
18 Anil Maheshwari, Richard J. Boland Jr.: Reflection and Representation: An Experimental Examination of Computer-Based Representation to Support Reflective Thinking. ICIS 1995: 189-195
17 Andrzej Lingas, Anil Maheshwari, Jörg-Rüdiger Sack: Optimal Parallel Algorithms for Rectilinear Link-Distance Problems. Algorithmica 14(3): 261-289 (1995)
16 Vijay Chandru, Subir Kumar Ghosh, Anil Maheshwari, V. T. Rajan, Sanjeev Saluja: NC-Algorithms for Minimum Link Path and Related Problems. J. Algorithms 19(2): 173-203 (1995)
15EEAnders Dessmark, Andrzej Lingas, Anil Maheshwari: Multilist Layering: Complexity and Applications. Theor. Comput. Sci. 141(1&2): 337-350 (1995)
1994
14 Srinivasa Rao Arikati, Anil Maheshwari, Christos D. Zaroliagis: Saving Bits Made Easy. CCCG 1994: 140-146
13EESrinivasa Rao Arikati, Anil Maheshwari: An O(n) Algorithm for Realizing Degree Sequences. FSTTCS 1994: 125-136
12EESrinivasa Rao Arikati, Anil Maheshwari: Realizing Degree Sequences in Parallel. ISAAC 1994: 261-269
11EEAnil Maheshwari, Andrzej Lingas: A Simple Optimal Parallel Algorithm for Reporting Paths in a Tree. STACS 1994: 487-495
10 Subir Kumar Ghosh, Anil Maheshwari, Sudebkumar Prasant Pal, C. E. Veni Madhavan: An algorithm for recognizing palm polygons. The Visual Computer 10(8): 443-451 (1994)
1993
9EEAmitava Datta, Anil Maheshwari, Jörg-Rüdiger Sack: Optimal CREW-PRAM Algorithms for Direct Dominance Problems. ESA 1993: 109-120
8 Andrzej Lingas, Anil Maheshwari, Jörg-Rüdiger Sack: Parallel Algorithms for Rectilinear Link Distance Problems. IPPS 1993: 65-72
7EEAnders Dessmark, Andrzej Lingas, Anil Maheshwari: Multi-List Ranking: Complexity and Applications. STACS 1993: 306-316
6 Subir Kumar Ghosh, Anil Maheshwari, Sudebkumar Prasant Pal, Sanjeev Saluja, C. E. Veni Madhavan: Characterizing and Recognizing Weak Visibility Polygons. Comput. Geom. 3: 213-233 (1993)
1992
5EERichard J. Boland Jr., Anil Maheshwari, Dov Te'eni, David G. Schwartz, Ramkrishnan V. Tenkasi: Sharing Perspectives in Distributed Decision Making. CSCW 1992: 306-313
4EESubir Kumar Ghosh, Anil Maheshwari: Parallel Algorithms for All Minimum Link Paths and Link Center Problems. SWAT 1992: 106-117
3 Subir Kumar Ghosh, Anil Maheshwari: An Optimal Parallel Algorithm for Computing Furthest Neighbors in a Tree. Inf. Process. Lett. 44(3): 155-160 (1992)
1991
2EESubir Kumar Ghosh, Anil Maheshwari, Sudebkumar Prasant Pal, Sanjeev Saluja, C. E. Veni Madhavan: Computing the Shortest Path Tree in a Weak Visibility Polygon. FSTTCS 1991: 369-389
1990
1 Subir Kumar Ghosh, Anil Maheshwari: An Optimal Algorithm for Computing a Minimum Nested Nonconvex Polygon. Inf. Process. Lett. 36(6): 277-280 (1990)

Coauthor Index

1Mustaq Ahmed [84] [96]
2Lyudmil Aleksandrov [31] [42] [55] [61] [64] [67] [68]
3Srinivasa Rao Arikati [12] [13] [14] [20] [26]
4Tetsuo Asano [78] [92]
5Rossen Atanassov [91]
6Frank Bauernöppel [19] [24]
7Richard J. Boland Jr. [5] [18]
8Prosenjit Bose [33] [34] [48] [57] [58] [59] [63] [70] [71] [72] [73] [78] [80] [82] [86] [87] [90] [91] [92] [93] [98] [99]
9Paz Carmi [71] [72] [73] [78] [83] [85] [86] [87] [90] [92] [93]
10Vijay Chandru (Vijaya Chandru) [16]
11Eric Y. Chen [82] [99]
12Mathieu Couture [71] [72] [73] [87] [90] [91] [93]
13Jurek Czyzowicz [33] [34]
14Sandip Das [77] [84]
15Amitava Datta [9] [21]
16Frank K. H. A. Dehne [37] [39] [51] [69]
17Anders Dessmark [7] [15]
18Craig Dillabaugh [88]
19Wolfgang Dittrich [32] [37] [39] [44] [51]
20Hristo Djidjev [55] [67] [68]
21Mohammad Farshi [86]
22Subir Kumar Ghosh [1] [2] [3] [4] [6] [10] [16] [97]
23Partha P. Goswami [97]
24Sathish Govindarajan [43] [65]
25Hua Guo [55] [67] [68] [75] [80] [89]
26Meng He [82] [88] [98] [99]
27Glenn Hickey [83] [85]
28David A. Hutchinson [22] [23] [32] [37] [39] [41] [44] [51] [56] [76]
29Evangelos Kranakis [19] [24] [27] [33] [34] [45] [80]
30Marc J. van Kreveld [57]
31Danny Krizanc [19] [24] [27] [34] [45]
32L. Küttner [22]
33Mark Lanthier [22] [23] [28] [29] [31] [40] [46]
34Andrzej Lingas [7] [8] [11] [15] [17] [25]
35Sachin Lodha [77] [84]
36Anna Lubiw [84] [96]
37Tamás Lukovszki [43] [50] [65]
38C. E. Veni Madhavan [2] [6] [10]
39Pat Morin [30] [48] [57] [58] [70] [71] [80] [82] [87] [90] [91] [98] [99]
40Jason Morrison [48] [57] [70] [80]
41Subhas C. Nandy [97]
42Giri Narasimhan [59] [63]
43Mohammad R. Nikseresht [76]
44Marc Noy [19] [27]
45Doron Nussbaum [22] [23] [68] [74] [75]
46Sudebkumar Prasant Pal [2] [6] [10] [97]
47Michel Paquette [91]
48V. T. Rajan [16]
49Sasanka Roy [77] [84]
50David Roytenberg [22] [23]
51Jörg-Rüdiger Sack [8] [9] [17] [19] [21] [22] [23] [24] [27] [28] [29] [30] [31] [35] [40] [42] [45] [46] [61] [64] [68] [74] [75] [89]
52Sanjeev Saluja [2] [6] [16]
53Swami Sarvattomananda [97]
54David G. Schwartz [5]
55Chang Shu [78] [92]
56Michiel H. M. Smid [47] [59] [60] [63] [66] [70] [71] [72] [73] [78] [80] [81] [86] [87] [90] [91] [92] [93]
57Yihui Tang [80]
58Ryan Taylor [69]
59Dov Te'eni [5]
60Ramkrishnan V. Tenkasi [5]
61Jorge Urrutia [19] [24] [27] [45]
62Jan Vahrenhold [53] [70]
63Stefanie Wuhrer [78] [91] [92] [94]
64Jiehua Yi [74]
65Christos D. Zaroliagis [14] [26]
66Norbert Zeh [38] [41] [43] [47] [49] [50] [52] [53] [54] [56] [59] [62] [63] [65] [72] [73] [79] [81] [83] [85] [93] [95]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)