Junfeng Luan

According to our database1, Junfeng Luan authored at least 11 papers between 2001 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2019
An Approximation Algorithm for Sorting by Bounded Singleton Moves.
Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

2015
可计算性逻辑中CoL2系统的可判定性分析 (Research on Decidability of CoL2 in Computability Logic).
计算机科学, 2015

Approximation and Nonapproximability for the One-Sided Scaffold Filling Problem.
Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

2013
On the Toggling-Branching Recurrence of Computability Logic.
J. Comput. Sci. Technol., 2013

Implementing program extraction from CL1-proofs.
CoRR, 2013

2012
An approximation algorithm for the Generalized k-Multicut problem.
Discret. Appl. Math., 2012

On the toggling-branching recurrence of Computability Logic
CoRR, 2012

2009
Parameterized computational complexity of control problems in voting systems.
Theor. Comput. Sci., 2009

A Bicriteria Approximation Algorithm for Generalized k-Multicut in Trees.
Proceedings of the Second International Joint Conference on Computational Sciences and Optimization, 2009

Translocation-Deletions Distance Formula for Sorting Genomes.
Proceedings of the CSIE 2009, 2009 WRI World Congress on Computer Science and Information Engineering, March 31, 2009

2001
Hardness and Methods to Solve CLIQUE.
J. Comput. Sci. Technol., 2001


  Loading...