Takip et
Martín Costa
Martín Costa
University of Warwick
warwick.ac.uk üzerinde doğrulanmış e-posta adresine sahip - Ana Sayfa
Başlık
Alıntı yapanlar
Alıntı yapanlar
Yıl
Nibbling at long cycles: Dynamic (and static) edge coloring in optimal time
S Bhattacharya, M Costa, N Panski, S Solomon
Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024
142024
Faster -Edge Coloring: Breaking the Time Barrier
S Bhattacharya, D Carmon, M Costa, S Solomon, T Zhang
65th IEEE Symposium on Foundations of Computer Science (FOCS), 2024
102024
Arboricity-Dependent Algorithms for Edge Coloring
S Bhattacharya, M Costa, N Panski, S Solomon
arXiv preprint arXiv:2311.08367, 2023
92023
Density-Sensitive Algorithms for -Edge Coloring
S Bhattacharya, M Costa, N Panski, S Solomon
arXiv preprint arXiv:2307.02415, 2023
92023
Fully Dynamic -Clustering in Update Time
S Bhattacharya, M Costa, S Lattanzi, N Parotsidis
Advances in Neural Information Processing Systems 36, 2024
8*2024
Vizing's Theorem in Near-Linear Time
S Assadi, S Behnezhad, S Bhattacharya, M Costa, S Solomon, T Zhang
arXiv preprint arXiv:2410.05240, 2024
32024
Fully Dynamic -Clustering with Fast Update Time and Small Recourse
S Bhattacharya, M Costa, N Garg, S Lattanzi, N Parotsidis
65th IEEE Symposium on Foundations of Computer Science (FOCS), 2024
32024
Even Faster -Edge Coloring via Shorter Multi-Step Vizing Chains
S Bhattacharya, M Costa, S Solomon, T Zhang
36th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) 2025, 2024
22024
Fully Dynamic -Median with Near-Optimal Update Time and Recourse
S Bhattacharya, M Costa, E Farokhnejad
arXiv preprint arXiv:2411.03121, 2024
2024
Fully Dynamic -Center Clustering Made Simple
S Bhattacharya, M Costa, S Lattanzi, N Parotsidis
arXiv preprint arXiv:2410.11470, 2024
2024
Sistem, işlemi şu anda gerçekleştiremiyor. Daha sonra yeniden deneyin.
Makaleler 1–10