◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Chun-Hung Liu

61 papers hereh-index 242k citations131 works total

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

author position
  • sole author11
  • first author35
  • middle author10
  • last author5

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

fields
  • math.CO28
  • cs.IT25
  • cs.NI3
  • eess.SP2
  • cs.DM1
  • cs.LG1
same name
  • Chun-Hung Liu — 10 papers, h 3
  • Chun-Hung Liu — 6 papers, h 4
  • Chun-Hung Liu — 3 papers, h 1
  • Chun-Hung Liu — 3 papers, h 2
  • Chun-Hung Liu — 1 paper, h 2
  • Chun-Hung Liu — 1 paper, h 3

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
20082022
most citedDeploying robots with two sensors in K1,6​-free graphs

23 citations · 322 across the 61 of their papers we have counts for

collaborators
Showing 2012Show all

4 papers · 1 filter

math.CO2012★ 8 cited

An upper bound on the fractional chromatic number of triangle-free subcubic graphs

Chun-Hung Liu

An (a:b)-coloring of a graph G is a function f which maps the vertices of G into b-element subsets of some set of size a in such a way that f(u) is disjoint from $f(v…

cs.IT2012★ 3 cited

Downlink Coordinated Multi-Point with Overhead Modeling in Heterogeneous Cellular Networks

Ping Xia, Chun-Hung Liu, Jeffrey G. Andrews

Coordinated multi-point (CoMP) communication is attractive for heterogeneous cellular networks (HCNs) for interference reduction. However, previous approaches to CoMP face two majo…

math.CO2012★ 15 cited

Linear colorings of subcubic graphs

Chun-Hung Liu, Gexin Yu

A linear coloring of a graph is a proper coloring of the vertices of the graph so that each pair of color classes induce a union of disjoint paths. In this paper, we prove that for…

cs.DM2012★ 3 cited

A new bound for the 2/3 conjecture

Daniel Král', Chun-Hung Liu, Jean-Sébastien Sereni +2

We show that any n-vertex complete graph with edges colored with three colors contains a set of at most four vertices such that the number of the neighbors of these vertices in one…

◍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.