We propose new practical algorithms to find maximum‐cardinality k‐plexes in graphs. A k‐plex denotes a vertex subset in a graph inducing a subgraph where every vertex has edges to all but at most k vertices in the k‐plex. Cliques are 1‐plexes. In analogy to the special case of finding maximum‐cardinality cliques, finding maximum‐cardinality k‐plexes is NP‐hard. Complementing previous work, we develop exact combinatorial algorithms, which are strongly based on methods from parameterized algorithmics. The experiments with our freely available implementation indicate the competitiveness of our approach, for many real‐world graphs outperforming the previously used methods.
