Are communities as strong as we think? - Md Abdul Alim; Alan Kuhnle; My T. Thai (ASONAM, 2014)

Online Algorithms for Optimal Resource Management in Dynamic D2D Communications. - Alan Kuhnle; Xiang Li 016; My T. Thai (MSN, 2014)

Rate alteration attacks in smart grid. - Subhankar Mishra; Xiang Li 016; Alan Kuhnle; My T. Thai; Jungtaek Seo (INFOCOM, 2015)

Detecting misinformation in online social networks before it is too late. - Huiling Zhang; Alan Kuhnle; Huiyuan Zhang; My T. Thai (ASONAM, 2016)

Profit maximization for multiple products in online social networks. - Huiyuan Zhang; Huiling Zhang; Alan Kuhnle; My T. Thai (INFOCOM, 2016)

Scalable and Adaptive Algorithms for the Triangle Interdiction Problem on Billion-Scale Networks. - Alan Kuhnle; Victoria G. Crawford; My T. Thai (ICDM, 2017)

Dynamic Propagation Rates: New Dimension to Viral Marketing in Online Social Networks. - Tianyi Pan; Alan Kuhnle; Xiang Li 016; My T. Thai (ICDM, 2017)

Scalable bicriteria algorithms for the threshold activation problem in online social networks. - Alan Kuhnle; Tianyi Pan; Md Abdul Alim; My T. Thai (INFOCOM, 2017)

Pseudo-Separation for Assessment of Structural Vulnerability of a Network. - Alan Kuhnle; Tianyi Pan; Victoria G. Crawford; Md Abdul Alim; My T. Thai (SIGMETRICS (Abstracts), 2017)

Popular Topics Spread Faster: New Dimension for Influence Propagation in Online Social Networks. - Tianyi Pan; Alan Kuhnle; Xiang Li 016; My T. Thai (CoRR, 2017)

Online set multicover algorithms for dynamic D2D communications. - Alan Kuhnle; Xiang Li 016; J. David Smith; My T. Thai (J. Comb. Optim., 2017)

Vulnerability of clustering under node failure in complex networks. - Alan Kuhnle; Nam P. Nguyen; Thang N. Dinh; My T. Thai (Soc. Netw. Anal. Min., 2017)

Price Modification Attack and Protection Scheme in Smart Grid. - Subhankar Mishra; Xiang Li 016; Tianyi Pan; Alan Kuhnle; My T. Thai; Jungtaek Seo (IEEE Trans. Smart Grid, 2017)

Fight Under Uncertainty: Restraining Misinformation and Pushing out the Truth. - Huiling Zhang; Alan Kuhnle; J. David Smith; My T. Thai (ASONAM, 2018)

An Approximately Optimal Bot for Non-Submodular Social Reconnaissance. - J. David Smith; Alan Kuhnle; My T. Thai (HT, 2018)

Vulnerability of Interdependent Networks with Heterogeneous Cascade Models and Timescales. - Tianyi Pan; Alan Kuhnle; Xiang Li 016; My T. Thai (ICDCS, 2018)

Fast Maximization of Non-Submodular, Monotonic Functions on the Integer Lattice. - Alan Kuhnle; J. David Smith; Victoria G. Crawford; My T. Thai (ICML, 2018)

Space-Efficient and Dynamic Caching for D2D Networks of Heterogeneous Users. - Victoria G. Crawford; Alan Kuhnle; Md Abdul Alim; My T. Thai (MASS, 2018)

Recoloring the Colored de Bruijn Graph. - Bahar Alipanahi; Alan Kuhnle; Christina Boucher 001 (SPIRE, 2018)

Prefix-Free Parsing for Building Big BWTs. - Christina Boucher 001; Travis Gagie; Alan Kuhnle; Giovanni Manzini (WABI, 2018)

Practical dynamic de Bruijn graphs. - Victoria G. Crawford; Alan Kuhnle; Christina Boucher 001; Rayan Chikhi; Travis Gagie (Bioinform., 2018)

Network Resilience and the Length-Bounded Multicut Problem: Reaching the Dynamic Billion-Scale with Guarantees. - Alan Kuhnle; Victoria G. Crawford; My T. Thai (Proc. ACM Meas. Anal. Comput. Syst., 2018)

Multiplex Influence Maximization in Online Social Networks With Heterogeneous Diffusion Models. - Alan Kuhnle; Md Abdul Alim; Xiang Li 016; Huiling Zhang; My T. Thai (IEEE Trans. Comput. Soc. Syst., 2018)

Submodular Cost Submodular Cover with an Approximate Oracle. - Victoria G. Crawford; Alan Kuhnle; My T. Thai (ICML, 2019)

Interlaced Greedy Algorithm for Maximization of Submodular Functions in Nearly Linear Time. - Alan Kuhnle (NeurIPS, 2019)

Prefix-free parsing for building big BWTs. - Christina Boucher 001; Travis Gagie; Alan Kuhnle; Ben Langmead; Giovanni Manzini; Taher Mun (Algorithms Mol. Biol., 2019)

Nearly Linear-Time, Deterministic Algorithm for Maximizing (Non-Monotone) Submodular Functions Under Cardinality Constraint. - Alan Kuhnle (CoRR, 2019)

A Note on Submodular Maximization over Independence Systems. - Alan Kuhnle (CoRR, 2019)

Fast Evolutionary Algorithms for Maximization of Cardinality-Constrained Weakly Submodular Functions. - Victoria G. Crawford; Alan Kuhnle (CoRR, 2019)

Scalable approximations to k-cycle transversal problems on dynamic networks. - Alan Kuhnle; Victoria G. Crawford; My T. Thai (Knowl. Inf. Syst., 2019)

Efficient Construction of a Complete Index for Pan-Genomics Read Alignment. - Alan Kuhnle; Taher Mun; Christina Boucher 001; Travis Gagie; Ben Langmead; Giovanni Manzini (J. Comput. Biol., 2020)

Matching Reads to Many Genomes with the r-Index. - Taher Mun; Alan Kuhnle; Christina Boucher 001; Travis Gagie; Ben Langmead; Giovanni Manzini (J. Comput. Biol., 2020)

Influence Diffusion in Online Social Networks With Propagation Rate Changes. - Tianyi Pan; Xiang Li 016; Alan Kuhnle; My T. Thai (IEEE Trans. Netw. Sci. Eng., 2020)

Nearly Linear-Time, Parallelizable Algorithms for Non-Monotone Submodular Maximization. - Alan Kuhnle (AAAI, 2021)

Quick Streaming Algorithms for Maximization of Monotone Submodular Functions in Linear Time. - Alan Kuhnle (AISTATS, 2021)

Best of Both Worlds: Practical and Theoretically Optimal Submodular Maximization in Parallel. - Yixin Chen 007; Tonmoy Dey; Alan Kuhnle (NeurIPS, 2021)

Streaming Algorithms for Cardinality-Constrained Maximization of Non-Monotone Submodular Functions in Linear Time. - Alan Kuhnle (CoRR, 2021)

Succinct dynamic de Bruijn graphs. - Bahar Alipanahi; Alan Kuhnle; Simon J. Puglisi; Leena Salmela; Christina Boucher 001 (Bioinform., 2021)

DASH: Distributed Adaptive Sequencing Heuristic for Submodular Maximization. - Tonmoy Dey; Yixin Chen 007; Alan Kuhnle (CoRR, 2022)

DASH: A Distributed and Parallelizable Algorithm for Size-Constrained Submodular Maximization. - Tonmoy Dey; Yixin Chen 007; Alan Kuhnle (AAAI, 2023)

Approximation Algorithms for Size-Constrained Non-Monotone Submodular Maximization in Deterministic Linear Time. - Yixin Chen 007; Alan Kuhnle (KDD, 2023)

Learning Strategic Value and Cooperation in Multi-Player Stochastic Games through Side Payments. - Alan Kuhnle; Jeffrey Richley; Darleen Perez-Lavin (CoRR, 2023)

RELS-DQN: A Robust and Efficient Local Search Framework for Combinatorial Optimization. - Yuanhang Shao; Tonmoy Dey; Nikola Vuckovic; Luke Van Popering; Alan Kuhnle (CoRR, 2023)

Unveiling the Limits of Learned Local Search Heuristics: Are You the Mightiest of the Meek? - Ankur Nath; Alan Kuhnle (CoRR, 2023)

Discretely beyond 1/e: Guided Combinatorial Algortihms for Submodular Maximization. - Yixin Chen 007; Ankur Nath; Chunli Peng; Alan Kuhnle (NeurIPS, 2024)

Discretely Beyond 1/e: Guided Combinatorial Algorithms for Submodular Maximization. - Yixin Chen 007; Ankur Nath; Chunli Peng; Alan Kuhnle (CoRR, 2024)

Submodular Maximization in Exactly n Queries. - Eric Balkanski; Steven DiSilvio; Alan Kuhnle (CoRR, 2024)

A Benchmark for Maximum Cut: Towards Standardization of the Evaluation of Learned Heuristics for Combinatorial Optimization. - Ankur Nath; Alan Kuhnle (CoRR, 2024)

Scalable Distributed Algorithms for Size-Constrained Submodular Maximization in the MapReduce and Adaptive Complexity Models. - Yixin Chen 007; Tonmoy Dey; Alan Kuhnle (J. Artif. Intell. Res., 2024)

Practical and Parallelizable Algorithms for Non-Monotone Submodular Maximization with Size Constraint. - Yixin Chen 007; Alan Kuhnle (J. Artif. Intell. Res., 2024)

Theoretically Grounded Pruning of Large Ground Sets for Constrained, Discrete Optimization. - Ankur Nath; Alan Kuhnle (AISTATS, 2025)

MaxCutBench: Revisiting and Benchmarking Graph Neural Networks for Maximum Cut. - Ankur Nath; Alan Kuhnle (Trans. Mach. Learn. Res., 2025)

Breaking Barriers: Combinatorial Algorithms for Non-monotone Submodular Maximization with Sublinear Adaptivity and 1/e Approximation. - Yixin Chen 007; Wenjing Chen; Alan Kuhnle (CoRR, 2025)

ResQue Greedy: Rewiring Sequential Greedy for Improved Submodular Maximization. - Joan Vendrell; Alan Kuhnle; Solmaz S. Kia (CoRR, 2025)

Bicriteria Submodular Maximization. - Moran Feldman; Alan Kuhnle (CoRR, 2025)