default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDViet Hung Nguyen
This is just a disambiguation page, and is not intended to be the bibliography of an actual person. Any publication listed on this page has not been assigned to an actual author yet. If you know the true author of one of the publications listed below, you are welcome to contact us.
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j29]Viet Hung Nguyen, Duy Tien Bui, Thanh Lam Tran, Truong Cong Thang, Thu Huong Truong
:
Scalable and resilient 360-degree-video adaptive streaming over HTTP/2 against sudden network drops. Comput. Commun. 216: 1-15 (2024)- [j28]Thi Quynh Trang Vo, Mourad Baïou, Viet Hung Nguyen:
A branch-and-cut algorithm for the balanced traveling salesman problem. J. Comb. Optim. 47(2): 4 (2024) - [j27]Van Quan Nguyen, Long Thanh Ngo, Le Minh Nguyen, Viet Hung Nguyen, Nathan Shone:
Deep clustering hierarchical latent representation for anomaly-based cyber-attack detection. Knowl. Based Syst. 301: 112366 (2024) - [j26]Minh Hieu Nguyen, Mourad Baïou, Viet Hung Nguyen, Thi Quynh Trang Vo:
Generalized nash fairness solutions for bi-objective minimization problems. Networks 83(1): 83-99 (2024) - [j25]Nguyen Minh Tu, Viet Hung Nguyen, Nathan Shone:
Using deep graph learning to improve dynamic analysis-based malware detection in PE files. J. Comput. Virol. Hacking Tech. 20(1): 153-172 (2024) - [c49]Thanh Loan Nguyen, Viet Hung Nguyen, Minh Hieu Nguyen, Thi Viet Thanh Vu:
On the Kalai-Smorodinsky Solutions for Bi-objective Spanning Tree Problem. AAIM (2) 2024: 86-98 - [c48]Nguyen Ha Huy Phuc, Viet Hung Nguyen, Anh Son Ta:
Solving Edge-Weighted Maximum Clique Problem with DCA Warm-Start Quantum Approximate Optimization Algorithm. MIC (1) 2024: 246-261 - [c47]Nguyen Ha Huy Phuc, Viet Hung Nguyen, Anh Son Ta:
Solving Quadratic Knapsack Problem with Biased Quantum State Optimization Algorithm. MIC (1) 2024: 268-280 - [c46]Nguyen Ha Huy Phuc, Viet Hung Nguyen, Anh Son Ta:
Solving Maximum Cut Problem with Multi-objective Enhance Quantum Approximate Optimization Algorithm. ICCSA (Workshops 11) 2024: 244-252 - [c45]Minh Hieu Nguyen, Mourad Baïou, Viet Hung Nguyen, Thi Quynh Trang Vo:
Proportional Fairness for Combinatorial Optimization. LATIN (2) 2024: 304-319 - 2023
- [c44]Van Quan Nguyen, Thanh Long Ngo, Le Minh Nguyen, Viet Hung Nguyen, Van Van Nguyen, Thi Hang Nguyen:
Hybrid of Deep Auto-Encoder and Maximum Mean Discrepancy for Cyber Reconnaissance Detection. KSE 2023: 1-8 - [c43]Thi Quynh Trang Vo, Mourad Baïou, Viet Hung Nguyen, Paul Weng:
Improving Subtour Elimination Constraint Generation in Branch-and-Cut Algorithms for the TSP with Machine Learning. LION 2023: 537-551 - [c42]Van Quan Nguyen, Thanh Long Ngo, Le Minh Nguyen, Viet Hung Nguyen, Nathan Shone:
Deep Nested Clustering Auto-Encoder for Anomaly-Based Network Intrusion Detection. RIVF 2023: 289-294 - [c41]Nguyen Ha Huy Phuc, Anh Son Ta, Viet Hung Nguyen:
Improve the Quantum Approximate Optimization Algorithm with Genetic Algorithm. SoICT 2023: 655-662 - [c40]Chi Thao Nguyen, Jean-Philippe Gayon, Viet Hung Nguyen, Alain Quilliot, Anh Son Ta:
Pickup and Delivery Problem with Cooperative Robots. SoICT 2023: 695-700 - [c39]Huu Phong Pham, Viet Hung Nguyen, Ngoc Anh Tran, Minh Hieu Nguyen:
Log Analysis For Network Attack Detection Using Deep Learning Models. SoICT 2023: 731-738 - 2022
- [j24]Dat Tran-An, Bao Bui-Quoc, Anh Vu-Duc, Trung-Anh Do, Viet Hung Nguyen, Nam Vu Hoai, Cong Tran:
Integrative Few-Shot Classification and Segmentation for Landslide Detection. IEEE Access 10: 120200-120212 (2022) - [j23]Viet Hung Nguyen, Ngoc Nam Pham, Truong Cong Thang, Duy Tien Bui, Huu-Thanh Nguyen, Thu Huong Truong:
Retina-based quality assessment of tile-coded 360-degree videos. EAI Endorsed Trans. Ind. Networks Intell. Syst. 9(32): 2 (2022) - [j22]David Wu, Viet Hung Nguyen, Michel Minoux, Hai Tran:
Optimal deterministic and robust selection of electricity contracts. J. Glob. Optim. 82(4): 993-1013 (2022) - [c38]Minh Hieu Nguyen, Viet Hung Nguyen, Thi Quynh Trang Vo, Mourad Baïou:
Nash fairness solutions for balanced TSP. INOC 2022: 1-6 - [c37]Minh Hieu Nguyen, Mourad Baïou, Viet Hung Nguyen:
Nash Balanced Assignment Problem. ISCO 2022: 172-186 - [c36]Van Quan Nguyen, Viet Hung Nguyen, Tuan Hao Hoang, Nathan Shone:
A Novel Deep Clustering Variational Auto-Encoder for Anomaly-based Network Intrusion Detection. KSE 2022: 1-7 - [c35]Truong Son Pham, Viet Hung Nguyen, Anh Thang Le, Van Duong Bui:
udCATS: A Comprehensive Unsupervised Deep Learning Framework for Detecting Collective Anomalies in Time Series. RICE 2022: 201-206 - [c34]Thi Quynh Trang Vo, Mourad Baïou, Viet Hung Nguyen, Paul Weng:
A comparative study of linearization methods for Ordered Weighted Average. RNDM 2022: 1-7 - 2021
- [j21]Viet Hung Nguyen, Michel Minoux:
Linear size MIP formulation of Max-Cut: new properties, links with cycle inequalities and computational results. Optim. Lett. 15(4): 1041-1060 (2021) - [c33]Nam Vu Hoai, Huong Mai Nguyen, Duc Cuong Pham, Anh Dat Tran, Khanh Nguyen Trong, Cuong Pham, Viet Hung Nguyen:
Landslide Detection with Unmanned Aerial Vehicles. MAPR 2021: 1-7 - [c32]Van Quan Nguyen, Viet Hung Nguyen, Nhien-An Le-Khac, Van Loi Cao:
Automatically Estimate Clusters in Autoencoder-based Clustering Model for Anomaly Detection. RIVF 2021: 1-6 - [c31]David Wu, Viet Hung Nguyen, Michel Minoux, Hai Tran:
An integer programming model for minimizing energy cost in water distribution system using trigger levels with additional time slots. RIVF 2021: 1-6 - 2020
- [c30]Ha Phan Khanh Nguyen, Viet Hung Nguyen, Van Long Do:
A Deep Double-Q Learning-based Scheme for Anti-Jamming Communications. EUSIPCO 2020: 1566-1570 - [c29]Van Quan Nguyen, Viet Hung Nguyen, Nhien-An Le-Khac, Van Loi Cao:
Clustering-Based Deep Autoencoders for Network Anomaly Detection. FDSE 2020: 290-303 - [c28]Trung Dung Do, Quoc Khanh Nguyen, Viet Hung Nguyen:
A multi-scale context encoder for high quality restoration of facial images. MAPR 2020: 1-6
2010 – 2019
- 2019
- [j20]Méziane Aïder, Lamia Aoudia, Mourad Baïou, Ali Ridha Mahjoub, Viet Hung Nguyen:
On the star forest polytope for trees and cycles. RAIRO Oper. Res. 53(5): 1763-1773 (2019) - [c27]Quyen The Ngo, My Linh Ha, Thi Minh Huyen Nguyen, Thi Mai Huong Hoang, Viet Hung Nguyen:
Towards a UMLS-Integratable Vietnamese Medical Terminology. PACLING 2019: 388-399 - [c26]Tin Leelavimolsilp, Viet Hung Nguyen, Sebastian Stein, Long Tran-Thanh:
Selfish Mining in Proof-of-Work Blockchain with Multiple Miners: An Empirical Evaluation. PRIMA 2019: 219-234 - [i6]Tin Leelavimolsilp, Long Tran-Thanh, Sebastian Stein, Viet Hung Nguyen:
An Empirical Evaluation of Selfish Mining and Strategic Mining in Proof-of-Work Blockchain with Multiple Miners. CoRR abs/1905.06853 (2019) - 2018
- [i5]Viet Hung Nguyen, Paul Weng:
An Efficient Primal-Dual Algorithm for Fair Combinatorial Optimization Problems. CoRR abs/1801.07544 (2018) - 2017
- [j19]Dang Phuong Nguyen, Michel Minoux, Viet Hung Nguyen, Thanh Hai Nguyen, Renaud Sirdey:
Improved compact formulations for a wide class of graph partitioning problems in sparse graphs. Discret. Optim. 25: 175-188 (2017) - [j18]Viet Hung Nguyen, Michel Minoux, Dang Phuong Nguyen:
Reduced-size formulations for metric and cut polyhedra in sparse graphs. Networks 69(1): 142-150 (2017) - [j17]Viet Hung Nguyen, Michel Minoux:
Improved linearized models for graph partitioning problem under capacity constraints. Optim. Methods Softw. 32(4): 892-903 (2017) - [c25]Viet Hung Nguyen, Paul Weng:
An Efficient Primal-Dual Algorithm for Fair Combinatorial Optimization Problems. COCOA (1) 2017: 324-339 - 2016
- [b2]Viet Hung Nguyen:
Contributions to natural and extended formulations for Combinatorial Optimization Problems: Applications to exact and approximation algorithms. Sorbonne University, Paris, France, 2016 - [j16]Viet Hung Nguyen, Michel Minoux, Dang Phuong Nguyen:
Improved compact formulations for metric and cut polyhedra. Electron. Notes Discret. Math. 52: 125-132 (2016) - [j15]Viet Hung Nguyen, Stanislav Dashevskyi, Fabio Massacci:
An automatic method for assessing the versions affected by a vulnerability. Empir. Softw. Eng. 21(6): 2268-2297 (2016) - [j14]Dang Phuong Nguyen, Michel Minoux, Viet Hung Nguyen, Thanh Hai Nguyen, Renaud Sirdey:
Stochastic graph partitioning: quadratic versus SOCP formulations. Optim. Lett. 10(7): 1505-1518 (2016) - [c24]Danwei Wang, Jeevanand Seshadrinath, Viet Hung Nguyen, Abhisek Ukil, Viswanathan Vaiyapuri, Sivakumar Nadarajan, M. Siva Rama Krishna:
A multiple indicator approach for FDI of inter-turn fault in induction machines. ICIT 2016: 128-133 - [c23]Viet Hung Nguyen, Danwei Wang, Jeevanand Seshadrinath, Sivakumar Nadarajan, Viswanathan Vaiyapuri:
Fault severity estimation using nonlinear Kalman filter for induction motors under inter-turn fault. IECON 2016: 1488-1493 - 2015
- [j13]Viet Hung Nguyen:
The maximum weight spanning star forest problem on cactus graphs. Discret. Math. Algorithms Appl. 7(2): 1550018:1-1550018:10 (2015) - [c22]Ming Yu, Yigang He, Hai Wang, Juan Xu, Danwei Wang, Viet Hung Nguyen:
Intelligent fault diagnosis of induction motor with stator winding fault. ICNC 2015: 730-735 - [c21]Viet Hung Nguyen, Danwei Wang, Abhisek Ukil, Sivakumar Nadarajan, Viswanathan Vaiyapuri, Chandana Jayampathi:
A closed-form solution to fault parameter estimation and faulty phase identification of stator winding inter-turn fault in induction machines. IECON 2015: 286-291 - 2014
- [b1]Viet Hung Nguyen:
Empirical Methods for Evaluating Vulnerability Models. University of Trento, Italy, 2014 - [j12]Jean François Maurras, Thanh Hai Nguyen, Viet Hung Nguyen:
On the linear description of the Huffman trees polytope. Discret. Appl. Math. 164: 225-236 (2014) - [j11]Fabio Massacci, Viet Hung Nguyen:
An Empirical Methodology to Evaluate Vulnerability Discovery Models. IEEE Trans. Software Eng. 40(12): 1147-1162 (2014) - [c20]Lamia Aoudia, Viet Hung Nguyen, Ali Ridha Mahjoub, Méziane Aïder:
On the star forest polytope. CoDIT 2014: 263-268 - [c19]Ming Yu, Danwei Wang, Abhisek Ukil, Viswanathan Vaiyapuri, Sivakumar Nadarajan, Chandana Jayampathi, Amit Kumar Gupta, Viet Hung Nguyen:
Model-based failure prediction for electric machines using particle filter. ICARCV 2014: 1811-1816 - [c18]Viet Hung Nguyen:
Approximating the Minimum Tour Cover with a Compact Linear Program. ICCSAMA 2014: 99-104 - 2013
- [j10]Viet Hung Nguyen:
A primal-dual approximation algorithm for the Asymmetric Prize-Collecting TSP. J. Comb. Optim. 25(2): 265-278 (2013) - [c17]Viet Hung Nguyen, Fabio Massacci:
The (un)reliability of NVD vulnerable versions data: an empirical experiment on Google Chrome vulnerabilities. AsiaCCS 2013: 493-498 - [c16]Thi Luong Nguyen, Linh Ha My, Viet Hung Nguyen, Nguyên Thi Minh Huyên, Phuong Le-Hong:
Building a treebank for Vietnamese dependency parsing. RIVF 2013: 147-151 - [i4]Viet Hung Nguyen, Fabio Massacci:
The (Un)Reliability of NVD Vulnerable Versions Data: an Empirical Experiment on Google Chrome Vulnerabilities. CoRR abs/1302.4133 (2013) - [i3]Viet Hung Nguyen, Fabio Massacci:
A Systematically Empirical Evaluation of Vulnerability Discovery Models: a Study on Browsers' Vulnerabilities. CoRR abs/1306.2476 (2013) - 2012
- [j9]Viet Hung Nguyen, Thi Thu Thuy Nguyen:
Approximating the asymmetric profitable tour. Int. J. Math. Oper. Res. 4(3): 294-301 (2012) - [c15]Viet Hung Nguyen, Fabio Massacci:
An independent validation of vulnerability discovery models. AsiaCCS 2012: 6-7 - [c14]Yann-Michel Niquet, Christophe Delerue, Viet Hung Nguyen, Christophe Krzeminski, François Triozon:
Transport properties of strained silicon nanowires. ESSDERC 2012: 290-293 - [c13]Viet Hung Nguyen, Fabio Massacci:
An Idea of an Independent Validation of Vulnerability Discovery Models. ESSoS 2012: 89-96 - [c12]Pierre Bonami, Viet Hung Nguyen, Michel Klein, Michel Minoux:
On the Solution of a Graph Partitioning Problem under Capacity Constraints. ISCO 2012: 285-296 - [i2]Viet Hung Nguyen, Fabio Massacci:
An Independent Validation of Vulnerability Discovery Models. CoRR abs/1203.5830 (2012) - 2011
- [j8]Viet Hung Nguyen:
Approximating the Minimum Tour Cover of a Digraph. Algorithms 4(2): 75-86 (2011) - [c11]Fabio Massacci, Stephan Neuhaus, Viet Hung Nguyen:
After-Life Vulnerabilities: A Study on Firefox Evolution, Its Vulnerabilities, and Fixes. ESSoS 2011: 195-208 - [p1]Tülin Atmaca, Viet Hung Nguyen:
Optical Metropolitan Networks: Packet Format, MAC Protocols and Quality of Service. Network Performance Engineering 2011: 808-834 - 2010
- [j7]Viet Hung Nguyen, Tülin Atmaca:
Metropolitan optical packet bus-based networks: Packet bursting and emulation of TDM services. Comput. Commun. 33(Supplement-1): S110-S121 (2010) - [j6]Viet Hung Nguyen, Thi Thu Thuy Nguyen:
Approximating the asymmetric profitable tour. Electron. Notes Discret. Math. 36: 907-914 (2010) - [j5]Jean François Maurras, Thanh Hai Nguyen, Viet Hung Nguyen:
On the Convex Hull of Huffman Trees. Electron. Notes Discret. Math. 36: 1009-1016 (2010) - [c10]Viet Hung Nguyen:
Approximation Algorithm for the Minimum Directed Tree Cover. COCOA (2) 2010: 144-159 - [c9]Viet Hung Nguyen:
A Primal-Dual Approximation Algorithm for the Asymmetric Prize-Collecting TSP. COCOA (1) 2010: 260-269 - [i1]Viet Hung Nguyen:
Approximating the minimum directed tree cover. CoRR abs/1004.3668 (2010)
2000 – 2009
- 2009
- [c8]Viet Hung Nguyen:
A 2log2(n)-Approximation Algorithm for Directed Tour Cover. COCOA 2009: 208-218 - [c7]Fabio Massacci, Viet Hung Nguyen:
Goal-Oriented Access Control Model for Ambient Assisted Living. PrimeLife 2009: 160-173 - 2008
- [j4]Viet Hung Nguyen, Tran Khanh Dang:
A Novel Solution to Query Assurance Verification for Dynamic Outsourced XML Databases. J. Softw. 3(4): 9-16 (2008) - [c6]M. Ali Aydin, Tülin Atmaca, Abdül Halim Zaim, Özgür Can Turna, Viet Hung Nguyen:
Performance Study of OBS Reservation Protocols. AICT 2008: 428-433 - 2007
- [j3]Viet Hung Nguyen:
Approximation algorithms for metric tree cover and generalized tour and tree covers. RAIRO Oper. Res. 41(3): 305-315 (2007) - [c5]Viet Hung Nguyen, Tran Khanh Dang, Nguyen Thanh Son, Josef Küng:
Query Assurance Verification for Dynamic Outsourced XML Databases. ARES 2007: 689-696 - 2006
- [c4]Viet Hung Nguyen, Tülin Atmaca:
Dynamic Intelligent MAC Protocol for Metropolitan Optical Packet Switching Ring Networks. ICC 2006: 2661-2668 - 2005
- [c3]Thaere Eido, Viet Hung Nguyen, Tülin Atmaca:
Dynamic Resource Allocation Algorithm for Metropolitan Optical Packet-Switched Ring Networks. AICT/SAPIR/ELETE 2005: 39-44 - 2004
- [c2]Viet Hung Nguyen, M. Ben Mamoun, Tülin Atmaca, Daniel Popa, Nicolas Le Sauze, Laurent Ciavaglia:
Performance Evaluation of Circuit Emulation Service in a Metropolitan Optical Ring Architecture. ICT 2004: 1173-1182 - 2002
- [j2]Viet Hung Nguyen, Jean François Maurras:
On the linear description of the 3-cycle polytope. Eur. J. Oper. Res. 137(2): 310-325 (2002) - 2001
- [c1]Jean François Maurras, Viet Hung Nguyen:
A Procedure of Facet Composition for the Symmetric Traveling Salesman Polytope. Combinatorial Optimization 2001: 134-146 - 2000
- [j1]Viet Hung Nguyen, Jean François Maurras:
A procedure of facet composition for the symmetric Traveling Salesman Polytope. Electron. Notes Discret. Math. 5: 251-252 (2000)
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-10-07 21:20 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:
