Gautam Das Papers on DiSC'02 A robust, optimization-based approach for approximate answering of aggregate queries Time series similarity measures and time series indexing Overcoming Limitations of Sampling for Aggregation Queries Publications Note: Links lead to the DBLP on the Web. Gautam Das 35 Sanjay Agrawal , Surajit Chaudhuri , Gautam Das: DBXplorer: A System For Keyword-Based Search Over Relational Databases. ICDE 2002 34 Sanjay Agrawal , Surajit Chaudhuri , Gautam Das: DBXplorer: Enabling Keyword Search over Relational Databases. SIGMOD Conference 2002 33 Binay K. Bhattacharya , Gautam Das, Asish Mukhopadhyay , Giri Narasimhan : Optimally computing a shortest weakly visible line segment inside a simple polygon. Computational Geometry 23 (1): 1-29 (2002) 32 Surajit Chaudhuri , Gautam Das, Mayur Datar , Rajeev Motwani , Vivek R. Narasayya : Overcoming Limitations of Sampling for Aggregation Queries. ICDE 2001 : 534-542 31 Surajit Chaudhuri , Gautam Das, Vivek R. Narasayya : A Robust, Optimization-Based Approach for Approximate Answering of Aggregate Queries. SIGMOD Conference 2001 30 Dimitrios Gunopulos , Gautam Das: Time Series Similarity Measures and Time Series Indexing. SIGMOD Conference 2001 29 Danny Z. Chen , Gautam Das, Michiel H. M. Smid : Lower bounds for computing geometric spanners and approximate shortest paths. Discrete Applied Mathematics 110 (2-3): 151-167 (2001) 28 Gautam Das, Heikki Mannila : Context-Based Similarity Measures for Categorical Databases. PKDD 2000 : 201-210 27 Gautam Das, Michiel H. M. Smid : A lower bound for approximating the geometric minimum weight matching. Information Processing Letters 74 (5-6): 253-255 (2000) 26 Gautam Das, King-Ip Lin , Heikki Mannila , Gopal Renganathan , Padhraic Smyth : Rule Discovery from Time Series. KDD 1998 : 16-22 25 Gautam Das, Heikki Mannila , Pirjo Ronkainen : Similarity of Attributes by External Probes. KDD 1998 : 23-29 24 Gautam Das, Rudolf Fleischer , Leszek Gasieniec , Dimitrios Gunopulos , Juha Kärkkäinen : Episode Matching. CPM 1997 : 12-27 23 Gautam Das, Dimitrios Gunopulos , Heikki Mannila : Finding Similar Time Series. PKDD 1997 : 88-100 22 Béla Bollobás , Gautam Das, Dimitrios Gunopulos , Heikki Mannila : Time-Series Similarity Problems and Well-Separated Geometric Sets. Symposium on Computational Geometry 1997 : 454-456 21 Gautam Das, Sanjiv Kapoor , Michiel H. M. Smid : On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees. Algorithmica 19 (4): 447-460 (1997) 20 Gautam Das, Giri Narasimhan : A Fast Algorithm for Constructing Sparse Euclidean Spanners. International Journal of Computational Geometry and Applications 7 (4): 297-315 (1997) 19 Srinivasa Rao Arikati , Danny Z. Chen , L. Paul Chew , Gautam Das, Michiel H. M. Smid , Christos D. Zaroliagis : Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane. ESA 1996 : 514-528 18 Gautam Das, Sanjiv Kapoor , Michiel H. M. Smid : On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees. FSTTCS 1996 : 64-75 17 Gautam Das, Paul J. Heffernan : Constructing Degree-3 Spanners with Other Sparseness Properties. International Journal of Foundations of Computer Science 7 (2): 121-136 (1996) 16 Gautam Das, Giri Narasimhan , Jeffrey S. Salowe : A New Way to Weigh Malnourished Euclidean Graphs. SODA 1995 : 215-222 15 Sunil Arya , Gautam Das, David M. Mount , Jeffrey S. Salowe , Michiel H. M. Smid : Euclidean spanners: short, thin, and lanky. STOC 1995 : 489-498 14 Gautam Das, Michael T. Goodrich : On the Complexity of Approximating and Illuminating Three-Dimensional Convex Polyhedra (Preliminary Version). WADS 1995 : 74-85 13 Barun Chandra , Gautam Das, Giri Narasimhan , José Soares : New sparseness results on graph spanners. International Journal of Computational Geometry and Applications 5 : 125-144 (1995) 12 Gautam Das, Paul J. Heffernan , Giri Narasimhan : Finding All Weakly-Visible Chords of a Polygon in Linear Time (Extended Abstract). SWAT 1994 : 119-130 11 Gautam Das, Giri Narasimhan : A Fast Algorithm for Constructing Sparse Euclidean Spanners. Symposium on Computational Geometry 1994 : 132-139 10 Gautam Das, Giri Narasimhan : Optimal Linear-Time Algorithm for the Shortest Illuminating Line Segment in a Polygon. Symposium on Computational Geometry 1994 : 259-266 9 Gautam Das, Paul J. Heffernan , Giri Narasimhan : Finding all Weakly-Visible Chords of a Polygon in Linear Time. Nordic Journal of Computing 1 (4): 433-457 (1994) 8 Gautam Das, Paul J. Heffernan : Constructing Degree-3 Spanners with Other Sparseness Properties. ISAAC 1993 : 11-20 7 Gautam Das, Paul J. Heffernan , Giri Narasimhan : Optimally Sparse Spanners in 3-Dimensional Euclidean Space. Symposium on Computational Geometry 1993 : 53-62 6 Barun Chandra , Gautam Das, Giri Narasimhan , José Soares : New Sparseness Results on Graph Spanners. Symposium on Computational Geometry 1992 : 192-201 5 Gautam Das, Deborah Joseph : Minimum Vertex Hulls for Polyhedral Domains. TCS 103 (1): 107-135 (1992) 4 Gautam Das, Giri Narasimhan : Geometric Searching and Link Distance (Extended Abstract). WADS 1991 : 261-272 3 Gautam Das, Deborah Joseph : Minimum Vertex Hulls for Polyhedral Domains. STACS 1990 : 126-137 2 Ingo Althöfer , Gautam Das, David P. Dobkin , Deborah Joseph : Generating Sparse Spanners for Weighted Graphs. SWAT 1990 : 26-37 1 Gautam Das, Deborah Joseph : Which Triangulations Approximate the Complete Graph?. Optimal Algorithms 1989 : 168-192 DiSC'02 © 2003 Association for Computing Machinery