Alan Kuhnle

Mitchell Institute — United States

Computer Science · Physical Sciences

13h-index611citations85works0.52yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Complexity and Algorithms in Graphs(32), Cryptography and Data Security(21), Complex Network Analysis Techniques(17), Algorithms and Data Compression(14), Genomics and Phylogenetic Studies(13)

Publications85 total

ResQue Greedy: Rewiring Sequential Greedy for Improved Submodular Maximization
2025
Hierarchical DeepPruner: A Novel Framework for Search Space Reduction
Proceedings of the International Symposium on Combinatorial Search·2025Open Access
Bicriteria Submodular Maximization
arXiv (Cornell University)·2025Open Access
ResQue Greedy: Rewiring Sequential Greedy for Improved Submodular Maximization
arXiv (Cornell University)·2025Open Access
Breaking Barriers: Combinatorial Algorithms for Non-monotone Submodular Maximization with Sublinear Adaptivity and $1/e$ Approximation
arXiv (Cornell University)·2025Open Access
Theoretically Grounded Pruning of Large Ground Sets for Constrained, Discrete Optimization
arXiv (Cornell University)·2024Open Access
Practical Submodular Maximization: A Primer
2024· 3 cited
Scalable Distributed Algorithms for Size-Constrained Submodular Maximization in the MapReduce and Adaptive Complexity Models
Journal of Artificial Intelligence Research·2024Open Access
A Benchmark for Maximum Cut: Towards Standardization of the Evaluation of Learned Heuristics for Combinatorial Optimization
arXiv (Cornell University)·2024Open Access
Submodular Maximization in Exactly $n$ Queries
arXiv (Cornell University)·2024Open Access
Discretely Beyond $1/e$: Guided Combinatorial Algorithms for Submodular Maximization
arXiv (Cornell University)·2024· 1 citedOpen Access
Practical and Parallelizable Algorithms for Non-Monotone Submodular Maximization with Size Constraint
Journal of Artificial Intelligence Research·2024· 2 citedOpen Access
Discretely beyond $1/e$: Guided Combinatorial Algortihms for Submodular Maximization
2024
Unveiling the Limits of Learned Local Search Heuristics: Are You the Mightiest of the Meek?
arXiv (Cornell University)·2023Open Access
Approximation Algorithms for Size-Constrained Non-Monotone Submodular Maximization in Deterministic Linear Time
2023· 5 citedOpen Access
DASH: A Distributed and Parallelizable Algorithm for Size-Constrained Submodular Maximization
Proceedings of the AAAI Conference on Artificial Intelligence·2023· 4 citedOpen Access
RELS-DQN: A Robust and Efficient Local Search Framework for Combinatorial Optimization
arXiv (Cornell University)·2023Open Access
Learning Strategic Value and Cooperation in Multi-Player Stochastic Games through Side Payments
arXiv (Cornell University)·2023Open Access
Scalable Distributed Algorithms for Size-Constrained Submodular Maximization in the MapReduce and Adaptive Complexity Models
arXiv (Cornell University)·2022Open Access
Best of Both Worlds: Practical and Theoretically Optimal Submodular Maximization in Parallel
Neural Information Processing Systems·2021
page 1 of 5Next →

Frequent Co-authors

My T. Thai(27), Victoria G. Crawford(11), Tianyi Pan(8), Christina Boucher(6), Travis Gagie(6), Giovanni Manzini(5), Ben Langmead(4), Taher Mun(4), Christina Boucher(4), Bahar Alipanahi(4), J. David Smith(4), Xiang Li(3), Y.-M. Chen(3), Abdul Alim(3), Subhankar Mishra(2), Jung Taek Seo(2), Simon J. Puglisi(2), Leena Salmela(2), Yixin Chen(2), Huiling Zhang(2)