Volume 19; Issue 1

1

Reversals and Transpositions Over Finite Alphabets

Year:
2005
Language:
english
File:
PDF, 263 KB
english, 2005
4

What Costs Are Minimized by Huffman Trees?

Year:
2005
Language:
english
File:
PDF, 238 KB
english, 2005
5

On Equitable Coloring of d -Degenerate Graphs

Year:
2005
Language:
english
File:
PDF, 191 KB
english, 2005
6

Hamiltonian Cycles with Prescribed Edges in Hypercubes

Year:
2005
Language:
english
File:
PDF, 161 KB
english, 2005
7

On Projective Codes Satisfying the Chain Condition

Year:
2005
Language:
english
File:
PDF, 102 KB
english, 2005
8

A Random Version of Shepp's Urn Scheme

Year:
2005
Language:
english
File:
PDF, 204 KB
english, 2005
9

Alternative Digit Sets for Nonadjacent Representations

Year:
2005
Language:
english
File:
PDF, 291 KB
english, 2005
11

On the Structure of Graphs with Non-Surjective L (2,1)-Labelings

Year:
2005
Language:
english
File:
PDF, 232 KB
english, 2005
13

On the Power of Nonlinear Secret-Sharing

Year:
2005
Language:
english
File:
PDF, 264 KB
english, 2005
14

Exact Minimum Density of Codes Identifying Vertices in the Square Grid

Year:
2005
Language:
english
File:
PDF, 190 KB
english, 2005
15

Tighter Bounds for Graph Steiner Tree Approximation

Year:
2005
Language:
english
File:
PDF, 184 KB
english, 2005
16

An Upper Bound for the d -Dimensional Analogue of Heilbronn's Triangle Problem

Year:
2005
Language:
english
File:
PDF, 108 KB
english, 2005
18

Computation in Noisy Radio Networks

Year:
2005
Language:
english
File:
PDF, 158 KB
english, 2005