On Directed Tree Realizations of Degree Sets. - Prasun Kumar; Jayalal Sarma; Saurabh Sawlani (WALCOM, 2013)

Polynomial Min/Max-weighted Reachability is in Unambiguous Log-space. - Anant Dhayal; Jayalal Sarma; Saurabh Sawlani (FSTTCS, 2014)

Reversible Pebble Game on Trees. - Balagopal Komarath; Jayalal Sarma; Saurabh Sawlani (COCOON, 2015)

Density Independent Algorithms for Sparsifying k-Step Random Walks. - Gorav Jindal; Pavel Kolev; Richard Peng; Saurabh Sawlani (APPROX-RANDOM, 2017)

$ ell_1$ Regression using Lewis Weights Preconditioning. - David Durfee; Kevin A. Lai; Saurabh Sawlani (CoRR, 2017)

On Computing Min-Degree Elimination Orderings. - Matthew Fahrbach; Gary L. Miller; Richard Peng; Saurabh Sawlani; Junxing Wang; Shen Chen Xu (CoRR, 2017)

Min/Max-Poly Weighting Schemes and the NL versus UL Problem. - Anant Dhayal; Jayalal Sarma; Saurabh Sawlani (ACM Trans. Comput. Theory, 2017)

$ ell_1$ Regression using Lewis Weights Preconditioning and Stochastic Gradient Descent. - David Durfee; Kevin A. Lai; Saurabh Sawlani (COLT, 2018)

Graph Sketching against Adaptive Adversaries Applied to the Minimum Degree Algorithm. - Matthew Fahrbach; Gary L. Miller; Richard Peng; Saurabh Sawlani; Junxing Wang; Shen Chen Xu (FOCS, 2018)

Pebbling meets coloring: Reversible pebble game on trees. - Balagopal Komarath; Jayalal Sarma; Saurabh Sawlani (J. Comput. Syst. Sci., 2018)

Faster width-dependent algorithm for mixed packing and covering LPs. - Digvijay Boob; Saurabh Sawlani; Di Wang (NeurIPS, 2019)

AutoER: Automated Entity Resolution using Generative Modelling. - Renzhi Wu; Sanya Chaba; Saurabh Sawlani; Xu Chu 002; Saravanan Thirumuruganathan (CoRR, 2019)

ZeroER: Entity Resolution using Zero Labeled Examples. - Renzhi Wu; Sanya Chaba; Saurabh Sawlani; Xu Chu 002; Saravanan Thirumuruganathan (SIGMOD Conference, 2020)

Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds. - Laxman Dhulipala; David Durfee; Janardhan Kulkarni; Richard Peng; Saurabh Sawlani; Xiaorui Sun (SODA, 2020)

Near-optimal fully dynamic densest subgraph. - Saurabh Sawlani; Junxing Wang (STOC, 2020)

Flowless: Extracting Densest Subgraphs Without Flow Computations. - Digvijay Boob; Yu Gao 001; Richard Peng; Saurabh Sawlani; Charalampos E. Tsourakakis; Di Wang 005; Junxing Wang (WWW, 2020)

A Study of Performance of Optimal Transport. - Yihe Dong; Yu Gao 001; Richard Peng; Ilya P. Razenshteyn; Saurabh Sawlani (CoRR, 2020)

Dual Algorithms for the Densest Subgraph Problem. - Saurabh Sawlani (2020)

Fast Attributed Graph Embedding via Density of States. - Saurabh Sawlani; Lingxiao Zhao; Leman Akoglu (ICDM, 2021)

Graph Anomaly Detection with Unsupervised GNNs. - Lingxiao Zhao; Saurabh Sawlani; Arvind Srinivasan 002; Leman Akoglu (CoRR, 2022)

Density of states for fast embedding node-attributed graphs. - Lingxiao Zhao; Saurabh Sawlani; Leman Akoglu (Knowl. Inf. Syst., 2023)

Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions. - Timothy Chu; Yu Gao 001; Richard Peng; Sushant Sachdeva; Saurabh Sawlani; Junxing Wang (SIAM J. Comput., 2023)