#### Filter Results:

- Full text PDF available (34)

#### Publication Year

1977

2015

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
- SIAM J. Comput.
- 2000

The bipartite crossing number problem is studied and a connection between this problem and the linear arrangement problem is established. A lower bound and an upper bound for the optimal number of crossings are derived, where the main terms are the optimal arrangement values. Two polynomial time approximation algorithms for the bipartite crossing number are… (More)

- André Raspaud, Heiko Schröder, Ondrej Sýkora, L'ubomír Török, Imrich Vrto
- Discrete Mathematics
- 2009

The antibandwidth problem consists of placing the vertices of a graph on a line in consecutive integer points in such a way that the minimum difference of adjacent vertices is maximized. The problem was originally introduced in [15] in connection with multiprocessor scheduling problems and can be also understood as a dual problem to the well known bandwidth… (More)

- Krzysztof Diks, Hristo Djidjev, Ondrej Sýkora, Imrich Vrto
- J. Algorithms
- 1993

- Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
- Theor. Comput. Sci.
- 2000

Let G be a connected bipartite graph.We give a short proof, using a variation of Menger's Theorem, for a new lower bound which relates the bipartite crossing number of G, denoted by bcr(G), to the edge connectivity properties of G. The general lower bound implies a weaker version of a very recent result, establishing a bisection based lower bound on bcr(G)… (More)

- André Raspaud, Ondrej Sýkora, Imrich Vrto
- ITA
- 1995

- José D. P. Rolim, Ondrej Sýkora, Imrich Vrto
- WG
- 1995

- Matthew Newton, Ondrej Sýkora, Imrich Vrto
- Graph Drawing
- 2002

- Heiko Schröder, Ondrej Sýkora, Imrich Vrto
- SOFSEM
- 1999

The cutwidth problem is to nd a linear layout of a network so that the maximal number of cuts (cw) of a line separating consecutive vertices is minimized. A related and more natural problem is the cyclic cutwidth (ccw) when a circular layout is considered. The main question is to compare both measures cw and ccw for speciic networks, whether adding an edge… (More)

- Hongmei He, Ondrej Sýkora, Ana Salagean, Erkki Mäkinen
- J. Parallel Distrib. Comput.
- 2007

- Xuan Liu, Hongmei He, Ondrej Sýkora
- ADMA
- 2005