Martín Costa

Email: martin[dot]costa[at]warwick[dot]ac[dot]uk

Office: CS2.18, Department of Computer Science

[LinkedIn] [GitHub] [Google Scholar] [DBLP]

About Me

I am a PhD student in the Department of Computer Science at the University of Warwick working under the supervision of Sayan Bhattacharya. My research is primarily in the area of dynamic algorithms. I am currently working as a student researcher in the Graph Mining Team at Google Research.

My research is being funded by the Engineering and Physical Sciences Research Council. I am also a member of the Theory and Foundations group and the Centre for Discrete Mathematics and its Applications (DIMAP).

Before starting my PhD, I received my Master of Engineering in Discrete Mathematics from the University of Warwick.

Research Interests

My research interests primarily lie within the field of algorithms, with a particular focus on dynamic algorithms, graph algorithms and clustering algorithms. Two problems that I am particularly interested in are k-clustering and edge coloring—and all of their static, dynamic, distributed and online variants.

Publications

Sayan Bhattacharya, Martín Costa, Naveen Garg, Silvio Lattanzi, Nikos Parotsidis

Foundations of Computer Science (FOCS) 2024 (Chicago, USA)

Sayan Bhattacharya, Din Carmon, Martín Costa, Shay Solomon, Tianyi Zhang

Foundations of Computer Science (FOCS) 2024 (Chicago, USA)

Sayan Bhattacharya, Martín Costa, Nadav Panski, Shay Solomon

European Symposium on Algorithms (ESA) 2024 (London, UK)

Sayan Bhattacharya, Martín Costa, Nadav Panski, Shay Solomon

Scandinavian Symposium on Algorithm Theory (SWAT) 2024 (Helsinki, Finland)

Sayan Bhattacharya, Martín Costa, Nadav Panski, Shay Solomon

Symposium on Discrete Algorithms (SODA) 2024 (Alexandria, USA)

Sayan Bhattacharya, Martín Costa, Silvio Lattanzi, Nikos Parotsidis

Neural Information Processing Systems (NeurIPS) 2023 (New Orleans, USA)


Unless stated otherwise, author names are listed in alphabetical order.

Selected Talks

Fully Dynamic k-Clustering with Fast Update Time and Small Recourse

Faster (Δ + 1)-Edge Coloring: Breaking the m√n Time Barrier

Density-Sensitive Algorithms for (Δ + 1)-Edge Coloring

Arboricity-Dependent Algorithms for Edge Coloring

Nibbling at Long Cycles: Dynamic (and Static) Edge Coloring in Optimal Time

Fully Dynamic k-Clustering in Õ(k) Update Time

Streaming Edge Coloring

Online Edge Coloring (Updated slides)

Conferences and Workshops

I have attended or been involved in the following conferences and workshops.

I have been an external reviewer for ESA 2024, SODA 2025, 2024, ICALP 2024, 2023, SEA 2023, and SOSA 2023.

Teaching

I am a Senior Graduate Teaching Assistant at the University of Warwick and I have been involved in teaching the following courses.

Awards and Prizes