Minimizing the total weighted completion time of fully parallel jobs with integer parallel units Fulltext Access 7 Pages 2013
Total colorings of planar graphs with maximum degree 8 and without 5-cycles with two chords Fulltext Access 8 Pages 2013
Infinite ternary square-free words concatenated from permutations of a single word Fulltext Access 8 Pages 2013
A (1+ln2)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius Fulltext Access 8 Pages 2013
Approximation algorithms for cutting a convex polyhedron out of a sphere Fulltext Access 8 Pages 2013
Optimizing tree and character compatibility across several phylogenetic trees Fulltext Access 8 Pages 2013
An improved approximation ratio for the jump number problem on interval orders Fulltext Access 8 Pages 2013
Minimum energy multicast/broadcast routing with reception cost in wireless sensor networks Fulltext Access 8 Pages 2013
Algebraic data retrieval algorithms for multi-channel wireless data broadcast Fulltext Access 8 Pages 2013
Total domination and matching numbers in graphs with all vertices in triangles Fulltext Access 8 Pages 2013
A forbidden subgraph characterization of some graph classes using betweenness axioms Fulltext Access 8 Pages 2013
The Path Partition Conjecture is true for some generalizations of tournaments Fulltext Access 8 Pages 2013
Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs Fulltext Access 8 Pages 2013
The acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 4-cycle Fulltext Access 8 Pages 2013
Graph models and their efficient implementation for sparse Jacobian matrix determination Fulltext Access 8 Pages 2013
On the metric dimension, the upper dimension and the resolving number of graphs Fulltext Access 8 Pages 2013
Computing premises of a minimal cover of functional dependencies is intractable Fulltext Access 8 Pages 2013
On the power of permitting features in cooperating context-free array grammar systems Fulltext Access 8 Pages 2013
Proof of the first part of the conjecture of Aouchiche and Hansen about the Randić index Fulltext Access 8 Pages 2013
Asymptotic non-learnability of universal agents with computable horizon functions Fulltext Access 8 Pages 2013
Certain discrete dynamical systems, number systems and related integral self-affine sets Fulltext Access 8 Pages 2013
Morphic characterizations with insertion systems controlled by a context of length one Fulltext Access 8 Pages 2013
Partitioning the arcs of a digraph into a star forest of the underlying graph with prescribed orientation properties Fulltext Access 8 Pages 2013
Online scheduling of simple linear deteriorating jobs to minimize the total general completion time Fulltext Access 8 Pages 2013
Randomized algorithms and upper bounds for multiple domination in graphs and networks Fulltext Access 8 Pages 2013
A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph Fulltext Access 8 Pages 2013