In Preparation

• mpbn: a simple tool for efficient edition and analysis of elementary properties of Boolean networks
  Van-Giang Trinh, Belaid Benhamou, and Loïc Paulevé
  [arXiv]

Submitted

• On the Boolean Network Theory of Datalog$^\neg$
  Van-Giang Trinh, Belaid Benhamou, Sylvain Soliman, and François Fages
  under review [arXiv]

Articles in Refereed Conferences

2025

• On the trap space semantics of normal logic programs
  Van-Giang Trinh, Sylvain Soliman, François Fages, and Belaid Benhamou
  ICLP 2025, regular paper
• Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks
  Mohimenul Kabir, Van-Giang Trinh, Samuel Pastva, and Kuldeep S. Meel
  CP 2025, regular paper [doi - arXiv]
• On the number of asynchronous attractors in AND-NOT Boolean networks
  Van-Giang Trinh, Samuel Pastva, Jordan Rozum, Kyu Hyong Park, and Réka Albert
  AUTOMATA 2025, exploratory paper [arXiv]
• Graphical analysis of abstract argumentation frameworks via Boolean networks
  Van-Giang Trinh, Belaid Benhamou, and Vincent Risch
  ICAART 2025, regular paper [doi - hal]
• Detecting misleading information with LLMs and explainable ASP
  Quang-Anh Nguyen, Thu-Trang Pham, Thi-Hai-Yen Vuong, Van-Giang Trinh, and Ha-Thanh Nguyen
  ICAART 2025, short paper [doi - hal]

2024

• Graphical conditions for the existence, unicity and number of regular models
  Van-Giang Trinh, Belaid Benhamou, Sylvain Soliman, and François Fages
  ICLP 2024, regular paper [doi]
• Scalable enumeration of trap spaces in Boolean networks via answer set programming
  Van-Giang Trinh, Belaid Benhamou, Samuel Pastva, and Sylvain Soliman
  AAAI 2024, regular paper, oral presentation [doi - supplement]

2023

• Efficient enumeration of fixed points in complex Boolean networks using answer set programming
  Van-Giang Trinh, Belaid Benhamou, and Sylvain Soliman
  CP 2023, regular paper [doi]
• Trap spaces of multi-valued networks: Definition, computation, and applications
  Van-Giang Trinh, Belaid Benhamou, Thomas Henzinger, and Samuel Pastva
  ISMB/ECCB 2023, regular paper, proceedings track [doi - supplement] 

2022

• Computing attractors of large-scale asynchronous Boolean networks using minimal trap spaces
  Van-Giang Trinh, Kunihiko Hiraishi, and Belaid Benhamou
  ACM-BCB 2022, regular paper [doi - hal]
• Minimal trap spaces of logical models are maximal siphons of their Petri net encoding
  Van-Giang Trinh, Belaid Benhamou, and Sylvain Soliman
  CMSB 2022, regular paper [doi - hal]

2021

• An improved method for finding attractors of large-scale asynchronous Boolean networks
  Van-Giang Trinh and Kunihiko Hiraishi
  CIBCB 2021, regular paper [doi]

2020

• An efficient method for approximating attractors in large-scale asynchronous Boolean models
  Van-Giang Trinh and Kunihiko Hiraishi
  BIBM 2020, workshop paper [doi]

2019

• Algorithms for finding attractors of generalized asynchronous random Boolean networks
  Van-Giang Trinh and Kunihiko Hiraishi
  ASCC 2019, regular paper [url]

2017

• Probabilistic modelling for congestion detection on wireless sensor networks
  Le Ngoc Kim Khanh, Van-Giang Trinh, Bui Hoai Thang, and Quan Thanh Tho
  CoDIT 2017, regular paper [doi]

2016

• Fast-and-Fit: An intelligent auto-pricing system for airlines travel agencies
  Van-Giang Trinh, Nguyen Duc Khoan, Nguyen Duy Khuong, Vu Phu Thuc, and Quan Thanh Tho
  SAI 2016, regular paper [doi]
• Modeling and analysing Boolean networks by coloured Petri nets
  Van-Giang Trinh, Kunihiko Hiraishi, and Quan Thanh Tho
  ITC-CSCC 2016, regular paper [doi]

2015

• Reusing symbolic observation graph for efficient model checking
  Bao Trung Pham Duy, Van-Giang Trinh, Le Dinh Thuan, and Quan Thanh Tho
  KSE 2015, regular paper [doi]

Articles in Refereed Journals

2025

• Mapping the attractor landscape of Boolean networks with biobalm
  Van-Giang Trinh, Kyu Hyong Park, Samuel Pastva, and Jordan C Rozum
  Bioinformatics, 2025 [doi - bioRxiv]

2023

• Trap spaces of Boolean networks are conflict-free siphons of their Petri net encoding
  Van-Giang Trinh, Belaid Benhamou, and Sylvain Soliman
  Theoretical Computer Science (TCS), 2023 [doi - hal]
• Using answer set programming to deal with Boolean networks and attractor computation: Application to gene regulatory networks of cells
  Tarek Khaled, Belaid Benhamou, and Van-Giang Trinh
  Annals of Mathematics and Artificial Intelligence (AMAI), 2023 [doi - hal]
• Trap spaces of multi-valued networks: Definition, computation, and applications
  Van-Giang Trinh, Belaid Benhamou, Thomas Henzinger, and Samuel Pastva
  Bioinformatics, 2023 [doi - supplement]

2020

• On attractor detection and optimal control of deterministic generalized asynchronous random Boolean networks
  Van-Giang Trinh, and Kunihiko Hiraishi
  IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB), 2020 [doi - paper - supplement]
• An FVS-based approach to attractor detection in asynchronous random Boolean networks
  Van-Giang Trinh, Tatsuya Akutsu, and Kunihiko Hiraishi
  IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB), 2020 [doi - paper]
• A study on attractors of generalized asynchronous random Boolean networks
  Van-Giang Trinh, and Kunihiko Hiraishi
  IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences, 2020 [doi]

2016

• Modelling and congestion detection of wireless sensor networks: A concurrent-based approach using coloured Petri nets
  Van-Giang Trinh, Le Ngoc Kim Khanh, Bang Ngoc Bao Tam, Tram Loi Quan, Bui Hoai Thang, and Quan Thanh Tho
  International Journal of Applied Information Systems (IJAIS), 2016 [doi]

2014

• Assisting students in finding bugs and their locations in programming solutions
  Pham Hong Long, Van-Giang Trinh, Dinh Hoang Mai, Mai Phuong Nam, Quan Thanh Tho, and Ngo Quang Hung
  International Journal of Quality Assurance in Engineering and Technology Education (IJQAETE), 2014 [doi]

Theses

• Van-Giang Trinh
  On attractor detection and optimal control of Boolean networks
  PhD thesis, Japan Advanced Institute of Science and Technology, 155 pages, 2021 [hdl - paper]