Travelled to:1 × Canada
1 × Iceland
1 × Japan
1 × Latvia
1 × Switzerland
1 × The Netherlands
1 × United Kingdom
10 × USA
3 × Greece
Collaborated with:S.Khanna F.B.Shepherd J.Chuzhoy A.Ene S.Guha R.Motwani N.Korula A.Goel M.Charikar S.Gupta K.Quanrud G.Naves A.Vakilian J.Vondrák R.Zenklusen J.Naor M.Mydlarz A.Zhu N.Shivakumar H.Garcia-Molina W.Hasan A.Kumar T.Feder
Talks about:flow (6) problem (5) graph (5) algorithm (4) approxim (4) weight (4) time (4) multicommod (3) submodular (3) applic (3)
Person: Chandra Chekuri
DBLP: Chekuri:Chandra
Contributed to:
2015
2014201320132012201120112009200820062005200420032002200120011998
19981997
1995Wrote 22 papers:
- ICALP-v1-2015-ChekuriGQ #algorithm #streaming
- Streaming Algorithms for Submodular Function Maximization (CC, SG, KQ), pp. 318–330.
- STOC-2014-ChekuriC #bound #polynomial #theorem
- Polynomial bounds for the grid-minor theorem (CC, JC), pp. 60–69.
- ICALP-v1-2013-ChekuriNS #graph
- Maximum Edge-Disjoint Paths in k-Sums of Graphs (CC, GN, FBS), pp. 328–339.
- STOC-2013-ChekuriC #graph
- Large-treewidth graph decompositions and applications (CC, JC), pp. 291–300.
- ICALP-v1-2012-ChekuriEV #design #graph #network #product line
- Node-Weighted Network Design in Planar and Minor-Closed Families of Graphs (CC, AE, AV), pp. 206–217.
- ICALP-v1-2011-ChekuriE #problem
- Submodular Cost Allocation Problem and Applications (CC, AE), pp. 354–366.
- STOC-2011-VondrakCZ #multi
- Submodular function maximization via the multilinear relaxation and contention resolution schemes (JV, CC, RZ), pp. 783–792.
- ICALP-v1-2009-ChekuriK #graph #reduction
- A Graph Reduction Step Preserving Element-Connectivity and Applications (CC, NK), pp. 254–265.
- ICALP-A-2008-ChekuriK #algorithm #problem
- Algorithms for 2-Route Cut Problems (CC, SK), pp. 472–484.
- STOC-2006-ChekuriKS #constant #graph
- Edge-disjoint paths in Planar graphs with constant congestion (CC, SK, FBS), pp. 757–766.
- STOC-2005-ChekuriKS #multi #problem
- Multicommodity flow, well-linked terminals, and routing problems (CC, SK, FBS), pp. 183–192.
- STOC-2004-ChekuriGKK #multi #scheduling
- Multi-processor scheduling to minimize flow time with epsilon resource augmentation (CC, AG, SK, AK), pp. 363–372.
- STOC-2004-ChekuriKS #multi #problem
- The all-or-nothing multicommodity flow problem (CC, SK, FBS), pp. 156–165.
- ICALP-2003-ChekuriGN #approximate
- Approximating Steiner k-Cuts (CC, SG, JN), pp. 189–199.
- ICALP-2003-ChekuriMS #multi
- Multicommodity Demand Flow in a Tree (CC, MM, FBS), pp. 410–425.
- STOC-2002-ChekuriK #approximate
- Approximation schemes for preemptive weighted flow time (CC, SK), pp. 297–305.
- ICALP-2001-ChekuriK
- A PTAS for Minimizing Weighted Completion Time on Uniformly Related Machines (CC, SK), pp. 848–861.
- STOC-2001-ChekuriKZ #algorithm
- Algorithms for minimizing weighted flow time (CC, SK, AZ), pp. 84–93.
- STOC-1998-CharikarCGG #algorithm #approximate
- Rounding via Trees: Deterministic Approximation Algorithms for Group Steiner Trees and k-Median (MC, CC, AG, SG), pp. 114–123.
- VLDB-1998-ShivakumarGC #approximate
- Filtering with Approximate Predicates (NS, HGM, CC), pp. 263–274.
- STOC-1997-CharikarCFM #clustering #incremental #information management #information retrieval
- Incremental Clustering and Dynamic Information Retrieval (MC, CC, TF, RM), pp. 626–635.
- PODS-1995-ChekuriHM #optimisation #parallel #problem #query #scheduling
- Scheduling Problems in Parallel Query Optimization (CC, WH, RM), pp. 255–265.