A new proof of the Erdős–Ko–Rado theorem for intersecting families of permutations Fulltext Access 11 Pages 2009
Directed 3-cycle decompositions of complete directed graphs with quadratic leaves Fulltext Access 11 Pages 2009
Representations of a fixed-point subalgebra of a class of lattice vertex operator algebras by an automorphism of order three Fulltext Access 11 Pages 2009
A new heuristic algorithm for the machine scheduling problem with job delivery coordination Fulltext Access 11 Pages 2009
How hard is it to find extreme Nash equilibria in network congestion games? Fulltext Access 11 Pages 2009
On selecting a maximum volume sub-matrix of a matrix and related problems Fulltext Access 11 Pages 2009
A generalization of Talbot's theorem about King Arthur and his Knights of the Round Table Fulltext Access 11 Pages 2009
Decomposing a planar graph of girth 5 into an independent set and a forest Fulltext Access 11 Pages 2009
Cage-amalgamation graphs, a common generalization of chordal and median graphs Fulltext Access 11 Pages 2009
New proofs of the Assmus–Mattson theorem based on the Terwilliger algebra Fulltext Access 11 Pages 2009
Approximating maximum edge 2-coloring in simple graphs via local improvement Fulltext Access 11 Pages 2009
The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions Fulltext Access 11 Pages 2009
Convergence rates of Markov chains for some self-assembly and non-saturated Ising models Fulltext Access 11 Pages 2009
Truthful mechanisms for two-range-values variant of unrelated scheduling Fulltext Access 11 Pages 2009
On small, reduced, and fast universal accepting networks of splicing processors Fulltext Access 11 Pages 2009
Maximum scan statistics and channel assignment problems in homogeneous wireless networks Fulltext Access 11 Pages 2009
Strip packing with precedence constraints and strip packing with release times Fulltext Access 12 Pages 2009
Dynamic rank/select structures with applications to run-length encoded texts Fulltext Access 12 Pages 2009
Efficient approximation of min set cover by moderately exponential algorithms Fulltext Access 12 Pages 2009
Investigating the existence and the regularity of Logarithmic Harary Graphs Fulltext Access 12 Pages 2009
Finding Paths between graph colourings: PSPACE-completeness and superpolynomial distances Fulltext Access 12 Pages 2009
Combinatorial and spectral aspects of nearest neighbor graphs in doubling dimensional and nearly-Euclidean spaces Fulltext Access 12 Pages 2009
A variant of the tandem duplication — random loss model of genome rearrangement Fulltext Access 12 Pages 2009