◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Yongjie Yang

Saarland University

22 papers hereh-index 15681 citations67 works total

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

author position
  • sole author9
  • first author7
  • middle author2
  • last author4

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

fields
  • cs.GT14
  • cs.DS3
  • cs.DL1
  • cs.DM1
  • cs.LG1
  • cs.MA1
affiliations
  • Saarland University
  • University of Siegen
  • Central South University
same name
  • Yongjie Yang — 3 papers, h 3
  • Yongjie Yang — 2 papers, h 8
  • Yongjie Yang — 1 paper, h 5
  • Yongjie Yang — 1 paper, h 1
  • Yongjie Yang — 1 paper, h 1
  • Yongjie Yang — 1 paper, h 4

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
20132026
most citedThe Control Complexity of r-Approval: from the Single-Peaked Case to the General Case

15 citations · 41 across the 19 of their papers we have counts for

collaborators
Showing cs.DSShow all

3 papers · 1 filter

cs.DS2017★ 1 cited

Improved Kernels and Algorithms for Claw and Diamond Free Edge Deletion Based on Refined Observations

Wenjun Li, Huan Peng, Yongjie Yang

In the {claw, diamond}-free edge deletion problem, we are given a graph G and an integer k>0, the question is whether there are at most k edges whose deletion results in a gr…

cs.DS2016

Further Kernelization of Proper Interval Vertex Deletion: New Observations and Refined Analysis

Wenjun Li, Yongjie Yang, Jianer Chen +1

In the Proper Interval Vertex Deletion problem (PIVD for short), we are given a graph G and an integer parameter k>0, and the question is whether there are at most k vertices…

cs.DS2013★ 1 cited

Exact Algorithms for Weighted and Unweighted Borda Manipulation Problems

Yongjie Yang, Jiong Guo

Both weighted and unweighted Borda manipulation problems have been proved NP-hard. However, there is no exact combinatorial algorithm known for these problems. In this…

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