Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Hanchun Yuan

dblp:261/9827 · DBLP profile ↗
← Back
10ranked-venue papers
6as first author
9since 2021 · last 2026
0000-0001-7781-3331ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 8 · 4 first-author · 7 since 2021Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
2 papers
Graph algorithms and graph theory · 56% Computational complexity · 44%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Graph algorithms and graph theory
graph classes
0.812024
Modification problems toward proper (Helly) circular-arc graphs · Inf. Comput. 2024
Graph algorithms and graph theory › graph theory › graph transformation
graph modification
0.812024
Modification problems toward proper (Helly) circular-arc graphs · Inf. Comput. 2024
Computational complexity › parameterized complexity
kernelization
0.712023
Improved kernels for triangle packing in tournaments · Sci. China Inf. Sci. 2023
Computational complexity
parameterized complexity
0.712023
Improved kernels for triangle packing in tournaments · Sci. China Inf. Sci. 2023

Methods — techniques the papers use, named apart from their topics

combinatorial algorithms · 0.7
YearPublicationVenuePosition
2026 Asymptotically Optimal Collaborative Caching in Edge Computing Systems
Hongjie Guo, Jinchao Wu, Jianxu Shen, Hanchun Yuan
COCOON4
2026 Kernel for proper Helly circular-arc vertex deletion
Hanchun Yuan
Theor. Comput. Sci.1
2026 A quadratic kernel for {claw, diamond}-free deletion
Hanchun Yuan
Theor. Comput. Sci.1
2025 A Quadratic Kernel for {Claw, Diamond}-free Deletion
Hanchun Yuan
TAMC1
2024 Kernel for Proper Helly Circular-Arc Vertex Deletion: Smaller and Simpler via Graph Isomorphism
Hanchun Yuan, Zhen Zhang 0025
COCOA (1)1
2024 Modification problems toward proper (Helly) circular-arc graphs
Yixin Cao 0001, Hanchun Yuan, Jianxin Wang 0001
Inf. Comput.2
2023 Modification Problems Toward Proper (Helly) Circular-Arc Graphs
abstract
We present a $9^k\cdot n^{O(1)}$-time algorithm for the proper circular-arc vertex deletion problem, resolving an open problem of van 't Hof and Villanger [Algorithmica 2013] and Crespelle et al. [arXiv:2001.06867]. Our structural study also implies parameterized algorithms for modification problems toward proper Helly circular-arc graphs.
Yixin Cao 0001, Hanchun Yuan, Jianxin Wang 0001
MFCS2
2023 Improved kernels for triangle packing in tournaments
Hanchun Yuan, Qilong Feng, Jianxin Wang 0001
Sci. China Inf. Sci.1
2021 Polynomial kernels for paw-free edge modification problems
Hanchun Yuan, Yuping Ke, Yixin Cao 0001
Theor. Comput. Sci.1
2020 Polynomial Kernels for Paw-Free Edge Modification Problems
Yixin Cao 0001, Yuping Ke, Hanchun Yuan
TAMC3