The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Imrich Vrto: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  80. Antibandwidth of d-Dimensional Meshes. [Citation Graph (, )][DBLP]


  81. Antibandwidth and cyclic antibandwidth of meshes and hypercubes. [Citation Graph (, )][DBLP]


  82. Two trees which are self-intersecting when drawn simultaneously. [Citation Graph (, )][DBLP]


  83. Antibandwidth of complete k-ary trees. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.008secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002