| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Jirí Isa, Zuzana Reitermanová, Ondrej Sýkora |
Cost-Sensitive Classification with Unconstrained Influence Diagrams.  |
SOFSEM  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | André Raspaud, Heiko Schröder, Ondrej Sýkora, Lubomir Torok, Imrich Vrto |
Antibandwidth and cyclic antibandwidth of meshes and hypercubes. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jirí Isa, Zuzana Reitermanová, Ondrej Sýkora |
On the Complexity of General Solution DAGs. |
ICMLA |
2009 |
DBLP DOI BibTeX RDF |
unconstrained influence diagrams, exact solution, complexity, decision graphs |
| 1 | É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 |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Hongmei He, Ondrej Sýkora, Erkki Mäkinen |
Genetic algorithms for the 2-page book drawing problem of graphs. |
J. Heuristics |
2007 |
DBLP DOI BibTeX RDF |
2-page crossing number, Order of vertices, Edge distribution, Optimal values, Genetic algorithms, Hamiltonian cycle |
| 1 | Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto |
On k-planar crossing numbers. |
Discrete Applied Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Jirí Isa, Viliam Lisý, Zuzana Reitermanová, Ondrej Sýkora |
Unconstrained Influence Diagram Solver: Guido. |
ICTAI |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Hongmei He, Ondrej Sýkora |
A Hopfield Neural Network Model for the Outerplanar Drawing Problem. |
IMECS |
2006 |
DBLP BibTeX RDF |
|
| 1 | Ondrej Sýkora, Lubomir Torok, Imrich Vrto |
The Cyclic Antibandwidth Problem. |
Electronic Notes in Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Hongmei He, Ondrej Sýkora, Imrich Vrto |
Crossing Minimisation Heuristics for 2-page Drawings. |
Electronic Notes in Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Vojtás, Mária Bieliková, Bernadette Charron-Bost, Ondrej Sýkora (eds.) |
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 |
SOFSEM |
2005 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Xuan Liu, Hongmei He, Ondrej Sýkora |
Parallel Genetic Algorithm and Parallel Simulated Annealing Algorithm for the Closest String Problem. |
ADMA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Ondrej Sýkora, László A. Székely, Imrich Vrto |
A note on Halton's conjecture. |
Inf. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Éva Czabarka, Ondrej Sýkora, László A. Székely, Imrich Vrt'o |
Outerplanar Crossing Numbers, the Circular Arrangement Problem and Isoperimetric Functions. |
Electr. J. Comb. |
2004 |
DBLP BibTeX RDF |
|
| 1 | Heiko Schröder, Ondrej Sýkora, Imrich Vrto |
Cyclic cutwidths of the two-dimensional ordinary and cylindrical meshes. |
Discrete Applied Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillaume Fertin, André Raspaud, Ondrej Sýkora |
No-Hole L(p, 0) Labelling of Cycles, Grids and Hypercubes. |
SIROCCO |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Rastislav Kralovic, Ondrej Sýkora (eds.) |
Structural Information and Communication Complexity, 11th International Colloquium , SIROCCO 2004, Smolenice Castle, Slowakia, June 21-23, 2004, Proceedings |
SIROCCO |
2004 |
DBLP BibTeX RDF |
|
| 1 | Matthew Newton, Ondrej Sýkora, Martin Uzovic, Imrich Vrto |
New Exact Results and Bounds for Bipartite Crossing Numbers of Meshes. |
Graph Drawing |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthew Newton, Ondrej Sýkora, Mark Withall, Imrich Vrto |
A Parallel Approach to Row-Based VLSI Layout Using Stochastic Hill-Climbing. |
IEA/AIE |
2003 |
DBLP DOI BibTeX RDF |
Genetic Algorithms, Heuristic Search, Distributed Problem Solving |
| 1 | Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto |
Bounds for Convex Crossing Numbers. |
COCOON |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto |
Bounds and Methods for k-Planar Crossing Numbers. |
Graph Drawing |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Mike Paterson, Heiko Schröder, Ondrej Sýkora, Imrich Vrto |
Permutation Communication in All-Optical Rings. |
Parallel Processing Letters |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Ondrej Sýkora, László A. Székely, Imrich Vrto |
Two Counterexamples in Graph Drawing. |
WG |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthew Newton, Ondrej Sýkora, Imrich Vrto |
Two New Heuristics for Two-Sided Bipartite Graph Drawing. |
Graph Drawing |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Ondrej Sýkora, László A. Székely, Imrich Vrto |
Fractional Lengths and Crossing Numbers. |
Graph Drawing |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Juraj Hromkovic, Ondrej Sýkora |
Preface. |
Discrete Applied Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Dobrev, Heiko Schröder, Ondrej Sýkora, Imrich Vrto |
Evolutionary graph colouring. |
Inf. Process. Lett. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto |
On Bipartite Drawings and the Linear Arrangement Problem. |
SIAM J. Comput. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillaume Fertin, André Raspaud, Heiko Schröder, Ondrej Sýkora, Imrich Vrto |
Diameter of the Knödel Graph. |
WG |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | André Raspaud, Ondrej Sýkora, Imrich Vrto |
Congestion and dilation, similarities and differences: A survey. |
SIROCCO |
2000 |
DBLP BibTeX RDF |
|
| 1 | Stefan Dobrev, Heiko Schröder, Ondrej Sýkora, Imrich Vrto |
Evolutionary Graph Colouring. |
SIROCCO |
1999 |
DBLP BibTeX RDF |
|
| 1 | Heiko Schröder, Ondrej Sýkora, Imrich Vrto |
Cyclic Cutwidth of the Mesh. |
SOFSEM |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Juraj Hromkovic, Ondrej Sýkora (eds.) |
Graph-Theoretic Concepts in Computer Science, 24th International Workshop, WG '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings |
WG |
1998 |
DBLP BibTeX RDF |
|
| 1 | Mike Paterson, Heiko Schröder, Ondrej Sýkora, Imrich Vrto |
On permutation communications in all-optical rings. |
SIROCCO |
1998 |
DBLP BibTeX RDF |
|
| 1 | Ondrej Sýkora |
Special Issue on Parallel and Distributed Computing. |
Computers and Artificial Intelligence |
1997 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Heiko Schröder, Ondrej Sýkora, Imrich Vrto |
Optical All-to-All Communication for Some Product Graphs. |
SOFSEM |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Heiko Schröder, A. E. May, Imrich Vrto, Ondrej Sýkora |
Approximation Algorithms for the Vertex Bipartization Problem. |
SOFSEM |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto |
Bipartite Crossing Numbers of Meshes and Hypercubes. |
Graph Drawing |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Farhad Shahrokhi, László A. Székely, Ondrej Sýkora, Imrich Vrto |
Drawings of Graphs on Surfaces with Few Crossings. |
Algorithmica |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | André Raspaud, Ondrej Sýkora, Imrich Vrto |
Cutwidth of the Bruijn Graph. |
ITA |
1995 |
DBLP BibTeX RDF |
|
| 1 | Juraj Hromkovic, Vladimír Müller, Ondrej Sýkora, Imrich Vrto |
On Embeddings in Cycles |
Inf. Comput. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | José D. P. Rolim, Ondrej Sýkora, Imrich Vrto |
Optimal Cutwidths and Bisection Widths of 2- and 3-Dimensional Meshes. |
WG |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto |
Crossing Numbers of Meshes. |
Graph Drawing |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Ondrej Sýkora, Imrich Vrt'o |
On VLSI layouts of the star graph and related networks. |
Integration |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto |
Book Embeddings and Crossing Numbers. |
WG |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Ondrej Sýkora, Imrich Vrto |
Edge Separators for Graphs of Bounded Genus with Applications. |
Theor. Comput. Sci. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Krzysztof Diks, Hristo Djidjev, Ondrej Sýkora, Imrich Vrto |
Edge Separators of Planar and Outerplanar Graphs with Applications. |
J. Algorithms |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Ondrej Sýkora, Imrich Vrto |
On Crossing Numbers of Hypercubes and Cube Connected Cycles. |
BIT |
1993 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Juraj Hromkovic, Vladimír Müller, Ondrej Sýkora, Imrich Vrto |
On Embedding Interconnection Networks into Rings of Processors. |
PARLE |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir Palko, Ondrej Sýkora, Imrich Vrto |
Area Complexity of Merging. |
Theor. Comput. Sci. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Ondrej Sýkora, Imrich Vrto |
Edge Separators for Graphs of Bounded Genus with Applications. |
WG |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Ondrej Sýkora, Imrich Vrto |
On the Crossing Number of the Hypercube and the Cube Connected Cycles. |
WG |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | P. Ferianc, Ondrej Sýkora |
Area Complexity of Multilective Merging. |
PARLE |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Heiko Schröder, Ondrej Sýkora, Imrich Vrto |
Optimal Embedding of a Toroidal Array in a Linear Array. |
FCT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir Palko, Ondrej Sýkora, Imrich Vrto |
Area Complexity of Merging. |
MFCS |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Krzysztof Diks, Hristo Djidjev, Ondrej Sýkora, Imrich Vrto |
Edge Separators for Planar Graphs and Their Applications. |
MFCS |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Ondrej Sýkora, Imrich Vrto |
Tight Chip Area Lower Bounds for String Matching. |
Inf. Process. Lett. |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Duris, Ondrej Sýkora, Clark D. Thompson, Imrich Vrto |
A Minimum-Area Circuit for l-Selection. |
Algorithmica |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Ondrej Sýkora, Imrich Vrto |
Optimal Layouts of the Tree of Meshes with Vertices on the Perimeter of the Bounding Convex Region. |
STACS |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Ondrej Sýkora |
A Fast Non-Commutative Algorithm for Matrix Multiplication. |
MFCS |
1977 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")