We study the problem of monotonicity testing over the hypercube. As previously observed in several works, a positive answer to a natural question about routing properties of the hy...
Given a graph G, a k-dominating set of G is a subset S of its vertices with the property that every vertex of G is either in S or has at least k neighbors in S. We present a new i...
Mathieu Couture, Michel Barbeau, Prosenjit Bose, E...
A method for structural clustering is proposed involving data on subset-to-entity linkages that can be calculated with structural data such as graphs or sequences or images. The m...
The class of weakly algebrizable logics is defined as the class of logics having monotonic and injective Leibniz operator. We show that "monotonicity" cannot be discarde...
Images of fuzzy relations provide powerful access to fuzzifications of properties of and/or relationships between fuzzy sets. As an important example, images of fuzzy orderings c...