C. Gregory Plaxton

21 papers A* 1A 1B 7Journal 10Unranked 1
YearRankTypeTitle / Venue / Authors
2025 B conf
Constant-Approximate and Constant-Strategyproof Two-Facility Location.
SAGT
Elijah Journey Fullerton, Zeyuan Hu, C. Gregory Plaxton
2025 J jnl
Constant-Approximate and Constant-Strategyproof Two-Facility Location.
CoRR
Elijah Journey Fullerton, Zeyuan Hu, C. Gregory Plaxton
2023 J jnl
The obnoxious facility location game with dichotomous preferences.
Theor. Comput. Sci.
Fu Li, C. Gregory Plaxton, Vaibhav B. Sinha
2022 J jnl
Maximum Stable Matching with One-Sided Ties of Bounded Length.
Theory Comput. Syst.
Chi-Kit Lam, C. Gregory Plaxton
2022 J jnl
On the Existence of Three-Dimensional Stable Matchings with Cyclic Preferences.
Theory Comput. Syst.
Chi-Kit Lam, C. Gregory Plaxton
2021 J jnl
Egalitarian Resource Sharing Over Multiple Rounds.
CoRR
Fu Li, C. Gregory Plaxton, Vaibhav B. Sinha
2021 A conf
Object Allocation Over a Network of Objects: Mobile Agents with Strict Preferences.
AAMAS
Fu Li, C. Gregory Plaxton, Vaibhav B. Sinha
2021 J jnl
Object Allocation Over a Network of Objects: Mobile Agents with Strict Preferences.
CoRR
Fu Li, C. Gregory Plaxton, Vaibhav B. Sinha
2021 — conf
The Obnoxious Facility Location Game with Dichotomous Preferences.
ICTCS
Fu Li, C. Gregory Plaxton, Vaibhav B. Sinha
2021 J jnl
The Obnoxious Facility Location Game with Dichotomous Preferences.
CoRR
Fu Li, C. Gregory Plaxton, Vaibhav B. Sinha
2019 A* conf
A (1 + 1/e)-Approximation Algorithm for Maximum Stable Matching with One-Sided Ties and Incomplete Lists.
SODA
Chi-Kit Lam, C. Gregory Plaxton
2019 B conf
Maximum Stable Matching with One-Sided Ties of Bounded Length.
SAGT
Chi-Kit Lam, C. Gregory Plaxton
2019 B conf
On the Existence of Three-Dimensional Stable Matchings with Cyclic Preferences.
SAGT
Chi-Kit Lam, C. Gregory Plaxton
2019 J jnl
On the Existence of Three-Dimensional Stable Matchings with Cyclic Preferences.
CoRR
Chi-Kit Lam, C. Gregory Plaxton
2017 B conf
Group Strategyproof Pareto-Stable Marriage with Indifferences via the Generalized Assignment Game.
SAGT
Nevzat Onur Domaniç, Chi-Kit Lam, C. Gregory Plaxton
2017 J jnl
Group Strategyproof Pareto-Stable Marriage with Indifferences via the Generalized Assignment Game.
CoRR
Nevzat Onur Domaniç, Chi-Kit Lam, C. Gregory Plaxton
2017 J jnl
Strategyproof Pareto-Stable Mechanisms for Two-Sided Matching with Indifferences.
CoRR
Nevzat Onur Domaniç, Chi-Kit Lam, C. Gregory Plaxton
2016 B conf
Bipartite Matching with Linear Edge Weights.
ISAAC
Nevzat Onur Domaniç, Chi-Kit Lam, C. Gregory Plaxton
2014 B conf
Scheduling Unit Jobs with a Common Deadline to Minimize the Sum of Weighted Completion Times and Rejection Penalties.
ISAAC
Nevzat Onur Domaniç, C. Gregory Plaxton
2013 B conf
Vertex-Weighted Matching in Two-Directional Orthogonal Ray Graphs.
ISAAC
C. Gregory Plaxton
1989 — —
Efficient computation on sparse interconnection networks.
C. Gregory Plaxton