☰

Sanjeev Khanna

Affiliations: 
Computer and Information Science University of Pennsylvania, Philadelphia, PA, United States 
Area:
Information Management: Databases and Data Management, Theory: Algorithms and Complexity
Google:
"Sanjeev Khanna"
Tree Publications Similar researchers PubMed Report error

Parents

Sign in to add mentor

Children

Sign in to add trainee
Wang-Chiew Tan grad student 2002 Penn
Stanislav P. Angelov grad student 2007 Penn
Anand Bhalgat grad student 2013 Penn

Collaborators

Sign in to add collaborator
BETA: Related publications

Publications

You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect.

Asathulla MK, Khanna S, Lahn N, et al. (2020) A Faster Algorithm for Minimum-cost Bipartite Perfect Matching in Planar Graphs Acm Transactions On Algorithms. 16: 1-30
Assadi S, Khanna S, Li Y. (2019) Tight Bounds for Single-Pass Streaming Complexity of the Set Cover Problem Siam Journal On Computing
Goel A, Kapralov M, Khanna S. (2018) Perfect Matchings in Õ (n1.5) Time in Regular Bipartite Graphs Combinatorica. 39: 323-354
Chrobak M, Feige U, Hajiaghayi MT, et al. (2017) A greedy approximation algorithm for minimum-gap scheduling Journal of Scheduling. 20: 279-292
Assadi S, Khanna S, Li Y, et al. (2016) Maximum matchings in dynamic graph streams and the simultaneous communication model Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 2: 1345-1364
Assadi S, Khanna S, Li Y, et al. (2015) Complexity of the minimum input selection problem for structural controllability Ifac Proceedings Volumes (Ifac-Papersonline). 48: 70-75
Starlinger J, Cohen-Boulakia S, Khanna S, et al. (2015) Effective and efficient similarity search in scientific workflow repositories Future Generation Computer Systems
Chakrabarty D, Chekuri C, Khanna S, et al. (2015) Approximability of Capacitated Network Design Algorithmica. 72: 493-514
Goel A, Kapralov M, Khanna S. (2013) Perfect Matchings in $O(n\log n)$ Time in Regular Bipartite Graphs Siam Journal On Computing. 42: 1392-1404
Chekur C, Khanna S, Shepherd FB. (2013) The all-or-nothing multicommod ity flow problem Siam Journal On Computing. 42: 1467-1493
See more...