2 citations · 3 across the 3 of their papers we have counts for
5 papers
Mesosome Avoidance
Robert Cummings, Jeffrey Shallit, Paul Staadecker
We consider avoiding mesosomes -- that is, words of the form with a conjugate of that is different from -- over a binary alphabet. We give a structure theorem fo…
A -Approximation Algorithm for the Minimum -Edge Connected Multisubgraph Problem in the Half-Integral Case
S. Boyd, J. Cheriyan, R. Cummings +4
Given a connected undirected graph on vertices, and non-negative edge costs , the 2ECM problem is that of finding a -edge~connected spanning multisubgraph of $\…
An Improved Approximation Algorithm for the Matching Augmentation Problem
J. Cheriyan, R. Cummings, J. Dippel +1
We present a -approximation algorithm for the matching augmentation problem (MAP): given a multi-graph with edges of cost either zero or one such that the edges of cost ze…
A Fast Minimum Degree Algorithm and Matching Lower Bound
Robert Cummings, Matthew Fahrbach, Animesh Fatehpuria
The minimum degree algorithm is one of the most widely-used heuristics for reducing the cost of solving large sparse systems of linear equations. It has been studied for nearly hal…
Rollercoasters and Caterpillars
Therese Biedl, Ahmad Biniaz, Robert Cummings +4
A rollercoaster is a sequence of real numbers for which every maximal contiguous subsequence, that is increasing or decreasing, has length at least three. By translating this seque…