The Densest Subgraph Problem requires us to find, in a given graph, a subset of vertices
whose induced subgraph maximizes a measure of density. The problem has received a …

Rising concerns related to the effects of traffic congestion have led to the proposal of many
alternative solutions, including the idea of Urban Air Mobility (UAM), which uses electric …

This article studies discovery of Graph Functional Dependencies (GFDs), a class of
functional dependencies defined on graphs. We investigate the fixed-parameter tractability …

In this chapter, a survey of the literature related to the h-index (referred to as h-related
literature) between 2005 and 2016 is presented. In the first section, the basic definitions and …

Community detection is an important task in the analysis of biological, social or technical
networks. We survey different models of cohesive graphs, commonly referred to as clique …

We study the following two fixed-cardinality optimization problems (a maximization and a
minimization variant). For a fixed $\alpha $ between zero and one we are given a graph and …

A graph is c-closed if every pair of vertices with at least c common neighbors is adjacent.
The c-closure of a graph G is the smallest number c such that G is c-closed. Fox et al. SIAM …

We consider the problem of enumerating all connected induced subgraphs of order k in an
undirected graph G=(V, E). Our main results are two enumeration algorithms with a delay of …

A graph G is weakly γ-closed if every induced subgraph of G contains one vertex v such that
for each non-neighbor u of v it holds that| N (u)∩ N (v)|< γ. The weak closure γ (G) of a …

We investigate the computational complexity of the Densest k-Subgraph problem, where the
input is an undirected graph G=(V, E) and one wants to find a subgraph on exactly k vertices …