default search action
Christos Pelekis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j10]Panagiotis Promponas
, Christos Pelekis
Risk-Aware Satisfaction Equilibria in Resource Sharing Games. IEEE Trans. Autom. Control. 70(1): 278-292 (2025) - 2024
- [j9]Maria Diamanti
Delay Minimization for Rate-Splitting Multiple Access-Based Multi-Server MEC Offloading. IEEE/ACM Trans. Netw. 32(2): 1035-1047 (2024) - [i5]Christos Pelekis:
A binomial random multigraph. CoRR abs/2401.00543 (2024) - 2023
- [j8]Nikolaos Fryganiotis, Symeon Papavassiliou, Christos Pelekis:
A note on the network coloring game: A randomized distributed (Δ + 1)-coloring algorithm. Inf. Process. Lett. 182: 106385 (2023) - 2022
- [c2]Maria Diamanti
On the Minimum Collisions Assignment Problem in Interdependent Networked Systems. ISCC 2022: 1-6 - 2021
- [j7]Martin Dolezal, Jan Hladký
A Turán-Type Theorem for Large-Distance Graphs in Euclidean Spaces, and Related Isodiametric Problems. Discret. Comput. Geom. 66(1): 281-300 (2021) - [j6]Jan Hladký
A limit theorem for small cliques in inhomogeneous random graphs. J. Graph Theory 97(4): 578-599 (2021) - [j5]Christos Pelekis, Panagiotis Promponas, Juan Alvarado
A fragile multi-CPR game. Math. Methods Oper. Res. 94(3): 461-492 (2021) - [j4]Panagiotis Promponas
Games in Normal and Satisfaction Form for Efficient Transmission Power Allocation Under Dual 5G Wireless Multiple Access Paradigm. IEEE/ACM Trans. Netw. 29(6): 2574-2587 (2021) - [i4]Christos Pelekis, Panagiotis Promponas, Juan Alvarado, Eirini-Eleni Tsiropoulou, Symeon Papavassiliou:
A Fragile multi-CPR Game. CoRR abs/2102.12820 (2021) - [i3]Nikolaos Fryganiotis, Symeon Papavassiliou, Christos Pelekis:
A note on the network coloring game. CoRR abs/2106.00402 (2021)
2010 – 2019
- 2018
- [j3]Christos Pelekis, Israel Rocha:
A Generalization of Erdős' Matching Conjecture. Electron. J. Comb. 25(2): 2 (2018) - [i2]Christos Pelekis:
On the Shannon entropy of the number of vertices with zero in-degree in randomly oriented hypergraphs. CoRR abs/1808.04166 (2018) - 2016
- [j2]Christos Pelekis:
Bernoulli Trials of Fixed Parity, Random and Randomly Oriented Graphs. Graphs Comb. 32(4): 1521-1544 (2016) - 2015
- [i1]Christos Pelekis:
A generalised isodiametric problem. CoRR abs/1507.01631 (2015) - 2014
- [c1]Yuyi Wang, Christos Pelekis, Jan Ramon:
U-statistics on network-structured data with kernels of degree larger than one. SSDM@ECML/PKDD 2014: 37-48 - 2012
- [j1]Steve Alpern, Robbert Fokkink, Christos Pelekis:
A Proof of the Kikuta-Ruckle Conjecture on Cyclic Caching of Resources. J. Optim. Theory Appl. 153(3): 650-661 (2012)
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 2025-02-18 01:18 CET 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: