2.4k citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- University of PatrasGR41 papers
- University of LiverpoolGB8 papers
- National and Kapodistrian University of AthensGR7 papers
- Centre National de la Recherche ScientifiqueFR6 papers
- University of PiraeusGR6 papers
- Institute of Informatics and TelematicsIT5 papers
- National Research CouncilLK5 papers
- Hellenic Open UniversityGR4 papers
- University of IoanninaGR4 papers
- University of the AegeanGR4 papers
- Durham UniversityGB3 papers
- École Polytechnique Fédérale de LausanneCH3 papers
4 papers · 1 filter
An Introduction to Temporal Graphs: An Algorithmic Perspective
Othon Michail
A \emph{temporal graph} is, informally speaking, a graph that changes with time. When time is discrete and only the relationships between the participating entities may change and…
Maximum Cliques in Graphs with Small Intersection Number and Random Intersection Graphs
S. Nikoletseas, C. Raptopoulos, P. G. Spirakis
In this paper, we relate the problem of finding a maximum clique to the intersection number of the input graph (i.e. the minimum number of cliques needed to edge cover the graph).…
Natural Models for Evolution on Networks
George B. Mertzios, Sotiris Nikoletseas, Christoforos Raptopoulos +1
Evolutionary dynamics have been traditionally studied in the context of homogeneous populations, mainly described my the Moran process. Recently, this approach has been generalized…
Random sampling of colourings of sparse random graphs with a constant number of colours
Charilaos Efthymiou, Paul G. Spirakis
In this work we present a simple and efficient algorithm which, with high probability, provides an almost uniform sample from the set of proper k-colourings on an instance of a spa…