The notion of treewidth has seen to be a powerful vehicle for many graph algorithmic studies. This survey paper wants to give an overview of many classes of graphs that can be see...
This work is motivated by the observation that in DES-like ciphexs it is possible to choose the round functions in such a way that every non-trivial one-round characteristic has sm...