Analyzing the dynamics of stigmergetic interactions through pheromone games Fulltext Access 11 Pages 2010
The minimal polynomial of a sequence obtained from the componentwise linear transformation of a linear recurring sequence Fulltext Access 11 Pages 2010
Adapting parallel algorithms to the W-Stream model, with applications to graph problems Fulltext Access 11 Pages 2010
Translating propositional extended conjunctions of Horn clauses into Boolean circuits Fulltext Access 11 Pages 2010
Resolutions of three-rowed skew- and almost skew-shapes in characteristic zero Fulltext Access 11 Pages 2010
The index of maximum ambiguous density for irreducible non-powerful sign pattern matrices Fulltext Access 11 Pages 2010
Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs Fulltext Access 11 Pages 2010
Approximating minimum power covers of intersecting families and directed edge-connectivity problems Fulltext Access 11 Pages 2010
Spectral radius of finite and infinite planar graphs and of graphs of bounded genus Fulltext Access 11 Pages 2010
More on block intersection polynomials and new applications to graphs and block designs Fulltext Access 11 Pages 2010
Approximability and inapproximability of the minimum certificate dispersal problem Fulltext Access 11 Pages 2010
On listing, sampling, and counting the chordal graphs with edge constraints Fulltext Access 11 Pages 2010
Infinitesimal rigidity and flexibility of a non-symmetric affine connection space Fulltext Access 12 Pages 2010
Spectra of symmetric powers of graphs and the Weisfeiler–Lehman refinements Fulltext Access 12 Pages 2010
A systematic approach to matrix forms of the Pascal triangle: The twelve triangular matrix forms and relations Fulltext Access 12 Pages 2010
The joint distribution of consecutive patterns and descents in permutations avoiding 3-1-2 Fulltext Access 12 Pages 2010
On fixed point sets of distinguished collections for groups of parabolic characteristic Fulltext Access 12 Pages 2010
Constructions of new orthogonal arrays and covering arrays of strength three Fulltext Access 12 Pages 2010
Generating restricted classes of involutions, Bell and Stirling permutations Fulltext Access 12 Pages 2010
The bridge-connectivity augmentation problem with a partition constraint Fulltext Access 12 Pages 2010
Succinctness of regular expressions with interleaving, intersection and counting Fulltext Access 12 Pages 2010
Dimension-2 poset competition numbers and dimension-2 poset double competition numbers 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
Feasibility of motion planning on acyclic and strongly connected directed 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
Iterative processes related to Riordan arrays: The reciprocation and the inversion of power series 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
Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring Fulltext Access 12 Pages 2010