◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Yanqi Jin

2 papers hereh-index 10490 citations20 works total

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

author position
  • first author2

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

fields
  • cs.DM1
  • cs.NE1

identity via Semantic Scholar / OpenAlex

most citedAlgorithms for the minimum sum coloring problem: a review

33 citations · 35 across the 2 of their papers we have counts for

collaborators

2 papers

cs.NE2019★ 2 cited

Effective reinforcement learning based local search for the maximum k-plex problem

Yan Jin, John H. Drake, Una Benlic +1

The maximum k-plex problem is a computationally complex problem, which emerged from graph-theoretic social network studies. This paper presents an effective hybrid local search for…

cs.DM2015★ 33 cited

Algorithms for the minimum sum coloring problem: a review

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

The Minimum Sum Coloring Problem (MSCP) is a variant of the well-known vertex coloring problem which has a number of AI related applications. Due to its theoretical and practical r…

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