Deterministic rounding of dynamic fractional matchings S Bhattacharya, P Kiss
arXiv preprint arXiv:2105.01615, 2021
30 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
19 2023 Deterministic dynamic matching in worst-case update time P Kiss
arXiv preprint arXiv:2108.10461, 2021
16 2021 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
15 2023 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
9 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
9 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
9 2022 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
8 2022 Incremental -approximate dynamic matching in update time J Blikstad, P Kiss
arXiv preprint arXiv:2302.08432, 2023
6 2023 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
4 2023 Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs S Bhattacharya, P Kiss, A Sidford, D Wajc
arXiv preprint arXiv:2306.11828, 2023
2 2023 Sublinear Algorithms for -Approximate Matching 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