| Year |
Citation |
Score |
| 2020 |
Asathulla MK, Khanna S, Lahn N, Raghvendra S. A Faster Algorithm for Minimum-cost Bipartite Perfect Matching in Planar Graphs Acm Transactions On Algorithms. 16: 1-30. DOI: 10.1145/3365006 |
0.455 |
|
| 2019 |
Assadi S, Khanna S, Li Y. Tight Bounds for Single-Pass Streaming Complexity of the Set Cover Problem Siam Journal On Computing. DOI: 10.1137/16M1095482 |
0.412 |
|
| 2018 |
Goel A, Kapralov M, Khanna S. Perfect Matchings in Õ (n1.5) Time in Regular Bipartite Graphs Combinatorica. 39: 323-354. DOI: 10.1007/S00493-015-2653-6 |
0.455 |
|
| 2017 |
Chrobak M, Feige U, Hajiaghayi MT, Khanna S, Li F, Naor S. A greedy approximation algorithm for minimum-gap scheduling Journal of Scheduling. 20: 279-292. DOI: 10.1007/S10951-016-0492-Y |
0.399 |
|
| 2016 |
Assadi S, Khanna S, Li Y, Yaroslavtsev G. Maximum matchings in dynamic graph streams and the simultaneous communication model Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 2: 1345-1364. |
0.36 |
|
| 2015 |
Assadi S, Khanna S, Li Y, Preciado VM. Complexity of the minimum input selection problem for structural controllability Ifac Proceedings Volumes (Ifac-Papersonline). 48: 70-75. DOI: 10.1016/J.Ifacol.2015.10.309 |
0.451 |
|
| 2015 |
Starlinger J, Cohen-Boulakia S, Khanna S, Davidson SB, Leser U. Effective and efficient similarity search in scientific workflow repositories Future Generation Computer Systems. DOI: 10.1016/J.Future.2015.06.012 |
0.335 |
|
| 2015 |
Chakrabarty D, Chekuri C, Khanna S, Korula N. Approximability of Capacitated Network Design Algorithmica. 72: 493-514. DOI: 10.1007/S00453-013-9862-4 |
0.491 |
|
| 2013 |
Goel A, Kapralov M, Khanna S. Perfect Matchings in $O(n\log n)$ Time in Regular Bipartite Graphs Siam Journal On Computing. 42: 1392-1404. DOI: 10.1137/100812513 |
0.473 |
|
| 2013 |
Chekur C, Khanna S, Shepherd FB. The all-or-nothing multicommod ity flow problem Siam Journal On Computing. 42: 1467-1493. DOI: 10.1137/100796820 |
0.49 |
|
| 2012 |
Chuzhoy J, Khanna S. An $O(k^3\log n)$-Approximation Algorithm for Vertex-Connectivity Survivable Network Design Theory of Computing. 8: 401-413. DOI: 10.4086/Toc.2012.V008A018 |
0.417 |
|
| 2010 |
Goel A, Kapralov M, Khanna S. Perfect matchings via uniform sampling in regular bipartite graphs Acm Transactions On Algorithms. 6: 27. DOI: 10.1145/1721837.1721843 |
0.488 |
|
| 2010 |
Andrews M, Chuzhoy J, Guruswami V, Khanna S, Talwar K, Zhang L. Inapproximability of Edge-Disjoint Paths and Low Congestion Routing on Undirected Graphs Combinatorica. 30: 485-520. DOI: 10.1007/S00493-010-2455-9 |
0.426 |
|
| 2009 |
Chuzhoy J, Khanna S. Polynomial flow-cut gaps and hardness of directed cut problems Journal of the Acm. 56. DOI: 10.1145/1502793.1502795 |
0.456 |
|
| 2009 |
Chekuri C, Khanna S, Shepherd FB. Edge-disjoint paths in planar graphs with constant congestion Siam Journal On Computing. 39: 281-301. DOI: 10.1137/060674442 |
0.47 |
|
| 2009 |
Angelov S, Khanna S, Kunal K. The Network as a Storage Device: Dynamic Routing with Bounded Buffers Algorithmica. 55: 71-94. DOI: 10.1007/S00453-007-9143-1 |
0.657 |
|
| 2009 |
Chekuri C, Khanna S, Shepherd FB. A Note on Multiflows and Treewidth Algorithmica (New York). 54: 400-412. DOI: 10.1007/S00453-007-9129-Z |
0.483 |
|
| 2008 |
Angelov S, Khanna S, Visontai M. On the complexity of graph self-assembly in accretive systems Natural Computing. 7: 183-201. DOI: 10.1007/S11047-007-9048-6 |
0.658 |
|
| 2007 |
Angelov S, Harb B, Kannan S, Khanna S, Kim J. Efficient enumeration of phylogenetically informative substrings. Journal of Computational Biology : a Journal of Computational Molecular Cell Biology. 14: 701-23. PMID 17691889 DOI: 10.1089/Cmb.2007.R011 |
0.654 |
|
| 2007 |
Chekuri C, Khanna S. Edge-disjoint paths revisited Acm Transactions On Algorithms. 3. DOI: 10.1145/1290672.1290683 |
0.523 |
|
| 2006 |
Chekuri C, Khanna S, Shepherd FB. An O(√n) Approximation and Integrality Gap for Disjoint Paths and Unsplittable Flow Theory of Computing. 2: 137-146. DOI: 10.4086/Toc.2006.V002A007 |
0.488 |
|
| 2006 |
Isler V, Kannan S, Khanna S. Randomized pursuit-evasion with local visibility Siam Journal On Discrete Mathematics. 20: 26-41. DOI: 10.1137/S0895480104442169 |
0.45 |
|
| 2005 |
Chuzhoy J, Guha S, Halperin E, Khanna S, Kortsarz G, Krauthgamer R, Naor J. Asymmetric K-center Is log* H-hard to approximate Journal of the Acm. 52: 538-551. DOI: 10.1145/1082036.1082038 |
0.39 |
|
| 2005 |
Khanna S, Naor J, Shepherd FB. Directed network design with orientation constraints Siam Journal On Discrete Mathematics. 19: 245-257. DOI: 10.1137/S0895480100380112 |
0.466 |
|
| 2005 |
Chekuri C, Khanna S. A polynomial time approximation scheme for the multiple knapsack problem Siam Journal On Computing. 35: 713-728. DOI: 10.1137/S0097539700382820 |
0.415 |
|
| 2005 |
Isler V, Kannan S, Khanna S. Randomized pursuit-evasion in a polygonal environment Ieee Transactions On Robotics. 21: 875-884. DOI: 10.1109/Tro.2005.851373 |
0.391 |
|
| 2005 |
Isler V, Khanna S, Spletzer J, Taylor CJ. Target tracking with distributed sensors: The focus of attention problem Computer Vision and Image Understanding. 100: 225-247. DOI: 10.1016/J.Cviu.2004.10.008 |
0.354 |
|
| 2004 |
Chekuri C, Khanna S, Naor J, Zosin L. A linear programming formulation and approximation algorithms for the metric labeling problem Siam Journal On Discrete Mathematics. 18: 608-625. DOI: 10.1137/S0895480101396937 |
0.416 |
|
| 2004 |
Guruswami V, Khanna S. On the hardness of 4-coloring a 3-colorable graph Siam Journal On Discrete Mathematics. 18: 30-40. DOI: 10.1137/S0895480100376794 |
0.454 |
|
| 2004 |
Chekuri C, Khanna S. On multidimensional packing problems Siam Journal On Computing. 33: 837-851. DOI: 10.1137/S0097539799356265 |
0.367 |
|
| 2003 |
Khanna S, Sarkar S, Shin I. An energy measurement based collision resolution protocol Teletraffic Science and Engineering. 5: 951-960. DOI: 10.1016/S1388-3437(03)80244-5 |
0.314 |
|
| 2003 |
Guruswami V, Khanna S, Rajaraman R, Shepherd B, Yannakakis M. Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems Journal of Computer and System Sciences. 67: 473-496. DOI: 10.1016/S0022-0000(03)00066-7 |
0.506 |
|
| 2003 |
Adler M, Khanna S, Rajaraman R, Rosén A. Time-Constrained Scheduling of Weighted Packets on Trees and Meshes Algorithmica. 36: 123-152. DOI: 10.1007/S00453-002-1019-9 |
0.49 |
|
| 2002 |
Buneman P, Khanna S, Tajima K, Tan WC. Archiving scientific data Proceedings of the Acm Sigmod International Conference On Management of Data. 1-12. DOI: 10.1145/974750.974752 |
0.416 |
|
| 2001 |
Khanna S, Sudan M, Trevisan L, Williamson DP. The Approximability of Constraint Satisfaction Problems Siam Journal On Computing. 30: 1863-1920. DOI: 10.1137/S0097539799349948 |
0.361 |
|
| 2000 |
Golubchik L, Khanna S, Khuller S, Thurimella R, Zhu A. Approximation algorithms for data placement on parallel disks Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 223-232. DOI: 10.1145/1597036.1597037 |
0.402 |
|
| 2000 |
Khanna S, Liberatore V. On broadcast disk paging Siam Journal On Computing. 29: 1683-1702. DOI: 10.1137/S0097539798341399 |
0.425 |
|
| 1999 |
Aggarwal A, Coppersmith D, Khanna S, Motwani R, Schieber B. The Angular-Metric Traveling Salesman Problem Siam Journal On Computing. 29: 697-711. DOI: 10.1137/S0097539796312721 |
0.422 |
|
| 1999 |
Khanna S, Motwani R, Sudan M, Vazirani U. On Syntactic versus Computational Views of Approximability Siam Journal On Computing. 28: 164-191. DOI: 10.1137/S0097539795286612 |
0.388 |
|
| 1998 |
Khanna S, Motwani R, Wilson RH. On Certificates and Lookahead in Dynamic Graph Problems Algorithmica. 21: 377-394. DOI: 10.1007/Pl00009220 |
0.481 |
|
| 1997 |
Khanna S, Fuchs WK. A graph partitioning approach to sequential diagnosis Ieee Transactions On Computers. 46: 39-47. DOI: 10.1109/12.559801 |
0.519 |
|
| 1997 |
Khanna S. A polynomial time approximation scheme for the SONET ring loading problem Bell Labs Technical Journal. 2: 36-41. DOI: 10.1002/Bltj.2047 |
0.45 |
|
| Show low-probability matches. |