Martín Costa

26 papers A* 10A 1Journal 14Unranked 1
YearRankTypeTitle / Venue / Authors
2026 A* conf
Vizing's Theorem in Deterministic Almost-Linear Time.
SODA
Sepehr Assadi, Soheil Behnezhad, Sayan Bhattacharya, Martín Costa, Shay Solomon, Tianyi Zhang
2025 A* conf
Almost Optimal Fully Dynamic k-Center Clustering with Recourse.
ICML
Sayan Bhattacharya, Martín Costa, Ermiya Farokhnejad, Silvio Lattanzi, Nikos Parotsidis
2025 J jnl
Deterministic
CoRR
Martín Costa, Ermiya Farokhnejad
2025 A* conf
Deterministic k-Median Clustering in Near-Optimal Time.
ICALP
Martín Costa, Ermiya Farokhnejad
2025 A* conf
Even Faster (Δ + 1)-Edge Coloring via Shorter Multi-Step Vizing Chains.
SODA
Sayan Bhattacharya, Martín Costa, Shay Solomon, Tianyi Zhang
2025 J jnl
Fully Dynamic Euclidean k-Means.
CoRR
Sayan Bhattacharya, Martín Costa, Ermiya Farokhnejad, Shaofeng H.-C. Jiang, Yaonan Jin, Jianing Lou
2025 A* conf
Fully Dynamic k-Median with Near-Optimal Update Time and Recourse.
STOC
Sayan Bhattacharya, Martín Costa, Ermiya Farokhnejad
2025 J jnl
Vizing's Theorem in Deterministic Almost-Linear Time.
CoRR
Sepehr Assadi, Soheil Behnezhad, Sayan Bhattacharya, Martín Costa, Shay Solomon, Tianyi Zhang
2025 A* conf
Vizing's Theorem in Near-Linear Time.
STOC
Sepehr Assadi, Soheil Behnezhad, Sayan Bhattacharya, Martín Costa, Shay Solomon, Tianyi Zhang
2024 — conf
Arboricity-Dependent Algorithms for Edge Coloring.
SWAT
Sayan Bhattacharya, Martín Costa, Nadav Panski, Shay Solomon
2024 A conf
Density-Sensitive Algorithms for (Δ + 1)-Edge Coloring.
ESA
Sayan Bhattacharya, Martín Costa, Nadav Panski, Shay Solomon
2024 J jnl
Even Faster (Δ + 1)-Edge Coloring via Shorter Multi-Step Vizing Chains.
CoRR
Sayan Bhattacharya, Martín Costa, Shay Solomon, Tianyi Zhang
2024 J jnl
Faster (Δ + 1)-Edge Coloring: Breaking the m √n Time Barrier.
CoRR
Sayan Bhattacharya, Din Carmon, Martín Costa, Shay Solomon, Tianyi Zhang
2024 A* conf
Faster (Δ+1)-Edge Coloring: Breaking the m√n Time Barrier.
FOCS
Sayan Bhattacharya, Din Carmon, Martín Costa, Shay Solomon, Tianyi Zhang
2024 J jnl
Fully Dynamic
CoRR
Sayan Bhattacharya, Martín Costa, Naveen Garg, Silvio Lattanzi, Nikos Parotsidis
2024 J jnl
Fully Dynamic
CoRR
Sayan Bhattacharya, Martín Costa, Silvio Lattanzi, Nikos Parotsidis
2024 J jnl
Fully Dynamic
CoRR
Sayan Bhattacharya, Martín Costa, Ermiya Farokhnejad
2024 A* conf
Fully Dynamic k-Clustering with Fast Update Time and Small Recourse.
FOCS
Sayan Bhattacharya, Martín Costa, Naveen Garg, Silvio Lattanzi, Nikos Parotsidis
2024 J jnl
Graph Algorithms: Distributed Meets Dynamic (Dagstuhl Seminar 24471).
Dagstuhl Reports
Keren Censor-Hillel, Yasamin Nazari, Eva Rotenberg, Thatchaphol Saranurak, Martín Costa
2024 A* conf
Nibbling at Long Cycles: Dynamic (and Static) Edge Coloring in Optimal Time.
SODA
Sayan Bhattacharya, Martín Costa, Nadav Panski, Shay Solomon
2024 J jnl
Vizing's Theorem in Near-Linear Time.
CoRR
Sepehr Assadi, Soheil Behnezhad, Sayan Bhattacharya, Martín Costa, Shay Solomon, Tianyi Zhang
2023 J jnl
Arboricity-Dependent Algorithms for Edge Coloring.
CoRR
Sayan Bhattacharya, Martín Costa, Nadav Panski, Shay Solomon
2023 J jnl
Density-Sensitive Algorithms for (Δ+1)-Edge Coloring.
CoRR
Sayan Bhattacharya, Martín Costa, Nadav Panski, Shay Solomon
2023 J jnl
Fully Dynamic k-Clustering in Õ(k) Update Time.
CoRR
Sayan Bhattacharya, Martín Costa, Silvio Lattanzi, Nikos Parotsidis
2023 A* conf
Fully Dynamic k-Clustering in Õ(k) Update Time.
NeurIPS
Sayan Bhattacharya, Martín Costa, Silvio Lattanzi, Nikos Parotsidis
2023 J jnl
Nibbling at Long Cycles: Dynamic (and Static) Edge Coloring in Optimal Time.
CoRR
Sayan Bhattacharya, Martín Costa, Nadav Panski, Shay Solomon