Evangelos Kipouridis

Evangelos Kipouridis

Max-Planck-Institut für Informatik
Saarland Informatics Campus
Campus E1 3
66123 Saarbrücken
E1 3 - 4.26
+49 681 9325 0
+49 681 9325 5719

Research Interests

  • (Hierarchical) Clustering
  • Graph Connectivity
  • Approximation Algorithms
  • Simple/Teachable Algorithms

Selected Publications

Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor.JACM (and FOCS 2021)
Vincent Cohen-Addad, Debarati Das, Evangelos Kipouridis, Nikos Parotsidis, Mikkel Thorup

A Simple Algorithm for Multiple-Source Shortest Paths in Planar Digraphs.SOSA 2022
Debarati Das, Evangelos Kipouridis, Maximilian P. Gutenberg, Christian Wulff-Nilsen

No Repetition: Fast and Reliable Sampling with Highly Concentrated Hashing.VLDB 2022
Anders Aamand, Debarati Das, Evangelos Kipouridis, Jakob B.T. Knudsen, Peter M. R. Rasmussen, Mikkel Thorup

Faster Computation of 3-Edge-Connected Components in Digraphs.SODA 2023
Loukas Georgiadis, Evangelos Kipouridis, Charis Papadopoulos, Nikos Parotsidis

Fitting Tree Metrics with Minimum Disagreements.ESA 2023, Track S
Evangelos Kipouridis

Dynamic Dynamic Time Warping.SODA 2024
Karl Bringmann, Nick Fischer, Ivor van der Hoog, Evangelos Kipouridis, Tomasz Kociumaka, Eva Rotenberg


Ph. D. student in Computer Science at Basic Algorithms Research Copenhagen (BARC) and the University of Copenhagen, under the supervision of Mikkel Thorup and Christian Wulff-Nilsen.