Viet Hung Nguyen

Orcid: 0000-0001-6729-3520

According to our database1, Viet Hung Nguyen authored at least 81 papers between 2000 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A branch-and-cut algorithm for the balanced traveling salesman problem.
J. Comb. Optim., March, 2024

Generalized nash fairness solutions for bi-objective minimization problems.
Networks, January, 2024

Using deep graph learning to improve dynamic analysis-based malware detection in PE files.
J. Comput. Virol. Hacking Tech., 2024

Deep clustering hierarchical latent representation for anomaly-based cyber-attack detection.
Knowl. Based Syst., 2024

Scalable and resilient 360-degree-video adaptive streaming over HTTP/2 against sudden network drops.
Comput. Commun., 2024

Proportional Fairness for Combinatorial Optimization.
Proceedings of the LATIN 2024: Theoretical Informatics, 2024

Solving Maximum Cut Problem with Multi-objective Enhance Quantum Approximate Optimization Algorithm.
Proceedings of the Computational Science and Its Applications - ICCSA 2024 Workshops, 2024

Solving Quadratic Knapsack Problem with Biased Quantum State Optimization Algorithm.
Proceedings of the Metaheuristics - 15th International Conference, 2024

Solving Edge-Weighted Maximum Clique Problem with DCA Warm-Start Quantum Approximate Optimization Algorithm.
Proceedings of the Metaheuristics - 15th International Conference, 2024

On the Kalai-Smorodinsky Solutions for Bi-objective Spanning Tree Problem.
Proceedings of the Algorithmic Aspects in Information and Management, 2024

2023
Improve the Quantum Approximate Optimization Algorithm with Genetic Algorithm.
Proceedings of the 12th International Symposium on Information and Communication Technology, 2023

Log Analysis For Network Attack Detection Using Deep Learning Models.
Proceedings of the 12th International Symposium on Information and Communication Technology, 2023

Pickup and Delivery Problem with Cooperative Robots.
Proceedings of the 12th International Symposium on Information and Communication Technology, 2023

Deep Nested Clustering Auto-Encoder for Anomaly-Based Network Intrusion Detection.
Proceedings of the International Conference on Computing and Communication Technologies, 2023

Improving Subtour Elimination Constraint Generation in Branch-and-Cut Algorithms for the TSP with Machine Learning.
Proceedings of the Learning and Intelligent Optimization - 17th International Conference, 2023

Hybrid of Deep Auto-Encoder and Maximum Mean Discrepancy for Cyber Reconnaissance Detection.
Proceedings of the 15th International Conference on Knowledge and Systems Engineering, 2023

2022
Optimal deterministic and robust selection of electricity contracts.
J. Glob. Optim., 2022

Retina-based quality assessment of tile-coded 360-degree videos.
EAI Endorsed Trans. Ind. Networks Intell. Syst., 2022

Integrative Few-Shot Classification and Segmentation for Landslide Detection.
IEEE Access, 2022

A comparative study of linearization methods for Ordered Weighted Average.
Proceedings of the 12th International Workshop on Resilient Networks Design and Modeling, 2022

udCATS: A Comprehensive Unsupervised Deep Learning Framework for Detecting Collective Anomalies in Time Series.
Proceedings of the Seventh International Conference on Research in Intelligent and Computing in Engineering, 2022

A Novel Deep Clustering Variational Auto-Encoder for Anomaly-based Network Intrusion Detection.
Proceedings of the 14th International Conference on Knowledge and Systems Engineering, 2022

Nash Balanced Assignment Problem.
Proceedings of the Combinatorial Optimization - 7th International Symposium, 2022

Nash fairness solutions for balanced TSP.
Proceedings of the 10th International Network Optimization Conference, 2022

2021
Linear size MIP formulation of Max-Cut: new properties, links with cycle inequalities and computational results.
Optim. Lett., 2021

An integer programming model for minimizing energy cost in water distribution system using trigger levels with additional time slots.
Proceedings of the RIVF International Conference on Computing and Communication Technologies, 2021

Automatically Estimate Clusters in Autoencoder-based Clustering Model for Anomaly Detection.
Proceedings of the RIVF International Conference on Computing and Communication Technologies, 2021

Landslide Detection with Unmanned Aerial Vehicles.
Proceedings of the International Conference on Multimedia Analysis and Pattern Recognition, 2021

2020
A multi-scale context encoder for high quality restoration of facial images.
Proceedings of the International Conference on Multimedia Analysis and Pattern Recognition, 2020

Clustering-Based Deep Autoencoders for Network Anomaly Detection.
Proceedings of the Future Data and Security Engineering - 7th International Conference, 2020

A Deep Double-Q Learning-based Scheme for Anti-Jamming Communications.
Proceedings of the 28th European Signal Processing Conference, 2020

2019
On the star forest polytope for trees and cycles.
RAIRO Oper. Res., 2019

An Empirical Evaluation of Selfish Mining and Strategic Mining in Proof-of-Work Blockchain with Multiple Miners.
CoRR, 2019

Selfish Mining in Proof-of-Work Blockchain with Multiple Miners: An Empirical Evaluation.
Proceedings of the PRIMA 2019: Principles and Practice of Multi-Agent Systems, 2019

Towards a UMLS-Integratable Vietnamese Medical Terminology.
Proceedings of the Computational Linguistics, 2019

2017
Improved linearized models for graph partitioning problem under capacity constraints.
Optim. Methods Softw., 2017

Reduced-size formulations for metric and cut polyhedra in sparse graphs.
Networks, 2017

Improved compact formulations for a wide class of graph partitioning problems in sparse graphs.
Discret. Optim., 2017

An Efficient Primal-Dual Algorithm for Fair Combinatorial Optimization Problems.
Proceedings of the Combinatorial Optimization and Applications, 2017

2016
Stochastic graph partitioning: quadratic versus SOCP formulations.
Optim. Lett., 2016

An automatic method for assessing the versions affected by a vulnerability.
Empir. Softw. Eng., 2016

Improved compact formulations for metric and cut polyhedra.
Electron. Notes Discret. Math., 2016

Fault severity estimation using nonlinear Kalman filter for induction motors under inter-turn fault.
Proceedings of the IECON 2016, 2016

A multiple indicator approach for FDI of inter-turn fault in induction machines.
Proceedings of the IEEE International Conference on Industrial Technology, 2016

Contributions to natural and extended formulations for Combinatorial Optimization Problems: Applications to exact and approximation algorithms.
, 2016

2015
The maximum weight spanning star forest problem on cactus graphs.
Discret. Math. Algorithms Appl., 2015

A closed-form solution to fault parameter estimation and faulty phase identification of stator winding inter-turn fault in induction machines.
Proceedings of the IECON 2015, 2015

Intelligent fault diagnosis of induction motor with stator winding fault.
Proceedings of the 11th International Conference on Natural Computation, 2015

2014
Empirical Methods for Evaluating Vulnerability Models.
PhD thesis, 2014

An Empirical Methodology to Evaluate Vulnerability Discovery Models.
IEEE Trans. Software Eng., 2014

On the linear description of the Huffman trees polytope.
Discret. Appl. Math., 2014

Approximating the Minimum Tour Cover with a Compact Linear Program.
Proceedings of the Advanced Computational Methods for Knowledge Engineering, 2014

Model-based failure prediction for electric machines using particle filter.
Proceedings of the 13th International Conference on Control Automation Robotics & Vision, 2014

On the star forest polytope.
Proceedings of the International Conference on Control, 2014

2013
A primal-dual approximation algorithm for the Asymmetric Prize-Collecting TSP.
J. Comb. Optim., 2013

A Systematically Empirical Evaluation of Vulnerability Discovery Models: a Study on Browsers' Vulnerabilities.
CoRR, 2013

Building a treebank for Vietnamese dependency parsing.
Proceedings of the 2013 IEEE RIVF International Conference on Computing and Communication Technologies, 2013

The (un)reliability of NVD vulnerable versions data: an empirical experiment on Google Chrome vulnerabilities.
Proceedings of the 8th ACM Symposium on Information, Computer and Communications Security, 2013

2012
On the Solution of a Graph Partitioning Problem under Capacity Constraints.
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

An Idea of an Independent Validation of Vulnerability Discovery Models.
Proceedings of the Engineering Secure Software and Systems - 4th International Symposium, 2012

Transport properties of strained silicon nanowires.
Proceedings of the 2012 European Solid-State Device Research Conference, 2012

An independent validation of vulnerability discovery models.
Proceedings of the 7th ACM Symposium on Information, Compuer and Communications Security, 2012

2011
Optical Metropolitan Networks: Packet Format, MAC Protocols and Quality of Service.
Proceedings of the Network Performance Engineering, 2011

Approximating the Minimum Tour Cover of a Digraph.
Algorithms, 2011

After-Life Vulnerabilities: A Study on Firefox Evolution, Its Vulnerabilities, and Fixes.
Proceedings of the Engineering Secure Software and Systems - Third International Symposium, 2011

2010
Approximating the asymmetric profitable tour.
Electron. Notes Discret. Math., 2010

On the Convex Hull of Huffman Trees.
Electron. Notes Discret. Math., 2010

Approximating the minimum directed tree cover
CoRR, 2010

Metropolitan optical packet bus-based networks: Packet bursting and emulation of TDM services.
Comput. Commun., 2010

Approximation Algorithm for the Minimum Directed Tree Cover.
Proceedings of the Combinatorial Optimization and Applications, 2010

2009
Goal-Oriented Access Control Model for Ambient Assisted Living.
Proceedings of the Privacy and Identity Management for Life, 2009

A 2log2(n)-Approximation Algorithm for Directed Tour Cover.
Proceedings of the Combinatorial Optimization and Applications, 2009

2008
A Novel Solution to Query Assurance Verification for Dynamic Outsourced XML Databases.
J. Softw., 2008

Performance Study of OBS Reservation Protocols.
Proceedings of the Fourth Advanced International Conference on Telecommunications, 2008

2007
Approximation algorithms for metric tree cover and generalized tour and tree covers.
RAIRO Oper. Res., 2007

Query Assurance Verification for Dynamic Outsourced XML Databases.
Proceedings of the The Second International Conference on Availability, 2007

2006
Dynamic Intelligent MAC Protocol for Metropolitan Optical Packet Switching Ring Networks.
Proceedings of IEEE International Conference on Communications, 2006

2005
Dynamic Resource Allocation Algorithm for Metropolitan Optical Packet-Switched Ring Networks.
Proceedings of the Telecommunications 2005: Advanced Industrial Conference on Telecommunications / Service Assurance with Partial and Intermittent Resources Conference / E-Learning on Telecommunications Workshop (AICT / SAPIR / ELETE 2005), 2005

2004
Performance Evaluation of Circuit Emulation Service in a Metropolitan Optical Ring Architecture.
Proceedings of the Telecommunications and Networking, 2004

2002
On the linear description of the 3-cycle polytope.
Eur. J. Oper. Res., 2002

2000
A procedure of facet composition for the symmetric Traveling Salesman Polytope.
Electron. Notes Discret. Math., 2000


  Loading...