default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTrung Thanh Nguyen 0004
Person information
- affiliation: Hai Phong University, Department of Mathematics, Vietnam
- affiliation (PhD 2013): University of Düsseldorf, Germany
Other persons with the same name
- Trung Thanh Nguyen (aka: Trung-Thanh Nguyen) — disambiguation page
- Trung Thanh Nguyen 0001 — University of British Columbia
- Trung Thanh Nguyen 0002
![[0000-0002-3268-1790]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0000-0002-3268-1790")
— Liverpool John Moores University, UK (and 1 more) - Trung Thanh Nguyen 0003 — University of Bath
- Trung Thanh Nguyen 0005 — National University of Singapore, School of Computing
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c14]Trung Thanh Nguyen, Khaled Elbassioni, Jörg Rothe:
Complexity and Approximation Schemes for Social Welfare Maximization in the High-Multiplicity Setting. ECAI 2024: 3324-3331- 2023
- [j16]Trung Thanh Nguyen, Jörg Rothe:
Fair and efficient allocation with few agent types, few item types, or small value levels. Artif. Intell. 314: 103820 (2023) - [j15]Phuong N. H. Pham, Canh V. Pham, Hieu V. Duong, Václav Snásel, Trung Thanh Nguyen:
Minimizing cost for influencing target groups in social network: A model and algorithmic approach. Comput. Commun. 212: 182-197 (2023) - [j14]Trung Thanh Nguyen, Nguyen Cong Luong, Shaohan Feng, Khaled M. Elbassioni, Dusit Niyato:
Jamming-Based Covert Communication for Rate-Splitting Multiple Access. IEEE Trans. Veh. Technol. 72(8): 11074-11079 (2023) - [j13]Trung Thanh Nguyen, Nguyen Cong Luong, Shaohan Feng, Tien Hoa Nguyen, Khaled Elbassioni, Dusit Niyato, Dong In Kim:
Joint Rate Allocation and Power Control for RSMA-Based Communication and Radar Coexistence Systems. IEEE Trans. Veh. Technol. 72(11): 14673-14687 (2023) - [c13]Trung Thanh Nguyen, Nguyen Cong Luong, Shaohan Feng, Khaled Elbassioni, Dusit Niyato, Dong In Kim:
Joint Rate Allocation and Power Control for RSMA-Based Communication and Radar Coexistence Systems. GLOBECOM 2023: 6675-6680 - [c12]Trung Thanh Nguyen, Jörg Rothe:
Complexity Results and Exact Algorithms for Fair Division of Indivisible Items: A Survey. IJCAI 2023: 6732-6740 - [i5]Trung Thanh Nguyen, Nguyen Cong Luong, Shaohan Feng, Tien-Hoa Nguyen, Khaled M. Elbassioni, Dusit Niyato, Dong In Kim:
Joint Rate Allocation and Power Control for RSMA-Based Communication and Radar Coexistence Systems. CoRR abs/2303.17392 (2023) - [i4]Trung Thanh Nguyen, Khaled Elbassioni, Areg Karapetyan, Majid Khonji:
Improved Approximation Guarantees for Power Scheduling Problems With Sum-of-Squares Constraints. CoRR abs/2312.15432 (2023) - 2022
- [j12]Trung Thanh Nguyen, Khaled M. Elbassioni, Nguyen Cong Luong, Dusit Niyato, Dong In Kim:
Access Management in Joint Sensing and Communication Systems: Efficiency Versus Fairness. IEEE Trans. Veh. Technol. 71(5): 5128-5142 (2022) - 2021
- [j11]Trung Thanh Nguyen, Khaled M. Elbassioni:
A PTAS for a class of binary non-linear programs with low-rank functions. Oper. Res. Lett. 49(5): 633-638 (2021) - [j10]Trung Thanh Nguyen, Jörg Rothe:
Improved bi-criteria approximation schemes for load balancing on unrelated machines with cost constraints. Theor. Comput. Sci. 858: 35-48 (2021) - [c11]Phuong N. H. Pham, Canh V. Pham, Hieu V. Duong, Trung Thanh Nguyen, My T. Thai:
Groups Influence with Minimum Cost in Social Networks. CSoNet 2021: 231-242 - [i3]Trung Thanh Nguyen, Khaled M. Elbassioni, Nguyen Cong Luong, Dusit Niyato, Dong In Kim:
Access Management in Joint Sensing and Communication Systems: Efficiency versus Fairness. CoRR abs/2111.04217 (2021) - 2020
- [c10]Trung Thanh Nguyen, Jörg Rothe:
Approximate Pareto Set for Fair and Efficient Allocation: Few Agent Types or Few Resource Types. IJCAI 2020: 290-296 - [c9]Trung Thanh Nguyen, Jörg Rothe:
Bi-Criteria Approximation Algorithms for Load Balancing on Unrelated Machines with Costs. ISAAC 2020: 14:1-14:14
2010 – 2019
- 2019
- [j9]Khaled M. Elbassioni, Areg Karapetyan, Trung Thanh Nguyen:
Approximation schemes for r-weighted Minimization Knapsack problems. Ann. Oper. Res. 279(1-2): 367-386 (2019) - [j8]Zaid Almahmoud, Jacob W. Crandall, Khaled M. Elbassioni, Trung Thanh Nguyen, Mardavij Roozbehani:
Dynamic Pricing in Smart Grids Under Thresholding Policies. IEEE Trans. Smart Grid 10(3): 3415-3429 (2019) - 2018
- [j7]Tobias Heinen, Nhan-Tam Nguyen, Trung Thanh Nguyen, Jörg Rothe:
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. 32(6): 741-778 (2018) - 2017
- [j6]Dorothea Baumeister, Sylvain Bouveret, Jérôme Lang, Nhan-Tam Nguyen, Trung Thanh Nguyen, Jörg Rothe, Abdallah Saffidine:
Positional scoring-based allocation of indivisible goods. Auton. Agents Multi Agent Syst. 31(3): 628-655 (2017) - [j5]Khaled M. Elbassioni, Trung Thanh Nguyen:
Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions. Discret. Appl. Math. 230: 56-70 (2017) - [j4]Khaled M. Elbassioni, Trung Thanh Nguyen:
A polynomial-time algorithm for computing low CP-rank decompositions. Inf. Process. Lett. 118: 10-14 (2017) - [c8]Nhan-Tam Nguyen, Trung Thanh Nguyen, Jörg Rothe:
Approximate Solutions To Max-Min Fair and Proportionally Fair Allocations of Indivisible Goods. AAMAS 2017: 262-271 - 2016
- [i2]Zaid Almahmoud, Jacob W. Crandall, Khaled M. Elbassioni, Trung Thanh Nguyen, Mardavij Roozbehani:
Dynamic Pricing in Smart Grids under Thresholding Policies: Algorithms and Heuristics. CoRR abs/1610.07559 (2016) - 2015
- [c7]Khaled M. Elbassioni, Trung Thanh Nguyen:
Approximation Schemes for Multi-objective Optimization with Quadratic Constraints of Fixed CP-Rank. ADT 2015: 273-287 - 2014
- [j3]Nhan-Tam Nguyen, Trung Thanh Nguyen, Magnus Roos, Jörg Rothe:
Computational complexity and approximability of social welfare optimization in multiagent resource allocation. Auton. Agents Multi Agent Syst. 28(2): 256-289 (2014) - [j2]Trung Thanh Nguyen, Jörg Rothe:
Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods. Discret. Appl. Math. 179: 54-68 (2014) - [c6]Dorothea Baumeister, Sylvain Bouveret, Jérôme Lang, Nhan-Tam Nguyen, Trung Thanh Nguyen, Jörg Rothe:
Scoring Rules for the Allocation of Indivisible Goods. ECAI 2014: 75-80 - [i1]Khaled M. Elbassioni, Trung Thanh Nguyen:
Approximation Schemes for Binary Quadratic Programming Problems with Low cp-Rank Decompositions. CoRR abs/1411.5050 (2014) - 2013
- [b1]Trung Thanh Nguyen:
Approximierbarkeit und Unapproximierbarkeit der Optimierung der sozialen Wohlfahrt im Bereich der Multiagenten-Systeme. Heinrich Heine University Düsseldorf, 2013 - [j1]Trung Thanh Nguyen, Magnus Roos, Jörg Rothe:
A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation. Ann. Math. Artif. Intell. 68(1-3): 65-90 (2013) - [c5]Trung Thanh Nguyen, Jörg Rothe:
How to Decrease the Degree of Envy in Allocations of Indivisible Goods. ADT 2013: 271-284 - [c4]Trung Thanh Nguyen, Jörg Rothe:
Envy-ratio and average-nash social welfare optimization in multiagent resource allocation. AAMAS 2013: 1139-1140 - 2012
- [c3]Nhan-Tam Nguyen, Trung Thanh Nguyen, Magnus Roos, Jörg Rothe:
Complexity and approximability of social welfare optimization in multiagent resource allocation. AAMAS 2012: 1287-1288 - [c2]Trung Thanh Nguyen, Magnus Roos, Jörg Rothe:
A Survey of Approximability and Inapproximability Results for Social Welfare Optimization in Multiagent Resource Allocation. ISAIM 2012 - [c1]Nhan-Tam Nguyen, Trung Thanh Nguyen, Jörg Rothe:
Complexity and Approximability of Egalitarian Nash Product Social Welfare Optimization in Multiagent Resource Allocation. STAIRS 2012: 204-215
Coauthor Index
aka: Khaled Elbassioni
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-11-13 23:50 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:
