Volume 157, Number 1, January 2009
: Mutual exclusion scheduling with interval graphs or related classes, Part I.
: Listing minimal edge-covers of intersecting families with applications to connectivity problems.
, Ming-Yi Chiu
: Short correctness proofs for two self-stabilizing algorithms under the distributed daemon model.
Volume 157, Number 2, January 2009
, Heping Zhang
: 2-extendability of toroidal polyhexes and Klein-bottle polyhexes.
, A. Zaghian
: On the combinatorial structure of a class of I shortened Hamming codes and their dual-codes.
: On extremal unicyclic molecular graphs with maximal Hosoya index.
: A comment to: Two classes of edge domination in graphs.
: Order statistics and estimating cardinalities of massive data sets.
Volume 157, Number 3, February 2009
Valentin E. Brimkov
: Formulas for the number of (n-2)-gaps of binary objects in arbitrary dimension.
Volume 157, Number 4, February 2009 Contributions
: Weighted distances based on neighborhood sequences for point-lattices.
Boris A. Romov
: Homogeneous and strictly homogeneous criteria for partial structures.
: Bipartite density of triangle-free subcubic graphs.
H. R. Malonek
, G. Tomaz
: Bernoulli polynomials and Pascal matrices in the context of Clifford analysis.
: A note on the lower bound of centralized radio broadcasting for planar reachability graphs.
: Upper bounds of degree 3 for the probability of the union of events via linear programming.
Volume 157, Number 5, March 2009 Contributions
, Mei Lu
: Bi-cycle extendable through a given set in balanced bipartite graphs.
: Complexity results for minimum sum edge coloring.
: Domain extender for collision resistant hash functions: Improving upon Merkle-Damgård iteration.
: The forcing hull and forcing geodetic numbers of graphs.
Volume 157, Number 6, March 2009
: Ranking hypotheses to minimize the search cost in probabilistic inference models.
Hanif D. Sherali
, Warren P. Adams
: A Reformulation-Linearization Technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions.
Volume 157, Number 7, April 2009 Contributions
, Gerard J. Chang
: The competition number of a graph with exactly h holes, all of which are independent.
: Polynomial reduction of time-space scheduling to time scheduling.
: Approximation algorithms for constrained generalized tree alignment problem.
: Improved book-embeddings of incomplete hypercubes.
: Lower bounds for three algorithms for transversal hypergraph generation.
: Minimum-weight cycle covers and their approximability.
, Ting Chen
: Comparing the Zagreb indices for graphs with small difference between the maximum and minimum degrees.
, Stephen Foster
: Using clausal graphs to determine the computational complexity of k-bounded positive one-in-three SAT.
: A connection between circular colorings and periodic schedules.
Volume 157, Number 8, April 2009 Contributions
: Labeling bipartite permutation graphs with a condition at distance two.
: Disjoint congruence classes and a timetabling application.
: The clique-separator graph for chordal graphs.
: On the NBC-complexes and beta-invariants of abstract convex geometries.
: Norm statistics and the complexity of clustering problems.
: A new characterization of group action-based perfect nonlinearity.
: A simple algorithm for multicuts in planar graphs with outer terminals.
Volume 157, Number 9, May 2009
, Michele Zito
: An analysis of the size of the minimum dominating sets in random recursive trees, using the Cockayne-Goodman-Hedetniemi algorithm.
: Optimal matrix-segmentation by rectangles.
: Online scheduling with general machine cost functions.
: The complexity of minimizing the number of shape matrices subject to minimal beam-on time in multileaf collimator field decomposition with bounded fluence.
, Tomomi Matsui
: An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors.
B. S. Panda
, Anita Das
: Tree 3-spanners in 2-sep directed path graphs: Characterization, recognition, and construction.
: Numerical characterization of n-cube subset partitioning.
Volume 157, Number 10, May 2009
: A scale-free graph model based on bipartite graphs.
Ceren Caner Berkman
, Inci Togan
: The Asian contribution to the Turkish population with respect to the Balkans: Y-chromosome perspective.
Andreas W. M. Dress
: Split decomposition over an abelian group, Part 2: Group-valued split systems with weakly compatible support.
: A refinement of the common cause principle.
Volume 157, Number 11, June 2009 Contributions
: k-strong spanning local tournaments in locally semicomplete digraphs.
, Gena Hahn
: Counting feasible solutions of the traveling salesman problem with pickups and deliveries is #P-complete.
Volume 157, Number 12, June 2009
Volume 157, Number 13, July 2009 Contributions
Johannes H. Hattingh
, Ernst J. Joubert
: An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree.
: The mathematical solution of a cellular automaton model which simulates traffic flow with a slow-to-start effect.
: The signless Laplacian spectral radius of graphs with given degree sequences.
: A note on the minimum bounded edge-partition of a tree.
: Characterizations of competition multigraphs.
Volume 157, Number 14, July 2009 Contributions
, Bo Zhou
: Reciprocal complementary Wiener numbers of trees, unicyclic graphs and bicyclic graphs.
: Decomposing complete edge-chromatic graphs and hypergraphs. Revisited.
: Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution.
Volume 157, Number 15, August 2009 Contributions
, Yahav Nussbaum
: Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs.
: Positive circuits and maximal number of fixed points in discrete dynamical systems.
Volume 157, Number 16, August 2009
, Benedek Nagy
: Path-based distance functions in n-dimensional generalizations of the face- and body-centered cubic grids.
: Global optimization for first order Markov Random Fields with submodular priors.
: A benchmark set for the reconstruction of hv-convex discrete sets.
, Lilian Buzer
: Approximating a real number by a rational number with a limited denominator: A geometric approach.
: Polyhedral approximation and practical convex hull algorithm for certain classes of voxel sets.
Volume 157, Number 17, October 2009
, Shin-ichi Tanigawa
: Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees.
: Approximating the maximum 2- and 3-edge-colorable subgraph problems.
Volume 157, Number 18, November 2009 Contributions
, Zhi-Ying Wen
: The self-affine property of (U, r)-Carlitz sequences of polynomials deciphered in terms of graph directed IFS.