( en | de | ru )

 

Disambiguation of "Chandrasekaran, Karthekeyan"

Author of the publication

copydeleteadd this publication to your clipboard
Deterministic enumeration of all minimum cut-sets and k-cut-sets in hypergraphs for fixed k.

, , and . CoRR, (2021)

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.

Karthekeyan Chandrasekaran

Muthukumaran Chandrasekaran

Vijayanand Chandrasekaran

Venkat Chandrasekaran

Swetha Chandrasekaran

 

Other publications of authors with the same name

Additive stabilizers for unstable graphs., , , , , and . Discret. Optim., (2019)Fixed Parameter Approximation Scheme for Min-max k-cut., and . CoRR, (2020)Multicriteria cuts and size-constrained k-cuts in hypergraphs., , and . Math. Program., 197 (1): 27-69 (January 2023)Hypergraph k-cut in randomized polynomial time., , and . Math. Program., 186 (1): 85-113 (2021)The Maximum Binary Tree Problem., , , , , and . ESA, volume 173 of LIPIcs, page 30:1-30:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)ℓp-Norm Multiway Cut., and . ESA, volume 204 of LIPIcs, page 29:1-29:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Approximate Representation of Symmetric Submodular Functions via Hypergraph Cut Functions., , , and . FSTTCS, volume 250 of LIPIcs, page 6:1-6:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Integer feasibility of random polytopes: random integer programs., and . ITCS, page 449-458. ACM, (2014)On the Expansion of Group-Based Lifts., , , and . SIAM J. Discret. Math., 33 (3): 1338-1373 (2019)Faster connectivity in low-rank hypergraphs via expander decomposition., , , and . CoRR, (2020)