Evangelos Kipouridis

Orcid: 0000-0002-5830-5830

According to our database1, Evangelos Kipouridis authored at least 13 papers between 2019 and 2025.

Collaborative distances:

Timeline

2019
2020
2021
2022
2023
2024
2025
0
1
2
3
4
1
1
1
1
1
1
1
1
1
2
1
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
A Faster Algorithm for Constrained Correlation Clustering.
CoRR, January, 2025

Clustering to Minimize Cluster-Aware Norm Objectives.
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

2024
Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor.
J. ACM, April, 2024

Dynamic Dynamic Time Warping.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023
Threshold-based network structural dynamics.
Theor. Comput. Sci., 2023

Faster Computation of 3-Edge-Connected Components in Digraphs.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Fitting Tree Metrics with Minimum Disagreements.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022
No Repetition: Fast and Reliable Sampling with Highly Concentrated Hashing.
Proc. VLDB Endow., 2022

A Simple Algorithm for Multiple-Source Shortest Paths in Planar Digraphs.
Proceedings of the 5th Symposium on Simplicity in Algorithms, 2022

2021
Dynamic layers of maxima with applications to dominating queries.
Comput. Geom., 2021

2020
No Repetition: Fast Streaming with Highly Concentrated Hashing.
CoRR, 2020

Longest Common Subsequence on Weighted Sequences.
Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020

2019
On the Convergence of Network Systems.
CoRR, 2019


  Loading...