Imrich Vrto - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 92 from 92

2013

The Same Upper Bound for Both: The 2-Page and the Rectilinear Crossing Numbers of the n-CubeLuerbio Faria, Celina M. Herrera de Figueiredo, R. Bruce Richter, Imrich Vrto. wg 2013: 249-260 [doi]

2009

Antibandwidth of complete k-ary treesTiziana Calamoneri, Annalisa Massini, L ubomír Török, Imrich Vrto. DM, 309(22):6408-6414, 2009. [doi]

Antibandwidth and Cyclic Antibandwidth of Hamming GraphsStefan Dobrev, Rastislav Královic, Dana Pardubská, L ubomír Török, Imrich Vrto. endm, 34:295-300, 2009. [doi]

Two trees which are self-intersecting when drawn simultaneouslyMarkus Geyer, Michael Kaufmann, Imrich Vrto. DM, 309(7):1909-1916, 2009. [doi]

Antibandwidth and cyclic antibandwidth of meshes and hypercubesAndré Raspaud, Heiko Schröder, Ondrej Sýkora, Lubomir Torok, Imrich Vrto. DM, 309(11):3541-3552, 2009. [doi]

Antibandwidth of d-Dimensional MeshesLubomir Torok, Imrich Vrto. iwoca 2009: 471-477 [doi]

2008

An improved upper bound on the crossing number of the hypercubeLuerbio Faria, Celina M. Herrera de Figueiredo, Ondrej Sýkora, Imrich Vrto. jgt, 59(2):145-161, 2008. [doi]

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. rsa, 33(4):480-496, 2008. [doi]

2007

Graph minors and the crossing number of graphsDrago Bokal, Éva Czabarka, László A. Székely, Imrich Vrto. endm, 28:169-175, 2007. [doi]

On k-planar crossing numbersFarhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto. DAM, 155(9):1106-1115, 2007. [doi]

Antibandwidth of Three-Dimensional MeshesLubomir Torok, Imrich Vrto. endm, 28:161-167, 2007. [doi]

2006

Antibandwidth of Complete k-Ary TreesTiziana Calamoneri, Annalisa Massini, Lubomir Torok, Imrich Vrto. endm, 24:259-266, 2006. [doi]

Planar Crossing Numbers of Genus ::::g:::: GraphsHristo Djidjev, Imrich Vrto. icalp 2006: 419-430 [doi]

2005

2004

Dynamic faults have small effect on broadcasting in hypercubesStefan Dobrev, Imrich Vrto. DAM, 137(2):155-158, 2004. [doi]

Improved bounds on cutwidths of shuffle-exchange and de Bruijn graphsBurkhard Monien, Imrich Vrto. ppl, 14(3-4):361-366, 2004. [doi]

New Exact Results and Bounds for Bipartite Crossing Numbers of MeshesMatthew Newton, Ondrej Sýkora, Martin Uzovic, Imrich Vrto. gd 2004: 360-370 [doi]

Cyclic cutwidths of the two-dimensional ordinary and cylindrical meshesHeiko Schröder, Ondrej Sýkora, Imrich Vrto. DAM, 143(1-3):123-129, 2004. [doi]

A note on Halton s conjectureOndrej Sýkora, László A. Székely, Imrich Vrto. isci, 164(1-4):61-64, 2004. [doi]

Layout Volumes of the HypercubeLubomir Torok, Imrich Vrto. gd 2004: 414-424 [doi]

2003

New results on edge-bandwidthTiziana Calamoneri, Annalisa Massini, Imrich Vrto. TCS, 307(3):503-513, 2003. [doi]

Improved Bounds for the Crossing Number of the Mesh of TreesRobert J. Cimikowski, Imrich Vrto. join, 4(1):17-35, 2003. [doi]

Crossing Numbers and CutwidthsHristo Djidjev, Imrich Vrto. jgaa, 7(3):245-251, 2003. [doi]

An Improved Upper Bound on the Crossing Number of the HypercubeLuerbio Faria, Celina M. Herrera de Figueiredo, Ondrej Sýkora, Imrich Vrto. criwg 2003: 230-236 [doi]

Which Is the Worst-Case Nash Equilibrium?Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode, Paul G. Spirakis, Imrich Vrto. mfcs 2003: 551-561 [doi]

A Parallel Approach to Row-Based VLSI Layout Using Stochastic Hill-ClimbingMatthew Newton, Ondrej Sýkora, Mark Withall, Imrich Vrto. ieaaie 2003: 750-758 [doi]

Bounds for Convex Crossing NumbersFarhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto. cocoon 2003: 487-495 [doi]

Bounds and Methods for k-Planar Crossing NumbersFarhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto. gd 2004: 37-46 [doi]

2002

2001

2000

Optimal Broadcasting in Even Tori with Dynamic Faults (Research Note)Stefan Dobrev, Imrich Vrto. europar 2000: 927-930 [doi]

Evolutionary graph colouringStefan Dobrev, Heiko Schröder, Ondrej Sýkora, Imrich Vrto. ipl, 76(1-2):91-94, 2000. [doi]

Diameter of the Knödel GraphGuillaume Fertin, André Raspaud, Heiko Schröder, Ondrej Sýkora, Imrich Vrto. criwg 2000: 149-160 [doi]

Congestion and dilation, similarities and differences: A surveyAndré Raspaud, Ondrej Sýkora, Imrich Vrto. sirocco 2000: 269-280

On Bipartite Drawings and the Linear Arrangement ProblemFarhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto. SICOMP, 30(6):1773-1789, 2000. [doi]

A new lower bound for the bipartite crossing number with applicationsFarhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto. TCS, 245(2):281-294, 2000. [doi]

Virtual Path Layouts in ATM NetworksLadislav Stacho, Imrich Vrto. SICOMP, 29(5):1621-1629, 2000.

Cutwidth of the ::::r::::-dimensional mesh of ::::d::::-ary treesImrich Vrto. ita, 34(6):515-519, 2000. [doi]

1999

1998

1997

1996

Drawings of Graphs on Surfaces with Few CrossingsFarhad Shahrokhi, László A. Székely, Ondrej Sýkora, Imrich Vrto. algorithmica, 16(1):118-131, 1996.

Virtual Path Layout for Some Bounded Degree NetworksLadislav Stacho, Imrich Vrto. sirocco 1996: 269-178

1995

On Embeddings in CyclesJuraj Hromkovic, Vladimír Müller, Ondrej Sýkora, Imrich Vrto. iandc, 118(2):302-305, May 1995.

Cutwidth of the Bruijn GraphAndré Raspaud, Ondrej Sýkora, Imrich Vrto. ita, 29(6):509-514, 1995.

Optimal Cutwidths and Bisection Widths of 2- and 3-Dimensional MeshesJosé D. P. Rolim, Ondrej Sýkora, Imrich Vrto. criwg 1995: 252-264

Bisecting de Bruijn and Kautz GraphsJosé D. P. Rolim, Pavel Tvrdík, Jan Trdlicka, Imrich Vrto. sirocco 1996: 211-222

Crossing Numbers of MeshesFarhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto. gd 1996: 463-471

Two Remarks on Expanding and Forwarding By P. SoléImrich Vrto. DAM, 58(1):85-89, 1995. [doi]

1994

Book Embeddings and Crossing NumbersFarhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto. criwg 1995: 256-268

Crossing Numbers of Graphs, Lower Bound TechniquesFarhad Shahrokhi, László A. Székely, Imrich Vrto. gd 1995: 131-142

1993

1992

On Embedding Interconnection Networks into Rings of ProcessorsJuraj Hromkovic, Vladimír Müller, Ondrej Sýkora, Imrich Vrto. parle 1992: 53-62

1991

Unifying Binary-Search Trees and PermutationsBogdan S. Chlebus, Imrich Vrto. fct 1991: 190-199

Parallel QuicksortBogdan S. Chlebus, Imrich Vrto. jpdc, 11(4):332-337, 1991.

Semelectivity is not SufficientPavol Duris, Imrich Vrto. ipl, 37(3):137-141, 1991.

Area Complexity of MergingVladimir Palko, Ondrej Sýkora, Imrich Vrto. TCS, 82(1):157-163, 1991.

Optimal Embedding of a Toroidal Array in a Linear ArrayHeiko Schröder, Ondrej Sýkora, Imrich Vrto. fct 1991: 390-394

Edge Separators for Graphs of Bounded Genus with ApplicationsOndrej Sýkora, Imrich Vrto. criwg 1992: 159-168

On the Crossing Number of the Hypercube and the Cube Connected CyclesOndrej Sýkora, Imrich Vrto. criwg 1992: 214-218

1989

Area Complexity of MergingVladimir Palko, Ondrej Sýkora, Imrich Vrto. mfcs 1989: 390-396

1988

Edge Separators for Planar Graphs and Their ApplicationsKrzysztof Diks, Hristo Djidjev, Ondrej Sýkora, Imrich Vrto. mfcs 1988: 280-290

1987

A Minimum-Area Circuit for l-SelectionPavol Duris, Ondrej Sýkora, Clark D. Thompson, Imrich Vrto. algorithmica, 2:251-265, 1987.

Tight Chip Area Lower Bounds for String MatchingOndrej Sýkora, Imrich Vrto. ipl, 26(3):117-119, 1987.

Area-time Tradeoffs for SelectionImrich Vrto. paa 1987: 163-168

The Area-Time Complexity of the VLSI CounterImrich Vrto. ipl, 25(6):397-400, 1987.

1985

Tight Chip Area Lower Bounds for Discrete Fourier and Walsh-Hadamard TransformationsPavol Duris, Ondrej Sýkora, Imrich Vrto, Clark D. Thompson. ipl, 21(5):245-247, 1985.

1984

Optimal Layouts of the Tree of Meshes with Vertices on the Perimeter of the Bounding Convex RegionOndrej Sýkora, Imrich Vrto. STACS 1984: 209-217

All Publications

Filter by Year

[-]
OR AND NOT 1

Filter by Type
OR AND NOT 1

Filter by Tag
OR AND NOT 1

Filter by Venue

[+]
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top Terms

[+]
OR AND NOT 1

Researchr

Publications by 'Imrich Vrto'

Viewing Publication 1 - 92 from 92

2013

2009

2008

2007

2006

2005

2004

2003

2002

2001

2000

1999

1998

1997

1996

1995

1994

1993

1992

1991

1989

1988

1987

1985

1984

All Publications

Filter by Year [-]OR AND NOT 1

Filter by TypeOR AND NOT 1

Filter by TagOR AND NOT 1

Filter by Venue [+]OR AND NOT 1

Filter by Author [+]OR AND NOT 1

Filter by Top Terms [+]OR AND NOT 1

Researchr

Publications by 'Imrich Vrto'

Viewing Publication 1 - 92 from 92

2013

2009

2008

2007

2006

2005

2004

2003

2002

2001

2000

1999

1998

1997

1996

1995

1994

1993

1992

1991

1989

1988

1987

1985

1984

Filter by Year

[-]
OR AND NOT 1

Filter by Type
OR AND NOT 1

Filter by Tag
OR AND NOT 1

Filter by Venue

[+]
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top Terms

[+]
OR AND NOT 1