Chekuri, Chandra; Li, Shi On the hardness of approximating the \(k\)-Way Hypergraph Cut problem. (English) Zbl 1462.68066 Theory Comput. 16, Paper No. 14, 8 p. (2020). MSC: 68Q17 05C65 68R10 68W25 PDFBibTeX XMLCite \textit{C. Chekuri} and \textit{S. Li}, Theory Comput. 16, Paper No. 14, 8 p. (2020; Zbl 1462.68066) Full Text: DOI
Chekuri, Chandra; Sidiropoulos, Anastasios Approximation algorithms for Euler genus and related problems. (English) Zbl 1398.68663 SIAM J. Comput. 47, No. 4, 1610-1643 (2018). MSC: 68W25 05C10 05C85 68R10 68W40 PDFBibTeX XMLCite \textit{C. Chekuri} and \textit{A. Sidiropoulos}, SIAM J. Comput. 47, No. 4, 1610--1643 (2018; Zbl 1398.68663) Full Text: DOI arXiv
Chekuri, Chandra; Ene, Alina The all-or-nothing flow problem in directed graphs with symmetric demand pairs. (English) Zbl 1337.90018 Math. Program. 154, No. 1-2 (B), 249-272 (2015). MSC: 90B10 05C20 05C21 90C35 PDFBibTeX XMLCite \textit{C. Chekuri} and \textit{A. Ene}, Math. Program. 154, No. 1--2 (B), 249--272 (2015; Zbl 1337.90018) Full Text: DOI Link
Chekuri, Chandra; Kannan, Sreeram; Raja, Adnan; Viswanath, Pramod Multicommodity flows and cuts in polymatroidal networks. (English) Zbl 1346.90698 SIAM J. Comput. 44, No. 4, 912-943 (2015). MSC: 90C27 68Q25 68W25 PDFBibTeX XMLCite \textit{C. Chekuri} et al., SIAM J. Comput. 44, No. 4, 912--943 (2015; Zbl 1346.90698) Full Text: DOI arXiv
Chekuri, Chandra; Korula, Nitish Pruning 2-connected graphs. (English) Zbl 1241.68131 Algorithmica 62, No. 1-2, 436-463 (2012). MSC: 68W25 68Q17 05C40 68R10 PDFBibTeX XMLCite \textit{C. Chekuri} and \textit{N. Korula}, Algorithmica 62, No. 1--2, 436--463 (2012; Zbl 1241.68131) Full Text: DOI Link
Călinescu, Gruia; Chekuri, Chandra; Vondrák, Jan Disjoint bases in a polymatroid. (English) Zbl 1205.05039 Random Struct. Algorithms 35, No. 4, 418-430 (2009). MSC: 05B35 PDFBibTeX XMLCite \textit{G. Călinescu} et al., Random Struct. Algorithms 35, No. 4, 418--430 (2009; Zbl 1205.05039) Full Text: DOI
Chekuri, Chandra; Khanna, Sanjeev; Shepherd, F. Bruce A note on multiflows and treewidth. (English) Zbl 1176.90600 Algorithmica 54, No. 3, 400-412 (2009). MSC: 90C35 05C78 68Q25 68W25 PDFBibTeX XMLCite \textit{C. Chekuri} et al., Algorithmica 54, No. 3, 400--412 (2009; Zbl 1176.90600) Full Text: DOI
Chekuri, Chandra; Even, Guy; Kortsarz, Guy A greedy approximation algorithm for the group Steiner problem. (English) Zbl 1083.68089 Discrete Appl. Math. 154, No. 1, 15-34 (2006). MSC: 68R10 05C85 68W25 PDFBibTeX XMLCite \textit{C. Chekuri} et al., Discrete Appl. Math. 154, No. 1, 15--34 (2006; Zbl 1083.68089) Full Text: DOI
Chekuri, C.; Rajaraman, A. Conjunctive query containment revisited. (English) Zbl 0944.68046 Theor. Comput. Sci. 239, No. 2, 211-229 (2000). MSC: 68P15 PDFBibTeX XMLCite \textit{C. Chekuri} and \textit{A. Rajaraman}, Theor. Comput. Sci. 239, No. 2, 211--229 (2000; Zbl 0944.68046) Full Text: DOI