A* 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

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

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

Clustering to Minimize Cluster-Aware Norm Objectives.  SODA 2025
Martin G. Herold, Evangelos Kipouridis, Joachim Spoerhase

A Broader View on Clustering under Cluster-Aware Norm Objectives.  SODA 2026
Martin G. Herold, Evangelos Kipouridis, Joachim Spoerhase

Teachable Algorithms

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

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

Tree Violation Distance under Constraints.  SOSA 2026
Debarati Das, Evangelos Kipouridis, Joachim Spoerhase

Papers with Distinctions

Longest Common Subsequence on Weighted Sequences.  CPM 2020, Best Paper Award
Evangelos Kipouridis, Kostas Tsichlas

Towards Better-than-2 Approximation for Constrained Correlation Clustering. ICML 2025, Spotlight
Andreas Kalavas, Evangelos Kipouridis, Nithin Varma 

During 2023, along with Joachim Spoerhase and Philip Wellnitz, we organized ADFOCS '23, MPI's summer school.

2019-2022:
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.