A recent paper posed the question:" Graph Matching: What are we really talking about?". Far
from providing a definite answer to that question, in this paper we will try to characterize the …

This handbook provides an up-to-date compendium of fundamental computer science
topics, techniques, and applications. Along with updating and revising many of the existing …

The notion of graph which is most useful in computer science is that of a directed graph or
just a graph. A graph is a combinatorial structure consisting of a finite nonempty set of …

In MOOCs, a single programming exercise may produce thousands of solutions from
learners. Understanding solution variation is important for providing appropriate feedback to …

Many new database application domains such as experimental sciences and medicine are
characterized by large sequences as their main form of data. Using approximate …

Detecting changes by comparing data snapshots is an important requirement for difference
queries, active databases, and version and configuration management. In this paper we …

It is well-known that the problem of matching two relational structures can be posed as an
equivalent problem of finding a maximal clique in a (derived)" association graph." However …

Issues of matching and searching on elementary discrete structures arise pervasively in
computer science and many of its applications, and their relevance is expected to grow as …

The Web provides a corpus of design examples unparalleled in human history. However,
leveraging existing designs to produce new pages is often difficult. This paper introduces the …

Massive open online courses (MOOCs), one of the latest internet revolutions have
engendered hope that constant iterative improvement and economies of scale may cure …