Antibandwidth and cyclic antibandwidth of meshes and hypercubes von Raspaud, André, Schröder, Heiko, Sýkora, Ondrej, Torok, Lubomir, Vrt’o, Imrich

Volltext

Various heuristic algorithms to minimise the two-page crossing numbers of graphs von He, Hongmei, Sălăgean, Ana, Mäkinen, Erkki, Vrt’o, Imrich

Volltext

Which is the Worst-Case Nash Equilibrium? von Lücking, Thomas, Mavronicolas, Marios, Monien, Burkhard, Spirakis, Paul G., Vrto, Imrich

Volltext

Biplanar crossing numbers. II. Comparing crossing numbers and biplanar crossing numbers using the probabilistic method von Czabarka, Eva, Sykora, Ondrej, Szekely, Laszlo A, Vrto, Imrich

Volltext

A note on isoperimetric peaks of complete trees von Vrt’o, Imrich

Volltext

One Sided Crossing Minimization Is NP-Hard for Sparse Graphs von Muñoz, Xavier, Unger, W., Vrt’o, Imrich

Volltext

Two Trees Which Are Self–intersecting When Drawn Simultaneously von Geyer, Markus, Kaufmann, Michael, Vrťo, Imrich

Volltext

Dynamic faults have small effect on broadcasting in hypercubes von Dobrev, Stefan, Vrťo, Imrich

Volltext

On bipartite drawings and the linear arrangement problem von SHAHROKHI, Farhad, SYKORA, Ondrej, SZEKELY, Laszlo A, VRTO, Imrich

Volltext

Cyclic cutwidths of the two-dimensional ordinary and cylindrical meshes von SCHRÖDER, Heiko, SYKORA, Ondrej, VRTO, Imrich

Volltext

New results on edge-bandwidth von Calamoneri, Tiziana, Massini, Annalisa, Vrťo, Imrich

Volltext

Optimal broadcasting in hypercubes with dynamic faults von Dobrev, Stefan, Vrt̆o, Imrich

Volltext

Planar Crossing Numbers of Graphs of Bounded Genus von Djidjev, Hristo N., Vrt’o, Imrich

Volltext

Two trees which are self-intersecting when drawn simultaneously von Geyer, Markus, Kaufmann, Michael, Vrt’o, Imrich

Volltext

A special antidilation problem for meshes and Hamming graphs von Török, L’ubomír, Vrt’o, Imrich

Volltext

Virtual path layouts in atm networks von STACHO, Ladislav, VRTO, Imrich

Volltext

Antibandwidth of three-dimensional meshes von Török, L’ubomír, Vrt’o, Imrich

Volltext

Antibandwidth and cyclic antibandwidth of Hamming graphs von Dobrev, Stefan, Královič, Rastislav, Pardubská, Dana, Török, L’ubomír, Vrt’o, Imrich

Volltext

Unifying binary-search trees and permutations von Chlebus, Bogdan S., Vrťo, Imrich

Volltext

On k-planar crossing numbers von Shahrokhi, Farhad, Sýkora, Ondrej, Székely, László A., Vrt’o, Imrich

Volltext