Jia Jie Liu

Orcid: 0000-0001-7413-9927

According to our database1, Jia Jie Liu authored at least 28 papers between 2007 and 2026.

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

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
The orbits of Möbius cubes.
Discret. Appl. Math., 2026

The orbits of twisted cubes.
Discret. Appl. Math., 2026

2024
The Orbits of Folded Crossed Cubes.
Comput. J., 2024

2022
The Outer-Paired Domination of Graphs.
Int. J. Found. Comput. Sci., 2022

The co-secure domination in proper interval graphs.
Discret. Appl. Math., 2022

2019
A simple algorithm for secure domination in proper interval graphs.
Discret. Appl. Math., 2019

2017
The 2-Rainbow Domination of Sierpiński Graphs and Extended Sierpiński Graphs.
Theory Comput. Syst., 2017

2016
The connected p-median problem on block graphs.
Optim. Lett., 2016

The Outer-connected Domination Number of Sierpiński-like Graphs.
Theory Comput. Syst., 2016

Computing Global Secure Set on Trees.
Comput. J., 2016

2015
The hub number of co-comparability graphs.
Theor. Comput. Sci., 2015

Finding outer-connected dominating sets in interval graphs.
Inf. Process. Lett., 2015

Constrained Longest Common Subsequences with Run-Length-Encoded Strings.
Comput. J., 2015

Resequencing a Set of Strings Based on a Target String.
Algorithmica, 2015

2014
Hamiltonian cycles in hypercubes with faulty edges.
Inf. Sci., 2014

Longest Fault-Free Cycles in Folded Hypercubes with Conditional Faulty Elements.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014

The Weighted Independent Domination Problem in Series-Parallel Graphs.
Proceedings of the Intelligent Systems and Applications, 2014

2013
Global Strong Defensive Alliances of Sierpiński-Like Graphs.
Theory Comput. Syst., 2013

2012
A New Subclass of Integer Linear Programming Problems and Its Applications.
IEEE Trans. Computers, 2012

2011
The Hub Number of Sierpiński-Like Graphs.
Theory Comput. Syst., 2011

An Optimal Algorithm for Untangling Binary Trees via Rotations.
Comput. J., 2011

An Optimal Rotation Distance Set.
Comput. J., 2011

2010
Distinct squares in run-length encoded strings.
Theor. Comput. Sci., 2010

2009
A fast algorithm for finding the positions of all squares in a run-length encoded string.
Theor. Comput. Sci., 2009

Errata for "Faster index for property matching".
Inf. Process. Lett., 2009

2008
Finding a longest common subsequence between a run-length-encoded string and an uncompressed string.
J. Complex., 2008

Sequence Alignment Algorithms for Run-Length-Encoded Strings.
Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

2007
Edit distance for a run-length-encoded string and an uncompressed string.
Inf. Process. Lett., 2007


  Loading...