Imrich Vrto - RankMe

93 papers A 13B 26C 2Misc 1Journal 46Unranked 5

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