Group divisible designs with three unequal groups and larger first index 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 connection between reducibility of an nn-ary quasigroup and that of its retracts Fulltext Access 9 Pages 2011
On minimal triangle-free graphs with prescribed kk-defective chromatic number Fulltext Access 9 Pages 2011
Characterization and recognition of P4-sparse graphs partitionable into k independent sets and â cliques Fulltext Access 9 Pages 2011
Universal exponents and tail estimates in the enumeration of planar maps Fulltext Access 9 Pages 2011
Vertex removal in two-dimensional Delaunay triangulation: Speed-up by low degrees optimization Fulltext Access 9 Pages 2011
Combinatorial formulas for -coordinates in a totally nonnegative Grassmannian Fulltext Access 9 Pages 2011
The primitives and antipode in the Hopf algebra of symmetric functions in noncommuting variables 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
Competitive Boolean function evaluation: Beyond monotonicity, and the symmetric case Fulltext Access 9 Pages 2011
Feynman Graphs, and Nerve Theorem for Compact Symmetric Multicategories (Extended Abstract) 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
Some heuristics for the binary paint shop problem and their expected number of colour changes Fulltext Access 9 Pages 2011
Finite group algebras of nilpotent groups: A complete set of orthogonal primitive idempotents Fulltext Access 9 Pages 2011
Conditional value-at-risk in portfolio optimization: Coherent but fragile Fulltext Access 9 Pages 2011
A hybrid Outer-Approximation/Benders Decomposition algorithm for the single allocation hub location problem under congestion Fulltext Access 9 Pages 2011
Charge and reduce: A fixed-parameter algorithm for String-to-String Correction Fulltext Access 9 Pages 2011
Resolvable even cycle decompositions of the tensor product of complete graphs 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
From equipartition to uniform cut polytopes: Extended polyhedral results Fulltext Access 10 Pages 2011