Result 1 to 20 of 238 total
Wirelength of hypercubes into certain trees. (English)
Discrete Appl. Math. 160, No. 18, 2778-2786 (2012).
1
Minimum wirelength of hypercubes into $n$-dimensional grid networks. (English)
Inf. Process. Lett. 112, No. 14-15, 583-586 (2012).
2
Embedding of hypercubes into necklace, windmill and snake graphs. (English)
Inf. Process. Lett. 112, No. 12, 509-515 (2012).
3
Conditional resolvability of honeycomb and hexagonal networks. (English)
Math. Comput. Sci. 5, No. 1, 89-99 (2011).
4
On the radio number of the hexagonal mesh. (English)
J. Comb. Math. Comb. Comput. 79, 235-244 (2011).
5
Betweenness centrality of honeycomb networks. (English)
J. Comb. Math. Comb. Comput. 79, 163-172 (2011).
6
Embedding in fat trees. (English)
J. Comb. Math. Comb. Comput. 79, 139-146 (2011).
7
On the crossing number of honeycomb related networks. (English)
J. Comb. Math. Comb. Comput. 79, 129-137 (2011).
8
Acyclic kernel number of oriented cycle related graphs. (English)
J. Comb. Math. Comb. Comput. 79, 111-120 (2011).
9
One-factor resolvability of grid derived networks. (English)
J. Comb. Math. Comb. Comput. 79, 77-89 (2011).
10
Landmarks in binary tree derived architectures. (English)
Ars Comb. 99, 473-486 (2011).
11
Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength. (English)
Discrete Appl. Math. 159, No. 17, 2109-2116 (2011).
12
A constellation power allocation scheme for two-user Gaussian MAC. (English)
Comput. Res. Repos. 2011, Article No. 1104.5170 (2011).
13
Maximum rate of 3- and 4-real-symbol ML decodable unitary weight stbcs. (English)
Comput. Res. Repos. 2011, Article No. 1104.5117 (2011).
14
A non-orthogonal DF scheme for the single relay channel and the effect of labelling. (English)
Comput. Res. Repos. 2011, Article No. 1104.0735 (2011).
15
On the sphere decoding complexity of stbcs for asymmetric MIMO systems. (English)
Comput. Res. Repos. 2011, Article No. 1104.0640 (2011).
16
A transform approach to linear network coding for acyclic networks with delay. (English)
Comput. Res. Repos. 2011, Article No. 1103.3882 (2011).
17
Bounds on the achievable rate for the fading relay channel with finite input constellations. (English)
Comput. Res. Repos. 2011, Article No. 1102.4272 (2011).
18
Capacity region of $K$-user discrete memoryless interference channels with a mixed strong-very strong interference. (English)
Comput. Res. Repos. 2011, Article No. 1102.3140 (2011).
19
On network coding for acyclic networks with delays. (English)
Comput. Res. Repos. 2011, Article No. 1102.1782 (2011).
20
Result 1 to 20 of 238 total
Start
Contact
Print
General Help
