Manuel R. Torres

TL;DR: New dynamic set intersection data structures, which are called 2-3 cuckoo filters and hash tables, are introduced, demonstrating the utility of these structures by using them in improved algorithms for listing triangles and answering set intersection queries in internal or external memory.

TL;DR: In this paper , the densest supermodular subset problem (DSS) was studied via the lens of supermodularity and a simple flow-based algorithm was proposed to obtain a (1 −∊)-approximation in deterministic Õ(m/∊) time where m is the number of edges.

TL;DR: This work characterizes the feasibility of graph watermarking in terms of keygen, marking, and identification functions defined over graph families with known distributions, and demonstrates the strength of this approach with exemplary watermarked schemes for two random graph models, the classic Erd\H{o}s-R\'{e}nyi model and a random power-law graph model, both of which are used to model real-world networks.

TL;DR: In this article, the feasibility of graph watermarking is investigated in terms of keygen, marking, and identification functions defined over graph families with known distributions. And the authors demonstrate the strength of this approach with exemplary water-marking schemes for two random graph models, the classic Erdős-Renyi model and a random power-law graph model, both of which are used to model real-world networks.

TL;DR: A fast near-linear time implementation of swap-rounding in the spanning tree polytope of a graph and a fractional solution that can be used to sparsify the input graph and lead to significantly faster approximation algorithms than known before.