The following pages link to Imrich Vrt'o (Q244510):
Displaying 50 items.
- Evolutionary graph colouring (Q294858) (← links)
- A special antidilation problem for meshes and Hamming graphs (Q432721) (← links)
- Planar crossing numbers of graphs of bounded genus (Q452001) (← links)
- (Q688626) (redirect page) (← links)
- On crossing numbers of hypercubes and cube connected cycles (Q688627) (← links)
- A note on Halton's conjecture (Q707336) (← links)
- Semelectivity is not sufficient (Q751288) (← links)
- Area complexity of merging (Q807018) (← links)
- On \(k\)-planar crossing numbers (Q885282) (← links)
- Antibandwidth of three-dimensional meshes (Q960961) (← links)
- A note on isoperimetric peaks of complete trees (Q966032) (← links)
- Two trees which are self-intersecting when drawn simultaneously (Q1011769) (← links)
- Antibandwidth and cyclic antibandwidth of meshes and hypercubes (Q1025547) (← links)
- Antibandwidth of complete \(k\)-ary trees (Q1045176) (← links)
- Tight chip area lower bounds for discrete Fourier and Walsh-Hadamard transformations (Q1071504) (← links)
- A minimum-area circuit for \(\ell\)-selection (Q1092661) (← links)
- The area-time complexity of the VLSI counter (Q1096385) (← links)
- (Q1108788) (redirect page) (← links)
- Tight chip area lower bounds for string matching (Q1108789) (← links)
- Edge separators for graphs of bounded genus with applications (Q1210307) (← links)
- (Q1352275) (redirect page) (← 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)
- Bisecting de Bruijn and Kautz graphs (Q1392548) (← links)
- Bisection width of transposition graphs (Q1392578) (← links)
- Dynamic faults have small effect on broadcasting in hypercubes. (Q1427194) (← links)
- A new lower bound for the bipartite crossing number with applications (Q1575746) (← links)
- Optimal broadcasting in hypercubes with dynamic faults (Q1606971) (← links)
- Outerplanar crossing numbers, the circular arrangement problem and isoperimetric functions (Q1773167) (← links)
- Two remarks on ``Expanding and forwarding'' by P. Solé (Q1805467) (← links)
- New results on edge-bandwidth (Q1885045) (← 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)
- Antibandwidth and cyclic antibandwidth of Hamming graphs (Q2446319) (← links)
- On Bipartite Drawings and the Linear Arrangement Problem (Q2706134) (← links)
- Cutwidth of the<i>r</i>-dimensional Mesh of<i>d</i>-ary Trees (Q2729628) (← links)
- (Q2766678) (← links)
- The Same Upper Bound for Both: The 2-page and the Rectilinear Crossing Numbers of the<i>n</i>-Cube (Q2825477) (← links)
- Antibandwidth and Cyclic Antibandwidth of Hamming Graphs (Q2851478) (← links)
- The Same Upper Bound for Both: The 2-Page and the Rectilinear Crossing Numbers of the n-Cube (Q2864306) (← links)
- (Q3043708) (← links)
- (Q3043710) (← links)
- Bounds for Convex Crossing Numbers (Q3082956) (← links)
- (Q3216684) (← links)
- (Q3329402) (← links)
- The Cyclic Antibandwidth Problem (Q3439338) (← links)
- Crossing Minimisation Heuristics for 2-page Drawings (Q3439393) (← links)
- Antibandwidth of Complete k-Ary Trees (Q3439448) (← links)
- Antibandwidth of Three-Dimensional Meshes (Q3439580) (← links)
