C. Gregory Plaxton

According to our database1, C. Gregory Plaxton authored at least 8 papers between 2013 and 2019.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
A (1 + 1/e)-Approximation Algorithm for Maximum Stable Matching with One-Sided Ties and Incomplete Lists.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Maximum Stable Matching with One-Sided Ties of Bounded Length.
Proceedings of the Algorithmic Game Theory - 12th International Symposium, 2019

On the Existence of Three-Dimensional Stable Matchings with Cyclic Preferences.
Proceedings of the Algorithmic Game Theory - 12th International Symposium, 2019

2017
Strategyproof Pareto-Stable Mechanisms for Two-Sided Matching with Indifferences.
CoRR, 2017

Group Strategyproof Pareto-Stable Marriage with Indifferences via the Generalized Assignment Game.
Proceedings of the Algorithmic Game Theory - 10th International Symposium, 2017

2016
Bipartite Matching with Linear Edge Weights.
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

2014
Scheduling Unit Jobs with a Common Deadline to Minimize the Sum of Weighted Completion Times and Rejection Penalties.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

2013
Vertex-Weighted Matching in Two-Directional Orthogonal Ray Graphs.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013


  Loading...