vix.ing · top · new · best · stats · spec

Mani, Nitya

  1. Lower bounds for Max-Cut in H-free graphs via semidefinite programming
    2018/10/23 by Carlson, Charles, Kolla, Alexandra, Li, Ray +3 · 6 citations
    #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics
  2. Nearly all k-SAT functions are unate
    2022/09/11 by Balogh, József, Dong, Dingding, Lidický, Bernard +2 · 2 citations
    #05A16 #05C65 #Combinatorics (math.CO) #Computational Complexity (cs.CC) #FOS: Computer and information sciences #FOS: Mathematics #G.2.1 #G.2.2
  3. Strong spatial mixing for colorings on trees and its algorithmic applications
    2023/04/04 by Chen, Zongchen, Liu, Kuikui, Mani, Nitya +1 · 2 citations
    #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Probability (math.PR)
  4. Making an H-Free Graph k-Colorable
    2021/02/20 by Jacob Fox, Zoe Himwich, Fox, Jacob +3 · 1 citation
    Computer Science · Mathematics · #05C35 #05C38 #05D40 #Advanced Graph Theory Research #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Graph Labeling and Dimension Problems #Limits and Structures in Graph Theory
  5. From algorithms to connectivity and back: finding a giant component in random k-SAT
    2022/07/06 by Zongchen Chen, Chen, Zongchen, Nitya Mani +3 · 1 citation
    Computer Science · #68Q87 #68W20 #68W25 #68W40 #Complexity and Algorithms in Graphs #Constraint Satisfaction and Optimization #Data Structures and Algorithms (cs.DS) #F.2.2 #FOS: Computer and information sciences #G.3 #Logic, Reasoning, and Knowledge
  6. Fast sampling of satisfying assignments from random k-SAT with applications to connectivity
    2022/06/30 by Andreas Galanis, Chen, Zongchen, Galanis, Andreas +8 · 1 citation
    Computer Science · Mathematics · #68Q87 #68W20 #68W25 #68W40 #Bayesian Modeling and Causal Inference #Data Structures and Algorithms (cs.DS) #F.2.2 #FOS: Computer and information sciences #G.3 #Markov Chains and Monte Carlo Methods #Optimization and Search Problems
  7. A note on directed analogues of the Sidorenko and forcing conjectures
    2022/10/30 by Fox, Jacob, Himwich, Zoe, Mani, Nitya +1 · 1 citation
    #Combinatorics (math.CO) #FOS: Mathematics