| 2026 | ICALP | An (n | Sanjeev Khanna, Aaron Putterman, Junkai Song |
| 2026 | ICALP | Optimal Parallel Basis Finding in Graphic and Related Matroids. | Sanjeev Khanna, Aaron Putterman, Junkai Song |
| 2026 | SODA | Sparse Navigable Graphs for Nearest Neighbor Search: Algorithms and Hardness. | Sanjeev Khanna, Ashwin Padaki, Erik Waingarten |
| 2026 | STOC | A Faster Deterministic Algorithm for Fully Dynamic Maximal Matching. | Julia Chuzhoy, Sanjeev Khanna, Junkai Song |
| 2025 | FOCS | Stochastic Knapsack without Relaxing the Capacity. | Anindya De, Sanjeev Khanna, Nathan White |
| 2025 | FOCS | On the Parallel Complexity of Finding a Matroid Basis. | Sanjeev Khanna, Aaron Putterman, Junkai Song |
| 2025 | FOCS | A Polynomial Space Lower Bound for Diameter Estimation in Dynamic Streams. | Sanjeev Khanna, Ashwin Padaki, Krish Singal, Erik Waingarten |
| 2025 | ICALP | Improved Approximation Algorithms for Capacitated Network Design and Flexible Graph Connectivity. | Ishan Bansal, Joe Cheriyan, Sanjeev Khanna, Miles Simmons |
| 2025 | ICALP | Streaming Maximal Matching with Bounded Deletions. | Sanjeev Khanna, Christian Konrad, Jacques Dark |
| 2025 | ICALP | A Theory of Spectral CSP Sparsification. | Sanjeev Khanna, Aaron Putterman, Madhu Sudan |
| 2025 | ICALP | Near-Optimal Hypergraph Sparsification in Insertion-Only and Bounded-Deletion Streams. | Sanjeev Khanna, Aaron Putterman, Madhu Sudan |
| 2025 | SODA | Improved Bounds for Fully Dynamic Matching via Ordered Ruzsa-Szemerdi Graphs. | Sepehr Assadi, Sanjeev Khanna, Peter Kiss |
| 2025 | STOC | Correlation Clustering and (De)Sparsification: Graph Sketches Can Match Classical Algorithms. | Sepehr Assadi, Sanjeev Khanna, Aaron Putterman |
| 2025 | STOC | Near-Optimal Linear Sketches and Fully-Dynamic Algorithms for Hypergraph Spectral Sparsification. | Sanjeev Khanna, Huan Li, Aaron Putterman |
| 2025 | STOC | Efficient Algorithms and New Characterizations for CSP Sparsification. | Sanjeev Khanna, Aaron Putterman, Madhu Sudan |
| 2024 | FOCS | Near-Optimal Size Linear Sketches for Hypergraph Cut Sparsifiers. | Sanjeev Khanna, Aaron Putterman, Madhu Sudan |
| 2024 | ICALP | Almost-Tight Bounds on Preserving Cuts in Classes of Submodular Hypergraphs. | Sanjeev Khanna, Aaron (Louie) Putterman, Madhu Sudan |
| 2024 | SODA | Parallel Approximate Maximum Flows in Near-Linear Work and Polylogarithmic Depth. | Arpit Agarwal, Sanjeev Khanna, Huan Li, Prathamesh Patil, Chen Wang, Nathan White, Peilin Zhong |
| 2024 | SODA | A Faster Combinatorial Algorithm for Maximum Bipartite Matching. | Julia Chuzhoy, Sanjeev Khanna |
| 2024 | SODA | Code Sparsification and its Applications. | Sanjeev Khanna, Aaron (Louie) Putterman, Madhu Sudan |
| 2024 | STOC | Maximum Bipartite Matching in n | Julia Chuzhoy, Sanjeev Khanna |
| 2023 | ICALP | Sublinear Algorithms and Lower Bounds for Estimating MST and TSP Cost in General Metrics. | Yu Chen, Sanjeev Khanna, Zihan Tan |
| 2023 | PODS | Set Cover in the One-pass Edge-arrival Streaming Model. | Sanjeev Khanna, Christian Konrad, Cezar-Mihail Alexandru |
| 2023 | SODA | Query Complexity of the Metric Steiner Tree Problem. | Yu Chen, Sanjeev Khanna, Zihan Tan |
| 2023 | STOC | On Regularity Lemma and Barriers in Streaming and Dynamic Matching. | Sepehr Assadi, Soheil Behnezhad, Sanjeev Khanna, Huan Li |
| 2022 | AISTATS | PAC Top-k Identification under SST in Limited Rounds. | Arpit Agarwal, Sanjeev Khanna, Prathamesh Patil |
| 2022 | COLT | A Sharp Memory-Regret Trade-off for Multi-Pass Streaming Bandits. | Arpit Agarwal, Sanjeev Khanna, Prathamesh Patil |
| 2022 | FOCS | On Weighted Graph Sparsification by Linear Sketching. | Yu Chen, Sanjeev Khanna, Huan Li |
| 2022 | SODA | New Trade-Offs for Fully Dynamic Matching via Hierarchical EDCS. | Soheil Behnezhad, Sanjeev Khanna |
| 2021 | ESA | Graph Connectivity and Single Element Recovery via Linear and OR Queries. | Sepehr Assadi, Deeparnab Chakrabarty, Sanjeev Khanna |
| 2021 | FOCS | A Polynomial Lower Bound on the Number of Rounds for Parallel Submodular Function Minimization. | Deeparnab Chakrabarty, Yu Chen, Sanjeev Khanna |
| 2021 | ICALP | Sublinear Time Hypergraph Sparsification via Cut and Edge Sampling Queries. | Yu Chen, Sanjeev Khanna, Ansh Nagda |
| 2021 | SODA | Hardness of Approximation for Orienteering with Multiple Time Windows. | Naveen Garg, Sanjeev Khanna, Amit Kumar |
| 2020 | FOCS | Near-linear Size Hypergraph Cut Sparsifiers. | Yu Chen, Sanjeev Khanna, Ansh Nagda |
| 2020 | ICALP | Sublinear Algorithms and Lower Bounds for Metric TSP Cost Estimation. | Yu Chen, Sampath Kannan, Sanjeev Khanna |
| 2020 | ICALP | An Efficient PTAS for Stochastic Load Balancing with Poisson Jobs. | Anindya De, Sanjeev Khanna, Huan Li, Hesam Nikpey |
| 2020 | ICML | Rank Aggregation from Pairwise Comparisons in the Presence of Adversarial Corruptions. | Arpit Agarwal, Shivani Agarwal, Sanjeev Khanna, Prathamesh Patil |
| 2020 | LICS | Space-efficient Query Evaluation over Probabilistic Event Streams. | Rajeev Alur, Yu Chen, Kishor Jothimurugan, Sanjeev Khanna |
| 2020 | WWW | Near-Perfect Recovery in the One-Dimensional Latent Space Model. | Yu Chen, Sampath Kannan, Sanjeev Khanna |
| 2019 | IJCAI | Network Formation under Random Attack and Probabilistic Spread. | Yu Chen, Shahin Jabbari, Michael J. Kearns, Sanjeev Khanna, Jamie Morgenstern |
| 2019 | SODA | Stochastic Submodular Cover with Limited Adaptivity. | Arpit Agarwal, Sepehr Assadi, Sanjeev Khanna |
| 2019 | SODA | Sublinear Algorithms for (Δ + 1) Vertex Coloring. | Sepehr Assadi, Yu Chen, Sanjeev Khanna |
| 2019 | STOC | Polynomial pass lower bounds for graph streaming algorithms. | Sepehr Assadi, Yu Chen, Sanjeev Khanna |
| 2019 | STOC | A new algorithm for decremental single-source shortest paths with applications to vertex-capacitated flow and cut problems. | Julia Chuzhoy, Sanjeev Khanna |
| 2018 | FOCS | Testing Graph Clusterability: Algorithms and Lower Bounds. | Ashish Chiplunkar, Michael Kapralov, Sanjeev Khanna, Aida Mousavifar, Yuval Peres |
| 2018 | SODA | A Faster Algorithm for Minimum-Cost Bipartite Perfect Matching in Planar Graphs. | Mudabir Kabir Asathulla, Sanjeev Khanna, Nathaniel Lahn, Sharath Raghvendra |
| 2018 | SODA | Tight Bounds on the Round Complexity of the Distributed Maximum Coverage Problem. | Sepehr Assadi, Sanjeev Khanna |
| 2018 | SODA | Better and Simpler Error Analysis of the Sinkhorn-Knopp Algorithm for Matrix Scaling. | Deeparnab Chakrabarty, Sanjeev Khanna |
| 2017 | COLT | Learning with Limited Rounds of Adaptivity: Coin Tossing, Multi-Armed Bandits, and Ranking from Pairwise Comparisons. | Arpit Agarwal, Shivani Agarwal, Sepehr Assadi, Sanjeev Khanna |
| 2017 | PLDI | StreamQRE: modular specification and efficient evaluation of quantitative queries over streaming data. | Konstantinos Mamouras, Mukund Raghothaman, Rajeev Alur, Zachary G. Ives, Sanjeev Khanna |
| 2017 | SODA | On Estimating Maximum Matching Size in Graph Streams. | Sepehr Assadi, Sanjeev Khanna, Yang Li |
| 2017 | SODA | (1 + Ω(1))-Αpproximation to MAX-CUT Requires Linear Space. | Michael Kapralov, Sanjeev Khanna, Madhu Sudan, Ameya Velingker |
| 2017 | SPAA | Randomized Composable Coresets for Matching and Vertex Cover. | Sepehr Assadi, Sanjeev Khanna |
| 2016 | ICDT | Algorithms for Provisioning Queries and Analytics. | Sepehr Assadi, Sanjeev Khanna, Yang Li, Val Tannen |
| 2016 | INFOCOM | Rapid convergence versus policy expressiveness in interdomain routing. | Alexander J. T. Gurney, Sanjeev Khanna, Yang Li |
| 2016 | SODA | Maximum Matchings in Dynamic Graph Streams and the Simultaneous Communication Model. | Sepehr Assadi, Sanjeev Khanna, Yang Li, Grigory Yaroslavtsev |
| 2016 | STOC | Tight bounds for single-pass streaming complexity of the set cover problem. | Sepehr Assadi, Sanjeev Khanna, Yang Li |
| 2015 | ICRA | On embeddability of modular robot designs. | Yannis Mantzouratos, Tarik Tosun, Sanjeev Khanna, Mark Yim |
| 2015 | SODA | On (1, | Deeparnab Chakrabarty, Sanjeev Khanna, Shi Li |
| 2015 | SODA | Connectivity in Random Forests and Credit Networks. | Ashish Goel, Sanjeev Khanna, Sharath Raghvendra, Hongyang Zhang |
| 2015 | SODA | Streaming Lower Bounds for Approximating MAX-CUT. | Michael Kapralov, Sanjeev Khanna, Madhu Sudan |
| 2014 | IPCO | A Utility Equivalence Theorem for Concave Functions. | Anand Bhalgat, Sanjeev Khanna |
| 2014 | LATA | Matchings, Random Walks, and Sampling. | Sanjeev Khanna |
| 2014 | SODA | Disjoint Set Union with Randomized Linking. | Ashish Goel, Sanjeev Khanna, Daniel H. Larkin, Robert Endre Tarjan |
| 2014 | SODA | Approximating matching size from random streams. | Michael Kapralov, Sanjeev Khanna, Madhu Sudan |
| 2014 | SODA | Influence Maximization in Undirected Networks. | Sanjeev Khanna, Brendan Lucier |
| 2013 | CIAC | A Greedy Approximation Algorithm for Minimum-Gap Scheduling. | Marek Chrobak, Uriel Feige, Mohammad Taghi Hajiaghayi, Sanjeev Khanna, Fei Li, Seffi Naor |
| 2013 | ICDT | Using the crowd for top-k and group-by queries. | Susan B. Davidson, Sanjeev Khanna, Tova Milo, Sudeepa Roy |
| 2013 | WAW | On the Power of Adversarial Infections in Networks. | Michael Brautbar, Moez Draief, Sanjeev Khanna |
| 2012 | ICALP | Distributed Private Heavy Hitters. | Justin Hsu, Sanjeev Khanna, Aaron Roth |
| 2012 | SODA | On the communication and streaming complexity of maximum bipartite matching. | Ashish Goel, Michael Kapralov, Sanjeev Khanna |
| 2011 | CIDR | Enabling Privacy in Provenance-Aware Workflow Systems. | Susan B. Davidson, Sanjeev Khanna, Val Tannen, Sudeepa Roy, Yi Chen, Tova Milo, Julia Stoyanovich |
| 2011 | FOCS | Algorithms for the Generalized Sorting Problem. | Zhiyi Huang, Sampath Kannan, Sanjeev Khanna |
| 2011 | FOCS | Delays and the Capacity of Continuous-Time Channels. | Sanjeev Khanna, Madhu Sudan |
| 2011 | ICDT | On provenance and privacy. | Susan B. Davidson, Sanjeev Khanna, Sudeepa Roy, Julia Stoyanovich, Val Tannen, Yi Chen |
| 2011 | IPCO | Approximability of Capacitated Network Design. | Deeparnab Chakrabarty, Chandra Chekuri, Sanjeev Khanna, Nitish Korula |
| 2011 | PODS | Provenance views for module privacy. | Susan B. Davidson, Sanjeev Khanna, Tova Milo, Debmalya Panigrahi, Sudeepa Roy |
| 2011 | SODA | Improved Approximation Results for Stochastic Knapsack Problems. | Anand Bhalgat, Ashish Goel, Sanjeev Khanna |
| 2010 | SIGMOD | An optimal labeling scheme for workflow provenance using skeleton labels. | Zhuowei Bao, Susan B. Davidson, Sanjeev Khanna, Sudeepa Roy |
| 2010 | STOC | Perfect matchings in o( | Ashish Goel, Michael Kapralov, Sanjeev Khanna |
| 2009 | FOCS | On Allocating Goods to Maximize Fairness. | Deeparnab Chakrabarty, Julia Chuzhoy, Sanjeev Khanna |
| 2009 | FOCS | Dynamic and Non-uniform Pricing Strategies for Revenue Maximization. | Tanmoy Chakraborty, Zhiyi Huang, Sanjeev Khanna |
| 2009 | FOCS | An O(k^3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design. | Julia Chuzhoy, Sanjeev Khanna |
| 2009 | ICDE | Differencing Provenance in Scientific Workflows. | Zhuowei Bao, Sarah Cohen Boulakia, Susan B. Davidson, Anat Eyal, Sanjeev Khanna |
| 2009 | ICDT | Optimizing user views for workflows. | Olivier Biton, Susan B. Davidson, Sanjeev Khanna, Sudeepa Roy |
| 2009 | SODA | Perfect matchings via uniform sampling in regular bipartite graphs. | Ashish Goel, Michael Kapralov, Sanjeev Khanna |
| 2009 | SODA | The ratio index for budgeted learning, with applications. | Ashish Goel, Sanjeev Khanna, Brad Null |
| 2009 | SAGT | Nash Dynamics in Constant Player and Bounded Jump Congestion Games. | Tanmoy Chakraborty, Sanjeev Khanna |
| 2009 | SCA | Automatic construction of a minimum size motion graph. | Liming Zhao, Aline Normoyle, Sanjeev Khanna, Alla Safonova |
| 2008 | DNA | Robust Self-assembly of Graphs. | Stanislav Angelov, Sanjeev Khanna, Mirk Visontai |
| 2008 | FOCS | Algorithms for Single-Source Vertex Connectivity. | Julia Chuzhoy, Sanjeev Khanna |
| 2008 | ICALP | Algorithms for 2-Route Cut Problems. | Chandra Chekuri, Sanjeev Khanna |
| 2008 | INFOCOM | Adaptive SelectiveVerification. | Sanjeev Khanna, Santosh S. Venkatesh, Omid Fatemieh, Fariba Khan, Carl A. Gunter |
| 2008 | STOC | Network design for vertex connectivity. | Tanmoy Chakraborty, Julia Chuzhoy, Sanjeev Khanna |
| 2007 | STOC | Hardness of routing with congestion in directed graphs. | Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khanna, Kunal Talwar |
| 2007 | STOC | Polynomial flow-cut gaps and hardness of directed cut problems. | Julia Chuzhoy, Sanjeev Khanna |
| 2006 | DNA | On the Complexity of Graph Self-assembly in Accretive Systems. | Stanislav Angelov, Sanjeev Khanna, Mirk Visontai |
| 2006 | RECOMB | Efficient Enumeration of Phylogenetically Informative Substrings. | Stanislav Angelov, Boulos Harb, Sampath Kannan, Sanjeev Khanna, Junhyong Kim |
| 2006 | STOC | Edge-disjoint paths in Planar graphs with constant congestion. | Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd |
| 2006 | STOC | Hardness of cut problems in directed graphs. | Julia Chuzhoy, Sanjeev Khanna |
| 2005 | FOCS | Hardness of the Undirected Edge-Disjoint Paths Problem with Congestion. | Matthew Andrews, Julia Chuzhoy, Sanjeev Khanna, Lisa Zhang |
| 2005 | SODA | Approximating the average response time in broadcast scheduling. | Nikhil Bansal, Moses Charikar, Sanjeev Khanna, Joseph Naor |
| 2005 | STOC | Multicommodity flow, well-linked terminals, and routing problems. | Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd |
| 2004 | FOCS | Edge-Disjoint Paths in Planar Graphs. | Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd |
| 2004 | FOCS | Machine Minimization for Scheduling Jobs with Interval Constraints. | Julia Chuzhoy, Sudipto Guha, Sanjeev Khanna, Joseph Naor |
| 2004 | ICALP | Approximating Longest Directed Paths and Cycles. | Andreas Bjrklund, Thore Husfeldt, Sanjeev Khanna |
| 2004 | NDSS | DoS Protection for Reliably Authenticated Broadcast. | Carl A. Gunter, Sanjeev Khanna, Kaijun Tan, Santosh S. Venkatesh |
| 2004 | PODS | Power-Conserving Computation of Order-Statistics over Sensor Networks. | Michael Greenwald, Sanjeev Khanna |
| 2004 | SODA | Reconstructing strings from random traces. | Tugkan Batu, Sampath Kannan, Sanjeev Khanna, Andrew McGregor |
| 2004 | SODA | Randomized pursuit-evasion with limited visibility. | Volkan Isler, Sampath Kannan, Sanjeev Khanna |
| 2004 | STOC | Multi-processor scheduling to minimize flow time with epsilon resource augmentation. | Chandra Chekuri, Ashish Goel, Sanjeev Khanna, Amit Kumar |
| 2004 | STOC | The all-or-nothing multicommodity flow problem. | Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd |
| 2004 | STOC | Asymmetric k-center is log | Julia Chuzhoy, Sudipto Guha, Eran Halperin, Sanjeev Khanna, Guy Kortsarz, Joseph Naor |
| 2004 | WABI | Genome Identification and Classification by Short Oligo Arrays. | Stanislav Angelov, Boulos Harb, Sampath Kannan, Sanjeev Khanna, Junhyong Kim, Li-San Wang |
| 2004 | WABI | ATDD: An Algorithmic Tool for Domain Discovery in Protein Sequences. | Stanislav Angelov, Sanjeev Khanna, Li Li, Fernando Pereira |
| 2004 | WAFR | Locating and Capturing an Evader in a Polygonal Environment. | Volkan Isler, Sampath Kannan, Sanjeev Khanna |
| 2003 | IROS | Target tracking with distributed sensors: the focus of attention problem. | Volkan Isler, John R. Spletzer, Sanjeev Khanna, Camillo J. Taylor |
| 2003 | SODA | Edge disjoint paths revisited. | Chandra Chekuri, Sanjeev Khanna |
| 2003 | SODA | Selection with monotone comparison cost. | Sampath Kannan, Sanjeev Khanna |
| 2002 | ICALP | Control Message Aggregation in Group Communication Protocols. | Sanjeev Khanna, Joseph Naor, Danny Raz |
| 2002 | PODS | On Propagation of Deletions and Annotations Through Views. | Peter Buneman, Sanjeev Khanna, Wang Chiew Tan |
| 2002 | SIGMOD | Archiving scientific data. | Peter Buneman, Sanjeev Khanna, Keishi Tajima, Wang Chiew Tan |
| 2002 | STOC | Approximation schemes for preemptive weighted flow time. | Chandra Chekuri, Sanjeev Khanna |
| 2001 | ICALP | A PTAS for Minimizing Weighted Completion Time on Uniformly Related Machines. | Chandra Chekuri, Sanjeev Khanna |
| 2001 | ICDT | Why and Where: A Characterization of Data Provenance. | Peter Buneman, Sanjeev Khanna, Wang Chiew Tan |
| 2001 | PODS | On Computing Functions with Uncertainty. | Sanjeev Khanna, Wang Chiew Tan |
| 2001 | SIGMOD | Space-Efficient Online Computation of Quantile Summaries. | Michael Greenwald, Sanjeev Khanna |
| 2001 | SODA | A deterministic algorithm for the cost-distance problem. | Chandra Chekuri, Sanjeev Khanna, Joseph Naor |
| 2001 | SODA | Approximation algorithms for the metric labeling problem via a new linear programming formulation. | Chandra Chekuri, Sanjeev Khanna, Joseph Naor, Leonid Zosin |
| 2001 | STOC | Algorithms for minimizing weighted flow time. | Chandra Chekuri, Sanjeev Khanna, An Zhu |
| 2001 | RTSS | Fair Real-Time Traffic Scheduling over a Wireless LA. | Maria Adamou, Sanjeev Khanna, Insup Lee, Insik Shin, Shiyu Zhou |
| 2000 | SODA | A PTAS for the multiple knapsack problem. | Chandra Chekuri, Sanjeev Khanna |
| 2000 | SODA | Approximation algorithms for data placement on parallel disks. | Leana Golubchik, Sanjeev Khanna, Samir Khuller, Ramakrishna Thurimella, An Zhu |
| 2000 | SODA | Directed network design with orientation constraints. | Sanjeev Khanna, Joseph Naor, F. Bruce Shepherd |
| 2000 | SODA | Watermarking maps: hiding information in structured data. | Sanjeev Khanna, Francis Zane |
| 1999 | FOCS | Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates. | Foto N. Afrati, Evripidis Bampis, Chandra Chekuri, David R. Karger, Claire Kenyon, Sanjeev Khanna, Ioannis Milis, Maurice Queyranne, Martin Skutella, Clifford Stein, Maxim Sviridenko |
| 1999 | ICALP | Space Time Tradeoffs for Graph Properties. | Yevgeniy Dodis, Sanjeev Khanna |
| 1999 | INFOCOM | Integrated Scheduling of Unicast and Multicast Traffic in an Input-Queued Switch. | Matthew Andrews, Sanjeev Khanna, Krishnan Kumaran |
| 1999 | SODA | Page Replacement for General Caching Problems. | Susanne Albers, Sanjeev Arora, Sanjeev Khanna |
| 1999 | SODA | On Multi-Dimensional Packing Problems. | Chandra Chekuri, Sanjeev Khanna |
| 1999 | SODA | The 2-Catalog Segmentation Problem. | Yevgeniy Dodis, Venkatesan Guruswami, Sanjeev Khanna |
| 1999 | STOC | Design Networks with Bounded Pairwise Distance. | Yevgeniy Dodis, Sanjeev Khanna |
| 1999 | STOC | Near-Optimal Hardness Results and Approximation Algorithms for Edge-Disjoint Paths and Related Problems. | Venkatesan Guruswami, Sanjeev Khanna, Rajmohan Rajaraman, F. Bruce Shepherd, Mihalis Yannakakis |
| 1999 | SPAA | Time-Constrained Scheduling of Weighted Packets on Trees and Meshes. | Micah Adler, Sanjeev Khanna, Rajmohan Rajaraman, Adi Rosn |
| 1998 | INFOCOM | On Wireless Spectrum Estimation and Generalized Graph Coloring. | Krishnan Kumaran, Sanjeev Khanna |
| 1998 | SODA | On Approximating Rectangle Tiling and Packing. | Sanjeev Khanna, S. Muthukrishnan, Mike Paterson |
| 1998 | STOC | On Broadcast Disk Paging. | Sanjeev Khanna, Vincenzo Liberatore |
| 1998 | STOC | On Indexed Data Broadcast. | Sanjeev Khanna, Shiyu Zhou |
| 1997 | ICALP | Efficient Array Partitioning. | Sanjeev Khanna, S. Muthukrishnan, Steven Skiena |
| 1997 | SODA | The Angular-Metric Traveling Salesman Problem. | Alok Aggarwal, Don Coppersmith, Sanjeev Khanna, Rajeev Motwani, Baruch Schieber |
| 1997 | STOC | A Complete Classification of the Approximability of Maximization Problems Derived from Boolean Constraint Satisfaction. | Sanjeev Khanna, Madhu Sudan, David P. Williamson |
| 1996 | SODA | On Certificates and Lookahead in Dynamic Graph Problems. | Sanjeev Khanna, Rajeev Motwani, Randall H. Wilson |
| 1996 | STOC | Towards a Syntactic Characterization of PTAS. | Sanjeev Khanna, Rajeev Motwani |
| 1994 | FOCS | On Syntactic versus Computational Views of Approximability | Sanjeev Khanna, Rajeev Motwani, Madhu Sudan, Umesh V. Vazirani |
| 1992 | ICCI | Concurrent Use of Parallel Communication to Enable Remote Visualization. | Kurt Maly, Frank Paterra, C. Michael Overstreet, Ravi Mukkamala, Sanjeev Khanna |
| 1990 | ICCI | Logic Programming for Software Testing. | Sanjeev Khanna |