Reconstructing subgraph-counting graph polynomials of increasing families of graphs Fulltext Access 8 Pages 2005
On the nonexistence of triple-error-correcting perfect binary linear codes with a crown poset structure Fulltext Access 8 Pages 2005
The set of values of b for which there exist block designs with b blocks Fulltext Access 8 Pages 2005
The minimum period of the Ehrhart quasi-polynomial of a rational polytope Fulltext Access 8 Pages 2005
Multiplicative graphs and semi-lattice endomorphisms in the category of graphs Fulltext Access 8 Pages 2005
The ErdÅs-Menger conjecture for source/sink sets with disjoint closures Fulltext Access 8 Pages 2005
Minimizing makespan with release times on identical parallel batching machines Fulltext Access 8 Pages 2005
A distance regular graph with intersection array (21,16,8;1,4,14) does not exist Fulltext Access 8 Pages 2005
Biplanes with flag-transitive automorphism groups of almost simple type, with alternating or sporadic socle Fulltext Access 8 Pages 2005
The Thue-Morse word contains circular 5/2+ power free words of every length Fulltext Access 9 Pages 2005
Embedding longest fault-free paths onto star graphs with more vertex faults Fulltext Access 9 Pages 2005
On the expected time for Herman's probabilistic self-stabilizing algorithm Fulltext Access 9 Pages 2005
Predicting Incompatibility of Transformations in Model-driven Development Fulltext Access 9 Pages 2005
Augmenting a graph of minimum degree 2 to have two disjoint total dominating sets Fulltext Access 9 Pages 2005
Minimal and maximal elements in two-sided cells of Sn and Robinson-Schensted correspondence Fulltext Access 9 Pages 2005
A Semantics of Realisability for the Classical Propositional Natural Deduction Fulltext Access 9 Pages 2005
A new algorithm for optimal 2-constraint satisfaction and its implications Fulltext Access 9 Pages 2005
Linear tolls suffice: New bounds and algorithms for tolls in single source networks Fulltext Access 9 Pages 2005
On Succinctness of Hierarchical State Diagrams in Absence of Message Passing Fulltext Access 9 Pages 2005
Optimal L(d,1)-labelings of certain direct products of cycles and Cartesian products of cycles Fulltext Access 9 Pages 2005