#### Filter Results:

- Full text PDF available (8)

#### Publication Year

2010

2014

- This year (0)
- Last 5 years (7)
- Last 10 years (9)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Qingxuan Yang, John A. Ellis, Khalegh Mamakani, Frank Ruskey
- Inf. Process. Lett.
- 2013

Every permutation of {1, 2, . . . , N} can be written as the product of two involutions. As a consequence, any permutation of the elements of an array can be performed in-place using simultaneous swaps in two rounds of swaps. In the case where the permutation is the k-way perfect shuffle we develop two methods for efficiently computing the pair of… (More)

- Khalegh Mamakani, Wendy J. Myrvold, Frank Ruskey
- IWOCA
- 2011

An n-Venn diagram consists of n curves that divide the plane into 2 connected regions, one region for each possible intersection of the interiors of the curves. We show there are exactly 406 6-Venn diagrams that (a) have 6 curves, (b) are simple (at most two curves intersect at any point), (c) can be drawn with all curves convex, and (d) are invariant under… (More)

- Tao Cao, Khalegh Mamakani, Frank Ruskey
- FUN
- 2010

An n-Venn diagram consists of n curves drawn in the plane in such a way that each of the 2 possible intersections of the interiors and exteriors of the curves forms a connected non-empty region. A k-region in a diagram is a region that is in the interior of precisely k curves. A n-Venn diagram is symmetric if it has a point of rotation about which rotations… (More)

- Khalegh Mamakani, Wendy J. Myrvold, Frank Ruskey
- J. Discrete Algorithms
- 2012

In this paper we are concerned with producing exhaustive lists of simple monotone Venn diagrams that have some symmetry (non-trivial isometry) when drawn on the sphere. A diagram is simple if at most two curves intersect at any point, and it is monotone if it has some embedding on the plane in which all curves are convex. We show that there are 23 such… (More)

- Khalegh Mamakani, Frank Ruskey
- Graph Drawing
- 2012

- Khalegh Mamakani, Frank Ruskey
- Discrete & Computational Geometry
- 2014

A symmetric n-Venn diagram is one that is invariant under n-fold rotation, up to a relabeling of curves. A simple n-Venn diagram is an n-Venn diagram in which at most two curves intersect at any point. In this paper, we introduce a new property of Venn diagrams called crosscut symmetry, which is related to dihedral symmetry. Utilizing a computer search… (More)

- Qingxuan Yang, John A. Ellis, Khalegh Mamakani, Frank Ruskey
- ArXiv
- 2012

Every permutation of {1, 2, . . . , N} can be written as the product of two involutions. As a consequence, any permutation of the elements of an array can be performed in-place using simultaneous swaps in two rounds of swaps. In the case where the permutation is the k-way perfect shuffle we develop two methods for efficiently computing the pair of… (More)

For each n ≥ 4 we show how to construct simple Venn diagrams of n curves embedded on the sphere with the following sets of isometries: (a) a 4-fold rotational symmetry about the polar axis, together with an additional involutional symmetry about an axis through the equator, and (b) an involutional symmetry about the polar axis together with two reflectional… (More)

- Khalegh Mamakani, Frank Ruskey
- ArXiv
- 2012

A symmetric Venn diagram is one that is invariant under rotation, up to a relabeling of curves. A simple Venn diagram is one in which at most two curves intersect at any point. In this paper we introduce a new property of Venn diagrams called crosscut symmetry, which is related to dihedral symmetry. Utilizing a computer search restricted to crosscut… (More)

- ‹
- 1
- ›