Faculty profile 2
Plaxton's research is concerned with the design and analysis of fast algorithms for basic computational problems. His past work includes contributions related to caching, clustering, scheduling, and sorting. He is currently studying variants of the matching problem motivated by applications to scheduling and to combinatorial auctions.
O. N. Domanic and C. G. Plaxton. Scheduling unit jobs with a common deadline to minimize the sum of weighted completion times and rejection penalties. Proceedings of the 25th International Conference on Algorithms and Computation, Jeonju, Korea, pages 646-657, December 2014.
C. G. Plaxton. Vertex-weighted matching in two-directional orthogonal ray graphs. Proceedings of the 24th International Conference on Algorithms and Computation, Hong Kong, pages 524-534, December 2013.
C. G. Plaxton. A simple family of Top Trading Cycles mechanisms for housing markets with indifferences. Proceedings of the 24th International Conference on Game Theory, Stony Brook, NY, July 2013.
N. B. Dimitrov and C. G. Plaxton. Optimal cover time for a graph-based coupon collector process. Journal of Discrete Algorithms, 19:39-51, 2013.
N. B. Dimitrov and C. G. Plaxton. Competitive weighted matching in transversal matroids. Algorithmica, 62:333-348, 2012.