default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGiang V. Trinh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c10]Giang V. Trinh, Belaid Benhamou, Samuel Pastva, Sylvain Soliman:
Scalable Enumeration of Trap Spaces in Boolean Networks via Answer Set Programming. AAAI 2024: 10714-10722- [i2]Van-Giang Trinh, Belaid Benhamou, Loïc Paulevé:
mpbn: a simple tool for efficient edition and analysis of elementary properties of Boolean networks. CoRR abs/2403.06255 (2024) - [i1]Van-Giang Trinh, Belaid Benhamou:
Static Analysis of Logic Programs via Boolean Networks. CoRR abs/2407.09015 (2024) - 2023
- [j7]Tarek Khaled, Belaid Benhamou, Van-Giang Trinh
:
Using answer set programming to deal with boolean networks and attractor computation: application to gene regulatory networks of cells. Ann. Math. Artif. Intell. 91(5): 713-750 (2023) - [j6]Van-Giang Trinh, Belaid Benhamou, Thomas A. Henzinger, Samuel Pastva:
Trap spaces of multi-valued networks: definition, computation, and applications. Bioinform. 39(Supplement-1): 513-522 (2023) - [j5]Van-Giang Trinh, Belaid Benhamou, Sylvain Soliman:
Trap spaces of Boolean networks are conflict-free siphons of their Petri net encoding. Theor. Comput. Sci. 971: 114073 (2023) - [c9]Van-Giang Trinh, Belaid Benhamou, Sylvain Soliman:
Efficient Enumeration of Fixed Points in Complex Boolean Networks Using Answer Set Programming. CP 2023: 35:1-35:19 - 2022
- [j4]Trinh Van Giang, Tatsuya Akutsu, Kunihiko Hiraishi:
An FVS-Based Approach to Attractor Detection in Asynchronous Random Boolean Networks. IEEE ACM Trans. Comput. Biol. Bioinform. 19(2): 806-818 (2022) - [j3]Trinh Van Giang, Kunihiko Hiraishi:
On Attractor Detection and Optimal Control of Deterministic Generalized Asynchronous Random Boolean Networks. IEEE ACM Trans. Comput. Biol. Bioinform. 19(3): 1794-1806 (2022) - [c8]Van-Giang Trinh, Kunihiko Hiraishi, Belaid Benhamou:
Computing attractors of large-scale asynchronous boolean networks using minimal trap spaces. BCB 2022: 13:1-13:10 - [c7]Van-Giang Trinh, Belaid Benhamou, Kunihiko Hiraishi, Sylvain Soliman:
Minimal Trap Spaces of Logical Models are Maximal Siphons of Their Petri Net Encoding. CMSB 2022: 158-176 - 2021
- [c6]Trinh Van Giang, Kunihiko Hiraishi:
An Improved Method for Finding Attractors of Large-Scale Asynchronous Boolean Networks. CIBCB 2021: 1-9 - 2020
- [j2]Trinh Van Giang, Kunihiko Hiraishi:
A Study on Attractors of Generalized Asynchronous Random Boolean Networks. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 103-A(8): 987-994 (2020) - [c5]Trinh Van Giang, Kunihiko Hiraishi:
An efficient method for approximating attractors in large-scale asynchronous Boolean models. BIBM 2020: 1820-1826
2010 – 2019
- 2019
- [c4]Trinh Van Giang, Kunihiko Hiraishi:
Algorithms for Finding Attractors of Generalized Asynchronous Random Boolean Networks. ASCC 2019: 67-72 - 2017
- [c3]Khanh Le, Giang V. Trinh, Thang H. Bui, Tho Quan:
Probabilistic modelling for congestion detection on wireless sensor networks. CoDIT 2017: 190-195 - 2016
- [c2]Trinh Van Giang, Nguyen Duc Khoan, Nguyen Duy Khuong, Vu Phu Thuc, Quan Thanh Tho:
Fast-and-Fit: An Intelligent Auto-Pricing System for Airlines Travel Agencies. IntelliSys (1) 2016: 853-865 - 2015
- [c1]Bao-Trung Pham-Duy, Trinh Van Giang, Le Dinh Thuan, Quan Thanh Tho:
Reusing Symbolic Observation Graph for Efficient Model Checking. KSE 2015: 250-255 - 2014
- [j1]Long H. Pham, Giang V. Trinh, Mai H. Dinh, Nam P. Mai, Tho T. Quan, Hung Q. Ngo:
Assisting Students in Finding Bugs and their Locations in Programming Solutions. Int. J. Qual. Assur. Eng. Technol. Educ. 3(2): 12-27 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-16 18:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
