Teaching

I am passionate about sharing the joy of algorithmic problem-solving with students of all levels. At the University of Sydney, I am incredibly grateful to have supervised 7 wonderful Honours students, 6 of whom have received the University Medal, and to have co-authored 2 papers (1 at ICALP 2022 and 1 at SODA 2023) with them. Since 2019, I have been the unit coordinator and lecturer for the third-year algorithms unit COMP3027 and its advanced version COMP3927. I have been awarded the Faculty Unit of Study Survey Commendations 4 times for exceptionally high student ratings.

Advising

PhD (UniMelb)

Principal Supervisor

  1. Gerald Huang
  2. Xiao Sun

Co-supervisor

  1. Tian Qiu
  2. Jiajia Song
  3. Zhuo Zhang
  4. Peaker Guo
  5. Phil Cervenjak

PhD (USyd)

  1. Sampson Wong (completed 2023, co-supervisor)

MPhil (USyd)

  1. Yun Li (completed 2024, co-supervisor)
  2. Lindsey Deryckere (completed 2023, principal supervisor)
    • The works in Lindsey’s thesis to appear in APPROX 2023 as Online Matching with Set and Concave Delays
  3. Sampson Wong (completed 2019, co-supervisor)

Honours (USyd)

  1. Ningyuan Xie (completed 2022)
    • First Class Honours with University Medal
    • Thesis: Non-Clairvoyant Multi-Level Aggregation Problem with Delay
  2. Thomas Schwarz (completed 2022)
    • First Class Honours with University Medal
    • Thesis: I got 99 problems but they’re actually 1 A reduction hierarchy for online problems with metric spaces and delay
  3. Alan Wu (completed 2022)
    • First Class Honours
    • Thesis: Online Multi-Level Aggregation Problem
  4. Ryder Chen (completed 2021)
    • First Class Honours with University Medal
    • Thesis: Online Cardinality Joint Replenishment with Delay
  5. Ngoc Mai Le (completed 2021)
    • First Class Honours with University Medal and Allan Bromley Prize for best Honours thesis mark in CS
    • Thesis: Non-clairvoyant problems with Deadlines or Delay
  6. Ive Zhang (completed 2021)
    • First Class Honours with University Medal
    • Thesis: The Online Constrained Forest Problem and Its Leasing Variant
  7. Jahanvi Khatkar (completed 2020)
    • First Class Honours with University Medal
    • Thesis: Online Joint Replacement with Deadline on Subadditive Cost

Notes:

The works in Ningyuan Xie’s and Ngoc Mai Le’s theses appeared in SODA 2023: The Power of Clairvoyance for Multi-Level Aggregation and Set Cover with Delay

The works in Ryder Chen’s and Jahanvi Khatkar’s theses appeared in ICALP 2022: Online Weighted Cardinality Joint Replenishment Problem with Delay

At the University of Sydney, the University Medal is awarded to Honours students with an outstanding research thesis and an exceptional level of achievement across the whole degree program.

Coursework Projects

Alan Wu (2021 S2), Ryder Chen (2020 S2), Cameron Eggins (2020 S2), Ive Zhang (2019 S2), Max Davy (2019 S1)

Interns

Tanishq Dubey (2021), Aryan Gupta (2020), Finn Waugh (Winter 2020), TJ Kojima (Summer 2020), Qiang Qu (Summer 2019)

Courses

From 2019 to 2022, I was the subject coordinator and lecturer for COMP3027 and COMP3927 at the University of Sydney.

  • 2022 S1: COMP3027 Algorithm Design, COMP3927 Algorithm Design (Advanced), and COMP9123 Data Structures and Algorithms (co-lecturer)
  • 2021 S1: COMP3027 Algorithm Design, COMP3927 Algorithm Design (Advanced)
  • 2020 S1: COMP3027 Algorithm Design, COMP3927 Algorithm Design (Advanced)
  • 2019 S1: COMP3027 Algorithm Design, COMP3927 Algorithm Design (Advanced)

Awards

  • 2021 Faculty Unit of Study Survery Commendation for COMP3927 Algorithm Design (Advanced)
  • 2021 Faculty Unit of Study Survery Commendation for COMP3027 Algorithm Design
  • 2020 Faculty Unit of Study Survery Commendation for COMP3927 Algorithm Design (Advanced)
  • 2020 Faculty Unit of Study Survery Commendation for COMP3027 Algorithm Design