dblp.uni-trier.dewww.uni-trier.de

Imrich Vrto Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

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

Coauthor Index

1Drago Bokal [82]
2Tiziana Calamoneri [62] [80]
3Bogdan S. Chlebus [10] [15] [54]
4Robert J. Cimikowski [63]
5Éva Czabarka [82] [85]
6Krzysztof Diks [7] [18]
7Hristo Djidjev [7] [18] [55] [64] [81]
8Stefan Dobrev [41] [42] [44] [49] [53] [54] [58] [73]
9Pavol Duris [2] [5] [11]
10Luerbio Faria [65] [86]
11Guillaume Fertin [51]
12Celina M. Herrera de Figueiredo [65] [86]
13Radoslav Fulek [78]
14Markus Geyer [79]
15Hongmei He [76] [78]
16Juraj Hromkovic [16] [24]
17Michael Kaufmann [79]
18Dariusz R. Kowalski [54]
19Thomas Lücking [66]
20Grzegorz Malewicz [54]
21Annalisa Massini [62] [80]
22Marios Mavronicolas [66]
23A. E. May [34]
24Burkhard Monien [66] [70]
25Vladimír Müller [16] [24]
26Xavier Muñoz [56]
27Matthew Newton [60] [67] [75]
28Vladimir Palko [8] [9]
29Mike Paterson [19] [40] [57]
30André Raspaud [25] [51] [52]
31Manuel Rode [66]
32José D. P. Rolim [27] [28] [37]
33Heiko Schröder [14] [19] [33] [34] [40] [43] [44] [49] [51] [57] [72]
34Farhad Shahrokhi [21] [22] [23] [29] [30] [32] [35] [39] [45] [46] [47] [68] [69] [84]
35Alexander A. Shvartsman [54]
36Paul G. Spirakis [66]
37Ladislav Stacho [31] [38] [48]
38Ondrej Sýkora [1] [2] [3] [5] [7] [8] [9] [12] [13] [14] [16] [17] [18] [19] [20] [21] [22] [24] [25] [27] [29] [30] [32] [33] [34] [35] [39] [40] [43] [44] [46] [47] [49] [51] [52] [57] [59] [60] [61] [65] [67] [68] [69] [71] [72] [75] [76] [77] [78] [84] [85] [86]
39László A. Székely [21] [22] [23] [29] [30] [32] [35] [39] [46] [47] [59] [61] [68] [69] [71] [82] [84] [85]
40Clark D. Thomborson (Clark D. Thompson) [2] [5]
41Lubomir Torok [74] [77] [80] [83]
42Jan Trdlicka [28] [37]
43Pavel Tvrdík [28] [37]
44Walter Unger [56]
45Martin Uzovic [75]
46Mark Withall [67]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)