Densest Subgraph: Supermodularity, Iterative Peeling, and Flow C Chekuri, K Quanrud, MR Torres
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
38 2022 2-3 cuckoo filters for faster triangle listing and set intersection D Eppstein, MT Goodrich, M Mitzenmacher, MR Torres
Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2017
32 2017 Models and algorithms for graph watermarking D Eppstein, MT Goodrich, J Lam, N Mamano, M Mitzenmacher, M Torres
International Conference on Information Security, 283-301, 2016
14 2016 On the Generalized Mean Densest Subgraph Problem: Complexity and Algorithms C Chekuri, MR Torres
arXiv preprint arXiv:2306.02172, 2023
3 2023 Fast Approximation Algorithms for Bounded Degree and Crossing Spanning Tree Problems C Chekuri, K Quanrud, MR Torres
arXiv preprint arXiv:2011.03194, 2020
3 2020 ℓ1 -Sparsity approximation bounds for packing integer programsC Chekuri, K Quanrud, MR Torres
Mathematical Programming, 1-20, 2020
3 2020 Geometric Fingerprint Recognition via Oriented Point-Set Pattern Matching D Eppstein, MT Goodrich, J Jorgensen, MR Torres
arXiv preprint arXiv:1808.00561, 2018
2 2018 A topological algorithm for determining how road networks evolve over time MT Goodrich, S Gupta, MR Torres
Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances …, 2016
2 2016 Models and algorithms for graph watermarking M Mitzenmacher, M Torres
Information Security: 19th International Conference, ISC 2016, Honolulu, HI …, 2016
2 2016 Knuthian Drawings of Series-Parallel Flowcharts MT Goodrich, T Johnson, M Torres
International Symposium on Graph Drawing, 556-557, 2015
2015