Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Khanna, Sanjeev"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A utility equivalence theorem for concave functions
Anand Bhalgat
,
Sanjeev Khanna
Lecture Notes in Computer Science
8494
, 2014, pp. 126-137
Dynamic and nonuniform pricing strategies for revenue maximization
Tanmoy Chakraborty
,
Zhiyi Huang
,
Sanjeev Khanna
SIAM Journal on Computing
42
(6), 2013, pp. 2424-2451
The all-or-nothing multicommodity flow problem
Chandra Chekuri
,
Sanjeev Khanna
,
F. Bruce Shepherd
SIAM Journal on Computing
42
(4), 2013, pp. 1467-1493
A greedy approximation algorithm for minimum-gap scheduling
Marek Chrobak
,
Uriel Feige
,
Mohammad Taghi Hajiaghayi
,
Sanjeev Khanna
,
Fei Li
,
Seffi Naor
Lecture Notes in Computer Science
7878
, 2013, pp. 97-109
Perfect matchings in
O(n\log n)
time in regular bipartite graphs
Ashish Goel
,
Michael Kapralov
,
Sanjeev Khanna
SIAM Journal on Computing
42
(3), 2013, pp. 1392-1404
Distributed private heavy hitters
Justin Hsu
,
Sanjeev Khanna
,
Aaron Roth
Lecture Notes in Computer Science
7391
, 2012, pp. 461-472
Approximability of capacitated network design
Deeparnab Chakrabarty
,
Chandra Chekuri
,
Sanjeev Khanna
,
Nitish Korula
Lecture Notes in Computer Science
6655
, 2011, pp. 78-91
Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs
Matthew Andrews
,
Julia Chuzhoy
,
Venkatesan Guruswami
,
Sanjeev Khanna
,
Kunal Talwar
,
Lisa Zhang
Combinatorica
30
(5), 2010, pp. 485-520
Perfect matchings in
O(n\log n)
time in regular bipartite graphs
Ashish Goel
,
Michael Kapralov
,
Sanjeev Khanna
Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC'2010 (Cambridge, Massachusetts, June 5-8, 2010)
, 2010, pp. 39-46
The network as a storage device: Dynamic routing with bounded buffers
Stanislav Angelov
,
Sanjeev Khanna
,
Keshav Kunal
Algorithmica
55
(1), 2009, pp. 71-94
A note on multiflows and treewidth
Chandra Chekuri
,
Sanjeev Khanna
,
F. Bruce Shepherd
Algorithmica
54
(3), 2009, pp. 400-412
Edge-disjoint paths in planar graphs with constant congestion
Chandra Chekuri
,
Sanjeev Khanna
,
F. Bruce Shepherd
SIAM Journal on Computing
39
(1), 2009, pp. 281-301
Polynomial flow-cut gaps and hardness of directed cut problems
Julia Chuzhoy
,
Sanjeev Khanna
Journal of the ACM
56
(2), 2009, pp. 6: 1-28
Network design for vertex connectivity
Tanmoy Chakraborty
,
Julia Chuzhoy
,
Sanjeev Khanna
Proceedings of the 40th International ACM Symposium on Theory of Computing, STOC'2008 (Victoria, BC, Canada, May 17-20, 2008)
, 2008, pp. 167-176
Algorithms for 2-route cut problems
Chandra Chekuri
,
Sanjeev Khanna
Lecture Notes in Computer Science
5125
, 2008, pp. 472-484
STCON in directed unique-path graphs
Sampath Kannan
,
Sanjeev Khanna
,
Sudeepa Roy
Leibniz International Proceedings in Informatics (LIPIcs)
2
, 2008
Hardness of routing with congestion in directed graphs
Julia Chuzhoy
,
Venkatesan Guruswami
,
Sanjeev Khanna
,
Kunal Talwar
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, STOC'2007 (San Diego, CA, USA, June 11-13, 2007)
, 2007, pp. 165-178
Polynomial flow-cut gaps and hardness of directed cut problems
Julia Chuzhoy
,
Sanjeev Khanna
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, STOC'2007 (San Diego, CA, USA, June 11-13, 2007)
, 2007, pp. 179-188
A formal investigation of diff3
Sanjeev Khanna
,
Keshav Kunal
,
Benjamin C. Pierce
Lecture Notes in Computer Science
4855
, 2007, pp. 485-496
Efficient enumeration of phylogenetically informative substrings
Stanislav Angelov
,
Boulos Harb
,
Sampath Kannan
,
Sanjeev Khanna
,
Junhyong Kim
LNCS/LNBI
3909
, 2006, pp. 248-264
Edge-disjoint paths in planar graphs with constant congestion
Chandra Chekuri
,
Sanjeev Khanna
,
F. Bruce Shepherd
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, STOC'2006 (Seattle, Washington, USA, May 21-23, 2006)
, 2006, pp. 757-766
Hardness of cut problems in directed graphs
Julia Chuzhoy
,
Sanjeev Khanna
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, STOC'2006 (Seattle, Washington, USA, May 21-23, 2006)
, 2006, pp. 527-536
Randomized pursuit-evasion with local visibility
Volkan Isler
,
Sampath Kannan
,
Sanjeev Khanna
SIAM Journal on Discrete Mathematics
20
(1), 2006, pp. 26-41
Multicommodity flow, well-linked terminals, and routing problems
Chandra Chekuri
,
Sanjeev Khanna
,
F. Bruce Shepherd
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, STOC'2005 (Baltimore, Maryland, USA, May 22-24, 2005)
, 2005, pp. 183-192
A polynomial time approximation scheme for the multiple knapsack problem
Chandra Chekuri
,
Sanjeev Khanna
SIAM Journal on Computing
35
(3), 2005-2006, pp. 713-728
Seiten 1
2
3
>