| Publication | Date of Publication | Type |
|---|
| Approximating submodular \(k\)-partition via principal partition sequence | 2025-01-14 | Paper |
Approximating submodular \(k\)-partition via principal partition sequence
SIAM Journal on Discrete Mathematics | 2024-12-18 | Paper |
Deterministic enumeration of all minimum cut-sets and \(k\)-cut-sets in hypergraphs for fixed \(k\)
Mathematical Programming. Series A. Series B | 2024-09-19 | Paper |
| Approximate representation of symmetric submodular functions via hypergraph cut functions | 2024-09-12 | Paper |
| Deterministic enumeration of all minimum \(k\)-cut-sets in hypergraphs for fixed \(k\) | 2024-07-19 | Paper |
| Counting and enumerating optimum cut sets for hypergraph \(k\)-partitioning problems for fixed \(k\) | 2024-06-24 | Paper |
| Approximate minimum cuts and their enumeration | 2024-05-14 | Paper |
| scientific article; zbMATH DE number 7788402 (Why is no real title available?) | 2024-01-15 | Paper |
Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree
(available as arXiv preprint) | 2023-11-13 | Paper |
| Multicriteria Cuts and Size-Constrained k-Cuts in Hypergraphs. | 2023-10-31 | Paper |
Min-max partitioning of hypergraphs and symmetric submodular functions
Combinatorica | 2023-10-04 | Paper |
| \(\ell_p\)-norm multiway cut | 2023-09-20 | Paper |
Multicriteria cuts and size-constrained \(k\)-cuts in hypergraphs
Mathematical Programming. Series A. Series B | 2023-03-14 | Paper |
Fixed parameter approximation scheme for min-max \(k\)-cut
Mathematical Programming. Series A. Series B | 2023-03-14 | Paper |
| The Maximum Binary Tree Problem. | 2023-02-07 | Paper |
Analyzing Residual Random Greedy for monotone submodular maximization
Information Processing Letters | 2023-01-30 | Paper |
Hypergraph k-Cut for Fixed k in Deterministic Polynomial Time
Mathematics of Operations Research | 2023-01-09 | Paper |
\(\ell_p\)-norm multiway cut
Algorithmica | 2022-08-18 | Paper |
Faster connectivity in low-rank hypergraphs via expander decomposition
(available as arXiv preprint) | 2022-08-16 | Paper |
| Spectral aspects of symmetric matrix signings | 2022-07-21 | Paper |
Improving the Smoothed Complexity of FLIP for Max Cut Problems
ACM Transactions on Algorithms | 2022-02-16 | Paper |
Fixed parameter approximation scheme for min-max \(k\)-cut
Integer Programming and Combinatorial Optimization | 2021-12-21 | Paper |
| On the expansion of group-based lifts | 2021-07-28 | Paper |
Global and fixed-terminal cuts in digraphs
(available as arXiv preprint) | 2021-07-28 | Paper |
The maximum binary tree problem
Algorithmica | 2021-07-26 | Paper |
The maximum binary tree problem
Algorithmica | 2021-07-26 | Paper |
Lattice-based locality sensitive hashing is optimal
(available as arXiv preprint) | 2021-06-15 | Paper |
Hypergraph \(k\)-cut in randomized polynomial time
Mathematical Programming. Series A. Series B | 2021-02-15 | Paper |
A tight \(\sqrt{2} \)-approximation for linear 3-cut
Mathematical Programming. Series A. Series B | 2020-10-21 | Paper |
Hypergraph $k$-cut for fixed $k$ in deterministic polynomial time
(available as arXiv preprint) | 2020-09-25 | Paper |
Improving the integrality gap for multiway cut
Mathematical Programming. Series A. Series B | 2020-08-28 | Paper |
Spectral aspects of symmetric matrix signings
Discrete Optimization | 2020-07-30 | Paper |
Odd multiway cut in directed acyclic graphs
SIAM Journal on Discrete Mathematics | 2020-07-30 | Paper |
Odd Multiway Cut in Directed Acyclic Graphs
(available as arXiv preprint) | 2020-05-27 | Paper |
Improving the integrality gap for multiway cut
Integer Programming and Combinatorial Optimization | 2020-02-06 | Paper |
Improving the integrality gap for multiway cut
Integer Programming and Combinatorial Optimization | 2020-02-06 | Paper |
Improving the smoothed complexity of FLIP for max cut problems
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
On the expansion of group-based lifts
SIAM Journal on Discrete Mathematics | 2019-08-29 | Paper |
Beating the 2-approximation factor for global bicut
Mathematical Programming. Series A. Series B | 2019-08-06 | Paper |
Additive stabilizers for unstable graphs
Discrete Optimization | 2019-06-13 | Paper |
Graph stabilization: a survey
Combinatorial Optimization and Graph Algorithms | 2018-10-16 | Paper |
Local testing of lattices
SIAM Journal on Discrete Mathematics | 2018-06-08 | Paper |
Local testing for membership in lattices
(available as arXiv preprint) | 2018-04-19 | Paper |
| scientific article; zbMATH DE number 6850403 (Why is no real title available?) | 2018-03-15 | Paper |
| scientific article; zbMATH DE number 6850401 (Why is no real title available?) | 2018-03-15 | Paper |
| Algorithms for implicit hitting set problems | 2017-09-29 | Paper |
Deciding orthogonality in construction-A lattices
(available as arXiv preprint) | 2017-07-13 | Paper |
Shift lifts preserving Ramanujan property
Linear Algebra and its Applications | 2017-06-30 | Paper |
Deciding orthogonality in construction-A lattices
SIAM Journal on Discrete Mathematics | 2017-06-23 | Paper |
Integer feasibility of random polytopes: random integer programs
Proceedings of the 5th conference on Innovations in theoretical computer science | 2017-05-19 | Paper |
Faster private release of marginals on small databases
Proceedings of the 5th conference on Innovations in theoretical computer science | 2017-05-19 | Paper |
| Invertibility and Largest Eigenvalue of Symmetric Matrix Signings | 2016-11-11 | Paper |
The cutting plane method is polynomial for perfect matchings
Mathematics of Operations Research | 2016-04-15 | Paper |
The cutting plane method is polynomial for perfect matchings
Mathematics of Operations Research | 2016-04-15 | Paper |
Finding small stabilizers for unstable graphs
Mathematical Programming. Series A. Series B | 2015-12-09 | Paper |
| Towards Constructing Ramanujan Graphs Using Shift Lifts | 2015-02-25 | Paper |
Finding small stabilizers for unstable graphs
Integer Programming and Combinatorial Optimization | 2014-06-02 | Paper |
| Deterministic algorithms for the Lovász local lemma | 2014-05-22 | Paper |
Thin partitions, isoperimetric inequalities and a sampling algorithm for star shaped bodies
(available as arXiv preprint) | 2014-05-22 | Paper |
Deterministic algorithms for the Lovász local lemma
SIAM Journal on Computing | 2014-04-11 | Paper |
| scientific article; zbMATH DE number 5666449 (Why is no real title available?) | 2010-02-05 | Paper |
Sampling s-Concave Functions: The Limit of Convexity Based Isoperimetry
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-10-28 | Paper |
