Clusters, generating functions and asymptotics for consecutive patterns in permutations Fulltext Access 24 Pages 2012
The two-sided infinite extension of the Mallows model for random permutations Fulltext Access 25 Pages 2012
On Frobenius incidence varieties of linear subspaces over finite fields Fulltext Access 25 Pages 2012
Bounded fractionality of the multiflow feasibility problem for demand graph K3+K3 and related maximization problems Fulltext Access 25 Pages 2012
Distributive lattices, affine semigroups, and branching rules of the classical groups Fulltext Access 26 Pages 2012
Split decomposition and graph-labelled trees: Characterizations and fully dynamic algorithms for totally decomposable graphs Fulltext Access 26 Pages 2012
The locally 2-arc transitive graphs admitting an almost simple group of Suzuki type Fulltext Access 28 Pages 2012
Logarithms of iteration matrices, and proof of a conjecture by Shadrin and Zvonkine Fulltext Access 28 Pages 2012
A superlinear bound on the number of perfect matchings in cubic bridgeless graphs Fulltext Access 32 Pages 2012
Formal Relationships Between Geometrical and Classical Models for Concurrency Fulltext Access 33 Pages 2012
On the weighted enumeration of alternating sign matrices and descending plane partitions Fulltext Access 33 Pages 2012
A numerical algorithm for zero counting. III: Randomization and condition Fulltext Access 34 Pages 2012
Stationary distribution and cover time of random walks on random digraphs Fulltext Access 34 Pages 2012
Quadratic forms of codimension 2 over finite fields containing F4 and Artin–Schreier type curves Fulltext Access 38 Pages 2012
Groups, graphs, languages, automata, games and second-order monadic logic Fulltext Access 39 Pages 2012
Eulerian quasisymmetric functions for the type B Coxeter group and other wreath product groups Fulltext Access 41 Pages 2012
Algorithms for combinatorial structures: Well-founded systems and Newton iterations Fulltext Access 63 Pages 2012
An O(N2)O(N2)-time algorithm for the stochastic uncapacitated lot-sizing problem with random lead times Fulltext Access 4 Pages 2011
An approximation algorithm for the kk-Level Concentrator Location Problem Fulltext Access 4 Pages 2011
NoteOn a lower bound for the connectivity of the independence complex of a graph Fulltext Access 4 Pages 2011
NoteOn the maximum number of edges in a hypergraph with a unique perfect matching Fulltext Access 4 Pages 2011
A note on equilibria for two-tier supply chains with a single manufacturer and multiple retailers Fulltext Access 4 Pages 2011
Integer-empty polytopes in the 0/1-cube with maximal Gomory–Chvátal rank Fulltext Access 4 Pages 2011
On G-locally primitive graphs of locally Twisted Wreath type and a conjecture of Weiss Fulltext Access 4 Pages 2011
Stable decompositions for some symmetric group characters arising in braid group cohomology Fulltext Access 4 Pages 2011
Two-stage minimax regret robust uncapacitated lot-sizing problems with demand uncertainty Fulltext Access 4 Pages 2011
Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery Fulltext Access 4 Pages 2011