The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Ondrej Sýkora: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Xuan Liu, Hongmei He, Ondrej Sýkora
    Parallel Genetic Algorithm and Parallel Simulated Annealing Algorithm for the Closest String Problem. [Citation Graph (0, 0)][DBLP]
    ADMA, 2005, pp:591-597 [Conf]
  2. Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
    Bounds for Convex Crossing Numbers. [Citation Graph (0, 0)][DBLP]
    COCOON, 2003, pp:487-495 [Conf]
  3. Heiko Schröder, Ondrej Sýkora, Imrich Vrto
    Optimal Embedding of a Toroidal Array in a Linear Array. [Citation Graph (0, 0)][DBLP]
    FCT, 1991, pp:390-394 [Conf]
  4. Matthew Newton, Ondrej Sýkora, Martin Uzovic, Imrich Vrto
    New Exact Results and Bounds for Bipartite Crossing Numbers of Meshes. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2004, pp:360-370 [Conf]
  5. Matthew Newton, Ondrej Sýkora, Imrich Vrto
    Two New Heuristics for Two-Sided Bipartite Graph Drawing. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2002, pp:312-319 [Conf]
  6. Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
    Bounds and Methods for k-Planar Crossing Numbers. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2003, pp:37-46 [Conf]
  7. Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
    Crossing Numbers of Meshes. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1995, pp:463-471 [Conf]
  8. Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
    Bipartite Crossing Numbers of Meshes and Hypercubes. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1997, pp:37-46 [Conf]
  9. Ondrej Sýkora, László A. Székely, Imrich Vrto
    Fractional Lengths and Crossing Numbers. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2002, pp:186-192 [Conf]
  10. Matthew Newton, Ondrej Sýkora, Mark Withall, Imrich Vrto
    A Parallel Approach to Row-Based VLSI Layout Using Stochastic Hill-Climbing. [Citation Graph (0, 0)][DBLP]
    IEA/AIE, 2003, pp:750-758 [Conf]
  11. Hongmei He, Ondrej Sýkora
    A Hopfield Neural Network Model for the Outerplanar Drawing Problem. [Citation Graph (0, 0)][DBLP]
    IMECS, 2006, pp:42-47 [Conf]
  12. Krzysztof Diks, Hristo Djidjev, Ondrej Sýkora, Imrich Vrto
    Edge Separators for Planar Graphs and Their Applications. [Citation Graph (0, 0)][DBLP]
    MFCS, 1988, pp:280-290 [Conf]
  13. Vladimir Palko, Ondrej Sýkora, Imrich Vrto
    Area Complexity of Merging. [Citation Graph (0, 0)][DBLP]
    MFCS, 1989, pp:390-396 [Conf]
  14. Ondrej Sýkora
    A Fast Non-Commutative Algorithm for Matrix Multiplication. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:504-512 [Conf]
  15. P. Ferianc, Ondrej Sýkora
    Area Complexity of Multilective Merging. [Citation Graph (0, 0)][DBLP]
    PARLE (1), 1991, pp:209-218 [Conf]
  16. Juraj Hromkovic, Vladimír Müller, Ondrej Sýkora, Imrich Vrto
    On Embedding Interconnection Networks into Rings of Processors. [Citation Graph (0, 0)][DBLP]
    PARLE, 1992, pp:53-62 [Conf]
  17. Hongmei He, Ondrej Sýkora, Ana Salagean
    Various Island-based Parallel Genetic Algorithms for the 2-Page Drawing Problem. [Citation Graph (0, 0)][DBLP]
    Parallel and Distributed Computing and Networks, 2006, pp:316-323 [Conf]
  18. Stefan Dobrev, Heiko Schröder, Ondrej Sýkora, Imrich Vrto
    Evolutionary Graph Colouring. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1999, pp:105-110 [Conf]
  19. Guillaume Fertin, André Raspaud, Ondrej Sýkora
    No-Hole L(p, 0) Labelling of Cycles, Grids and Hypercubes. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2004, pp:138-148 [Conf]
  20. Mike Paterson, Heiko Schröder, Ondrej Sýkora, Imrich Vrto
    On permutation communications in all-optical rings. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1998, pp:1-9 [Conf]
  21. André Raspaud, Ondrej Sýkora, Imrich Vrto
    Congestion and dilation, similarities and differences: A survey. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2000, pp:269-280 [Conf]
  22. Radoslav Fulek, Hongmei He, Ondrej Sýkora, Imrich Vrto
    Outerplanar Crossing Numbers of 3-Row Meshes, Halin Graphs and Complete p-Partite Graphs. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2005, pp:376-379 [Conf]
  23. Heiko Schröder, A. E. May, Imrich Vrto, Ondrej Sýkora
    Approximation Algorithms for the Vertex Bipartization Problem. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 1997, pp:547-554 [Conf]
  24. Heiko Schröder, Ondrej Sýkora, Imrich Vrto
    Optical All-to-All Communication for Some Product Graphs. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 1997, pp:555-562 [Conf]
  25. Heiko Schröder, Ondrej Sýkora, Imrich Vrto
    Cyclic Cutwidth of the Mesh. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 1999, pp:449-458 [Conf]
  26. Ondrej Sýkora, Imrich Vrto
    Optimal Layouts of the Tree of Meshes with Vertices on the Perimeter of the Bounding Convex Region. [Citation Graph (0, 0)][DBLP]
    STACS, 1984, pp:209-217 [Conf]
  27. Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
    On Bipartite Crossings, Largest Biplanar Subgraphs, and the Linear Arrangement Problem. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:55-68 [Conf]
  28. Luerbio Faria, Celina M. Herrera de Figueiredo, Ondrej Sýkora, Imrich Vrto
    An Improved Upper Bound on the Crossing Number of the Hypercube. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:230-236 [Conf]
  29. Guillaume Fertin, André Raspaud, Heiko Schröder, Ondrej Sýkora, Imrich Vrto
    Diameter of the Knödel Graph. [Citation Graph (0, 0)][DBLP]
    WG, 2000, pp:149-160 [Conf]
  30. José D. P. Rolim, Ondrej Sýkora, Imrich Vrto
    Optimal Cutwidths and Bisection Widths of 2- and 3-Dimensional Meshes. [Citation Graph (0, 0)][DBLP]
    WG, 1995, pp:252-264 [Conf]
  31. Farhad Shahrokhi, László A. Székely, Ondrej Sýkora, Imrich Vrto
    Improving Bounds for the Crossing Numbers on Surfaces of Genus g. [Citation Graph (0, 0)][DBLP]
    WG, 1993, pp:388-395 [Conf]
  32. Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
    Book Embeddings and Crossing Numbers. [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:256-268 [Conf]
  33. Ondrej Sýkora, László A. Székely, Imrich Vrto
    Two Counterexamples in Graph Drawing. [Citation Graph (0, 0)][DBLP]
    WG, 2002, pp:391-398 [Conf]
  34. Ondrej Sýkora, Imrich Vrto
    On the Crossing Number of the Hypercube and the Cube Connected Cycles. [Citation Graph (0, 0)][DBLP]
    WG, 1991, pp:214-218 [Conf]
  35. Ondrej Sýkora, Imrich Vrto
    Edge Separators for Graphs of Bounded Genus with Applications. [Citation Graph (0, 0)][DBLP]
    WG, 1991, pp:159-168 [Conf]
  36. Pavol Duris, Ondrej Sýkora, Clark D. Thompson, Imrich Vrto
    A Minimum-Area Circuit for l-Selection. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1987, v:2, n:, pp:251-265 [Journal]
  37. Farhad Shahrokhi, László A. Székely, Ondrej Sýkora, Imrich Vrto
    Drawings of Graphs on Surfaces with Few Crossings. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1996, v:16, n:1, pp:118-131 [Journal]
  38. Ondrej Sýkora, Imrich Vrto
    On Crossing Numbers of Hypercubes and Cube Connected Cycles. [Citation Graph (0, 0)][DBLP]
    BIT, 1993, v:33, n:2, pp:232-237 [Journal]
  39. Ondrej Sýkora
    Special Issue on Parallel and Distributed Computing. [Citation Graph (0, 0)][DBLP]
    Computers and Artificial Intelligence, 1997, v:16, n:2, pp:- [Journal]
  40. Juraj Hromkovic, Ondrej Sýkora
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:108, n:1-2, pp:1-2 [Journal]
  41. Heiko Schröder, Ondrej Sýkora, Imrich Vrto
    Cyclic cutwidths of the two-dimensional ordinary and cylindrical meshes. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:123-129 [Journal]
  42. Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
    On k-planar crossing numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:9, pp:1106-1115 [Journal]
  43. Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
    Intersection of Curves and Crossing Number of Cm x Cn on Surfaces. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1998, v:19, n:2, pp:237-247 [Journal]
  44. Hongmei He, Ondrej Sýkora, Erkki Mäkinen
    Genetic algorithms for the 2-page book drawing problem of graphs. [Citation Graph (0, 0)][DBLP]
    J. Heuristics, 2007, v:13, n:1, pp:77-93 [Journal]
  45. Juraj Hromkovic, Vladimír Müller, Ondrej Sýkora, Imrich Vrto
    On Embeddings in Cycles [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:118, n:2, pp:302-305 [Journal]
  46. Stefan Dobrev, Heiko Schröder, Ondrej Sýkora, Imrich Vrto
    Evolutionary graph colouring. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:76, n:1-2, pp:91-94 [Journal]
  47. Pavol Duris, Ondrej Sýkora, Imrich Vrto, Clark D. Thompson
    Tight Chip Area Lower Bounds for Discrete Fourier and Walsh-Hadamard Transformations. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1985, v:21, n:5, pp:245-247 [Journal]
  48. Mike Paterson, Heiko Schröder, Ondrej Sýkora, Imrich Vrto
    A Short Proof of the Dilation of a Toroidal Mesh in a Path. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:48, n:4, pp:197-199 [Journal]
  49. Ondrej Sýkora, Imrich Vrto
    Tight Chip Area Lower Bounds for String Matching. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:26, n:3, pp:117-119 [Journal]
  50. Ondrej Sýkora, László A. Székely, Imrich Vrto
    A note on Halton's conjecture. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 2004, v:164, n:1-4, pp:61-64 [Journal]
  51. André Raspaud, Ondrej Sýkora, Imrich Vrto
    Cutwidth of the Bruijn Graph. [Citation Graph (0, 0)][DBLP]
    ITA, 1995, v:29, n:6, pp:509-514 [Journal]
  52. Krzysztof Diks, Hristo Djidjev, Ondrej Sýkora, Imrich Vrto
    Edge Separators of Planar and Outerplanar Graphs with Applications. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1993, v:14, n:2, pp:258-279 [Journal]
  53. Hongmei He, Ondrej Sýkora, Ana Salagean, Erkki Mäkinen
    Parallelisation of genetic algorithms for the 2-page crossing number problem. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2007, v:67, n:2, pp:229-241 [Journal]
  54. Mike Paterson, Heiko Schröder, Ondrej Sýkora, Imrich Vrto
    Permutation Communication in All-Optical Rings. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 2002, v:12, n:1, pp:23-29 [Journal]
  55. Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
    On Bipartite Drawings and the Linear Arrangement Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:6, pp:1773-1789 [Journal]
  56. Vladimir Palko, Ondrej Sýkora, Imrich Vrto
    Area Complexity of Merging. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:82, n:1, pp:157-163 [Journal]
  57. Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
    A new lower bound for the bipartite crossing number with applications. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:245, n:2, pp:281-294 [Journal]
  58. Ondrej Sýkora, Imrich Vrto
    Edge Separators for Graphs of Bounded Genus with Applications. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:112, n:2, pp:419-429 [Journal]

  59. On the Complexity of General Solution DAGs. [Citation Graph (, )][DBLP]


  60. Unconstrained Influence Diagram Solver: Guido. [Citation Graph (, )][DBLP]


  61. Antibandwidth and cyclic antibandwidth of meshes and hypercubes. [Citation Graph (, )][DBLP]


Search in 0.009secs, Finished in 0.012secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002