Hsiang-Hsuan Liu

Orcid: 0000-0002-0194-9360

Affiliations:
  • Utrecht University, Utrecht, The Netherlands


According to our database1, Hsiang-Hsuan Liu authored at least 28 papers between 2013 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Scheduling with Locality by Routing.
Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

2023
Instance complexity of Boolean functions.
CoRR, 2023

The Power of Amortization on Scheduling with Explorable Uncertainty.
Proceedings of the Approximation and Online Algorithms - 21st International Workshop, 2023

2022
The Power of Amortized Recourse for Online Graph Problems.
Proceedings of the Approximation and Online Algorithms - 20th International Workshop, 2022

2021
A note on the geodetic number and the Steiner number of AT-free graphs.
Theor. Comput. Sci., 2021

Greedy is Optimal for Online Restricted Assignment and Smart Grid Scheduling for Unit Size Jobs.
Theory Comput. Syst., 2021

Traveling Repairperson, Unrelated Machines, and Other Stories About Average Completion Times.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020
Non-preemptive Scheduling in a Smart Grid Model and Its Implications on Machine Minimization.
Algorithmica, 2020

2019
Complexity and online algorithms for minimum skyline coloring of intervals.
Theor. Comput. Sci., 2019

An Improved Online Algorithm for the Traveling Repairperson Problem on a Line.
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

2018
A Primal-Dual Online Deterministic Algorithm for Matching with Delays.
Proceedings of the Approximation and Online Algorithms - 16th International Workshop, 2018

2017
On the Grundy number of Cameron graphs.
Electron. Notes Discret. Math., 2017

2016
Scheduling for electricity cost in a smart grid.
J. Sched., 2016

On complexities of minus domination.
Discret. Optim., 2016

P_3-Games on Chordal Bipartite Graphs.
CoRR, 2016

P_3-Games.
CoRR, 2016

Optimal Nonpreemptive Scheduling in a Smart Grid Model.
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

Convex Independence in Permutation Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2016

On the <i>P</i><sub>3</sub>-convexity of some classes of graphs with few <i>P</i><sub>4</sub>s and permutation graphs.
Proceedings of the Australasian Computer Science Week Multiconference, 2016

2015
Edge-clique covers of the tensor product.
Theor. Comput. Sci., 2015

On maximum independent set of categorical product and ultimate categorical ratios of graphs.
Theor. Comput. Sci., 2015

Convexities in Some Special Graph Classes - New Results in AT-free Graphs and Beyond.
CoRR, 2015

Flood-it on AT-Free Graphs.
CoRR, 2015

Rainbow Domination and Related Problems on Some Classes of Perfect Graphs.
Proceedings of the Topics in Theoretical Computer Science, 2015

2014
Results on Independent Sets in Categorical Products of Graphs, the Ultimate Categorical Independence Ratio and the Ultimate Categorical Independent Domination Ratio.
Proceedings of the Algorithms and Computation - 8th International Workshop, 2014

2013
Independent set in categorical products of cographs and splitgraphs
CoRR, 2013

Results on independent sets in categorical products of graphs, the ultimate categorical independence ratio and the ultimate categorical independent domination ratio.
CoRR, 2013

On Independence Domination.
Proceedings of the Fundamentals of Computation Theory - 19th International Symposium, 2013


  Loading...