1 citations · 1 across the 1 of their papers we have counts for
8 papers
An Interpretable Approach to Hateful Meme Detection
Tanvi Deshpande, Nitya Mani
Hateful memes are an emerging method of spreading hate on the internet, relying on both images and text to convey a hateful message. We take an interpretable approach to hateful me…
Making an -Free Graph -Colorable
Jacob Fox, Zoe Himwich, Nitya Mani
We study the following question: how few edges can we delete from any -free graph on vertices in order to make the resulting graph -colorable? It turns out that various c…
Max-Cut in Degenerate -Free Graphs
Ray Li, Nitya Mani
We obtain several lower bounds on the of -degenerate -free graphs. Let denote the smallest of an -free -degenerate grap…
Diophantine Tuples over
Nitya Mani, Simon Rubinstein-Salzedo
For an element of a ring , a Diophantine -tuple is an -tuple of elements of such that for all with , is a p…
Lower bounds for Max-Cut in -free graphs via semidefinite programming
Charles Carlson, Alexandra Kolla, Ray Li +3
For a graph , let denote the size of the maximum cut in . The problem of estimating as a function of the number of vertices and edges of has a long history…
Play in Candy Nim
Nitya Mani, Rajiv Nelakanti, Simon Rubinstein-Salzedo +1
Candy Nim is a variant of Nim in which both players aim to take the last candy in a game of Nim, with the added simultaneous secondary goal of taking as many candies as possible. W…