Pdf: Theodoros Cartarescu

\section*Selected Contributions \beginenumerate[leftmargin=*] \item \textbfFast Distributed Algorithms for Approximate Steiner Trees, SIAM J. Comput., 2015. \\ Polylog‑time constant‑factor approximation. \item \textbfThe Price of Anarchy in Network Creation Games, STOC, 2017 (with Borgs, Mihail).\\ Tight bounds on selfish network formation. \item \textbfDynamic Graph Connectivity with Sublinear Update Time, JACM, 2019.\\ Deterministic $O(\tilde\sqrt n)$ update time. \item \textbfSubmodular Maximization under a Matroid Constraint in the Distributed Setting, FOCS, 2020.\\ $O(\log n)$ communication rounds, near‑optimal approximation. \item \textbfLearning‑Based Routing in Congested Networks, NeurIPS, 2022.\\ RL + queueing theory with provable guarantees. \item \textbfRobust Consensus under Byzantine Failures with Limited Bandwidth, ACM TOA, 2024.\\ Bandwidth‑optimal Byzantine consensus. \endenumerate

\section*Impact \beginitemize[leftmargin=*] \item h‑index $\approx$ 22 (2024) \item $\>$2,000 citations (Google Scholar) \item Frequently cited in surveys on distributed approximation and game‑theoretic network analysis. \enditemize theodoros cartarescu pdf

\section*Research Themes \beginitemize[leftmargin=*] \item Distributed \& Parallel Algorithms \item Graph Algorithms \& Network Design \item Combinatorial Optimization \item Algorithmic Game Theory \item Data Structures \enditemize \item \textbfThe Price of Anarchy in Network Creation