Yunlong Liu

Orcid: 0000-0003-2686-5240

Affiliations:
  • Hunan Normal University, Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing, Changsha, China
  • Central South University, School of Computer Science and Engineering, Changsha, China


According to our database1, Yunlong Liu authored at least 20 papers between 2007 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Vertex-Bipartition: A Unified Approach for Kernelization of Graph Linear Layout Problems Parameterized by Vertex Cover.
Int. J. Found. Comput. Sci., September, 2024

Parameterized Algorithms for Fixed-Order Book Drawing with Few Crossings Per Edge.
Int. J. Found. Comput. Sci., August, 2024

2023
A Faster Parameterized Algorithm for Bipartite 1-Sided Vertex Explosion.
Proceedings of the Combinatorial Optimization and Applications, 2023

2022
On book thickness parameterized by the vertex cover number.
Sci. China Inf. Sci., 2022

2021
On parameterized algorithms for fixed-order book thickness with respect to the pathwidth of the vertex ordering.
Theor. Comput. Sci., 2021

Parameterized Algorithms for Linear Layouts of Graphs with Respect to the Vertex Cover Number.
Proceedings of the Combinatorial Optimization and Applications, 2021

Fixed-Parameter Tractability for Book Drawing with Bounded Number of Crossings per Edge.
Proceedings of the Algorithmic Aspects in Information and Management, 2021

2020
Fixed-Order Book Thickness with Respect to the Vertex-Cover Number: New Observations and Further Analysis.
Proceedings of the Theory and Applications of Models of Computation, 2020

Parameterized Algorithms for Fixed-Order Book Drawing with Bounded Number of Crossings per Edge.
Proceedings of the Combinatorial Optimization and Applications, 2020

On Fixed-Order Book Thickness Parameterized by the Pathwidth of the Vertex Ordering.
Proceedings of the Algorithmic Aspects in Information and Management, 2020

2018
Parameterized counting matching and packing: A family of hard problems that admit FPTRAS.
Theor. Comput. Sci., 2018

2015
Edge deletion problems: Branching facilitated by modular decomposition.
Theor. Comput. Sci., 2015

An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs.
J. Comb. Optim., 2015

2013
An Effective Branching Strategy for Some Parameterized Edge Modification Problems with Multiple Forbidden Induced Subgraphs.
Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

2012
Complexity and parameterized algorithms for Cograph Editing.
Theor. Comput. Sci., 2012

2011
Cograph Editing: Complexity and Parameterized Algorithms.
Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

2009
On Counting 3-D Matchings of Size <i>k</i>.
Algorithmica, 2009

2007
Parameterized Algorithms for Weighted Matching and Packing Problems.
Proceedings of the Theory and Applications of Models of Computation, 2007

A Randomized Approximation Algorithm for Parameterized 3-D Matching Counting Problem.
Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

An Exact Algorithm Based on Chain Implication for the Min-CVCB Problem.
Proceedings of the Combinatorial Optimization and Applications, 2007


  Loading...