This paper proves that in Size Theory the comparison of multidimensional size functions can be reduced to the 1-dimensional case by a suitable change of variables. Indeed, we show...
This paper advises the use of k-dimensional size functions for comparison and retrieval in the context of multidimensional shapes, where by shape we mean something in two or highe...
Abstract We introduce a parameterized notion of feature size that interpolates between the minimum of the local feature size and the recently introduced weak feature size. Based on...
We describe a new model for studying intermittently connected mobile networks, based on Markovian random temporal graphs, that captures the influence of message size, maximum tol...
John Whitbeck, Vania Conan, Marcelo Dias de Amorim
A class of graphs is nowhere dense if for every integer r there is a finite upper bound on the size of cliques that occur as (topological) r-minors. We observe that this tameness ...