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
[2]
Hilfe
Suche: Author="Chekuri, Chandra"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Centrality of trees for capacitated
k
-center
Hyung-Chan An
,
Aditya Bhaskara
,
Chandra Chekuri
,
Shalmoli Gupta
,
Vivek Madan
,
Ola Svensson
Lecture Notes in Computer Science
8494
, 2014, pp. 52-63
The all-or-nothing flow problem in directed graphs with symmetric demand pairs
Chandra Chekuri
,
Alina Ene
Lecture Notes in Computer Science
8494
, 2014, pp. 222-233
A graph reduction step preserving element-connectivity and packing Steiner trees and forests
Chandra Chekuri
,
Nitish Korula
SIAM Journal on Discrete Mathematics
28
(2), 2014, pp. 577-597
Submodular function maximization via the multilinear relaxation and contention resolution schemes
Chandra Chekuri
,
Jan Vondrák
,
Rico Zenklusen
SIAM Journal on Computing
43
(6), 2014, pp. 1831-1879
Large-treewidth graph decompositions and applications
Chandra Chekuri
,
Julia Chuzhoy
Proceedings of the 45th ACM Symposium on Theory of Computing, STOC'2013 (Palo Alto, California, USA, June 1-4, 2013)
, 2013, pp. 291-300
The all-or-nothing multicommodity flow problem
Chandra Chekuri
,
Sanjeev Khanna
,
F. Bruce Shepherd
SIAM Journal on Computing
42
(4), 2013, pp. 1467-1493
Maximum edge-disjoint paths in
k
-sums of graphs
Chandra Chekuri
,
Guyslain Naves
,
F. Bruce Shepherd
Lecture Notes in Computer Science
7965
, 2013, pp. 328-339
Flow-cut gaps for integer and fractional multiflows
Chandra Chekuri
,
F. Bruce Shepherd
,
Christophe Weibel
Journal of Combinatorial Theory Series B
103
(2), 2013, pp. 248-273
Node-weighted network design in planar and minor-closed families of graphs
Chandra Chekuri
,
Alina Ene
,
Ali Vakilian
Lecture Notes in Computer Science
7391
, 2012, pp. 206-217
Pruning 2-connected graphs
Chandra Chekuri
,
Nitish Korula
Algorithmica
62
(1-2), 2012, pp. 436-463
Maximizing a monotone submodular function subject to a matroid constraint
Gruia Calinescu
,
Chandra Chekuri
,
Martin Pál
,
Jan Vondrák
SIAM Journal on Computing
40
(6), 2011, pp. 1740-1766
Approximability of capacitated network design
Deeparnab Chakrabarty
,
Chandra Chekuri
,
Sanjeev Khanna
,
Nitish Korula
Lecture Notes in Computer Science
6655
, 2011, pp. 78-91
Submodular cost allocation problem and applications
Chandra Chekuri
,
Alina Ene
Lecture Notes in Computer Science
6755
, 2011, pp. 354-366
Submodular function maximization via the multilinear relaxation and contention resolution schemes
Chandra Chekuri
,
Jan Vondrák
,
Rico Zenklusen
Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC'2011 (San Jose, CA, USA, June 6-8, 2011)
, 2011, pp. 783-792
Minimizing maximum response time and delay factor in broadcast scheduling
Chandra Chekuri
,
Sungjin Im
,
Benjamin Moseley
Lecture Notes in Computer Science
5757
, 2009, pp. 444-455
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
A graph reduction step preserving element-connectivity and applications
Chandra Chekuri
,
Nitish Korula
Lecture Notes in Computer Science
5555
, 2009, pp. 254-265
Algorithms for 2-route cut problems
Chandra Chekuri
,
Sanjeev Khanna
Lecture Notes in Computer Science
5125
, 2008, pp. 472-484
Pruning 2-connected graphs
Chandra Chekuri
,
Nitish Korula
Leibniz International Proceedings in Informatics (LIPIcs)
2
, 2008
Single-sink network design with vertex connectivity requirements
Chandra Chekuri
,
Nitish Korula
Leibniz International Proceedings in Informatics (LIPIcs)
2
, 2008
Approximate integer decompositions for undirected network design problems
Chandra Chekuri
,
F. Bruce Shepherd
SIAM Journal on Discrete Mathematics
23
(1), 2008-2009, pp. 163-177
Maximizing a submodular set function subject to a matroid constraint
Gruia Calinescu
,
Chandra Chekuri
,
Martin Pál
,
Jan Vondrák
Lecture Notes in Computer Science
4513
, 2007, pp. 182-196
Approximation algorithms for the unsplittable flow problem
Amit Chakrabarti
,
Chandra Chekuri
,
Anupam Gupta
,
Amit Kumar
Algorithmica
47
(1), 2007, pp. 53-78
The Steiner
k
-cut problem
Chandra Chekuri
,
Sudipto Guha
,
Joseph (Seffi) Naor
SIAM Journal on Discrete Mathematics
20
(1), 2006, pp. 261-271
Seiten 1
2
3
>