The problem of determining the cutwidth of a graph is a notoriously hard problem which remains NP-complete under severe restrictions on input graphs. Until recently, non-trivial p...
Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov...
This paper considers the problem of maintaining a compact representation (O(n) space) of permutation graphs under vertex and edge modifications (insertion or deletion). That repr...
We examine designs and binary codes associated with the line graph of the n-cube Qn, i.e. the Hamming graph H(n, 2). We find the automorphism groups and the parameters of the cod...
Given an integer s 0 and a permutation Sn, let ,s be the graph on n vertices {1, . . . , n} where two vertices i < j are adjacent if the permutation flips their order and th...
Given a linear code C, the fundamental problem of trellis decoding is to find a coordinate permutation of C that yields a code C′ whose minimal trellis has the least state-compl...