We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure ...
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...
Nowadays the Internet users are from different ages and groups. Disabled people are a group of the Internet users. Some websites are especially created for these people. One group...
The problem of total participation in asynchronous meetings convened with distributed group support systems has been noted frequently but investigated rarely. This paper describes...