Multiple partitions, lattice paths and a Burge–Bressoud-type correspondence Fulltext Access 9 Pages 2009
Hamiltonian cycles and dominating cycles passing through a linear forest Fulltext Access 9 Pages 2009
The orientable genus of some joins of complete graphs with large edgeless graphs Fulltext Access 9 Pages 2009
Deterministic and unambiguous two-dimensional languages over one-letter alphabet Fulltext Access 9 Pages 2009
Conditional matching preclusion for hypercube-like interconnection networks Fulltext Access 9 Pages 2009
Hardness results and approximation algorithms for (weighted) paired-domination in graphs Fulltext Access 9 Pages 2009
On imprimitive multiplicity-free permutation groups the degree of which is the product of two distinct primes Fulltext Access 9 Pages 2009
Enumeration of the degree sequences of non-separable graphs and connected graphs Fulltext Access 9 Pages 2009
Conservation of some dynamical properties for operations on cellular automata Fulltext Access 9 Pages 2009
Construction of strongly connected dominating sets in asymmetric multihop wireless networks Fulltext Access 9 Pages 2009
Maximal and minimal representations of gapped and non-gapped motifs of a string Fulltext Access 9 Pages 2009
Reciprocal complementary Wiener numbers of trees, unicyclic graphs and bicyclic graphs Fulltext Access 9 Pages 2009
Short correctness proofs for two self-stabilizing algorithms under the distributed daemon model Fulltext Access 9 Pages 2009
Bounded edge-connectivity and edge-persistence of Cartesian product of graphs Fulltext Access 9 Pages 2009
The number of independent sets in unicyclic graphs with a given diameter Fulltext Access 9 Pages 2009
Integration of topological measures for eliminating non-specific interactions in protein interaction networks Fulltext Access 9 Pages 2009
Data aggregation in sensor networks: Balancing communication and delay costs Fulltext Access 9 Pages 2009
The degree of word-expansion of lexicalized RRWW-automata — A new measure for the degree of nondeterminism of (context-free) languages Fulltext Access 9 Pages 2009
Two complementary operations inspired by the DNA hairpin formation: Completion and reduction Fulltext Access 9 Pages 2009
Short fail-stop signature scheme based on factorization and discrete logarithm assumptions Fulltext Access 9 Pages 2009