Knowledge graphs (KGs) such as DBpedia, Freebase, YAGO, Wikidata, and NELL were
constructed to store large-scale, real-world facts as (subject, predicate, object) triples-that …

Subgraph queries have been routinely used to search graphs eg, social networks and
knowledge bases. With little knowledge of underlying data, users often need to rewrite …

This paper studies the problem of\em answering Why-questions for graph pattern queries.
Given a query Q, its answers Q(G) in a graph G, and an exemplar \E that describes desired …

Recent years witnessed the emergence of various applications on knowledge graphs, which
are often represented as RDF graphs. However, due to the lack of data schema and the …

This thesis improves the state of the art in exact, practical algorithms for finding subgraphs.
We study maximum clique, subgraph isomorphism, and maximum common subgraph …

During the last years, the study of fuzzy database query languages has attracted the
attention of many researchers. In this line of research, our group has proposed and …

The increasing interest in social networks, knowledge graphs, protein-interaction, and many
other types of networks has raised the question how users can explore such large and …

Pattern matching in big graphs is important for different modern applications. Recently, this
problem was defined in terms of multiple extensions of graph simulation, to reduce …

In recent years, we have witnessed an increasing use of graph pattern matching in a wide
variety of applications such as social networks analysis, knowledge discovery, software …

Subgraph queries are routinely used to search for entities in richly attributed graphs eg,
social networks and knowledge graphs. With little knowledge of underlying data, users often …