The set of values of b for which there exist block designs with b blocks Fulltext Access 8 Pages 2005
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
Extremities and orderings defined by generalized graph search algorithms Fulltext Access 8 Pages 2005
On Succinctness of Hierarchical State Diagrams in Absence of Message Passing Fulltext Access 9 Pages 2005
A two-phase greedy algorithm to locate and allocate hubs for fixed-wireless broadband access Fulltext Access 9 Pages 2005
New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints Fulltext Access 9 Pages 2005
Asymptotic analysis of stochastic block replacement policies for multicomponent systems in a Markov environment Fulltext Access 9 Pages 2005
Polling systems with periodic server routing in heavy traffic: renewal arrivals Fulltext Access 9 Pages 2005
Torpid mixing of the Wang-Swendsen-Kotecký algorithm for sampling colorings Fulltext Access 9 Pages 2005
Predicting Incompatibility of Transformations in Model-driven Development Fulltext Access 9 Pages 2005
Response time in a tandem queue with blocking, Markovian arrivals and phase-type services 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
Optimal L(d,1)-labelings of certain direct products of cycles and Cartesian products of cycles Fulltext Access 9 Pages 2005
Links between Latin squares, nets, graphs and groups: Work inspired by a paper of A. Barlotti and K. Strambach Fulltext Access 9 Pages 2005
Augmenting a graph of minimum degree 2 to have two disjoint total dominating sets Fulltext Access 9 Pages 2005
On the complexity of scheduling unit-time jobs with OR-precedence constraints Fulltext Access 10 Pages 2005
A computational study of integer programming algorithms based on Barvinok's rational functions Fulltext Access 10 Pages 2005
A semidefinite optimization approach for the single-row layout problem with unequal dimensions Fulltext Access 10 Pages 2005