Karthekeyan Chandrasekaran

Shubhang Kulkarni

CoRR, 2024

Splitting-Off in Hypergraphs.

[BibT_eX]

[DOI]

Shubhang Kulkarni

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2023

Min-Max Partitioning of Hypergraphs and Symmetric Submodular Functions.

[BibT_eX]

[DOI]

Comb., June, 2023

Fixed parameter approximation scheme for min-max k-cut.

[BibT_eX]

[DOI]

Math. Program., February, 2023

Multicriteria cuts and size-constrained k-cuts in hypergraphs.

[BibT_eX]

[DOI]

Math. Program., January, 2023

Analyzing Residual Random Greedy for monotone submodular maximization.

[BibT_eX]

[DOI]

Aditya Pillai

Inf. Process. Lett., 2023

Hypergraph Splitting-off and Covering Skew-Supermodular Functions in Strongly Polynomial Time.

[BibT_eX]

[DOI]

Shubhang Kulkarni

CoRR, 2023

Polyhedral Aspects of Feedback Vertex Set and Pseudoforest Deletion Set.

[BibT_eX]

[DOI]

CoRR, 2023

Approximate minimum cuts and their enumeration.

[BibT_eX]

[DOI]

Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023

Approximating Submodular k-Partition via Principal Partition Sequence.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2023

2022

Hypergraph k-Cut for Fixed k in Deterministic Polynomial Time.

[BibT_eX]

[DOI]

Math. Oper. Res., November, 2022

ℓ p-Norm Multiway Cut.

[BibT_eX]

[DOI]

Algorithmica, 2022

Deterministic enumeration of all minimum k-cut-sets in hypergraphs for fixed k.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Faster Connectivity in Low-Rank Hypergraphs via Expander Decomposition.

[BibT_eX]

[DOI]

Sagnik Mukhopadhyay

Danupon Nanongkai

Proceedings of the Integer Programming and Combinatorial Optimization, 2022

Counting and Enumerating Optimum Cut Sets for Hypergraph k-Partitioning Problems for Fixed k.

[BibT_eX]

[DOI]

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Approximate Representation of Symmetric Submodular Functions via Hypergraph Cut Functions.

[BibT_eX]

[DOI]

Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022

2021

Improving the Smoothed Complexity of FLIP for Max Cut Problems.

[BibT_eX]

[DOI]

Ali Bibak

Charles Carlson

ACM Trans. Algorithms, 2021

Hypergraph k-cut in randomized polynomial time.

[BibT_eX]

[DOI]

Xilin Yu

Math. Program., 2021

Deterministic enumeration of all minimum cut-sets and k-cut-sets in hypergraphs for fixed k.

[BibT_eX]

[DOI]

CoRR, 2021

The Maximum Binary Tree Problem.

[BibT_eX]

[DOI]

Algorithmica, 2021

2020

Odd Multiway Cut in Directed Acyclic Graphs.

[BibT_eX]

[DOI]

Matthias Mnich

Sahand Mozaffari

SIAM J. Discret. Math., 2020

A tight $\sqrt{2}$-approximation for linear 3-cut.

[BibT_eX]

[DOI]

Math. Program., 2020

Improving the integrality gap for multiway cut.

[BibT_eX]

[DOI]

Math. Program., 2020

Spectral aspects of symmetric matrix signings.

[BibT_eX]

[DOI]

Charles Carlson

Hsien-Chih Chang

Naonori Kakimura

Alexandra Kolla

Discret. Optim., 2020

Multicritera Cuts and Size-Constrained k-cuts in Hypergraphs.

[BibT_eX]

[DOI]

CoRR, 2020

Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree.

[BibT_eX]

[DOI]

Proceedings of the 15th International Symposium on Parameterized and Exact Computation, 2020

Hypergraph $k$-cut for fixed $k$ in deterministic polynomial time.

[BibT_eX]

[DOI]

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019

On the Expansion of Group-Based Lifts.

[BibT_eX]

[DOI]

Naman Agarwal

Alexandra Kolla

SIAM J. Discret. Math., 2019

Beating the 2-approximation factor for global bicut.

[BibT_eX]

[DOI]

Euiwoong Lee

Math. Program., 2019

Additive stabilizers for unstable graphs.

[BibT_eX]

[DOI]

Discret. Optim., 2019

2018

Local Testing of Lattices.

[BibT_eX]

[DOI]

Mahdi Cheraghchi

SIAM J. Discret. Math., 2018

Hypergraph k-Cut in Randomized Polynomial Time.

[BibT_eX]

[DOI]

Xilin Yu

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

A tight -approximation for Linear 3-Cut.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Lattice-based Locality Sensitive Hashing is Optimal.

[BibT_eX]

[DOI]

Daniel Dadush

Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

2017

Deciding Orthogonality in Construction-A Lattices.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2017

Odd Multiway Cut in Directed Acyclic Graphs.

[BibT_eX]

[DOI]

Sahand Mozaffari

Proceedings of the 12th International Symposium on Parameterized and Exact Computation, 2017

Global and Fixed-Terminal Cuts in Digraphs.

[BibT_eX]

[DOI]

Euiwoong Lee

Proceedings of the Approximation, 2017

2016

The Cutting Plane Method is Polynomial for Perfect Matchings.

[BibT_eX]

[DOI]

László A. Végh

Math. Oper. Res., 2016

Local Testing for Membership in Lattices.

[BibT_eX]

[DOI]

Mahdi Cheraghchi

Electron. Colloquium Comput. Complex., 2016

Largest Eigenvalue and Invertibility of Symmetric Matrix Signings.

[BibT_eX]

[DOI]

Charles Carlson

Hsien-Chih Chang

Alexandra Kolla

CoRR, 2016

2015

Finding small stabilizers for unstable graphs.

[BibT_eX]

[DOI]

Adrian Bock

Jochen Könemann

Britta Peis

Laura Sanità

Math. Program., 2015

Constructing Ramanujan Graphs Using Shift Lifts.

[BibT_eX]

[DOI]

Ameya Velingker

CoRR, 2015

2014

Integer feasibility of random polytopes: random integer programs.

[BibT_eX]

[DOI]

Proceedings of the Innovations in Theoretical Computer Science, 2014

Faster private release of marginals on small databases.

[BibT_eX]

[DOI]

Justin Thaler

Jonathan R. Ullman

Andrew Wan

Proceedings of the Innovations in Theoretical Computer Science, 2014

Finding a most biased coin with fewest flips.

[BibT_eX]

[DOI]

Richard M. Karp

Proceedings of The 27th Conference on Learning Theory, 2014

2013

Deterministic Algorithms for the Lovász Local Lemma.

[BibT_eX]

[DOI]

Navin Goyal

Bernhard Haeupler

SIAM J. Comput., 2013

2012

New approaches to integer programming.

[BibT_eX]

[DOI]

PhD thesis, 2012

2011

A Discrepancy based Approach to Integer Programming

[BibT_eX]

[DOI]

CoRR, 2011

Algorithms for Implicit Hitting Set Problems.

[BibT_eX]

[DOI]

Richard M. Karp

Erick Moreno-Centeno

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

2010

Satisfiability Thresholds for k-CNF Formula with Bounded Variable Intersections

[BibT_eX]

[DOI]

Navin Goyal

Bernhard Haeupler

CoRR, 2010

Thin Partitions: Isoperimetric Inequalities and a Sampling Algorithm for Star Shaped Bodies.

[BibT_eX]

[DOI]

Daniel Dadush

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

2009

The Limit of Convexity Based Isoperimetry: Sampling Harmonic-Concave Functions

[BibT_eX]

[DOI]

Amit Deshpande

CoRR, 2009

Thin Partitions: Isoperimetric Inequalities and Sampling Algorithms for some Nonconvex Families

[BibT_eX]

[DOI]

Daniel Dadush

CoRR, 2009

Sampling s-Concave Functions: The Limit of Convexity Based Isoperimetry.

[BibT_eX]

[DOI]

Amit Deshpande