| CS circles: an in-browser python course for beginners D Pritchard, T Vasiga Proceeding of the 44th ACM technical symposium on Computer science education …, 2013 | 60 | 2013 |
| Frequency distribution of error messages D Pritchard Proceedings of the 6th Workshop on Evaluation and Usability of Programming …, 2015 | 51 | 2015 |
| Approximability of sparse integer programs D Pritchard, D Chakrabarty Algorithmica 61, 75-93, 2011 | 49 | 2011 |
| A partition-based relaxation for Steiner trees J Könemann, D Pritchard, K Tan Mathematical Programming 127 (2), 345-370, 2011 | 36 | 2011 |
| Fast computation of small cuts via cycle space sampling D Pritchard, R Thurimella ACM Transactions on Algorithms (TALG) 7 (4), 1-30, 2011 | 35 | 2011 |
| Hypergraphic LP relaxations for Steiner trees D Chakrabarty, J Könemann, D Pritchard International Conference on Integer Programming and Combinatorial …, 2010 | 29 | 2010 |
| Cover-decomposition and polychromatic numbers B Bollobás, D Pritchard, T Rothvoß, A Scott SIAM Journal on Discrete Mathematics 27 (1), 240-256, 2013 | 28 | 2013 |
| Generalized hypergraph matching via iterated packing and local ratio O Parekh, D Pritchard International Workshop on Approximation and Online Algorithms, 207-223, 2014 | 20 | 2014 |
| On approximating string selection problems with outliers C Boucher, GM Landau, A Levy, D Pritchard, O Weimann Theoretical Computer Science 498, 107-114, 2013 | 18 | 2013 |
| Integrality gap of the hypergraphic relaxation of Steiner trees: A short proof of a 1.55 upper bound D Chakrabarty, J Könemann, D Pritchard Operations Research Letters 38 (6), 567-570, 2010 | 18 | 2010 |
| k-Edge-Connectivity: Approximation and LP Relaxation D Pritchard International Workshop on Approximation and Online Algorithms, 225-236, 2010 | 13 | 2010 |
| Finding the closest ultrametric M Di Summa, D Pritchard, L Sanità Discrete Applied Mathematics 180, 70-80, 2015 | 11 | 2015 |
| Max-weight integral multicommodity flow in spiders and high-capacity trees J Könemann, O Parekh, D Pritchard International Workshop on Approximation and Online Algorithms, 1-14, 2008 | 10 | 2008 |
| Characterizing and recognizing generalized polymatroids A Frank, T Király, J Pap, D Pritchard Mathematical Programming 146, 245-273, 2014 | 9 | 2014 |
| An lp with integrality gap 1+ epsilon for multidimensional knapsack D Pritchard arXiv preprint arXiv:1005.3324, 2010 | 9 | 2010 |
| IMI Python: Upgraded CS circles web‐based python course M Djokic‐Petrovic, D Pritchard, M Ivanovic, V Cvjetkovic Computer Applications in Engineering Education 24 (3), 464-480, 2016 | 8 | 2016 |
| Hypergraphic LP relaxations for Steiner trees D Chakrabarty, J Könemann, D Pritchard SIAM Journal on Discrete Mathematics 27 (1), 507-533, 2013 | 8 | 2013 |
| Diameter bounds for planar graphs R Fulek, F Morić, D Pritchard Discrete mathematics 311 (5), 327-335, 2011 | 8 | 2011 |
| An optimal distributed bridge-finding algorithm D Pritchard Proceedings of the 25th Annual ACM SIGACT-SIGOPS Symposium on Principles of …, 2006 | 8 | 2006 |
| Robust network computation DDAG Pritchard Massachusetts Institute of Technology, 2005 | 8 | 2005 |
Jochen KoenemannUniversity of WaterlooVerified email at uwaterloo.ca