Dr. H.H. (Alison) Liu

Buys Ballotgebouw
Princetonplein 5
Kamer 4.04
3584 CC Utrecht

Dr. H.H. (Alison) Liu

Universitair docent
Algorithms and Complexity
h.h.liu@uu.nl

 

More on DBLP, Google Scholar

Journal Conference Talk

Graduate students at UU are marked with *.

 

Conference Papers


  1. Scheduling with Locality by Routing
    Alison Hsiang-Hsuan Liu and Fu-Hong Liu
    The 49th International Symposium on Mathematical Foundations of Computer Science (MFCS) 2024, to appear
  2. 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 
  3. 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
  4. Traveling Repairperson, Unrelated Machines, and Other Stories About Average Completion Times.
    Marcin Bienkowski, Artur Kraska, and Hsiang-Hsuan Liu 
    48th International Colloquium on Automata, Languages, and Programming (ICALP) 2021: 28:1-28:20
  5. Greedy is Optimal for Online Restricted Assignment and Smart Grid Scheduling for Unit Size Jobs
    Fu-Hong Liu, Hsiang-Hsuan Liu and Prudence W.H. Wong
    The 17th Workshop on Approximation and Online Algorithms (WAOA), 2019: 217-231
  6. Improved Online Algorithm for The Traveling Repairperson Problem on the Line
    Marcin Bienkowski and Hsiang-Hsuan Liu
    The 44th International Symposium on Mathematical Foundations of Computer Science (MFCS), 6:1–6:12, 2019
  7. A Primal-Dual Online Deterministic Algorithm for Matching with Delays
    Marcin Bienkowski, Artur Kraska, Hsiang-Hsuan Liu and Pawel Schmidt
    The 16th Workshop on Approximation and Online Algorithms (WAOA), 2018: 51-68
  8. Complexity and Online Algorithms for a Coloring Problem on a Line
    Thomas Erlebach, Fu-Hong Liu, Hsiang-Hsuan Liu, Mordechai Shalom, Prudence W.H. Wong, and Shmuel Zaks
    The 7th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2017: 317-332
  9. Convex Independence in Permutation Graphs
    Wing-Kai Hon, Ton Kloks, Fu-Hong Liu, and Hsiang-Hsuan Liu
    The 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016: 710-717
  10. Optimal Nonpreemptive Scheduling in a Smart Grid Model
    Fu-Hong Liu, Hsiang-Hsuan Liu, and Prudence W.H. Wong
    The 27th International Symposium on Algorithms and Computation (ISAAC), 2016
  11. On the P3-convexity of Some Classes of Graphs with Few P4s and Permutation Graphs
    Wing-Kai Hon, Ton Kloks, and Hsiang-Hsuan Liu
    The 39th Australasian Computer Science Conference (ACSC), 2016: Article 24
  12. Rainbow Domination and Related Problems on Some Classes of Perfect Graphs
    Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu, and Hung-Lung Wang
    Topics in Theoretical Computer Science (TTCS) 2015: 121-134
  13. Edge-Clique Covers of the Tensor Product
    Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu, and Yue-Li Wang
    International Conference on Algorithmic Aspects of Information and Management (AAIM), 2014: 66-74
  14. Results on Independent Sets in Categorical Products of Graphs, the Ultimate Categorical Independence Ratio and the Ultimate Categorical Independent Domination Ratio
    Wing-Kai Hon, Ton Kloks, Ching-Hao Liu, Hsiang-Hsuan Liu, Sheung-Hung Poon, and Yue-Li Wang
    The 8th International Workshop on Algorithms and Computation (WALCOM), 2014: 237-248
  15. On Complexities of Minus Domination
    Luerbio Faria, Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu, Tao-Ming Wang, and Yue-Li Wang The 7th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2013: 178-189
  16. Scheduling for Electricity Cost in Smart Grid
    Mihai Burcea, Wing-Kai Hon, Hsiang-Hsuan Liu, Prudence W.H. Wong, and David K.Y. Yau The 7th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2013: 306-317
  17. On Independence Domination
    Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu, Sheung-Hung Poon and Yue-Li Wang
    The 19th International Symposium on Fundamentals of Computation Theory (FCT), 2013: 183-194

 

Journal Papers


  1. Greedy is Optimal for Online Restricted Assignment and Smart Grid Scheduling for Unit Size Jobs. 
    Fu-Hong Liu , Hsiang-Hsuan Liu, and Prudence W. H. Wong
    Theory of Computing Systems (ToCS) 65(6): 1009-1032 (2021)
  2. A note on the geodetic number and the Steiner number of AT-free graphs. 
    Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu, Hung-Lung Wang, and Yue-Li Wang
    Theoretical Computer Science (TCS) 854: 131-135 (2021)
     
  3. Non-preemptive Scheduling in a Smart Grid Model and Its Implications on Machine Minimization. 
    Fu-Hong Liu , Hsiang-Hsuan Liu, and Prudence W. H. Wong
    Algorithmica 82(12): 3415-3457 (2020)
  4. Complexity and Online Algorithms for a Coloring Problem on a Line
    Thomas Erlebach, Fu-Hong Liu, Hsiang-Hsuan Liu, Mordechai Shalom, Prudence W.H. Wong, and Shmuel Zaks
    Theoretical Computer Science (TCS) 788: 66-78 (2019)
  5. On the Grundy number of Cameron graphs
    Wing-Kai Hon, Ton Kloks, Fu-Hong Liu, Hsiang-Hsuan Liu, and Tao-Ming Wang Electronic Notes in Discrete Mathematics 63: 503-516 (2017)
  6. On Complexities of Minus Domination
    Luerbio Faria, Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu, Tao-Ming Wang, and Yue-Li Wang Discrete Optimization 22:6–19 (2016)
  7. Scheduling for Electricity Cost in Smart Grid
    Mihai Burcea, Wing-Kai Hon, Hsiang-Hsuan Liu, Prudence W.H. Wong, and David K.Y. Yau Journal of Scheduling (JoS) 19(6):687–699 (2016)
  8. Edge-Clique Covers of the Tensor Product
    Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu, and Yue-Li Wang Theoretical Computer Science (TCS) 607:68-74 (2015)
  9. On Maximum Independent Set of Categorical Product and Ultimate Categorical Ratios of Graphs
    Wing-Kai Hon, Ton Kloks, Ching-Hao Liu, Hsiang-Hsuan Liu, Sheung-Hung Poon, and Yue-Li Wang
    Theoretical Computer Science (TCS) 588:81-95 (2015)

 

Workshop Papers


  1. Amortization Helps for Scheduling with Explorable Uncertainty, Even on Parallel Machines
    Alison Hsiang-Hsuan Liu, Fu-Hong Liu, Prudence W.H. Wong and *Xiao-Ou Zhang
    The 16th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP), 2024
  2. Scheduling with Locality by Routing
    Alison Hsiang-Hsuan Liu and Fu-Hong Liu
    The 16th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP), 2024
  3. On the First-Fit Algorithm for Online Unit-Interval Coloring
    *Bob Krekelberg and Alison Hsiang-Hsuan Liu
    The 16th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP), 2024
  4. Scheduling with Explorable Uncertainty Revisited
    Alison Hsiang-Hsuan Liu, Fu-Hong Liu, Prudence W.H. Wong, and *Xiao-Ou Zhang
    Workshop on Recent Trends in Online Algorithms (TrendsOA) 2023
  5. 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
  6. An Improved Online Algorithm for Traveling Repairperson Problem on the Line
    Marcin Bienkowski and Hsiang-Hsuan Liu
    The 14th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP), 2019
  7. Greedy is Optimal Online Algorithm for Smart Grid Scheduling of Unit Size Jobs
    Fu-Hong Liu, Hsiang-Hsuan Liu and Prudence W.H. Wong
    The 14th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP), 2019
  8. A Primal-Dual Online Deterministic Algorithm for Matching with Delays
    Marcin Bienkowski, Artur Kraska, Hsiang-Hsuan Liu and Pawel Schmidt
    Modern Online Algorithms (MOLI), 2018
  9. Complexity and Online Algorithms for a Coloring Problem on a Line
    Thomas Erlebach, Fu-Hong Liu, Hsiang-Hsuan Liu, Mordechai Shalom, Prudence W.H. Wong, and Shmuel Zaks
    The 13th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP), 2017
  10. Optimal Nonpreemptive Scheduling in Smart Grid
    Fu-Hong Liu, Hsiang-Hsuan Liu, and Prudence W.H. Wong
    The 9th Annual Meeting of Asian Association for Algorithms and Computation (AAAC), 2016
  11. Online Nonpreemptive Scheduling for Electricity Cost in Smart Grid
    Wing-Kai Hon, Hsiang-Hsuan Liu, and Prudence W.H. Wong
    The 12th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP), 2015

 

Conference/Workshop talks


  • Scheduling with Locality by Routing, MAPSP 2024
  • The Power of Amortization on Scheduling with Explorable Uncertainty, WAOA 2023
  • Scheduling with Explorable Uncertainty Revisited, TrendsOA 2023
  • The Power of Amortized Recourse on Online Graph Problems, WAOA 2022
  • Greedy is Optimal for Online Restricted Assignment and Smart Grid Scheduling for Unit Size Jobs, WAOA 2019 [slides]
  • Greedy is Optimal Online Algorithm for Smart Grid Scheduling of Unit Size Jobs, MAPSP 2019
  • A Primal-Dual Online Deterministic Algorithm for Matching with Delays, WAOA 2018
  • Complexity and Online Algorithms for a Coloring Problem on a Line, MAPSP 2017
  • Optimal Nonpreemptive Scheduling in Smart Grid, ISAAC 2016
  • Optimal Nonpreemptive Scheduling in Smart Grid, AAAC 2016
  • On the P3-Convexity of Some Classes of Graphs with Few P4s and Permutation Graphs, ACSC 2015
  • Online Nonpreemptive Scheduling for Electricity Cost in Smart Grid, MAPSP 2015
  • Edge-clique Covers of the Tensor Product, AAIM 2014
  • Scheduling for Electricity Cost in Smart Grid, BCTCS 2014
  • Scheduling for Electricity Cost in Smart Grid, COCOA 2013
  • On Complexities of Minus Domination, COCOA 2013
  • On Independence Domination, FCT 2013 [slides]

 

Invited Speech


  • ????????--?AI????????????? (Trade-offs and Accountability in AI-Assisted Decision Making Systems), NYCU School of Law, Taiwan, May 2024
  • Robustness of Online Algorithms with Machine-Learned Predictions, Theory and Applications Workshop, NYCU School of Law, Taiwan, November 2023
  • The Power of Amortized Recourse on Online Graph Problems, University of Liverpool, the UK, May 2023
  • Optimization Problems with Explorable Uncertainty, Whiteboard discussion at Networks group meeting, Department of Computer Science, University of Liverpool, the UK, May 2023
  • Introduction to Online Algorithms -- Making Decisions under Uncertainty, National Tsing Hua University, Taiwan, December 2022
  • Wait for Better Chances — Online with Delays, Theory Day, Academia Sinica, Taiwan, January 2020
  • Wait for Better Chances — Online with Delays, National Chiao Tung University, Taiwan, January 2020
  • Optimization under Uncertainty – Online Matching with Delays, National Tsing Hua University, Taiwan, August 2019