| 2013 | WG | The Same Upper Bound for Both: The 2-Page and the Rectilinear Crossing Numbers of the n-Cube. | Lurbio Faria, Celina M. H. de Figueiredo, R. Bruce Richter, Imrich Vrto |
| 2009 | IWOCA | Antibandwidth of d-Dimensional Meshes. | Lubomir Torok, Imrich Vrto |
| 2006 | ICALP | Planar Crossing Numbers of Genus | Hristo N. Djidjev, Imrich Vrto |
| 2005 | GD | Two Trees Which Are Self-intersecting When Drawn Simultaneously. | Markus Geyer, Michael Kaufmann, Imrich Vrto |
| 2005 | SOFSEM | Outerplanar Crossing Numbers of 3-Row Meshes, Halin Graphs and Complete p-Partite Graphs. | Radoslav Fulek, Hongmei He, Ondrej Skora, Imrich Vrto |
| 2004 | GD | New Exact Results and Bounds for Bipartite Crossing Numbers of Meshes. | Matthew Newton, Ondrej Skora, Martin Uzovic, Imrich Vrto |
| 2004 | GD | Layout Volumes of the Hypercube. | Lubomir Torok, Imrich Vrto |
| 2003 | COCOON | Bounds for Convex Crossing Numbers. | Farhad Shahrokhi, Ondrej Skora, Lszl A. Szkely, Imrich Vrto |
| 2003 | GD | Bounds and Methods for k-Planar Crossing Numbers. | Farhad Shahrokhi, Ondrej Skora, Lszl A. Szkely, Imrich Vrto |
| 2003 | MFCS | Which Is the Worst-Case Nash Equilibrium? | Thomas Lcking, Marios Mavronicolas, Burkhard Monien, Manuel Rode, Paul G. Spirakis, Imrich Vrto |
| 2003 | WG | An Improved Upper Bound on the Crossing Number of the Hypercube. | Lurbio Faria, Celina M. H. de Figueiredo, Ondrej Skora, Imrich Vrto |
| 2002 | GD | Two New Heuristics for Two-Sided Bipartite Graph Drawing. | Matthew Newton, Ondrej Skora, Imrich Vrto |
| 2002 | GD | Fractional Lengths and Crossing Numbers. | Ondrej Skora, Lszl A. Szkely, Imrich Vrto |
| 2002 | WG | Two Counterexamples in Graph Drawing. | Ondrej Skora, Lszl A. Szkely, Imrich Vrto |
| 2001 | GD | An Improved Lower Bound for Crossing Numbers. | Hristo N. Djidjev, Imrich Vrto |
| 2001 | GD | One Sided Crossing Minimization Is NP-Hard for Sparse Graphs. | Xavier Muoz, Walter Unger, Imrich Vrto |
| 2001 | SPAA | Towards practical deteministic write-all algorithms. | Bogdan S. Chlebus, Stefan Dobrev, Dariusz R. Kowalski, Grzegorz Malewicz, Alexander A. Shvartsman, Imrich Vrto |
| 2000 | EuroPar | Optimal Broadcasting in Even Tori with Dynamic Faults (Research Note). | Stefan Dobrev, Imrich Vrto |
| 2000 | SIROCCO | Congestion and dilation, similarities and differences: A survey. | Andr Raspaud, Ondrej Skora, Imrich Vrto |
| 2000 | WG | Diameter of the Kndel Graph. | Guillaume Fertin, Andr Raspaud, Heiko Schrder, Ondrej Skora, Imrich Vrto |
| 1999 | GD | On 3-Layer Crossings and Pseudo Arrangements. | Farhad Shahrokhi, Imrich Vrto |
| 1999 | SIROCCO | Evolutionary Graph Colouring. | Stefan Dobrev, Heiko Schrder, Ondrej Skora, Imrich Vrto |
| 1999 | SOFSEM | Cyclic Cutwidth of the Mesh. | Heiko Schrder, Ondrej Skora, Imrich Vrto |
| 1999 | WG | Two Broadcasting Problems in Faulty Hypercubes. | Stefan Dobrev, Imrich Vrto |
| 1998 | SIROCCO | On permutation communications in all-optical rings. | Mike Paterson, Heiko Schrder, Ondrej Skora, Imrich Vrto |
| 1997 | EuroPar | Cutwidth of the Mesh of | Imrich Vrto |
| 1997 | GD | Bipartite Crossing Numbers of Meshes and Hypercubes. | Farhad Shahrokhi, Ondrej Skora, Lszl A. Szkely, Imrich Vrto |
| 1997 | SOFSEM | Approximation Algorithms for the Vertex Bipartization Problem. | Heiko Schrder, A. E. May, Imrich Vrto, Ondrej Skora |
| 1997 | SOFSEM | Optical All-to-All Communication for Some Product Graphs. | Heiko Schrder, Ondrej Skora, Imrich Vrto |
| 1997 | WADS | On Bipartite Crossings, Largest Biplanar Subgraphs, and the Linear Arrangement Problem. | Farhad Shahrokhi, Ondrej Skora, Lszl A. Szkely, Imrich Vrto |
| 1996 | SIROCCO | Virtual Path Layout for Some Bounded Degree Networks. | Ladislav Stacho, Imrich Vrto |
| 1995 | GD | Crossing Numbers of Meshes. | Farhad Shahrokhi, Ondrej Skora, Lszl A. Szkely, Imrich Vrto |
| 1995 | SIROCCO | Bisecting de Bruijn and Kautz Graphs. | Jos D. P. Rolim, Pavel Tvrdk, Jan Trdlicka, Imrich Vrto |
| 1995 | WG | Optimal Cutwidths and Bisection Widths of 2- and 3-Dimensional Meshes. | Jos D. P. Rolim, Ondrej Skora, Imrich Vrto |
| 1994 | GD | Crossing Numbers of Graphs, Lower Bound Techniques. | Farhad Shahrokhi, Lszl A. Szkely, Imrich Vrto |
| 1994 | WG | Book Embeddings and Crossing Numbers. | Farhad Shahrokhi, Ondrej Skora, Lszl A. Szkely, Imrich Vrto |
| 1993 | WG | Improving Bounds for the Crossing Numbers on Surfaces of Genus g. | Farhad Shahrokhi, Lszl A. Szkely, Ondrej Skora, Imrich Vrto |
| 1991 | FCT | Unifying Binary-Search Trees and Permutations. | Bogdan S. Chlebus, Imrich Vrto |
| 1991 | FCT | Optimal Embedding of a Toroidal Array in a Linear Array. | Heiko Schrder, Ondrej Skora, Imrich Vrto |
| 1991 | WG | On the Crossing Number of the Hypercube and the Cube Connected Cycles. | Ondrej Skora, Imrich Vrto |
| 1991 | WG | Edge Separators for Graphs of Bounded Genus with Applications. | Ondrej Skora, Imrich Vrto |
| 1989 | MFCS | Area Complexity of Merging. | Vladimir Palko, Ondrej Skora, Imrich Vrto |
| 1988 | MFCS | Edge Separators for Planar Graphs and Their Applications. | Krzysztof Diks, Hristo N. Djidjev, Ondrej Skora, Imrich Vrto |
| 1984 | STACS | Optimal Layouts of the Tree of Meshes with Vertices on the Perimeter of the Bounding Convex Region. | Ondrej Skora, Imrich Vrto |