7 citations · 13 across the 15 of their papers we have counts for
17 papers
MacCorles: Minimum Alignment Cost Computation on Run-Length Encoded Strings
Wing-Kai Hon, Dominik Köppl, Jun-Hong Wang
We study a tie-breaking variant of the longest common subsequence problem on run-length encoded strings. Given two strings, the goal is first to maximize the number of equal aligne…
FM-Indexing Grammars Induced by Suffix Sorting for Long Patterns
Jin Jie Deng, Wing-Kai Hon, Dominik Köppl +1
The run-length compressed Burrows-Wheeler transform (RLBWT) used in conjunction with the backward search introduced in the FM index is the centerpiece of most compressed indexes wo…
An -Approximation Algorithm for Dynamic Weighted Vertex Cover with Soft Capacity
Hao-Ting Wei, Wing-Kai Hon, Paul Horn +2
This study considers the (soft) capacitated vertex cover problem in a dynamic setting. This problem generalizes the dynamic model of the vertex cover problem, which has been intens…
P_3-Games on Chordal Bipartite Graphs
Wing-Kai Hon, Ton Kloks, Fu-Hong Liu +3
Let G=(V,E) be a connected graph. A set U subseteq V is convex if G[U] is connected and all vertices of V\U have at most one neighbor in U. Let sigma(W) denote the unique smallest…
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…
Budget-Constrained Multi-Battle Contests: A New Perspective and Analysis
Chu-Han Cheng, Po-An Chen, Wing-Kai Hon
In a multi-battle contest, each time a player competes by investing some of her budgets or resources in a component battle to collect a value if winning the battle. There are multi…