1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.DS2026
Improved SDP-Based Algorithm for Coloring 3-Colorable Graphs
Nikhil Bansal, Neng Huang, Euiwoong Lee
We present a polynomial-time algorithm that colors any 3-colorable -vertex graph using colors, improving upon the previous best bound of $\widetilde{O}(n^{0.197…
cs.DS2026
Expander Decomposition with Almost Optimal Overhead
Nikhil Bansal, Arun Jambulapati, Thatchaphol Saranurak
We present the first polynomial-time algorithm for computing a near-optimal \emph{flow}-expander decomposition. Given a graph and a parameter , our algorithm removes at most…
cs.CV2022★ 1 cited
DrawMon: A Distributed System for Detection of Atypical Sketch Content in Concurrent Pictionary Games
Nikhil Bansal, Kartik Gupta, Kiruthika Kannan +2
Pictionary, the popular sketch-based guessing game, provides an opportunity to analyze shared goal cooperative game play in restricted communication settings. However, some players…