2008 | ||
---|---|---|
66 | EE | Luerbio 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) |
65 | EE | É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 | ||
64 | EE | Jirí Isa, Viliam Lisý, Zuzana Reitermanová, Ondrej Sýkora: Unconstrained Influence Diagram Solver: Guido. ICTAI (1) 2007: 24-27 |
63 | EE | Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto: On k-planar crossing numbers. Discrete Applied Mathematics 155(9): 1106-1115 (2007) |
62 | EE | Hongmei He, Ondrej Sýkora, Erkki Mäkinen: Genetic algorithms for the 2-page book drawing problem of graphs. J. Heuristics 13(1): 77-93 (2007) |
61 | EE | Hongmei He, Ondrej Sýkora, Ana Salagean, Erkki Mäkinen: Parallelisation of genetic algorithms for the 2-page crossing number problem. J. Parallel Distrib. Comput. 67(2): 229-241 (2007) |
2006 | ||
60 | Hongmei He, Ondrej Sýkora: A Hopfield Neural Network Model for the Outerplanar Drawing Problem. IMECS 2006: 42-47 | |
59 | Hongmei He, Ondrej Sýkora, Ana Salagean: Various Island-based Parallel Genetic Algorithms for the 2-Page Drawing Problem. Parallel and Distributed Computing and Networks 2006: 316-323 | |
2005 | ||
58 | Peter Vojtás, Mária Bieliková, Bernadette Charron-Bost, Ondrej Sýkora: SOFSEM 2005: Theory and Practice of Computer Science, 31st Conference on Current Trends in Theory and Practice of Computer Science, Liptovský Ján, Slovakia, January 22-28, 2005, Proceedings Springer 2005 | |
57 | EE | Xuan Liu, Hongmei He, Ondrej Sýkora: Parallel Genetic Algorithm and Parallel Simulated Annealing Algorithm for the Closest String Problem. ADMA 2005: 591-597 |
56 | EE | Radoslav 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 |
55 | EE | Ondrej Sýkora, Lubomir Torok, Imrich Vrto: The Cyclic Antibandwidth Problem. Electronic Notes in Discrete Mathematics 22: 223-227 (2005) |
54 | EE | Hongmei He, Ondrej Sýkora, Imrich Vrto: Crossing Minimisation Heuristics for 2-page Drawings. Electronic Notes in Discrete Mathematics 22: 527-534 (2005) |
2004 | ||
53 | Rastislav Kralovic, Ondrej Sýkora: Structural Information and Communication Complexity, 11th International Colloquium , SIROCCO 2004, Smolenice Castle, Slowakia, June 21-23, 2004, Proceedings Springer 2004 | |
52 | EE | Matthew Newton, Ondrej Sýkora, Martin Uzovic, Imrich Vrto: New Exact Results and Bounds for Bipartite Crossing Numbers of Meshes. Graph Drawing 2004: 360-370 |
51 | EE | Guillaume Fertin, André Raspaud, Ondrej Sýkora: No-Hole L(p, 0) Labelling of Cycles, Grids and Hypercubes. SIROCCO 2004: 138-148 |
50 | EE | Heiko 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) |
49 | EE | Ondrej Sýkora, László A. Székely, Imrich Vrto: A note on Halton's conjecture. Inf. Sci. 164(1-4): 61-64 (2004) |
2003 | ||
48 | EE | Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto: Bounds for Convex Crossing Numbers. COCOON 2003: 487-495 |
47 | EE | Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto: Bounds and Methods for k-Planar Crossing Numbers. Graph Drawing 2003: 37-46 |
46 | EE | Matthew 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 |
45 | EE | Luerbio 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 |
2002 | ||
44 | EE | Ondrej Sýkora, László A. Székely, Imrich Vrto: Fractional Lengths and Crossing Numbers. Graph Drawing 2002: 186-192 |
43 | EE | Matthew Newton, Ondrej Sýkora, Imrich Vrto: Two New Heuristics for Two-Sided Bipartite Graph Drawing. Graph Drawing 2002: 312-319 |
42 | EE | Ondrej Sýkora, László A. Székely, Imrich Vrto: Two Counterexamples in Graph Drawing. WG 2002: 391-398 |
41 | EE | Mike Paterson, Heiko Schröder, Ondrej Sýkora, Imrich Vrto: Permutation Communication in All-Optical Rings. Parallel Processing Letters 12(1): 23-29 (2002) |
2001 | ||
40 | Juraj Hromkovic, Ondrej Sýkora: Preface. Discrete Applied Mathematics 108(1-2): 1-2 (2001) | |
2000 | ||
39 | André Raspaud, Ondrej Sýkora, Imrich Vrto: Congestion and dilation, similarities and differences: A survey. SIROCCO 2000: 269-280 | |
38 | EE | Guillaume Fertin, André Raspaud, Heiko Schröder, Ondrej Sýkora, Imrich Vrto: Diameter of the Knödel Graph. WG 2000: 149-160 |
37 | EE | Stefan Dobrev, Heiko Schröder, Ondrej Sýkora, Imrich Vrto: Evolutionary graph colouring. Inf. Process. Lett. 76(1-2): 91-94 (2000) |
36 | EE | Farhad 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) |
35 | EE | Farhad 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 | ||
34 | Stefan Dobrev, Heiko Schröder, Ondrej Sýkora, Imrich Vrto: Evolutionary Graph Colouring. SIROCCO 1999: 105-110 | |
33 | EE | Heiko Schröder, Ondrej Sýkora, Imrich Vrto: Cyclic Cutwidth of the Mesh. SOFSEM 1999: 449-458 |
1998 | ||
32 | Juraj Hromkovic, Ondrej Sýkora: Graph-Theoretic Concepts in Computer Science, 24th International Workshop, WG '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings Springer 1998 | |
31 | Mike Paterson, Heiko Schröder, Ondrej Sýkora, Imrich Vrto: On permutation communications in all-optical rings. SIROCCO 1998: 1-9 | |
30 | EE | Farhad 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) |
1997 | ||
29 | Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto: Bipartite Crossing Numbers of Meshes and Hypercubes. Graph Drawing 1997: 37-46 | |
28 | Heiko Schröder, A. E. May, Imrich Vrto, Ondrej Sýkora: Approximation Algorithms for the Vertex Bipartization Problem. SOFSEM 1997: 547-554 | |
27 | Heiko Schröder, Ondrej Sýkora, Imrich Vrto: Optical All-to-All Communication for Some Product Graphs. SOFSEM 1997: 555-562 | |
26 | 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 | |
25 | Ondrej Sýkora: Special Issue on Parallel and Distributed Computing. Computers and Artificial Intelligence 16(2): (1997) | |
1996 | ||
24 | 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 | ||
23 | Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto: Crossing Numbers of Meshes. Graph Drawing 1995: 463-471 | |
22 | José D. P. Rolim, Ondrej Sýkora, Imrich Vrto: Optimal Cutwidths and Bisection Widths of 2- and 3-Dimensional Meshes. WG 1995: 252-264 | |
21 | André Raspaud, Ondrej Sýkora, Imrich Vrto: Cutwidth of the Bruijn Graph. ITA 29(6): 509-514 (1995) | |
20 | Juraj Hromkovic, Vladimír Müller, Ondrej Sýkora, Imrich Vrto: On Embeddings in Cycles Inf. Comput. 118(2): 302-305 (1995) | |
1994 | ||
19 | Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto: Book Embeddings and Crossing Numbers. WG 1994: 256-268 | |
1993 | ||
18 | Farhad 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 | |
17 | Ondrej Sýkora, Imrich Vrto: On Crossing Numbers of Hypercubes and Cube Connected Cycles. BIT 33(2): 232-237 (1993) | |
16 | 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) | |
15 | 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) | |
14 | Ondrej Sýkora, Imrich Vrto: Edge Separators for Graphs of Bounded Genus with Applications. Theor. Comput. Sci. 112(2): 419-429 (1993) | |
1992 | ||
13 | Juraj Hromkovic, Vladimír Müller, Ondrej Sýkora, Imrich Vrto: On Embedding Interconnection Networks into Rings of Processors. PARLE 1992: 53-62 | |
1991 | ||
12 | Heiko Schröder, Ondrej Sýkora, Imrich Vrto: Optimal Embedding of a Toroidal Array in a Linear Array. FCT 1991: 390-394 | |
11 | P. Ferianc, Ondrej Sýkora: Area Complexity of Multilective Merging. PARLE (1) 1991: 209-218 | |
10 | Ondrej Sýkora, Imrich Vrto: Edge Separators for Graphs of Bounded Genus with Applications. WG 1991: 159-168 | |
9 | Ondrej Sýkora, Imrich Vrto: On the Crossing Number of the Hypercube and the Cube Connected Cycles. WG 1991: 214-218 | |
8 | Vladimir Palko, Ondrej Sýkora, Imrich Vrto: Area Complexity of Merging. Theor. Comput. Sci. 82(1): 157-163 (1991) | |
1989 | ||
7 | Vladimir Palko, Ondrej Sýkora, Imrich Vrto: Area Complexity of Merging. MFCS 1989: 390-396 | |
1988 | ||
6 | Krzysztof Diks, Hristo Djidjev, Ondrej Sýkora, Imrich Vrto: Edge Separators for Planar Graphs and Their Applications. MFCS 1988: 280-290 | |
1987 | ||
5 | Pavol Duris, Ondrej Sýkora, Clark D. Thompson, Imrich Vrto: A Minimum-Area Circuit for l-Selection. Algorithmica 2: 251-265 (1987) | |
4 | Ondrej Sýkora, Imrich Vrto: Tight Chip Area Lower Bounds for String Matching. Inf. Process. Lett. 26(3): 117-119 (1987) | |
1985 | ||
3 | 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 | ||
2 | Ondrej 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 | |
1977 | ||
1 | Ondrej Sýkora: A Fast Non-Commutative Algorithm for Matrix Multiplication. MFCS 1977: 504-512 |