| An Approximation Algorithm for Uniform Capacitated k-Median Problem with 1+ε Capacity Violation J Byrka, B Rybicki, S Uniyal International Conference on Integer Programming and Combinatorial …, 2016 | 51 | 2016 |
| Improved approximation algorithms for unsplittable flow on a path with time windows F Grandoni, S Ingala, S Uniyal International Workshop on Approximation and Online Algorithms, 13-24, 2015 | 17 | 2015 |
| Multi-transversals for Triangles and the Tuza's Conjecture P Chalermsook, S Khuller, P Sukprasert, S Uniyal Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020 | 7 | 2020 |
| A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints E Mizrachi, R Schwartz, J Spoerhase, S Uniyal 46th International Colloquium on Automata, Languages, and Programming (ICALP …, 2019 | 7 | 2019 |
| A Tight Extremal Bound on the Lovász Cactus Number in Planar Graphs P Chalermsook, A Schmid, S Uniyal 36th International Symposium on Theoretical Aspects of Computer Science …, 2019 | 2 | 2019 |
| 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 |
| PTAS for Steiner Tree on Map Graphs J Byrka, M Lewandowski, SM Meesum, J Spoerhase, S Uniyal Latin American Symposium on Theoretical Informatics, 3-14, 2020 | 1 | 2020 |
| Local Optimization Algorithms for Maximum Planar Subgraph G Călinescu, S Uniyal | | 2024 |
| Approximation Algorithms for Network Design Problems S Uniyal Università della Svizzera Italiana, 2017 | | 2017 |
Jarek ByrkaUniversity of Wroclaw在 cs.uni.wroc.pl 的电子邮件经过验证
