Greg Plaxton is a professor of Computer Science at the University of Texas at Austin. His research addresses the design and analysis of efficient algorithms for various basic computational problems, including problems related to matching, scheduling, sorting, and clustering.
Design and analysis of fast algorithms for basic computational problems.
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. December 2014. 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 .
C. G. Plaxton. December 2013. Vertex-weighted matching in two-directional orthogonal ray graphs. Proceedings of the 24th International Conference on Algorithms and Computation .
C. G. Plaxton. July 2013. A simple family of Top Trading Cycles mechanisms for housing markets with indifferences. roceedings of the 24th International Conference on Game Theory.
N. B. Dimitrov and C. G. Plaxton. 2013. Optimal cover time for a graph-based coupon collector process. Journal of Discrete Algorithms.
N. B. Dimitrov and C. G. Plaxton. 2012. Competitive weighted matching in transversal matroids. Algorithmica.