Benjamin McClosky

Combinatorial algorithms for the maximum k-plex problem

The maximum clique problem provides a classic framework for detecting cohesive subgraphs. However, this approach can fail to detect much of the cohesive structure in a graph. To address this issue, Seidman and Foster introduced k-plexes as a degree-based clique relaxation. More recently, Balasundaram et al. formulated the maximum k-plex problem as an integer program and designed a branch-and-cut algorithm. This paper derives a new upper bound on the cardinality of k-plexes and adapts combinatorial clique algorithms to find maximum k-plexes.

Maximizing quantitative traits in the mating design problem via simulation-based Pareto estimation

k

Co-2-plex vertex partitions

-plexes are cohesive subgraphs which were introduced to relax the structure of cliques. A co-

Composition of stable set polyhedra

k

Optimizing Experimental Design in Genetics

-plex is the complement of a

Location-Dependent Empirical Thresholds for Quantitative Trait Mapping

k

Co-2-plex polynomials

-plex and is therefore similar to a stable set. This paper derives the co-2-plex analogue for certain properties of the stable set polytope. We also describe a class of 0-1 matrices

The impact of recombination on short-term selection gain in plant breeding experiments

A

Selfing for the design of genomic selection experiments in biparental plant populations

for which the polytope