Alan Kuhnle

Orcid: 0000-0001-6506-1902

According to our database1, Alan Kuhnle authored at least 50 papers between 2014 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Practical and Parallelizable Algorithms for Non-Monotone Submodular Maximization with Size Constraint.
J. Artif. Intell. Res., 2024

Scalable Distributed Algorithms for Size-Constrained Submodular Maximization in the MapReduce and Adaptive Complexity Models.
J. Artif. Intell. Res., 2024

Theoretically Grounded Pruning of Large Ground Sets for Constrained, Discrete Optimization.
CoRR, 2024

A Benchmark for Maximum Cut: Towards Standardization of the Evaluation of Learned Heuristics for Combinatorial Optimization.
CoRR, 2024

Submodular Maximization in Exactly n Queries.
CoRR, 2024

Discretely Beyond 1/e: Guided Combinatorial Algorithms for Submodular Maximization.
CoRR, 2024

2023
Unveiling the Limits of Learned Local Search Heuristics: Are You the Mightiest of the Meek?
CoRR, 2023

RELS-DQN: A Robust and Efficient Local Search Framework for Combinatorial Optimization.
CoRR, 2023

Learning Strategic Value and Cooperation in Multi-Player Stochastic Games through Side Payments.
CoRR, 2023

Approximation Algorithms for Size-Constrained Non-Monotone Submodular Maximization in Deterministic Linear Time.
Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2023

DASH: A Distributed and Parallelizable Algorithm for Size-Constrained Submodular Maximization.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
DASH: Distributed Adaptive Sequencing Heuristic for Submodular Maximization.
CoRR, 2022

2021
Succinct dynamic de Bruijn graphs.
Bioinform., August, 2021

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

Best of Both Worlds: Practical and Theoretically Optimal Submodular Maximization in Parallel.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Quick Streaming Algorithms for Maximization of Monotone Submodular Functions in Linear Time.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

Nearly Linear-Time, Parallelizable Algorithms for Non-Monotone Submodular Maximization.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Influence Diffusion in Online Social Networks With Propagation Rate Changes.
IEEE Trans. Netw. Sci. Eng., 2020

Matching Reads to Many Genomes with the r-Index.
J. Comput. Biol., 2020

Efficient Construction of a Complete Index for Pan-Genomics Read Alignment.
J. Comput. Biol., 2020

2019
Scalable approximations to k-cycle transversal problems on dynamic networks.
Knowl. Inf. Syst., 2019

Fast Evolutionary Algorithms for Maximization of Cardinality-Constrained Weakly Submodular Functions.
CoRR, 2019

A Note on Submodular Maximization over Independence Systems.
CoRR, 2019

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

Prefix-free parsing for building big BWTs.
Algorithms Mol. Biol., 2019

Interlaced Greedy Algorithm for Maximization of Submodular Functions in Nearly Linear Time.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Submodular Cost Submodular Cover with an Approximate Oracle.
Proceedings of the 36th International Conference on Machine Learning, 2019

2018
Multiplex Influence Maximization in Online Social Networks With Heterogeneous Diffusion Models.
IEEE Trans. Comput. Soc. Syst., 2018

Network Resilience and the Length-Bounded Multicut Problem: Reaching the Dynamic Billion-Scale with Guarantees.
Proc. ACM Meas. Anal. Comput. Syst., 2018

Practical dynamic de Bruijn graphs.
Bioinform., 2018

Prefix-Free Parsing for Building Big BWTs.
Proceedings of the 18th International Workshop on Algorithms in Bioinformatics, 2018

Recoloring the Colored de Bruijn Graph.
Proceedings of the String Processing and Information Retrieval, 2018

Space-Efficient and Dynamic Caching for D2D Networks of Heterogeneous Users.
Proceedings of the 15th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, 2018

Fast Maximization of Non-Submodular, Monotonic Functions on the Integer Lattice.
Proceedings of the 35th International Conference on Machine Learning, 2018

Vulnerability of Interdependent Networks with Heterogeneous Cascade Models and Timescales.
Proceedings of the 38th IEEE International Conference on Distributed Computing Systems, 2018

An Approximately Optimal Bot for Non-Submodular Social Reconnaissance.
Proceedings of the 29th on Hypertext and Social Media, 2018

Fight Under Uncertainty: Restraining Misinformation and Pushing out the Truth.
Proceedings of the IEEE/ACM 2018 International Conference on Advances in Social Networks Analysis and Mining, 2018

2017
Price Modification Attack and Protection Scheme in Smart Grid.
IEEE Trans. Smart Grid, 2017

Vulnerability of clustering under node failure in complex networks.
Soc. Netw. Anal. Min., 2017

Online set multicover algorithms for dynamic D2D communications.
J. Comb. Optim., 2017

Popular Topics Spread Faster: New Dimension for Influence Propagation in Online Social Networks.
CoRR, 2017

Pseudo-Separation for Assessment of Structural Vulnerability of a Network.
Proceedings of the 2017 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, Urbana-Champaign, IL, USA, June 05, 2017

Scalable bicriteria algorithms for the threshold activation problem in online social networks.
Proceedings of the 2017 IEEE Conference on Computer Communications, 2017

Dynamic Propagation Rates: New Dimension to Viral Marketing in Online Social Networks.
Proceedings of the 2017 IEEE International Conference on Data Mining, 2017

Scalable and Adaptive Algorithms for the Triangle Interdiction Problem on Billion-Scale Networks.
Proceedings of the 2017 IEEE International Conference on Data Mining, 2017

2016
Profit maximization for multiple products in online social networks.
Proceedings of the 35th Annual IEEE International Conference on Computer Communications, 2016

Detecting misinformation in online social networks before it is too late.
Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2016

2015
Rate alteration attacks in smart grid.
Proceedings of the 2015 IEEE Conference on Computer Communications, 2015

2014
Online Algorithms for Optimal Resource Management in Dynamic D2D Communications.
Proceedings of the 10th International Conference on Mobile Ad-hoc and Sensor Networks, 2014

Are communities as strong as we think?
Proceedings of the 2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2014


  Loading...