Bounding the coefficients of the characteristic polynomials of simple binary matroids Fulltext Access 7 Pages 2012
The rank of edge connection matrices and the dimension of algebras of invariant tensors Fulltext Access 7 Pages 2012
On sets of odd type of PG(n,4)PG(n,4) and the universal embedding of the dual polar space DH(2n−1,4)DH(2n−1,4) Fulltext Access 7 Pages 2012
Proof of conjectures involving the largest and the smallest signless Laplacian eigenvalues of graphs Fulltext Access 7 Pages 2012
Completing a solution of the embedding problem for incomplete idempotent latin squares when numerical conditions suffice Fulltext Access 7 Pages 2012
Sparsity and connectivity of medial graphs: Concerning two edge-disjoint Hamiltonian paths in planar rigidity circuits Fulltext Access 7 Pages 2012
On the restricted matching extension of graphs on the torus and the Klein bottle Fulltext Access 7 Pages 2012
Optimal algorithms for online single machine scheduling with deteriorating jobs Fulltext Access 7 Pages 2012
Characteristic Sturmian words are extremal for the Critical Factorization Theorem Fulltext Access 7 Pages 2012
Rational relations having a rational trace on each finite intersection of rational relations Fulltext Access 7 Pages 2012
Constructing partial words with subword complexities not achievable by full words Fulltext Access 7 Pages 2012
Constrained surface-level gateway placement for underwater acoustic wireless sensor networks Fulltext Access 7 Pages 2012
New results on single-machine scheduling with past-sequence-dependent delivery times Fulltext Access 7 Pages 2012
Complexity of problems concerning reset words for cyclic and Eulerian automata Fulltext Access 7 Pages 2012
A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints Fulltext Access 7 Pages 2012
Node-disjoint paths in a level block of generalized hierarchical completely connected networks Fulltext Access 7 Pages 2012
Acyclic homomorphisms to stars of graph Cartesian products and chordal bipartite graphs Fulltext Access 7 Pages 2012
A note on upper bounds for the maximum span in interval edge-colorings of graphs Fulltext Access 7 Pages 2012
A linear time approximation algorithm for permutation flow shop scheduling Fulltext Access 8 Pages 2012