1 citations · 2 across the 4 of their papers we have counts for
4 papers
On Clusters that are Separated but Large
Sariel Har-Peled, Joseph Rogge
Given a set of points in , consider the problem of computing subsets of that form clusters that are well-separated from each…
Classifying Permutations under Context-Directed Swaps and the \textbf{cds} game
G. Brown, A. Mitchell, R. Raghavan +2
A special sorting operation called Context Directed Swap, and denoted \textbf{cds}, performs certain types of block interchanges on permutations. When a permutation is sortable by…
Convex geometries representable by at most 5 circles on the plane
PolyMath REU Convex Geometries Collaboration, Kira Adaricheva, Madina Bolat +18
A convex geometry is a closure system satisfying the anti-exchange property. In this work we document all convex geometries on 4- and 5-element base sets with respect to their repr…
Pairs of disjoint matchings and related classes of graphs
Huizheng, Guo, Kieran Kaempen +6
For a finite graph , we study the maximum -edge colorable subgraph problem and a related ratio , where is the matching number of , and is…