Adjacent vertex distinguishing edge-colorings and total-colorings of the lexicographic product of graphs Fulltext Access 7 Pages 2015
Brooks type results for conflict-free colorings and {a,b}{a,b}-factors in graphs Fulltext Access 7 Pages 2015
Complexity dichotomy for oriented homomorphism of planar graphs with large girth Fulltext Access 7 Pages 2015
Maximum uniformly resolvable decompositions of Kv and KvâI into 3-stars and 3-cycles Fulltext Access 7 Pages 2015
Computing the Tutte polynomial of lattice path matroids using determinantal circuits Fulltext Access 7 Pages 2015
Domination of maximal K4K4-minor free graphs and maximal K2,3K2,3-minor free graphs, and disproofs of two conjectures on planar graphs Fulltext Access 7 Pages 2015
Makespan optimization in a single-machine scheduling problem with dynamic job ready times—Complexity and algorithms Fulltext Access 7 Pages 2015
Motion around L4,5L4,5 in the relativistic R3BP with smaller triaxial primary Fulltext Access 8 Pages 2015
Neighbor sum distinguishing total colorings of planar graphs with maximum degree Î Fulltext Access 8 Pages 2015
Semi-online hierarchical load balancing problem with bounded processing times Fulltext Access 8 Pages 2015
Constructing the minimum dominating sets of generalized de Bruijn digraphs Fulltext Access 8 Pages 2015
Parameterized complexity analysis for the Closest String with Wildcards problem Fulltext Access 8 Pages 2015
Five-list-coloring graphs on surfaces I. Two lists of size two in planar graphs Fulltext Access 8 Pages 2015
Uniformly resolvable decompositions of Kv into paths on two, three and four vertices Fulltext Access 8 Pages 2015
Note of the enumeration formula of standard Young tableaux of truncated shape (nm)∖(2)(nm)∖(2) Fulltext Access 8 Pages 2015
Generalized limited packings of some graphs with a limited number of P4P4-partners Fulltext Access 8 Pages 2015
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
Combinatorial algorithms with performance guarantees for finding several Hamiltonian circuits in a complete directed weighted graph Fulltext Access 8 Pages 2015
Improving the HkHk-bound on the price of stability in undirected Shapley network design games Fulltext Access 8 Pages 2015
Charm bracelets and their application to the construction of periodic Golay pairs 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
Chip-firing games on Eulerian digraphs and NP-hardness of computing the rank of a divisor on a graph Fulltext Access 9 Pages 2015
A circular matrix-merging algorithm with application in Volumetric Intensity-Modulated Arc Therapy Fulltext Access 9 Pages 2015
A PTAS for the minimum weight connected vertex cover P3P3 problem on unit disk graphs Fulltext Access 9 Pages 2015
The importance of being proper: (In clustered-level planarity and T-level planarity) Fulltext Access 9 Pages 2015