Cluster Editing is transforming a graph by at most k edge insertions or deletions into a disjoint union of cliques. This problem is fixed-parameter tractable (FPT). Here we comput...
The Ranking web of World Repositories (http://repositories.webometrics.info) is introduced. The objective is to promote Open Access Initiatives supporting the use of repositories ...
A large number of network applications today allow several users to interact together using the many-to-many service mode. In many-to-many communication, also referred to as group ...
Learning management systems are routinely used for presenting, solving and grading exercises with large classes. However, teachers are constrained to use questions with pre-defined...
— We consider how to support a large number of users over a wide-area network whose interests are characterized by range top-k continuous queries. Given an object update, we need...