N. O. Domanic, C.-K. Lam, and C. G. Plaxton. Strategyproof Pareto-stable mechanisms for two-sided matching with indifferences. In Fourth Workshop on Matching Under Preferences, Cambridge, Massachusetts, 12 pages, April 2017.
C. G. Plaxton, Y. Sun, M. Tiwari, and H. Vin. Online compression caching. In Proceedings of the 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, pages 414-425, July 2008.
N. B. Dimitrov and C. G. Plaxton. Buyer-supplier games: Optimization over the core. In Proceedings of the 5th Workshop on Approximation and Online Algorithms, Eilat, Israel, pages 27-40, October 2007.
X. Li and C. G. Plaxton. On name resolution in peer-to-peer networks. In Proceedings of the 2nd Workshop on Principles of Mobile Computing, Toulouse, France, pages 82-89, October 2002.
J. E. Gehrke, C. G. Plaxton, and R. Rajaraman. Rapid convergence of a local load balancing algorithm for asynchronous rings. In Proceedings of the 11th International Workshop on Distributed Algorithms, Saarbrucken, Germany, Lecture Notes in Computer Science, no. 1320, M. Mavronicolas and P. Tsigas (Eds.), pages 81-95, September 1997.
E. W. Mayr and C. G. Plaxton. On the spanning trees of weighted graphs. In Proceedings of the 14th International Workshop on Graph-Theoretic Concepts in Computer Science, Amsterdam, Netherlands, Lecture Notes in Computer Science, no. 344, J. van Leeuwen (Ed.), pages 394-405, June 1988.