Let W be a finite or an affine Coxeter group and Wc the set of all the fully commutative elements in W. For any left cell L of W containing some fully commutative element, our main...
Abstract: A k-tree is a chordal graph with no (k + 2)-clique. An -treepartition of a graph G is a vertex partition of G into `bags,' such that contracting each bag to a single...
Escard´o, Hofmann and Streicher showed that real-number computations in the interval-domain environment are inherently parallel, in the sense that they imply the presence of weak...
Let the trunk of a graph G be the graph obtained by removing all leaves of G. We prove that, for every integer c 2, there are at most finitely many trunks of semiharmonic graphs ...
In this survey we focus on open issues of the wireless Internet. Our main intention is to elaborate what has to be done to integrate mobile devices in the Internet in such way tha...