On minimal triangle-free graphs with prescribed kk-defective chromatic number Fulltext Access 9 Pages 2011
Computational complexity of reconstruction and isomorphism testing for designs and line graphs Fulltext Access 9 Pages 2011
On connection between reducibility of an nn-ary quasigroup and that of its retracts Fulltext Access 9 Pages 2011
Group divisible designs with three unequal groups and larger first index Fulltext Access 9 Pages 2011
Convergence of binomial-based derivative estimation for C2 noisy discretized curves Fulltext Access 9 Pages 2011
Two infinite families of polyominoes that tile the plane by translation in two distinct ways Fulltext Access 9 Pages 2011
Abelian complexity of infinite words associated with quadratic Parry numbers Fulltext Access 9 Pages 2011
Combinatorial formulas for -coordinates in a totally nonnegative Grassmannian Fulltext Access 9 Pages 2011
Gelfand–Tsetlin polytopes and Feigin–Fourier–Littelmann–Vinberg polytopes as marked poset polytopes Fulltext Access 9 Pages 2011
Structure of functional codes defined on non-degenerate Hermitian varieties Fulltext Access 9 Pages 2011
On computing the minimum 3-path vertex cover and dissociation number of graphs Fulltext Access 9 Pages 2011
An ID-based multi-signer universal designated multi-verifier signature scheme Fulltext Access 9 Pages 2011
Feynman Graphs, and Nerve Theorem for Compact Symmetric Multicategories (Extended Abstract) Fulltext Access 9 Pages 2011
Competitive Boolean function evaluation: Beyond monotonicity, and the symmetric case Fulltext Access 9 Pages 2011
Lower bounds on the independence number of certain graphs of odd girth at least seven Fulltext Access 9 Pages 2011
Fewest repetitions versus maximal-exponent powers in infinite binary words Fulltext Access 9 Pages 2011
Construction of minimal deterministic finite automata from biological motifs Fulltext Access 9 Pages 2011
Post-processing hierarchical community structures: Quality improvements and multi-scale view Fulltext Access 9 Pages 2011
A note on an identity-based ring signature scheme with signer verifiability Fulltext Access 9 Pages 2011
An O∗(3.533k)-time parameterized algorithm for the 3-set packing problem Fulltext Access 9 Pages 2011
Tight complexity analysis of the relocation problem with arbitrary release dates Fulltext Access 9 Pages 2011
Negative selection algorithms on strings with efficient training and linear-time classification Fulltext Access 9 Pages 2011
Hamiltonian properties of twisted hypercube-like networks with more faulty elements Fulltext Access 9 Pages 2011