
| 2007 | ||
|---|---|---|
| 72 | EE | Nishant Kapoor, Gautam Das, Vagelis Hristidis, S. Sudarshan, Gerhard Weikum: STAR: A System for Tuple and Attribute Ranking of Query Answers. ICDE 2007: 1483-1484 |
| 71 | EE | Girish Chafle, Gautam Das, Koustuv Dasgupta, Arun Kumar, Sumit Mittal, Sougata Mukherjea, Biplav Srivastava: An Integrated Development Environment for Web Service Composition. ICWS 2007: 839-847 |
| 70 | EE | Arjun Dasgupta, Gautam Das, Heikki Mannila: A random walk approach to sampling hidden databases. SIGMOD Conference 2007: 629-640 |
| 69 | EE | Gautam Das, Dimitrios Gunopulos, Nick Koudas, Nikos Sarkas: Ad-hoc Top-k Query Answering for Data Streams. VLDB 2007: 183-194 |
| 68 | EE | Benjamin Arai, Gautam Das, Dimitrios Gunopulos, Nick Koudas: Anytime Measures for Top-k Algorithms. VLDB 2007: 914-925 |
| 67 | EE | Senjuti Basu Roy, Gautam Das, Sajal Das: Computing Best Coverage Path in the Presence of Obstacles in a Sensor Field. WADS 2007: 577-588 |
| 66 | EE | Surajit Chaudhuri, Gautam Das, Vivek R. Narasayya: Optimized stratified sampling for approximate query processing. ACM Trans. Database Syst. 32(2): 9 (2007) |
| 65 | EE | Benjamin Arai, Gautam Das, Dimitrios Gunopulos, Vana Kalogeraki: Efficient Approximate Query Processing in Peer-to-Peer Networks. IEEE Trans. Knowl. Data Eng. 19(7): 919-933 (2007) |
| 64 | EE | Roberto Bayardo, Kristin P. Bennett, Gautam Das, Dimitrios Gunopulos, Johannes Gunopulos: Introduction to special issue ACM SIGKDD 2006. TKDD 1(3): (2007) |
| 2006 | ||
| 63 | EE | Gautam Das, M. Fazio, Massimo Villari, Antonio Puliafito: Vulnerabilities of Internet Access Mechanisms from Mobile Ad Hoc Networks. AINA (1) 2006: 851-858 |
| 62 | EE | Amit Anil Nanavati, Siva Gurumurthy, Gautam Das, Dipanjan Chakraborty, Koustuv Dasgupta, Sougata Mukherjea, Anupam Joshi: On the structural properties of massive telecom call graphs: findings and implications. CIKM 2006: 435-444 |
| 61 | EE | Leonidas Fegaras, Weimin He, Gautam Das, David Levine: XML Query Routing in Structured P2P Systems. DBISP2P 2006: 273-284 |
| 60 | EE | Benjamin Arai, Gautam Das, Dimitrios Gunopulos, Vana Kalogeraki: Approximating Aggregation Queries in Peer-to-Peer Networks. ICDE 2006: 42 |
| 59 | EE | Pauli Miettinen, Taneli Mielikäinen, Aristides Gionis, Gautam Das, Heikki Mannila: The Discrete Basis Problem. PKDD 2006: 335-346 |
| 58 | EE | Gautam Das, Vagelis Hristidis, Nishant Kapoor, S. Sudarshan: Ordering the attributes of query results. SIGMOD Conference 2006: 395-406 |
| 57 | EE | Gautam Das, Dimitrios Gunopulos, Nick Koudas, Dimitris Tsirogiannis: Answering Top-k Queries Using Views. VLDB 2006: 451-462 |
| 56 | EE | Surajit Chaudhuri, Gautam Das, Vagelis Hristidis, Gerhard Weikum: Probabilistic information retrieval approach for ranking of database query results. ACM Trans. Database Syst. 31(3): 1134-1168 (2006) |
| 2005 | ||
| 55 | EE | Gautam Das, M. Fazio, Massimo Villari, Antonio Puliafito: Distributed core assisted scalable data dissemination in mobile ad hoc networks. CollaborateCom 2005 |
| 54 | Gautam Das, M. Fazio, Massimo Villari, Antonio Puliafito: CCID: Core construction for information dissemination in ad hoc scenario. Communications and Computer Networks 2005: 114-119 | |
| 53 | EE | Foto N. Afrati, Gautam Das, Aristides Gionis, Heikki Mannila, Taneli Mielikäinen, Panayiotis Tsaparas: Mining Chains of Relations. ICDM 2005: 553-556 |
| 52 | Gautam Das: Approximate Query Processing. SBBD 2005: 8-9 | |
| 51 | Chotirat (Ann) Ratanamahatana, Jessica Lin, Dimitrios Gunopulos, Eamonn J. Keogh, Michail Vlachos, Gautam Das: Mining Time Series Data. The Data Mining and Knowledge Discovery Handbook 2005: 1069-1103 | |
| 2004 | ||
| 50 | Gautam Das, Bing Liu, Philip S. Yu: Proceedings of the 9th ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, DMKD 2004, Paris, France, June 13, 2004 ACM 2004 | |
| 49 | Gautam Das, Ved Prakash Gulati: Intelligent Information Technology, 7th International Conference on Information Technology, CIT 2004, Hyderabad, India, December 20-23, 2004, Proceedings Springer 2004 | |
| 48 | EE | Michail Vlachos, Dimitrios Gunopulos, Gautam Das: Rotation invariant distance measures for trajectories. KDD 2004: 707-712 |
| 47 | EE | Surajit Chaudhuri, Gautam Das, Utkarsh Srivastava: Effective Use of Block-Level Sampling in Statistics Estimation. SIGMOD Conference 2004: 287-298 |
| 46 | EE | Surajit Chaudhuri, Gautam Das, Vagelis Hristidis, Gerhard Weikum: Probabilistic Ranking of Database Query Results. VLDB 2004: 888-899 |
| 45 | EE | Yi-Min Wang, Lili Qiu, Chad Verbowski, Dimitris Achlioptas, Gautam Das, Per-Åke Larson: Summary-based routing for content-based event distribution networks. Computer Communication Review 34(5): 59-74 (2004) |
| 2003 | ||
| 44 | EE | Sanjay Agrawal, Surajit Chaudhuri, Gautam Das, Aristides Gionis: Automated Ranking of Database Query Results. CIDR 2003 |
| 43 | EE | Brian Babcock, Surajit Chaudhuri, Gautam Das: Dynamic Sample Selection for Approximate Query Processing. SIGMOD Conference 2003: 539-550 |
| 2002 | ||
| 42 | EE | Sanjay Agrawal, Surajit Chaudhuri, Gautam Das: DBXplorer: A System for Keyword-Based Search over Relational Databases. ICDE 2002: 5-16 |
| 41 | EE | Sanjay Agrawal, Surajit Chaudhuri, Gautam Das: DBXplorer: enabling keyword search over relational databases. SIGMOD Conference 2002: 627 |
| 40 | Binay K. Bhattacharya, Gautam Das, Asish Mukhopadhyay, Giri Narasimhan: Optimally computing a shortest weakly visible line segment inside a simple polygon. Comput. Geom. 23(1): 1-29 (2002) | |
| 2001 | ||
| 39 | EE | Surajit Chaudhuri, Gautam Das, Mayur Datar, Rajeev Motwani, Vivek R. Narasayya: Overcoming Limitations of Sampling for Aggregation Queries. ICDE 2001: 534-542 |
| 38 | EE | Surajit Chaudhuri, Gautam Das, Vivek R. Narasayya: A Robust, Optimization-Based Approach for Approximate Answering of Aggregate Queries. SIGMOD Conference 2001: 295-306 |
| 37 | EE | Dimitrios Gunopulos, Gautam Das: Time Series Similarity Measures and Time Series Indexing. SIGMOD Conference 2001: 624 |
| 36 | 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) | |
| 35 | EE | Béla Bollobás, Gautam Das, Dimitrios Gunopulos, Heikki Mannila: Time-Series Similarity Problems and Well-Separated Geometric Sets. Nord. J. Comput. 8(4): 409-423 (2001) |
| 2000 | ||
| 34 | EE | Gautam Das, Heikki Mannila: Context-Based Similarity Measures for Categorical Databases. PKDD 2000: 201-210 |
| 33 | EE | Gautam Das, Michiel H. M. Smid: A lower bound for approximating the geometric minimum weight matching. Inf. Process. Lett. 74(5-6): 253-255 (2000) |
| 1998 | ||
| 32 | Gautam Das, King-Ip Lin, Heikki Mannila, Gopal Renganathan, Padhraic Smyth: Rule Discovery from Time Series. KDD 1998: 16-22 | |
| 31 | Gautam Das, Heikki Mannila, Pirjo Ronkainen: Similarity of Attributes by External Probes. KDD 1998: 23-29 | |
| 1997 | ||
| 30 | Gautam Das: The visibility graph contains a bounded-degree spanner. CCCG 1997 | |
| 29 | Gautam Das, Rudolf Fleischer, Leszek Gasieniec, Dimitrios Gunopulos, Juha Kärkkäinen: Episode Matching. CPM 1997: 12-27 | |
| 28 | Gautam Das, Dimitrios Gunopulos, Heikki Mannila: Finding Similar Time Series. PKDD 1997: 88-100 | |
| 27 | EE | 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 |
| 26 | 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) | |
| 25 | Gautam Das, Paul J. Heffernan, Giri Narasimhan: LR-visibility in Polygons. Comput. Geom. 7: 37-57 (1997) | |
| 24 | Gautam Das, Michael T. Goodrich: On the Complexity of Optimization Problems for 3-dimensional Convex Polyhedra and Decision Trees. Comput. Geom. 8: 123-137 (1997) | |
| 23 | Gautam Das, Giri Narasimhan: A Fast Algorithm for Constructing Sparse Euclidean Spanners. Int. J. Comput. Geometry Appl. 7(4): 297-315 (1997) | |
| 1996 | ||
| 22 | Danny Z. Chen, Gautam Das, Michiel H. M. Smid: Lower Bounds for Computing Geometric Spanners and Approximate Shortest Paths. CCCG 1996: 155-160 | |
| 21 | 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 | |
| 20 | 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 | |
| 19 | Gautam Das, Paul J. Heffernan: Constructing Degree-3 Spanners with Other Sparseness Properties. Int. J. Found. Comput. Sci. 7(2): 121-136 (1996) | |
| 1995 | ||
| 18 | Gautam Das, Giri Narasimhan, Jeffrey S. Salowe: A New Way to Weigh Malnourished Euclidean Graphs. SODA 1995: 215-222 | |
| 17 | EE | Sunil Arya, Gautam Das, David M. Mount, Jeffrey S. Salowe, Michiel H. M. Smid: Euclidean spanners: short, thin, and lanky. STOC 1995: 489-498 |
| 16 | Gautam Das, Michael T. Goodrich: On the Complexity of Approximating and Illuminating Three-Dimensional Convex Polyhedra (Preliminary Version). WADS 1995: 74-85 | |
| 15 | Barun Chandra, Gautam Das, Giri Narasimhan, José Soares: New sparseness results on graph spanners. Int. J. Comput. Geometry Appl. 5: 125-144 (1995) | |
| 1994 | ||
| 14 | Gautam Das, Paul J. Heffernan, Giri Narasimhan: Finding All Weakly-Visible Chords of a Polygon in Linear Time (Extended Abstract). SWAT 1994: 119-130 | |
| 13 | EE | Gautam Das, Giri Narasimhan: A Fast Algorithm for Constructing Sparse Euclidean Spanners. Symposium on Computational Geometry 1994: 132-139 |
| 12 | EE | Gautam Das, Giri Narasimhan: Optimal Linear-Time Algorithm for the Shortest Illuminating Line Segment in a Polygon. Symposium on Computational Geometry 1994: 259-266 |
| 11 | Gautam Das, Paul J. Heffernan, Giri Narasimhan: Finding all Weakly-Visible Chords of a Polygon in Linear Time. Nord. J. Comput. 1(4): 433-457 (1994) | |
| 1993 | ||
| 10 | Gautam Das, Paul J. Heffernan, Giri Narasimhan: LR-visibility in Polygons. CCCG 1993: 303-308 | |
| 9 | Gautam Das, Paul J. Heffernan: Constructing Degree-3 Spanners with Other Sparseness Properties. ISAAC 1993: 11-20 | |
| 8 | EE | Gautam Das, Paul J. Heffernan, Giri Narasimhan: Optimally Sparse Spanners in 3-Dimensional Euclidean Space. Symposium on Computational Geometry 1993: 53-62 |
| 7 | Ingo Althöfer, Gautam Das, David P. Dobkin, Deborah Joseph, José Soares: On Sparse Spanners of Weighted Graphs. Discrete & Computational Geometry 9: 81-100 (1993) | |
| 1992 | ||
| 6 | EE | 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. Theor. Comput. Sci. 103(1): 107-135 (1992) | |
| 1991 | ||
| 4 | Gautam Das, Giri Narasimhan: Geometric Searching and Link Distance (Extended Abstract). WADS 1991: 261-272 | |
| 1990 | ||
| 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 | |
| 1989 | ||
| 1 | Gautam Das, Deborah Joseph: Which Triangulations Approximate the Complete Graph?. Optimal Algorithms 1989: 168-192 | |
Colors in the list of coauthors