Professor of Computer Science Barbara Anthony presented an article titled “Serving Rides of Equal Importance for Time-Limited Dial-a-Ride” at the July 2021 International Conference on Mathematical Optimization Theory and Operations Research in Irkutsk-Baikal, Russia. The work, coauthored with Ananya Christman, Christine Chung, and David Yuen, shows that in certain situations such as paratransit services, no polynomial-time algorithm can be guaranteed to serve the optimal number of requests; however, the paper then provides approximation algorithms with reasonable guarantees for many practical settings. 

Professor of Computer Science Barbara Anthony was a faculty scholar at the National Science Foundation RESET (Re-Enter STEM through Emerging Technology) 2021 Conference March 4–6, 2021. The conference focused on supporting the re-entry of women in STEM, especially in emerging technology fields, such as cybersecurity, data science, mobile development, and cloud computing.

Miryam Galvez ’23 presented at the 124th annual meeting of the Texas Academy of Sciences, which was held virtually February 26–27, 2021. The poster in the Mathematics and Computer Science section, titled “Using Python to Question Sincerity in Doodle Polls,” is the result of collaborative work with Professor of Computer Science Barbara Anthony and Chris Ojonta ’23 and was made possible by Southwestern’s Research Assistant funds and Sam Taylor Fellowship funds. A video describing the poster can be found here.

Professor of Computer Science Barbara Anthony and Professor of Mathematics Alison Marr presented their paper “Directed Zagreb Indices” at the (virtual) 18th Cologne–Twente Workshop on Graphs and Combinatorial Optimization (CTW 2020). The presentation and slides are available here. Their paper will be published in the AIRO Springer Series CTW 2020 Proceedings in March. 

Associate Professor of Computer Science Barbara Anthony coauthored a paper with Christine Chung from Connecticut College that will appear in a June 2020 volume of Theoretical Computer Science. The article, “Equilibria in Doodle Polls under Three Tie-Breaking Rules,” considers price of anarchy and price of stability in approval voting scenarios such as Doodle polls.