Journal: Discrete Applied Mathematics

Volume 41, Issue 3

185 -- 201E. Andrew Boyd. Polyhedral Results for the Precedence-Constrained Knapsack Problem
203 -- 209John V. Franco. On the Occurrence of Null Clauses in Random Instances of Satisfiability
211 -- 222Chung-Yee Lee, Surya Danusaputro Liman. Capacitated Two-Parallel Machines Scheduling to Minimize Sum of Job Completion Times
223 -- 233Sheelagh Lloyd. Balance, Uncorrelatedness and the Strict Avalanche Criterion
235 -- 243Kyle Siegrist, Ashok T. Amin, Peter J. Slater. The Optimal Unicyclic Graphs for Pair-Connected Reliability
245 -- 261Mike A. Steel. Distributions on Bicoloured Binary Trees Arising from the Principle of Parsimony
263 -- 267Huishan Zhou. The Chromatic Difference Sequence of the Cartesian Product of Graphs: Part II
269 -- 270Judit Csima, László Lovász. Dating to Marriage
271 -- 274Arto Salomaa. Simple Reductions Between ::::D::::0::::L:::: Language and Sequence Equivalence Problems

Volume 41, Issue 2

85 -- 120Karel Culik II, Simant Dube. Rational and Affine Expressions for Image Description
121 -- 129Caterina De Simone, Antonio Sassano. Stability Number of Bull- and Chair-Free Graphs
131 -- 137Jutta Eusterbrock. Errata to Selecting the Top Three Elements by M. Aigner: A Result of a Computer-Assisted Proof Search
139 -- 146Frieda Granot, Jadranka Skorin-Kapov. On Polynomial Solvability of the High Multiplicity Total Weighted Tardiness Problem
147 -- 164Ephraim Korach, Ady Tal. General Vertex Disjoint Paths in Series-Parallel Graphs
165 -- 171Neal Brand, Stephen M. Curran, Sajal K. Das, Tom Jacob. Probability of Diameter Two for Steinhaus Graphs
173 -- 178Gábor Galambos, J. B. G. Frenk. A Simple Proof of Liang s Lower Bound for On-Line bin Packing and the Extension to the Parametric Case
179 -- 180Alberto Apostolico, Mikhail J. Atallah, Susanne E. Hambrusch. New Clique and Independent Set Algorithms for Circle Graphs (Discrete Applied Mathematics 36 (1992) 1-24)

Volume 41, Issue 1

1 -- 11Richard J. Nowakowski. Search ans Sweep Numbers of Finite Directed Acyclic Graphs
13 -- 53Randy Shull, Alan Shuchat, James B. Orlin, Marianne Lepp. Recognizing Hidden Bicircular Networks
55 -- 68Frank W. Sinden. Coloring Drawings of Bipartite Graphs: A Problem in Automated Assembly
69 -- 74Tadashi Arai, Shuichi Ueno, Yoji Kajitani. Generalization of aTheorem on the Parametric Maximum Flow Problem
75 -- 79Jørgen Bang-Jensen, Pavol Hell. Fast Algorithms for Finding Hamiltonian Paths and Cycles in In-Tournament Digraphs