Imrich Vrto

Publication Activity (10 Years)

Years Active: 1984-2024
Publications (10 Years): 1

Top Topics

Approximation Algorithms

Nash Equilibrium

Top Venues

SIAM J. Discret. Math.

Publications

Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Paul G. Spirakis, Imrich Vrto
Which is the Worst-Case Nash Equilibrium? SIAM J. Discret. Math. 38 (2) (2024)
Luérbio Faria, Celina M. H. de Figueiredo, R. Bruce Richter, Imrich Vrto
The Same Upper Bound for Both: The 2-Page and the Rectilinear Crossing Numbers of the n-Cube. WG (2013)
Stefan Dobrev, Rastislav Královic, Dana Pardubská, L'ubomír Török, Imrich Vrto
Antibandwidth and Cyclic Antibandwidth of Hamming Graphs. Electron. Notes Discret. Math. 34 (2009)
André Raspaud, Heiko Schröder, Ondrej Sýkora, Lubomir Torok, Imrich Vrto
Antibandwidth and cyclic antibandwidth of meshes and hypercubes. Discret. Math. 309 (11) (2009)
Markus Geyer, Michael Kaufmann, Imrich Vrto
Two trees which are self-intersecting when drawn simultaneously. Discret. Math. 309 (7) (2009)
Tiziana Calamoneri, Annalisa Massini, L'ubomír Török, Imrich Vrto
Antibandwidth of complete k-ary trees. Discret. Math. 309 (22) (2009)
Lubomir Torok, Imrich Vrto
Antibandwidth of d-Dimensional Meshes. IWOCA (2009)
Luérbio Faria, Celina M. H. de Figueiredo, Ondrej Sýkora, Imrich Vrto
An improved upper bound on the crossing number of the hypercube. J. Graph Theory 59 (2) (2008)
É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) (2008)
Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
On k-planar crossing numbers. Discret. Appl. Math. 155 (9) (2007)
Lubomir Torok, Imrich Vrto
Antibandwidth of Three-Dimensional Meshes. Electron. Notes Discret. Math. 28 (2007)
Drago Bokal, Éva Czabarka, László A. Székely, Imrich Vrto
Graph minors and the crossing number of graphs. Electron. Notes Discret. Math. 28 (2007)
Hristo N. Djidjev, Imrich Vrto
Graphs. ICALP (1) (2006)
Tiziana Calamoneri, Annalisa Massini, Lubomir Torok, Imrich Vrto
Antibandwidth of Complete k-Ary Trees. Electron. Notes Discret. Math. 24 (2006)
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)
Hongmei He, Ondrej Sýkora, Imrich Vrto
Crossing Minimisation Heuristics for 2-page Drawings. Electron. Notes Discret. Math. 22 (2005)
Ondrej Sýkora, Lubomir Torok, Imrich Vrto
The Cyclic Antibandwidth Problem. Electron. Notes Discret. Math. 22 (2005)
Markus Geyer, Michael Kaufmann, Imrich Vrto
Two Trees Which Are Self-intersecting When Drawn Simultaneously. Graph Drawing (2005)
Heiko Schröder, Ondrej Sýkora, Imrich Vrto
Cyclic cutwidths of the two-dimensional ordinary and cylindrical meshes. Discret. Appl. Math. 143 (1-3) (2004)
Stefan Dobrev, Imrich Vrto
Dynamic faults have small effect on broadcasting in hypercubes. Discret. Appl. Math. 137 (2) (2004)
Ondrej Sýkora, László A. Székely, Imrich Vrto
A note on Halton's conjecture. Inf. Sci. 164 (1-4) (2004)
Matthew Newton, Ondrej Sýkora, Martin Uzovic, Imrich Vrto
New Exact Results and Bounds for Bipartite Crossing Numbers of Meshes. Graph Drawing (2004)
Burkhard Monien, Imrich Vrto
Improved bounds on cutwidths of shuffle-exchange and de Bruijn graphs. Parallel Process. Lett. 14 (3-4) (2004)
Lubomir Torok, Imrich Vrto
Layout Volumes of the Hypercube. Graph Drawing (2004)
Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
Bounds and Methods for k-Planar Crossing Numbers. Graph Drawing (2003)
Matthew Newton, Ondrej Sýkora, Mark S. Withall, Imrich Vrto
A Parallel Approach to Row-Based VLSI Layout Using Stochastic Hill-Climbing. IEA/AIE (2003)
Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode, Paul G. Spirakis, Imrich Vrto
Which Is the Worst-Case Nash Equilibrium? MFCS (2003)
Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
Bounds for Convex Crossing Numbers. COCOON (2003)
Tiziana Calamoneri, Annalisa Massini, Imrich Vrto
New results on edge-bandwidth. Theor. Comput. Sci. 307 (3) (2003)
Hristo N. Djidjev, Imrich Vrto
Crossing Numbers and Cutwidths. J. Graph Algorithms Appl. 7 (3) (2003)
Luérbio Faria, Celina M. H. de Figueiredo, Ondrej Sýkora, Imrich Vrto
An Improved Upper Bound on the Crossing Number of the Hypercube. WG (2003)
Robert J. Cimikowski, Imrich Vrto
Improved Bounds for the Crossing Number of the Mesh of Trees. J. Interconnect. Networks 4 (1) (2003)
Ondrej Sýkora, László A. Székely, Imrich Vrto
Fractional Lengths and Crossing Numbers. Graph Drawing (2002)
Ondrej Sýkora, László A. Székely, Imrich Vrto
Two Counterexamples in Graph Drawing. WG (2002)
Matthew Newton, Ondrej Sýkora, Imrich Vrto
Two New Heuristics for Two-Sided Bipartite Graph Drawing. Graph Drawing (2002)
Mike Paterson, Heiko Schröder, Ondrej Sýkora, Imrich Vrto
Permutation Communication in All-Optical Rings. Parallel Process. Lett. 12 (1) (2002)
Stefan Dobrev, Imrich Vrto
Optimal Broadcasting in Tori with Dynamic Faults. Parallel Process. Lett. 12 (1) (2002)
Hristo N. Djidjev, Imrich Vrto
An Improved Lower Bound for Crossing Numbers. Graph Drawing (2001)
Bogdan S. Chlebus, Stefan Dobrev, Dariusz R. Kowalski, Grzegorz Malewicz, Alexander A. Shvartsman, Imrich Vrto
Towards practical deteministic write-all algorithms. SPAA (2001)
Xavier Muñoz, Walter Unger, Imrich Vrto
One Sided Crossing Minimization Is NP-Hard for Sparse Graphs. Graph Drawing (2001)
Imrich Vrto
-ary trees. RAIRO Theor. Informatics Appl. 34 (6) (2000)
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) (2000)
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) (2000)
Stefan Dobrev, Imrich Vrto
Optimal Broadcasting in Even Tori with Dynamic Faults (Research Note). Euro-Par (2000)
André Raspaud, Ondrej Sýkora, Imrich Vrto
Congestion and dilation, similarities and differences: A survey. SIROCCO (2000)
Stefan Dobrev, Heiko Schröder, Ondrej Sýkora, Imrich Vrto
Evolutionary graph colouring. Inf. Process. Lett. 76 (1-2) (2000)
Guillaume Fertin, André Raspaud, Heiko Schröder, Ondrej Sýkora, Imrich Vrto
Diameter of the Knödel Graph. WG (2000)
Ladislav Stacho, Imrich Vrto
Virtual Path Layouts in ATM Networks. SIAM J. Comput. 29 (5) (2000)
Farhad Shahrokhi, Imrich Vrto
On 3-Layer Crossings and Pseudo Arrangements. Graph Drawing (1999)
Stefan Dobrev, Heiko Schröder, Ondrej Sýkora, Imrich Vrto
Evolutionary Graph Colouring. SIROCCO (1999)
Heiko Schröder, Ondrej Sýkora, Imrich Vrto
Cyclic Cutwidth of the Mesh. SOFSEM (1999)
Stefan Dobrev, Imrich Vrto
Optimal Broadcasting in Hypercubes with Dynamic Faults. Inf. Process. Lett. 71 (2) (1999)
Stefan Dobrev, Imrich Vrto
Two Broadcasting Problems in Faulty Hypercubes. WG (1999)
Ladislav Stacho, Imrich Vrto
Bisection Width of Transposition Graphs. Discret. Appl. Math. 84 (1-3) (1998)
José D. P. Rolim, Pavel Tvrdík, Jan Trdlicka, Imrich Vrto
Bisecting De Bruijn and Kautz Graphs. Discret. Appl. Math. 85 (1) (1998)
Mike Paterson, Heiko Schröder, Ondrej Sýkora, Imrich Vrto
On permutation communications in all-optical rings. SIROCCO (1998)
Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
on Surfaces. Discret. Comput. Geom. 19 (2) (1998)
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)
Heiko Schröder, A. E. May, Imrich Vrto, Ondrej Sýkora
Approximation Algorithms for the Vertex Bipartization Problem. SOFSEM (1997)
Imrich Vrto
ary Trees. Euro-Par (1997)
Heiko Schröder, Ondrej Sýkora, Imrich Vrto
Optical All-to-All Communication for Some Product Graphs. SOFSEM (1997)
Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
Bipartite Crossing Numbers of Meshes and Hypercubes. Graph Drawing (1997)
Farhad Shahrokhi, László A. Székely, Ondrej Sýkora, Imrich Vrto
Drawings of Graphs on Surfaces with Few Crossings. Algorithmica 16 (1) (1996)
Ladislav Stacho, Imrich Vrto
Virtual Path Layout for Some Bounded Degree Networks. SIROCCO (1996)
Imrich Vrto
Two Remarks on "Expanding and Forwarding" By P. Solé. Discret. Appl. Math. 58 (1) (1995)
André Raspaud, Ondrej Sýkora, Imrich Vrto
Cutwidth of the Bruijn Graph. RAIRO Theor. Informatics Appl. 29 (6) (1995)
Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
Crossing Numbers of Meshes. Graph Drawing (1995)
José D. P. Rolim, Ondrej Sýkora, Imrich Vrto
Optimal Cutwidths and Bisection Widths of 2- and 3-Dimensional Meshes. WG (1995)
Juraj Hromkovic, Vladimír Müller, Ondrej Sýkora, Imrich Vrto
On Embeddings in Cycles Inf. Comput. 118 (2) (1995)
José D. P. Rolim, Pavel Tvrdík, Jan Trdlicka, Imrich Vrto
Bisecting de Bruijn and Kautz Graphs. SIROCCO (1995)
Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
Book Embeddings and Crossing Numbers. WG (1994)
Farhad Shahrokhi, László A. Székely, Imrich Vrto
Crossing Numbers of Graphs, Lower Bound Techniques. Graph Drawing (1994)
Ondrej Sýkora, Imrich Vrto
Edge Separators for Graphs of Bounded Genus with Applications. Theor. Comput. Sci. 112 (2) (1993)
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)
Ondrej Sýkora, Imrich Vrto
On Crossing Numbers of Hypercubes and Cube Connected Cycles. BIT 33 (2) (1993)
Krzysztof Diks, Hristo N. Djidjev, Ondrej Sýkora, Imrich Vrto
Edge Separators of Planar and Outerplanar Graphs with Applications. J. Algorithms 14 (2) (1993)
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) (1993)
Juraj Hromkovic, Vladimír Müller, Ondrej Sýkora, Imrich Vrto
On Embedding Interconnection Networks into Rings of Processors. PARLE (1992)
Vladimir Palko, Ondrej Sýkora, Imrich Vrto
Area Complexity of Merging. Theor. Comput. Sci. 82 (1) (1991)
Heiko Schröder, Ondrej Sýkora, Imrich Vrto
Optimal Embedding of a Toroidal Array in a Linear Array. FCT (1991)
Ondrej Sýkora, Imrich Vrto
On the Crossing Number of the Hypercube and the Cube Connected Cycles. WG (1991)
Ondrej Sýkora, Imrich Vrto
Edge Separators for Graphs of Bounded Genus with Applications. WG (1991)
Bogdan S. Chlebus, Imrich Vrto
Unifying Binary-Search Trees and Permutations. FCT (1991)
Pavol Duris, Imrich Vrto
Semelectivity is not Sufficient. Inf. Process. Lett. 37 (3) (1991)
Bogdan S. Chlebus, Imrich Vrto
Parallel Quicksort. J. Parallel Distributed Comput. 11 (4) (1991)
Vladimir Palko, Ondrej Sýkora, Imrich Vrto
Area Complexity of Merging. MFCS (1989)
Krzysztof Diks, Hristo N. Djidjev, Ondrej Sýkora, Imrich Vrto
Edge Separators for Planar Graphs and Their Applications. MFCS (1988)
Ondrej Sýkora, Imrich Vrto
Tight Chip Area Lower Bounds for String Matching. Inf. Process. Lett. 26 (3) (1987)
Imrich Vrto
Area-time Tradeoffs for Selection. Parallel Algorithms and Architectures (1987)
Pavol Duris, Ondrej Sýkora, Clark D. Thompson, Imrich Vrto
A Minimum-Area Circuit for l-Selection. Algorithmica 2 (1987)
Imrich Vrto
The Area-Time Complexity of the VLSI Counter. Inf. Process. Lett. 25 (6) (1987)
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) (1985)
Ondrej Sýkora, Imrich Vrto
Optimal Layouts of the Tree of Meshes with Vertices on the Perimeter of the Bounding Convex Region. STACS (1984)