default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSaurabh Sawlani
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j4]Lingxiao Zhao, Saurabh Sawlani, Leman Akoglu:
Density of states for fast embedding node-attributed graphs. Knowl. Inf. Syst. 65(6): 2455-2483 (2023)- [j3]Timothy Chu, Yu Gao, Richard Peng, Sushant Sachdeva, Saurabh Sawlani, Junxing Wang:
Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions. SIAM J. Comput. 52(6): S18-85 (2023) - 2022
- [i15]Lingxiao Zhao, Saurabh Sawlani, Arvind Srinivasan, Leman Akoglu:
Graph Anomaly Detection with Unsupervised GNNs. CoRR abs/2210.09535 (2022) - 2021
- [c13]Saurabh Sawlani, Lingxiao Zhao, Leman Akoglu:
Fast Attributed Graph Embedding via Density of States. ICDM 2021: 559-568 - [i14]Saurabh Sawlani, Lingxiao Zhao, Leman Akoglu:
Fast Attributed Graph Embedding via Density of States. CoRR abs/2110.05228 (2021) - 2020
- [b1]Saurabh Sawlani:
Dual Algorithms for the Densest Subgraph Problem. Georgia Institute of Technology, Atlanta, GA, USA, 2020 - [c12]Renzhi Wu
, Sanya Chaba, Saurabh Sawlani, Xu Chu, Saravanan Thirumuruganathan:
ZeroER: Entity Resolution using Zero Labeled Examples. SIGMOD Conference 2020: 1149-1164 - [c11]Laxman Dhulipala, David Durfee, Janardhan Kulkarni, Richard Peng, Saurabh Sawlani, Xiaorui Sun:
Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds. SODA 2020: 1300-1319 - [c10]Saurabh Sawlani, Junxing Wang:
Near-optimal fully dynamic densest subgraph. STOC 2020: 181-193 - [c9]Digvijay Boob, Yu Gao, Richard Peng, Saurabh Sawlani, Charalampos E. Tsourakakis, Di Wang, Junxing Wang:
Flowless: Extracting Densest Subgraphs Without Flow Computations. WWW 2020: 573-583 - [i13]Yihe Dong, Yu Gao, Richard Peng, Ilya P. Razenshteyn, Saurabh Sawlani:
A Study of Performance of Optimal Transport. CoRR abs/2005.01182 (2020)
2010 – 2019
- 2019
- [c8]Digvijay Boob, Saurabh Sawlani, Di Wang:
Faster width-dependent algorithm for mixed packing and covering LPs. NeurIPS 2019: 15253-15262 - [i12]Saurabh Sawlani, Junxing Wang:
Near-Optimal Fully Dynamic Densest Subgraph. CoRR abs/1907.03037 (2019) - [i11]David Durfee, Laxman Dhulipala, Janardhan Kulkarni, Richard Peng, Saurabh Sawlani, Xiaorui Sun:
Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds. CoRR abs/1908.01956 (2019) - [i10]Renzhi Wu, Sanya Chaba, Saurabh Sawlani, Xu Chu, Saravanan Thirumuruganathan:
AutoER: Automated Entity Resolution using Generative Modelling. CoRR abs/1908.06049 (2019) - [i9]Digvijay Boob, Saurabh Sawlani, Di Wang:
Faster width-dependent algorithm for mixed packing and covering LPs. CoRR abs/1909.12387 (2019) - [i8]Digvijay Boob, Yu Gao, Richard Peng, Saurabh Sawlani, Charalampos E. Tsourakakis, Di Wang, Junxing Wang:
Flowless: Extracting Densest Subgraphs Without Flow Computations. CoRR abs/1910.07087 (2019) - 2018
- [j2]Balagopal Komarath, Jayalal Sarma, Saurabh Sawlani:
Pebbling meets coloring: Reversible pebble game on trees. J. Comput. Syst. Sci. 91: 33-41 (2018) - [c7]David Durfee, Kevin A. Lai, Saurabh Sawlani:
$\ell_1$ Regression using Lewis Weights Preconditioning and Stochastic Gradient Descent. COLT 2018: 1626-1656 - [c6]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: 101-112 - [c5]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: 361-372 - [i7]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. CoRR abs/1804.04239 (2018) - [i6]Timothy Chu, Yu Gao, Richard Peng, Sushant Sachdeva, Saurabh Sawlani, Junxing Wang:
Graph Sparsification, Spectral Sketches, and Faster Resistance Computation, via Short Cycle Decompositions. CoRR abs/1805.12051 (2018) - 2017
- [j1]Anant Dhayal, Jayalal Sarma, Saurabh Sawlani:
Min/Max-Poly Weighting Schemes and the NL versus UL Problem. ACM Trans. Comput. Theory 9(2): 10:1-10:25 (2017) - [c4]Gorav Jindal, Pavel Kolev, Richard Peng, Saurabh Sawlani:
Density Independent Algorithms for Sparsifying k-Step Random Walks. APPROX-RANDOM 2017: 14:1-14:17 - [i5]Gorav Jindal, Pavel Kolev, Richard Peng, Saurabh Sawlani:
Density Independent Algorithms for Sparsifying k-Step Random Walks. CoRR abs/1702.06110 (2017) - [i4]David Durfee, Kevin A. Lai, Saurabh Sawlani:
$\ell_1$ Regression using Lewis Weights Preconditioning. CoRR abs/1708.07821 (2017) - [i3]Matthew Fahrbach, Gary L. Miller, Richard Peng, Saurabh Sawlani, Junxing Wang, Shen Chen Xu:
On Computing Min-Degree Elimination Orderings. CoRR abs/1711.08446 (2017) - 2016
- [i2]Balagopal Komarath, Jayalal Sarma, Saurabh Sawlani:
Pebbling Meets Coloring: Reversible Pebble Game On Trees. CoRR abs/1604.05510 (2016) - [i1]Balagopal Komarath, Jayalal Sarma, Saurabh Sawlani:
Pebbling Meets Coloring : Reversible Pebble Game On Trees. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [c3]Balagopal Komarath, Jayalal Sarma, Saurabh Sawlani:
Reversible Pebble Game on Trees. COCOON 2015: 83-94 - 2014
- [c2]Anant Dhayal, Jayalal Sarma, Saurabh Sawlani:
Polynomial Min/Max-weighted Reachability is in Unambiguous Log-space. FSTTCS 2014: 597-609 - 2013
- [c1]Prasun Kumar, Jayalal Sarma, Saurabh Sawlani:
On Directed Tree Realizations of Degree Sets. WALCOM 2013: 274-285
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
