Shweta Jain


University of Utah
shweta.jain@utah.edu
sjain12@ucsc.edu






Hello! My name is Shweta Jain. I am a Computing Innovation Fellow at the University of Utah, working with Prof. Blair Sullivan. Prior to this, I was a postdoc at the University of Illinois, Urbana-Champaign working with Prof. Hanghang Tong. I obtained a PhD in Computer Science from the University of California, Santa Cruz, where I was advised by Prof. Seshadhri Comandur. My research interests are in randomized and approximation algorithms, combinatorial optimization, graph mining, and algorithms for massive data. I am grateful to have received the SIGKDD Best Dissertation Runner-Up Award for 2021!

Publications and preprints

  • Covering maximal cliques in real-world graphs with dense subgraphs
    Shweta Jain, Sabyasachi Basu, Haim Kaplan, Jakub Łącki, Blair D. Sullivan
    Extended Abstract accepted at SIAM Conference on Applied and Computational Discrete Algorithms (ACDA), 2025

  • An O(k)-Approximate Kernel for Directed Feedback Vertex Set
    Shweta Jain, Blair D. Sullivan
    preprint, 2024

  • Optimizing Information Access in Networks via Edge Augmentation
    Aditya Bhaskara, Alex Crane, Shweta Jain, Md. Mumtahin Habib Ullah Mazumder, Blair D. Sullivan, Prasanth Yalamanchili
    preprint, 2024
    arxiv

  • Counting cycles in real-world graphs
    Shweta Jain
    preprint, 2024

  • An Exponentially Smaller Kernel for Exact Weighted Clique Decomposition
    Shweta Jain, Yosuke Mizutani, Blair D. Sullivan
    ACDA, 2023
    arxiv

  • YACC: A Framework Generalizing TuránShadow for Counting Large Cliques
    Shweta Jain, Hanghang Tong
    SDM, 2022
    pdf

  • FPT Algorithms for Finding Near-Cliques in c-Closed Graphs
    Balaram Behera, Edin Husić, Shweta Jain, Tim Roughgarden, C. Seshadhri
    ITCS, 2022
    pdf

  • Provably and Efficiently Approximating Near-cliques using the Turán Shadow: PEANUTS
    Shweta Jain, C. Seshadhri
    The Web Conference (formerly WWW), 2020
    The Web Conf       code

  • Using Cliques with Higher-order Spectral Embeddings Improves Graph Visualizations
    Huda Nassar, David Gleich, Austin Benson, Shweta Jain, Caitlin Kennedy
    The Web Conference (formerly WWW), 2020
    pdf       The Web Conf       code

  • The power of pivoting for exact clique counting
    Shweta Jain, C. Seshadhri
    WSDM, 2020 (Best paper)
    Foundations of Data Science Workshop, GeorgiaTech, Atlanta, 2019 (Best Poster)
    arxiv       WSDM       code

  • Provable and practical approximations for the degree distribution using sublinear graph samples
    Talya Eden, Shweta Jain, Ali Pinar, Dana Ron, C. Seshadhri
    The Web Conference (formerly WWW), 2018
    arxiv       The Web Conf       code

  • A Fast and Provable Method for Estimating Clique Counts Using Turán’s Theorem
    Shweta Jain, C. Seshadhri
    World Wide Web (WWW), 2017 (Best paper)
    arxiv       WWW       code

Honors and Awards

  • SIGKDD Best Dissertation Award Runner-Up, 2021
  • Computing Innovation Fellowship, 2021
  • CSE Best Dissertation Award, UCSC, 2020
  • Selected for Rising Stars Workshop, Berkeley, 2020
  • Best Paper Award, WSDM 2020
  • Best Poster Award, Foundations of Data Science Workshop held at GeorgiaTech, Atlanta, 2019
  • BSOE Dissertation Year Fellowship, 2018-19
  • Best Paper Award, WWW 2017
  • Regents Fellowship, 2014-15

CV

You can download a copy of my CV here.