researcher

Jin-Kao Hao

Department of Computer Science, LERIA Laboratory, University of Angers, Angers, France

21 papers hereh-index 5711.6k citations314 works total

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

author position

middle author8
last author13

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

fields

affiliations

Department of Computer Science, LERIA Laboratory, University of Angers, Angers, France

Homepage

same name

Jin-Kao Hao — 9 papers, h 18
Jin-Kao Hao — 5 papers, h 2
Jin-Kao Hao — 3 papers, h 3
Jin-Kao Hao — 2 papers, h 2
Jin-Kao Hao — 2 papers, h 1
Jin-Kao Hao — 1 paper, 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

20132022

most citedA memetic algorithm for the minimum sum coloring problem

42 citations · 123 across the 21 of their papers we have counts for

collaborators

Showing 2013Show all

3 papers · 1 filter

cs.DS2013★ 9 cited

Solving the minimum sum coloring problem via binary quadratic programming

Yang Wang, Jin-Kao Hao, Fred Glover +1

In recent years, binary quadratic programming (BQP) has been successively applied to solve several combinatorial optimization problems. We consider in this paper a study of using t…

cs.DM2013★ 42 cited

A memetic algorithm for the minimum sum coloring problem

Yan Jin, Jin-Kao Hao, Jean-Philippe Hamiez

Given an undirected graph $G$ , the Minimum Sum Coloring problem (MSCP) is to find a legal assignment of colors (represented by natural numbers) to each vertex of $G$ such that the…

cs.DM2013★ 10 cited

Improved Lower Bounds for Sum Coloring via Clique Decomposition

Qinghua Wu, Jin-Kao Hao

Given an undirected graph $G = (V, E)$ with a set $V$ of vertices and a set $E$ of edges, the minimum sum coloring problem (MSCP) is to find a legal vertex coloring of $G$ , using co…