Volume 158, Number 1, January 2010
Volume 158, Number 2, January 2010
: An upper bound for the competition numbers of graphs.
Volume 158, Number 3, February 2010
: Integral polyhedra related to integer multicommodity flows on a cycle.
Volume 158, Number 4, February 2010
: The Transitive Minimum Manhattan Subnetwork Problem in 3 dimensions.
: minimum dominating set of queens: A trivial programming exercise?
, Eun Jung Kim
: The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops.
Volume 158, Number 5, March 2010
: A note on scheduling identical coupled tasks in logarithmic time.
: Complexity of two coloring problems in cubic planar bipartite mixed graphs.
: Robust network optimization under polyhedral demand uncertainty is NP-hard.
Volume 158, Number 6, March 2010
, Shigeru Masuyama
: A proof of unimodality on the numbers of connected spanning subgraphs in an n-vertex graph with at least ... edges.
, Hongwei Liu
: Modified algorithms for the minimum volume enclosing axis-aligned ellipsoid problem.
, Baogang Xu
: A forbidden subgraph characterization of line-polar bipartite graphs.
, Bolian Liu
: On the kth smallest and kth greatest modified Wiener indices of trees.
, Junjie Lu
: Dimension-2 poset competition numbers and dimension-2 poset double competition numbers.
Subir Kumar Ghosh
: Approximation algorithms for art gallery problems in polygons.
Stephan Dominique Andres
: Erratum to: The incidence game chromatic number [Discrete Appl. Math. 157(9) (2009) 1980-1987].
Volume 158, Number 7, April 2010
: The rank-width of the square grid.
Volume 158, Number 8, April 2010
: A tight bound on the number of mobile servers to guarantee transferability among dominating configurations.
, Gennian Ge
: Combinatorial constructions of fault-tolerant routings with levelled minimum optical indices.
: A note on the hardness of Skolem-type sequences.
Volume 158, Number 9, May 2010
: Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date.
Volume 158, Number 10, May 2010
Dirk Oliver Theis
: A note on the relationship between the graphical traveling salesman polyhedron, the Symmetric Traveling Salesman Polytope, and the metric cone.
: Acute triangulations of trapezoids.
Volume 158, Number 11, June 2010
: An asymptotically optimal lower bound on the OBDD size of the middle bit of multiplication for the pairwise ascending variable order.
Volume 158, Number 12, June 2010
Néstor E. Aguilera
: On packing and covering polyhedra of consecutive ones circulant clutters.
Volume 158, Number 13, July 2010
Volume 158, Number 14, July 2010
: Bounds on the connected k-domination number in graphs.
, Saihua Liu
: 2-resonance of plane bipartite graphs and its applications to boron-nitrogen fullerenes.
Volume 158, Number 15, August 2010
: Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph.
, Zhiyi Tan
: Tighter bounds of the First Fit algorithm for the bin-packing problem.
: Random walks and the effective resistance sum rules.
: Ordering connected graphs having small degree distances.
Volume 158, Number 16, August 2010
: Distance spectral radius of trees with given matching number.
Stephen E. Wright
: Integer matrices with constraints on leading partial row and column sums.
: Complexity of 3-edge-coloring in the class of cubic graphs with a polyhedral embedding in an orientable surface.
Volume 158, Number 17, October 2010
B. S. Panda
, Anita Das
: Tree 3-spanners in 2-sep chordal graphs: Characterization and algorithms.
, Shuchao Li
: Sharp bounds for the Zagreb indices of bicyclic graphs with k-pendant vertices.
: Dynamic list coloring of bipartite graphs.
: Hamiltonicity of 6-connected line graphs.
Volume 158, Number 18, November 2010
: Improving the high order nonlinearity lower bound for Boolean functions with given algebraic immunity.
: Which generalized Randic indices are suitable measures of molecular branching?
: Facet-inducing web and antiweb inequalities for the graph coloring polytope.
: Connectivity of iterated line graphs.