The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Anil Maheshwari: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Frank K. H. A. Dehne, Wolfgang Dittrich, David A. Hutchinson, Anil Maheshwari
    Parallel Virtual Memory. [Citation Graph (1, 0)][DBLP]
    SODA, 1999, pp:889-890 [Conf]
  2. Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil Maheshwari
    Partitioning Planar Graphs with Costs and Weights. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2002, pp:98-110 [Conf]
  3. Srinivasa Rao Arikati, Anil Maheshwari, Christos D. Zaroliagis
    Saving Bits Made Easy. [Citation Graph (0, 0)][DBLP]
    CCCG, 1994, pp:140-146 [Conf]
  4. Anil Maheshwari, Jan Vahrenhold, Norbert Zeh
    On reverse nearest neighbor queries. [Citation Graph (0, 0)][DBLP]
    CCCG, 2002, pp:128-132 [Conf]
  5. David A. Hutchinson, Anil Maheshwari, Norbert Zeh
    An External Memory Data Structure for Shortest Path Queries. [Citation Graph (0, 0)][DBLP]
    COCOON, 1999, pp:51-60 [Conf]
  6. Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack
    Approximating Weighted Shortest Paths on Polyhedral Surfaces. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:274-283 [Conf]
  7. Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack
    Approximating Weighted Shortest Paths on Polyhedral Surfaces. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:485-486 [Conf]
  8. Richard J. Boland Jr., Anil Maheshwari, Dov Te'eni, David G. Schwartz, Ramkrishnan V. Tenkasi
    Sharing Perspectives in Distributed Decision Making. [Citation Graph (0, 0)][DBLP]
    CSCW, 1992, pp:306-313 [Conf]
  9. Anil Maheshwari, Norbert Zeh
    A Survey of Techniques for Designing I/O-Efficient Algorithms. [Citation Graph (0, 0)][DBLP]
    Algorithms for Memory Hierarchies, 2002, pp:36-61 [Conf]
  10. Amitava Datta, Anil Maheshwari, Jörg-Rüdiger Sack
    Optimal CREW-PRAM Algorithms for Direct Dominance Problems. [Citation Graph (0, 0)][DBLP]
    ESA, 1993, pp:109-120 [Conf]
  11. Sathish Govindarajan, Tamás Lukovszki, Anil Maheshwari, Norbert Zeh
    I/O-Efficient Well-Separated Pair Decomposition and Its Applications. [Citation Graph (0, 0)][DBLP]
    ESA, 2000, pp:220-231 [Conf]
  12. Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack
    An Improved Approximation Algorithm for Computing Geometric Shortest Paths. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:246-257 [Conf]
  13. Srinivasa Rao Arikati, Anil Maheshwari
    An O(n) Algorithm for Realizing Degree Sequences. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1994, pp:125-136 [Conf]
  14. Subir Kumar Gosh, Anil Maheshwari, Sudebkumar Prasant Pal, Sanjeev Saluja, C. E. Veni Madhavan
    Computing the Shortest Path Tree in a Weak Visibility Polygon. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1991, pp:369-389 [Conf]
  15. Tamás Lukovszki, Anil Maheshwari, Norbert Zeh
    I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2001, pp:244-255 [Conf]
  16. David A. Hutchinson, Mark Lanthier, Anil Maheshwari, Doron Nussbaum, David Roytenberg, Jörg-Rüdiger Sack
    Parallel Neighbourhood Modelling. [Citation Graph (0, 0)][DBLP]
    ACM-GIS, 1996, pp:25-34 [Conf]
  17. Anil Maheshwari, Pat Morin, Jörg-Rüdiger Sack
    Progressive TINs: Algorithms and Applications. [Citation Graph (0, 0)][DBLP]
    ACM-GIS, 1997, pp:24-29 [Conf]
  18. Frank Bauernöppel, Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Marc Noy, Jörg-Rüdiger Sack, Jorge Urrutia
    Optimal Shooting: Characterizations and Applications. [Citation Graph (0, 0)][DBLP]
    ICALP, 1995, pp:220-231 [Conf]
  19. Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack
    Shortest Anisotropic Paths on Terrains. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:524-533 [Conf]
  20. Anil Maheshwari, Richard J. Boland Jr.
    Reflection and Representation: An Experimental Examination of Computer-Based Representation to Support Reflective Thinking. [Citation Graph (0, 0)][DBLP]
    ICIS, 1995, pp:189-195 [Conf]
  21. Frank K. H. A. Dehne, Anil Maheshwari, Ryan Taylor
    A Coarse Grained Parallel Algorithm for Hausdorff Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    ICPP, 2006, pp:497-504 [Conf]
  22. Frank K. H. A. Dehne, David A. Hutchinson, Anil Maheshwari, Wolfgang Dittrich
    Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms. [Citation Graph (0, 0)][DBLP]
    IPPS/SPDP, 1999, pp:14-20 [Conf]
  23. Andrzej Lingas, Anil Maheshwari, Jörg-Rüdiger Sack
    Parallel Algorithms for Rectilinear Link Distance Problems. [Citation Graph (0, 0)][DBLP]
    IPPS, 1993, pp:65-72 [Conf]
  24. Srinivasa Rao Arikati, Anil Maheshwari
    Realizing Degree Sequences in Parallel. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1994, pp:261-269 [Conf]
  25. Anil Maheshwari, Michiel H. M. Smid
    A Dynamic Dictionary for Priced Information with Application. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2003, pp:16-25 [Conf]
  26. Anil Maheshwari, Norbert Zeh
    External Memory Algorithms for Outerplanar Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1999, pp:307-316 [Conf]
  27. Prosenjit Bose, Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Anil Maheshwari
    Polygon Cutting: Revisited. [Citation Graph (0, 0)][DBLP]
    JCDCG, 1998, pp:81-92 [Conf]
  28. Prosenjit Bose, Jurek Czyzowicz, Evangelos Kranakis, Anil Maheshwari
    Algorithms for Packing Two Circles in a Convex Polygon. [Citation Graph (0, 0)][DBLP]
    JCDCG, 1998, pp:93-103 [Conf]
  29. Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack
    Approximate Shortest Path Queries on Weighted Polyhedral Surfaces. [Citation Graph (0, 0)][DBLP]
    MFCS, 2006, pp:98-109 [Conf]
  30. Anil Maheshwari, Norbert Zeh
    I/O-efficient algorithms for graphs of bounded treewidth. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:89-90 [Conf]
  31. Anil Maheshwari, Norbert Zeh
    I/O-optimal algorithms for planar graphs using separators. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:372-381 [Conf]
  32. Wolfgang Dittrich, David A. Hutchinson, Anil Maheshwari
    Blocking in Parallel Multisearch Problems (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SPAA, 1998, pp:98-107 [Conf]
  33. David A. Hutchinson, L. Küttner, Mark Lanthier, Anil Maheshwari, Doron Nussbaum, David Roytenberg, Jörg-Rüdiger Sack
    Parallel Neighborhood Modeling. [Citation Graph (0, 0)][DBLP]
    SPAA, 1996, pp:204-207 [Conf]
  34. Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel H. M. Smid, Norbert Zeh
    Approximating Geometric Bottleneck Shortest Paths. [Citation Graph (0, 0)][DBLP]
    STACS, 2003, pp:38-49 [Conf]
  35. Anders Dessmark, Andrzej Lingas, Anil Maheshwari
    Multi-List Ranking: Complexity and Applications. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:306-316 [Conf]
  36. Anil Maheshwari, Andrzej Lingas
    A Simple Optimal Parallel Algorithm for Reporting Paths in a Tree. [Citation Graph (0, 0)][DBLP]
    STACS, 1994, pp:487-495 [Conf]
  37. Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack
    Approximation algorithms for geometric shortest path problems. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:286-295 [Conf]
  38. Lyudmil Aleksandrov, Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack
    An epsilon-Approximation for Weighted Shortest Paths on Polyhedral Surfaces. [Citation Graph (0, 0)][DBLP]
    SWAT, 1998, pp:11-22 [Conf]
  39. Subir Kumar Ghosh, Anil Maheshwari
    Parallel Algorithms for All Minimum Link Paths and Link Center Problems. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:106-117 [Conf]
  40. Prosenjit Bose, Anil Maheshwari, Pat Morin, Jason Morrison
    The Grid Placement Problem. [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:180-191 [Conf]
  41. Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh
    I/O-Efficient Shortest Path Queries in Geometric Spanners. [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:287-299 [Conf]
  42. Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack
    Approximating Shortest Paths on Weighted Polyhedral Surfaces. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:30, n:4, pp:527-562 [Journal]
  43. Andrzej Lingas, Anil Maheshwari, Jörg-Rüdiger Sack
    Optimal Parallel Algorithms for Rectilinear Link-Distance Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1995, v:14, n:3, pp:261-289 [Journal]
  44. Anil Maheshwari, Michiel H. M. Smid
    A Dynamic Dictionary for Priced Information with Application. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:44, n:2, pp:151-165 [Journal]
  45. Sathish Govindarajan, Tamás Lukovszki, Anil Maheshwari, Norbert Zeh
    I/O-Efficient Well-Separated Pair Decomposition and Applications. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:45, n:4, pp:585-614 [Journal]
  46. Prosenjit Bose, Marc J. van Kreveld, Anil Maheshwari, Pat Morin, Jason Morrison
    Translating a regular grid over a point set. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:25, n:1-2, pp:21-34 [Journal]
  47. Prosenjit Bose, Anil Maheshwari, Pat Morin
    Fast approximations for sums of distances, clustering and the Fermat-Weber problem. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:24, n:3, pp:135-146 [Journal]
  48. Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel H. M. Smid, Norbert Zeh
    Approximating geometric bottleneck shortest paths. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:29, n:3, pp:233-249 [Journal]
  49. Subir Kumar Ghosh, Anil Maheshwari, Sudebkumar Prasant Pal, Sanjeev Saluja, C. E. Veni Madhavan
    Characterizing and Recognizing Weak Visibility Polygons. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1993, v:3, n:, pp:213-233 [Journal]
  50. Srinivasa Rao Arikati, Anil Maheshwari, Christos D. Zaroliagis
    Efficient Computation of Implicit Representations of Sparse Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:78, n:1-3, pp:1-16 [Journal]
  51. David A. Hutchinson, Anil Maheshwari, Norbert Zeh
    An external memory data structure for shortest path queries. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:126, n:1, pp:55-82 [Journal]
  52. Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Marc Noy, Jörg-Rüdiger Sack, Jorge Urrutia
    Stage-graph Representations. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:75, n:1, pp:71-80 [Journal]
  53. Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Jörg-Rüdiger Sack, Jorge Urrutia
    Ray shooting from convex ranges. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:108, n:3, pp:259-267 [Journal]
  54. Subir Kumar Ghosh, Anil Maheshwari
    An Optimal Algorithm for Computing a Minimum Nested Nonconvex Polygon. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:36, n:6, pp:277-280 [Journal]
  55. Subir Kumar Ghosh, Anil Maheshwari
    An Optimal Parallel Algorithm for Computing Furthest Neighbors in a Tree. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:44, n:3, pp:155-160 [Journal]
  56. Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack
    Determining approximate shortest paths on weighted polyhedral surfaces. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2005, v:52, n:1, pp:25-53 [Journal]
  57. Vijay Chandru, Subir Kumar Ghosh, Anil Maheshwari, V. T. Rajan, Sanjeev Saluja
    NC-Algorithms for Minimum Link Path and Related Problems. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1995, v:19, n:2, pp:173-203 [Journal]
  58. Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil Maheshwari
    Partitioning planar graphs with costs and weights. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2006, v:11, n:, pp:- [Journal]
  59. Anil Maheshwari, Norbert Zeh
    I/O-Optimal Algorithms for Outerplanar Graphs. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2004, v:8, n:, pp:47-87 [Journal]
  60. Frank K. H. A. Dehne, Wolfgang Dittrich, David A. Hutchinson, Anil Maheshwari
    Bulk Synchronous Parallel Algorithms for the External Memory Model. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2002, v:35, n:6, pp:567-597 [Journal]
  61. Wolfgang Dittrich, David A. Hutchinson, Anil Maheshwari
    Blocking in Parallel Multisearch Problems. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2001, v:34, n:2, pp:145-189 [Journal]
  62. Amitava Datta, Anil Maheshwari, Jörg-Rüdiger Sack
    Optimal Parallel Algorithms for Direct Dominance Problems. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1996, v:3, n:1, pp:72-88 [Journal]
  63. Anil Maheshwari, Jörg-Rüdiger Sack
    Simple Optimal Algorithms for Rectilinear Link Path and Polygon Separation Problems. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1999, v:9, n:1, pp:31-42 [Journal]
  64. Andrzej Lingas, Anil Maheshwari
    A Simple Optimal Parallel Algorithm for Reporting Paths in a Tree. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1997, v:7, n:1, pp:3-11 [Journal]
  65. Srinivasa Rao Arikati, Anil Maheshwari
    Realizing Degree Sequences in Parallel. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1996, v:9, n:2, pp:317-338 [Journal]
  66. Frank Bauernöppel, Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Jörg-Rüdiger Sack, Jorge Urrutia
    Planar Stage Graphs: Characterizations and Applications. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:175, n:2, pp:239-255 [Journal]
  67. Anders Dessmark, Andrzej Lingas, Anil Maheshwari
    Multilist Layering: Complexity and Applications. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:141, n:1&2, pp:337-350 [Journal]
  68. Subir Kumar Ghosh, Anil Maheshwari, Sudebkumar Prasant Pal, C. E. Veni Madhavan
    An algorithm for recognizing palm polygons. [Citation Graph (0, 0)][DBLP]
    The Visual Computer, 1994, v:10, n:8, pp:443-451 [Journal]
  69. Tetsuo Asano, Prosenjit Bose, Paz Carmi, Anil Maheshwari, Chang Shu, Michiel H. M. Smid, Stefanie Wuhrer
    Linear-Space Algorithms for Distance Preserving Embedding. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:185-188 [Conf]
  70. Sasanka Roy, Sachin Lodha, Sandip Das, Anil Maheshwari
    Approximate Shortest Descent Path on a Terrain. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:189-192 [Conf]
  71. Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack
    Shortest Path Queries Between Geometric Objects on Surfaces. [Citation Graph (0, 0)][DBLP]
    ICCSA (1), 2007, pp:82-95 [Conf]
  72. Prosenjit Bose, Anil Maheshwari, Pat Morin, Jason Morrison, Michiel H. M. Smid, Jan Vahrenhold
    Space-efficient geometric divide-and-conquer algorithms. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:37, n:3, pp:209-227 [Journal]

  73. Shortest Path Queries in Polygonal Domains. [Citation Graph (, )][DBLP]


  74. Speed-constrained geodesic fréchet distance inside a simple polygon. [Citation Graph (, )][DBLP]


  75. Computing Fréchet Distance with Speed Limits. [Citation Graph (, )][DBLP]


  76. On computing Fréchet distance of two paths on a convex polyhedron. [Citation Graph (, )][DBLP]


  77. Experiments with a Parallel External Memory System. [Citation Graph (, )][DBLP]


  78. An O ( n 2log n ) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the Plane. [Citation Graph (, )][DBLP]


  79. Succinct and I/O Efficient Data Structures for Traversal in Trees. [Citation Graph (, )][DBLP]


  80. I/O and Space-Efficient Path Traversal in Planar Graphs. [Citation Graph (, )][DBLP]


  81. Spanners of Complete k -Partite Geometric Graphs. [Citation Graph (, )][DBLP]


  82. Succinct geometric indexes supporting point location queries. [Citation Graph (, )][DBLP]


  83. Computing the Greedy Spanner in Near-Quadratic Time. [Citation Graph (, )][DBLP]


  84. Improved Methods For Generating Quasi-gray Codes. [Citation Graph (, )][DBLP]


  85. NAPX: A Polynomial Time Approximation Scheme for the Noah's Ark Problem. [Citation Graph (, )][DBLP]


  86. Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing. [Citation Graph (, )][DBLP]


  87. Geometric Spanners with Small Chromatic Number. [Citation Graph (, )][DBLP]


  88. Shortest Gently Descending Paths. [Citation Graph (, )][DBLP]


  89. Algorithms for Computing Diffuse Reflection Paths in Polygons. [Citation Graph (, )][DBLP]


  90. I/O-Efficient Algorithms for Graphs of Bounded Treewidth. [Citation Graph (, )][DBLP]


  91. I/O-efficient algorithms for computing planar geometric spanners. [Citation Graph (, )][DBLP]


  92. A linear-space algorithm for distance preserving graph embedding. [Citation Graph (, )][DBLP]


  93. Geometric spanners with small chromatic number. [Citation Graph (, )][DBLP]


  94. Geometric Spanners With Small Chromatic Number [Citation Graph (, )][DBLP]


  95. Spanners of Complete $k$-Partite Geometric Graphs [Citation Graph (, )][DBLP]


  96. Approximation Algorithms for Shortest Descending Paths in Terrains [Citation Graph (, )][DBLP]


  97. NAPX: A Polynomial Time Approximation Scheme for the Noah's Ark Problem [Citation Graph (, )][DBLP]


  98. Succinct Geometric Indexes Supporting Point Location Queries [Citation Graph (, )][DBLP]


  99. Geodesic Paths On 3D Surfaces: Survey and Open Problems [Citation Graph (, )][DBLP]


  100. Recognizing the Largest Empty Circle and Axis-Parallel Rectangle in a Desired Location [Citation Graph (, )][DBLP]


Search in 0.069secs, Finished in 0.074secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002