Characterization and recognition of some opposition and coalition graph classes Fulltext Access 12 Pages 2017
Partitioning the vertices of a cubic graph into two total dominating sets Fulltext Access 12 Pages 2017
Algorithmic complexity of weakly semiregular partitioning and the representation number 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
On bipartite distance-regular graphs with exactly one non-thin T-module with endpoint two Fulltext Access 13 Pages 2017
Finite generating sets for reversible gate sets under general conservation laws Fulltext Access 13 Pages 2017
Maintaining balanced trees for structured distributed streaming systems Fulltext Access 13 Pages 2017
The numbers of repeated palindromes in the Fibonacci and Tribonacci words 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
Threshold-coloring and unit-cube contact representation of planar graphs Fulltext Access 13 Pages 2017
Characterizations of Various Continuities of Posets Via Approximated Elements Fulltext Access 13 Pages 2017
Complexity of a problem concerning reset words for Eulerian binary automata Fulltext Access 13 Pages 2017
Parikh-reducing Church-Rosser representations for some classes of regular languages Fulltext Access 14 Pages 2017
A simple arithmetic criterion for graphs being determined by their generalized spectra Fulltext Access 14 Pages 2017
In-place algorithms for exact and approximate shortest unique substring problems Fulltext Access 14 Pages 2017
Axiomatic characterization of the center function. The case of universal axioms Fulltext Access 14 Pages 2017
Space-time trade-offs for finding shortest unique substrings and maximal unique matches Fulltext Access 14 Pages 2017
Partitioning a triangle-free planar graph into a forest and a forest of bounded degree Fulltext Access 14 Pages 2017
Identifying codes for infinite triangular grids with a finite number of rows Fulltext Access 14 Pages 2017
Constructions and nonexistence results for suitable sets of permutations Fulltext Access 14 Pages 2017
Mechanism design for aggregating energy consumption and quality of service in speed scaling scheduling Fulltext Access 14 Pages 2017
Separating sets of strings by finding matching patterns is almost always hard Fulltext Access 14 Pages 2017