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, C."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the structure of equilibria in basic network formation
S. Nikoletseas
,
P. Panagopoulou
,
C. Raptopoulos
,
P.G. Spirakis
Theoretical Computer Science
590
, 2015, pp. 96-105
On the independence number and Hamiltonicity of uniform random intersection graphs
S. Nikoletseas
,
C. Raptopoulos
,
P.G. Spirakis
Theoretical Computer Science
412
(48), 2011, pp. 6750-6760
Expander properties and the cover time of random intersection graphs
S. Nikoletseas
,
C. Raptopoulos
,
P.G. Spirakis
Theoretical Computer Science
410
(50), 2009, pp. 5261-5272
Large independent sets in general random intersection graphs
S. Nikoletseas
,
C. Raptopoulos
,
P. Spirakis
Theoretical Computer Science
406
(3), 2008, pp. 215-224
Simple and efficient greedy algorithms for Hamilton cycles in random intersection graphs
C. Raptopoulos
,
P. Spirakis
Lecture Notes in Computer Science
3827
, 2005, pp. 493-504
The existence and efficient construction of large independent sets in general random intersection graphs
S. Nikoletseas
,
C. Raptopoulos
,
P. Spirakis
Lecture Notes in Computer Science
3142
, 2004, pp. 1029-1040