( en | de | ru )

 

Disambiguation of "Chekuri, Chandra"

Author of the publication

copydeleteadd this publication to your clipboard
Filtering with Approximate Predicates.

, , and . VLDB, page 263-274. Morgan Kaufmann, (1998)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Umananda Chandra

Harish Chandra

Sunil Chandra

Laltu Chandra

Arvind Chandra

 

Other publications of authors with the same name

Submodular Function Maximization in Parallel via the Multilinear Relaxation., and . SODA, page 303-322. SIAM, (2019)Approximation Algorithms for the Unsplittable Flow Problem., , , and . APPROX, volume 2462 of Lecture Notes in Computer Science, page 51-66. Springer, (2002)Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs., , and . APPROX-RANDOM, volume 5687 of Lecture Notes in Computer Science, page 42-55. Springer, (2009)Faster and Scalable Algorithms for Densest Subgraph and Decomposition., , and . NeurIPS, (2022)Minimizing Weighted Completion Time on a Single Machine., and . SODA, page 873-874. ACM/SIAM, (1999)Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs., , and . ICALP, volume 55 of LIPIcs, page 7:1-7:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Single-Sink Network Design with Vertex Connectivity Requirements., and . FSTTCS, volume 2 of LIPIcs, page 131-142. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2008)Scheduling Problems in Parallel Query Optimization., , and . PODS, page 255-265. ACM Press, (1995)Multi-processor scheduling to minimize flow time with epsilon resource augmentation., , , and . STOC, page 363-372. ACM, (2004)Buy-at-Bulk Network Design with Protection., , , and . FOCS, page 634-644. IEEE Computer Society, (2007)