PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

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.

No persons found for author name Vrto, Imrich
add a person with the name Vrto, Imrich
 

Other publications of authors with the same name

Crossing Numbers and Cutwidths., and . J. Graph Algorithms Appl., 7 (3): 245-251 (2003)Cutwidth of the Bruijn Graph., , and . ITA, 29 (6): 509-514 (1995)Edge Separators for Planar Graphs and Their Applications., , , and . MFCS, volume 324 of Lecture Notes in Computer Science, page 280-290. Springer, (1988)Optimal Embedding of a Toroidal Array in a Linear Array., , and . FCT, volume 529 of Lecture Notes in Computer Science, page 390-394. Springer, (1991)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 . Graph Drawing, volume 2265 of Lecture Notes in Computer Science, page 96-101. Springer, (2001)Bounds and Methods for k-Planar Crossing Numbers., , , and . Graph Drawing, volume 2912 of Lecture Notes in Computer Science, page 37-46. Springer, (2003)Bipartite Crossing Numbers of Meshes and Hypercubes., , , and . Graph Drawing, volume 1353 of Lecture Notes in Computer Science, page 37-46. Springer, (1997)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)Improved Bounds for the Crossing Number of the Mesh of Trees., and . Journal of Interconnection Networks, 4 (1): 17-35 (2003)