Neumann, Frank

19 publications

IJCAI 2025 Theoretical Analysis of Evolutionary Algorithms with Quality Diversity for a Classical Path Planning Problem Duc-Cuong Dang, Aneta Neumann, Frank Neumann, Andre Opris, Dirk Sudholt
AAAI 2024 Limited Query Graph Connectivity Test Mingyu Guo, Jialiang Li, Aneta Neumann, Frank Neumann, Hung X. Nguyen
IJCAI 2023 Diverse Approximations for Monotone Submodular Maximization Problems with a Matroid Constraint Anh Viet Do, Mingyu Guo, Aneta Neumann, Frank Neumann
NeurIPS 2023 Rigorous Runtime Analysis of MOEA/D for Solving Multi-Objective Minimum Weight Base Problems Anh Viet Do, Aneta Neumann, Frank Neumann, Andrew Sutton
AAAI 2023 Scalable Edge Blocking Algorithms for Defending Active Directory Style Attack Graphs Mingyu Guo, Max Ward, Aneta Neumann, Frank Neumann, Hung Nguyen
AAAI 2022 Practical Fixed-Parameter Algorithms for Defending Active Directory Style Attack Graphs Mingyu Guo, Jialiang Li, Aneta Neumann, Frank Neumann, Hung Nguyen
IJCAI 2022 Runtime Analysis of Single- and Multi-Objective Evolutionary Algorithms for Chance Constrained Optimization Problems with Normally Distributed Random Variables Frank Neumann, Carsten Witt
IJCAI 2021 Fast Pareto Optimization for Subset Selection with Dynamic Cost Constraints Chao Bian, Chao Qian, Frank Neumann, Yang Yu
AAAI 2021 Pareto Optimization for Subset Selection with Dynamic Partition Matroid Constraints Anh Viet Do, Frank Neumann
AAAI 2020 Optimization of Chance-Constrained Submodular Functions Benjamin Doerr, Carola Doerr, Aneta Neumann, Frank Neumann, Andrew M. Sutton
AAAI 2019 Evolving Solutions to Community-Structured Satisfiability Formulas Frank Neumann, Andrew M. Sutton
AAAI 2019 Greedy Maximization of Functions with Bounded Curvature Under Partition Matroid Constraints Tobias Friedrich, Andreas Göbel, Frank Neumann, Francesco Quinzan, Ralf Rothenberger
AAAI 2019 Pareto Optimization for Subset Selection with Dynamic Cost Constraints Vahid Roostapour, Aneta Neumann, Frank Neumann, Tobias Friedrich
ECCV 2018 Robust Fitting in Computer Vision: Easy or Hard? Tat-Jun Chin, Zhipeng Cai, Frank Neumann
AAAI 2017 What's Hot in Evolutionary Computation Tobias Friedrich, Frank Neumann
CVPR 2016 Guaranteed Outlier Removal with Mixed Integer Linear Programs Tat-Jun Chin, Yang Heng Kee, Anders Eriksson, Frank Neumann
IJCAI 2015 On the Runtime of Randomized Local Search and Simple Evolutionary Algorithms for Dynamic Makespan Scheduling Frank Neumann, Carsten Witt
AAAI 2012 A Parameterized Runtime Analysis of Evolutionary Algorithms for the Euclidean Traveling Salesperson Problem Andrew M. Sutton, Frank Neumann
IJCAI 2011 Approximation-Guided Evolutionary Multi-Objective Optimization Karl Bringmann, Tobias Friedrich, Frank Neumann, Markus Wagner