Geodetic and Steiner geodetic sets in 3-Steiner distance hereditary graphs Fulltext Access 9 Pages 2008
On the existence and on the number of (k,l)(k,l)-kernels in the lexicographic product of graphs Fulltext Access 9 Pages 2008
Cycles in a tournament with pairwise zero, one or two given vertices in common Fulltext Access 9 Pages 2008
Fourier analysis and large independent sets in powers of complete graphs Fulltext Access 9 Pages 2008
A geometric description of the spin-embedding of symplectic dual polar spaces of rank 3 Fulltext Access 9 Pages 2008
Simple 8-(31,12,3080), 8-(40,12,16 200) and 8-(40,12,16 520) designs from PSL(3, 5) and PSL(4, 3) Fulltext Access 9 Pages 2008
On 2-factorizations whose automorphism group acts doubly transitively on the factors Fulltext Access 9 Pages 2008
All graphs with maximum degree three whose complements have 4-cycle decompositions Fulltext Access 9 Pages 2008
On the reconstruction of binary and permutation matrices under (binary) tomographic constraints Fulltext Access 9 Pages 2008
A framework for generating some discrete sets with disjoint components by using uniform distributions Fulltext Access 9 Pages 2008
Deadline guaranteed packet scheduling for overloaded traffic in input-queued switches Fulltext Access 9 Pages 2008
The cost of offline binary search tree algorithms and the complexity of the request sequence Fulltext Access 9 Pages 2008
Energy conservation in wireless sensor networks and connectivity of graphs Fulltext Access 9 Pages 2008
An improved lower bound for approximating minimum GCD multiplier in ℓ∞ norm () Fulltext Access 9 Pages 2008
Modeling time and topology for animation and visualization with examples on parametric geometry Fulltext Access 9 Pages 2008
Discrete approximations to real-valued leaf sequencing problems in radiation therapy Fulltext Access 9 Pages 2008
The maximum number of maximal independent sets in unicyclic connected graphs Fulltext Access 9 Pages 2008
The Robinson–Schensted correspondence for skew oscillating semi-standard tableaux Fulltext Access 9 Pages 2008
Lattices generated by join of strongly closed subgraphs in d-bounded distance-regular graphs Fulltext Access 9 Pages 2008
A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem Fulltext Access 9 Pages 2008
On planar and non-planar graphs having no chromatic zeros in the interval (1,2)(1,2) Fulltext Access 9 Pages 2008
The complexity of uniform Nash equilibria and related regular subgraph problems Fulltext Access 9 Pages 2008
Enforcing and defying associativity, commutativity, totality, and strong noninvertibility for worst-case one-way functions Fulltext Access 9 Pages 2008