Dr. H.H. (Alison) Liu

Buys Ballotgebouw
Princetonplein 5
Kamer 4.04
3584 CC Utrecht

Dr. H.H. (Alison) Liu

Assistant Professor
Algorithms and Complexity
h.h.liu@uu.nl
  • PhD projects
    • 2023-now Bob Krekelberg
      • On the FirstFit Algorithm for Online Unit-Interval Coloring, *Bob Krekelberg and Alison Hsiang-Hsuan Liu, arXiv
      • On the First-Fit Algorithm for Online Unit-Interval Coloring, *Bob Krekelberg and Hsiang-Hsuan Liu, The 16thWorkshop on Models and Algorithms for Planning and Scheduling (MAPSP), 2024
    • 2021-2022 Jonathan Toole-Charignon
      • The Power of Amortized Recourse on Online Graph Problems, Alison Hsiang-Hsuan Liu and *Jonathan Toole-Charignon, The 19th International Workshop Approximation and Online Algorithms (WAOA) 2022: 134-153
      • The Power of Amortized Recourse on Online Graph Problems, Hsiang-Hsuan Liu and *Jonathan Toole-Charignon, The 15th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP), 2022
  • Master projects
    • 2025 Royce Kraakman (Co-supervise with Bob Krekelberg)
    • 2024 Martino Fabiani (Co-supervise with Shihan Wang)
    • 2025 Anna Hu, Full Neighbourhood Knowledge Helps Online Vertex Cover More Than Online Dominating Set
    • 2025 Max Hugen (Co-supervise with Bob Krekelberg), Online Firefighting on Cactus Graphs
    • 2024 Guang-He Wang (National Yang Ming Chiao Tung University, Co-supervise with Professor Po-An Chen), Online Firefighting on Trees with Predictions
      • CAP: Consistencising the Analysis with Predictions in Online Algorithms, Po-An Chen, Alison Hsiang-Hsuan Liu, *Rick van de Bovenkamp, and Guang-He Wang, Theory and Applications of Algorithms with Predictions (TAAP), 2025
      • Best Master's Thesis Award 2024 Honorable Award, Association for Algorithms and Computation Theory (AACT)
    • 2024 Rick van de Bovenkamp, Online busy time scheduling
      • CAP: Consistencising the Analysis with Predictions in Online Algorithms, Po-An Chen, Alison Hsiang-Hsuan Liu, *Rick van de Bovenkamp, and Guang-He Wang Theory and Applications of Algorithms with Predictions (TAAP), 2025
      • Online Busy Time Scheduling with Untrusted Prediction, *Rick van de Bovenkamp and Alison Hsiang-Hsuan Liu, The 50th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM) (2) 2025: 324-336
    • 2023 Zhadyra Khattar, Online Timely Bin Packing
    • 2023 Maarten van den Berg (Project with Channable), Scheduling data feed processing job
    • 2023 Xiao-Ou Zhang, Scheduling with explorable uncertainty for minimising the total weighted completion time
      • The Power of Amortization on Scheduling with Explorable Uncertainty, Alison Hsiang-Hsuan Liu, Fu-Hong Liu, Prudence W.H. Wong, and *Xiao-Ou Zhang, The 20th International Workshop Approximation and Online Algorithms (WAOA) 2023: 90-103
      • Scheduling with Explorable Uncertainty Revisited, Alison Hsiang-Hsuan Liu, Fu-Hong Liu, and *Xiao-Ou Zhang, Workshop on Recent Trends in Online Algorithms 2023
    • 2022 Jiefei Xue, Online weighted throughput maximization scheduling with a busy-time budget
    • 2022 Mark Heinsbroek, Online One-Way Trading with Machine Learned Advice
    • 2022 Stephen Deyu Sun (National Tsing Hua University, Co-supervise with Professor Wing-Kai Hon), Scheduling with Precedence Constraints for Electricity Cost in Smart Grid 
    • 2022 Luc Hoofs, On the Power of Greedy Approaches: Online Car Sharing with two servers on Two Locations, with varying booking times and paired requests
    • 2021 Wouter Bink, Practical exponential-time Set Cover approximation
    • 2021 Jonathan Toole-Charignon, Online algorithms and uncertainty through the lens of Independent Set