default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYunlong Liu 0001
Person information
- affiliation: Hunan Normal University, Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing, Changsha, China
- affiliation: Central South University, School of Computer Science and Engineering, Changsha, China
Other persons with the same name
- Yunlong Liu — disambiguation page
- Yunlong Liu 0002
![[0000-0002-3662-3512]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-3662-3512")
— Qufu Normal University, School of Engineering, Rizhao, Shandong, China (and 3 more) - Yunlong Liu 0003 — Xiamen University, Department of Automation, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j9]Jingui Huang, Jie Chen, Yunlong Liu, Guang Xiao, Jianxin Wang:
Parameterized Algorithms for Fixed-Order Book Drawing with Few Crossings Per Edge. Int. J. Found. Comput. Sci. 35(5): 551-577 (2024)- [j8]Yunlong Liu, Yixuan Li, Jingui Huang:
Vertex-Bipartition: A Unified Approach for Kernelization of Graph Linear Layout Problems Parameterized by Vertex Cover. Int. J. Found. Comput. Sci. 35(6): 609-629 (2024) - 2023
- [c11]Yunlong Liu, Guang Xiao, Ao Liu, Di Wu, Jingui Huang:
A Faster Parameterized Algorithm for Bipartite 1-Sided Vertex Explosion. COCOA (2) 2023: 253-266 - 2022
- [j7]Yunlong Liu, Jie Chen, Jingui Huang:
On book thickness parameterized by the vertex cover number. Sci. China Inf. Sci. 65(4) (2022) - 2021
- [j6]Yunlong Liu, Jie Chen, Jingui Huang, Jianxin Wang:
On parameterized algorithms for fixed-order book thickness with respect to the pathwidth of the vertex ordering. Theor. Comput. Sci. 873: 16-24 (2021) - [c10]Yunlong Liu, Yixuan Li, Jingui Huang:
Fixed-Parameter Tractability for Book Drawing with Bounded Number of Crossings per Edge. AAIM 2021: 438-449 - [c9]Yunlong Liu, Yixuan Li, Jingui Huang:
Parameterized Algorithms for Linear Layouts of Graphs with Respect to the Vertex Cover Number. COCOA 2021: 553-567 - 2020
- [c8]Yunlong Liu, Jie Chen, Jingui Huang, Jianxin Wang:
On Fixed-Order Book Thickness Parameterized by the Pathwidth of the Vertex Ordering. AAIM 2020: 225-237 - [c7]Yunlong Liu, Jie Chen, Jingui Huang:
Parameterized Algorithms for Fixed-Order Book Drawing with Bounded Number of Crossings per Edge. COCOA 2020: 562-576 - [c6]Yunlong Liu, Jie Chen, Jingui Huang:
Fixed-Order Book Thickness with Respect to the Vertex-Cover Number: New Observations and Further Analysis. TAMC 2020: 414-425
2010 – 2019
- 2018
- [j5]Yunlong Liu, Shaokai Wang, Jianxin Wang:
Parameterized counting matching and packing: A family of hard problems that admit FPTRAS. Theor. Comput. Sci. 734: 83-93 (2018) - 2015
- [j4]Yunlong Liu, Jianxin Wang, Chao Xu, Jiong Guo, Jianer Chen:
An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs. J. Comb. Optim. 29(1): 257-275 (2015) - [j3]Yunlong Liu, Jianxin Wang, Jie You, Jianer Chen, Yixin Cao:
Edge deletion problems: Branching facilitated by modular decomposition. Theor. Comput. Sci. 573: 63-70 (2015) - 2013
- [c5]Yunlong Liu, Jianxin Wang, Chao Xu, Jiong Guo, Jianer Chen:
An Effective Branching Strategy for Some Parameterized Edge Modification Problems with Multiple Forbidden Induced Subgraphs. COCOON 2013: 555-566 - 2012
- [j2]Yunlong Liu, Jianxin Wang, Jiong Guo, Jianer Chen:
Complexity and parameterized algorithms for Cograph Editing. Theor. Comput. Sci. 461: 45-54 (2012) - 2011
- [c4]Yunlong Liu, Jianxin Wang, Jiong Guo, Jianer Chen:
Cograph Editing: Complexity and Parameterized Algorithms. COCOON 2011: 110-121
2000 – 2009
- 2009
- [j1]Yunlong Liu, Jianer Chen, Jianxin Wang:
On Counting 3-D Matchings of Size k. Algorithmica 54(4): 530-543 (2009) - 2007
- [c3]Jianxin Wang, Xiaoshuang Xu, Yunlong Liu:
An Exact Algorithm Based on Chain Implication for the Min-CVCB Problem. COCOA 2007: 343-353 - [c2]Yunlong Liu, Jianer Chen, Jianxin Wang:
A Randomized Approximation Algorithm for Parameterized 3-D Matching Counting Problem. COCOON 2007: 349-359 - [c1]Yunlong Liu, Jianer Chen, Jianxin Wang:
Parameterized Algorithms for Weighted Matching and Packing Problems. TAMC 2007: 692-702
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-02 22:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
