4 citations · 10 across the 11 of their papers we have counts for
14 papers
Fast and Simple Densest Subgraph with Predictions
Thai Bui, Luan Nguyen, Hoa T. Vu
We study the densest subgraph problem and its NP-hard densest at-most- subgraph variant through the lens of learning-augmented algorithms. We show that, given a reasonably accur…
Massively Parallel Maximum Coverage Revisited
Thai Bui, Hoa T. Vu
We study the maximum set coverage problem in the massively parallel model. In this setting, sets that are subsets of a universe of elements are distributed among machin…
Towards Better Bounds for Finding Quasi-Identifiers
Ryan Hildebrant, Quoc-Tung Le, Duy-Hoang Ta +1
We revisit the problem of finding small -separation keys introduced by Motwani and Xu (2008). In this problem, the input is -dimensional tuples . The goa…
Revisiting Maximum Satisfiability and Related Problems in Data Streams
Hoa T. Vu
We revisit the MaxSAT problem in the data stream model. In this problem, the stream consists of clauses that are disjunctions of literals drawn from Boolean variables. The…
Maximum Coverage in the Data Stream Model: Parameterized and Generalized
Andrew McGregor, David Tench, Hoa T. Vu
We present algorithms for the Max-Cover and Max-Unique-Cover problems in the data stream model. The input to both problems are subsets of a universe of size and a value $k\…
On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition
David G. Harris, Hsin-Hao Su, Hoa T. Vu
Given a graph with arboricity , we study the problem of decomposing the edges of into disjoint forests in the distributed LOCAL model. Barenboim and Elkin…