Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Raptopoulos, Christoforos"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Determining majority in networks with local interactions and very small local memory
George B. Mertzios
,
Sotiris E. Nikoletseas
,
Christoforos L. Raptopoulos
Lecture Notes in Computer Science
8572
, 2014, pp. 871-882
Natural models for evolution on networks
George B. Mertzios
,
Sotiris Nikoletseas
,
Christoforos Raptopoulos
,
Paul G. Spirakis
Theoretical Computer Science
477
, 2013, pp. 76-95
A guided tour in random intersection graphs
Paul G. Spirakis
,
Sotiris Nikoletseas
,
Christoforos Raptopoulos
Lecture Notes in Computer Science
7966
, 2013, pp. 29-35
Maximum cliques in graphs with small intersection number and random intersection graphs
Sotiris Nikoletseas
,
Christoforos Raptopoulos
,
Paul G. Spirakis
Lecture Notes in Computer Science
7464
, 2012, pp. 728-739
Colouring non-sparse random intersection graphs
Sotiris Nikoletseas
,
Christoforos Raptopoulos
,
Paul G. Spirakis
Lecture Notes in Computer Science
5734
, 2009, pp. 600-611
Expander properties and the cover time of random intersection graphs
Sotiris E. Nikoletseas
,
Christoforos Raptopoulos
,
Paul G. Spirakis
Lecture Notes in Computer Science
4708
, 2007, pp. 44-55
Algorithmic issues in coalitional and dynamic network games
Dimitris Fotakis
,
Spyros Kontogiannis
,
Panagiota Panagopoulou
,
Christoforos Raptopoulos
,
Paul Spirakis
HNI-Verlagsschriftenreihe
181
, 2006, pp. 25-42