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="Nikoletseas, S."
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
Radiocoloring in planar graphs: Complexity and approximations
D.A. Fotakis
,
S.E. Nikoletseas
,
V.G. Papadopoulou
,
P.G. Spirakis
Theoretical Computer Science
340
(3), 2005, pp. 514-538
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
On the robustness of interconnections in random graphs: A symbolic approach
P. Flajolet
,
K. Hatzis
,
S. Nikoletseas
,
P. Spirakis
Theoretical Computer Science
287
(2), 2002, pp. 515-534
Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies
D.A. Fotakis
,
S.E. Nikoletseas
,
V.G. Papadopoulou
,
P.G. Spirakis
Lecture Notes in Computer Science
2573
, 2002, pp. 223-234
NP
-completeness results and efficient approximations for radiocoloring in planar graphs
D.A. Fotakis
,
S.E. Nikoletseas
,
V.G. Papadopoulou
,
P.G. Spirakis
Lecture Notes in Computer Science
1893
, 2000, pp. 363-372
Connectivity properties in random regular graphs with edge faults
S. Nikoletseas
,
K. Palem
,
P. Spirakis
,
M. Yung
International Journal of Foundations of Computer Science
11
(2), 2000, pp. 247-262
Efficient communication establishment in adverse communication environments
S. Nikoletseas
,
P. Spirakis
Proceedings in Informatics
8
, 2000, pp. 215-226
Stochastic graphs have short memory: Fully dynamic connectivity in poly-log expected time
S. Nikoletseas
,
J. Reif
,
P. Spirakis
,
M. Yung
Lecture Notes in Computer Science
944
, 1995, pp. 159-170
Short vertex disjoint paths and multiconnectivity in random graphs: Reliable network computing
S. Nikoletseas
,
K. Palem
,
P. Spirakis
,
M. Yung
Lecture Notes in Computer Science
820
, 1994, pp. 508-519