Existence of rr-fold perfect (v,K,1)(v,K,1)-Mendelsohn designs with K⊆{4,5,6,7}K⊆{4,5,6,7} Fulltext Access 12 Pages 2009
Lower bounds for projective designs, cubature formulas and related isometric embeddings Fulltext Access 12 Pages 2009
Sufficient conditions for super kk-restricted edge connectivity in graphs of diameter 2 Fulltext Access 12 Pages 2009
Continuant polynomials and worst-case behavior of Hopcroft’s minimization algorithm Fulltext Access 12 Pages 2009
A spectral proof of the uniqueness of a strongly regular graph with parameters (81,20,1,6)(81,20,1,6) Fulltext Access 12 Pages 2009
Ramsey degrees of finite ultrametric spaces, ultrametric Urysohn spaces and dynamics of their isometry groups Fulltext Access 12 Pages 2009
The uniqueness of the SDPS-set of the symplectic dual polar space DW(4nâ1,q), nâ¥2 Fulltext Access 12 Pages 2009
Optimal tree structures for group key tree management considering insertion and deletion cost Fulltext Access 13 Pages 2009
Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps Fulltext Access 13 Pages 2009
0–1 reformulations of the multicommodity capacitated network design problem Fulltext Access 13 Pages 2009
Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method Fulltext Access 13 Pages 2009
An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths Fulltext Access 13 Pages 2009
Minimum decomposition of a digital surface into digital plane segments is NP-hard Fulltext Access 13 Pages 2009
An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree Fulltext Access 13 Pages 2009
The NLC-width and clique-width for powers of graphs of bounded tree-width Fulltext Access 13 Pages 2009
Irreversible kk-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion Fulltext Access 13 Pages 2009
Simple games and weighted games: A theoretical and computational viewpoint Fulltext Access 13 Pages 2009
On the cost of uniform protocols whose memory consumption is adaptive to interval contention Fulltext Access 13 Pages 2009
Necessary and sufficient conditions for learning with correction queries Fulltext Access 13 Pages 2009
Collapsing words, permutation conditions and coherent colorings of trees Fulltext Access 13 Pages 2009
State-complexity hierarchies of uniform languages of alphabet-size length Fulltext Access 13 Pages 2009
A Generic Goal-Based Certification Argument for the Justification of Formal Analysis Fulltext Access 13 Pages 2009
Efficiently Representing Existential Dependency Sets for Expansion-based QBF Solvers Fulltext Access 13 Pages 2009
Computing Optimal Tests for Non-deterministic Systems Using DNNF Graphs Fulltext Access 13 Pages 2009