Using Tabu Search for Solving a High School Timetabling Problem. - Khang Nguyen Tan Tran Minh; Nguyen Dang Thi Thanh; Khon Trieu Trang; Nuong Tran Thi Hue (Advances in Intelligent Information and Database Systems, 2010)

Motivations for the Development of a Multi-objective Algorithm Configurator. - Nguyen Dang Thi Thanh; Patrick De Causmaecker (ICORES, 2014)

Second International Nurse Rostering Competition (INRC-II) - Problem Description and Rules -. - Sara Ceschia; Nguyen Dang Thi Thanh; Patrick De Causmaecker; Stefaan Haspeslagh; Andrea Schaerf (CoRR, 2015)

Characterization of Neighborhood Behaviours in a Multi-neighborhood Local Search Algorithm. - Nguyen Dang Thi Thanh; Patrick De Causmaecker (LION, 2016)

Configuring irace using surrogate configuration benchmarks. - Nguyen Dang 001; Leslie Pérez Cáceres; Patrick De Causmaecker; Thomas Stützle (GECCO, 2017)

Analysis of Algorithm Components and Parameters: Some Case Studies. - Nguyen Dang 001; Patrick De Causmaecker (LION, 2018)

Instance Generation via Generator Instances. - Özgür Akgün; Nguyen Dang 001; Ian Miguel; András Z. Salamon; Christopher Stone 001 (CP, 2019)

Automatic Detection of At-Most-One and Exactly-One Relations for Improved SAT Encodings of Pseudo-Boolean Constraints. - Carlos Ansótegui; Miquel Bofill; Jordi Coll; Nguyen Dang 001; Juan Luis Esteban; Ian Miguel; Peter Nightingale; András Z. Salamon; Josep Suy; Mateu Villaret (CP, 2019)

Automatic Streamlining for Constrained Optimisation. - Patrick Spracklen; Nguyen Dang 001; Özgür Akgün; Ian Miguel (CP, 2019)

Hyper-parameter tuning for the (1 + (λ, λ)) GA. - Nguyen Dang 001; Carola Doerr (GECCO, 2019)

Athanor: High-Level Local Search Over Abstract Constraint Specifications in Essence. - Saad Attieh; Nguyen Dang 001; Christopher Jefferson; Ian Miguel; Peter Nightingale (IJCAI, 2019)

The Second International Nurse Rostering Competition. - Sara Ceschia; Nguyen Dang 001; Patrick De Causmaecker; Stefaan Haspeslagh; Andrea Schaerf (Ann. Oper. Res., 2019)

Hyper-Parameter Tuning for the (1+(λ, λ)) GA. - Nguyen Dang 001; Carola Doerr (CoRR, 2019)

A combined approach for analysing heuristic algorithms. - Jeroen Corstjens; Nguyen Dang 001; Benoît Depaire; An Caris; Patrick De Causmaecker (J. Heuristics, 2019)

Discriminating Instance Generation from Abstract Specifications: A Case Study with CP and MIP. - Özgür Akgün; Nguyen Dang 001; Ian Miguel; András Z. Salamon; Patrick Spracklen; Christopher Stone 001 (CPAIOR, 2020)

Towards Portfolios of Streamlined Constraint Models: A Case Study with the Balanced Academic Curriculum Problem. - Patrick Spracklen; Nguyen Dang 001; Özgür Akgün; Ian Miguel (CoRR, 2020)

Exploring Instance Generation for Automated Planning. - Özgür Akgün; Nguyen Dang 001; Joan Espasa; Ian Miguel; András Z. Salamon; Christopher Stone 001 (CoRR, 2020)

Efficient Incremental Modelling and Solving. - Gökberk Koçak; Özgür Akgün; Nguyen Dang 001; Ian Miguel (CoRR, 2020)

A Framework for Generating Informative Benchmark Instances. - Nguyen Dang 001; Özgür Akgün; Joan Espasa; Ian Miguel; Peter Nightingale (CP, 2022)

Theory-inspired parameter control benchmarks for dynamic algorithm configuration. - André Biedenkapp; Nguyen Dang 001; Martin S. Krejca; Frank Hutter; Carola Doerr (GECCO, 2022)

A portfolio-based analysis method for competition results. - Nguyen Dang 001 (CoRR, 2022)

Using Automated Algorithm Configuration for Parameter Control. - Deyao Chen; Maxim Buzdalov 001; Carola Doerr; Nguyen Dang 001 (FOGA, 2023)

Automated streamliner portfolios for constraint satisfaction problems. - Patrick Spracklen; Nguyen Dang 001; Özgür Akgün; Ian Miguel (Artif. Intell., 2023)

Frugal Algorithm Selection (Short Paper). - Erdem Kus; Özgür Akgün; Nguyen Dang 001; Ian Miguel (CP, 2024)

Frugal Algorithm Selection. - Erdem Kus; Özgür Akgün; Nguyen Dang 001; Ian Miguel (CoRR, 2024)

Automatic Feature Learning for Essence: a Case Study on Car Sequencing. - Alessio Pellegrino; Özgür Akgün; Nguyen Dang 001; Zeynep Kiziltan; Ian Miguel (CoRR, 2024)

Constraint Models for Klondike. - Nguyen Dang 001; Ian P. Gent; Peter Nightingale; Felix Ulrich-Oltean; Jack Waller (CP, 2025)

Transformer-Based Feature Learning for Algorithm Selection in Combinatorial Optimisation. - Alessio Pellegrino; Özgür Akgün; Nguyen Dang 001; Zeynep Kiziltan; Ian Miguel (CP, 2025)

On the Importance of Reward Design in Reinforcement Learning-based Dynamic Algorithm Configuration: A Case Study on OneMax with (1+(λ, λ))-GA. - Tai Nguyen 008; Phong Le; André Biedenkapp; Carola Doerr; Nguyen Dang 001 (GECCO, 2025)

Athanor: Local search over abstract constraint specifications. - Saad Attieh; Nguyen Dang 001; Christopher Jefferson; Ian Miguel; Peter Nightingale (Artif. Intell., 2025)

Multi-parameter Control for the (1+(λ,λ))-GA on OneMax via Deep Reinforcement Learning. - Tai Nguyen 008; Phong Le; Carola Doerr; Nguyen Dang 001 (CoRR, 2025)