Trung Thanh Nguyen

Orcid: 0000-0002-8102-4244

Affiliations:
  • Hai Phong University, Department of Mathematics, Vietnam
  • University of Düsseldorf, Germany (PhD 2013)


According to our database1, Trung Thanh Nguyen authored at least 32 papers between 2012 and 2023.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Minimizing cost for influencing target groups in social network: A model and algorithmic approach.
Comput. Commun., December, 2023

Joint Rate Allocation and Power Control for RSMA-Based Communication and Radar Coexistence Systems.
IEEE Trans. Veh. Technol., November, 2023

Jamming-Based Covert Communication for Rate-Splitting Multiple Access.
IEEE Trans. Veh. Technol., August, 2023

Improved Approximation Guarantees for Power Scheduling Problems With Sum-of-Squares Constraints.
CoRR, 2023

Fair and efficient allocation with few agent types, few item types, or small value levels.
Artif. Intell., 2023

Complexity Results and Exact Algorithms for Fair Division of Indivisible Items: A Survey.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Joint Rate Allocation and Power Control for RSMA-Based Communication and Radar Coexistence Systems.
Proceedings of the IEEE Global Communications Conference, 2023

2022
Access Management in Joint Sensing and Communication Systems: Efficiency Versus Fairness.
IEEE Trans. Veh. Technol., 2022

2021
Improved bi-criteria approximation schemes for load balancing on unrelated machines with cost constraints.
Theor. Comput. Sci., 2021

A PTAS for a class of binary non-linear programs with low-rank functions.
Oper. Res. Lett., 2021

Groups Influence with Minimum Cost in Social Networks.
Proceedings of the Computational Data and Social Networks - 10th International Conference, 2021

2020
Bi-Criteria Approximation Algorithms for Load Balancing on Unrelated Machines with Costs.
Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

Approximate Pareto Set for Fair and Efficient Allocation: Few Agent Types or Few Resource Types.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

2019
Dynamic Pricing in Smart Grids Under Thresholding Policies.
IEEE Trans. Smart Grid, 2019

Approximation schemes for r-weighted Minimization Knapsack problems.
Ann. Oper. Res., 2019

2018
Approximation and complexity of the optimization and existence problems for maximin share, proportional share, and minimax share allocation of indivisible goods.
Auton. Agents Multi Agent Syst., 2018

2017
A polynomial-time algorithm for computing low CP-rank decompositions.
Inf. Process. Lett., 2017

Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions.
Discret. Appl. Math., 2017

Positional scoring-based allocation of indivisible goods.
Auton. Agents Multi Agent Syst., 2017

Approximate Solutions To Max-Min Fair and Proportionally Fair Allocations of Indivisible Goods.
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

2016
Dynamic Pricing in Smart Grids under Thresholding Policies: Algorithms and Heuristics.
CoRR, 2016

2015
Approximation Schemes for Multi-objective Optimization with Quadratic Constraints of Fixed CP-Rank.
Proceedings of the Algorithmic Decision Theory - 4th International Conference, 2015

2014
Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods.
Discret. Appl. Math., 2014

Approximation Schemes for Binary Quadratic Programming Problems with Low cp-Rank Decompositions.
CoRR, 2014

Computational complexity and approximability of social welfare optimization in multiagent resource allocation.
Auton. Agents Multi Agent Syst., 2014

Scoring Rules for the Allocation of Indivisible Goods.
Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014

2013
Approximierbarkeit und Unapproximierbarkeit der Optimierung der sozialen Wohlfahrt im Bereich der Multiagenten-Systeme.
PhD thesis, 2013

A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation.
Ann. Math. Artif. Intell., 2013

Envy-ratio and average-nash social welfare optimization in multiagent resource allocation.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2013

How to Decrease the Degree of Envy in Allocations of Indivisible Goods.
Proceedings of the Algorithmic Decision Theory - Third International Conference, 2013

2012
Complexity and Approximability of Egalitarian Nash Product Social Welfare Optimization in Multiagent Resource Allocation.
Proceedings of the STAIRS 2012, 2012

Complexity and approximability of social welfare optimization in multiagent resource allocation.
Proceedings of the International Conference on Autonomous Agents and Multiagent Systems, 2012


  Loading...