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 …

The k-plex model relaxes the clique model by allowing each vertex to miss up to k
neighbors, including the vertex itself. A 1-plex is a clique. Many exact algorithms have been …

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 study kernelization of classic hard graph problems when the input graphs fulfill triadic
closure properties. More precisely, we consider the recently introduced parameters closure …

Finding large cliques or cliques missing a few edges is a fundamental algorithmic task in the
study of real-world graphs, with applications in community detection, pattern recognition …

Abstract Fox et al.(2020) introduced a new parameter, called c-closure, for a parameterized
study of clique enumeration problems. A graph G is c-closed if every pair of vertices with at …

Abstract In the Dominating Set problem the input is a graph G and an integer k, the task is to
determine whether there exists a vertex set S of size at most k so that every vertex not in S …

For a positive integer c, a graph G is said to be c-closed if every pair of non-adjacent vertices
in G have at most c-1 neighbours in common. The closure of a graph G, denoted by cl (G), is …

Finding large" cliquish" subgraphs is a classic NP-hard graph problem. In this work, we
focus on finding maximum $ s $-clubs and $ s $-plexes, ie, graphs of diameter $ s $ and …

A graph G is c-closed if every two vertices with at least c common neighbors are adjacent to
each other. Introduced by Fox, Roughgarden, Seshadhri, Wei and Wein [ICALP 2018 …