![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Alexander P. Kartun-Giles
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
- [j6]Alexander P. Kartun-Giles
, Nadia Ameli:
An Introduction to Complex Networks in Climate Finance. Entropy 25(10): 1371 (2023) - [j5]Alexander P. Kartun-Giles
, Konstantinos Koufos
, Xiao Lu
, Dusit Niyato
:
Two-Hop Connectivity to the Roadside in a VANET Under the Random Connection Model. IEEE Trans. Veh. Technol. 72(4): 5508-5512 (2023) - 2018
- [j4]Alexander P. Kartun-Giles
, Dmitri V. Krioukov
, James P. Gleeson
, Yamir Moreno
, Ginestra Bianconi
:
Sparse Power-Law Network Model for Reliable Statistical Predictions Based on Sampled Data. Entropy 20(4): 257 (2018) - [j3]Alexander P. Kartun-Giles
, Suhanya Jayaprakasam
, Sunwoo Kim
:
Euclidean Matchings in Ultra-Dense Networks. IEEE Commun. Lett. 22(6): 1216-1219 (2018) - [j2]Alexander P. Kartun-Giles
, Sunwoo Kim
:
Counting k-Hop Paths in the Random Connection Model. IEEE Trans. Wirel. Commun. 17(5): 3201-3210 (2018) - 2017
- [j1]Georgie Knight
, Alexander P. Kartun-Giles
, Orestis Georgiou
, Carl P. Dettmann:
Counting Geodesic Paths in 1-D VANETs. IEEE Wirel. Commun. Lett. 6(1): 110-113 (2017)
Conference and Workshop Papers
- 2015
- [c1]Alexander P. Giles
, Orestis Georgiou, Carl P. Dettmann:
Betweenness centrality in dense random geometric networks. ICC 2015: 6450-6455
Informal and Other Publications
- 2021
- [i7]Alexander P. Kartun-Giles, Kostas Koufos, Nicolas Privault:
Connectivity of 1d random geometric graphs. CoRR abs/2105.07731 (2021) - 2020
- [i6]Alexander P. Kartun-Giles, Konstantinos Koufos, Xiao Lu, Nicolas Privault, Dusit Niyato:
Two-Hop Connectivity to the Roadside in a VANET Under the Random Connection Model. CoRR abs/2005.14407 (2020) - 2019
- [i5]Alexander P. Kartun-Giles, Ginestra Bianconi:
Beyond the clustering coefficient: A topological analysis of node neighbourhoods in complex networks. CoRR abs/1901.10978 (2019) - [i4]Alexander P. Kartun-Giles, Konstantinos Koufos, Sunwoo Kim:
Meta Distribution of SIR in Ultra-Dense Networks with Bipartite Euclidean Matchings. CoRR abs/1910.13216 (2019) - [i3]Alexander P. Kartun-Giles, Suhanya Jayaprakasam, Sunwoo Kim:
Euclidean Matchings in Ultra-Dense Networks. CoRR abs/1911.05644 (2019) - 2016
- [i2]Georgie Knight, Alexander P. Kartun-Giles, Orestis Georgiou, Carl P. Dettmann:
Counting Geodesic Paths in 1D VANETs. CoRR abs/1610.01630 (2016) - 2014
- [i1]Alexander P. Giles, Orestis Georgiou, Carl P. Dettmann:
Betweenness Centrality in Dense Random Geometric Networks. CoRR abs/1410.8521 (2014)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-04-24 22:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint