J. Baste, M. R. Fellows, L. Jaffke, T. Masarík, M. de Oliveira Oliveira, G. Philip, and F. A. Rosamond. Diversity in combinatorial optimization. CoRR, abs/1903.07410, 2019.
A. Cevallos, F. Eisenbrand, and R. Zenklusen. An improved analysis of local search for max-sum diversification. Mathematics of Operations Research, 44(4):1494-1509, 2019.
A. Conte, R. Grossi, G. Punzi, and T. Uno. A compact dag for storing and searching maximal common subsequences. In ISAAC 2023, pages 21:1-21:15, 2023.
M. R. Fellows and F. Rosamond. The diverse x paradigm (open problems). In H. Fernau, P. Golovach, M.-F. Sagot, et al., editors, Algorithmic enumeration (Dagstuhl Seminar 18421), Vol.8, 2019.
M. R. Garey and D. S. Johnson. Computers and intractability: A guide to the theory of npcompleteness, 1979.