Imrich Vrto

According to our database, Imrich Vrto authored at least 96 papers between 1984 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Which is the Worst-Case Nash Equilibrium?

Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Paul G. Spirakis, Imrich Vrto

SIAM J. Discret. Math., 2024

2016

The Same Upper Bound for Both: The 2-page and the Rectilinear Crossing Numbers of the <i>n</i>-Cube.

Luérbio Faria, Celina M. H. de Figueiredo, R. Bruce Richter, Imrich Vrt'o

J. Graph Theory, 2016

2015

Various heuristic algorithms to minimise the two-page crossingnumbers of graphs.

Hongmei He, Ana Salagean, Erkki Mäkinen, Imrich Vrt'o

Open Comput. Sci., 2015

2013

Antibandwidth and cyclic antibandwidth of Hamming graphs.

Stefan Dobrev, Rastislav Královic, Dana Pardubská, L'ubomír Török, Imrich Vrt'o

Discret. Appl. Math., 2013

The Same Upper Bound for Both: The 2-Page and the Rectilinear Crossing Numbers of the n-Cube.

Luérbio Faria, Celina M. H. de Figueiredo, R. Bruce Richter, Imrich Vrto

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

2012

A special antidilation problem for meshes and Hamming graphs.

L'ubomír Török, Imrich Vrt'o

Discret. Math., 2012

Planar Crossing Numbers of Graphs of Bounded Genus.

Hristo N. Djidjev, Imrich Vrt'o

Discret. Comput. Geom., 2012

2010

A note on isoperimetric peaks of complete trees.

Imrich Vrt'o

Discret. Math., 2010

General Lower Bounds for the Minor Crossing Number of Graphs.

Drago Bokal, Éva Czabarka, László A. Székely, Imrich Vrt'o

Discret. Comput. Geom., 2010

2009

Antibandwidth and cyclic antibandwidth of meshes and hypercubes.

André Raspaud, Heiko Schröder, Ondrej Sýkora, Lubomir Torok, Imrich Vrto

Discret. Math., 2009

Two trees which are self-intersecting when drawn simultaneously.

Markus Geyer, Michael Kaufmann, Imrich Vrto

Discret. Math., 2009

Antibandwidth of d-Dimensional Meshes.

Lubomir Torok, Imrich Vrto

Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

2008

Biplanar crossing numbers. II. Comparing crossing numbers and biplanar crossing numbers using the probabilistic method.

Éva Czabarka, Ondrej Sýkora, László A. Székely, Imrich Vrto

Random Struct. Algorithms, 2008

An improved upper bound on the crossing number of the hypercube.

Luérbio Faria, Celina M. H. de Figueiredo, Ondrej Sýkora, Imrich Vrto

J. Graph Theory, 2008

2007

Antibandwidth of Three-Dimensional Meshes.

Lubomir Torok, Imrich Vrto

Electron. Notes Discret. Math., 2007

Graph minors and the crossing number of graphs.

Drago Bokal, Éva Czabarka, László A. Székely, Imrich Vrto

Electron. Notes Discret. Math., 2007

On k-planar crossing numbers.

Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto

Discret. Appl. Math., 2007

2006

Antibandwidth of Complete k-Ary Trees.

Tiziana Calamoneri, Annalisa Massini, Lubomir Torok, Imrich Vrto

Electron. Notes Discret. Math., 2006

Planar Crossing Numbers of Genus <i>g</i> Graphs.

Hristo N. Djidjev, Imrich Vrto

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2005

The Cyclic Antibandwidth Problem.

Ondrej Sýkora, Lubomir Torok, Imrich Vrto

Electron. Notes Discret. Math., 2005

Crossing Minimisation Heuristics for 2-page Drawings.

Hongmei He, Ondrej Sýkora, Imrich Vrto

Electron. Notes Discret. Math., 2005

Outerplanar Crossing Numbers of 3-Row Meshes, Halin Graphs and Complete p-Partite Graphs.

Radoslav Fulek, Hongmei He, Ondrej Sýkora, Imrich Vrto

Proceedings of the SOFSEM 2005: Theory and Practice of Computer Science, 2005

2004

Improved bounds on cutwidths of shuffle-exchange and de Bruijn graphs.

Burkhard Monien, Imrich Vrto

Parallel Process. Lett., 2004

A note on Halton's conjecture.

Ondrej Sýkora, László A. Székely, Imrich Vrto

Inf. Sci., 2004

Cyclic cutwidths of the two-dimensional ordinary and cylindrical meshes.

Heiko Schröder, Ondrej Sýkora, Imrich Vrto

Discret. Appl. Math., 2004

Dynamic faults have small effect on broadcasting in hypercubes.

Stefan Dobrev, Imrich Vrto

Discret. Appl. Math., 2004

Outerplanar Crossing Numbers, the Circular Arrangement Problem and Isoperimetric Functions.

Éva Czabarka, Ondrej Sýkora, László A. Székely, Imrich Vrt'o

Electron. J. Comb., 2004

Layout Volumes of the Hypercube.

Lubomir Torok, Imrich Vrto

Proceedings of the Graph Drawing, 12th International Symposium, 2004

New Exact Results and Bounds for Bipartite Crossing Numbers of Meshes.

Matthew Newton, Ondrej Sýkora, Martin Uzovic, Imrich Vrto

Proceedings of the Graph Drawing, 12th International Symposium, 2004

2003

New results on edge-bandwidth.

Tiziana Calamoneri, Annalisa Massini, Imrich Vrto

Theor. Comput. Sci., 2003

Improved Bounds for the Crossing Number of the Mesh of Trees.

Robert J. Cimikowski, Imrich Vrto

J. Interconnect. Networks, 2003

Crossing Numbers and Cutwidths.

Hristo N. Djidjev, Imrich Vrto

J. Graph Algorithms Appl., 2003

Which Is the Worst-Case Nash Equilibrium?

Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode, Paul G. Spirakis, Imrich Vrto

Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

A Parallel Approach to Row-Based VLSI Layout Using Stochastic Hill-Climbing.

Matthew Newton, Ondrej Sýkora, Mark S. Withall, Imrich Vrto

Proceedings of the Developments in Applied Artificial Intelligence, 2003

Bounds and Methods for k-Planar Crossing Numbers.

Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto

Proceedings of the Graph Drawing, 11th International Symposium, 2003

Bounds for Convex Crossing Numbers.

Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto

Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003

2002

Permutation Communication in All-Optical Rings.

Mike Paterson, Heiko Schröder, Ondrej Sýkora, Imrich Vrto

Parallel Process. Lett., 2002

Optimal Broadcasting in Tori with Dynamic Faults.

Stefan Dobrev, Imrich Vrto

Parallel Process. Lett., 2002

Two Counterexamples in Graph Drawing.

Ondrej Sýkora, László A. Székely, Imrich Vrto

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002

Fractional Lengths and Crossing Numbers.

Ondrej Sýkora, László A. Székely, Imrich Vrto

Proceedings of the Graph Drawing, 10th International Symposium, 2002

Two New Heuristics for Two-Sided Bipartite Graph Drawing.

Matthew Newton, Ondrej Sýkora, Imrich Vrto

Proceedings of the Graph Drawing, 10th International Symposium, 2002

2001

Towards practical deteministic write-all algorithms.

Bogdan S. Chlebus, Stefan Dobrev, Dariusz R. Kowalski, Grzegorz Malewicz, Alexander A. Shvartsman, Imrich Vrto

Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001

One Sided Crossing Minimization Is NP-Hard for Sparse Graphs.

Xavier Muñoz, Walter Unger, Imrich Vrto

Proceedings of the Graph Drawing, 9th International Symposium, 2001

An Improved Lower Bound for Crossing Numbers.

Hristo N. Djidjev, Imrich Vrto

Proceedings of the Graph Drawing, 9th International Symposium, 2001

2000

A new lower bound for the bipartite crossing number with applications.

Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto

Theor. Comput. Sci., 2000

Virtual Path Layouts in ATM Networks.

Ladislav Stacho, Imrich Vrto

SIAM J. Comput., 2000

On Bipartite Drawings and the Linear Arrangement Problem.

Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto

SIAM J. Comput., 2000

Cutwidth of the <i>r</i>-dimensional mesh of <i>d</i>-ary trees.

Imrich Vrto

RAIRO Theor. Informatics Appl., 2000

Evolutionary graph colouring.

Stefan Dobrev, Heiko Schröder, Ondrej Sýkora, Imrich Vrto

Inf. Process. Lett., 2000

Diameter of the Knödel Graph.

Guillaume Fertin, André Raspaud, Heiko Schröder, Ondrej Sýkora, Imrich Vrto

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2000

Congestion and dilation, similarities and differences: A survey.

André Raspaud, Ondrej Sýkora, Imrich Vrto

Proceedings of the SIROCCO 7, 2000

Optimal Broadcasting in Even Tori with Dynamic Faults (Research Note).

Stefan Dobrev, Imrich Vrto

Proceedings of the Euro-Par 2000, Parallel Processing, 6th International Euro-Par Conference, Munich, Germany, August 29, 2000

1999

Optimal Broadcasting in Hypercubes with Dynamic Faults.

Stefan Dobrev, Imrich Vrto

Inf. Process. Lett., 1999

Two Broadcasting Problems in Faulty Hypercubes.

Stefan Dobrev, Imrich Vrto

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1999

Cyclic Cutwidth of the Mesh.

Heiko Schröder, Ondrej Sýkora, Imrich Vrto

Proceedings of the SOFSEM '99, Theory and Practice of Informatics, 26th Conference on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 27, 1999

On 3-Layer Crossings and Pseudo Arrangements.

Farhad Shahrokhi, Imrich Vrto

Proceedings of the Graph Drawing, 7th International Symposium, 1999

1998

Intersection of Curves and Crossing Number of C_m x C_n on Surfaces.

Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto

Discret. Comput. Geom., 1998

Bisection Width of Transposition Graphs.

Ladislav Stacho, Imrich Vrto

Discret. Appl. Math., 1998

Bisecting De Bruijn and Kautz Graphs.

José D. P. Rolim, Pavel Tvrdík, Jan Trdlicka, Imrich Vrto

Discret. Appl. Math., 1998

On permutation communications in all-optical rings.

Mike Paterson, Heiko Schröder, Ondrej Sýkora, Imrich Vrto

Proceedings of the SIROCCO'98, 1998

1997

On Bipartite Crossings, Largest Biplanar Subgraphs, and the Linear Arrangement Problem.

Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto

Proceedings of the Algorithms and Data Structures, 5th International Workshop, 1997

Optical All-to-All Communication for Some Product Graphs.

Heiko Schröder, Ondrej Sýkora, Imrich Vrto

Proceedings of the SOFSEM '97: Theory and Practice of Informatics, 1997

Approximation Algorithms for the Vertex Bipartization Problem.

Heiko Schröder, A. E. May, Imrich Vrto, Ondrej Sýkora

Proceedings of the SOFSEM '97: Theory and Practice of Informatics, 1997

Bipartite Crossing Numbers of Meshes and Hypercubes.

Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto

Proceedings of the Graph Drawing, 5th International Symposium, 1997

Cutwidth of the Mesh of <i>d</i>ary Trees.

Imrich Vrto

Proceedings of the Euro-Par '97 Parallel Processing, 1997

1996

The book crossing number of a graph.

Farhad Shahrokhi, László A. Székely, Ondrej Sýkora, Imrich Vrt'o

J. Graph Theory, 1996

Drawings of Graphs on Surfaces with Few Crossings.

Farhad Shahrokhi, László A. Székely, Ondrej Sýkora, Imrich Vrto

Algorithmica, 1996

Virtual Path Layout for Some Bounded Degree Networks.

Ladislav Stacho, Imrich Vrto

Proceedings of the SIROCCO'96, 1996

1995

On Embeddings in Cycles

Juraj Hromkovic, Vladimír Müller, Ondrej Sýkora, Imrich Vrto

Inf. Comput., May, 1995

Cutwidth of the Bruijn Graph.

André Raspaud, Ondrej Sýkora, Imrich Vrto

RAIRO Theor. Informatics Appl., 1995

Two Remarks on "Expanding and Forwarding" By P. Solé.

Imrich Vrto

Discret. Appl. Math., 1995

Optimal Cutwidths and Bisection Widths of 2- and 3-Dimensional Meshes.

José D. P. Rolim, Ondrej Sýkora, Imrich Vrto

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1995

Bisection widths of transposition graphs.

Ladislav Stacho, Imrich Vrt'o

Proceedings of the Seventh IEEE Symposium on Parallel and Distributed Processing, 1995

Crossing Numbers of Meshes.

Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto

Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1995

1994

On VLSI layouts of the star graph and related networks.

Ondrej Sýkora, Imrich Vrt'o

Integr., 1994

Book Embeddings and Crossing Numbers.

Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1994

Crossing Numbers of Graphs, Lower Bound Techniques.

Farhad Shahrokhi, László A. Székely, Imrich Vrto

Proceedings of the Graph Drawing, DIMACS International Workshop, 1994

1993

Edge Separators for Graphs of Bounded Genus with Applications.

Ondrej Sýkora, Imrich Vrto

Theor. Comput. Sci., 1993

Edge Separators of Planar and Outerplanar Graphs with Applications.

Krzysztof Diks, Hristo N. Djidjev, Ondrej Sýkora, Imrich Vrto

J. Algorithms, 1993

A Short Proof of the Dilation of a Toroidal Mesh in a Path.

Mike Paterson, Heiko Schröder, Ondrej Sýkora, Imrich Vrto

Inf. Process. Lett., 1993

On Crossing Numbers of Hypercubes and Cube Connected Cycles.

Ondrej Sýkora, Imrich Vrto

BIT, 1993

Improving Bounds for the Crossing Numbers on Surfaces of Genus g.

Farhad Shahrokhi, László A. Székely, Ondrej Sýkora, Imrich Vrto

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1993

1992

On Embedding Interconnection Networks into Rings of Processors.

Juraj Hromkovic, Vladimír Müller, Ondrej Sýkora, Imrich Vrto

Proceedings of the PARLE '92: Parallel Architectures and Languages Europe, 1992

1991

Area Complexity of Merging.

Vladimir Palko, Ondrej Sýkora, Imrich Vrto

Theor. Comput. Sci., 1991

Parallel Quicksort.

Bogdan S. Chlebus, Imrich Vrto

J. Parallel Distributed Comput., 1991

Semelectivity is not Sufficient.

Pavol Duris, Imrich Vrto

Inf. Process. Lett., 1991

On the Crossing Number of the Hypercube and the Cube Connected Cycles.

Ondrej Sýkora, Imrich Vrto

Proceedings of the 17th International Workshop, 1991

Optimal Embedding of a Toroidal Array in a Linear Array.

Heiko Schröder, Ondrej Sýkora, Imrich Vrto

Proceedings of the Fundamentals of Computation Theory, 8th International Symposium, 1991

Unifying Binary-Search Trees and Permutations.

Bogdan S. Chlebus, Imrich Vrto

Proceedings of the Fundamentals of Computation Theory, 8th International Symposium, 1991

1988

Edge Separators for Planar Graphs and Their Applications.

Krzysztof Diks, Hristo N. Djidjev, Ondrej Sýkora, Imrich Vrto

Proceedings of the Mathematical Foundations of Computer Science 1988, 1988

1987

The Area-Time Complexity of the VLSI Counter.

Imrich Vrto

Inf. Process. Lett., 1987

Tight Chip Area Lower Bounds for String Matching.

Ondrej Sýkora, Imrich Vrto

Inf. Process. Lett., 1987

A Minimum-Area Circuit for l-Selection.

Pavol Duris, Ondrej Sýkora, Clark D. Thompson, Imrich Vrto

Algorithmica, 1987

Area-time Tradeoffs for Selection.

Imrich Vrto

Proceedings of the Parallel Algorithms and Architectures, 1987

1985

Tight Chip Area Lower Bounds for Discrete Fourier and Walsh-Hadamard Transformations.

Pavol Duris, Ondrej Sýkora, Imrich Vrto, Clark D. Thompson

Inf. Process. Lett., 1985

1984

Optimal Layouts of the Tree of Meshes with Vertices on the Perimeter of the Bounding Convex Region.

Ondrej Sýkora, Imrich Vrto

Proceedings of the STACS 84, 1984