501 citations · 581 across the 27 of their papers we have counts for
10 papers · 1 filter
Cycle-Structure Generating Functions for Special Breakpoint Graphs
Max A. Alekseyev, Joseph T. Iosue, Adam Ehrenberg +1
Breakpoint graphs originate in comparative genomics, where their alternating cycles encode relationships between genomes. We study a constrained class of three-colored breakpoint g…
Enumeration of Payphone Permutations
Max A. Alekseyev
The desire for privacy significantly impacts various aspects of social behavior as illustrated by people's tendency to seek out the most secluded spot when multiple options are ava…
Maximizing the number of integer pairs summing to powers of 2 via graph labeling and solving restricted systems of linear (in)equations
Max A. Alekseyev
We address the problem of finding sets of integers of a given size with a maximum number of pairs summing to powers of . By fixing particular pairs, this problem reduces to find…
Making Walks Count: From Silent Circles to Hamiltonian Cycles
Max A. Alekseyev, Gerard P. Michon
We illustrate the application of the matrix-transfer method for a number of enumeration problems concerning the party game Silent Circles, Hamiltonian cycles in the antiprism graph…
On Enumeration of Dyck--Schröder Paths
Max A. Alekseyev
We address the problem of enumerating paths in square lattices, where allowed steps include (1,0) and (0,1) everywhere, and (1,1) above the diagonal y=x. We consider two such latti…
Weighted de Bruijn Graphs for the Menage Problem and Its Generalizations
Max A. Alekseyev
We address the problem of enumeration of seating arrangements of married couples around a circular table such that no spouses sit next to each other and no k consecutive persons ar…