Simple existence conditions for zero-one matrices with at most one structural zero in each row and column Fulltext Access 8 Pages 2006
Maximal sets of numbers not containing k+1 pairwise coprimes and having divisors from a specified set of primes Fulltext Access 8 Pages 2006
Classification of subsets with minimal width and dual width in Grassmann, bilinear forms and dual polar graphs Fulltext Access 8 Pages 2006
A linear time algorithm to list the minimal separators of chordal graphs Fulltext Access 8 Pages 2006
An efficient algorithm to find a double-loop network that realizes a given L-shape Fulltext Access 8 Pages 2006
On graphs on n vertices having an identifying code of cardinality ⌈log2(n+1)⌉⌈log2(n+1)⌉ Fulltext Access 8 Pages 2006
The (α,β,s,t)(α,β,s,t)-diameter of graphs: A particular case of conditional diameter Fulltext Access 8 Pages 2006
Type-Based Security for Mobile Computing Integrity, Secrecy and Liveness Fulltext Access 8 Pages 2006
Existence of directedwhist tournaments with the three person property 3PDWh(v)3PDWh(v) Fulltext Access 8 Pages 2006
Semi-local Model of Computations on Graphs to Break the Local Symmetry: Work in Progress Fulltext Access 8 Pages 2006
On the edge l∞ radius of Saitou and Nei's method for phylogenetic reconstruction Fulltext Access 8 Pages 2006
Wide-sense nonblocking for multi- networks under various routing strategies Fulltext Access 8 Pages 2006
Security analysis of a password-based authentication protocol proposed to IEEE 1363 Fulltext Access 8 Pages 2006
Further combinatorial identities deriving from the n th power of a 2×22×2 matrix Fulltext Access 8 Pages 2006
Upper bounds given by equitable partitions of a primitive association scheme Fulltext Access 9 Pages 2006
Np-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem Fulltext Access 9 Pages 2006
Independence polynomials of well-covered graphs: Generic counterexamples for the unimodality conjecture Fulltext Access 9 Pages 2006
On the commutativity of antiblocker diagrams under lift-and-project operators Fulltext Access 9 Pages 2006
Descending plane partitions and rhombus tilings of a hexagon with a triangular hole Fulltext Access 9 Pages 2006
Complexity results on restricted instances of a paint shop problem for words Fulltext Access 9 Pages 2006
On the coexistence of conference matrices and near resolvable 2-(2k+1,k,k-1) designs Fulltext Access 9 Pages 2006
Lower and upper orientable strong radius and strong diameter of complete k-partite graphs Fulltext Access 9 Pages 2006
On the smallest possible dimension and the largest possible margin of linear arrangements representing given concept classes Fulltext Access 9 Pages 2006
Cooperating Theorem Provers: A Case Study Combining HOL-Light and CVC Lite Fulltext Access 9 Pages 2006
Decision Trees of Algorithms and a Semivaluation to Measure Their Distance Fulltext Access 9 Pages 2006
An Extension of the Classification-Tree Method for Embedded Systems for the Description of Events Fulltext Access 9 Pages 2006
Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs Fulltext Access 9 Pages 2006
Two-tuple balance of non-binary sequences with ideal two-level autocorrelation Fulltext Access 9 Pages 2006