| 2026 | GECCO | Hot of the Press: 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 |
| 2026 | PPSN | Runtime Analysis of Cartesian Genetic Programming in Evolving Boolean Functions. | Duc-Cuong Dang, Roman Kalkreuth, Andre Opris |
| 2026 | PPSN | SPEA2 | Duc-Cuong Dang, Andre Opris, Dirk Sudholt |
| 2025 | GECCO | Why Dominance Is Not Enough: Lessons from Practical Evolutionary Multi-Objective Algorithms. | Duc-Cuong Dang, Andre Opris, Dirk Sudholt |
| 2025 | IJCAI | 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 |
| 2024 | GECCO | The SLO Hierarchy of pseudo-Boolean Functions and Runtime of Evolutionary Algorithms. | Duc-Cuong Dang, Per Kristian Lehre |
| 2024 | GECCO | Illustrating the Efficiency of Popular Evolutionary Multi-Objective Algorithms Using Runtime Analysis. | Duc-Cuong Dang, Andre Opris, Dirk Sudholt |
| 2024 | GECCO | Runtime Analyses of NSGA-III on Many-Objective Problems. | Andre Opris, Duc-Cuong Dang, Frank Neumann, Dirk Sudholt |
| 2024 | GECCO | Hot of the Press: Crossover Can Guarantee Exponential Speed-Ups in Evolutionary Multi-Objective Optimisation. | Andre Opris, Duc-Cuong Dang, Dirk Sudholt |
| 2024 | PPSN | On the Equivalence Between Stochastic Tournament and Power-Law Ranking Selection and How to Implement Them Efficiently. | Duc-Cuong Dang, Andre Opris, Dirk Sudholt |
| 2024 | PPSN | Level-Based Theorems for Runtime Analysis of Multi-objective Evolutionary Algorithms. | Duc-Cuong Dang, Andre Opris, Dirk Sudholt |
| 2023 | AAAI | A Proof That Using Crossover Can Guarantee Exponential Speed-Ups in Evolutionary Multi-Objective Optimisation. | Duc-Cuong Dang, Andre Opris, Bahare Salehi, Dirk Sudholt |
| 2023 | GECCO | Analysing the Robustness of NSGA-II under Noise. | Duc-Cuong Dang, Andre Opris, Bahare Salehi, Dirk Sudholt |
| 2022 | GECCO | Fast non-elitist evolutionary algorithms with power-law ranking selection. | Duc-Cuong Dang, Anton V. Eremeev, Per Kristian Lehre, Xiaoyu Qin |
| 2022 | PPSN | Evolutionary Algorithms for Cardinality-Constrained Ising Models. | Vijay Dhanjibhai Bhuva, Duc-Cuong Dang, Liam Huber, Dirk Sudholt |
| 2021 | AAAI | Escaping Local Optima with Non-Elitist Evolutionary Algorithms. | Duc-Cuong Dang, Anton V. Eremeev, Per Kristian Lehre |
| 2021 | GECCO | Non-elitist evolutionary algorithms excel in fitness landscapes with sparse deceptive regions and dense valleys. | Duc-Cuong Dang, Anton V. Eremeev, Per Kristian Lehre |
| 2016 | GECCO | Escaping Local Optima with Diversity Mechanisms and Crossover. | Duc-Cuong Dang, Tobias Friedrich, Timo Ktzing, Martin S. Krejca, Per Kristian Lehre, Pietro S. Oliveto, Dirk Sudholt, Andrew M. Sutton |
| 2016 | PPSN | Emergence of Diversity and Its Benefits for Crossover in Genetic Algorithms. | Duc-Cuong Dang, Tobias Friedrich, Timo Ktzing, Martin S. Krejca, Per Kristian Lehre, Pietro S. Oliveto, Dirk Sudholt, Andrew M. Sutton |
| 2016 | PPSN | Self-adaptation of Mutation Rates in Non-elitist Populations. | Duc-Cuong Dang, Per Kristian Lehre |
| 2015 | FOGA | Efficient Optimisation of Noisy Fitness Functions with Population-based Evolutionary Algorithms. | Duc-Cuong Dang, Per Kristian Lehre |
| 2015 | GECCO | Populations can be Essential in Dynamic Optimisation. | Duc-Cuong Dang, Thomas Jansen, Per Kristian Lehre |
| 2015 | GECCO | Simplified Runtime Analysis of Estimation of Distribution Algorithms. | Duc-Cuong Dang, Per Kristian Lehre |
| 2014 | GECCO | Evolution under partial information. | Duc-Cuong Dang, Per Kristian Lehre |
| 2014 | GECCO | Refined upper bounds on the expected runtime of non-elitist populations from fitness-levels. | Duc-Cuong Dang, Per Kristian Lehre |
| 2014 | PPSN | Level-Based Analysis of Genetic Algorithms and Other Search Processes. | Dogan Corus, Duc-Cuong Dang, Anton V. Eremeev, Per Kristian Lehre |
| 2013 | CPAIOR | A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem. | Duc-Cuong Dang, Racha El-Hajj, Aziz Moukrim |
| 2010 | IJCCI | Subgraph Extraction and Memetic Algorithm for the Maximum Clique Problem. | Duc-Cuong Dang, Aziz Moukrim |