Author of the publication

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

Leveraging set relations in exact and dynamic set similarity join., , , , and . VLDB J., 28 (2): 267-292 (2019)Efficient Maximum k-Defective Clique Computation with Improved Time Complexity.. Proc. ACM Manag. Data, 1 (3): 209:1-209:26 (September 2023)Maximum Defective Clique Computation: Improved Time Complexities and Practical Performance.. CoRR, (2024)Deconstruct Densest Subgraphs., and . WWW, page 2747-2753. ACM / IW3C2, (2020)Computing Maximum Independent Sets over Large Sparse Graphs., and . WISE, volume 11881 of Lecture Notes in Computer Science, page 711-727. Springer, (2019)Computing Maximum Structural Balanced Cliques in Signed Graphs., , and . ICDE, page 1004-1016. IEEE, (2022)Cohesive Subgraph Computation Over Large Sparse Graphs., and . ICDE, page 2068-2071. IEEE, (2019)Enumerating k-Vertex Connected Components in Large Graphs., , , , and . ICDE, page 52-63. IEEE, (2019)Efficient Closest Community Search over Large Graphs., and . DASFAA (2), volume 12113 of Lecture Notes in Computer Science, page 569-587. Springer, (2020)Efficient Sink-Reachability Analysis via Graph Reduction., , , , , and . IEEE Trans. Knowl. Data Eng., 34 (11): 5321-5335 (2022)