( en | de | ru )

 

Disambiguation of "Vrto, Imrich"

Author of the publication

copydeleteadd this publication to your clipboard
Towards practical deteministic write-all algorithms.

, , , , , and . SPAA, page 271-280. ACM, (2001)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Horst Imrich

Walter Imrich

Imrich Fabry

Imrich Sebestian

 

Other publications of authors with the same name

Optimal Layouts of the Tree of Meshes with Vertices on the Perimeter of the Bounding Convex Region., and . STACS, volume 166 of Lecture Notes in Computer Science, page 209-217. Springer, (1984)Antibandwidth and Cyclic Antibandwidth of Hamming Graphs., , , , and . Electron. Notes Discret. Math., (2009)Improved Bounds for the Crossing Number of the Mesh of Trees., and . J. Interconnect. Networks, 4 (1): 17-35 (2003)Crossing Numbers and Cutwidths., and . J. Graph Algorithms Appl., 7 (3): 245-251 (2003)Antibandwidth of complete k-ary trees., , , and . Discret. Math., 309 (22): 6408-6414 (2009)Edge Separators of Planar and Outerplanar Graphs with Applications., , , and . J. Algorithms, 14 (2): 258-279 (1993)On k-planar crossing numbers., , , and . Discret. Appl. Math., 155 (9): 1106-1115 (2007)Book Embeddings and Crossing Numbers., , , and . WG, volume 903 of Lecture Notes in Computer Science, page 256-268. Springer, (1994)An Improved Lower Bound for Crossing Numbers., and . GD, volume 2265 of Lecture Notes in Computer Science, page 96-101. Springer, (2001)Bounds and Methods for k-Planar Crossing Numbers., , , and . GD, volume 2912 of Lecture Notes in Computer Science, page 37-46. Springer, (2003)