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="Zissimopoulos, Vassilis"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Optimal data placement on networks with a constant number of clients
Eric Angel
,
Evripidis Bampis
,
Gerasimos G. Pollatos
,
Vassilis Zissimopoulos
Theoretical Computer Science
540-541
, 2014, pp. 82-88
Clustering on
k
-edge-colored graphs
Eric Angel
,
Evripidis Bampis
,
Alexander Kononov
,
Dimitris Paparas
,
Emmanouil Pountourakis
,
Vassilis Zissimopoulos
Lecture Notes in Computer Science
8087
, 2013, pp. 50-61
Probabilistic models for the Steiner Tree problem
Vangelis Th. Paschos
,
Orestis A. Telelis
,
Vassilis Zissimopoulos
Networks
56
(1), 2010, pp. 39-49
A constant approximation algorithm for the densest
k
-subgraph problem on chordal graphs
Maria Liazi
,
Ioannis Milis
,
Vassilis Zissimopoulos
Information Processing Letters
108
(1), 2008, pp. 29-32
Dynamic bottleneck optimization for
k
-edge and 2-vertex connectivity
Orestis A. Telelis
,
Vassilis Zissimopoulos
Information Processing Letters
106
(6), 2008, pp. 251-257
Absolute
o(\log m)
error in approximating random set covering: An average case analysis
Orestis A. Telelis
,
Vassilis Zissimopoulos
Information Processing Letters
94
(4), 2005, pp. 171-177
On the landscape ruggedness of the quadratic assignment problem
Eric Angel
,
Vassilis Zissimopoulos
Theoretical Computer Science
263
(1-2), 2001, pp. 159-172
On the classification of
NP
-complete problems in terms of their correlation coefficient
Eric Angel
,
Vassilis Zissimopoulos
Discrete Applied Mathematics
99
(1-3), 2000, pp. 261-277
On the quality of local search for the quadratic assignment problem
Eric Angel
,
Vassilis Zissimopoulos
Discrete Applied Mathematics
82
(1-3), 1998, pp. 15-25