23 citations · 42 across the 17 of their papers we have counts for
18 papers
Generalized Hypergraph Matching via Iterated Packing and Local Ratio
Ojas Parekh, David Pritchard
In -hypergraph matching, we are given a collection of sets of size at most , each with an associated weight, and we seek a maximum-weight subcollection whose sets are pairwis…
Frequency Distribution of Error Messages
David Pritchard
Which programming error messages are the most common? We investigate this question, motivated by writing error explanations for novices. We consider large data sets in Python and J…
On Approximating String Selection Problems with Outliers
Christina Boucher, Gad M. Landau, Avivit Levy +2
Many problems in bioinformatics are about finding strings that approximately represent a collection of given strings. We look at more general problems where some input strings can…
Counting large distances in convex polygons
Filip Morić, David Pritchard
In a convex n-gon, let d[1] > d[2] > ... denote the set of all distances between pairs of vertices, and let m[i] be the number of pairs of vertices at distance d[i] from one anothe…
Cover-Decomposition and Polychromatic Numbers
Béla Bollobás, David Pritchard, Thomas Rothvoß +1
A colouring of a hypergraph's vertices is polychromatic if every hyperedge contains at least one vertex of each colour; the polychromatic number is the maximum number of colours in…
Diameter Bounds for Planar Graphs
Radoslav Fulek, Filip Morić, David Pritchard
The inverse degree of a graph is the sum of the reciprocals of the degrees of its vertices. We prove that in any connected planar graph, the diameter is at most 5/2 times the inver…