Characterization and recognition of P4-sparse graphs partitionable into k independent sets and â cliques Fulltext Access 9 Pages 2011
Local condition for planar graphs of maximum degree 7 to be 8-totally colorable Fulltext Access 9 Pages 2011
Local negative circuits and fixed points in non-expansive Boolean networks Fulltext Access 9 Pages 2011
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
Resolvable even cycle decompositions of the tensor product of complete graphs Fulltext Access 10 Pages 2011
From equipartition to uniform cut polytopes: Extended polyhedral results Fulltext Access 10 Pages 2011
MM-alternating paths and the construction of defect nn-extendable bipartite graphs with different connectivities Fulltext Access 10 Pages 2011
Improved deterministic algorithms for weighted matching and packing problems Fulltext Access 10 Pages 2011
Limitations of lower bound methods for deterministic nested word automata 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
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 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
Extracting Kolmogorov complexity with applications to dimension zero-one laws 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 closed-form solution for the optimal release times for the F2|F2| deteriorating jobs |∑wjCj|∑wjCj problem 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
Graphs with given number of cut vertices and extremal Merrifield–Simmons index Fulltext Access 10 Pages 2011
Size–energy tradeoffs for unate circuits computing symmetric Boolean functions Fulltext Access 10 Pages 2011
Simulating reversible Turing machines and cyclic tag systems by one-dimensional reversible cellular automata Fulltext Access 10 Pages 2011
Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in O(n1+ϵ) time Fulltext Access 10 Pages 2011
On the OBDD complexity of the most significant bit of integer multiplication Fulltext Access 10 Pages 2011