Limit distribution for the existence of Hamiltonian cycles in a random graph Fulltext Access 7 Pages 2006
Independence and coloring properties of direct products of some vertex-transitive graphs Fulltext Access 7 Pages 2006
Minimum connected dominating sets and maximal independent sets in unit disk graphs Fulltext Access 7 Pages 2006
Cubical local partial orders on cubically subdivided spaces—Existence and construction Fulltext Access 7 Pages 2006
Generalized quadrangles of order (p,t) admitting a 2-transitive regulus, p a prime Fulltext Access 7 Pages 2006
Counting the regular coverings of surfaces using the center of a group algebra Fulltext Access 7 Pages 2006
Characterizations for co-graphs defined by restricted NLC-width or clique-width operations Fulltext Access 7 Pages 2006
Maximizing breaks and bounding solutions to the mirrored traveling tournament problem Fulltext Access 7 Pages 2006
Some subsets of points in the plane associated to truncated Reed–Muller codes with good parameters Fulltext Access 7 Pages 2006
The number of convex polyominoes and the generating function of Jacobi polynomials Fulltext Access 7 Pages 2006
Randomized vs. deterministic distance query strategies for point location on the line Fulltext Access 7 Pages 2006
Criterion of calibration for transductive confidence machine with limited feedback Fulltext Access 7 Pages 2006
A Data Model to Facilitate the Automation of Web Accessibility Evaluations Fulltext Access 7 Pages 2006
The complexity of maximum matroid–greedoid intersection and weighted greedoid maximization Fulltext Access 8 Pages 2006
On non-rank facets of stable set polytopes of webs with clique number four Fulltext Access 8 Pages 2006
Symmetric matrices and codes correcting rank errors beyond the ⌊(d-1)/2⌋⌊(d-1)/2⌋ bound Fulltext Access 8 Pages 2006
Algorithms for clique-independent sets on subclasses of circular-arc graphs Fulltext Access 8 Pages 2006
A concentration bound for the longest increasing subsequence of a randomly chosen involution Fulltext Access 8 Pages 2006