1 citations · 1 across the 7 of their papers we have counts for
6 papers · 1 filter
A Primal-Dual Approach to Randomized Online Bidding with Tail Constraints
Royce Kraakman, Bob Krekelberg, Alison Hsiang-Hsuan Liu +1
Controlling tail risk in randomized algorithms has received increasing attention. Randomized online algorithms can achieve a lower expected competitive ratio than the competitive r…
The Power of Amortization on Minimizing Total Completion Time with Explorable Uncertainty
Bob Krekelberg, Alison Hsiang-Hsuan Liu, Fu-Hong Liu +2
We study online scheduling to minimize total completion time with explorable uncertainty on single and multiple machines. Each job comes with an upper limit of its processing time,…
Convex Independence in Permutation Graphs
Wing-Kai Hon, Ton Kloks, Fu-Hong Liu +1
A set C of vertices of a graph is P_3-convex if every vertex outside C has at most one neighbor in C. The convex hull σ(A) of a set A is the smallest P_3-convex set that contains A…
P_3-Games
Wing-Kai Hon, Ton Kloks, Fu-Hong Liu +2
Without further ado, we present the P_3-game. The P_3-game is decidable for elementary classes of graphs such as paths and cycles. From an algorithmic point of view, the connected…
On the Grundy number of Cameron graphs
Wing-Kai Hon, Ton Kloks, Fu-Hong Liu +2
The Grundy number of a graph is the maximal number of colors attained by a first-fit coloring of the graph. The class of Cameron graphs is the Seidel switching class of cographs. I…
Flood-it on AT-Free Graphs
Wing-Kai Hon, Ton Kloks, Fu-Hong Liu +2
Solitaire {\sc Flood-it}, or {\sc Honey-Bee}, is a game played on a colored graph. The player resides in a source vertex. Originally his territory is the maximal connected, monochr…