# Jay Sethuraman

According to our database

Collaborative distances:

^{1}, Jay Sethuraman authored at least 57 papers between 1997 and 2020.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2020

Dynamic Matching in School Choice: Efficient Seat Reassignment After Late Cancellations.

Manag. Sci., 2020

CoRR, 2020

Strategic facility location problems with linear single-dipped and single-peaked preferences.

Auton. Agents Multi Agent Syst., 2020

Proceedings of the EC '20: The 21st ACM Conference on Economics and Computation, 2020

2018

Oper. Res., 2018

2017

Groupstrategyproofness of the egalitarian mechanism for constrained rationing problems.

Math. Soc. Sci., 2017

Approximately Optimal Mechanisms for Strategyproof Facility Location: Minimizing <i>L<sub>p</sub></i> Norm of Costs.

Math. Oper. Res., 2017

Oper. Res., 2017

2016

Encyclopedia of Algorithms, 2016

Oper. Res. Lett., 2016

Proceedings of the Web and Internet Economics - 12th International Conference, 2016

2015

Oper. Res. Lett., 2015

Math. Oper. Res., 2015

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Strategyproof Mechanisms for One-Dimensional Hybrid and Obnoxious Facility Location Models.

Proceedings of the Incentive and Trust in E-Communities, 2015

2014

Strategyproof Mechanisms for One-Dimensional Hybrid and Obnoxious Facility Location.

CoRR, 2014

2013

Oper. Res., 2013

Approximately Optimal Mechanisms for Strategyproof Facility Location: Minimizing $L_p$ Norm of Costs

CoRR, 2013

CoRR, 2013

Approximation Algorithms for the Incremental Knapsack Problem via Disjunctive Programming.

CoRR, 2013

Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

2012

ACM Trans. Algorithms, 2012

SIGecom Exch., 2012

2011

Int. J. Game Theory, 2011

2010

Math. Soc. Sci., 2010

Proceedings of the Behavioral and Quantitative Game Theory, 2010

2009

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2009

2008

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Discret. Optim., 2008

2007

Math. Oper. Res., 2007

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

2006

Math. Oper. Res., 2006

J. Econ. Theory, 2006

J. Econ. Theory, 2006

2005

Efficient Algorithms for Separated Continuous Linear Programs: The Multicommodity Flow Problem with Holding Costs and Extensions.

Math. Oper. Res., 2005

Algorithmica, 2005

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

2004

Proceedings of the Handbook of Scheduling - Algorithms, Models, and Performance Analysis., 2004

SIAM J. Discret. Math., 2004

2003

Math. Oper. Res., 2003

From Fluid Relaxations to Practical Algorithms for High-Multiplicity Job-Shop Scheduling: The Holding Cost Objective.

Oper. Res., 2003

Acta Informatica, 2003

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

2002

From fluid relaxations to practical algorithms for job shop scheduling: the makespan objective.

Math. Program., 2002

Proceedings of the Eleventh International World Wide Web Conference, 2002

2001

IEEE Trans. Knowl. Data Eng., 2001

SIGMETRICS Perform. Evaluation Rev., 2001

Gale-Shapley Stable Marriage Problem Revisited: Strategic Issues and Applications.

Manag. Sci., 2001

J. Comput. Syst. Sci., 2001

Electron. Notes Discret. Math., 2001

2000

On a cutting plane heuristic for the stable roommates problem and its applications.

Eur. J. Oper. Res., 2000

1999

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Proceedings of the 1999 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, 1999

Optimizing Profits in the Broadcast Delivery of Multimedia Products.

Proceedings of the MIS '99, 1999

1998

Math. Oper. Res., 1998

1997

Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997