default search action
Alan Kuhnle
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j14]Yixin Chen, Alan Kuhnle:
Practical and Parallelizable Algorithms for Non-Monotone Submodular Maximization with Size Constraint. J. Artif. Intell. Res. 79: 599-637 (2024) - [j13]Yixin Chen, Tonmoy Dey, Alan Kuhnle:
Scalable Distributed Algorithms for Size-Constrained Submodular Maximization in the MapReduce and Adaptive Complexity Models. J. Artif. Intell. Res. 80: 1575-1622 (2024) - [i24]Yixin Chen, Ankur Nath, Chunli Peng, Alan Kuhnle:
Discretely Beyond 1/e: Guided Combinatorial Algorithms for Submodular Maximization. CoRR abs/2405.05202 (2024) - [i23]Eric Balkanski, Steven DiSilvio, Alan Kuhnle:
Submodular Maximization in Exactly n Queries. CoRR abs/2406.00148 (2024) - [i22]Ankur Nath, Alan Kuhnle:
A Benchmark for Maximum Cut: Towards Standardization of the Evaluation of Learned Heuristics for Combinatorial Optimization. CoRR abs/2406.11897 (2024) - [i21]Ankur Nath, Alan Kuhnle:
Theoretically Grounded Pruning of Large Ground Sets for Constrained, Discrete Optimization. CoRR abs/2410.17945 (2024) - 2023
- [c25]Tonmoy Dey, Yixin Chen, Alan Kuhnle:
DASH: A Distributed and Parallelizable Algorithm for Size-Constrained Submodular Maximization. AAAI 2023: 3941-3948 - [c24]Yixin Chen
, Alan Kuhnle
Approximation Algorithms for Size-Constrained Non-Monotone Submodular Maximization in Deterministic Linear Time. KDD 2023: 250-261 - [i20]Alan Kuhnle, Jeffrey Richley, Darleen Perez-Lavin:
Learning Strategic Value and Cooperation in Multi-Player Stochastic Games through Side Payments. CoRR abs/2303.05307 (2023) - [i19]Yuanhang Shao, Tonmoy Dey, Nikola Vuckovic, Luke Van Popering, Alan Kuhnle:
RELS-DQN: A Robust and Efficient Local Search Framework for Combinatorial Optimization. CoRR abs/2304.06048 (2023) - [i18]Ankur Nath, Alan Kuhnle:
Unveiling the Limits of Learned Local Search Heuristics: Are You the Mightiest of the Meek? CoRR abs/2310.19990 (2023) - 2022
- [i17]Tonmoy Dey, Yixin Chen, Alan Kuhnle:
DASH: Distributed Adaptive Sequencing Heuristic for Submodular Maximization. CoRR abs/2206.09563 (2022) - 2021
- [j12]Bahar Alipanahi, Alan Kuhnle, Simon J. Puglisi
Succinct dynamic de Bruijn graphs. Bioinform. 37(14): 1946-1952 (2021) - [c23]Alan Kuhnle:
Nearly Linear-Time, Parallelizable Algorithms for Non-Monotone Submodular Maximization. AAAI 2021: 8200-8208 - [c22]Alan Kuhnle:
Quick Streaming Algorithms for Maximization of Monotone Submodular Functions in Linear Time. AISTATS 2021: 1360-1368 - [c21]Yixin Chen, Tonmoy Dey, Alan Kuhnle:
Best of Both Worlds: Practical and Theoretically Optimal Submodular Maximization in Parallel. NeurIPS 2021: 25528-25539 - [i16]Alan Kuhnle:
Streaming Algorithms for Cardinality-Constrained Maximization of Non-Monotone Submodular Functions in Linear Time. CoRR abs/2104.06873 (2021) - [i15]Yixin Chen, Tonmoy Dey, Alan Kuhnle:
Best of Both Worlds: Practical and Theoretically Optimal Submodular Maximization in Parallel. CoRR abs/2111.07917 (2021) - 2020
- [j11]Alan Kuhnle, Taher Mun, Christina Boucher, Travis Gagie
Efficient Construction of a Complete Index for Pan-Genomics Read Alignment. J. Comput. Biol. 27(4): 500-513 (2020) - [j10]Taher Mun, Alan Kuhnle, Christina Boucher, Travis Gagie
Matching Reads to Many Genomes with the r-Index. J. Comput. Biol. 27(4): 514-518 (2020) - [j9]Tianyi Pan
Influence Diffusion in Online Social Networks With Propagation Rate Changes. IEEE Trans. Netw. Sci. Eng. 7(4): 3100-3111 (2020) - [i14]Alan Kuhnle:
Nearly Linear-Time, Parallelizable Algorithms for Non-Monotone Submodular Maximization. CoRR abs/2009.01947 (2020) - [i13]Alan Kuhnle:
Quick Streaming Algorithms for Maximization of Monotone Submodular Functions in Linear Time. CoRR abs/2009.04979 (2020)
2010 – 2019
- 2019
- [j8]Christina Boucher, Travis Gagie
Prefix-free parsing for building big BWTs. Algorithms Mol. Biol. 14(1): 13:1-13:15 (2019) - [j7]Alan Kuhnle
Scalable approximations to k-cycle transversal problems on dynamic networks. Knowl. Inf. Syst. 61(1): 65-84 (2019) - [c20]Victoria G. Crawford, Alan Kuhnle, My T. Thai:
Submodular Cost Submodular Cover with an Approximate Oracle. ICML 2019: 1426-1435 - [c19]Alan Kuhnle:
Interlaced Greedy Algorithm for Maximization of Submodular Functions in Nearly Linear Time. NeurIPS 2019: 2371-2381 - [c18]Alan Kuhnle, Taher Mun, Christina Boucher, Travis Gagie
Efficient Construction of a Complete Index for Pan-Genomics Read Alignment. RECOMB 2019: 158-173 - [i12]Alan Kuhnle:
Nearly Linear-Time, Deterministic Algorithm for Maximizing (Non-Monotone) Submodular Functions Under Cardinality Constraint. CoRR abs/1902.06179 (2019) - [i11]Alan Kuhnle:
A Note on Submodular Maximization over Independence Systems. CoRR abs/1906.02315 (2019) - [i10]Victoria G. Crawford, Alan Kuhnle, My T. Thai:
Submodular Cost Submodular Cover with an Approximate Oracle. CoRR abs/1908.00653 (2019) - [i9]Victoria G. Crawford, Alan Kuhnle:
Fast Evolutionary Algorithms for Maximization of Cardinality-Constrained Weakly Submodular Functions. CoRR abs/1908.01230 (2019) - [i8]Taher Mun, Alan Kuhnle, Christina Boucher, Travis Gagie, Ben Langmead, Giovanni Manzini:
Matching reads to many genomes with the r-index. CoRR abs/1908.01263 (2019) - 2018
- [j6]Victoria G. Crawford, Alan Kuhnle, Christina Boucher, Rayan Chikhi, Travis Gagie
Practical dynamic de Bruijn graphs. Bioinform. 34(24): 4189-4195 (2018) - [j5]Alan Kuhnle, Victoria G. Crawford, My T. Thai:
Network Resilience and the Length-Bounded Multicut Problem: Reaching the Dynamic Billion-Scale with Guarantees. Proc. ACM Meas. Anal. Comput. Syst. 2(1): 4:1-4:26 (2018) - [j4]Alan Kuhnle
Multiplex Influence Maximization in Online Social Networks With Heterogeneous Diffusion Models. IEEE Trans. Comput. Soc. Syst. 5(2): 418-429 (2018) - [c17]Huiling Zhang, Alan Kuhnle, J. David Smith, My T. Thai:
Fight Under Uncertainty: Restraining Misinformation and Pushing out the Truth. ASONAM 2018: 266-273 - [c16]J. David Smith, Alan Kuhnle, My T. Thai:
An Approximately Optimal Bot for Non-Submodular Social Reconnaissance. HT 2018: 192-200 - [c15]Tianyi Pan, Alan Kuhnle, Xiang Li, My T. Thai:
Vulnerability of Interdependent Networks with Heterogeneous Cascade Models and Timescales. ICDCS 2018: 290-299 - [c14]Alan Kuhnle, J. David Smith, Victoria G. Crawford, My T. Thai:
Fast Maximization of Non-Submodular, Monotonic Functions on the Integer Lattice. ICML 2018: 2791-2800 - [c13]Victoria G. Crawford, Alan Kuhnle, Md Abdul Alim, My T. Thai:
Space-Efficient and Dynamic Caching for D2D Networks of Heterogeneous Users. MASS 2018: 317-325 - [c12]Alan Kuhnle, Victoria G. Crawford, My T. Thai:
Network Resilience and the Length-Bounded Multicut Problem: Reaching the Dynamic Billion-Scale with Guarantees. SIGMETRICS (Abstracts) 2018: 81-83 - [c11]Bahar Alipanahi, Alan Kuhnle, Christina Boucher:
Recoloring the Colored de Bruijn Graph. SPIRE 2018: 1-11 - [c10]Christina Boucher, Travis Gagie
Prefix-Free Parsing for Building Big BWTs. WABI 2018: 2:1-2:16 - [i7]Alan Kuhnle, Md Abdul Alim, Xiang Li, Huiling Zhang, My T. Thai:
Multiplex Influence Maximization in Online Social Networks with Heterogeneous Diffusion Models. CoRR abs/1802.01729 (2018) - [i6]Alan Kuhnle, J. David Smith, Victoria G. Crawford, My T. Thai:
Fast Maximization of Non-Submodular, Monotonic Functions on the Integer Lattice. CoRR abs/1805.06990 (2018) - [i5]Alan Kuhnle, Taher Mun, Christina Boucher, Travis Gagie, Ben Langmead, Giovanni Manzini:
Efficient Construction of a Complete Index for Pan-Genomics Read Alignment. CoRR abs/1811.06933 (2018) - 2017
- [j3]Alan Kuhnle, Xiang Li, J. David Smith, My T. Thai
Online set multicover algorithms for dynamic D2D communications. J. Comb. Optim. 34(4): 1237-1264 (2017) - [j2]Alan Kuhnle
Vulnerability of clustering under node failure in complex networks. Soc. Netw. Anal. Min. 7(1): 8:1-8:15 (2017) - [j1]Subhankar Mishra
Price Modification Attack and Protection Scheme in Smart Grid. IEEE Trans. Smart Grid 8(4): 1864-1875 (2017) - [c9]Alan Kuhnle, Victoria G. Crawford, My T. Thai:
Scalable and Adaptive Algorithms for the Triangle Interdiction Problem on Billion-Scale Networks. ICDM 2017: 237-246 - [c8]Tianyi Pan, Alan Kuhnle, Xiang Li, My T. Thai:
Dynamic Propagation Rates: New Dimension to Viral Marketing in Online Social Networks. ICDM 2017: 1021-1026 - [c7]Alan Kuhnle, Tianyi Pan, Md Abdul Alim, My T. Thai:
Scalable bicriteria algorithms for the threshold activation problem in online social networks. INFOCOM 2017: 1-9 - [c6]Alan Kuhnle, Tianyi Pan, Victoria G. Crawford, Md Abdul Alim, My T. Thai:
Pseudo-Separation for Assessment of Structural Vulnerability of a Network. SIGMETRICS (Abstracts) 2017: 13-14 - [i4]Alan Kuhnle, Nam P. Nguyen, Thang N. Dinh, My T. Thai:
Vulnerability of Clustering under Node Failure in Complex Networks. CoRR abs/1701.08787 (2017) - [i3]Alan Kuhnle, Tianyi Pan, Md Abdul Alim, My T. Thai:
Scalable Bicriteria Algorithms for the Threshold Activation Problem in Online Social Networks. CoRR abs/1701.08799 (2017) - [i2]Tianyi Pan, Alan Kuhnle, Xiang Li, My T. Thai:
Popular Topics Spread Faster: New Dimension for Influence Propagation in Online Social Networks. CoRR abs/1702.01844 (2017) - [i1]Alan Kuhnle, Tianyi Pan, Victoria G. Crawford, Md Abdul Alim, My T. Thai:
Pseudo-Separation for Assessment of Structural Vulnerability of a Network. CoRR abs/1704.04555 (2017) - 2016
- [c5]Huiling Zhang, Alan Kuhnle, Huiyuan Zhang, My T. Thai:
Detecting misinformation in online social networks before it is too late. ASONAM 2016: 541-548 - [c4]Huiyuan Zhang, Huiling Zhang, Alan Kuhnle, My T. Thai:
Profit maximization for multiple products in online social networks. INFOCOM 2016: 1-9 - 2015
- [c3]Subhankar Mishra
Rate alteration attacks in smart grid. INFOCOM 2015: 2353-2361 - 2014
- [c2]Md Abdul Alim, Alan Kuhnle, My T. Thai:
Are communities as strong as we think? ASONAM 2014: 314-319 - [c1]Alan Kuhnle, Xiang Li, My T. Thai:
Online Algorithms for Optimal Resource Management in Dynamic D2D Communications. MSN 2014: 130-137
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-28 20:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: