An Erdős–Ko–Rado theorem for the derangement graph of PGL(2,q) acting on the projective line Fulltext Access 13 Pages 2011
A recipe theorem for the topological Tutte polynomial of Bollobás and Riordan Fulltext Access 13 Pages 2011
Existence of cyclic (3,λ)(3,λ)-GDD of type gvgv having prescribed number of short orbits Fulltext Access 13 Pages 2011
On the Laplacian coefficients of unicyclic graphs with prescribed matching number Fulltext Access 13 Pages 2011
Linear and nonlinear constructions of DNA codes with Hamming distance dd and constant GCGC-content Fulltext Access 13 Pages 2011
Valuations of rational solutions of linear difference equations at irreducible polynomials Fulltext Access 13 Pages 2011
On an identity of Gessel and Stanton and the new little Göllnitz identities Fulltext Access 13 Pages 2011
Propositional Dynamic Logic with Storing, Recovering and Parallel Composition Fulltext Access 13 Pages 2011
Implementing a Language with Flow-Sensitive and Structural Typing on the JVM Fulltext Access 13 Pages 2011
Treegraph-based Instruction Scheduling for Stack-based Virtual Machines Fulltext Access 13 Pages 2011
On nn-facility median problem with facilities subject to failure facing uniform demand Fulltext Access 13 Pages 2011
An integer LL-shaped algorithm for the Dial-a-Ride Problem with stochastic customer delays Fulltext Access 13 Pages 2011
Searching for mobile intruders in circular corridors by two 1-searchers Fulltext Access 13 Pages 2011
Integer point sets minimizing average pairwise L1 distance: What is the optimal shape of a town? Fulltext Access 13 Pages 2011
On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph Fulltext Access 13 Pages 2011
Partial Observation of Quantum Turing Machines and a Weaker Well-Formedness Condition Fulltext Access 13 Pages 2011
Automorphisms of the quadratic forms graph over a finite field of characteristic two II Fulltext Access 14 Pages 2011
Toward determination of optimal plane curves with a fixed degree over a finite field Fulltext Access 14 Pages 2011
Using Markov chains to analyze the effectiveness of local search algorithms Fulltext Access 14 Pages 2011
The minimum size of 3-graphs without a 4-set spanning no or exactly three edges Fulltext Access 14 Pages 2011
Some combinatorially defined subsets of βN and their relation to the idempotents Fulltext Access 14 Pages 2011
Optimal permutation anticodes with the infinity norm via permanents of (0,1)-matrices Fulltext Access 14 Pages 2011