We consider the problem of conflict-free data aggregation in distributed wireless radio networks, that is known as a Convergecast Scheduling Problem. This problem is strongly NP-hard in general.â€¦ (More)

A graph G = (V, E) is representable if there exists a word W over the alphabet V such that letters x and y alternate in W if and only if (x, y) âˆˆ E for each x 6= y. If W is k-uniform (each letter ofâ€¦ (More)

The notion of a word-representable graph has been studied in a series of papers in the literature. A graph G = (V,E) is word-representable if there exists a word w over the alphabet V such thatâ€¦ (More)

A graph G = (V,E) is representable if there exists a word W over the alphabet V such that letters x and y alternate in W if and only if (x, y) âˆˆ E for each x 6= y. If W is k-uniform (each letter of Wâ€¦ (More)

The work considers the mathematical aspects of one of the most fundamental problems of data analysis: search (choice) among a collection of objects for a subset of similar ones. In particular, theâ€¦ (More)

The balanced clustering problem consists of partitioning a set of n objects into K equal-sized clusters as long as n is a multiple of K . A popular clustering criterion when the objects are points ofâ€¦ (More)