2015

  1. Nguyen Thanh Tung, Huynh Thi Thanh Binh, Base Station Location -Aware Optimization Model of the Lifetime of Wireless Sensor Networks, Mobile Networks and Applications, DOI: 10.1007/s11036-015-0614-3, ISSN 1572-8153 (SCI-E Index, IF 1.496).
  2. Ta Van Dai, Shih–Chang Huang, Huynh Thi Thanh Binh, Covering the Target Objects with Mobile Sensors by Using Genetic Algorithm in Wireless Sensor Networks, Journal of Computers, 2015, ISSN 1796-203X, accepted.

2014:

  1. Dinh Viet Sang, Mai Dinh Loi, Nguyen Tien Quang, Huynh Thi Thanh Binh, Nguyen Thi Thuy, Improving Semantic Texton Forests with a Markov Random Field for Image Segmentation, SoICT 2014, accepted.
  2. Bui, Thi Thuan, Yuki Hirai, Huynh Thi Thanh Binh, and Keiichi Kaneko, Stochastic Link-fault-tolerant Routing in a Hyper-star graph, Proceedings of the 11th International Conference on Applied Computing, pp. 45-52, Porto, Portugal, Oct. 25-27, 2014.
  3. Dinh Ha Ly, Huynh Thi Thanh Binh, Nguyen Thanh Tung, Maximizing the lifetime of wireless sensor networks with the base station location, International Conference on Nature of Computation and Communication, 2014, accepted.
  4. Q.T. Bui, Q.D. Pham, Y. Deville. Solving the Quorumcast Routing Problem as a Mixed Integer Program, 11th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2014), Cork, Ireland, May 2014, Lecture Notes in Computer Science, Springer, 2014.
  5. Nguyen Thai Duong, Huynh Thi Thanh Binh, Ngo Hong Son, Genetic algorithm and heuristics for solving Duty-Cycled Wireless Sensor Networks, Journal of Computer Science and Cybernetics, Vol. 3, 2014.
  6. Huynh Thi Thanh Binh, Nguyen Thai Duong, Heuristic and genetic algorithms for solving survivability problem in the design of last mile communication networks, Soft Computing, DOI: 10.1007/s00500-014-1429-z, 2014 (SCIE).
  7. Pham Dinh Thanh, Huynh Thi Thanh Binh and Bui Thu Lam, New mechanism of combination crossover operators in genetic algorithm for solving the traveling salesman problem, In the Proceedings of the Sixth International Conference on Knowledge and Systems Engineering (KSE 2014), accepted.
  8. Le Khac Tuan, Huynh Thi Thanh Binh, Genetic Algorithm for Solving Survivable Network Design Problem with Extending-Cycle-Based Protected Working Capacity Envelope, Sixth World Congress on Nature and Biologically Inspired Computing (NaBIC2014), Porto, Portuga, accepted, 2014.
  9. Huynh Thi Thanh Binh, Ngo Hong Son, All Capacities Modular Cost Survivable Network Design Problem using Genetic Algorithm with Completely Connection Encoding, Human-centric Computing and Information Sciences, accepted.
  10. Huynh Thi Thanh Binh, Bui Thu Lam, Nguyen Sy Thai Ha, Hisao Ishibuchi, A Multi-Objective Approach for Solving the Survivable Network Design Problem with Simultaneous Unicast and Anycast Flows, Applied Soft Computing, accepted (SCIE).
  11. Nguyễn Thái Dương, Huỳnh Thị Thanh Bình, Ngô Hồng Sơn, Group Steiner Tree Model for Energy Efficient Multicast in Duty-Cycle Wireless Sensor Networks, In the Proceedings of The Fifth International Conference on Communications and Electronics (ICCE), 2014, accepted.
  12. Huynh Thi Thanh Binh, Multi-objective genetic algorithm for solving Multi-layer optical survivable network design problem, Journal of Convergence, accepted.
  13. Huynh Thi Thanh Binh, Nguyen Hong Nhat, Bach Hoang Vinh, Le Hoang Linh, Heuristic algorithm for virtual network mapping problem, in the Proceedings of the 9th International Conference on Testbeds and Research Infrastructures for the Development of Networks & Communities (TRIDENTCOM 2014), accepted.
  14. Binh Huynh Thi Thanh, Long Tran Van, Hoai Nguyen Xuan, Anh Nguyen Duc and Truong Pham Manh, Reordering Dimensions for Radial Visualization of High Dimensional Data - A Genetic Algorithms Approach, Congress on Evolutionary Computing (CEC 2014), accepted.
  15. Huynh Thi Thanh Binh, Nguyen Xuan Tung, Parallel Genetic Algorithm for Solving the Multilayer Survivable Optical Network Design Problem, Advanced in Computer Science and Its Applications (CSA 2013), Lecture Notes in Electrical in Engineering, Volume 279, 2014, pp. 333-338.

2013:

  1. Phạm Đình Thành, Huỳnh Thị Thanh Bình, Bùi Thu Lâm, A Survey on Hybridizing Genetic Algorithm with Dynamic Programming for Solving the Traveling Salesman Problem, Proceedings on Trends in Innovative Computing (ICT 2013), ISSN: 2150-7996, pp. 1-6.
  2. Nguyen Duong Trung Dung and Huynh Thi Thanh Binh, Using contour information for image segmentation, In the Proceedings of 5th International Conference on Soft Computing and Pattern Recognition (SoCPaR 2013), pp. 264-269.
  3. Nguyen Tien Quang, Huynh Thi Thanh Binh and Nguyen Thi Thuy, Genetic Algorithm in Boosting for Object Class Image Segmentation, In the Proceedings of 5th International Conference on Soft Computing and Pattern Recognition (SoCPaR 2013), pp. 283-288.
  4. Huynh Thi Thanh Binh, Son Hong Ngo, Survivable Flows Routing in Large Scale Network Design using Genetic Algorithm, Advanced in Computer Science and Its Applications (CSA 2013), Lecture Notes in Electrical in Engineering, Volume 279, 2014, pp. 345-351.
  5. Duc-Hau Le, Quang Uy Nguyen, Quang Dung Pham, Thi Thanh Binh Huynh and Yung-Keun Kwon, Towards the identification of disease associated protein complexes, In the Procedings of the 4th International Conference on Computational Systems- Biology and Bioinformatics, 2013, Seoul, Korea, pp. 15-23.
  6. Huynh Thi Thanh Binh, Hybrid Particle Swarm Optimization for Solving Multi-Area Economic Dispatch Problem, International Journal on Soft Computing (IJSC) Vol.4, No.2, May 2013, pp.17-27.
  7. Huynh Thi Thanh Binh, Tran Kim Toan, Real-Coded Genetic Algorithm for Solving Multi-Area Economic Dispatch Problem, 2013 IEEE Symposium Series On Computational Intelligence, 2013, pp.97-101.
  8. Huynh Thi Thanh Binh, Ngo Hong Sơn, Nguyen Ngoc Dat, Genetic Algorithm for Solving Survivable Network Design with Simultaneous Unicast and Anycast Flows, In the Proceedings of the Eighth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA 2013), pp. 1237-1247.
  9. Huynh Thi Thanh Binh, Nguyen Duy Hiep, Improved Genetic Algorithm for Solving Optimal Communication Spanning Tree Problem, In the Proceedings of the Eighth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA 2013), pp. 405-413.

2012:

  1. Huynh Thi Thanh Binh, Ha Dinh Ly, Genetic Algorithm for Solving Multilayer Survivable Optical Network Design Problem, International Journal of Machine Learning and Computing, ISSN: 2010-3700, 2012, pp.812-816.
  2. Huynh Thi Thanh Binh, Pham Quang Dung, Pham Duy Dat, Genetic algorithm for solving the Master thesis timetabling problem with multiple objectives, In the Proceedings of the 17th Conference on Technologies and Applications of Artificial Intelligence - TAAI 2012, Tainan, Taiwan, pp.74-79.
  3. Huynh Thi Thanh Binh, Mai Dinh Loi, Nguyen Thi Thuy, Improving image segmentation using genetic algorithm, In the Proceedings of 11th International Conference on Machine Learning and Applications ICMLA 2012, Florida, US, 2012, pp.18-23.
  4. Huynh Thi Thanh Binh, Ha Minh Long, Tran Duc Khanh, Recombination Operators in Genetic Algorithm – Based Crawler: Study and Experimental Appraisal, Studies in Computational Intelligence, Kacprzyk, Janusz (Eds), ISSN: 1860-949X, Springer, 2012, pp. 239-249.
  5. Pham Vu Long, Nguyen Ngoc Dat, Nguyen Sy Thai Ha, Huynh Thi Thanh Binh, Heuristic Algorithms for Survivable Network Design Problem with Simultaneous Unicast and Anycast Flows, The Eighth International Conference on Intelligence Computing, China, July, 2012, pp. 137-145.
  6. Vo Khanh Trung, Nguyen Thi Minh, Huynh Thi Thanh Binh, Heuristic Algorithms for Solving Survivability Problem in the Design of Last Mile Communication Network, The 4th Asian Conference on Intelligent Information and Database Systems, Kaohsiung, Taiwan, March 2012, pp.519-528.
  7. Nguyen Thi Minh, Vo Khanh Trung, Huynh Thi Thanh Binh, Heuristic Algorithms for Solving Survivability Problem in the Design of Last Mile Communication Network, The 9th IEEE-RIVF International Conference on Computing and Communication Technology, Viet Nam, February 2012, pp.219-224.

2011:

  1. Pham Trung Kien, Nguyen Duy Hiep, Huynh Thi Thanh Binh, New hybrid genetic algorithm for solving optimal communication spanning tree problem, The 26th Symposium on Applied Computing, Taiwan, 2011, pp.1076-1081.

2010:

  1. Nguyen Quoc Nhan, Vu Tuan Son, Huynh Thi Thanh Binh, Tran Duc Khanh, Crawl Topical Vietnamese Web Pages using Genetic Algorithm, In Proceedings of The second International Conference on Knowledge and System Engineering, 2010, pp 217-223.
  2. Ha Bang Ban and Duc Nghia NguyenImproved Genetic Algorithm for Minimum Latency Problem.In Proceedings of Symposium on Information and Communication Technology, SoICT2010, Hanoi, Vietnam, 2010. pp. 9-15.
  3. Pham Quang Dung, Phan-Thuan Do, Y. Deville, Tuong-Vinh Ho. Constraint-based local search for solving non-simple paths problems on graphs: Application to the Routing for Network Covering ProblemsIn Proceedings of Symposium on Information and Communication Technology, SoICT2010, Hanoi, Vietnam, pages 1-8, 2010.
  4. Pham Quang Dung, Y. Deville, P. Van Hentenryck.Constraint-Based Local Search for Constrained Optimum Paths Problems7th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2010), Lecture Notes in Computer Science, Springer, 2010.
  5. V.T. Ho, P. Francois, Y. Deville, D.Q. Pham, O. Bonaventure Using Local Search for Traffic Engineering in Switched Ethernet NetworksProceedings of 22nd International Teletraffic Congress (ITC-22) September 2010, Amsterdam, Netherlands
  6. Phan-Thuan DO and Vincent VAJNOVSZKI. Generating pattern avoiding permutations by ECO. Mini-conference on Applied Theoretical Computer Science (MATCOS)Koper, Slovenia, October 13th and 14th, 2010.

2003-2009:

  1. Huỳnh Thị Thanh Bình, Nguyễn Đức Nghĩa, Các kỹ thuật lai ghép trong giải thuật di truyền giải bài toán cây khung nhỏ nhất với đường kính bị chặn, Tạp chí Tin học và điều khiển, 3, 2009, 231-245.
  2. Huynh Thi Thanh Binh, Nguyen Xuan Hoai, R.I (Bob) McKay, Nguyen Duc Nghia, New Heuristic and Hybrid Genetic Algorithm for Solving Bounded Diameter Minimum Spanning Tree Problem, Genetic and Evolutionary Computational Conference, GECCO 2009, Montreal, pp. 373-380.
  3. Huynh Thi Thanh Binh, Nguyen Duc Nghia, New Multi-parent Recombination in Genetic Algorithm for Solving Bounded Diameter Minimum Spanning Tree Problem, Proceeding of 1st Asian Conference on Intelligence Information and Database Systems, 2009, pp. 283-288.
  4. Pham Quang Dung, Y. Deville, P. Van Hentenryck.LS(Graph): A Local Search Framework for Constraint Optimization on Graphs and Trees.  Proceedings of the 2009 ACM Symposium on Applied Computing (SAC'09), March 8-12, 2009.
  5. Binh Huynh Thi Thanh, Nguyen Truong Binh, New Particle Swarm Optimization Algorithm for Solving Degree Constrained Minimum Spanning Tree Problem, Proceeding of Tenth Pacific Rim International Conference on Artificial Intelligence, Lecturer Notes in Springer, 2008.
  6. Nguyen Duc Nghia, Huynh Thi Thanh Binh, Chapter 20: Heuristic Algorithms for Solving Bounded Diameter Minimum Spanning Tree Problem And Its Application to Genetic Algorithm Development, Advances in Greedy Algorithms, Witold Nednorz (Ed), ISBN: 978-953-7619-27-5, I-Tech Education and Publishing, Austria, 2008, pp. 370-386.
  7. Huynh Thi Thanh Binh, Nguyen Xuan Hoai, R.I (Bob) McKay, New hybrid genetic algorithm for solving bounded diameter minimum spanning tree problem, Proceedings of IEEE World Congress on Computational Intelligence, Hong Kong, LNCS, 2008, pp. 3127-3133.
  8. Nguyen Duc Nghia, Huynh Thi Thanh Binh, A New Recombination Operator for Solving Bounded Diameter Minimum Spanning Tree Problem, Proceedings of International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future, RIVF’2007, pp. 108-113.
  9. Huynh Thi Thanh Binh, Khuc Ngoc Hiep, Parallel genetic algorithm for solving Bounded Diameter Minimum Spanning Tree Problem, Proceeding of national conference “Research, Development, Application of Information and Communication Technology” ICT.rda’06, 2006
  10. Nguyen Duc Nghia, Huynh Thi Thanh Binh, About some algorithm for solving Bounded Diameter Minimum Spanning Tree Problem, Proceeding of national conference “Research, Development, Application of Information and Communication Technology” ICT.rda’04, 2004, pp.121-124.
  11. Vu Trung Nghia, Huynh Thi Thanh Binh, Le Sy Quang, Luong Chi Mai, Clustering with mixed data, Proceedings of national conference “Some selected problem in Information Technology”, 2004.
  12. Le Si Quang, Huynh Thi Thanh Binh, Luong Chi Mai, A Multilayer Algorithm for Discovering Clusters in Large Spatial Databases And its Application, Asian Journal of Geoinformatics, Vol. 3, No.3, Published by ARSRIN, P.O.Box 4, Klong Luang, Pathumthani 12120, Thailand, 2003.
  13. Ban Hà BằngNguyễn Đức Nghĩa. Genetic Algorithm for solving minimum latency problems. J. Science and Technology. N 71, 2009. pp. 6-11.
  14. Nguyen Viet Huy, Nguyen Duc NghiaParallel Genetic Algorithm For Solving Graphical Steiner Problem. RIVF 08. Ho Chi Minh, 2008.
  15. Nguyen Thi Thu Huong, Expression Builder for Data Report, Journal of Science and Technology, vol.57/2006 (in Vietnamese)
  16. Nguyen Thi Thu Huong, Le Van Chuong, Automatic Rhetorical Parser  for Vietnamese, Proceedings of ICT-RDA symposium , Hanoi, Vietnam 2008 (in Vietnamese)
  17. Duc-Nghia Nguyen, Phan-Thuan Do: Genetic Algorithm for Optimization of a Quadratic Function with Circular Matrix Problem. RIVF 2004: 221-226.
  18. Jean-Luc BARIL and Phan-Thuan DO. ECO-generation for p-generalized Fibonacci and Lucas permutations. Journal of Pure Mathematics and Applications, 17 (1-2), pp. 19-37, 2006. ISSN 1218-4586.
  19. Jean-Luc BARIL and Phan-Thuan DO. Generalized Fibonacci permutations generation by the ECO method. CANT2006, Liège, Belgique, 8-19/05/2006.
  20. Phan-Thuan DO and Vincent VAJNOVSZKI. Exhaustive generation of some classes of pattern avoiding permutations using succession functions. Conference in honor of Donald E. Knuth. October 29-31, 2007.
  21. Phan-Thuan DO and Vincent VAJNOVSZKI. CAT generation of Dyck words and relatives. CGCS2007, Marseille - Luminy, France, 2-4/05/2007.
  22. Jean-Luc BARIL and Phan-Thuan DO. Efficient generating algorithms for some combinatorial object classes. Summer School on Combinatorics and Statistical Mechanics, Erwin Schrödinger International Institute for Mathematical Physics, Vienna, Austria, 7-18/07/2008.
  23. Jean-Luc BARIL and Phan-Thuan DO. ECO-generation for compositions and their restrictions. Permutation Patterns 2008 (PP2008), University of Otago in Dunedin, New Zealand, 16-20/06/2008.