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
[2]
Hilfe
Suche: Author="Manoussakis, Yannis"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Ramsey numbers for tournaments
Yannis Manoussakis
,
Zsolt Tuza
Theoretical Computer Science
263
(1-2), 2001, pp. 75-85
Optimal routings in communication networks with linearly bounded forwarding index
Yannis Manoussakis
,
Zsolt Tuza
Networks
28
(4), 1996, pp. 177-180
Weakly hamiltonian-connected vertices in bipartite tournaments
Jrgen Bang-Jensen
,
Yannis Manoussakis
Journal of Combinatorial Theory Series B
63
(2), 1995, pp. 261-280
A polynomial algorithm for Hamiltonian-connectedness in semicomplete digraphs
Jrgen Bang-Jensen
,
Yannis Manoussakis
,
Carsten Thomassen
Journal of Algorithms
13
, 1992, pp. 114-127
Directed Hamiltonian graphs
Yannis Manoussakis
Journal of Graph Theory
16
(1), 1992, pp. 51-59
Cycles and paths of many lengths in bipartite digraphs
Denise Amar
,
Yannis Manoussakis
Journal of Combinatorial Theory Series B
50
, 1990, pp. 254-264
k
-linked and
k
-cyclic digraphs
Yannis Manoussakis
Journal of Combinatorial Theory Series B
48
, 1990, pp. 216-226