Follow
David A. G. Pritchard
David A. G. Pritchard
Google Los Angeles
Verified email at uwaterloo.ca - Homepage
Title
Cited by
Cited by
Year
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
572013
Frequency distribution of error messages
D Pritchard
Proceedings of the 6th Workshop on Evaluation and Usability of Programming …, 2015
492015
Approximability of sparse integer programs
D Pritchard, D Chakrabarty
Algorithmica 61, 75-93, 2011
472011
A partition-based relaxation for Steiner trees
J Könemann, D Pritchard, K Tan
Mathematical Programming 127 (2), 345-370, 2011
352011
Fast computation of small cuts via cycle space sampling
D Pritchard, R Thurimella
ACM Transactions on Algorithms (TALG) 7 (4), 1-30, 2011
332011
Hypergraphic LP relaxations for Steiner trees
D Chakrabarty, J Könemann, D Pritchard
International Conference on Integer Programming and Combinatorial …, 2010
272010
Cover-decomposition and polychromatic numbers
B Bollobás, D Pritchard, T Rothvoß, A Scott
SIAM Journal on Discrete Mathematics 27 (1), 240-256, 2013
262013
On approximating string selection problems with outliers
C Boucher, GM Landau, A Levy, D Pritchard, O Weimann
Theoretical Computer Science 498, 107-114, 2013
192013
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
182010
Generalized hypergraph matching via iterated packing and local ratio
O Parekh, D Pritchard
International Workshop on Approximation and Online Algorithms, 207-223, 2014
172014
k-Edge-Connectivity: Approximation and LP Relaxation
D Pritchard
Approximation and Online Algorithms: 8th International Workshop, WAOA 2010 …, 2011
112011
Finding the closest ultrametric
M Di Summa, D Pritchard, L Sanitŕ
Discrete Applied Mathematics 180, 70-80, 2015
102015
Characterizing and recognizing generalized polymatroids
A Frank, T Király, J Pap, D Pritchard
Mathematical Programming 146, 245-273, 2014
102014
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
92008
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
82016
Hypergraphic LP relaxations for Steiner trees
D Chakrabarty, J Könemann, D Pritchard
SIAM Journal on Discrete Mathematics 27 (1), 507-533, 2013
82013
An optimal distributed bridge-finding algorithm
D Pritchard
Proceedings of the 25th Annual ACM SIGACT-SIGOPS Symposium on Principles of …, 2006
82006
Diameter bounds for planar graphs
R Fulek, F Morić, D Pritchard
Discrete mathematics 311 (5), 327-335, 2011
72011
Linear programming tools and approximation algorithms for combinatorial optimization
D Pritchard
University of Waterloo, 2010
72010
Robust network computation
DDAG Pritchard
Massachusetts Institute of Technology, 2005
72005
The system can't perform the operation now. Try again later.
Articles 1–20