Author of the publication

Densest Subgraph in Dynamic Graph Streams.

, , , and . MFCS (2), volume 9235 of Lecture Notes in Computer Science, page 472-482. Springer, (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

A Simple, Space-Efficient, Streaming Algorithm for Matchings in Low Arboricity Graphs., and . SOSA, volume 61 of OASIcs, page 14:1-14:4. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)A Note on Logarithmic Space Stream Algorithms for Matchings in Low Arboricity Graphs., and . CoRR, (2016)Storage Capacity as an Information-Theoretic Vertex Cover and the Index Coding Rate., , and . IEEE Trans. Inf. Theory, 65 (9): 5580-5591 (2019)The Complexity of Counting Cycles in the Adjacency List Streaming Model., , , and . PODS, page 119-133. ACM, (2019)Vertex Ordering Problems in Directed Graph Streams., , , and . CoRR, (2021)Triangle and Four Cycle Counting in the Data Stream Model., and . PODS, page 445-456. ACM, (2020)Better Algorithms for Counting Triangles in Data Streams., , and . PODS, page 401-411. ACM, (2016)Structural Results on Matching Estimation with Applications to Streaming., , , , , , and . Algorithmica, 81 (1): 367-392 (2019)Improved 3-pass Algorithm for Counting 4-cycles in Arbitrary Order Streaming.. CoRR, (2020)Vertex Ordering Problems in Directed Graph Streams., , , and . SODA, page 1786-1802. SIAM, (2020)