In this survey we overview the definitions and methods for graph clustering, that is, finding
sets of “related” vertices in graphs. We review the many definitions for what is a cluster in a …

The emerging technology of wireless sensor network (WSN) is expected to provide a broad
range of applications, such as battlefield surveillance, environmental monitoring, smart …

Code clone detection is an important problem for software maintenance and evolution. Many
approaches consider either structure or identifiers, but none of the existing detection …

Finding, counting and/or listing triangles (three vertices with three edges) in massive graphs
are natural fundamental problems, which have recently received much attention because of …

This paper introduces LEMON, a generic open source C++ library providing easy-to-use and
efficient implementations of graph and network algorithms and related data structures. The …

This paper introduces a new paradigm for Mutation Testing, which we call Higher Order
Mutation Testing (HOM Testing). Traditional Mutation Testing considers only first order …

Artificial immune systems (AIS) constitute a relatively new area of bio-inspired computing.
Biological models of the natural immune system, in particular the theories of clonal selection …

The Vietoris-Rips complex characterizes the topology of a point set. This complex is popular
in topological data analysis as its construction extends easily to higher dimensions. We …

We present a novel method of decomposition of an n× m binary matrix I into a Boolean
product A○ B of an n× k binary matrix A and ak× m binary matrix B with k as small as …

For more and more applications, it is important to be able to compute the treewidth of a given
graph and to find tree decompositions of small width reasonably fast. This paper gives an …