| 2011 |
|---|
| 116 | Just-in-Time Analytics on Large File Systems. H. Howie Huang, Nan Zhang, Wei Wang, Gautam Das, Alexander S. Szalay. FAST 2011, 217-230. Web SearchBibTeXDownload |
| 115 | Interactive itinerary planning. Senjuti Basu Roy, Gautam Das, Sihem Amer-Yahia, Cong Yu. ICDE 2011, 15-26. Web SearchBibTeXDownload |
| 114 | ASAP: Eliminating algorithm-based disclosure in privacy-preserving data publishing. Xin Jin, Nan Zhang, Gautam Das. Inf. Syst. (36): 859-880 (2011). Web SearchBibTeXDownload |
| 113 | Leveraging collaborative tagging for web item design. Mahashweta Das, Gautam Das, Vagelis Hristidis. KDD 2011, 538-546. Web SearchBibTeXDownload |
| 112 | Randomized Generalization for Aggregate Suppression Over Hidden Web Databases. Xin Jin, Nan Zhang, Aditya Mone, Gautam Das. PVLDB (4): 1099-1110 (2011). Web SearchBibTeXDownload |
| 111 | MRI: Meaningful Interpretations of Collaborative Ratings. Mahashweta Das, Sihem Amer-Yahia, Gautam Das, Cong Yu. PVLDB (4): 1063-1074 (2011). Web SearchBibTeXDownload |
| 110 | Exploration of Deep Web Repositories. Nan Zhang, Gautam Das. PVLDB (4): 1506-1507 (2011). Web SearchBibTeXDownload |
| 109 | Mining a search engine's corpus: efficient yet unbiased sampling and aggregate estimation. Mingyang Zhang, Nan Zhang, Gautam Das. SIGMOD Conference 2011, 793-804. Web SearchBibTeXDownload |
| 108 | Attribute domain discovery for hidden web databases. Xin Jin, Nan Zhang, Gautam Das. SIGMOD Conference 2011, 553-564. Web SearchBibTeXDownload |
| 107 | MOBIES: mobile-interface enhancement service for hidden web database. Xin Jin, Aditya Mone, Nan Zhang, Gautam Das. SIGMOD Conference 2011, 1263-1266. Web SearchBibTeXDownload |
| 2010 |
|---|
| 106 | Facetedpedia: enabling query-dependent faceted search for wikipedia. Ning Yan, Chengkai Li, Senjuti Basu Roy, Rakesh Ramegowda, Gautam Das. CIKM 2010, 1927-1928. Web SearchBibTeXDownload |
| 105 | Mining Time Series Data. Chotirat (Ann) Ratanamahatana, Jessica Lin, Dimitrios Gunopulos, Eamonn J. Keogh, Michail Vlachos, Gautam Das. Data Mining and Knowledge Discovery Handbook 2010, 1049-1077. Cited by 21Web SearchBibTeXDownload |
| 104 | Turbo-charging hidden database samplers with overflowing queries and skew reduction. Arjun Dasgupta, Nan Zhang, Gautam Das. EDBT 2010, 51-62. Web SearchBibTeXDownload |
| 103 | Algorithm-safe privacy-preserving data publishing. Xin Jin, Nan Zhang, Gautam Das. EDBT 2010, 633-644. Web SearchBibTeXDownload |
| 102 | Versatile publishing for privacy preservation. Xin Jin, Mingyang Zhang, Nan Zhang, Gautam Das. KDD 2010, 353-362. Web SearchBibTeXDownload |
| 101 | An Access Cost-Aware Approach for Object Retrieval over Multiple Sources. Benjamin Arai, Gautam Das, Dimitrios Gunopulos, Vagelis Hristidis, Nick Koudas. PVLDB (3): 1125-1136 (2010). Web SearchBibTeXDownload |
| 100 | Unbiased estimation of size and other aggregates over hidden web databases. Arjun Dasgupta, Xin Jin, Bradley Jewell, Nan Zhang, Gautam Das. SIGMOD Conference 2010, 855-866. Web SearchBibTeXDownload |
| 99 | Call to order: a hierarchical browsing approach to eliciting users' preference. Feng Zhao, Gautam Das, Kian-Lee Tan, Anthony K. H. Tung. SIGMOD Conference 2010, 27-38. Web SearchBibTeXDownload |
| 98 | Constructing and exploring composite items. Senjuti Basu Roy, Sihem Amer-Yahia, Ashish Chawla, Gautam Das, Cong Yu. SIGMOD Conference 2010, 843-854. Web SearchBibTeXDownload |
| 97 | Space efficiency in group recommendation. Senjuti Basu Roy, Sihem Amer-Yahia, Ashish Chawla, Gautam Das, Cong Yu. VLDB J. (19): 877-900 (2010). Web SearchBibTeXDownload |
| 96 | Facetedpedia: dynamic generation of query-dependent faceted interfaces for wikipedia. Chengkai Li, Ning Yan, Senjuti Basu Roy, Lekhendro Lisham, Gautam Das. WWW 2010, 651-660. Web SearchBibTeXDownload |
| 2009 |
|---|
| 95 | TRANS: Top-k Implementation Techniques of Minimum Effort Driven Faceted Search For Databases. Senjuti Basu Roy, Gautam Das. COMAD 2009. Web SearchBibTeXDownload |
| 94 | Top-k Algorithms and Applications. Gautam Das. DASFAA 2009, 789-792. Web SearchBibTeXDownload |
| 93 | Ranking objects based on relationships and fixed associations. Albert Angel, Surajit Chaudhuri, Gautam Das, Nick Koudas. EDBT 2009, 910-921. Web SearchBibTeXDownload |
| 92 | Sampling Methods in Approximate Query Answering Systems. Gautam Das. Encyclopedia of Data Warehousing and Mining 2009, 1702-1707. Web SearchBibTeXDownload |
| 91 | Leveraging COUNT Information in Sampling Hidden Databases. Arjun Dasgupta, Nan Zhang, Gautam Das. ICDE 2009, 329-340. Cited by 4Web SearchBibTeXDownload |
| 90 | DynaCet: Building Dynamic Faceted Search Systems over Databases. Senjuti Basu Roy, Haidong Wang, Ullas Nambiar, Gautam Das, Mukesh K. Mohania. ICDE 2009, 1463-1466. Web SearchBibTeXDownload |
| 89 | Determining Attributes to Maximize Visibility of Objects. Muhammed Miah, Gautam Das, Vagelis Hristidis, Heikki Mannila. IEEE Trans. Knowl. Data Eng. (21): 959-973 (2009). Web SearchBibTeXDownload |
| 88 | Privacy risks in health databases from aggregate disclosure. Gautam Das, Nan Zhang. PETRA 2009. Web SearchBibTeXDownload |
| 87 | Measure-driven Keyword-Query Expansion. Nikos Sarkas, Nilesh Bansal, Gautam Das, Nick Koudas. PVLDB (2): 121-132 (2009). Cited by 1Web SearchBibTeXDownload |
| 86 | Keyword querying and Ranking in Databases. Surajit Chaudhuri, Gautam Das. PVLDB (2): 1658-1659 (2009). Web SearchBibTeXDownload |
| 85 | Group Recommendation: Semantics and Efficiency. Sihem Amer-Yahia, Senjuti Basu Roy, Ashish Chawla, Gautam Das, Cong Yu. PVLDB (2): 754-765 (2009). Web SearchBibTeXDownload |
| 84 | Improved Search for Socially Annotated Data. Nikos Sarkas, Gautam Das, Nick Koudas. PVLDB (2): 778-789 (2009). Web SearchBibTeXDownload |
| 83 | Privacy preservation of aggregates in hidden databases: why and how?. Arjun Dasgupta, Nan Zhang, Gautam Das, Surajit Chaudhuri. SIGMOD Conference 2009, 153-164. Web SearchBibTeXDownload |
| 82 | HDSampler: revealing data behind web form interfaces. Anirban Maiti, Arjun Dasgupta, Nan Zhang, Gautam Das. SIGMOD Conference 2009, 1131-1134. Web SearchBibTeXDownload |
| 81 | Anytime measures for top-k algorithms on exact and fuzzy data sets. Benjamin Arai, Gautam Das, Dimitrios Gunopulos, Nick Koudas. VLDB J. (18): 407-427 (2009). Cited by 1Web SearchBibTeXDownload |
| 2008 |
|---|
| 80 | Minimum-effort driven dynamic faceted search in structured databases. Senjuti Basu Roy, Haidong Wang, Gautam Das, Ullas Nambiar, Mukesh K. Mohania. CIKM 2008, 13-22. Cited by 5Web SearchBibTeXDownload |
| 79 | Region Sampling: Continuous Adaptive Sampling on Sensor Networks. Song Lin, Benjamin Arai, Dimitrios Gunopulos, Gautam Das. ICDE 2008, 794-803. Cited by 3Web SearchBibTeXDownload |
| 78 | Standing Out in a Crowd: Selecting Attributes for Maximum Visibility. Muhammed Miah, Gautam Das, Vagelis Hristidis, Heikki Mannila. ICDE 2008, 356-365. Web SearchBibTeXDownload |
| 77 | Analyzing the Structure and Evolution of Massive Telecom Graphs. Amit Anil Nanavati, Rahul Singh, Dipanjan Chakraborty, Koustuv Dasgupta, Sougata Mukherjea, Gautam Das, Siva Gurumurthy, Anupam Joshi. IEEE Trans. Knowl. Data Eng. (20): 703-718 (2008). Cited by 3Web SearchBibTeXDownload |
| 76 | The Discrete Basis Problem. Pauli Miettinen, Taneli Mielikäinen, Aristides Gionis, Gautam Das, Heikki Mannila. IEEE Trans. Knowl. Data Eng. (20): 1348-1362 (2008). Cited by 19Web SearchBibTeXDownload |
| 75 | Distinct value estimation on peer-to-peer networks. Zubin Joseph, Gautam Das, Leonidas Fegaras. PETRA 2008, 26. Web SearchBibTeXDownload |
| 74 | Categorical skylines for streaming data. Nikos Sarkas, Gautam Das, Nick Koudas, Anthony K. H. Tung. SIGMOD Conference 2008, 239-250. Cited by 13Web SearchBibTeXDownload |
| 73 | Efficient sampling of information in social networks. Gautam Das, Nick Koudas, Manos Papagelis, Sushruth Puttaswamy. SSM 2008, 67-74. Web SearchBibTeXDownload |
| 2007 |
|---|
| 72 | Optimized stratified sampling for approximate query processing. Surajit Chaudhuri, Gautam Das, Vivek R. Narasayya. ACM Trans. Database Syst. (32): 9 (2007). Cited by 10Web SearchBibTeXDownload |
| 71 | STAR: A System for Tuple and Attribute Ranking of Query Answers. Nishant Kapoor, Gautam Das, Vagelis Hristidis, S. Sudarshan, Gerhard Weikum. ICDE 2007, 1483-1484. Web SearchBibTeXDownload |
| 70 | An Integrated Development Environment for Web Service Composition. Girish Chafle, Gautam Das, Koustuv Dasgupta, Arun Kumar, Sumit Mittal, Sougata Mukherjea, Biplav Srivastava. ICWS 2007, 839-847. Cited by 10Web SearchBibTeXDownload |
| 69 | Efficient Approximate Query Processing in Peer-to-Peer Networks. Benjamin Arai, Gautam Das, Dimitrios Gunopulos, Vana Kalogeraki. IEEE Trans. Knowl. Data Eng. (19): 919-933 (2007). Cited by 5Web SearchBibTeXDownload |
| 68 | A random walk approach to sampling hidden databases. Arjun Dasgupta, Gautam Das, Heikki Mannila. SIGMOD Conference 2007, 629-640. Cited by 14Web SearchBibTeXDownload |
| 67 | Report on the First International Workshop on Ranking in Databases (DBRank'07). Ihab F. Ilyas, Gautam Das. SIGMOD Record (36): 49-51 (2007). Web SearchBibTeXDownload |
| 66 | Introduction to special issue ACM SIGKDD 2006. Roberto J. Bayardo, Kristin P. Bennett, Gautam Das, Dimitrios Gunopulos, Johannes Gunopulos. TKDD (1) (2007). Web SearchBibTeXDownload |
| 65 | Anytime Measures for Top-k Algorithms. Benjamin Arai, Gautam Das, Dimitrios Gunopulos, Nick Koudas. VLDB 2007, 914-925. Cited by 12Web SearchBibTeXDownload |
| 64 | Ad-hoc Top-k Query Answering for Data Streams. Gautam Das, Dimitrios Gunopulos, Nick Koudas, Nikos Sarkas. VLDB 2007, 183-194. Cited by 18Web SearchBibTeXDownload |
| 63 | Computing Best Coverage Path in the Presence of Obstacles in a Sensor Field. Senjuti Basu Roy, Gautam Das, Sajal Das. WADS 2007, 577-588. Cited by 1Web SearchBibTeXDownload |
| 2006 |
|---|
| 62 | Probabilistic information retrieval approach for ranking of database query results. Surajit Chaudhuri, Gautam Das, Vagelis Hristidis, Gerhard Weikum. ACM Trans. Database Syst. (31): 1134-1168 (2006). Cited by 24Web SearchBibTeXDownload |
| 61 | Vulnerabilities of Internet Access Mechanisms from Mobile Ad Hoc Networks. Gautam Das, Maria Fazio, Massimo Villari, Antonio Puliafito. AINA (1) 2006, 851-858. Cited by 2Web SearchBibTeXDownload |
| 60 | On the structural properties of massive telecom call graphs: findings and implications. Amit Anil Nanavati, Siva Gurumurthy, Gautam Das, Dipanjan Chakraborty, Koustuv Dasgupta, Sougata Mukherjea, Anupam Joshi. CIKM 2006, 435-444. Cited by 26Web SearchBibTeXDownload |
| 59 | XML Query Routing in Structured P2P Systems. Leonidas Fegaras, Weimin He, Gautam Das, David Levine. DBISP2P 2006, 273-284. Cited by 6Web SearchBibTeXDownload |
| 58 | Approximating Aggregation Queries in Peer-to-Peer Networks. Benjamin Arai, Gautam Das, Dimitrios Gunopulos, Vana Kalogeraki. ICDE 2006, 42. Cited by 13Web SearchBibTeXDownload |
| 57 | The Discrete Basis Problem. Pauli Miettinen, Taneli Mielikäinen, Aristides Gionis, Gautam Das, Heikki Mannila. PKDD 2006, 335-346. Cited by 19Web SearchBibTeXDownload |
| 56 | Ordering the attributes of query results. Gautam Das, Vagelis Hristidis, Nishant Kapoor, S. Sudarshan. SIGMOD Conference 2006, 395-406. Cited by 29Web SearchBibTeXDownload |
| 55 | Answering Top-k Queries Using Views. Gautam Das, Dimitrios Gunopulos, Nick Koudas, Dimitris Tsirogiannis. VLDB 2006, 451-462. Cited by 46Web SearchBibTeXDownload |
| 2005 |
|---|
| 54 | Distributed core assisted scalable data dissemination in mobile ad hoc networks. Gautam Das, Maria Fazio, Massimo Villari, Antonio Puliafito. CollaborateCom 2005. Web SearchBibTeXDownload |
| 53 | CCID: Core construction for information dissemination in ad hoc scenario. Gautam Das, Maria Fazio, Massimo Villari, Antonio Puliafito. Communications and Computer Networks 2005, 114-119. Cited by 1Web SearchBibTeX |
| 52 | Mining Chains of Relations. Foto N. Afrati, Gautam Das, Aristides Gionis, Heikki Mannila, Taneli Mielikäinen, Panayiotis Tsaparas. ICDM 2005, 553-556. Cited by 4Web SearchBibTeXDownload |
| 51 | Hop counting based lightweight quality of service model for sensor devices. Gautam Das. IJAHUC (1): 59-69 (2005). Web SearchBibTeXDownload |
| 50 | Approximate Query Processing. Gautam Das. SBBD 2005, 8-9. Web SearchBibTeX |
| 49 | Mining Time Series Data. Chotirat (Ann) Ratanamahatana, Jessica Lin, Dimitrios Gunopulos, Eamonn J. Keogh, Michail Vlachos, Gautam Das. The Data Mining and Knowledge Discovery Handbook 2005, 1069-1103. Cited by 21Web SearchBibTeX |
| 2004 |
|---|
| 48 | Summary-based routing for content-based event distribution networks. Yi-Min Wang, Lili Qiu, Chad Verbowski, Dimitris Achlioptas, Gautam Das, Per-Åke Larson. Computer Communication Review (34): 59-74 (2004). Cited by 20Web SearchBibTeXDownload |
| 47 | Rotation invariant distance measures for trajectories. Michail Vlachos, Dimitrios Gunopulos, Gautam Das. KDD 2004, 707-712. Cited by 29Web SearchBibTeXDownload |
| 46 | Effective Use of Block-Level Sampling in Statistics Estimation. Surajit Chaudhuri, Gautam Das, Utkarsh Srivastava. SIGMOD Conference 2004, 287-298. Cited by 34Web SearchBibTeXDownload |
| 45 | Probabilistic Ranking of Database Query Results. Surajit Chaudhuri, Gautam Das, Vagelis Hristidis, Gerhard Weikum. VLDB 2004, 888-899. Cited by 62Web SearchBibTeXDownload |
| 2003 |
|---|
| 44 | Automated Ranking of Database Query Results. Sanjay Agrawal, Surajit Chaudhuri, Gautam Das, Aristides Gionis. CIDR 2003. Cited by 108Web SearchBibTeXDownload |
| 43 | Dynamic Sample Selection for Approximate Query Processing. Brian Babcock, Surajit Chaudhuri, Gautam Das. SIGMOD Conference 2003, 539-550. Cited by 70Web SearchBibTeXDownload |
| 2002 |
|---|
| 42 | Optimally computing a shortest weakly visible line segment inside a simple polygon. Binay K. Bhattacharya, Gautam Das, Asish Mukhopadhyay, Giri Narasimhan. Comput. Geom. (23): 1-29 (2002). Cited by 3Web SearchBibTeXDownload |
| 41 | DBXplorer: A System for Keyword-Based Search over Relational Databases. Sanjay Agrawal, Surajit Chaudhuri, Gautam Das. ICDE 2002, 5-16. Cited by 333Web SearchBibTeXDownload |
| 40 | DBXplorer: enabling keyword search over relational databases. Sanjay Agrawal, Surajit Chaudhuri, Gautam Das. SIGMOD Conference 2002, 627. Cited by 35Web SearchBibTeXDownload |
| 2001 |
|---|
| 39 | Lower bounds for computing geometric spanners and approximate shortest paths. Danny Z. Chen, Gautam Das, Michiel H. M. Smid. Discrete Applied Mathematics (110): 151-167 (2001). Cited by 31Web SearchBibTeXDownload |
| 38 | Overcoming Limitations of Sampling for Aggregation Queries. Surajit Chaudhuri, Gautam Das, Mayur Datar, Rajeev Motwani, Vivek R. Narasayya. ICDE 2001, 534-542. Cited by 82Web SearchBibTeXDownload |
| 37 | Time-Series Similarity Problems and Well-Separated Geometric Sets. Béla Bollobás, Gautam Das, Dimitrios Gunopulos, Heikki Mannila. Nord. J. Comput. (8): 409-423 (2001). Cited by 79Web SearchBibTeXDownload |
| 36 | Time Series Similarity Measures and Time Series Indexing. Dimitrios Gunopulos, Gautam Das. SIGMOD Conference 2001, 624. Cited by 31Web SearchBibTeXDownload |
| 35 | A Robust, Optimization-Based Approach for Approximate Answering of Aggregate Queries. Surajit Chaudhuri, Gautam Das, Vivek R. Narasayya. SIGMOD Conference 2001, 295-306. Cited by 80Web SearchBibTeXDownload |
| 2000 |
|---|
| 34 | A lower bound for approximating the geometric minimum weight matching. Gautam Das, Michiel H. M. Smid. Inf. Process. Lett. (74): 253-255 (2000). Cited by 1Web SearchBibTeXDownload |
| 33 | Context-Based Similarity Measures for Categorical Databases. Gautam Das, Heikki Mannila. PKDD 2000, 201-210. Cited by 30Web SearchBibTeXDownload |
| 1998 |
|---|
| 32 | Rule Discovery from Time Series. Gautam Das, King-Ip Lin, Heikki Mannila, Gopal Renganathan, Padhraic Smyth. KDD 1998, 16-22. Cited by 416Web SearchBibTeX |
| 31 | Similarity of Attributes by External Probes. Gautam Das, Heikki Mannila, Pirjo Ronkainen. KDD 1998, 23-29. Cited by 55Web SearchBibTeX |
| 1997 |
|---|
| 30 | On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees. Gautam Das, Sanjiv Kapoor, Michiel H. M. Smid. Algorithmica (19): 447-460 (1997). Cited by 6Web SearchBibTeXDownload |
| 29 | The visibility graph contains a bounded-degree spanner. Gautam Das. CCCG 1997. Cited by 5Web SearchBibTeX |
| 28 | LR-visibility in Polygons. Gautam Das, Paul J. Heffernan, Giri Narasimhan. Comput. Geom. (7): 37-57 (1997). Cited by 34Web SearchBibTeXDownload |
| 27 | On the Complexity of Optimization Problems for 3-dimensional Convex Polyhedra and Decision Trees. Gautam Das, Michael T. Goodrich. Comput. Geom. (8): 123-137 (1997). Cited by 19Web SearchBibTeXDownload |
| 26 | Episode Matching. Zdenek Tronícek, Rudolf Fleischer, Leszek Gasieniec, Dimitrios Gunopulos, Juha Kärkkäinen. CPM 1997, 12-27. Cited by 66Web SearchBibTeXDownload |
| 25 | A Fast Algorithm for Constructing Sparse Euclidean Spanners. Gautam Das, Giri Narasimhan. Int. J. Comput. Geometry Appl. (7): 297-315 (1997). Cited by 74Web SearchBibTeX |
| 24 | Finding Similar Time Series. Gautam Das, Dimitrios Gunopulos, Heikki Mannila. PKDD 1997, 88-100. Cited by 227Web SearchBibTeXDownload |
| 23 | Time-Series Similarity Problems and Well-Separated Geometric Sets. Béla Bollobás, Gautam Das, Dimitrios Gunopulos, Heikki Mannila. Symposium on Computational Geometry 1997, 454-456. Cited by 79Web SearchBibTeXDownload |
| 1996 |
|---|
| 22 | Lower Bounds for Computing Geometric Spanners and Approximate Shortest Paths. Danny Z. Chen, Gautam Das, Michiel H. M. Smid. CCCG 1996, 155-160. Web SearchBibTeX |
| 21 | Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane. Srinivasa Rao Arikati, Danny Z. Chen, L. Paul Chew, Gautam Das, Michiel H. M. Smid, Christos D. Zaroliagis. ESA 1996, 514-528. Cited by 58Web SearchBibTeXDownload |
| 20 | On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees. Gautam Das, Sanjiv Kapoor, Michiel H. M. Smid. FSTTCS 1996, 64-75. Cited by 6Web SearchBibTeXDownload |
| 19 | Constructing Degree-3 Spanners with Other Sparseness Properties. Gautam Das, Paul J. Heffernan. Int. J. Found. Comput. Sci. (7): 121-136 (1996). Cited by 19Web SearchBibTeX |
| 1995 |
|---|
| 18 | New sparseness results on graph spanners. Barun Chandra, Gautam Das, Giri Narasimhan, José Soares. Int. J. Comput. Geometry Appl. (5): 125-144 (1995). Web SearchBibTeX |
| 17 | A New Way to Weigh Malnourished Euclidean Graphs. Gautam Das, Giri Narasimhan, Jeffrey S. Salowe. SODA 1995, 215-222. Cited by 55Web SearchBibTeXDownload |
| 16 | Euclidean spanners: short, thin, and lanky. Sunil Arya, Gautam Das, David M. Mount, Jeffrey S. Salowe, Michiel H. M. Smid. STOC 1995, 489-498. Cited by 150Web SearchBibTeXDownload |
| 15 | On the Complexity of Approximating and Illuminating Three-Dimensional Convex Polyhedra (Preliminary Version). Gautam Das, Michael T. Goodrich. WADS 1995, 74-85. Cited by 14Web SearchBibTeXDownload |
| 1994 |
|---|
| 14 | Finding all Weakly-Visible Chords of a Polygon in Linear Time. Gautam Das, Paul J. Heffernan, Giri Narasimhan. Nord. J. Comput. (1): 433-457 (1994). Cited by 13Web SearchBibTeX |
| 13 | Finding All Weakly-Visible Chords of a Polygon in Linear Time (Extended Abstract). Gautam Das, Paul J. Heffernan, Giri Narasimhan. SWAT 1994, 119-130. Web SearchBibTeXDownload |
| 12 | Optimal Linear-Time Algorithm for the Shortest Illuminating Line Segment in a Polygon. Gautam Das, Giri Narasimhan. Symposium on Computational Geometry 1994, 259-266. Cited by 15Web SearchBibTeXDownload |
| 11 | A Fast Algorithm for Constructing Sparse Euclidean Spanners. Gautam Das, Giri Narasimhan. Symposium on Computational Geometry 1994, 132-139. Cited by 74Web SearchBibTeXDownload |
| 1993 |
|---|
| 10 | LR-visibility in Polygons. Gautam Das, Paul J. Heffernan, Giri Narasimhan. CCCG 1993, 303-308. Cited by 34Web SearchBibTeX |
| 9 | On Sparse Spanners of Weighted Graphs. Ingo Althöfer, Gautam Das, David P. Dobkin, Deborah Joseph, José Soares. Discrete & Computational Geometry (9): 81-100 (1993). Cited by 242Web SearchBibTeXDownload |
| 8 | Constructing Degree-3 Spanners with Other Sparseness Properties. Gautam Das, Paul J. Heffernan. ISAAC 1993, 11-20. Cited by 19Web SearchBibTeXDownload |
| 7 | Optimally Sparse Spanners in 3-Dimensional Euclidean Space. Gautam Das, Paul J. Heffernan, Giri Narasimhan. Symposium on Computational Geometry 1993, 53-62. Cited by 47Web SearchBibTeXDownload |
| 1992 |
|---|
| 6 | New Sparseness Results on Graph Spanners. Barun Chandra, Gautam Das, Giri Narasimhan, José Soares. Symposium on Computational Geometry 1992, 192-201. Cited by 127Web SearchBibTeXDownload |
| 5 | Minimum Vertex Hulls for Polyhedral Domains. Gautam Das, Deborah Joseph. Theor. Comput. Sci. (103): 107-135 (1992). Cited by 15Web SearchBibTeXDownload |
| 1991 |
|---|
| 4 | Geometric Searching and Link Distance (Extended Abstract). Gautam Das, Giri Narasimhan. WADS 1991, 261-272. Web SearchBibTeXDownload |
| 1990 |
|---|
| 3 | Minimum Vertex Hulls for Polyhedral Domains. Gautam Das, Deborah Joseph. STACS 1990, 126-137. Cited by 15Web SearchBibTeXDownload |
| 2 | Generating Sparse Spanners for Weighted Graphs. Ingo Althöfer, Gautam Das, David P. Dobkin, Deborah Joseph. SWAT 1990, 26-37. Cited by 34Web SearchBibTeXDownload |
| 1989 |
|---|
| 1 | Which Triangulations Approximate the Complete Graph?. Gautam Das, Deborah Joseph. Optimal Algorithms 1989, 168-192. Cited by 79Web SearchBibTeXDownload |
