Author of the publication

Unconstrained Submodular Maximization with Modular Costs: Tight Approximation and Application to Profit Maximization.

, , , , , and . Proc. VLDB Endow., 14 (10): 1756-1768 (2021)

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

FORA: Simple and Effective Approximate Single-Source Personalized PageRank., , , , and . KDD, page 505-514. ACM, (2017)Anomaly Detection in Financial Transactions Via Graph-Based Feature Aggregations., , and . DaWaK, volume 14148 of Lecture Notes in Computer Science, page 64-79. Springer, (2023)Efficient and Effective Similarity Search over Bipartite Graphs.. WWW, page 308-318. ACM, (2022)Realtime Index-Free Single Source SimRank Processing on Web-Scale Graphs., , , , and . CoRR, (2020)Effective Edge-wise Representation Learning in Edge-Attributed Bipartite Graphs., , and . KDD, page 3081-3091. ACM, (2024)Efficient and scalable techniques for pagerank-based graph analytics. Nanyang Technological University, Singapore, (2020)LSCALE: Latent Space Clustering-Based Active Learning for Node Classification., , , , and . ECML/PKDD (1), volume 13713 of Lecture Notes in Computer Science, page 55-70. Springer, (2022)Node-wise Diffusion for Scalable Graph Learning., , , , and . WWW, page 1723-1733. ACM, (2023)No PANE, No Gain: Scaling Attributed Network Embedding in a Single Server., , , , , and . SIGMOD Rec., 51 (1): 42-49 (2022)Efficient and Effective Edge-wise Graph Representation Learning., , , and . KDD, page 2326-2336. ACM, (2023)