On set systems with restricted intersections modulo pp and pp-ary tt-designs Fulltext Access 7 Pages 2009
The uniqueness of a generalized hexagon of order 3 containing a subhexagon of order (1,3)(1,3) Fulltext Access 7 Pages 2009
Measures of pseudorandomness for binary sequences constructed using finite fields Fulltext Access 7 Pages 2009
A new lower bound on the number of trivially noncontractible edges in contraction critical 5-connected graphs Fulltext Access 7 Pages 2009
Super-simple balanced incomplete block designs with block size 4 and index 5 Fulltext Access 7 Pages 2009
Properties of locally convergent sequences with respect to median filter Fulltext Access 7 Pages 2009
A construction of mutually disjoint Steiner systems from isomorphic Golay codes Fulltext Access 7 Pages 2009
There are finitely many QQ-polynomial association schemes with given first multiplicity at least three Fulltext Access 7 Pages 2009
Quasirandom broadcasting on the complete graph is as fast as randomized broadcasting Fulltext Access 7 Pages 2009
On super (a,d)(a,d)-edge-antimagic total labeling of disconnected graphs Fulltext Access 7 Pages 2009
Around Sziklai's conjecture on the number of points of a plane curve over a finite field Fulltext Access 7 Pages 2009
Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness Fulltext Access 7 Pages 2009
On the structural properties of a discrete-time single product revenue management problem Fulltext Access 7 Pages 2009
The stochastic pp-median problem with unknown cost probability distribution Fulltext Access 7 Pages 2009
A Branch-and-Price Algorithm for the Capacitated Arc Routing Problem with Stochastic Demands Fulltext Access 7 Pages 2009
A fast preemptive scheduling algorithm with release times and inclusive processing set restrictions Fulltext Access 7 Pages 2009
Improved approximation algorithms for the single-sink buy-at-bulk network design problems Fulltext Access 7 Pages 2009
Complete description of forbidden subgraphs in the structural domination problem Fulltext Access 7 Pages 2009
Variable neighborhood search for extremal graphs. 23. On the Randić index and the chromatic number Fulltext Access 7 Pages 2009
deBruijn-like sequences and the irregular chromatic number of paths and cycles Fulltext Access 7 Pages 2009