No. Title Author Year
1 When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time Assadi, Sepehr et al. 2019
2 A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling Assadi, Sepehr et al. 2018
3 Towards a Unified Theory of Sparsification for Matching Problems Assadi, Sepehr et al. 2018
4 Algorithms for Provisioning Queries and Analytics Assadi, Sepehr et al. 2016
5 Dynamic Sketching for Graph Optimization Problems with Applications to Cut-Preserving Sketches Assadi, Sepehr et al. 2015
Current Page :
Number of result pages: 1
Number of documents: 5


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI