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
[1]
Hilfe
Suche: Author="Vr{\v{t}}o, Imrich"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Improved bounds on cutwidths of shuffle-exchange and de Bruijn graphs
Burkhard Monien
,
Imrich Vrt̑o
Parallel Processing Letters
14
(3-4), 2004, pp. 361-366
New results on edge-bandwidth
Tiziana Calamoneri
,
Annalisa Massini
,
Imrich Vrt̑o
Theoretical Computer Science
307
(3), 2003, pp. 503-513
Diameter of the Knödel graph
Guillaume Fertin
,
André Raspaud
,
Heiko Schröder
,
Ondrej Sýkora
,
Imrich Vrt̑o
Lecture Notes in Computer Science
1928
, 2000, pp. 149-160
Virtual path layouts in ATM networks
Ladislav Stacho
,
Imrich Vrt̑o
SIAM Journal on Computing
29
(5), 2000, pp. 1621-1629
Two broadcasting problems in faulty hypercubes
Stefan Dobrev
,
Imrich Vrt̑o
Lecture Notes in Computer Science
1665
, 1999, pp. 173-178
On embeddings in cycles
Juraj Hromkovic̑
,
Vladimír Müller
,
Ondrej Sýkora
,
Imrich Vrt̑o
Information and Computation
118
(2), 1995, pp. 302-305
A short proof of the dilation of a toroidal mesh in a path
Michael S. Paterson
,
Heiko Schröder
,
Ondrej Sýkora
,
Imrich Vrt̑o
Information Processing Letters
48
(4), 1993, pp. 197-199
Edge separators for graphs of bounded genus with applications
Ondrej Sýkora
,
Imrich Vrt̑o
Theoretical Computer Science
112
, 1993, pp. 419-429
On embedding interconnection networks into rings of processors
Juraj Hromkovic̑
,
Vladimír Müller
,
Ondrej Sýkora
,
Imrich Vrt̑o
Lecture Notes in Computer Science
605
, 1992, pp. 53-62
On the crossing number of the hypercube and the cube connected cycles
Ondrej Sýkora
,
Imrich Vrt̑o
Lecture Notes in Computer Science
570
, 1992, pp. 214-218
Parallel quicksort
Bogdan S. Chlebus
,
Imrich Vrt̑o
Journal Parallel Distributed Computing
11
(4), 1991, April, pp. 332-337
Semelectivity is not sufficient
Pavol Dúris̑
,
Imrich Vrt̑o
Information Processing Letters
37
, 1991, pp. 137-141
On embeddings in cycles
Juraj Hromkovic̑
,
Vladimír Müller
,
Ondrej Sýkora
,
Imrich Vrt̑o
misc, 1991
Area complexity of merging
Vladimir Palko
,
Ondrej Sýkora
,
Imrich Vrt̑o
Theoretical Computer Science
82
, 1991, pp. 157-163
Optimal embedding of a toroidal array in a linear array
Heiko Schröder
,
Ondrej Sýkora
,
Imrich Vrt̑o
misc, 1991
On the crossing number of the hypercube and the cube connected cycles
Ondrej Sýkora
,
Imrich Vrt̑o
misc, 1991
Edge separators for graphs of bounded genus with applications
Ondrej Sýkora
,
Imrich Vrt̑o
Lecture Notes in Computer Science
570
, 1991, pp. 159-168
Edge separators of planar and outerplanar graphs with applications
Krzystof Diks
,
Hristo N. Djidjev
,
Ondrej Sýkora
,
Imrich Vrt̑o
Technical Report (SCS-TR-176), 1990, May