Imrich Vrt'o

12 papers Journal 11Unranked 1
YearRankTypeTitle / Venue / Authors
2016 J jnl
The Same Upper Bound for Both: The 2-page and the Rectilinear Crossing Numbers of the
J. Graph Theory
Luérbio Faria, Celina M. H. de Figueiredo, R. Bruce Richter, Imrich Vrt'o
2015 J jnl
Various heuristic algorithms to minimise the two-page crossingnumbers of graphs.
Open Comput. Sci.
Hongmei He, Ana Salagean, Erkki Mäkinen, Imrich Vrt'o
2013 J jnl
Antibandwidth and cyclic antibandwidth of Hamming graphs.
Discret. Appl. Math.
Stefan Dobrev, Rastislav Královic, Dana Pardubská, L'ubomír Török, Imrich Vrt'o
2012 J jnl
A special antidilation problem for meshes and Hamming graphs.
Discret. Math.
L'ubomír Török, Imrich Vrt'o
2012 J jnl
Planar Crossing Numbers of Graphs of Bounded Genus.
Discret. Comput. Geom.
Hristo N. Djidjev, Imrich Vrt'o
2010 J jnl
A note on isoperimetric peaks of complete trees.
Discret. Math.
Imrich Vrt'o
2010 J jnl
Antibandwidth of three-dimensional meshes.
Discret. Math.
L'ubomír Török, Imrich Vrt'o
2010 J jnl
General Lower Bounds for the Minor Crossing Number of Graphs.
Discret. Comput. Geom.
Drago Bokal, Éva Czabarka, László A. Székely, Imrich Vrt'o
2004 J jnl
Outerplanar Crossing Numbers, the Circular Arrangement Problem and Isoperimetric Functions.
Electron. J. Comb.
Éva Czabarka, Ondrej Sýkora, László A. Székely, Imrich Vrt'o
1996 J jnl
The book crossing number of a graph.
J. Graph Theory
Farhad Shahrokhi, László A. Székely, Ondrej Sýkora, Imrich Vrt'o
1995 — conf
Bisection widths of transposition graphs.
SPDP
Ladislav Stacho, Imrich Vrt'o
1994 J jnl
On VLSI layouts of the star graph and related networks.
Integr.
Ondrej Sýkora, Imrich Vrt'o