Nitya Mani

Publication Activity (10 Years)

Years Active: 2020-2024
Publications (10 Years): 20

Top Topics

Stochastic Local Search Algorithms

Top Venues

Random Struct. Algorithms

Comb. Probab. Comput.

Publications

Aaron Berger, Nitya Mani
On sum-intersecting families of positive integers. Eur. J. Comb. 120 (2024)
Jacob Fox, Zoe M. Himwich, Nitya Mani
Extremal results on feedback arc sets in digraphs. Random Struct. Algorithms 64 (2) (2024)
Nitya Mani, Edward Yu
Turán problems for mixed graphs. J. Comb. Theory B 167 (2024)
Sayan Das, Zoe M. Himwich, Nitya Mani
A fourth-moment phenomenon for asymptotic normality of monochromatic subgraphs. Random Struct. Algorithms 63 (4) (2023)
Zongchen Chen, Nitya Mani
-SAT. SODA (2023)
Zongchen Chen, Kuikui Liu, Nitya Mani, Ankur Moitra
Strong Spatial Mixing for Colorings on Trees and its Algorithmic Applications. FOCS (2023)
Zongchen Chen, Kuikui Liu, Nitya Mani, Ankur Moitra
Strong spatial mixing for colorings on trees and its algorithmic applications. CoRR (2023)
Jacob Fox, Zoe Himwich, Nitya Mani
Making an H $H$ -free graph k $k$ -colorable. J. Graph Theory 102 (2) (2023)
Dingding Dong, Nitya Mani, Yufei Zhao
On the number of error correcting codes. Comb. Probab. Comput. 32 (5) (2023)
József Balogh, Dingding Dong, Bernard Lidický, Nitya Mani, Yufei Zhao
Nearly All k-SAT Functions Are Unate. STOC (2023)
Jacob Fox, Zoe Himwich, Nitya Mani
Extremal results on feedback arc sets in digraphs. CoRR (2022)
Dingding Dong, Nitya Mani, Yufei Zhao
On the number of error correcting codes. CoRR (2022)
Dingding Dong, Nitya Mani, Yufei Zhao
Enumerating k-SAT functions. SODA (2022)
Zongchen Chen, Nitya Mani, Ankur Moitra
From algorithms to connectivity and back: finding a giant component in random k-SAT. CoRR (2022)
József Balogh, Dingding Dong, Bernard Lidický, Nitya Mani, Yufei Zhao
Nearly all k-SAT functions are unate. CoRR (2022)
Tanvi Deshpande, Nitya Mani
An Interpretable Approach to Hateful Meme Detection. ICMI (2021)
Jacob Fox, Zoe Himwich, Nitya Mani
Making an $H$-Free Graph $k$-Colorable. CoRR (2021)
Charles Carlson, Alexandra Kolla, Ray Li, Nitya Mani, Benny Sudakov, Luca Trevisan
Lower Bounds for Max-Cut in H-Free Graphs via Semidefinite Programming. SIAM J. Discret. Math. 35 (3) (2021)
Tanvi Deshpande, Nitya Mani
An Interpretable Approach to Hateful Meme Detection. CoRR (2021)
Charles Carlson, Alexandra Kolla, Ray Li, Nitya Mani, Benny Sudakov, Luca Trevisan
Lower Bounds for Max-Cut via Semidefinite Programming. LATIN (2020)