The acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 4-cycle Fulltext Access 8 Pages 2013
Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs Fulltext Access 8 Pages 2013
Graph models and their efficient implementation for sparse Jacobian matrix determination 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
Randomized algorithms and upper bounds for multiple domination in graphs and networks Fulltext Access 8 Pages 2013
The ordered anti-median problem with distances derived from a strictly convex norm Fulltext Access 8 Pages 2013
Constant time distance queries in planar unweighted graphs with subquadratic preprocessing time 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
On the power of permitting features in cooperating context-free array grammar systems Fulltext Access 8 Pages 2013
Computing premises of a minimal cover of functional dependencies is intractable Fulltext Access 8 Pages 2013
On the metric dimension, the upper dimension and the resolving number of graphs Fulltext Access 8 Pages 2013
Permutations with forbidden patterns and polyominoes on a twisted cylinder of width 3 Fulltext Access 9 Pages 2013
On the non-existence of tight Gaussian 6-designs on two concentric spheres Fulltext Access 9 Pages 2013
Structure of repeated-root constacyclic codes of length 3ps3ps and their duals Fulltext Access 9 Pages 2013
A characterization of the edge connectivity of direct products of graphs Fulltext Access 9 Pages 2013
On the Erdős-Sós conjecture for graphs having no path with k+4k+4 vertices Fulltext Access 9 Pages 2013
Spectra of graphs obtained by a generalization of the join graph operation Fulltext Access 9 Pages 2013
A linear relaxation algorithm for solving the sum-of-linear-ratios problem with lower dimension Fulltext Access 9 Pages 2013
Representing and Comparing Metabolic Pathways as Petri Nets with MPath2PN and CoMeta Fulltext Access 9 Pages 2013
Faster replacement paths algorithms in case of edge or node failure for undirected, positive integer weighted graphs Fulltext Access 9 Pages 2013
Computing a longest common subsequence that is almost increasing on sequences having no repeated elements Fulltext Access 9 Pages 2013
Approximating minimum cost source location problems with local vertex-connectivity demands Fulltext Access 9 Pages 2013
Study of the pedigree polytope and a sufficiency condition for nonadjacency in the tour polytope Fulltext Access 9 Pages 2013
Mean-variance principle of managing cointegrated risky assets and random liabilities Fulltext Access 9 Pages 2013
Covering vertices by a specified number of disjoint cycles, edges and isolated vertices Fulltext Access 9 Pages 2013
Metamorphosis of simple twofold triple systems into maximum twofold (K4âe)-packings Fulltext Access 9 Pages 2013
Polychromatic 4-coloring of cubic even embeddings on the projective plane Fulltext Access 9 Pages 2013
Covering codes and extremal problems from invariant sets under permutations Fulltext Access 9 Pages 2013