| Representation of the non-dominated set in biobjective discrete optimization D Vaz, L Paquete, CM Fonseca, K Klamroth, M Stiglmayr Computers & Operations Research 63, 172-186, 2015 | 43 | 2015 |
| Hedonic coalition formation in networks M Hoefer, D Vaz, L Wagner Proceedings of the AAAI Conference on Artificial Intelligence 29 (1), 2015 | 26 | 2015 |
| Dynamics in matching and coalition formation games with structural constraints M Hoefer, D Vaz, L Wagner Artificial Intelligence 262, 222-247, 2018 | 24 | 2018 |
| Vertex sparsification for edge connectivity P Chalermsook, S Das, Y Kook, B Laekhanukit, YP Liu, R Peng, M Sellke, ... Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 | 22 | 2021 |
| Beyond metric embedding: Approximating group steiner trees on bounded treewidth graphs P Chalermsook, S Das, B Laekhanukit, D Vaz Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017 | 10 | 2017 |
| A note on the ϵ-indicator subset selection D Vaz, L Paquete, A Ponte Theoretical Computer Science 499, 113-116, 2013 | 10 | 2013 |
| Survivable network design for group connectivity in low-treewidth graphs P Chalermsook, S Das, G Even, B Laekhanukit, D Vaz arXiv preprint arXiv:1802.10403, 2018 | 9 | 2018 |
| New integrality gap results for the firefighters problem on trees P Chalermsook, D Vaz International Workshop on Approximation and Online Algorithms, 65-77, 2016 | 9 | 2016 |
| A note on fractional coloring and the integrality gap of LP for maximum weight independent set P Chalermsook, D Vaz Electronic Notes in Discrete Mathematics 55, 113-116, 2016 | 7 | 2016 |
| On approximating degree-bounded network design problems X Guo, G Kortsarz, B Laekhanukit, S Li, D Vaz, J Xian Algorithmica 84 (5), 1252-1278, 2022 | 6 | 2022 |
| Comparing the thermal performance and endurance of resistive and PIN silicon microheaters for phase-change photonic applications JR Erickson, NA Nobile, D Vaz, G Vinod, CAR Ocampo, Y Zhang, J Hu, ... Optical Materials Express 13 (6), 1677-1688, 2023 | 2 | 2023 |
| On the approximability of the traveling salesman problem with line neighborhoods A Antoniadis, S Kisfaludi-Bak, B Laekhanukit, D Vaz arXiv preprint arXiv:2008.12075, 2020 | 2 | 2020 |
| Approximating sparsest cut in low-treewidth graphs via combinatorial diameter P Chalermsook, M Kaul, M Mnich, J Spoerhase, S Uniyal, D Vaz ACM transactions on algorithms 20 (1), 1-20, 2024 | 1 | 2024 |
| Mimicking networks parameterized by connectivity P Chalermsook, S Das, B Laekhanukit, D Vaz arXiv preprint arXiv:1910.10665, 2019 | 1 | 2019 |
| On Approximating Degree-Bounded Network Design Problems X Guo, G Kortsarz, B Laekhanukit, S Li, D Vaz, J Xian arXiv preprint arXiv:1907.11404, 2019 | 1 | 2019 |
| Efficient paths by local search L Paquete, JL Santos, DJ Vaz Agra, Agostinho and Doostmohammadi, Mahdi (2011) A Polyhedral Study of Mixed …, 2011 | 1 | 2011 |
| High Efficiency of Exciton-Polariton Lasing in a 2D Multilayer Structure Y Fan, Q Wan, Q Yao, X Chen, Y Guan, H Alnatah, D Vaz, J Beaumariage, ... ACS Photonics, 2024 | | 2024 |
| Observation of exciton-polariton nano-laser in encapsulated bilayer WS2 Q Yao, J Beaumariage, Z Sun, D Vaz, K Watanabe, T Taniguchi, Y Fan, ... Bulletin of the American Physical Society, 2024 | | 2024 |
| Approximation algorithms for network design and cut problems in bounded-treewidth D Vaz Saarländische Universitäts-und Landesbibliothek, 2020 | | 2020 |
| Approximating Sparsest Cut in Low-Treewidth Graphs via Combinatorial Diameter M KAUL, M MNICH, J SPOERHASE, U SUMEDHA, D VAZ | | |
Parinya ChalermsookAalto University在 aalto.fi 的电子邮件经过验证
