Online and offline algorithms for the sorting buffers problem on the line metric Fulltext Access 12 Pages 2010
Dimension-2 poset competition numbers and dimension-2 poset double competition numbers Fulltext Access 12 Pages 2010
Iterative processes related to Riordan arrays: The reciprocation and the inversion of power series Fulltext Access 12 Pages 2010
A proof of unimodality on the numbers of connected spanning subgraphs in an nn-vertex graph with at least ⌈(3−22)n2+n−7−2222⌉ edges Fulltext Access 12 Pages 2010
An efficient approach for counting the number of spanning trees in circulant and related graphs Fulltext Access 12 Pages 2010
The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops Fulltext Access 12 Pages 2010
Feasibility of motion planning on acyclic and strongly connected directed graphs Fulltext Access 12 Pages 2010
A characterization of signed graphs with generalized perfect elimination orderings Fulltext Access 13 Pages 2010
Monomial complete intersections, the weak Lefschetz property and plane partitions Fulltext Access 13 Pages 2010
Optimum covariate designs in a binary proper equi-replicate block design set-up Fulltext Access 13 Pages 2010
A combinatorial approach to the power of 2 in the number of involutions Fulltext Access 13 Pages 2010
A spectrum result on maximal partial ovoids of the generalized quadrangle Q(4,q)Q(4,q), qq even Fulltext Access 13 Pages 2010
Relative centers of motion, implicit bars and dead-center positions for planar mechanisms Fulltext Access 13 Pages 2010
Cyclic Hamiltonian cycle systems of the λλ-fold complete and cocktail party graphs Fulltext Access 13 Pages 2010
Codes over rings of size p2 and lattices over imaginary quadratic fields Fulltext Access 13 Pages 2010
Tableau Tool for Testing Satisfiability in LTL: Implementation and Experimental Analysis Fulltext Access 13 Pages 2010
Interlace polynomials: Enumeration, unimodality and connections to codes Fulltext Access 13 Pages 2010
Relaxed voting and competitive location under monotonous gain functions on trees Fulltext Access 13 Pages 2010
Test Case Generation for Adequacy of Floating-point to Fixed-point Conversion Fulltext Access 13 Pages 2010
Combinatorial constructions of fault-tolerant routings with levelled minimum optical indices Fulltext Access 13 Pages 2010
Constructing fair sports league schedules with regard to strength groups Fulltext Access 13 Pages 2010
A multi-level search strategy for the 0–1 Multidimensional Knapsack Problem Fulltext Access 13 Pages 2010
A general approach for cache-oblivious range reporting and approximate range counting Fulltext Access 13 Pages 2010
Necessary conditions for reversed Dickson polynomials to be permutational Fulltext Access 13 Pages 2010
Necessary and sufficient conditions for functions involving the tri- and tetra-gamma functions to be completely monotonic Fulltext Access 13 Pages 2010
General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems Fulltext Access 13 Pages 2010
Composite lifting of group inequalities and an application to two-row mixing inequalities Fulltext Access 13 Pages 2010