The enumeration of prudent polygons by area and its unusual asymptotics Fulltext Access 30 Pages 2011
A bijection for covered maps, or a shortcut between Harer–Zagierʼs and Jacksonʼs formulas Fulltext Access 31 Pages 2011
Simple connectedness of hyperplane complements in some geometries related to buildings Fulltext Access 31 Pages 2011
Guarding curvilinear art galleries with edge or mobile guards via 2-dominance of triangulation graphs Fulltext Access 32 Pages 2011
Generalized Davenport–Schinzel sequences and their 0–1 matrix counterparts Fulltext Access 33 Pages 2011
Branching rules for symmetric functions and sln basic hypergeometric series Fulltext Access 33 Pages 2011
Longest increasing subsequences, Plancherel-type measure and the Hecke insertion algorithm Fulltext Access 33 Pages 2011
Isotypic decomposition of the cohomology and factorization of the zeta functions of Dwork hypersurfaces Fulltext Access 35 Pages 2011
The excluded minors for the class of matroids that are binary or ternary Fulltext Access 40 Pages 2011
Forbidden substructures and combinatorial dichotomies: WQO and universality Fulltext Access 42 Pages 2011
A cooperative differential game model based on transmission rate in wireless networks Fulltext Access 4 Pages 2010
Optimality of (s,S)(s,S) policies for a stochastic inventory model with proportional and lump-sum shortage costs Fulltext Access 4 Pages 2010
Two proofs of the Bermond–Thomassen conjecture for tournaments with bounded minimum in-degree Fulltext Access 4 Pages 2010
A projective algorithm for preemptive open shop scheduling with two multiprocessor groups Fulltext Access 4 Pages 2010
Almost simple groups with socle Ln(q) acting on Steiner quadruple systems Fulltext Access 4 Pages 2010
Note on the optimality of (s,S)(s,S) policies for inventory systems with two demand classes Fulltext Access 4 Pages 2010
An approximation algorithm for the kk-level stochastic facility location problem Fulltext Access 4 Pages 2010
Solving a class of low rank d.c. programs via a branch and bound approach: A computational experience Fulltext Access 4 Pages 2010
Decomposition of sparse graphs, with application to game coloring number Fulltext Access 4 Pages 2010
Vertex-disjoint directed cycles of prescribed length in tournaments with given minimum out-degree and in-degree Fulltext Access 4 Pages 2010
Integrality gap of the hypergraphic relaxation of Steiner trees: A short proof of a 1.55 upper bound Fulltext Access 4 Pages 2010
Asymptotic behavior for MAP/PH/cc queue with shortest queue discipline and jockeying Fulltext Access 4 Pages 2010
Deviation inequalities for an estimator of the conditional value-at-risk Fulltext Access 4 Pages 2010
Beneficial changes in dependence structures and two-moment decision models Fulltext Access 4 Pages 2010
On graphs whose Laplacian matrix’s multipartite separability is invariant under graph isomorphism Fulltext Access 4 Pages 2010
Hamiltonian cycles through prescribed edges of 4-connected maximal planar graphs Fulltext Access 4 Pages 2010
A PTAS for the chance-constrained knapsack problem with random item sizes Fulltext Access 4 Pages 2010
A conjecture of Neumann-Lara on infinite families of rr-dichromatic circulant tournaments Fulltext Access 4 Pages 2010
A note on vertex-transitive non-Cayley graphs from Cayley graphs generated by involutions Fulltext Access 4 Pages 2010