Anil Maheshwari

	2012
126		Prosenjit Bose, Eric Y. Chen, Meng He, Anil Maheshwari, Pat Morin: Succinct geometric indexes supporting point location queries. ACM Transactions on Algorithms 8(2): 10 (2012)
125		Craig Dillabaugh, Meng He, Anil Maheshwari: Succinct and I/O Efficient Data Structures for Traversal in Trees. Algorithmica 63(1-2): 201-223 (2012)
124		Minati De, Anil Maheshwari, Subhas C. Nandy: Space-efficient Algorithms for Visibility Problems in Simple Polygon CoRR abs/1204.2634: (2012)
	2011
123		Minati De, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid: An In-Place Priority Search Tree. CCCG 2011
122		Karim Douïeb, Matthew Eastman, Anil Maheshwari, Michiel H. M. Smid: Approximation Algorithms for a Triangle Enclosure Problem. CCCG 2011
121		Jean-Lou De Carufel, Craig Dillabaugh, Anil Maheshwari: Point Location in Well-Shaped Meshes Using Jump-and-Walk. CCCG 2011
120		Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh: Staying Close to a Curve. CCCG 2011
119		Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh: Improved Algorithms for Partial Curve Matching. ESA 2011: 518-529
118		Prosenjit Bose, Paz Carmi, Mirela Damian, Robin Y. Flatland, Matthew J. Katz, Anil Maheshwari: Switching to Directional Antennas with Constant Increase in Radius and Hop Distance. WADS 2011: 134-146
117		Lyudmil Aleksandrov, Hristo Djidjev, Anil Maheshwari, Jörg-Rüdiger Sack: An Approximation Algorithm for Computing Shortest Paths in Weighted 3-d Domains CoRR abs/1102.3165: (2011)
116		John Augustine, Sandip Das, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy, Swami Sarvattomananda: Localized Geometric Query Problems CoRR abs/1111.2918: (2011)
115		Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh: Fréchet distance with speed limits. Comput. Geom. 44(2): 110-120 (2011)
114		Prosenjit Bose, Anil Maheshwari, Chang Shu, Stefanie Wuhrer: A survey of geodesic paths on 3D surfaces. Comput. Geom. 44(9): 486-498 (2011)
113		Glenn Hickey, Mathieu Blanchette, Paz Carmi, Anil Maheshwari, Norbert Zeh: An Approximation Algorithm for the Noah's Ark Problem with Random Feature Loss. IEEE/ACM Trans. Comput. Biology Bioinform. 8(2): 551-556 (2011)
112		Mustaq Ahmed, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy: On the number of shortest descending paths on the surface of a convex terrain. J. Discrete Algorithms 9(2): 182-189 (2011)
	2010
111		Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz, Hamid Zarrabi-Zadeh: Speed-constrained geodesic fréchet distance inside a simple polygon. CCCG 2010: 179-182
110		Prosenjit Bose, Paz Carmi, Dana Jansens, Anil Maheshwari, Pat Morin, Michiel H. M. Smid: Improved Methods For Generating Quasi-gray Codes. SWAT 2010: 224-235
109		Prosenjit Bose, Paz Carmi, Mohammad Farshi, Anil Maheshwari, Michiel H. M. Smid: Computing the Greedy Spanner in Near-Quadratic Time. Algorithmica 58(3): 711-729 (2010)
108		John Augustine, Sandip Das, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy, Swami Sarvattomananda: Recognizing the Largest Empty Circle and Axis-Parallel Rectangle in a Desired Location CoRR abs/1004.0558: (2010)
107		Dana Jansens, Prosenjit Bose, Paz Carmi, Anil Maheshwari, Pat Morin, Michiel H. M. Smid: Improved Methods For Generating Quasi-Gray Codes CoRR abs/1010.0905: (2010)
106		Mohammad R. Nikseresht, Anil Somayaji, Anil Maheshwari: Customer Appeasement Scheduling CoRR abs/1012.3452: (2010)
105		Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack: Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces. Discrete & Computational Geometry 44(4): 762-801 (2010)
104		Prosenjit Bose, Sébastien Collette, Stefan Langerman, Anil Maheshwari, Pat Morin, Michiel H. M. Smid: Sigma-local graphs. J. Discrete Algorithms 8(1): 15-23 (2010)
103		Mustaq Ahmed, Sandip Das, Sachin Lodha, Anna Lubiw, Anil Maheshwari, Sasanka Roy: Approximation algorithms for shortest descending paths in terrains. J. Discrete Algorithms 8(2): 214-230 (2010)
	2009
102		Anil Maheshwari, Jörg-Rüdiger Sack, Kaveh Shahbaz: Computing Fréchet Distance with Speed Limits. CCCG 2009: 107-110
101		Craig Dillabaugh, Meng He, Anil Maheshwari, Norbert Zeh: I/O and Space-Efficient Path Traversal in Planar Graphs. ISAAC 2009: 1175-1184
100		Prosenjit Bose, Eric Y. Chen, Meng He, Anil Maheshwari, Pat Morin: Succinct geometric indexes supporting point location queries. SODA 2009: 635-644
99		Prosenjit Bose, Meng He, Anil Maheshwari, Pat Morin: Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing. WADS 2009: 98-109
98		Subir 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
97		Mustaq Ahmed, Anna Lubiw, Anil Maheshwari: Shortest Gently Descending Paths. WALCOM 2009: 59-70
96		Anil Maheshwari, Norbert Zeh: I/O-Efficient Algorithms for Graphs of Bounded Treewidth. Algorithmica 54(3): 413-469 (2009)
95		Anil Maheshwari, Stefanie Wuhrer: Geodesic Paths On 3D Surfaces: Survey and Open Problems CoRR abs/0904.2550: (2009)
94		Prosenjit 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)
93		Tetsuo 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)
92		Rossen 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)
91		Prosenjit 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
90		Hua Guo, Anil Maheshwari, Jörg-Rüdiger Sack: Shortest Path Queries in Polygonal Domains. AAIM 2008: 200-211
89		Craig Dillabaugh, Meng He, Anil Maheshwari: Succinct and I/O Efficient Data Structures for Traversal in Trees. ISAAC 2008: 112-123
88		Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Pat Morin, Michiel H. M. Smid: Spanners of Complete k -Partite Geometric Graphs. LATIN 2008: 170-181
87		Prosenjit Bose, Paz Carmi, Mohammad Farshi, Anil Maheshwari, Michiel H. M. Smid: Computing the Greedy Spanner in Near-Quadratic Time. SWAT 2008: 390-401
86		Glenn Hickey, Paz Carmi, Anil Maheshwari, Norbert Zeh: NAPX: A Polynomial Time Approximation Scheme for the Noah's Ark Problem. WABI 2008: 76-86
85		Mustaq Ahmed, Sandip Das, Sachin Lodha, Anna Lubiw, Anil Maheshwari, Sasanka Roy: Approximation Algorithms for Shortest Descending Paths in Terrains CoRR abs/0805.1401: (2008)
84		Glenn Hickey, Paz Carmi, Anil Maheshwari, Norbert Zeh: NAPX: A Polynomial Time Approximation Scheme for the Noah's Ark Problem CoRR abs/0805.1661: (2008)
83		Prosenjit Bose, Eric Y. Chen, Meng He, Anil Maheshwari, Pat Morin: Succinct Geometric Indexes Supporting Point Location Queries CoRR abs/0805.4147: (2008)
82		Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh: I/O-efficient algorithms for computing planar geometric spanners. Comput. Geom. 40(3): 252-271 (2008)
81		Prosenjit 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)
80		Anil Maheshwari, Norbert Zeh: I/O-Efficient Planar Separators. SIAM J. Comput. 38(3): 767-801 (2008)
	2007
79		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
78		Sasanka Roy, Sachin Lodha, Sandip Das, Anil Maheshwari: Approximate Shortest Descent Path on a Terrain. CCCG 2007: 189-192
77		Mohammad R. Nikseresht, David A. Hutchinson, Anil Maheshwari: Experiments with a Parallel External Memory System. HiPC 2007: 59-70
76		Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack: Shortest Path Queries Between Geometric Objects on Surfaces. ICCSA (1) 2007: 82-95
75		Anil 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
74		Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh: Geometric Spanners with Small Chromatic Number. WAOA 2007: 75-88
73		Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh: Geometric Spanners With Small Chromatic Number CoRR abs/0711.0114: (2007)
72		Prosenjit 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)
71		Prosenjit 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
70		Frank K. H. A. Dehne, Anil Maheshwari, Ryan Taylor: A Coarse Grained Parallel Algorithm for Hausdorff Voronoi Diagrams. ICPP 2006: 497-504
69		Lyudmil 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
68		Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil Maheshwari: Partitioning planar graphs with costs and weights. ACM Journal of Experimental Algorithmics 11: (2006)
67		Anil Maheshwari, Michiel H. M. Smid: A Dynamic Dictionary for Priced Information with Application. Algorithmica 44(2): 151-165 (2006)
66		Sathish Govindarajan, Tamás Lukovszki, Anil Maheshwari, Norbert Zeh: I/O-Efficient Well-Separated Pair Decomposition and Applications. Algorithmica 45(4): 585-614 (2006)
	2005
65		Anil Maheshwari, Jiehua Yi: On computing Fréchet distance of two paths on a convex polyhedron. EuroCG 2005: 41-44
64		Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack: Determining approximate shortest paths on weighted polyhedral surfaces. J. ACM 52(1): 25-53 (2005)
	2004
63		Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel H. M. Smid, Norbert Zeh: Approximating geometric bottleneck shortest paths. Comput. Geom. 29(3): 233-249 (2004)
62		Anil Maheshwari, Norbert Zeh: I/O-Optimal Algorithms for Outerplanar Graphs. J. Graph Algorithms Appl. 8: 47-87 (2004)
	2003
61		Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack: An Improved Approximation Algorithm for Computing Geometric Shortest Paths. FCT 2003: 246-257
60		Anil Maheshwari, Michiel H. M. Smid: A Dynamic Dictionary for Priced Information with Application. ISAAC 2003: 16-25
59		Prosenjit 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
55		Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil Maheshwari: Partitioning Planar Graphs with Costs and Weights. ALENEX 2002: 98-110
54		Anil Maheshwari, Norbert Zeh: A Survey of Techniques for Designing I/O-Efficient Algorithms. Algorithms for Memory Hierarchies 2002: 36-61
53		Anil Maheshwari, Jan Vahrenhold, Norbert Zeh: On reverse nearest neighbor queries. CCCG 2002: 128-132
52		Anil Maheshwari, Norbert Zeh: I/O-optimal algorithms for planar graphs using separators. SODA 2002: 372-381
51		Frank 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
50		Tamás Lukovszki, Anil Maheshwari, Norbert Zeh: I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems. FSTTCS 2001: 244-255
49		Anil Maheshwari, Norbert Zeh: I/O-efficient algorithms for graphs of bounded treewidth. SODA 2001: 89-90
48		Prosenjit Bose, Anil Maheshwari, Pat Morin, Jason Morrison: The Grid Placement Problem. WADS 2001: 180-191
47		Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh: I/O-Efficient Shortest Path Queries in Geometric Spanners. WADS 2001: 287-299
46		Mark 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)
44		Wolfgang Dittrich, David A. Hutchinson, Anil Maheshwari: Blocking in Parallel Multisearch Problems. Theory Comput. Syst. 34(2): 145-189 (2001)
	2000
43		Sathish Govindarajan, Tamás Lukovszki, Anil Maheshwari, Norbert Zeh: I/O-Efficient Well-Separated Pair Decomposition and Its Applications. ESA 2000: 220-231
42		Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack: Approximation algorithms for geometric shortest path problems. STOC 2000: 286-295
	1999
41		David A. Hutchinson, Anil Maheshwari, Norbert Zeh: An External Memory Data Structure for Shortest Path Queries. COCOON 1999: 51-60
40		Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack: Shortest Anisotropic Paths on Terrains. ICALP 1999: 524-533
39		Frank 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
38		Anil Maheshwari, Norbert Zeh: External Memory Algorithms for Outerplanar Graphs. ISAAC 1999: 307-316
37		Frank K. H. A. Dehne, Wolfgang Dittrich, David A. Hutchinson, Anil Maheshwari: Parallel Virtual Memory. SODA 1999: 889-890
36		Anil 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
32		Wolfgang Dittrich, David A. Hutchinson, Anil Maheshwari: Blocking in Parallel Multisearch Problems (Extended Abstract). SPAA 1998: 98-107
31		Lyudmil 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
30		Anil Maheshwari, Pat Morin, Jörg-Rüdiger Sack: Progressive TINs: Algorithms and Applications. ACM-GIS 1997: 24-29
29		Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack: Approximating Weighted Shortest Paths on Polyhedral Surfaces. Symposium on Computational Geometry 1997: 274-283
28		Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack: Approximating Weighted Shortest Paths on Polyhedral Surfaces. Symposium on Computational Geometry 1997: 485-486
27		Evangelos 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)
26		Srinivasa 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)
24		Frank 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
23		David 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)
20		Srinivasa Rao Arikati, Anil Maheshwari: Realizing Degree Sequences in Parallel. SIAM J. Discrete Math. 9(2): 317-338 (1996)
	1995
19		Frank 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)
15		Anders 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
13		Srinivasa Rao Arikati, Anil Maheshwari: An O(n) Algorithm for Realizing Degree Sequences. FSTTCS 1994: 125-136
12		Srinivasa Rao Arikati, Anil Maheshwari: Realizing Degree Sequences in Parallel. ISAAC 1994: 261-269
11		Anil 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
9		Amitava 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
7		Anders 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
5		Richard J. Boland Jr., Anil Maheshwari, Dov Te'eni, David G. Schwartz, Ramkrishnan V. Tenkasi: Sharing Perspectives in Distributed Decision Making. CSCW 1992: 306-313
4		Subir 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
2		Subir 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

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

Colors in the list of coauthors

Last update Fri May 25 01:42:58 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page