default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNikolaos Nakis
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j2]Nikolaos Nakis
, Abdulkadir Çelikkanat, Sune Lehmann, Morten Mørup:
A Hierarchical Block Distance Model for Ultra Low-Dimensional Graph Representations. IEEE Trans. Knowl. Data Eng. 36(4): 1399-1412 (2024)- [c5]Abdulkadir Çelikkanat, Nikolaos Nakis, Morten Mørup:
Continuous-Time Graph Representation with Sequential Survival Process. AAAI 2024: 11177-11185 - [c4]Nikolaos Nakis, Abdulkadir Çelikkanat, Louis Boucherie, Sune Lehmann, Morten Mørup:
Time to Cite: Modeling Citation Networks using the Dynamic Impact Single-Event Embedding Model. AISTATS 2024: 1882-1890 - [i8]Nikolaos Nakis, Abdulkadir Çelikkanat, Louis Boucherie, Sune Lehmann, Morten Mørup:
Time to Cite: Modeling Citation Networks using the Dynamic Impact Single-Event Embedding Model. CoRR abs/2403.00032 (2024) - [i7]Nikolaos Nakis, Chrysoula Kosma, Giannis Nikolentzos, Michail Chatzianastasis, Iakovos Evdaimon, Michalis Vazirgiannis:
Signed Graph Autoencoder for Explainable and Polarization-Aware Network Embeddings. CoRR abs/2409.10452 (2024) - 2023
- [j1]Nikolaos Nakis, Abdulkadir Çelikkanat, Morten Mørup:
A Hybrid Membership Latent Distance Model for Unsigned and Signed Integer Weighted Networks. Adv. Complex Syst. 26(3): 2340002:1-2340002:30 (2023) - [c3]Nikolaos Nakis, Abdulkadir Çelikkanat, Louis Boucherie, Christian Djurhuus, Felix Burmester, Daniel Mathias Holmelund, Monika Frolcová, Morten Mørup:
Characterizing Polarization in Social Networks using the Signed Relational Latent Distance Model. AISTATS 2023: 11489-11505 - [i6]Nikolaos Nakis, Abdulkadir Çelikkanat, Louis Boucherie, Christian Djurhuus, Felix Burmester, Daniel Mathias Holmelund, Monika Frolcová, Morten Mørup:
Characterizing Polarization in Social Networks using the Signed Relational Latent Distance Model. CoRR abs/2301.09507 (2023) - [i5]Nikolaos Nakis, Abdulkadir Çelikkanat, Morten Mørup:
A Hybrid Membership Latent Distance Model for Unsigned and Signed Integer Weighted Networks. CoRR abs/2308.15293 (2023) - [i4]Abdulkadir Çelikkanat, Nikolaos Nakis, Morten Mørup:
Continuous-time Graph Representation with Sequential Survival Process. CoRR abs/2312.13068 (2023) - 2022
- [c2]Nikolaos Nakis, Abdulkadir Çelikkanat, Morten Mørup:
HM-LDM: A Hybrid-Membership Latent Distance Model. COMPLEX NETWORKS (1) 2022: 350-363 - [c1]Abdulkadir Çelikkanat, Nikolaos Nakis, Morten Mørup:
Piecewise-Velocity Model for Learning Continuous-Time Dynamic Node Representations. LoG 2022: 36 - [i3]Nikolaos Nakis, Abdulkadir Çelikkanat, Sune Lehmann Jørgensen, Morten Mørup:
A Hierarchical Block Distance Model for Ultra Low-Dimensional Graph Representations. CoRR abs/2204.05885 (2022) - [i2]Nikolaos Nakis, Abdulkadir Çelikkanat, Morten Mørup:
HM-LDM: A Hybrid-Membership Latent Distance Model. CoRR abs/2206.03463 (2022) - [i1]Abdulkadir Çelikkanat, Nikolaos Nakis, Morten Mørup:
Piecewise-Velocity Model for Learning Continuous-time Dynamic Node Representations. CoRR abs/2212.12345 (2022)
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-10-14 23:30 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:
