The degree-constrained minimum spanning tree (DCMST) is relevant in the design of networks. It consists of finding a spanning tree whose nodes do not exceed a given maximum degree...
We present new algebraic approaches for several wellknown combinatorial problems, including non-bipartite matching, matroid intersection, and some of their generalizations. Our wo...
Testing of VLSI circuits can cause generation of excessive heat which can damage the chips under test. In the random testing environment, high-performance CMOS circuits consume sig...
Artem Sokolov, Alodeep Sanyal, L. Darrell Whitley,...
We consider the problem of finding two-dimensional cutting patterns for glass sheets in order to produce rectangular elements requested by customers. The number of needed sheets, ...
A key problem in multi-agent systems research is identifying appropriate techniques to facilitate effective cooperation between agents. In this paper, we investigate the efficacy o...