Assisting Students in Finding Bugs and their Locations in Programming Solutions. - Long H. Pham; Giang V. Trinh; Mai H. Dinh; Nam P. Mai; Tho T. Quan; Hung Q. Ngo 001 (Int. J. Qual. Assur. Eng. Technol. Educ., 2014)

Reusing Symbolic Observation Graph for Efficient Model Checking. - Bao-Trung Pham-Duy; Trinh Van Giang; Le Dinh Thuan; Quan Thanh Tho (KSE, 2015)

Fast-and-Fit: An Intelligent Auto-Pricing System for Airlines Travel Agencies. - Trinh Van Giang; Nguyen Duc Khoan; Nguyen Duy Khuong; Vu Phu Thuc; Quan Thanh Tho (IntelliSys (1), 2016)

Probabilistic modelling for congestion detection on wireless sensor networks. - Khanh Le; Giang V. Trinh; Thang H. Bui; Tho Quan 001 (CoDIT, 2017)

Algorithms for Finding Attractors of Generalized Asynchronous Random Boolean Networks. - Trinh Van Giang; Kunihiko Hiraishi (ASCC, 2019)

An efficient method for approximating attractors in large-scale asynchronous Boolean models. - Trinh Van Giang; Kunihiko Hiraishi (BIBM, 2020)

A Study on Attractors of Generalized Asynchronous Random Boolean Networks. - Trinh Van Giang; Kunihiko Hiraishi (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2020)

An Improved Method for Finding Attractors of Large-Scale Asynchronous Boolean Networks. - Trinh Van Giang; Kunihiko Hiraishi (CIBCB, 2021)

Computing attractors of large-scale asynchronous boolean networks using minimal trap spaces. - Van-Giang Trinh; Kunihiko Hiraishi; Belaid Benhamou (BCB, 2022)

Minimal Trap Spaces of Logical Models are Maximal Siphons of Their Petri Net Encoding. - Van-Giang Trinh; Belaid Benhamou; Kunihiko Hiraishi; Sylvain Soliman (CMSB, 2022)

An FVS-Based Approach to Attractor Detection in Asynchronous Random Boolean Networks. - Trinh Van Giang; Tatsuya Akutsu; Kunihiko Hiraishi (IEEE ACM Trans. Comput. Biol. Bioinform., 2022)

On Attractor Detection and Optimal Control of Deterministic Generalized Asynchronous Random Boolean Networks. - Trinh Van Giang; Kunihiko Hiraishi (IEEE ACM Trans. Comput. Biol. Bioinform., 2022)

Efficient Enumeration of Fixed Points in Complex Boolean Networks Using Answer Set Programming. - Van-Giang Trinh; Belaid Benhamou; Sylvain Soliman (CP, 2023)

Trap spaces of multi-valued networks: definition, computation, and applications. - Van-Giang Trinh; Belaid Benhamou; Thomas A. Henzinger; Samuel Pastva (Bioinform., 2023)

Trap spaces of Boolean networks are conflict-free siphons of their Petri net encoding. - Van-Giang Trinh; Belaid Benhamou; Sylvain Soliman (Theor. Comput. Sci., 2023)

Using answer set programming to deal with boolean networks and attractor computation: application to gene regulatory networks of cells. - Tarek Khaled; Belaid Benhamou; Van-Giang Trinh (Ann. Math. Artif. Intell., 2023)

Scalable Enumeration of Trap Spaces in Boolean Networks via Answer Set Programming. - Giang V. Trinh; Belaid Benhamou; Samuel Pastva; Sylvain Soliman (AAAI, 2024)

mpbn: a simple tool for efficient edition and analysis of elementary properties of Boolean networks. - Van-Giang Trinh; Belaid Benhamou; Loïc Paulevé (CoRR, 2024)

Static Analysis of Logic Programs via Boolean Networks. - Van-Giang Trinh; Belaid Benhamou (CoRR, 2024)

Graphical Conditions for the Existence, Unicity and Number of Regular Models. - Van-Giang Trinh; Belaid Benhamou; Sylvain Soliman; François Fages (ICLP, 2024)

Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks. - Mohimenul Kabir; Van-Giang Trinh; Samuel Pastva; Kuldeep S. Meel (CP, 2025)

Detecting Misleading Information with LLMs and Explainable ASP. - Quang-Anh Nguyen; Thu-Trang Pham; Thi-Hai-Yen Vuong; Van-Giang Trinh; Ha-Thanh Nguyen (ICAART (3), 2025)

Graphical Analysis of Abstract Argumentation Frameworks via Boolean Networks. - Van-Giang Trinh; Belaid Benhamou; Vincent Risch (ICAART (2), 2025)

On the number of asynchronous attractors in AND-NOT Boolean networks. - Van-Giang Trinh; Samuel Pastva; Jordan C. Rozum; Kyu Hyong Park; Réka Albert (CoRR, 2025)

On the Boolean Network Theory of Datalog¬. - Van-Giang Trinh; Belaid Benhamou; Sylvain Soliman; François Fages (CoRR, 2025)