A generalization of Opsut’s result on the competition numbers of line graphs Fulltext Access 8 Pages 2015
The Horn renamability, q-Horn and SLUR threshold for random kk-CNF formulas Fulltext Access 8 Pages 2015
A characterization of P5P5-free graphs with a homeomorphically irreducible spanning tree Fulltext Access 8 Pages 2015
The minimum number of minimal codewords in an [n,k][n,k]-code and in graphic codes Fulltext Access 8 Pages 2015
Computational complexity of minimum P4P4 vertex cover problem for regular and K1,4K1,4-free graphs Fulltext Access 8 Pages 2015
Exact evaluation and optimization of the (R,nT)(R,nT) policy for a two-stage serial inventory system Fulltext Access 8 Pages 2015
Combinatorial algorithms with performance guarantees for finding several Hamiltonian circuits in a complete directed weighted graph Fulltext Access 8 Pages 2015
A complete characterization of the (m,n)(m,n)-cubes and combinatorial applications in imaging, vision and discrete geometry Fulltext Access 9 Pages 2015
Near-linear-time deterministic plane Steiner spanners for well-spaced point sets Fulltext Access 9 Pages 2015
Weight-constrained and density-constrained paths in a tree: Enumerating, counting, and kk-maximum density paths Fulltext Access 9 Pages 2015
Orbits of rotor-router operation and stationary distribution of random walks on directed graphs Fulltext Access 9 Pages 2015
A complete classification of the (154203)-configurations with at least three K5-graphs Fulltext Access 9 Pages 2015
Chip-firing games on Eulerian digraphs and NP-hardness of computing the rank of a divisor on a graph Fulltext Access 9 Pages 2015
Charm bracelets and their application to the construction of periodic Golay pairs Fulltext Access 9 Pages 2015
A discrete isodiametric result: The Erdős–Ko–Rado theorem for multisets Fulltext Access 10 Pages 2015
The bipartite unconstrained 0–1 quadratic programming problem: Polynomially solvable cases Fulltext Access 10 Pages 2015
Resistance distance and Kirchhoff index of RR-vertex join and RR-edge join of two graphs Fulltext Access 10 Pages 2015
On the spectral radius of simple digraphs with prescribed number of arcs Fulltext Access 10 Pages 2015
Relationship between ordered semihypergroups and ordered semigroups by using pseudoorder Fulltext Access 10 Pages 2015
Minimal proper non-IRUP instances of the one-dimensional cutting stock problem Fulltext Access 10 Pages 2015
Enumerations of humps and peaks in (k,a)-paths and (n,m)-Dyck paths via bijective proofs Fulltext Access 10 Pages 2015
An improved approximation algorithm for the partial-terminal Steiner tree problem with edge cost 1 or 2 Fulltext Access 10 Pages 2015
On the number of L-shapes in embedding dimension four numerical semigroups Fulltext Access 11 Pages 2015
Nordhaus–Gaddum-type results for the generalized edge-connectivity of graphs Fulltext Access 11 Pages 2015
On the tractability of some natural packing, covering and partitioning problems Fulltext Access 11 Pages 2015
Characterization of the deletion of (26,6)(26,6)-simple points as multivalued (N,26)(N,26)-retractions Fulltext Access 11 Pages 2015
A study of scheduling problems with preemptions on multi-core computers with GPU accelerators Fulltext Access 11 Pages 2015
Computing the L1L1 geodesic diameter and center of a simple polygon in linear time Fulltext Access 11 Pages 2015