default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEvangelos Kipouridis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j4]Vincent Cohen-Addad
, Debarati Das, Evangelos Kipouridis, Nikos Parotsidis, Mikkel Thorup:
Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor. J. ACM 71(2): 10:1-10:41 (2024)- 2023
- [j3]Evangelos Kipouridis, Paul G. Spirakis, Kostas Tsichlas:
Threshold-based network structural dynamics. Theor. Comput. Sci. 944: 113669 (2023) - 2022
- [j2]Anders Aamand, Debarati Das, Evangelos Kipouridis, Jakob Bæk Tejs Knudsen, Peter M. R. Rasmussen, Mikkel Thorup:
No Repetition: Fast and Reliable Sampling with Highly Concentrated Hashing. Proc. VLDB Endow. 15(13): 3989-4001 (2022) - 2021
- [j1]Evangelos Kipouridis, Andreas Kosmatopoulos, Apostolos N. Papadopoulos, Kostas Tsichlas:
Dynamic layers of maxima with applications to dominating queries. Comput. Geom. 93: 101699 (2021)
Conference and Workshop Papers
- 2024
- [c7]Karl Bringmann, Nick Fischer, Ivor van der Hoog, Evangelos Kipouridis, Tomasz Kociumaka, Eva Rotenberg:
Dynamic Dynamic Time Warping. SODA 2024: 208-242 - 2023
- [c6]Evangelos Kipouridis:
Fitting Tree Metrics with Minimum Disagreements. ESA 2023: 70:1-70:10 - [c5]Loukas Georgiadis, Evangelos Kipouridis, Charis Papadopoulos, Nikos Parotsidis:
Faster Computation of 3-Edge-Connected Components in Digraphs. SODA 2023: 2489-2531 - 2022
- [c4]Debarati Das, Evangelos Kipouridis, Maximilian Probst Gutenberg, Christian Wulff-Nilsen:
A Simple Algorithm for Multiple-Source Shortest Paths in Planar Digraphs. SOSA 2022: 1-11 - 2021
- [c3]Vincent Cohen-Addad, Debarati Das, Evangelos Kipouridis, Nikos Parotsidis, Mikkel Thorup:
Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor. FOCS 2021: 468-479 - [c2]Evangelos Kipouridis, Paul G. Spirakis, Kostas Tsichlas:
Threshold-Based Network Structural Dynamics. SIROCCO 2021: 127-145 - 2020
- [c1]Evangelos Kipouridis, Kostas Tsichlas:
Longest Common Subsequence on Weighted Sequences. CPM 2020: 19:1-19:15
Informal and Other Publications
- 2023
- [i8]Evangelos Kipouridis:
Fitting Tree Metrics with Minimum Disagreements. CoRR abs/2307.16066 (2023) - [i7]Karl Bringmann, Nick Fischer, Ivor van der Hoog, Evangelos Kipouridis, Tomasz Kociumaka, Eva Rotenberg:
Dynamic Dynamic Time Warping. CoRR abs/2310.18128 (2023) - 2021
- [i6]Evangelos Kipouridis, Paul G. Spirakis, Kostas Tsichlas:
Threshold-based Network Structural Dynamics. CoRR abs/2103.04955 (2021) - [i5]Vincent Cohen-Addad, Debarati Das, Evangelos Kipouridis, Nikos Parotsidis, Mikkel Thorup:
Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor. CoRR abs/2110.02807 (2021) - [i4]Debarati Das, Evangelos Kipouridis, Maximilian Probst Gutenberg, Christian Wulff-Nilsen:
A Simple Algorithm for Multiple-Source Shortest Paths in Planar Digraphs. CoRR abs/2111.07360 (2021) - 2020
- [i3]Anders Aamand, Debarati Das, Evangelos Kipouridis, Jakob Bæk Tejs Knudsen, Peter M. R. Rasmussen, Mikkel Thorup:
No Repetition: Fast Streaming with Highly Concentrated Hashing. CoRR abs/2004.01156 (2020) - 2019
- [i2]Evangelos Kipouridis, Kostas Tsichlas:
Longest Common Subsequence on Weighted Sequences. CoRR abs/1901.04068 (2019) - [i1]Evangelos Kipouridis, Kostas Tsichlas:
On the Convergence of Network Systems. CoRR abs/1902.04121 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-19 01:04 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
