The following pages link to Ondrej Sýkora (Q294857):
Displaying 50 items.
- Evolutionary graph colouring (Q294858) (← links)
- On crossing numbers of hypercubes and cube connected cycles (Q688627) (← links)
- A note on Halton's conjecture (Q707336) (← links)
- (Q807017) (redirect page) (← links)
- Area complexity of merging (Q807018) (← links)
- Parallelisation of genetic algorithms for the 2-page crossing number problem (Q866771) (← links)
- On \(k\)-planar crossing numbers (Q885282) (← links)
- Antibandwidth and cyclic antibandwidth of meshes and hypercubes (Q1025547) (← links)
- VLSI systems for some problems of computational geometry (Q1057047) (← links)
- Tight chip area lower bounds for discrete Fourier and Walsh-Hadamard transformations (Q1071504) (← links)
- A minimum-area circuit for \(\ell\)-selection (Q1092661) (← links)
- (Q1108787) (redirect page) (← links)
- Tight chip area lower bounds for string matching (Q1108789) (← links)
- Edge separators for graphs of bounded genus with applications (Q1210307) (← links)
- The crossing number of a graph on a compact 2-manifold (Q1352278) (← links)
- Intersection of curves and crossing number of \(C_m\times C_n\) on surfaces (Q1380778) (← links)
- A new lower bound for the bipartite crossing number with applications (Q1575746) (← links)
- Outerplanar crossing numbers, the circular arrangement problem and isoperimetric functions (Q1773167) (← links)
- Cyclic cutwidths of the two-dimensional ordinary and cylindrical meshes (Q1887048) (← links)
- On embeddings in cycles (Q1892891) (← links)
- Drawings of graphs on surfaces with few crossings (Q1920424) (← links)
- On Bipartite Drawings and the Linear Arrangement Problem (Q2706134) (← links)
- (Q2766678) (← links)
- Cost-Sensitive Classification with Unconstrained Influence Diagrams (Q2891397) (← links)
- Bounds for Convex Crossing Numbers (Q3082956) (← links)
- (Q3329402) (← links)
- (Q3334114) (← links)
- The Cyclic Antibandwidth Problem (Q3439338) (← links)
- Crossing Minimisation Heuristics for 2-page Drawings (Q3439393) (← links)
- An improved upper bound on the crossing number of the hypercube (Q3605145) (← links)
- Biplanar crossing numbers. II. Comparing crossing numbers and biplanar crossing numbers using the probabilistic method (Q3608305) (← links)
- (Q3711746) (← links)
- (Q3768410) (← links)
- (Q3780482) (← links)
- (Q3792298) (← links)
- (Q3798265) (← links)
- (Q3939269) (← links)
- (Q3975163) (← links)
- Edge Separators of Planar and Outerplanar Graphs With Applications (Q4033768) (← links)
- (Q4125772) (← links)
- On VLSI layouts of the star graph and related networks (Q4322467) (← links)
- (Q4352316) (← links)
- Cutwidth of the de Bruijn graph (Q4359288) (← links)
- (Q4414514) (← links)
- (Q4422275) (← links)
- (Q4422291) (← links)
- (Q4450946) (← links)
- (Q4496254) (← links)
- (Q4657594) (← links)
- (Q4694728) (← links)
