Skip To Main Content
Yeonsu Chang on Muck Rack

Yeonsu Chang

As seen in: arXiv
Is this you? As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work. Claim your profile

Get in touch with Yeonsu

Contact Yeonsu, search articles and posts on X, monitor coverage, and track replies from one place.

Learn more about Muck Rack

Actions

Share this page

Is this you?

As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.
Claim your profile

Articles

Computer Science > Data Structures and Algorithms

|
By Yeonsu Chang, Julien Duron, Colin Geniet
| arXiv
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Open in Who Shared View Duplicates (698) Issue with article?

[2408.09591] Pre-assignment problem for unique minimum vertex cover on bounded clique-width graphs

|
By Kyungjin Cho, O-joung Kwon, Myounghwan Lee, Yeonsu Chang
| arXiv
arXiv:2408.09591 (cs) View PDF HTML (experimental) Comments: Subjects: Data Structures and Algorithms (cs.DS) Cite as: arXiv:2408.09591 [cs.DS] (or arXiv:2408.09591v1 [cs.DS] for this version) https://doi.org/10.48550/arXiv.2408.09591 Submission history From: O-Joung Kwon [ view email] [v1] Sun, 18 Aug 2024 20:43:55 UTC (119 KB) Bibliographic Tools Bibliographic Explorer Toggle Bibliographic Explorer () Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are...
Open in Who Shared View Duplicates (205) Issue with article?
See all 2 articles