2020

  • Dec 7th, 2020: Co-author Seyed Esmaeili presented Probabilistic Fair Clustering at NeurIPS 2020.
  • October 29th, 2020: Talk on Quantifying Gerrymandering and Defining Your Right to Vote in Wellesley College's Celebrating QR Connections Series on Quantitative Reasoning and Voting.
  • October 21st, 2020: Invited talk, Online Matching under Three Layers of Uncertainty, in Johns Hopkins University Theory Seminar.
  • July 22nd and 23rd, 2020: Guest lectures on NP-hardness and AI bias/fairness in ML for the CompSciConnect summer camp at UMD.
  • July 20th, 2020: Presented The Relationship between Gerrymandering Classification and Voter Incentives (adapted from our EC 2020 paper) at the AI for Social Good Harvard CRCS Workshop.
  • July 16th, 2020: Co-author Shawn Zhao presented our work with Aravind Srinivasan, Meddling Metrics: the Effects of Measuring and Constraining Partisan Gerrymandering on Voter Incentives, at EC 2020.
  • July 16th, 2020: Presented A Pairwise Fair and Community-preserving Approach to k-Center Clustering at ICML 2020. This was joint work with Darshan Chakrabarti, John P. Dickerson, Samir Khuller, Aravind Srinivasan, and Leonidas Tsepenekas.
  • July, 2020: Started as an Assistant Professor at Wellesley College!
  • June 1st, 2020: Successfully defended PhD.

2019

  • November 16th, 2019: Invited tutorial talk at the annual Workshop on String Algorithms in Bioinformatics (StringBio 2019) and session chair.
  • Fall, 2019: Program committee for AAAI-20 main track and AI for Social Impact track (AISI).
  • July 30th, 2019: Journal paper on column-sparse packing problems accepted in ACM Transactions on Algorithms (TALG).
  • June 26th, 2019: Guest lecture for high schoolers in the Introduction to Computing 101 summer camp. Topic: intro to fairness, accountability, and transparency in machine learning (FATML).
  • June 25th, 2019: Guest lecture for middle schoolers in the Computer Science Connect (CompSciConnect) summer camp. Topic: map coloring and NP-completeness.
  • June 21st, 2019: Journal paper on online stochastic matching with timeouts accepted in Algorithmica.
  • May 22nd, 2019: Completed Future Faculty Fellowship Program at UMD.
  • May 14th, 2019: 2019 Graduate School Outstanding Graduate Assistant (GA) Award.
  • May 5th, 2019: Finalist for the 2019 UMD Graduate Student Distinguished Service Award.
  • Spring, 2019: Taught CMSC 122 Introduction to Computer Programming via the Web, a 3-credit course for 80 students.

2018

  • November 21st, 2018: Passed Ph.D. preliminary exam and advanced to candidacy.
  • October 25-27th, 2018: Invited tutorial talk on Bloom filters and minhashing at the first annual Workshop on String Algorithms in Bioinformatics (StringBio 2018).
  • July 2-4th, 2018: Presented two papers at 29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018), one on the maximum duo preservation string mapping problem and the other on succinct method of the four Russians for edit distance.
  • January 7-10th, 2018: Paper on column-sparse packing integer programs presented at ACM-SIAM Symposium on Discrete Algorithms (SODA 2018) by co-author Karthik Sankararaman.