Frank Neumann 0001
27 publications
9 venues
H Index 9
Affiliation
University of Adelaide, AustraliaMax Planck Institute for Informatics, Saarbr cken, Germany
Links
| Name | Venue | Year | citations |
|---|---|---|---|
Theoretical Analysis of Evolutionary Algorithms with Quality Diversity for a Classical Path Planning Problem.
|
IJCAI | 2025 | 0 |
| Limited Query Graph Connectivity Test.
|
AAAI | 2024 | 0 |
| Optimizing Chance-Constrained Submodular Problems with Variable Uncertainties.
|
ECAI | 2023 | 4 |
| Rigorous Runtime Analysis of MOEA/D for Solving Multi-Objective Minimum Weight Base Problems.
|
NIPS/NeurIPS | 2023 | 15 |
| Fast Pareto Optimization Using Sliding Window Selection.
|
ECAI | 2023 | 6 |
| Diverse Approximations for Monotone Submodular Maximization Problems with a Matroid Constraint.
|
IJCAI | 2023 | 9 |
| Scalable Edge Blocking Algorithms for Defending Active Directory Style Attack Graphs.
|
AAAI | 2023 | 0 |
| Practical Fixed-Parameter Algorithms for Defending Active Directory Style Attack Graphs.
|
AAAI | 2022 | 0 |
| Runtime Analysis of Single- and Multi-Objective Evolutionary Algorithms for Chance Constrained Optimization Problems with Normally Distributed Random Variables.
|
IJCAI | 2022 | 0 |
| Pareto optimization for subset selection with dynamic cost constraints.
|
Artificial Intelligence | 2022 | 0 |
| Solving Non-uniform Planted and Filtered Random SAT Formulas Greedily.
|
SAT | 2021 | 0 |
| Fast Pareto Optimization for Subset Selection with Dynamic Cost Constraints.
|
IJCAI | 2021 | 11 |
| Pareto Optimization for Subset Selection with Dynamic Partition Matroid Constraints.
|
AAAI | 2021 | 0 |
| Neural Networks in Evolutionary Dynamic Constrained Optimization: Computational Cost and Benefits.
|
ECAI | 2020 | 1 |
| Evolutionary Bi-Objective Optimization for the Dynamic Chance-Constrained Knapsack Problem Based on Tail Bound Objectives.
|
ECAI | 2020 | 21 |
| Optimization of Chance-Constrained Submodular Functions.
|
AAAI | 2020 | 0 |
| Non-Monotone Submodular Maximization with Multiple Knapsacks in Static and Dynamic Settings.
|
ECAI | 2020 | 0 |
| Evolving Solutions to Community-Structured Satisfiability Formulas.
|
AAAI | 2019 | 0 |
| Greedy Maximization of Functions with Bounded Curvature under Partition Matroid Constraints.
|
AAAI | 2019 | 0 |
| Pareto Optimization for Subset Selection with Dynamic Cost Constraints.
|
AAAI | 2019 | 0 |
| Robust Fitting in Computer Vision: Easy or Hard?
|
ECCV | 2018 | 79 |
| What's Hot in Evolutionary Computation.
|
AAAI | 2017 | 15 |
| Guaranteed Outlier Removal with Mixed Integer Linear Programs.
|
CVPR | 2016 | 47 |
| On the Runtime of Randomized Local Search and Simple Evolutionary Algorithms for Dynamic Makespan Scheduling.
|
IJCAI | 2015 | 33 |
| Packing While Traveling: Mixed Integer Programming for a Class of Nonlinear Knapsack Problems.
|
CPAIOR | 2015 | 0 |
| A Parameterized Runtime Analysis of Evolutionary Algorithms for the Euclidean Traveling Salesperson Problem.
|
AAAI | 2012 | 41 |
| Approximation-Guided Evolutionary Multi-Objective Optimization.
|
IJCAI | 2011 | 95 |