Skip to content

Author

Evangelos Kipouridis

We have 3 of 25 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

#edge computing Preprint Nov 2026

Counting over Unbreakable Decompositions: A Single-Exponential Parameterized Algorithm for Minimum Bisection

The dynamic program can be implemented on top of an unbreakable decomposition using algebraic techniques and compute in time a tree decomposition with adhesions of size at most $2k$ whose bags are $(3k,k)$-edge-unbreakable inside their own subtrees.

Aditya Anand, Evangelos Kipouridis, Karol Węgrzycki · 0 citations
Preprint Sep 2026

Metric Weighted Edit Distance: $(3+\varepsilon)$-Approximation in $\widetilde O_\varepsilon(N^{1.6})$ Time

For every $0<\varepsilon \le 1$, we give a randomized $(3+\varepsilon)$-approximation to weighted edit distance when the costs form a metric on the alphabet augmented with a gap symbol. For strings of total length $N$, the running time is $\widetilde{O}(N^{8/5}/\varepsilon^{16/5})$, where $\widetilde{O}$ suppresses fac...

D. Das, Evangelos Kipouridis, Tomasz Kociumaka · 0 citations
Preprint Aug 2026

Constrained Correlation Clustering: Towards Optimality

This work identifies Constrained Correlation Clustering as a variant of Correlation Clustering for which optimal approximations might be within reach, and significantly tighten the gap, by showing that the optimal approximation factor lies in $[2,\frac{16}{7}-\gamma)$ for a small constant $0$.

Sina Azizeddin, Evangelos Kipouridis, Nithin M. Varma · 2 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.