Volume 156, Number 1, January 2008
: Longest alternating subsequences of k-ary words.
Volume 156, Number 2, January 2008
Computational Methods for Graph Coloring and it's Generalizations
Steven David Prestwich
: Generalised graph colouring by a hybrid of local search and constraint programming.
Allen Van Gelder
: Another look at graph coloring via propositional satisfiability.
Volume 156, Number 3, February 2008
Combinatorial Optimization 2004, CO2004
Volume 156, Number 4, February 2008
Third Haifa Workshop on Interdisciplinary Applications of Graph Theory, Combinatorics & Algorithm
, Tal Raviv
: A polynomial time algorithm for solving a quality control station configuration problem.
Vladimir R. Rosenfeld
: The circuit polynomial of the restricted rooted product G(Gamma) of graphs with a bipartite core G.
Volume 156, Number 5, March 2008
: An upper bound on the independence number of benzenoid systems.
: P3-equicoverable graphs - Research on H-equicoverable graphs.
: Maximum weight edge-constrained matchings.
: Weighted lattice polynomials of independent random variables.
K. L. Ng
, P. Raff
: A generalization of the firefighter problem on Z×Z.
: Mutual exclusion scheduling with interval graphs or related classes. Part II.
Volume 156, Number 6, March 2008
Discrete Mathematics and Data Mining II - DM & DM II
: Extended resolution simulates binary decision diagrams.
: Aspects of discrete mathematics and probability in the theory of machine learning.
: On the complexity of constrained VC-classes.
: Heyting algebras with Boolean operators for rough sets and information retrieval applications.
Volume 156, Number 7, April 2008
GRACO 2005 - 2nd Brazilian Symposium on Graphs, Algorithms and Combinatorics
: Edge-splittings preserving local edge-connectivity of graphs.
: A distributional study of the path edge-covering numbers for random trees.
Volume 156, Number 8, April 2008
Ordinal and Symbolic Data Analysis - OSDA 2003, Ordinal and Symbolic Data Analysis Conference
: Systems of sets such that each set properly intersects at most one other set - Application to cluster analysis.
: The 22 minimal dichotomy decompositions of the K5-distance.
Volume 156, Number 9, May 2008
General Theory of Information Transfer and Combinatorics
: The edge-diametric theorem in Hamming spaces.
: Size of downsets in the pushing order and a problem of Berlekamp.
Volume 156, Number 10, May 2008
, Yi Cao
: Digraph searching, directed vertex separation and directed pathwidth.
: Graph parameters measuring neighbourhoods in graphs - Bounds and applications.
: Facet defining inequalities among graph invariants: The system GraPHedron.
: On the complexity of the multicut problem in bounded tree-width graphs and digraphs.
Volume 156, Number 11, June 2008
In Memory of Leonid Khachiyan (1952 - 2005 )
, Yuri Levin
: The Newton Bracketing method for the minimization of convex functions subject to affine constraints.
: Parabolic target space and primal-dual interior-point methods.
Khaled M. Elbassioni
: On the complexity of monotone dualization and generating minimal hypergraph transversals.
Volume 156, Number 12, June 2008
, Leizhen Cai
: Labelling planar graphs without 4-cycles with a condition on distance two.
: Expected number of breakpoints after t random reversals in genomes with duplicate genes.
: Distance with generalized neighbourhood sequences in n D and infinity D.
: On a Riemann hypothesis analogue for selfdual weight enumerators of genus less than 3.
Volume 156, Number 13, July 2008
Fifth International Conference on Graphs and Optimization - GO V, 2006, Graphs and Optimization, 5th Conference
: A pseudo-Boolean consensus approach to nonlinear 0-1 optimization.
: Identical part production in cyclic robotic cells: Concepts, overview and open questions.
Volume 156, Number 14, July 2008
: On the minimal energy ordering of trees with perfect matchings.
: The extremal values of the Wiener index of a tree with given degree sequence.
, Jianxing Yin
: Constructions of optimal GDRP(n, lambda;v)'s of type lambda1µm-1.
: Constrained versions of Sauer's lemma.
: Solving some NP-complete problems using split decomposition.
Volume 156, Number 15, August 2008
: A distance-labelling problem for hypercubes.
W. C. Shiu
: Extremal Hosoya index and Merrifield-Simmons index of hexagonal spiders.
: Jordan canonical form of Pascal-type matrices via sequences of binomial type.
Volume 156, Number 16, September 2008
Volume 156, Number 17, October 2008
: Parameterized algorithmics for linear arrangement problems.
, Britta Peis
: On a relation between the domination number and a strongly connected bidirection of an undirected graph.
: Preemptive scheduling and antichain polyhedra.
: Efficiency in exponential time for domination-type problems.
: An efficient algorithm for the three-guard problem.
: Constructions for normal graphs and some consequences.
Volume 156, Number 18, November 2008
: An efficient distributed algorithm for canonical labeling on directed split-stars.
: The complexity of a minimum reload cost diameter problem.