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

Better Streaming Algorithms for the Maximum Coverage Problem., and . ICDT, volume 68 of LIPIcs, page 22:1-22:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Better Streaming Algorithms for the Maximum Coverage Problem., and . CoRR, (2016)On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition., , and . SIAM J. Discret. Math., 37 (2): 800-830 (June 2023)Towards Better Bounds for Finding Quasi-Identifiers., , , and . PODS, page 155-167. ACM, (2023)Densest Subgraph in Dynamic Graph Streams., , , and . MFCS (2), volume 9235 of Lecture Notes in Computer Science, page 472-482. Springer, (2015)Better Streaming Algorithms for the Maximum Coverage Problem., and . Theory Comput. Syst., 63 (7): 1595-1619 (2019)Towards Better Bounds for Finding Quasi-Identifiers., , , and . CoRR, (2022)On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition., , and . PODC, page 295-305. ACM, (2021)Maximum Coverage in the Data Stream Model: Parameterized and Generalized., , and . ICDT, volume 186 of LIPIcs, page 12:1-12:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Revisiting maximum satisfiability and related problems in data streams.. Theor. Comput. Sci., (January 2024)