David Pritchard

40 papers A 2B 5Journal 30Unranked 2

Year	Rank	Type	Title / Venue / Authors
2016	J	`jnl`	Generalized Hypergraph Matching via Iterated Packing and Local Ratio. CoRR Ojas Parekh, David Pritchard
2016	J	`jnl`	IMI Python: Upgraded CS Circles web-based Python course. Comput. Appl. Eng. Educ. Marija Djokic-Petrovic, David Pritchard, Milos R. Ivanovic, Vladimir M. Cvjetkovic
2015	J	`jnl`	Finding the closest ultrametric. Discret. Appl. Math. Marco Di Summa, David Pritchard, Laura Sanità
2015	J	`jnl`	Frequency Distribution of Error Messages. CoRR David Pritchard
2015	—	`conf`	Frequency distribution of error messages. PLATEAU@SPLASH David Pritchard
2014	J	`jnl`	Characterizing and recognizing generalized polymatroids. Math. Program. András Frank, Tamás Király, Júlia Pap, David Pritchard
2014	B	`conf`	Generalized Hypergraph Matching via Iterated Packing and Local Ratio. WAOA Ojas Parekh, David Pritchard
2014	J	`jnl`	Multicommodity Flow in Trees: Packing via Covering and Iterated Relaxation. Algorithmica Jochen Könemann, Ojas Parekh, David Pritchard
2013	J	`jnl`	Cover-Decomposition and Polychromatic Numbers. SIAM J. Discret. Math. Béla Bollobás, David Pritchard, Thomas Rothvoß, Alex D. Scott
2013	J	`jnl`	Hypergraphic LP Relaxations for Steiner Trees. SIAM J. Discret. Math. Deeparnab Chakrabarty, Jochen Könemann, David Pritchard
2013	J	`jnl`	On approximating string selection problems with outliers. Theor. Comput. Sci. Christina Boucher, Gad M. Landau, Avivit Levy, David Pritchard, Oren Weimann
2012	J	`jnl`	On Approximating String Selection Problems with Outliers CoRR Christina Boucher, Gad M. Landau, Avivit Levy, David Pritchard, Oren Weimann
2012	B	`conf`	On Approximating String Selection Problems with Outliers. CPM Christina Boucher, Gad M. Landau, Avivit Levy, David Pritchard, Oren Weimann
2011	J	`jnl`	A partition-based relaxation for Steiner trees. Math. Program. Jochen Könemann, David Pritchard, Kunlun Tan
2011	J	`jnl`	Approximability of Sparse Integer Programs. Algorithmica David Pritchard, Deeparnab Chakrabarty
2011	J	`jnl`	Counting large distances in convex polygons CoRR Filip Moric, David Pritchard
2011	J	`jnl`	Counting large distances in convex polygons: a computational approach. Electron. Notes Discret. Math. Filip Moric, David Pritchard
2011	A	`conf`	Cover-Decomposition and Polychromatic Numbers. ESA Béla Bollobás, David Pritchard, Thomas Rothvoß, Alex D. Scott
2011	J	`jnl`	Diameter bounds for planar graphs. Discret. Math. Radoslav Fulek, Filip Moric, David Pritchard
2011	J	`jnl`	Fast computation of small cuts via cycle space sampling. ACM Trans. Algorithms David Pritchard, Ramakrishna Thurimella
2010	J	`jnl`	An LP with Integrality Gap 1+epsilon for Multidimensional Knapsack CoRR David Pritchard
2010	J	`jnl`	Decisions and elections: explaining the unexpected author: Donald G. Saari publisher: cambridge university press, 2001 isbn 0-521-80816-2. SIGACT News David Pritchard
2010	J	`jnl`	Edge-Colouring Hypergraphs Properly (Covering with Matchings) or Polychromatically (Packing Covers) CoRR David Pritchard, Thomas Rothvoß
2010	B	`conf`	Hypergraphic LP Relaxations for Steiner Trees. IPCO Deeparnab Chakrabarty, Jochen Könemann, David Pritchard
2010	J	`jnl`	Integrality Gap of the Hypergraphic Relaxation of Steiner Trees: a short proof of a 1.55 upper bound CoRR Deeparnab Chakrabarty, Jochen Könemann, David Pritchard
2010	J	`jnl`	Integrality gap of the hypergraphic relaxation of Steiner trees: A short proof of a 1.55 upper bound. Oper. Res. Lett. Deeparnab Chakrabarty, Jochen Könemann, David Pritchard
2010	J	`jnl`	Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes) CoRR Prahladh Harsha, Moses Charikar, Matthew Andrews, Sanjeev Arora, Subhash Khot, Dana Moshkovitz, Lisa Zhang, Ashkan Aazami, Dev Desai, Igor Gorodezky, Geetha Jagannathan, Alexander S. Kulikov, Darakhshan J. Mir, Alantha Newman, Aleksandar Nikolov, David Pritchard, Gwen Spencer
2010	J	`jnl`	k-Edge-Connectivity: Approximation and LP Relaxation CoRR David Pritchard
2009	J	`jnl`	Approximability of Sparse Integer Programs CoRR David Pritchard
2009	A	`conf`	Approximability of Sparse Integer Programs. ESA David Pritchard
2009	J	`jnl`	Hypergraphic LP Relaxations for Steiner Trees CoRR Deeparnab Chakrabarty, Jochen Könemann, David Pritchard
2009	—	`—`	Linear Programming Tools and Approximation Algorithms for Combinatorial Optimization. David Pritchard
2008	—	`conf`	Fast Distributed Computation of Cuts Via Random Circulations. ICALP (1) David Pritchard
2008	B	`conf`	Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees. WAOA Jochen Könemann, Ojas Parekh, David Pritchard
2007	J	`jnl`	A Partition-Based Relaxation For Steiner Trees CoRR Jochen Könemann, David Pritchard, Kunlun Tan
2007	J	`jnl`	Efficient Divide-and-Conquer Simulations Of Symmetric FSAs CoRR David Pritchard
2007	J	`jnl`	How to Use Random Circulations to Find Small Cuts CoRR David Pritchard
2007	J	`jnl`	Nearest Neighbor Network Traversal CoRR David Pritchard
2006	J	`jnl`	An Optimal Distributed Edge-Biconnectivity Algorithm CoRR David Pritchard
2006	B	`conf`	Symmetric network computation. SPAA David Pritchard, Santosh S. Vempala