17 citations · 17 across the 5 of their papers we have counts for
7 papers
The minimal hitting set generation problem: algorithms and computation
Andrew Gainer-Dewar, Paola Vera-Licona
Finding inclusion-minimal "hitting sets" for a given collection of sets is a fundamental combinatorial problem with applications in domains as diverse as Boolean algebra, computati…
Geometric combinatorics and computational molecular biology: branching polytopes for RNA sequences
Elizabeth Drellich, Andrew Gainer-Dewar, Heather A. Harrington +3
Questions in computational molecular biology generate various discrete optimization problems, such as DNA sequence alignment and RNA secondary structure prediction. However, the op…
Pólya theory for species with an equivariant group action
Andrew Gainer-Dewar
Joyal's theory of combiantorial species provides a rich and elegant framework for enumerating combinatorial structures by translating structural information into algebraic function…
Enumeration of labeled and unlabeled k-gonal and polygonal 2-trees and succulents by vertices
Andrew Gainer-Dewar
We use the theory of Γ-species to enumerate k-gonal and polygonal 2-trees with respect to their vertices. We then extend this result to enumerate "succulents", a tree-like class of…
Counting unlabeled k-trees
Andrew Gainer-Dewar, Ira M. Gessel
We count unlabeled k-trees by properly coloring them in k+1 colors and then counting orbits of these colorings under the action of the symmetric group on the colors.
Enumeration of bipartite graphs and bipartite blocks
Andrew Gainer-Dewar, Ira M. Gessel
Using the theory of combinatorial species, we compute the cycle index for bipartite graphs, which we use to count unlabeled bipartite graphs and bipartite blocks.
Γ-species and the enumeration of k-trees
Andrew Gainer-Dewar
We study the class of graphs known as k-trees through the lens of Joyal's theory of combinatorial species (and an equivariant extension known as '-species' which incorporates da…