Research

Publications

  • Saurabh Sawlani, Lingxiao Zhao, Leman Akoglu.
    Fast Attributed Graph Embedding via Density of States.
    ICDM 2021. [arXiv][Project page]

  • Saurabh Sawlani, Junxing Wang.
    Near-optimal Fully Dynamic Densest Subgraph.
    STOC 2020. [arXiv]

  • Renzhi Wu, Sanya Chaba, Saurabh Sawlani, Xu Chu, Saravanan Thirumuruganathan..
    ZeroER: Entity Resolution using Zero Labeled Examples.
    SIGMOD 2020. [arXiv]

  • Digvijay Boob, Yu Gao, Richard Peng, Saurabh Sawlani, Charalampos E. Tsourakakis, Di Wang, Junxing Wang.
    Greedy++: An Iterative Peeling Algorithm for Dense Subgraph Discovery.
    TheWebConf (WWW) 2020. [arXiv]

  • Yihe Dong, Yu Gao, Richard Peng, Ilya Razenshteyn, Saurabh Sawlani.
    A Study of Performance of Optimal Transport.
    CSC 2020. [arXiv]
    Prelimiary version appeared in OTML 2019.

  • Laxman Dhulipala, David Durfee, Janardhan Kulkarni, Richard Peng, Saurabh Sawlani, Xiaorui Sun.
    Parallel Batch-dynamic Graphs: Algorithms and Lower Bounds.
    SODA 2020. [arXiv]

  • Digvijay Boob, Saurabh Sawlani, Di Wang.
    Faster Width-dependent Algorithm for Mixed Packing and Covering LPs.
    NeurIPS 2019 (oral). [arXiv]

  • Timothy Chu, Yu Gao, Richard Peng, Sushant Sachdeva, Saurabh Sawlani, Junxing Wang.
    Graph Sparsification, Spectral Sketches, and Faster Resistance Computation, via Short Cycle Decompositions.
    FOCS 2018.
    Invited to SICOMP Special Edition for FOCS 2018. [arXiv]

  • Matthew Fahrbach, Gary L. Miller, Richard Peng, Saurabh Sawlani, Junxing Wang, Shen Chen Xu.
    Graph Sketching Against Adaptive Adversaries Applied to the Minimum Degree Algorithm.
    FOCS 2018. [arXiv]

  • David Durfee, Kevin A. Lai, Saurabh Sawlani.
    L1 Regression using Lewis Weights Preconditioning and Stochastic Gradient Descent.
    COLT 2018. [arXiv]

  • Gorav Jindal, Pavel Kolev, Richard Peng, Saurabh Sawlani.
    Density Independent Algorithms for Sparsifying k-Step Random Walks.
    APPROX 2017. [arXiv]

  • Anant Dhayal, Jayalal Sarma M.N., Saurabh Sawlani.
    Min/Max-Poly Weighting Schemes and the NL vs. UL Problem.
    In ACM Transactions on Computation Theory, Mar 2017.
    Preliminary version in FSTTCS 2014. [PDF]

  • Balagopal Komarath, Jayalal Sarma M.N., Saurabh Sawlani.
    Pebbling Meets Coloring: Reversible Pebble Game On Trees.
    In Journal of Computer and System Sciences, Feb 2018.
    Prelimiary version in COCOON 2015. [arXiv]

  • Prasun Kumar, Jayalal Sarma M.N., Saurabh Sawlani.
    On Directed Tree Realisations of Degree Sets.
    WALCOM 2013. [PDF]