Coloring the square of graphs whose maximum average degree is less than 4 Fulltext Access 10 Pages 2016
On the star-height of subword counting languages and their relationship to Rees zero-matrix semigroups Fulltext Access 10 Pages 2016
The sorting index and inversion number on order ideals of permutation groups Fulltext Access 10 Pages 2016
On automorphisms and structural properties of double generalized Petersen graphs Fulltext Access 10 Pages 2016
Minimum strictly fundamental cycle bases of planar graphs are hard to find Fulltext Access 10 Pages 2016
Linearity is strictly more powerful than contiguity for encoding graphs Fulltext Access 10 Pages 2016
On the security of two identity-based conditional proxy re-encryption schemes Fulltext Access 10 Pages 2016
Approximation of the parallel machine scheduling problem with additional unit resources Fulltext Access 10 Pages 2016
Existentially closed graphs via permutation polynomials over finite fields Fulltext Access 10 Pages 2016
Complexity of the maximum leaf spanning tree problem on planar and regular graphs Fulltext Access 10 Pages 2016
Approximate core allocations and integrality gap for the bin packing game Fulltext Access 10 Pages 2016
Combined schemes for signature and encryption: The public-key and the identity-based setting Fulltext Access 10 Pages 2016
An efficient algorithm for one-sided block ordering problem under block-interchange distance Fulltext Access 10 Pages 2016
Asymptotic enumeration of sparse uniform hypergraphs with given degrees Fulltext Access 10 Pages 2016
A new perspective on clustered planarity as a combinatorial embedding problem Fulltext Access 10 Pages 2016
Parameterized tractability of the maximum-duo preservation string mapping problem Fulltext Access 10 Pages 2016
Reducing the generalised Sudoku problem to the Hamiltonian cycle problem Fulltext Access 11 Pages 2016
A generalization of Spira's theorem and circuits with small segregators or separators Fulltext Access 11 Pages 2016
Partial gathering of mobile agents in asynchronous unidirectional rings Fulltext Access 11 Pages 2016
Card-based protocols for securely computing the conjunction of multiple variables Fulltext Access 11 Pages 2016
Paired many-to-many disjoint path covers in restricted hypercube-like graphs Fulltext Access 11 Pages 2016
Efficient dynamic threshold identity-based encryption with constant-size ciphertext Fulltext Access 11 Pages 2016
On the hardness of labeled correlation clustering problem: A parameterized complexity view Fulltext Access 11 Pages 2016
Gathering of robots on anonymous grids and trees without multiplicity detection Fulltext Access 11 Pages 2016
On three polynomial kernels of sequences for arbitrarily partitionable graphs Fulltext Access 11 Pages 2016
The (1,2)(1,2)-step competition graph of a pure local tournament that is not round decomposable Fulltext Access 11 Pages 2016
Magneto-convection of water-based nanofluids inside an enclosure having uniform heat generation and various thermal boundaries Fulltext Access 11 Pages 2016
Characterizing forbidden pairs for rainbow connection in graphs with minimum degree 2 Fulltext Access 11 Pages 2016
Planar graphs without adjacent cycles of length at most five are (1,1,0) -colorable Fulltext Access 11 Pages 2016
There are no finite partial cubes of girth more than 6 and minimum degree at least 3 Fulltext Access 11 Pages 2016
Relation between the skew-rank of an oriented graph and the rank of its underlying graph Fulltext Access 11 Pages 2016
Word-representability of triangulations of grid-covered cylinder graphs Fulltext Access 11 Pages 2016
Scheduling jobs with equal processing times and a single server on parallel identical machines Fulltext Access 11 Pages 2016