About the fundamental relations defined on the hypergroupoids associated with binary relations Fulltext Access 10 Pages 2011
Generalized descent patterns in permutations and associated Hopf algebras Fulltext Access 10 Pages 2011
Digraphs that have at most one walk of a given length with the same endpoints Fulltext Access 10 Pages 2011
On the algorithmic effectiveness of digraph decompositions and complexity measures Fulltext Access 10 Pages 2011
The hyperplanes of finite symplectic dual polar spaces which arise from projective embeddings Fulltext Access 10 Pages 2011
On the residue codes of extremal Type II Z4-codes of lengths 32 and 40 Fulltext Access 10 Pages 2011
Relatively prime polynomials and nonsingular Hankel matrices over finite fields Fulltext Access 10 Pages 2011
On a family of strong geometric spanners that admit local routing strategies Fulltext Access 10 Pages 2011
The asymptotic existence of group divisible designs of large order with index one Fulltext Access 10 Pages 2011
Non-abelian skew Hadamard difference sets fixed by a prescribed automorphism Fulltext Access 10 Pages 2011
A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems Fulltext Access 10 Pages 2011
Broadcasting secure messages via optimal independent spanning trees in folded hypercubes Fulltext Access 10 Pages 2011
A closed-form solution for the optimal release times for the F2|F2| deteriorating jobs |∑wjCj|∑wjCj problem Fulltext Access 10 Pages 2011
Graphs with given number of cut vertices and extremal Merrifield–Simmons index Fulltext Access 10 Pages 2011
Efficient synthesis of a class of Boolean programs from II-OO data: Application to genetic networks Fulltext Access 10 Pages 2011
A complete characterization of paths that are mm-step competition graphs Fulltext Access 10 Pages 2011
An Algebra of Automata That Includes Both Classical and Quantum Entities Fulltext Access 10 Pages 2011
Relay placement for fault tolerance in wireless networks in higher dimensions Fulltext Access 10 Pages 2011
Classification of the family AT4(qs,q,q)AT4(qs,q,q) of antipodal tight graphs Fulltext Access 11 Pages 2011
A proof of the linearity conjecture for k-blocking sets in PG(n,p3), p prime Fulltext Access 11 Pages 2011
On exact blockers and anti-blockers, ΔΔ-conjecture, and related problems Fulltext Access 11 Pages 2011
On the structure of cube tilings and unextendible systems of cubes in low dimensions Fulltext Access 11 Pages 2011
Enumerating (2+2)-free posets by the number of minimal elements and other statistics Fulltext Access 11 Pages 2011
On a group testing problem: Characterization of graphs with 2-complexity c2c2 and maximum number of edges Fulltext Access 11 Pages 2011
Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees Fulltext Access 11 Pages 2011
Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees Fulltext Access 11 Pages 2011
On the complexity of the dominating induced matching problem in hereditary classes of graphs Fulltext Access 11 Pages 2011
Transversals to the convex hulls of all k-sets of discrete subsets of Rn Fulltext Access 11 Pages 2011
Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree Fulltext Access 11 Pages 2011
Regularity of edge ideals of C4-free graphs via the topology of the lcm-lattice Fulltext Access 11 Pages 2011
Approximation schemes for parallel machine scheduling with availability constraints Fulltext Access 11 Pages 2011
Partitions and indivisibility properties of countable dimensional vector spaces Fulltext Access 11 Pages 2011