The following pages link to Hsiang-Hsuan Liu (Q897962):
Displaying 22 items.
- Edge-clique covers of the tensor product (Q897963) (← links)
- Scheduling for electricity cost in a smart grid (Q1702731) (← links)
- On complexities of minus domination (Q1751171) (← links)
- A primal-dual online deterministic algorithm for matching with delays (Q1757757) (← links)
- Non-preemptive scheduling in a smart grid model and its implications on machine minimization (Q2211351) (← links)
- A note on the geodetic number and the Steiner number of AT-free graphs (Q2220867) (← links)
- On maximum independent set of categorical product and ultimate categorical ratios of graphs (Q2348262) (← links)
- On the Grundy number of Cameron graphs (Q2413405) (← links)
- Rainbow Domination and Related Problems on Some Classes of Perfect Graphs (Q2798024) (← links)
- On Independence Domination (Q2842784) (← links)
- On Complexities of Minus Domination (Q2867118) (← links)
- Scheduling for Electricity Cost in Smart Grid (Q2867129) (← links)
- Convex Independence in Permutation Graphs (Q2958358) (← links)
- Optimal Nonpreemptive Scheduling in a Smart Grid Model (Q4636537) (← links)
- An Improved Online Algorithm for the Traveling Repairperson Problem on a Line (Q5092364) (← links)
- Edge-Clique Covers of the Tensor Product (Q5251635) (← links)
- Results on Independent Sets in Categorical Products of Graphs, the Ultimate Categorical Independence Ratio and the Ultimate Categorical Independent Domination Ratio (Q5746261) (← links)
- Complexity and online algorithms for minimum skyline coloring of intervals (Q5915896) (← links)
- Greedy is optimal for online restricted assignment and smart grid scheduling for unit size jobs (Q5918899) (← links)
- Greedy is optimal for online restricted assignment and smart grid scheduling for unit size jobs (Q5919098) (← links)
- Complexity and online algorithms for minimum skyline coloring of intervals (Q5919565) (← links)
- The power of amortization on scheduling with explorable uncertainty (Q6574932) (← links)
