◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

W. Hon

17 papers hereh-index 272.1k citations152 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author11
  • middle author4
  • last author1

Across the 16 of 17 papers where every author was matched, so the position is known.

fields
  • cs.DM8
  • cs.DS8
  • cs.GT1
same name
  • W. Hon — 16 papers, h 8
  • W. Hon — 3 papers, h 2

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20022026
most citedAn In-place Framework for Exact and Approximate Shortest Unique Substring Queries

7 citations · 13 across the 15 of their papers we have counts for

collaborators
Showing 2015Show all

4 papers · 1 filter

cs.DS2015★ 7 cited

An In-place Framework for Exact and Approximate Shortest Unique Substring Queries

Wing-Kai Hon, Sharma V. Thankachan, Bojian Xu

We revisit the exact shortest unique substring (SUS) finding problem, and propose its approximate version where mismatches are allowed, due to its applications in subfields such as…

cs.DM2015★ 1 cited

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…

cs.DM2015

Convexities in Some Special Graph Classes ---New Results in AT-free Graphs and Beyond

Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu +2

We study convexity properties of graphs. In this paper we present a linear-time algorithm for the geodetic number in tree-cographs. Settling a 10-year-old conjecture, we prove that…

cs.DM2015★ 1 cited

Rainbow domination and related problems on some classes of perfect graphs

Wing-Kai Hon, Ton Kloks, Hsian-Hsuan Liu +1

Let k∈N and let G be a graph. A function f:V(G)→2[k] is a rainbow function if, for every vertex x with f(x)=∅, f(N(x))=[k]. The ra…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.