Complexity analyses for multi-agent scheduling problems with a global agent and equal length jobs Fulltext Access 12 Pages 2017
Relating domination, exponential domination, and porous exponential domination Fulltext Access 12 Pages 2017
Characterization and recognition of some opposition and coalition graph classes Fulltext Access 12 Pages 2017
Pentavalent symmetric graphs admitting vertex-transitive non-abelian simple groups Fulltext Access 12 Pages 2017
Partitioning the vertices of a cubic graph into two total dominating sets Fulltext Access 12 Pages 2017
Solving all-pairs shortest path by single-source computations: Theory and practice Fulltext Access 12 Pages 2017
Inverse minimum flow problem under the weighted sum-type Hamming distance Fulltext Access 12 Pages 2017
Improvements to exact Boltzmann sampling using probabilistic divide-and-conquer and the recursive method Fulltext Access 13 Pages 2017
The numbers of repeated palindromes in the Fibonacci and Tribonacci words Fulltext Access 13 Pages 2017
On bipartite distance-regular graphs with exactly one non-thin T-module with endpoint two Fulltext Access 13 Pages 2017
Maintaining balanced trees for structured distributed streaming systems Fulltext Access 13 Pages 2017
A note on convex characters, Fibonacci numbers and exponential-time algorithms Fulltext Access 13 Pages 2017
Minimum size of feedback vertex sets of planar graphs of girth at least five Fulltext Access 13 Pages 2017
Degree sum conditions for vertex-disjoint cycles passing through specified vertices Fulltext Access 13 Pages 2017
Characterizations of Various Continuities of Posets Via Approximated Elements Fulltext Access 13 Pages 2017
Threshold-coloring and unit-cube contact representation of planar graphs Fulltext Access 13 Pages 2017
Word length perturbations in certain symmetric presentations of dihedral groups Fulltext Access 13 Pages 2017
A column generation based algorithm for the robust graph coloring problem Fulltext Access 13 Pages 2017
Improved compact formulations for a wide class of graph partitioning problems in sparse graphs Fulltext Access 14 Pages 2017
Constructions and nonexistence results for suitable sets of permutations Fulltext Access 14 Pages 2017
Binary quadratic optimization problems that are difficult to solve by conic relaxations Fulltext Access 14 Pages 2017
Identifying codes for infinite triangular grids with a finite number of rows Fulltext Access 14 Pages 2017
An optimal algorithm to generate extendable self-avoiding walks in arbitrary dimension Fulltext Access 14 Pages 2017