default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDQuang-Vu Nguyen 0001
Person information
- affiliation: University of Danang - Vietnam-Korea University of Information and Communication Technology, Da Nang, Vietnam
- affiliation (former): Wroclaw University of Science and Technology, Poland
Other persons with the same name
- Quang Vu Nguyen 0002 — National Taiwan University of Science and Technology, Department of Computer Science and Information Engineering, Taipei, Taiwan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Van-Nho Do, Quang-Vu Nguyen
, Nguyen Thanh Binh:
Predicting higher order mutation score based on machine learning. J. Inf. Telecommun. 8(1): 57-70 (2024)- 2023
- [j4]Vu-Thu-Nguyet Pham, Quang-Chung Nguyen, Quang-Vu Nguyen:
Chest X-Rays Abnormalities Localization and Classification Using an Ensemble Framework of Deep Convolutional Neural Networks. Vietnam. J. Comput. Sci. 10(1): 55-73 (2023) - 2022
- [j3]Van-Nho Do, Quang-Vu Nguyen, Nguyen Thanh Binh:
Toward Improving the Quality of Mutation Operator and Test Case Effectiveness in Higher-Order Mutation Testing. Vietnam. J. Comput. Sci. 9(4): 511-526 (2022) - 2021
- [c9]Van-Nho Do, Quang-Vu Nguyen, Nguyen Thanh Binh:
Evaluating Mutation Operator and Test Case Effectiveness by Means of Mutation Testing. ACIIDS 2021: 837-850 - 2020
- [c8]Quang-Vu Nguyen:
Increasing Mutation Testing Effectiveness by Combining Lower Order Mutants to Construct Higher Order Mutants. ICCCI 2020: 205-216
2010 – 2019
- 2019
- [c7]Quang-Vu Nguyen, Hai Bang Truong:
An Improvement of Applying Multi-objective Optimization Algorithm into Higher Order Mutation Testing. ICCSAMA 2019: 361-369 - [c6]Van-Nho Do, Quang-Vu Nguyen, Nguyen Thanh Binh:
A Solution For Improving The Effectiveness of Higher Order Mutation Testing. RIVF 2019: 1-5 - 2018
- [c5]Quang-Vu Nguyen, Duong-Thu-Hang Pham:
Is Higher Order Mutant Harder to Kill Than First Order Mutant? An Experimental Study. ACIIDS (1) 2018: 664-673 - 2017
- [j2]Quang Vu Nguyen, Lech Madeyski:
Addressing mutation testing problems by applying multi-objective optimization algorithms and higher order mutation. J. Intell. Fuzzy Syst. 32(2): 1173-1182 (2017) - 2016
- [j1]Quang Vu Nguyen, Lech Madeyski:
Empirical Evaluation of Multiobjective Optimization Algorithms Searching for Higher Order Mutants. Cybern. Syst. 47(1-2): 48-68 (2016) - [c4]Quang Vu Nguyen, Lech Madeyski:
Higher Order Mutation Testing to Drive Development of New Test Cases: An Empirical Comparison of Three Strategies. ACIIDS (1) 2016: 235-244 - [c3]Quang Vu Nguyen, Lech Madeyski:
On the Relationship Between the Order of Mutation Testing and the Properties of Generated Higher Order Mutants. ACIIDS (1) 2016: 245-254 - 2015
- [c2]Quang Vu Nguyen, Lech Madeyski:
Searching for Strongly Subsuming Higher Order Mutants by Applying Multi-objective Optimization Algorithm. ICCSAMA 2015: 391-402 - 2014
- [c1]Quang Vu Nguyen, Lech Madeyski:
Problems of Mutation Testing and Higher Order Mutation Testing. ICCSAMA 2014: 157-172
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 2025-01-20 22:49 CET 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:
