Остановите войну!
for scientists:
default search action
Trung Thanh Nguyen 0004
Publications
- 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 - [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) - [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) - 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) - 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) - 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
- [i1]Khaled M. Elbassioni, Trung Thanh Nguyen:
Approximation Schemes for Binary Quadratic Programming Problems with Low cp-Rank Decompositions. CoRR abs/1411.5050 (2014)
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-04-25 05:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint