The following pages link to Karthekeyan Chandrasekaran (Q783040):
Displayed 50 items.
- Spectral aspects of symmetric matrix signings (Q783041) (← links)
- Finding small stabilizers for unstable graphs (Q896265) (← links)
- The maximum binary tree problem (Q2041978) (← links)
- Faster connectivity in low-rank hypergraphs via expander decomposition (Q2164680) (← links)
- \(\ell_p\)-norm multiway cut (Q2165036) (← links)
- A tight \(\sqrt{2} \)-approximation for linear 3-cut (Q2205984) (← links)
- Hypergraph \(k\)-cut in randomized polynomial time (Q2227530) (← links)
- Beating the 2-approximation factor for global bicut (Q2316621) (← links)
- Shift lifts preserving Ramanujan property (Q2361560) (← links)
- Additive stabilizers for unstable graphs (Q2419360) (← links)
- Analyzing Residual Random Greedy for monotone submodular maximization (Q2680237) (← links)
- Multicriteria cuts and size-constrained \(k\)-cuts in hypergraphs (Q2689813) (← links)
- The Cutting Plane Method is Polynomial for Perfect Matchings (Q2800362) (← links)
- Faster private release of marginals on small databases (Q2988893) (← links)
- Integer feasibility of random polytopes (Q2988898) (← links)
- Odd Multiway Cut in Directed Acyclic Graphs (Q3300762) (← links)
- (Q3400314) (← links)
- Sampling s-Concave Functions: The Limit of Convexity Based Isoperimetry (Q3638895) (← links)
- Local Testing of Lattices (Q4565131) (← links)
- (Q4607980) (← links)
- (Q4607983) (← links)
- Local Testing for Membership in Lattices (Q4636596) (← links)
- Graph Stabilization: A Survey (Q4689625) (← links)
- Lattice-based locality sensitive hashing is optimal (Q4993309) (← links)
- Global and fixed-terminal cuts in digraphs (Q5002602) (← links)
- On the Expansion of Group-Based Lifts (Q5002627) (← links)
- Improving the Smoothed Complexity of FLIP for Max Cut Problems (Q5032028) (← links)
- Spectral aspects of symmetric matrix signings (Q5092445) (← links)
- Odd Multiway Cut in Directed Acyclic Graphs (Q5111871) (← links)
- On the Expansion of Group-Based Lifts (Q5232157) (← links)
- Improving the smoothed complexity of FLIP for max cut problems (Q5236239) (← links)
- Deciding Orthogonality in Construction-A Lattices (Q5270405) (← links)
- Deciding Orthogonality in Construction-A Lattices (Q5275364) (← links)
- (Q5365067) (← links)
- Deterministic Algorithms for the Lovász Local Lemma (Q5408761) (← links)
- (Q5417683) (← links)
- Thin Partitions: Isoperimetric Inequalities and Sampling Algorithms for some Nonconvex Families (Q5417737) (← links)
- Finding Small Stabilizers for Unstable Graphs (Q5418992) (← links)
- Hypergraph <i>k</i>-Cut for Fixed <i>k</i> in Deterministic Polynomial Time (Q5870380) (← links)
- The Maximum Binary Tree Problem. (Q5874498) (← links)
- Fixed parameter approximation scheme for min-max \(k\)-cut (Q5918433) (← links)
- Improving the integrality gap for multiway cut (Q5918912) (← links)
- Improving the integrality gap for multiway cut (Q5919382) (← links)
- Fixed parameter approximation scheme for min-max \(k\)-cut (Q5925652) (← links)
- (Q6075917) (← links)
- Min-max partitioning of hypergraphs and symmetric submodular functions (Q6081377) (← links)
- Multicriteria Cuts and Size-Constrained k-Cuts in Hypergraphs. (Q6084360) (← links)
- Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree (Q6089651) (← links)
- (Q6147315) (← links)
- Towards Constructing Ramanujan Graphs Using Shift Lifts (Q6259420) (← links)