A simple arithmetic criterion for graphs being determined by their generalized spectra Fulltext Access 14 Pages 2017
Constructions and nonexistence results for suitable sets of permutations Fulltext Access 14 Pages 2017
Improved compact formulations for a wide class of graph partitioning problems in sparse graphs Fulltext Access 14 Pages 2017
Identifying codes for infinite triangular grids with a finite number of rows Fulltext Access 14 Pages 2017
Binary quadratic optimization problems that are difficult to solve by conic relaxations 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
Bi-criteria Pareto-scheduling on a single machine with due indices and precedence constraints Fulltext Access 15 Pages 2017
An extended characterization of a class of optimal three-weight cyclic codes over any finite field Fulltext Access 15 Pages 2017
A strongly regular decomposition of the complete graph and its association scheme Fulltext Access 15 Pages 2017
Every planar graph without cycles of length 4 or 9 is (1,1,0)-colorable Fulltext Access 15 Pages 2017
Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs Fulltext Access 15 Pages 2017
Fast maximum weight clique extraction algorithm: Optimal tables for branch-and-bound Fulltext Access 15 Pages 2017
A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph Fulltext Access 15 Pages 2017
Exploring the complexity of the integer image problem in the max-algebra Fulltext Access 15 Pages 2017
Complexity of rainbow vertex connectivity problems for restricted graph classes Fulltext Access 15 Pages 2017
On the generalised colouring numbers of graphs that exclude a fixed minor Fulltext Access 16 Pages 2017
Reconfiguring dominating sets in some well-covered and other classes of graphs Fulltext Access 16 Pages 2017
Virtual machine placement for minimizing connection cost in data center networks Fulltext Access 16 Pages 2017
A linear-time algorithm to compute the triangular hull of a digital object Fulltext Access 16 Pages 2017
The number of completely different optimal identifying codes in the infinite square grid Fulltext Access 16 Pages 2017
The 2-good-neighbor connectivity and 2-good-neighbor diagnosability of bubble-sort star graph networks Fulltext Access 16 Pages 2017
On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs Fulltext Access 16 Pages 2017
Maximizing the overall end-user satisfaction of data broadcast in wireless mesh networks Fulltext Access 16 Pages 2017
Polyhedral results for a class of cardinality constrained submodular minimization problems Fulltext Access 16 Pages 2017
Number of rational branches of a singular plane curve over a finite field Fulltext Access 16 Pages 2017
The Graph Motif problem parameterized by the structure of the input graph Fulltext Access 17 Pages 2017
The role of business insurance in managing a manufacturer's product quality risk Fulltext Access 17 Pages 2017
Decompositions of edge-colored infinite complete graphs into monochromatic paths Fulltext Access 17 Pages 2017
Application of neighborhood sequences in communication of hexagonal networks Fulltext Access 17 Pages 2017