Traffic grooming for single-source multicast communication in WDM rings. - David Buchfuhrer; Timothy Carnes; Brian Tagiku; Laura Celis; Ran Libeskind-Hadas (ICC, 2005)

Progress on pricing with peering. - Euiwoong Lee; David Buchfuhrer; Lachlan L. H. Andrew; Ao Tang; Steven H. Low (CISS, 2008)

The Complexity of SPP Formula Minimization. - David Buchfuhrer (ISAAC, 2008)

Limits on the Social Welfare of Maximal-In-Range Auction Mechanisms. - David Buchfuhrer; Christopher Umans (Electron. Colloquium Comput. Complex., 2009)

Computation and incentives in combinatorial public projects. - David Buchfuhrer; Michael Schapira; Yaron Singer (EC, 2010)

Inapproximability for VCG-Based Combinatorial Auctions. - David Buchfuhrer; Shaddin Dughmi; Hu Fu 001; Robert Kleinberg; Elchanan Mossel; Christos H. Papadimitriou; Michael Schapira; Yaron Singer; Christopher Umans (SODA, 2010)

The complexity of Boolean formula minimization. - David Buchfuhrer; Christopher Umans (J. Comput. Syst. Sci., 2011)

Limits on Computationally Efficient VCG-Based Mechanisms for Combinatorial Auctions and Public Projects. - David Buchfuhrer (2011)