Query Results

• Chetan Arora and Subhashis Banerjee and Prem Kalra and S.N. Maheshwari.
  An Efficient Graph Cut Algorithm for Computer Vision Problems.
  European Conference on Computer Vision (ECCV 2010).
  pp. 552--565, September, 2010.
  

• Amitabha Bagchi, Adit Madan and Achal Premi.
  Brief Announcement: Hierarchical neighbor graphs: An energy-efficient bounded degree connected structure for wireless networks. .
  6th International Workshop on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS 2010).
  pp. 31-33, July, 2010.
  Download         

• Amitabha Bagchi and Garima Lahoti.
  Relating Web pages to enable information-gathering tasks..
  20th ACM Conference on Hypertext and Hypermedia (Hypertext '09).
  pp. 109-118, June, 2009.
  Download         

• Surender Baswana, and Vishrut Goyal and Sandeep Sen.
  All-Pairs Nearly 2-Approximate Shortest-Paths in O( n2 polylog n) Time.
  Theoretical Computer Science.
  Vol. 410, No. 1, pp. 84 - 93, January, 2009.
  

• V. Muralidhara and Sandeep Sen.
  Improvements on the Johnson bound for Reed Solomon Codes.
  Discrete Applied Mathematics.
  Vol. to appear, pp. electrnic version avail, October, 2008.
  

• Amitabha Bagchi and Sohit Bansal.
  Nearest-neighbor graphs on random point sets and their applications to sensor networks.
  27th Annual Symposium on Principles of Distributed Computing (PODC '08).
  pp. 434, August, 2008.
  Download         

• Sanjam Garg, Raghav Bhaskar, Satyanarayana V. Lokam.
  Improved Bounds on Security Reductions for Discrete Log Based Signatures.
  CRYPTO 2008.
  pp. 93-107, August, 2008.
  

• S. Baswana, A. Gaur Sandeep Sen and J. Upadhyaya.
  Distance Oracle for unweighted graphs: breaking the quadratic barrier with constant additive error.
  ICALP.
  LNCS, July, 2008.
  

• A. Verma and Sandeep Sen.
  # Combating I-O bottleneck using prefetching: Model, Algorithms and Ramifications, .
  Journal of Supercomputing .
  Vol. to appear, pp. electrnic version avail, May, 2008.
  

• S. Rajasekaran and S. Sen.
  Optimal and practical algorithms for sorting on the PDM.
  IEEE Transaction on Computers.
  Vol. 57, No. 4, pp. 547 - 561, April, 2008.
  

• A. Verma and S. Sen.
  Combating I-O bottleneck using prefetching: Model, Algorithms and Ramifications.
  Journal on Supercompmuting.
  Vol. to appear, January, 2008.
  

• V. Muralidhara and S. Sen.
  A Result on the Distribution of Quadratic Residues with Applications to Elliptic Curve Cryptography.
  Indocrypt.
  December, 2007.
  

• P. Worah and S. Sen.
  A linear time deterministic algorithm to find a small subset that approximates the centroid.
  Information Processing Letters.
  Vol. 105(1), pp. 17 - 19, December, 2007.
  

• Amitabha Bagchi, Amitabh Chaudhary, David Eppstein, Michael T. Goodrich.
  Deterministic sampling and range counting in geometric data streams.
  Trans. on Algorithms.
  Vol. 3, No. 2, May, 2007.
  Download         

• Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman, and Christian Scheideler.
  Algorithms for Fault-Tolerant Routing in Circuit Switched Networks..
  SIAM Journal of Discrete Math.
  Vol. 21, No. 1, pp. 141-157, February, 2007.
  Download         

• S. Baswana and S. Sen.
  A Simple Linear Time Algorithm for Computing a $(2k-1)$-Spanner of $O(n^{1+1/k})$ Size in Weighted Graphs.
  Random Structures and Algorithms.
  Vol. to appear, January, 2007.
  

• A. Verma and S. Sen.
  Algorithmic ramifications of Prefetching in Memory Hierarchy.
  High Performance Computing.
  December, 2006.
  

• Amitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary, Christian Scheideler and David Eppstein.
  The effect of faults on network expansion.
  Theor. Comput. Syst..
  Vol. 39, No. 6, pp. 903-928, November, 2006.
  Download         

• Amitabha Bagchi, Amitabh Chaudhary, Michael T. Goodrich, Chen Li, Michal Shmueli-Scheuer.
  Achieving Communication Efficiency through Push-Pull Partitioning of Semantic Spaces in Client-Server Architectures.
  Transactions on Knowledge and Data Engineering.
  Vol. 18, No. 10, pp. 1352-1367, October, 2006.
  Download         

• S. Baswana and S. Sen.
  Approximate distance oracles for unweighted graphs in $O(n^2)$ time.
  ACM Transactions on Algorithms (Special issue SODA 2004) in $O(n^2)$ time.
  Vol. 2, pp. 557 - 577, October, 2006.
  

• Amitabha Bagchi, Ankur Bhargava, Torsten Suel.
  Approximate maximum weight branchings.
  Information Processing Letters.
  Vol. 99, No. 2, pp. 54-58, July, 2006.
  Download         

• Y. Sabharwal, N. Sharma and S. Sen.
  Nearest Neighbors Search using Point Location in Balls with applications to approximate Voronoi Decompositions.
  Journal of Compter and System Sciences.
  Vol. 72(6), pp. 955 - 977, January, 2006.
  

• Sanjiva Prasad, Mahendra Bisht, Rahul Agarwal, S. N. Maheshwari.
  Divide and Concur: Employing Chandra and Toueg's Consensus Algorithm in a Multi-level Setting.
  Proceedings of ICDCIT 2005.
  pp. 177-188, December, 2005.
  Download         

• N. Devanur, N. Garg, R. Khandekar, V. Pandit, A. Saberi and V. Vazirani.
  Price of Anarchy, Locality Gap, and a Network Service Game.
  1st Workshop on Internet and Network Economics.
  December, 2005.
  

• G. Batra, N. Garg and G. Gupta.
  Heuristic improvements for computing max multicommodity flow and min multicut.
  13th European Symposium on Algorithms.
  October, 2005.
  

• A. Kumar and Y. Sabharwal and S. Sen.
  Linear Time Algorithms for Clustering Problems in any dimensions.
  ICALP.
  pp. 1374 -- 1385, July, 2005.
  

• Naveen Garg.
  Saving an epsilon: A 2-approximation for the k-MST problem in graphs.
  ACM Symposium on Theory of Computing.
  May, 2005.
  

• S. Rajasekaran and S. Sen.
  PDM Sorting Algorithms that Take a Small Number of Passes.
  ACM-IEEE IPDPS.
  April, 2005.
  

• Surender Baswana, Vishrut Goyal, Sandeep Sen.
  All-pairs nearly 2-approximate shortest paths in O(n^2 polylog n) time.
  22nd Symposium on Theoretical Aspect of Computer Science (STACS), Stuttgart, Germany.
  February, 2005.
  

• Naveen Garg, Rohit Khandekar, and Vinayaka Pandit .
  Improved Approximation for Universal Facility Location.
  ACM-SIAM Symposium on Discrete Algorithms.
  January, 2005.
  

• Y. Sabharwal and S. Sen.
  A linear time algorithm for approximate 2-means clustering.
  Computational Geometry : Theory and Applications.
  Vol. 32(2), pp. 159 -- 173, January, 2005.
  

• S. Rajasekaran and S. Sen.
  A generalization of the 0-1 principle for sorting.
  Information Processing Letters.
  Vol. 94(1), pp. 43 - 47, January, 2005.
  

• Amit Kumar, Sandeep Sen and Yogish Sabharwal.
  A simple linear time (1+epsilon)-approximation algorithm for k-means clustering in any dimensions. .
  IEEE Foundations of Computer Science.
  November, 2004.
  

• A. Kumar and Y. Sabharwal and S. Sen.
  A simple linear time approximation algorithm for geometric k-means problem in any dimension.
  IEEE FOCS.
  October, 2004.
  

• Naveen Garg and Rohit Khandekar.
  Fractional covering with upper bounds on the variables: Solving LPs with negative entries..
  12th Annual European Symposium on Algorithms.
  pp. 24-35, September, 2004.
  

• Amit Kumar and Chandra Chekuri.
  Maximum Coverage Problem with Group Budget Constraints..
  International Workshop on Approximation Algorithms for Combinatorial Optimization Problems.
  August, 2004.
  

• Surender Baswana, Sandeep Sen and Ramesh Hariharan.
  Improved Decremental Algorithms for Transitive Closure and All-pairs Shortest Paths in Digraphs.
  Journal of Algorithms (accepted for publication 25th August 2004).
  TR: 2004/1, July, 2004.
  

• A. Goel , C. Chekuri , S. Khanna and Amit Kumar.
  Multi-processor Scheduling for Minimizing Flow Time with epsilon-Resource Augmentation. .
  ACM Symposium on Theory of Computing.
  July, 2004.
  

• Minos Garofalakis and Amit Kumar.
  Deterministic Wavelet Thresholding for Maximum-Error Metrics. .
  ACM Principles of Database Systems.
  July, 2004.
  

• Abhinav Kamra, Huzur Saran, Sandeep Sen, Rajeev Shorey.
  Fair adaptive bandwidth allocation: a rate control based active queue management discipline.
  Computer Networks.
  Vol. 44, pp. 135-152, February, 2004.
  

• Naveen Garg and Vijay V. Vazirani and Mihalis Yannakakis.
  Multiway cuts in directed and node weighted graphs..
  Journal of Algorithms.
  Vol. 50, No. 1, pp. 49-61, January, 2004.
  

• Surender Baswana and Sandeep Sen.
  Approximate Distance Oracles for Unweighted Graphs in O(n^2 log n) Time.
  15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA).
  January, 2004.
  

• Vijay Arya and Naveen Garg and Rohit Khandekar and Kamesh Munagala and Adam Meyerson and Vinayaka Pandit.
  Local Search Heuristics for $k$-median and facility location problems..
  SIAM Journal on Computing.
  Vol. 33, No. 3, pp. 544-562, January, 2004.
  

• Guy Even and Naveen Garg and Jochen Koenemann and R. Ravi and Amitabh Sinha.
  Min-max tree covers..
  Operations Research Letters.
  Vol. 32, No. 4, pp. 309-315, January, 2004.
  

• Anupam Gupta , Amit Kumar, Martin Pal , Tim Roughgarden.
  Approximation via Cost-Sharing : A Simple Approximation Algorithm for the Multi-commodity Rent-or-Buy Problem. .
  IEEE Foundations of Computer Science.
  October, 2003.
  

• S. K. Gupta, Pankaj Mangal and Vineet Paliwal.
  Some work towards the proof of the reconstruction conjecture.
  Discrete Mathematics.
  Vol. 272, pp. 291-296, September, 2003.
  

• Naveen Garg and Rohit Khandekar and Keshav Kunal and Vinayaka Pandit.
  Bandwidth maximization in multicasting..
  11th European Symposium on Algorithms.
  pp. 242-253, September, 2003.
  

• Guy Even and Naveen Garg and Jochen Koenemann and R. Ravi and Amitabh Sinha.
  Covering graphs using stars and trees..
  6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems.
  pp. 24-35, August, 2003.
  

• Surender Baswana and Sandeep Sen.
  A Simple Linear time Algorithm for Computing (2k-1)-spanner of O(n^{1+1/k}) size for weighted graphs.
  30th International Colloquium on Automata, Languages and Programming (ICALP).
  June, 2003.
  

• Anupam Gupta, Amit Kumar, Tim Roughgarden.
  Simpler and better approximation algorithms for network design. .
  ACM Symposium on Theory of Computing.
  June, 2003.
  

• Anupam Gupta, Amit Kumar, Mikkel Thorup.
  Tree based MPLS routing..
  ACM Symposium on Parallel Algorithms.
  June, 2003.
  

• Minos N. Garofalakis, Amit Kumar.
  Correlating XML data streams using tree-edit distance embeddings..
  ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems.
  June, 2003.
  

• Anupam Gupta, Amit Kumar, Rajeev Rastogi.
  Exploring the trade-off between label size and stack depth in MPLS Routing. .
  IEEE INFOCOM.
  March, 2003.
  

• N. Gupta and S. Sen.
  Faster output-sensitive algorithms for three dimensionalconvex hull and maximal vector problem.
  Journal of Parallel and Distributed Computing.
  Vol. 63(4), pp. 488 -- 500, January, 2003.
  

• Surender Baswana, Ramesh Hariharan and Sandeep Sen.
  Maintaining All-pairs Approximate Shortest Paths under Deletion of Edges.
  14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA).
  January, 2003.
  

• Friedrich Eisenbrand and Stefan Funke and Naveen Garg and Jochen Koenemann.
  A combinatorial algorithm for computing a maximum independent set in a $t$-perfect graph..
  14th Annual ACM-SIAM Symposium on Discrete Algorithms.
  pp. 517-522, January, 2003.
  

• Y. Sabharwal N. Sharma and S. Sen.
  Nearest Neighbor Searching using Point Location in Balls: with applications to approximate Voronoi Decompositions.
  FSTTCS.
  pp. 311--323, December, 2002.
  

• S. Sen, S. Chatterjee and N. Dumeer.
  Towards a theory of cache-efficient algorithms.
  Journal of the ACM.
  Vol. 49(6), pp. 828 --858, November, 2002.
  

• Amit Kumar, Anupam Gupta, Tim Roughgarden:.
  A Constant-Factor Approximation Algorithm for the Multicommodity rent-or-buy problem .
  IEEE Foundations of Computer Science.
  November, 2002.
  

• Naveen Garg and Neal Young.
  On-line end-to-end congestion control..
  43rd Annual IEEE Symposium on Foundations of Computer Science.
  pp. 303-312, October, 2002.
  

• Naveen Garg and Rohit Khandekar.
  Fast approximation algorithms for fractional steiner forest and related problems..
  43rd Annual IEEE Symposium on Foundations of Computer Science.
  pp. 500-509, October, 2002.
  

• Chaitanya Swamy, Amit Kumar.
  Primal-Dual Algorithms for Connected Facility Location Problems..
  Approximation Algorithms for Combinatorial Optimization.
  September, 2002.
  

• Amit Chakrabarti, Chandra Chekuri, Anupam Gupta, Amit Kumar.
  Approximation Algorithms for the Unsplittable Flow Problem..
  Approximation Algorithms for Combinatorial Optimization .
  September, 2002.
  

• David Kempe, Jon M. Kleinberg, Amit Kumar.
  Connectivity and Inference Problems for Temporal Networks..
  Journal of Computing and System Sciences.
  Vol. 64, No. 4, June, 2002.
  

• Chandra Chekuri, Anupam Gupta, Amit Kumar, Joseph Naor, Danny Raz.
  Building Edge-Failure Resilient Networks. .
  Integer Programming and Combinatorial Optimization.
  May, 2002.
  

• P. Aggarwal, B. Bhattacharya and S. Sen.
  Improved Algorithms for Uniform Partitions of Points.
  Algorithmica.
  Vol. 30, pp. 521 -- 539, April, 2002.
  

• S. Baswana and S. Sen.
  Planar Graph Blocking for External Searching.
  Algorithmica.
  Vol. 34, pp. 298--308, March, 2002.
  

• Sandeep Sen , S. Baswana, R. Hariharan.
  Improved online algorithms for transitive-closure and all-pairs shortest paths in digraphs for edge deletions,.
  STOC 2002..
  January, 2002.
  

• Naveen Garg and Marina Papatriantafilou and Philippas Tsigas.
  Distributed List Coloring: How to Dynamically Allocate Frequencies to Mobile Base Stations..
  Wireless Networks.
  Vol. 8, No. 1, pp. 49-60, January, 2002.
  

• Anupam Gupta, Amit Kumar.
  Sorting and Selection with Structured Costs.
  IEEE Foundations of Computer Science.
  October, 2001.
  

• Anupam Gupta, Amit Kumar, Rajeev Rastogi.
  Traveling with a Pez Dispenser (Or, Routing Issues in MPLS)..
  IEEE Foundations of Computer Science.
  October, 2001.
  

• Vijay Arya and Naveen Garg and Rohit Khandekar and Kamesh Munagala and Adam Meyerson and Vinayaka Pandit.
  Local Search Heuristics for $k$-median and facility location problems..
  33rd Annual ACM Symposium on Theory of Computing.
  pp. 21-29, July, 2001.
  

• Naveen Garg and Rohit Khandekar and Goran Konjevod and R. Ravi and F.S. Salman and Amitabh Sinha.
  On the Integrality Gap of a Natural Formulation of the Single-Sink Buy-at-bulk Network Design Problem..
  Integer Programming and Combinatorial Optimization.
  pp. 170-184, June, 2001.
  

• M. Dyer and S. Sen.
  Fast and optimal parallel multidimensional search in PRAMs with applications to linear-programming and related problems.
  SIAM Journal on Computing.
  Vol. 40, March, 2001.
  

• D. Dubhashi and S. Sen.
  Concentration of measure for randomized algorithms: techniques and applications.
  Handbook of Randomized Algorithms.
  Vol. I, pp. 35 - 101, March, 2001.
  

• N. Gupta and S. Sen.
  An efficient output-size sensitive parallel algorithm for hidden-surface removal for terrains.
  Algorithmica.
  Vol. 31, pp. 179 -- 207, February, 2001.
  

• Jon M. Kleinberg, Amit Kumar.
  Wavelength Conversion in Optical Networks..
  Journal of Algorithms.
  Vol. 38, No. 1, January, 2001.
  

• S.sen ,N. Gupta and S. Chopra, .
  Optimal, Output-Sensitive Algorithms for Constructing Upper Envelope of Line Segments in Par- allel,.
  Proc. of FSTTCS , LNCS 2245,.
  pp. 183-194, January, 2001.
  

• Amit Kumar, Jon Kleinberg.
  Fairness Measures for Resource Allocation..
  IEEE Symposium on Foundations of Computer Science.
  November, 2000.
  

• David Kempe, Jon M. Kleinberg, Amit Kumar.
  Connectivity and inference problems for temporal networks. .
  ACM Symposium on Theory of Computing.
  May, 2000.
  

• Naveen Garg and Goran Konjevod and R. Ravi.
  A polylogarithmic approximation algorithm for the group steiner tree problem..
  Journal of Algorithms.
  Vol. 37, No. 1, pp. 66-84, January, 2000.
  

• S. Sen and S. Baswana, .
  Planar Graph Blocking for External Searching,.
  Proc. of FSTTCS, LNCS 1974,.
  pp. 252-263, January, 2000.
  

• Susanne Albers and Naveen Garg and Stefano Leonardi.
  Minimizing stall time in single and parallel disk systems..
  Journal of the ACM.
  Vol. 47, No. 6, pp. 969-986, January, 2000.
  

• S. Sen and S. Chatterjee.
  Towards a theory of cache-efficient algorithms.
  SODA.
  January, 2000.
  

• Naveen Garg and Sachin Jain and Chaitanya Swamy.
  A randomized algorithm for flow-shop scheduling..
  19th International Conference on Foundations of Software Technology and Theoretical Computer Science.
  pp. 213-218, December, 1999.
  

• P. Agarwal and B. Bhattacharya and S. Sen.
  Output-Sensitive Algorithms for Uniform Partitions of Points.
  ISAAC.
  December, 1999.
  

• S.K.Gupta, K.Sambasiva Rao and Vasudha Bhatnagar.
  K-Means Clustering Algorithm for Categorial Attributes.
  DaWaK99 (Data Warehouse and Knowledge Discovery), Florence, Italy.
  September, 1999.
  

• S. Sen and Neelima Gupta.
  Distribution sensitive algorithms.
  Nordic Journal on Computing (Special Issue).
  Vol. 6, pp. 194 - 211, June, 1999.
  

• S.K. Gupta and Amrinder Singh.
  On Tree roots of Graph.
  International Journal of Mathematics.
  Vol. 76, January, 1999.
  

• Jon M. Kleinberg, Amit Kumar.
  Wavelength Conversion in Optical Networks..
  ACM-SIAM Symposium on Discrete Algorithms.
  January, 1999.
  

• Naveen Garg and Huzur Saran and Vijay V. Vazirani.
  Finding separator cuts in planar graphs within twice the optimal..
  SIAM Journal on Computing.
  Vol. 29, No. 1, pp. 159-179, January, 1999.
  

• Yefim Dinitz and Naveen Garg and Michel X. Goemans.
  On the single-source unsplittable flow problem..
  Combinatorica.
  Vol. 19, No. 1, pp. 17-41, January, 1999.
  

• Sanjeev Kapoor , A. Kumar , V. Kwatra , B. Singh.
  Using Separating Planes Between Objects For Dynamic Binary Space Partitioning.
  International Conference On Visual Computing.
  , , 1999.
  

• Sanjeev Kapoor.
  Efficiently Computing Geodesic Shortest Paths.
  ACM Symposium On Theory Of Computing.
  , , 1999.
  

• Yefim Dinitz and Naveen Garg and Michel X. Goemans.
  On the single-source unsplittable flow problem..
  39th Annual IEEE Symposium on Foundations of Computer Science.
  pp. 290-299, October, 1998.
  

• Naveen Garg and Jochen Koenemann.
  Faster and simpler algorithms for multicommodity flow and other fractional packing problems..
  39th Annual IEEE Symposium on Foundations of Computer Science.
  pp. 253-259, October, 1998.
  

• S. Sen and N. Gupta.
  Distribution sensitive algorithms.
  SWAT.
  July, 1998.
  

• Susanne Albers and Naveen Garg and Stefano Leonardi.
  Minimizing stall time in single and parallel disk systems..
  30th Annual ACM Symposium on Theory of Computing.
  pp. 454-462, May, 1998.
  

• N. Gupta and S. Sen.
  An improved output-sensitive parallel algorithm for hidden-surface removal for terrains.
  ACM Int'l Parallel Processing Symposium.
  April, 1998.
  

• Sanjiva Prasad , R. M. Amadio.
  Modelling IP Mobility.
  Proc. Of CONCUR.
  January, 1998.
  

• Naveen Garg and Shiva Chaudhuri and R. Ravi.
  The $p$-neighbor $k$-center problem..
  Information Processing Letters.
  Vol. 65, No. 3, pp. 131-134, January, 1998.
  

• Naveen Garg and Goran Konjevod and R. Ravi.
  A polylogarithmic approximation algorithm for the group steiner tree problem..
  9th Annual ACM-SIAM Symposium on Discrete Algorithms .
  pp. 253-259, January, 1998.
  

• S. Sen.
  Lower bounds for parallel algebraic decision trees, parallel complexity of convex hulls and related problems.
  Theoretical Computer Science.
  Vol. 188, pp. 59 - 78, November, 1997.
  

• B. Bhattacaharya and S. Sen.
  On a simple practical optimal output-sensitive randomized planar convex hull algorithm.
  Journal of Algorithms.
  Vol. 25, pp. 177 - 193, October, 1997.
  

• A. Aggarwal, D. Kravets, J. Park and S.Sen.
  Parallel Searching in generalized Mone Arrays with Applications.
  Algorithmica.
  Vol. 19, pp. 291 - 317, March, 1997.
  

• N. Gupta and S. Sen.
  Optimal output-sensitive algorithms for constructing planar hulls in parallel.
  Computational Geometry : Theory and Applications.
  Vol. 8, pp. 151 - 166, January, 1997.
  

• S.K. Gupta, Lokesh Gupta and Amit Sudan.
  Ramsey Number for Fan-Fan Graphs.
  Journal of Combinatorics, Information and System Sciences.
  Vol. 22, No. 2, pp. 85-93, January, 1997.
  

• Naveen Garg and Dorit S. Hochbaum.
  An O($log k$) approximation algorithm for the $k$ minimum spanning tree problem in the plane..
  Algorithmica .
  Vol. 18, No. 1, pp. 111-121, January, 1997.
  

• Naveen Garg and Vijay V. Vazirani and Mihalis Yannakakis.
  Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover..
  Algorithmica.
  Vol. 18, No. 1, pp. 3-20, January, 1997.
  

• Sanjiva Prasad , B. Karthikeyan , T. R. Vishwanath.
  Mechanizing Various Pi-calculi In HOL.
  Proc. Of TPHOL.
  January, 1997.
  

• Sanjeev Kapoor , S. N. Maheshwari , J. S. B. Mitchell.
  An Efficient Algorithm For Euclidean Shortest Paths Amongst Polygonal Obstacles.
  Discrete And Computational Geometry.
  Vol. , , 1997.
  

• Sanjeev Kapoor , G. Das , M. Smid.
  On The Complexity Of Approximating Travelling Salesman Problem Tours And Minimum Spanning Trees.
  Algorithmica.
  Vol. , , 1997.
  

• Naveen Garg.
  A 3-approximation algorithm for the minimum tree spanning $k$ vertices..
  37th Annual IEEE Symposium on Foundations of Computer Science.
  pp. 302-309, November, 1996.
  

• Naveen Garg and Marina Papatriantafilou and Philippas Tsigas.
  Distributed List Coloring: How to Dynamically Allocate Frequencies to Mobile Base Stations..
  8th IEEE Symposium on Parallel and Distributed Processing.
  pp. 18-25, July, 1996.
  

• S. Sen.
  Parallel multidimensional searching using approximation algorithms with applications to linear programming and related problems.
  ACM SIGACT SPAA.
  July, 1996.
  

• P. Agarwal and S. Sen.
  Selection in Monotone Matrices and computing k-th Nearest Neighbours.
  Journal of Algorithms.
  Vol. 20, pp. 581--601, June, 1996.
  

• N. Gupta and S. Sen.
  Faster Output-Sensitive Parallel Convex Hulls for $d leq 3$: Optimal Sublogarithmic Algorithms for Small Outputs.
  ACM SYmp. on Comput. Geometry.
  May, 1996.
  

• Sanjiva Prasad.
  Models Of Mobile Computing Agents.
  ACM Computing Surveys.
  28, No. 4, January, 1996.
  

• Naveen Garg and Vijay V. Vazirani and Mihalis Yannakakis.
  Approximate max-flow min-(multi)cut theorems and their applications..
  SIAM Journal on Computing .
  Vol. 25, No. 2, pp. 235-251, January, 1996.
  

• Huzur Saran , V. V. Vazirani , B. Sunder Rajan.
  An Efficient Algorithm For Constructing Minimal Trellises For Codes Over Finite Abelian Groups.
  IEEE Transactions On Information Theory.
  Vol. , , 1996.
  

• Sanjeev Kapoor.
  On Minimum 3-cuts And Approximating Graph Partitioning Using Cut Trees.
  International IPCO Conference.
  , , 1996.
  

• Sanjeev Kapoor , M. Smid.
  New Techniques For Exact And Approximate Dynamic Closest Point Problems.
  Siam Journal Of Computing.
  Vol. , , 1996.
  

• Sanjeev Kapoor , Tripurari Singh.
  Dynamically Maintaining Shortest Path Trees In Simple Polygons.
  Proc. Of FST And TCS India.
  , , 1996.
  

• Sanjeev Kapoor , G. Das , M. Smid.
  On The Complexity Of Approximating Travelling Salesman Problem Tours And Minimum Spanning Trees.
  Proc. Of FST And TCS India.
  , , 1996.
  

• Huzur Saran , V. V. Vazirani , B. Sunder Rajan.
  An Efficient Algorithm For Constructing Minimal Trellises For Codes Over Finite Abelian Groups.
  IEEE Transactions On Information Theory.
  Vol. , , 1996.
  

• Huzur Saran , V. V. Vazirani , B. Sunder Rajan.
  An Efficient Algorithm For Constructing Minimal Trellises For Codes Over Finite Abelian Groups.
  37th Annual IEEE Symposium On Foundations Of Computer Science.
  , , 1996.
  

• S. Sen.
  Fractional Cascading Revisited.
  Journal of Algorithms.
  Vol. 19, pp. 161 - 172, September, 1995.
  

• J. reif and S. Sen.
  An efficient output-sensitive hidden-surface removal algorithm for polyhedral terrains.
  Mathematical and Computer Modelling.
  Vol. 21, pp. 89 - 104, May, 1995.
  

• Naveen Garg and Vijay V. Vazirani.
  A polyhedron with all $s$--$t$ cuts as vertices, and adjacency of cuts..
  Mathematical Programming (A).
  Vol. 70, No. 1, pp. 17-25, January, 1995.
  

• Sanjeev Kapoor , H. Ramesh.
  Algorithms For Enumerating All Spanning Trees Of Directed Graphs.
  Algorithmica.
  Vol. , , 1995.
  

• Sanjeev Kapoor , H. Ramesh.
  Algorithms For Enumerating All Spanning Trees Of Undirected And Weighted Graphs.
  Siam Journal Of Computing.
  Vol. 24, No. 3, , 1995.
  

• Sanjeev Kapoor.
  Dynamically Maintaining Maxima In 2-dimensions.
  Siam Journal Of Computing.
  Vol. , , 1995.
  

• Sanjeev Kapoor , S. N. Maheshwari.
  Efficiently Constructing The Visibility Graph Of A Simple Polygon With Obstacles.
  Siam Journal Of Computing.
  Vol. , , 1995.
  

• Huzur Saran , V. V. Vazirani.
  Finding A K-cut Within Twice The Optimal.
  Siam Journal Of Computing.
  Vol. , pp. 101-108, , 1995.
  

• S. Sen.
  Lower bounds for parallel algebraic decision trees, complexity of convex hulls and related problems.
  FST & TCS.
  December, 1994.
  

• Naveen Garg and Huzur Saran and Vijay V. Vazirani.
  Finding separator cuts in planar graphs within twice the optimal..
  35th Annual IEEE Symposium on Foundations of Computer Science .
  pp. 14-23, November, 1994.
  

• Naveen Garg and Vijay V. Vazirani and Mihalis Yannakakis.
  Multiway cuts in directed and node weighted graphs..
  21st International Colloquium on Automata, Languages and Programming.
  pp. 487-498, July, 1994.
  

• P. Agarwal and S. Sen.
  Selection in Monotone Matrices and computing k-th Nearest Neighbours.
  SWAT.
  July, 1994.
  

• J. Reif and S. Sen.
  Random Sampling techniques for binary search on fixed connection networks with applications to geometric algorithms.
  SIAM Jnl on Computing.
  Vol. 23, pp. 633 - 651, June, 1994.
  

• Naveen Garg and Dorit S. Hochbaum.
  An O($log k$) approximation algorithm for the $k$ minimum spanning tree problem in the plane..
  26th Annual ACM Symposium on Theory of Computing.
  pp. 233-240, May, 1994.
  

• Sanjiva Prasad.
  The Positive Intutionistic Fragment Of LU.
  Technical Report ECRC.
  January, 1994.
  

• Sanjiva Prasad.
  Cut Elimination For LU With Mingle.
  Technical Report ECRC.
  January, 1994.
  

• Manica Aggarwal and Naveen Garg.
  A scaling technique for better network design.
  5th Annual ACM-SIAM Symposium on Discrete Algorithms.
  pp. 233-240, January, 1994.
  

• Sanjiva Prasad , R. M. Amadio.
  Localities And Failures.
  Proc. Of FST & TCS.
  pp. 205-216, January, 1994.
  

• Sanjiva Prasad.
  Towards A Formulae-as-types View Of Communicating Applicative Processes.
  Technical Report ECRC.
  January, 1994.
  

• Huzur Saran , H. Narayanan , V. V. Vazirani.
  Randomised Parallel Algorithms For Matroid Union.
  Siam Journal Of Computing.
  Vol. , pp. 387-397, , 1994.
  

• Sanjeev Kapoor , M. Smid.
  New Techniques For Exact And Approximate Dynamic Closest Point Problems.
  ACM Symposium On Computational Geometry.
  , , 1994.
  

• Sanjeev Kapoor.
  Dynamically Maintaining Maxima In 2-dimensions.
  ACM Symposium On Computational Geometry.
  , , 1994.
  

• Huzur Saran , V. Arora , V. Santosh , V. V. Vazirani.
  A Limited Backtrack Greedy Schema For Approximation Algorithms.
  14th Annual International Conference On Foundations Of Software Technology And Theoretical Computer Science.
  , , 1994.
  

• Huzur Saran , V. V. Vazirani , Naveen Garg.
  Finding Separator Cuts In Planar Graphs Within Twice The Optimal.
  35th Annual IEEE Symposium On Foundations Of Computer Science.
  , , 1994.
  

• Naveen Garg and Vijay V. Vazirani and Mihalis Yannakakis.
  Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover..
  20th International Colloquium on Automata, Languages and Programming.
  pp. 64-75, July, 1993.
  

• Naveen Garg and Vijay V. Vazirani.
  A polyhedron with all $s$--$t$ cuts as vertices, and adjacency of cuts..
  3rd Integer Programming and Combinatorial Optimization Conference.
  pp. 281-289, June, 1993.
  

• Y. Mansour, J. Park and B. Scheiber and S. Sen.
  rraysImproved Selection in Totally Monotone .
  Int'l Journal on Computational Geometry and Applications.
  Vol. 3, pp. 115 - 132, May, 1993.
  

• Naveen Garg and Vijay V. Vazirani and Mihalis Yannakakis.
  Approximate max-flow min-(multi)cut theorems and their applications..
  25th Annual ACM SYmposium on Theory of Computing..
  pp. 698-707, May, 1993.
  

• Naveen Garg and Aman Singla and Vempala S. Santosh.
  Improved approximation algorithms for biconnected subgraphs via better lower bounding techniques..
  4th Annual ACM-SIAM Symposium on Discrete Algorithms.
  pp. 103-111, January, 1993.
  

• K. Mulmuley and S. Sen.
  Dynamic point-location in arrangements of hyperplanes hyperplanes.
  Discrete and Computational Geometry.
  Vol. 8, October, 1992.
  

• S. Sen.
  Fractional Cascading Simplified.
  SWAT.
  July, 1992.
  

• J. Reif and S. Sen.
  Optimal parallel randomized algorithms for three-dimensional convex hulls and related problems.
  SIAM Jnl on Computing.
  Vol. 21, No. 2, pp. 466 - 485, June, 1992.
  

• J. Reif and S. Sen.
  Optimal randomized parallel algorithms for computational geometry.
  Algorithmica.
  Vol. 7, pp. 91 - 117, June, 1992.
  

• S. Rajasekaran and Sandeep Sen.
  On parallel integer sorting.
  Acta Informatica.
  Vol. 29, pp. 1 -15, January, 1992.
  

• Sanjiva Prasad.
  Verification Of Numerical Programs Using Penelope.
  Proc. Of Compass.
  January, 1992.
  

• Sanjeev Kapoor , V. Sarin.
  Algorithms For Relative Neighbourhood Graphs And Vornoi Diagrams In Simple Polygons.
  Canadian Conference On Computational Geometry.
  , , 1992.
  

• Huzur Saran , H. Narayanan , V. V. Vazirani.
  Randomised Parallel Algorithms For Matroid Union, Arboresences, And Edge-disjoint Spanning Trees.
  3rd Annual Symposium On Discrete Algorithms.
  , , 1992.
  

• Sandeep Sen.
  Some observations on Skip Lists.
  Information Processing Letters.
  Vol. 39, pp. 173 - 176, August, 1991.
  

• K. Mulmuley and S. Sen.
  Dynamic point-location in arrangements of hyperplanes.
  ACM Symp on Comput. Geometry.
  June, 1991.
  

• Y. Mansour, J. Park and B. Scheiber and S. Sen.
  Improved Selection in Totally Monotone Arrays.
  FST & TCS.
  January, 1991.
  

• Sanjeev Kapoor , H. Ramesh.
  On Enumerating All Spanning Trees Of Directed And Undirected Graphs.
  Workshop On Algorithms And Data Structures.
  , , 1991.
  

• Sanjeev Kapoor , E. M. Reingold.
  Stochastic Rearrangement Rules For Self-organizing Data Structures.
  Algorithmica.
  Vol. , No. 6, pp. 278-291, , 1991.
  

• Huzur Saran , V. V. Vazirani.
  Finding A K-cut Within Twice The Optimal.
  32nd Annual IEEE Symposium On Foundations Of Computer Science.
  , , 1991.
  

• S. Sen.
  Finding an approximate-median with high probability in constant parallel time.
  Information Processing Letters.
  Vol. 34, pp. 77 - 80, September, 1990.
  

• A. Aggarwal, D. Kravets, J. Park and S. Sen.
  Parallel searching in generalized Monge arrays with applications.
  ACM SPAA.
  July, 1990.
  

• J. Reif and S. Sen.
  Random Sampling techniques for binary search on fixed connection networks with applications to geometric algorithms.
  ACM SPAA.
  July, 1990.
  

• S.K. Gupta.
  A Coefficient of Similarity of Graphs and it's Application to Reconstruction Conjecture.
  International Conference on Combinatorics, China.
  January, 1990.
  

• Huzur Saran , R. Motwani , A. Raghunathan.
  Covering Orthogonal Polygons With Star Polygons.
  Journal Of Computer And System Sciences.
  Vol. , pp. 19-48, , 1990.
  

• Huzur Saran, Naveen Garg, V. V. Vazirani.
  Finding Separator Cuts In Planar Graphs Within Twice The Optimal.
  Siam Journal Of Computing.
  Vol. , , 1990.
  

• J. Reif and S. Sen.
  Polling: A new randomized sampling method for computational geometry.
  ACM STOC.
  May, 1989.
  

• I. Scherson and S. Sen.
  Parallel Sorting in Two dimensional VLSI models of Computation.
  IEEE Transaction on Computers.
  Vol. 00, pp. 238 - 249, February, 1989.
  

• I. Scherson, Y. Ma and S. Sen.
  Two Optimal algorithms for mesh using shear sort.
  Journal of Parallel and Distributed Computing.
  Vol. 6, pp. 151 - 165, February, 1989.