Homepage

I am a Leverhulme Early Career Fellow in the AI group at the University of St Andrews. My research focuses on using automatic algorithm configuration and analysis methods for algorithm parameter importance to support algorithm design process. At St Andrews, I'm applying techniques from automatic algorithm configuration, algorithm selection and algorithm parameter analyses on the constraint modelling toolchain developed by the group.

I did my PhD at KU Leuven (campus Kortrijk) with Prof. Patrick De Causmaecker and Dr. Thomas Stützle. My PhD thesis is about "Data analytics for algorithm design".

Checkout my CV here and Google Scholar.

Conference papers

• Carlos Ansótegui, Miquel Bofill, Jordi Coll, Nguyen Dang, Juan Luís Esteban, Ian Miguel, Peter Nightingale, András Salamon, Josep Suy and Mateu Villaret (2019) Automatic Detection of At-Most-One and Exactly-One Relations for Improved SAT Encodings of Pseudo-Boolean Constraints. In Proceedings of the 25th International Conference on Principles and Practice of Constraint Programming (CP)

• Özgür Akgün, Nguyen Dang, Ian Miguel, Andras Salamon, and Christopher Stone (2019) Instance Generation via Generator Instances. In Proceedings of the 25th International Conference on Principles and Practice of Constraint Programming (CP)

• Patrick Spracklen, Nguyen Dang, Özgür Akgün, and Ian Miguel (2019) Automatic Streamlining for Constrained Optimisation. In Proceedings of the 25th International Conference on Principles and Practice of Constraint Programming (CP)

• Saad Attieh, Nguyen Dang, Christopher Jefferson, Ian Miguel, and Peter Nightingale (2019) Athanor: High-Level Local Search Over Abstract Constraint Specifications in Essence. In Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI)

• Nguyen Dang, and Carola Doerr (2019) Hyper-Parameter Tuning for the (1+(lambda,lambda)) GA. In Proceedings of The Genetic and Evolutionary Computation Conference (GECCO) [arxiv]

• Niels Elgers, Nguyen Dang, and Patrick De Causmaecker (2019) "A Metaheuristic Approach to Compute Pure Nash Equilibria." In Bioinspired Heuristics for Optimization, pp. 221-233. Springer

• Nguyen Dang, and Patrick De Causmaecker (2018) "Analysis of Algorithm Components and Parameters: Some Case Studies." In International Conference on Learning and Intelligent Optimization (LION)

• Nguyen Dang, Leslie Pérez Cáceres, Thomas Stützle, Patrick De Causmaecker (2017) Configuring irace using surrogate configuration benchmarks. In Proceeding of the Genetic and Evolutionary Computation Conference (GECCO) 2017. Best paper award (ECOM track) [technical report, supplementary materials]

• Nguyen Dang, Patrick De Causmaecker (2016) Characterization of neighborhood behaviours in a multi-neighborhood local search algorithm. In Proceedings of the 10^th Learning and Intelligent Optimization (LION) [an extended version, source code]

• Nguyen Thi Thanh Dang, Patrick De Causmaecker (2014). Motivations for the Development of a Multi-objective Algorithm Configurator. In Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems (ICORES)

• Nguyen Thi Thanh Dang, Tien Ba Dinh (2011) A Multi-Stage Local Search for a Real-world Vehicle Routing Problem, In Proceedings of the 7th International Conference on Natural Computation (ICNC)

• Khoa Trinh, Nguyen Dang, Tien Dinh (2011) An Approximation Approach for a Real-World Variant of Vehicle Routing Problem. In New Challenges for Intelligent Information and Database Systems

• Khang Nguyen, Nguyen Dang, Khon Trieu, Nuong Tran (2010) Automating a Real-World University Timetabling Problem with Tabu Search Algorithm. In Proceedings of the International Conference on Computing and Communication Technologies (RIVF)

Journal papers

• Corstjens, Jeroen, Nguyen Dang, Benoît Depaire, An Caris, and Patrick De Causmaecker (2018) "A combined approach for analysing heuristic algorithms." Journal of Heuristics, pp 1-38

• Ceschia, Sara, Nguyen Dang, Patrick De Causmaecker, Stefaan Haspeslagh, and Andrea Schaerf. (2018) "The second international nurse rostering competition." Annals of Operations Research 274, pp 171-186 [competition website]

Talks

• Nguyen Dang, Sara Ceschia, Andrea Schaerf, Patrick De Causmaecker, and Stefaan Haspeslagh (2016) Solving the Multi-Stage Nurse Rostering Problem. At the 11th International Confenference on Practice and Theory of Automated Timetabling (PATAT)

• Nguyen Dang, Patrick De Causmaecker (2016) A study on automated parameter tuning tools and analysis of parameters' importance. At the 2016 EURO Working Group on Metaheuristics meeting (EU/ME) [slides, source code]