% Key papers for Monotone submodular maximization (scime atlas, https://atlas.scime.ai). Authors are not included: add them from the paper pages.

@inproceedings{aaai2016_submodular_104807,
  title = {{Submodular Optimization with Routing Constraints}},
  booktitle = {AAAI Conference on Artificial Intelligence (AAAI)},
  year = {2016},
  url = {https://ojs.aaai.org/index.php/AAAI/article/view/10066},
}

@inproceedings{icml2017_guarantees_36214,
  title = {{Guarantees for Greedy Maximization of Non-submodular Functions with Applications}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2017},
  url = {https://icml.cc/virtual/2017/poster/521},
}

@inproceedings{neurips2017_robust_56636,
  title = {{Robust Optimization for Non-Convex Objectives}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2017},
  url = {https://nips.cc/virtual/2017/poster/9247},
}

@inproceedings{icml2019_submodular_37772,
  title = {{Submodular Maximization beyond Non-negativity: Guarantees, Fast Algorithms, and Applications}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2019},
  url = {https://icml.cc/virtual/2019/poster/4159},
}

@inproceedings{aaai2019_pareto_101046,
  title = {{Pareto Optimization for Subset Selection with Dynamic Cost Constraints}},
  booktitle = {AAAI Conference on Artificial Intelligence (AAAI)},
  year = {2019},
  url = {https://ojs.aaai.org/index.php/AAAI/article/view/4075},
}

@inproceedings{neurips2017_subset_56703,
  title = {{Subset Selection under Noise}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2017},
  url = {https://nips.cc/virtual/2017/poster/9139},
}

@inproceedings{aaai2020_optimization_100636,
  title = {{Optimization of Chance-Constrained Submodular Functions}},
  booktitle = {AAAI Conference on Artificial Intelligence (AAAI)},
  year = {2020},
  url = {https://ojs.aaai.org/index.php/AAAI/article/view/5504},
}

@inproceedings{aaai2019_greedy_101036,
  title = {{Greedy Maximization of Functions with Bounded Curvature under Partition Matroid Constraints}},
  booktitle = {AAAI Conference on Artificial Intelligence (AAAI)},
  year = {2019},
  url = {https://ojs.aaai.org/index.php/AAAI/article/view/4065},
}

@inproceedings{aaai2020_an_101866,
  title = {{An Efficient Evolutionary Algorithm for Subset Selection with General Cost Constraints}},
  booktitle = {AAAI Conference on Artificial Intelligence (AAAI)},
  year = {2020},
  url = {https://ojs.aaai.org/index.php/AAAI/article/view/5726},
}

@inproceedings{aaai2017_non_101077,
  title = {{Non-Monotone DR-Submodular Function Maximization}},
  booktitle = {AAAI Conference on Artificial Intelligence (AAAI)},
  year = {2017},
  url = {https://ojs.aaai.org/index.php/AAAI/article/view/10653},
}

@inproceedings{icml2017_robust_36375,
  title = {{Robust Submodular Maximization: A Non-Uniform Partitioning Approach}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2017},
  url = {https://icml.cc/virtual/2017/poster/674},
}

@inproceedings{neurips2016_the_56044,
  title = {{The Power of Optimization from Samples}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2016},
  url = {https://nips.cc/virtual/2016/poster/7052},
}

@inproceedings{icml2018_greed_36730,
  title = {{Greed is Still Good: Maximizing Monotone Submodular+Supermodular (BP) Functions}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2018},
  url = {https://icml.cc/virtual/2018/poster/2350},
}

@inproceedings{neurips2018_optimal_57481,
  title = {{Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2018},
  url = {https://nips.cc/virtual/2018/poster/11912},
}

@inproceedings{aaai2018_risk_103374,
  title = {{Risk-Sensitive Submodular Optimization}},
  booktitle = {AAAI Conference on Artificial Intelligence (AAAI)},
  year = {2018},
  url = {https://ojs.aaai.org/index.php/AAAI/article/view/12121},
}

@inproceedings{icml2017_probabilistic_36348,
  title = {{Probabilistic Submodular Maximization in Sub-Linear Time}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2017},
  url = {https://icml.cc/virtual/2017/poster/840},
}

@inproceedings{icml2016_algorithms_35735,
  title = {{Algorithms for Optimizing the Ratio of Submodular Functions}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2016},
  url = {https://proceedings.mlr.press/v48/baib16.html},
}

@inproceedings{aaai2017_regret_101076,
  title = {{Regret Ratio Minimization in Multi-Objective Submodular Function Maximization}},
  booktitle = {AAAI Conference on Artificial Intelligence (AAAI)},
  year = {2017},
  url = {https://ojs.aaai.org/index.php/AAAI/article/view/10652},
}

@inproceedings{neurips2016_deep_55672,
  title = {{Deep Submodular Functions: Definitions and Learning}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2016},
  url = {https://nips.cc/virtual/2016/poster/6961},
}

@inproceedings{neurips2018_non_57443,
  title = {{Non-monotone Submodular Maximization in Exponentially Fewer Iterations}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2018},
  url = {https://nips.cc/virtual/2018/poster/11245},
}

@inproceedings{aaai2024_non_6789,
  title = {{Non-monotone Sequential Submodular Maximization}},
  booktitle = {AAAI Conference on Artificial Intelligence (AAAI)},
  year = {2024},
  url = {https://ojs.aaai.org/index.php/AAAI/article/view/29452},
}

@inproceedings{aaai2024_deletion_5661,
  title = {{Deletion-Robust Submodular Maximization with Knapsack Constraints}},
  booktitle = {AAAI Conference on Artificial Intelligence (AAAI)},
  year = {2024},
  url = {https://ojs.aaai.org/index.php/AAAI/article/view/29053},
}

@inproceedings{neurips2024_practical_73639,
  title = {{Practical \$0.385\$-Approximation for Submodular Maximization Subject to a Cardinality Constraint}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2024},
  url = {https://neurips.cc/virtual/2024/poster/93853},
}

@inproceedings{neurips2025_corporate_77330,
  title = {{Corporate Needs You to Find the Difference: Revisiting Submodular and Supermodular Ratio Optimization Problems}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2025},
  url = {https://openreview.net/forum?id=Sf5nxMRiG7},
}

@inproceedings{icml2024_a_45627,
  title = {{A Dynamic Algorithm for Weighted Submodular Cover Problem}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2024},
  url = {https://icml.cc/virtual/2024/poster/32825},
}

@inproceedings{icml2025_an_47021,
  title = {{An Asymptotically Optimal Approximation Algorithm for Multiobjective Submodular Maximization at Scale}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2025},
  url = {https://icml.cc/virtual/2025/poster/45564},
}

@inproceedings{icml2025_procurement_48331,
  title = {{Procurement Auctions via Approximately Optimal Submodular Optimization}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2025},
  url = {https://icml.cc/virtual/2025/poster/44284},
}

@inproceedings{icml2025_breaking_49071,
  title = {{Breaking Barriers: Combinatorial Algorithms for Non-Monotone Submodular Maximization with Sublinear Adaptivity and \$1/e\$ Approximation}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2025},
  url = {https://icml.cc/virtual/2025/poster/43553},
}

@inproceedings{icml2026_a_50965,
  title = {{A General Framework for Dynamic Consistent Submodular Maximization}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2026},
  url = {https://openreview.net/forum?id=HW85JYJ7JP},
}

@inproceedings{neurips2024_discretely_73023,
  title = {{Discretely beyond \$1/e\$: Guided Combinatorial Algortihms for Submodular Maximization}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2024},
  url = {https://neurips.cc/virtual/2024/poster/94400},
}

@inproceedings{neurips2025_non_76194,
  title = {{Non-monotone Submodular Optimization: \$p\$-Matchoid Constraints and Fully Dynamic Setting}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2025},
  url = {https://openreview.net/forum?id=GdrBPyUNPL},
}

@inproceedings{neurips2025_a_78296,
  title = {{A Unified Approach to Submodular Maximization Under Noise}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2025},
  url = {https://openreview.net/forum?id=d6RH6W6cul},
}

@inproceedings{aaai2026_improved_108668,
  title = {{Improved Fully Dynamic Submodular Maximization Under Matroid Constraints}},
  booktitle = {AAAI Conference on Artificial Intelligence (AAAI)},
  year = {2026},
  url = {https://ojs.aaai.org/index.php/AAAI/article/view/41020},
}

@inproceedings{icml2024_consistent_43697,
  title = {{Consistent Submodular Maximization}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2024},
  url = {https://icml.cc/virtual/2024/poster/34755},
}

@inproceedings{icml2025_discrete_46632,
  title = {{Discrete and Continuous Difference of Submodular Minimization}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2025},
  url = {https://icml.cc/virtual/2025/poster/45938},
}

@inproceedings{icml2026_improved_54843,
  title = {{Improved Dynamic Algorithm for Non-monotone Submodular Maximization under Cardinality Constraint}},
  booktitle = {International Conference on Machine Learning (ICML)},
  year = {2026},
  url = {https://openreview.net/forum?id=tBS3uBG6Pv},
}

@inproceedings{iclr2025_improved_81366,
  title = {{Improved Approximation Algorithms for \$k\$-Submodular Maximization via Multilinear Extension}},
  booktitle = {International Conference on Learning Representations (ICLR)},
  year = {2025},
  url = {https://iclr.cc/virtual/2025/poster/30407},
}

@inproceedings{iclr2025_difference_83938,
  title = {{Difference-of-submodular Bregman Divergence}},
  booktitle = {International Conference on Learning Representations (ICLR)},
  year = {2025},
  url = {https://iclr.cc/virtual/2025/poster/27885},
}

@inproceedings{iclr2026_efficient_85704,
  title = {{Efficient Submodular Maximization for Sums of Concave over Modular Functions}},
  booktitle = {International Conference on Learning Representations (ICLR)},
  year = {2026},
  url = {https://openreview.net/forum?id=HIi4lNsvXW},
}

@inproceedings{neurips2026_when_91764,
  title = {{When Streaming Fails: Dynamic Algorithms for Unconstrained Submodular Maximization}},
  booktitle = {Advances in Neural Information Processing Systems (NeurIPS)},
  year = {2026},
  url = {https://neurips.cc/virtual/2026/poster/154760},
}