5 citations · 8 across the 12 of their papers we have counts for
17 papers
Metric Weighted Edit Distance: -Approximation in Time
Debarati Das, Evangelos Kipouridis, Tomasz Kociumaka
For every , we give a randomized -approximation to weighted edit distance when the costs form a metric on the alphabet augmented with a gap…
Constrained Correlation Clustering: Towards Optimality
Sina Azizeddin, Evangelos Kipouridis, Nithin Varma
In the Correlation Clustering problem, we are given an undirected graph and are tasked with computing a clustering (partition of the nodes) that minimizes the number of violated pa…
Computing the (k+2)-Edge-Connected Components in k-Edge-Connected Digraphs in Subquadratic Time
Loukas Georgiadis, Evangelos Kipouridis, Evangelos Kosinas +2
Computing edge-connected components in directed and undirected graphs is a fundamental and well-studied problem in graph algorithms. In a very recent breakthrough, Korhonen [STOC 2…
Dynamic data structures for twin-ordered matrices
Bartłomiej Bosek, Jadwiga Czyżewska, Evangelos Kipouridis +4
We present a dynamic data structure for representing binary matrices that are -twin-ordered, for a~fixed parameter . Our structure supports cell queries and singl…
A Broader View on Clustering under Cluster-Aware Norm Objectives
Martin G. Herold, Evangelos Kipouridis, Joachim Spoerhase
We revisit the -clustering problem that we introduced in a recent work [SODA'25], and which subsumes fundamental clustering problems such as -Center, -Median, Min-Sum…
Faster algorithms for k-Orthogonal Vectors in low dimension
Anita Dürr, Evangelos Kipouridis, Michael Lampis +1
In the Orthogonal Vectors problem (OV), we are given two families of subsets of , each of size , and the task is to decide whether there exists a pair $a…
Fitting Tree Metrics and Ultrametrics in Data Streams
Amir Carmel, Debarati Das, Evangelos Kipouridis +1
Fitting distances to tree metrics and ultrametrics are two widely used methods in hierarchical clustering, primarily explored within the context of numerical taxonomy. Given a posi…
A Faster Algorithm for Constrained Correlation Clustering
Nick Fischer, Evangelos Kipouridis, Jonas Klausen +1
In the Correlation Clustering problem we are given nodes, and a preference for each pair of nodes indicating whether we prefer the two endpoints to be in the same cluster or no…
Clustering to Minimize Cluster-Aware Norm Objectives
Martin G. Herold, Evangelos Kipouridis, Joachim Spoerhase
We initiate the study of the following general clustering problem. We seek to partition a given set of data points into clusters by finding a set of centers and ass…
Dynamic Dynamic Time Warping
Karl Bringmann, Nick Fischer, Ivor van der Hoog +3
The Dynamic Time Warping (DTW) distance is a popular similarity measure for polygonal curves (i.e., sequences of points). It finds many theoretical and practical applications, espe…
Fitting Tree Metrics with Minimum Disagreements
Evangelos Kipouridis
In the Fitting Tree Metrics problem, we are given all pairwise distances among the elements of a set and our output is a tree metric on . The goal is to minimize the n…
A Simple Algorithm for Multiple-Source Shortest Paths in Planar Digraphs
Debarati Das, Evangelos Kipouridis, Maximilian Probst Gutenberg +1
Given an -vertex planar embedded digraph with non-negative edge weights and a face of , Klein presented a data structure with space and preprocessing tim…
Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor
Vincent Cohen-Addad, Debarati Das, Evangelos Kipouridis +2
We consider the numerical taxonomy problem of fitting a positive distance function by a tree metric. We want a tree with positive e…
Threshold-based Network Structural Dynamics
Evangelos Kipouridis, Paul G. Spirakis, Kostas Tsichlas
The interest in dynamic processes on networks is steadily rising in recent years. In this paper, we consider the -Thresholded Network Dynamics (-Dynamics), where $α\l…
No Repetition: Fast Streaming with Highly Concentrated Hashing
Anders Aamand, Debarati Das, Evangelos Kipouridis +3
To get estimators that work within a certain error bound with high probability, a common strategy is to design one that works with constant probability, and then boost the probabil…
On the Convergence of Network Systems
Evangelos Kipouridis, Kostas Tsichlas
The apparent disconnection between the microscopic and the macroscopic is a major issue in the understanding of complex systems. To this extend, we study the convergence of repeate…
Longest Common Subsequence on Weighted Sequences
Evangelos Kipouridis, Kostas Tsichlas
We consider the general problem of the Longest Common Subsequence (LCS) on weighted sequences. Weighted sequences are an extension of classical strings, where in each position ever…