default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAikaterini Karanasiou
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2020
[j3]Loukas Georgiadis
, Giuseppe F. Italiano, Aikaterini Karanasiou:
Approximating the smallest 2-vertex connected spanning subgraph of a directed graph. Theor. Comput. Sci. 807: 185-200 (2020)- 2017
- [j2]Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou, Charis Papadopoulos, Nikos Parotsidis:
Sparse certificates for 2-connectivity in directed graphs. Theor. Comput. Sci. 698: 40-66 (2017) - 2015
- [j1]Asma Ben Abacha, Md. Faisal Mahbub Chowdhury, Aikaterini Karanasiou, Yassine Mrabet, Alberto Lavelli, Pierre Zweigenbaum:
Text mining for pharmacovigilance: Using machine learning for drug name recognition and drug-drug interaction extraction and classification. J. Biomed. Informatics 58: 122-132 (2015)
Conference and Workshop Papers
- 2024
- [c8]Pál András Papp, Georg Anegg, Aikaterini Karanasiou, Albert-Jan Nicholas Yzelman:
Efficient Multi-Processor Scheduling in Increasingly Realistic Models (Brief Summary). IPDPS (Workshops) 2024: 1169-1171 - [c7]Pál András Papp, Georg Anegg, Aikaterini Karanasiou, Albert-Jan Nicholas Yzelman:
Efficient Multi-Processor Scheduling in Increasingly Realistic Models. SPAA 2024: 463-474 - 2019
- [c6]Loukas Georgiadis, Konstantinos Giannis, Giuseppe F. Italiano, Aikaterini Karanasiou, Luigi Laura:
Dynamic Dominators and Low-High Orders in DAGs. ESA 2019: 50:1-50:18 - 2018
- [c5]Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou, Nikos Parotsidis, Nilakantha Paudel:
Computing 2-Connected Components and Maximal 2-Connected Subgraphs in Directed Graphs: An Experimental Study. ALENEX 2018: 169-183 - 2017
- [c4]Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou:
Approximating the Smallest 2-Vertex-Connected Spanning Subgraph via Low-High Orders. SEA 2017: 9:1-9:16 - [c3]Loukas Georgiadis, Konstantinos Giannis, Aikaterini Karanasiou, Luigi Laura:
Incremental Low-High Orders of Directed Graphs and Applications. SEA 2017: 27:1-27:21 - 2016
- [c2]Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou, Charis Papadopoulos, Nikos Parotsidis:
Sparse Subgraphs for 2-Connectivity in Directed Graphs. SEA 2016: 150-166 - 2015
- [c1]Asma Ben Abacha, Aikaterini Karanasiou, Yassine Mrabet, Júlio Cesar dos Reis:
LIST-LUX: Disorder Identification from Clinical Texts. SemEval@NAACL-HLT 2015: 427-432
Informal and Other Publications
- 2024
- [i2]Pál András Papp, Georg Anegg, Aikaterini Karanasiou, A. N. Yzelman:
Efficient Multi-Processor Scheduling in Increasingly Realistic Models. CoRR abs/2404.15246 (2024) - 2016
- [i1]Loukas Georgiadis, Aikaterini Karanasiou, Konstantinos Giannis, Luigi Laura:
On Low-High Orders of Directed Graphs: Incremental Algorithms and Applications. CoRR abs/1608.06462 (2016)
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-08-08 20:16 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:
