| 2008 |
|---|
| 86 | EE | Luerbio Faria,
Celina M. Herrera de Figueiredo,
Ondrej Sýkora,
Imrich Vrto:
An improved upper bound on the crossing number of the hypercube.
Journal of Graph Theory 59(2): 145-161 (2008) |
| 85 | EE | Éva Czabarka,
Ondrej Sýkora,
László A. Székely,
Imrich Vrto:
Biplanar crossing numbers. II. Comparing crossing numbers and biplanar crossing numbers using the probabilistic method.
Random Struct. Algorithms 33(4): 480-496 (2008) |
| 2007 |
|---|
| 84 | EE | Farhad Shahrokhi,
Ondrej Sýkora,
László A. Székely,
Imrich Vrto:
On k-planar crossing numbers.
Discrete Applied Mathematics 155(9): 1106-1115 (2007) |
| 83 | EE | Lubomir Torok,
Imrich Vrto:
Antibandwidth of Three-Dimensional Meshes.
Electronic Notes in Discrete Mathematics 28: 161-167 (2007) |
| 82 | EE | Drago Bokal,
Éva Czabarka,
László A. Székely,
Imrich Vrto:
Graph minors and the crossing number of graphs.
Electronic Notes in Discrete Mathematics 28: 169-175 (2007) |
| 2006 |
|---|
| 81 | EE | Hristo Djidjev,
Imrich Vrto:
Planar Crossing Numbers of Genus g Graphs.
ICALP (1) 2006: 419-430 |
| 80 | EE | Tiziana Calamoneri,
Annalisa Massini,
Lubomir Torok,
Imrich Vrto:
Antibandwidth of Complete k-Ary Trees.
Electronic Notes in Discrete Mathematics 24: 259-266 (2006) |
| 2005 |
|---|
| 79 | EE | Markus Geyer,
Michael Kaufmann,
Imrich Vrto:
Two Trees Which Are Self-intersecting When Drawn Simultaneously.
Graph Drawing 2005: 201-210 |
| 78 | EE | Radoslav Fulek,
Hongmei He,
Ondrej Sýkora,
Imrich Vrto:
Outerplanar Crossing Numbers of 3-Row Meshes, Halin Graphs and Complete p-Partite Graphs.
SOFSEM 2005: 376-379 |
| 77 | EE | Ondrej Sýkora,
Lubomir Torok,
Imrich Vrto:
The Cyclic Antibandwidth Problem.
Electronic Notes in Discrete Mathematics 22: 223-227 (2005) |
| 76 | EE | Hongmei He,
Ondrej Sýkora,
Imrich Vrto:
Crossing Minimisation Heuristics for 2-page Drawings.
Electronic Notes in Discrete Mathematics 22: 527-534 (2005) |
| 2004 |
|---|
| 75 | EE | Matthew Newton,
Ondrej Sýkora,
Martin Uzovic,
Imrich Vrto:
New Exact Results and Bounds for Bipartite Crossing Numbers of Meshes.
Graph Drawing 2004: 360-370 |
| 74 | EE | Lubomir Torok,
Imrich Vrto:
Layout Volumes of the Hypercube.
Graph Drawing 2004: 414-424 |
| 73 | EE | Stefan Dobrev,
Imrich Vrto:
Dynamic faults have small effect on broadcasting in hypercubes.
Discrete Applied Mathematics 137(2): 155-158 (2004) |
| 72 | EE | Heiko Schröder,
Ondrej Sýkora,
Imrich Vrto:
Cyclic cutwidths of the two-dimensional ordinary and cylindrical meshes.
Discrete Applied Mathematics 143(1-3): 123-129 (2004) |
| 71 | EE | Ondrej Sýkora,
László A. Székely,
Imrich Vrto:
A note on Halton's conjecture.
Inf. Sci. 164(1-4): 61-64 (2004) |
| 70 | EE | Burkhard Monien,
Imrich Vrto:
Improved bounds on cutwidths of shuffle-exchange and de Bruijn graphs.
Parallel Processing Letters 14(3-4): 361-366 (2004) |
| 2003 |
|---|
| 69 | EE | Farhad Shahrokhi,
Ondrej Sýkora,
László A. Székely,
Imrich Vrto:
Bounds for Convex Crossing Numbers.
COCOON 2003: 487-495 |
| 68 | EE | Farhad Shahrokhi,
Ondrej Sýkora,
László A. Székely,
Imrich Vrto:
Bounds and Methods for k-Planar Crossing Numbers.
Graph Drawing 2003: 37-46 |
| 67 | EE | Matthew Newton,
Ondrej Sýkora,
Mark Withall,
Imrich Vrto:
A Parallel Approach to Row-Based VLSI Layout Using Stochastic Hill-Climbing.
IEA/AIE 2003: 750-758 |
| 66 | EE | Thomas Lücking,
Marios Mavronicolas,
Burkhard Monien,
Manuel Rode,
Paul G. Spirakis,
Imrich Vrto:
Which Is the Worst-Case Nash Equilibrium?
MFCS 2003: 551-561 |
| 65 | EE | Luerbio Faria,
Celina M. Herrera de Figueiredo,
Ondrej Sýkora,
Imrich Vrto:
An Improved Upper Bound on the Crossing Number of the Hypercube.
WG 2003: 230-236 |
| 64 | EE | Hristo Djidjev,
Imrich Vrto:
Crossing Numbers and Cutwidths.
J. Graph Algorithms Appl. 7(3): 245-251 (2003) |
| 63 | EE | Robert J. Cimikowski,
Imrich Vrto:
Improved Bounds for the Crossing Number of the Mesh of Trees.
Journal of Interconnection Networks 4(1): 17-35 (2003) |
| 62 | EE | Tiziana Calamoneri,
Annalisa Massini,
Imrich Vrto:
New results on edge-bandwidth.
Theor. Comput. Sci. 307(3): 503-513 (2003) |
| 2002 |
|---|
| 61 | EE | Ondrej Sýkora,
László A. Székely,
Imrich Vrto:
Fractional Lengths and Crossing Numbers.
Graph Drawing 2002: 186-192 |
| 60 | EE | Matthew Newton,
Ondrej Sýkora,
Imrich Vrto:
Two New Heuristics for Two-Sided Bipartite Graph Drawing.
Graph Drawing 2002: 312-319 |
| 59 | EE | Ondrej Sýkora,
László A. Székely,
Imrich Vrto:
Two Counterexamples in Graph Drawing.
WG 2002: 391-398 |
| 58 | EE | Stefan Dobrev,
Imrich Vrto:
Optimal Broadcasting in Tori with Dynamic Faults.
Parallel Processing Letters 12(1): 17-22 (2002) |
| 57 | EE | Mike Paterson,
Heiko Schröder,
Ondrej Sýkora,
Imrich Vrto:
Permutation Communication in All-Optical Rings.
Parallel Processing Letters 12(1): 23-29 (2002) |
| 2001 |
|---|
| 56 | EE | Xavier Muñoz,
Walter Unger,
Imrich Vrto:
One Sided Crossing Minimization Is NP-Hard for Sparse Graphs.
Graph Drawing 2001: 115-123 |
| 55 | EE | Hristo Djidjev,
Imrich Vrto:
An Improved Lower Bound for Crossing Numbers.
Graph Drawing 2001: 96-101 |
| 54 | EE | Bogdan S. Chlebus,
Stefan Dobrev,
Dariusz R. Kowalski,
Grzegorz Malewicz,
Alexander A. Shvartsman,
Imrich Vrto:
Towards practical deteministic write-all algorithms.
SPAA 2001: 271-280 |
| 2000 |
|---|
| 53 | EE | Stefan Dobrev,
Imrich Vrto:
Optimal Broadcasting in Even Tori with Dynamic Faults (Research Note).
Euro-Par 2000: 927-930 |
| 52 | | André Raspaud,
Ondrej Sýkora,
Imrich Vrto:
Congestion and dilation, similarities and differences: A survey.
SIROCCO 2000: 269-280 |
| 51 | EE | Guillaume Fertin,
André Raspaud,
Heiko Schröder,
Ondrej Sýkora,
Imrich Vrto:
Diameter of the Knödel Graph.
WG 2000: 149-160 |
| 50 | EE | Imrich Vrto:
Cutwidth of the r-dimensional mesh of d-ary trees.
ITA 34(6): 515-519 (2000) |
| 49 | EE | Stefan Dobrev,
Heiko Schröder,
Ondrej Sýkora,
Imrich Vrto:
Evolutionary graph colouring.
Inf. Process. Lett. 76(1-2): 91-94 (2000) |
| 48 | | Ladislav Stacho,
Imrich Vrto:
Virtual Path Layouts in ATM Networks.
SIAM J. Comput. 29(5): 1621-1629 (2000) |
| 47 | EE | Farhad Shahrokhi,
Ondrej Sýkora,
László A. Székely,
Imrich Vrto:
On Bipartite Drawings and the Linear Arrangement Problem.
SIAM J. Comput. 30(6): 1773-1789 (2000) |
| 46 | EE | Farhad Shahrokhi,
Ondrej Sýkora,
László A. Székely,
Imrich Vrto:
A new lower bound for the bipartite crossing number with applications.
Theor. Comput. Sci. 245(2): 281-294 (2000) |
| 1999 |
|---|
| 45 | EE | Farhad Shahrokhi,
Imrich Vrto:
On 3-Layer Crossings and Pseudo Arrangements.
Graph Drawing 1999: 225-231 |
| 44 | | Stefan Dobrev,
Heiko Schröder,
Ondrej Sýkora,
Imrich Vrto:
Evolutionary Graph Colouring.
SIROCCO 1999: 105-110 |
| 43 | EE | Heiko Schröder,
Ondrej Sýkora,
Imrich Vrto:
Cyclic Cutwidth of the Mesh.
SOFSEM 1999: 449-458 |
| 42 | EE | Stefan Dobrev,
Imrich Vrto:
Two Broadcasting Problems in Faulty Hypercubes.
WG 1999: 173-178 |
| 41 | EE | Stefan Dobrev,
Imrich Vrto:
Optimal Broadcasting in Hypercubes with Dynamic Faults.
Inf. Process. Lett. 71(2): 81-85 (1999) |
| 1998 |
|---|
| 40 | | Mike Paterson,
Heiko Schröder,
Ondrej Sýkora,
Imrich Vrto:
On permutation communications in all-optical rings.
SIROCCO 1998: 1-9 |
| 39 | EE | Farhad Shahrokhi,
Ondrej Sýkora,
László A. Székely,
Imrich Vrto:
Intersection of Curves and Crossing Number of Cm x Cn on Surfaces.
Discrete & Computational Geometry 19(2): 237-247 (1998) |
| 38 | EE | Ladislav Stacho,
Imrich Vrto:
Bisection Width of Transposition Graphs.
Discrete Applied Mathematics 84(1-3): 221-235 (1998) |
| 37 | EE | José D. P. Rolim,
Pavel Tvrdík,
Jan Trdlicka,
Imrich Vrto:
Bisecting De Bruijn and Kautz Graphs.
Discrete Applied Mathematics 85(1): 87-97 (1998) |
| 1997 |
|---|
| 36 | | Imrich Vrto:
Cutwidth of the Mesh of dary Trees.
Euro-Par 1997: 242-245 |
| 35 | | Farhad Shahrokhi,
Ondrej Sýkora,
László A. Székely,
Imrich Vrto:
Bipartite Crossing Numbers of Meshes and Hypercubes.
Graph Drawing 1997: 37-46 |
| 34 | | Heiko Schröder,
A. E. May,
Imrich Vrto,
Ondrej Sýkora:
Approximation Algorithms for the Vertex Bipartization Problem.
SOFSEM 1997: 547-554 |
| 33 | | Heiko Schröder,
Ondrej Sýkora,
Imrich Vrto:
Optical All-to-All Communication for Some Product Graphs.
SOFSEM 1997: 555-562 |
| 32 | | Farhad Shahrokhi,
Ondrej Sýkora,
László A. Székely,
Imrich Vrto:
On Bipartite Crossings, Largest Biplanar Subgraphs, and the Linear Arrangement Problem.
WADS 1997: 55-68 |
| 1996 |
|---|
| 31 | | Ladislav Stacho,
Imrich Vrto:
Virtual Path Layout for Some Bounded Degree Networks.
SIROCCO 1996: 269-178 |
| 30 | | Farhad Shahrokhi,
László A. Székely,
Ondrej Sýkora,
Imrich Vrto:
Drawings of Graphs on Surfaces with Few Crossings.
Algorithmica 16(1): 118-131 (1996) |
| 1995 |
|---|
| 29 | | Farhad Shahrokhi,
Ondrej Sýkora,
László A. Székely,
Imrich Vrto:
Crossing Numbers of Meshes.
Graph Drawing 1995: 463-471 |
| 28 | | José D. P. Rolim,
Pavel Tvrdík,
Jan Trdlicka,
Imrich Vrto:
Bisecting de Bruijn and Kautz Graphs.
SIROCCO 1995: 211-222 |
| 27 | | José D. P. Rolim,
Ondrej Sýkora,
Imrich Vrto:
Optimal Cutwidths and Bisection Widths of 2- and 3-Dimensional Meshes.
WG 1995: 252-264 |
| 26 | EE | Imrich Vrto:
Two Remarks on "Expanding and Forwarding" By P. Solé.
Discrete Applied Mathematics 58(1): 85-89 (1995) |
| 25 | | André Raspaud,
Ondrej Sýkora,
Imrich Vrto:
Cutwidth of the Bruijn Graph.
ITA 29(6): 509-514 (1995) |
| 24 | | Juraj Hromkovic,
Vladimír Müller,
Ondrej Sýkora,
Imrich Vrto:
On Embeddings in Cycles
Inf. Comput. 118(2): 302-305 (1995) |
| 1994 |
|---|
| 23 | | Farhad Shahrokhi,
László A. Székely,
Imrich Vrto:
Crossing Numbers of Graphs, Lower Bound Techniques.
Graph Drawing 1994: 131-142 |
| 22 | | Farhad Shahrokhi,
Ondrej Sýkora,
László A. Székely,
Imrich Vrto:
Book Embeddings and Crossing Numbers.
WG 1994: 256-268 |
| 1993 |
|---|
| 21 | | Farhad Shahrokhi,
László A. Székely,
Ondrej Sýkora,
Imrich Vrto:
Improving Bounds for the Crossing Numbers on Surfaces of Genus g.
WG 1993: 388-395 |
| 20 | | Ondrej Sýkora,
Imrich Vrto:
On Crossing Numbers of Hypercubes and Cube Connected Cycles.
BIT 33(2): 232-237 (1993) |
| 19 | | Mike Paterson,
Heiko Schröder,
Ondrej Sýkora,
Imrich Vrto:
A Short Proof of the Dilation of a Toroidal Mesh in a Path.
Inf. Process. Lett. 48(4): 197-199 (1993) |
| 18 | | Krzysztof Diks,
Hristo Djidjev,
Ondrej Sýkora,
Imrich Vrto:
Edge Separators of Planar and Outerplanar Graphs with Applications.
J. Algorithms 14(2): 258-279 (1993) |
| 17 | | Ondrej Sýkora,
Imrich Vrto:
Edge Separators for Graphs of Bounded Genus with Applications.
Theor. Comput. Sci. 112(2): 419-429 (1993) |
| 1992 |
|---|
| 16 | | Juraj Hromkovic,
Vladimír Müller,
Ondrej Sýkora,
Imrich Vrto:
On Embedding Interconnection Networks into Rings of Processors.
PARLE 1992: 53-62 |
| 1991 |
|---|
| 15 | | Bogdan S. Chlebus,
Imrich Vrto:
Unifying Binary-Search Trees and Permutations.
FCT 1991: 190-199 |
| 14 | | Heiko Schröder,
Ondrej Sýkora,
Imrich Vrto:
Optimal Embedding of a Toroidal Array in a Linear Array.
FCT 1991: 390-394 |
| 13 | | Ondrej Sýkora,
Imrich Vrto:
Edge Separators for Graphs of Bounded Genus with Applications.
WG 1991: 159-168 |
| 12 | | Ondrej Sýkora,
Imrich Vrto:
On the Crossing Number of the Hypercube and the Cube Connected Cycles.
WG 1991: 214-218 |
| 11 | | Pavol Duris,
Imrich Vrto:
Semelectivity is not Sufficient.
Inf. Process. Lett. 37(3): 137-141 (1991) |
| 10 | | Bogdan S. Chlebus,
Imrich Vrto:
Parallel Quicksort.
J. Parallel Distrib. Comput. 11(4): 332-337 (1991) |
| 9 | | Vladimir Palko,
Ondrej Sýkora,
Imrich Vrto:
Area Complexity of Merging.
Theor. Comput. Sci. 82(1): 157-163 (1991) |
| 1989 |
|---|
| 8 | | Vladimir Palko,
Ondrej Sýkora,
Imrich Vrto:
Area Complexity of Merging.
MFCS 1989: 390-396 |
| 1988 |
|---|
| 7 | | Krzysztof Diks,
Hristo Djidjev,
Ondrej Sýkora,
Imrich Vrto:
Edge Separators for Planar Graphs and Their Applications.
MFCS 1988: 280-290 |
| 1987 |
|---|
| 6 | | Imrich Vrto:
Area-time Tradeoffs for Selection.
Parallel Algorithms and Architectures 1987: 163-168 |
| 5 | | Pavol Duris,
Ondrej Sýkora,
Clark D. Thompson,
Imrich Vrto:
A Minimum-Area Circuit for l-Selection.
Algorithmica 2: 251-265 (1987) |
| 4 | | Imrich Vrto:
The Area-Time Complexity of the VLSI Counter.
Inf. Process. Lett. 25(6): 397-400 (1987) |
| 3 | | Ondrej Sýkora,
Imrich Vrto:
Tight Chip Area Lower Bounds for String Matching.
Inf. Process. Lett. 26(3): 117-119 (1987) |
| 1985 |
|---|
| 2 | | Pavol Duris,
Ondrej Sýkora,
Imrich Vrto,
Clark D. Thompson:
Tight Chip Area Lower Bounds for Discrete Fourier and Walsh-Hadamard Transformations.
Inf. Process. Lett. 21(5): 245-247 (1985) |
| 1984 |
|---|
| 1 | | Ondrej Sýkora,
Imrich Vrto:
Optimal Layouts of the Tree of Meshes with Vertices on the Perimeter of the Bounding Convex Region.
STACS 1984: 209-217 |
