The co-secure domination in proper interval graphs.
Discret. Appl. Math., 2022
A simple algorithm for secure domination in proper interval graphs.
Discret. Appl. Math., 2019
The 2-Rainbow Domination of Sierpiński Graphs and Extended Sierpiński Graphs.
Theory Comput. Syst., 2017
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
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
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
Global Strong Defensive Alliances of Sierpiński-Like Graphs.
Theory Comput. Syst., 2013
A New Subclass of Integer Linear Programming Problems and Its Applications.
IEEE Trans. Computers, 2012
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
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
Edit distance for a run-length-encoded string and an uncompressed string.
Inf. Process. Lett., 2007