Deterministic rounding of dynamic fractional matchings S Bhattacharya, P Kiss
arXiv preprint arXiv:2105.01615, 2021
31 2021 Dynamic matching with better-than-2 approximation in polylogarithmic update time S Bhattacharya, P Kiss, T Saranurak, D Wajc
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
23 2023 Dynamic algorithms for packing-covering lps via multiplicative weight updates S Bhattacharya, P Kiss, T Saranurak
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
18 2023 Deterministic dynamic matching in worst-case update time P Kiss
arXiv preprint arXiv:2108.10461, 2021
18 2021 Deep learning–based atherosclerotic coronary plaque segmentation on coronary CT angiography N Jávorszky, B Homonnay, G Gerstenblith, D Bluemke, P Kiss, M Török, ...
European radiology 32 (10), 7217-7226, 2022
13 2022 Sublinear Algorithms for (1.5+ 𝜖)-Approximate Matching S Bhattacharya, P Kiss, T Saranurak
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 254-266, 2023
12 2023 Dynamic (1+\epsilon): approximate matching size in truly sublinear update time S Bhattacharya, P Kiss, T Saranurak
Annual Symposium on Foundations of Computer Science, 2023
11 2023 Improving update times of dynamic matching algorithms from amortized to worst case P Kiss
Proceedings of the 13th Innovations in Theoretical Computer Science …, 2022
10 2022 Dynamic (1+ ϵ)-approximate matching size in truly sublinear update time S Bhattacharya, P Kiss, T Saranurak
2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023
8 2023 Incremental J Blikstad, P Kiss
arXiv preprint arXiv:2302.08432, 2023
7 2023 Near-optimal dynamic rounding of fractional matchings in bipartite graphs S Bhattacharya, P Kiss, A Sidford, D Wajc
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 59-70, 2024
3 2024 Dynamic (1.5+ Epsilon)-Approximate Matching Size in Truly Sublinear Update Time S Bhattacharya, P Kiss, T Saranurak
arXiv preprint arXiv:2302.05030, 2023
1 2023 Sublinear Algorithms for S Bhattacharya, P Kiss, T Saranurak
arXiv preprint arXiv:2212.00189, 2022
2022 Dynamic Algorithms for Packing-Covering LPs via Multiplicative Weight S Bhattacharya, P Kiss, T Saranurak
Annual ACM-SIAM Symposium on Discrete Algorithms, 2022
2022 
Sayan BhattacharyaUniversity of WarwickBestätigte E-Mail-Adresse bei warwick.ac.uk
