Journal: Discrete Applied Mathematics

Volume 58, Issue 3

213 -- 222Amotz Bar-Noy, Shlomo Kipnis, Baruch Schieber. optimal Computation of Census Functions in the Postal Model
223 -- 237Karel Culik II, Ivan Fris. Weighted Finite Transducers in Image Processing
239 -- 252Kenneth Keeler, Jeffery Westbrook. Short Encodings of Planar Graphs and Maps
253 -- 280Zhen Liu, Eric Sanlaville. Preemptive Scheduling with Variable Profile, Precedence Constraints and Due Dates
281 -- 291King-Tim Mak, Andrew J. Morton. Distances Between Traveling Salesman Tours
293 -- 297Xueliang Li, Ivan Gutman. A Unified Approach to the First Derivatives of Graph Polynomials

Volume 58, Issue 2

97 -- 109Wolfgang W. Bein, Peter Brucker, James K. Park, Pramod K. Pathak. A Monge Property for the D-dimensional Transportation Problem
111 -- 116Katarína Cechlárová. Trapezoidal Matrices and the Bottleneck Assignment Problem
117 -- 144Ulrich Faigle, Noud Gademann, Walter Kern. A Random Polynomial Time Algorithm for Well-rounding Convex Bodies
145 -- 156Bernd Jurisch. Lower Bounds for the Job-shop Scheduling Problem on Multi-purpose Machines
157 -- 168Wieslaw Kubiak. New Results on the Completion Time Variance Minimization
169 -- 190Yuri N. Sotskov, V. K. Leontev, Evgenii N. Gordeev. Some Concepts of Stability Analysis in Combinatorial optimization
191 -- 211Frank Werner, Andreas Winkler. Insertion Techniques for the Heuristic Solution of the Job Shop Problem

Volume 58, Issue 1

1 -- 11Francesc Comellas, Miguel Angel Fiol. Vertex-symmetric Digraphs with Small Diameter
13 -- 17Ulrich Faigle, Willem M. Nawijn. Note on Scheduling Intervals on-line
19 -- 33Kenneth O. Kortanek, Maretsugu Yamasaki. Discrete Infinite Transportation Problems
35 -- 66Laura A. Sanchis. Generating Hard and Diverse Test Sets for NP-hard Graph Problems
67 -- 78Patrick Solé. Expanding and Forwarding
79 -- 84Boris Spieker. The Set of Super-stable Marriages Forms a Distributive Lattice
85 -- 89Imrich Vrto. Two Remarks on Expanding and Forwarding By P. Solé
91 -- 94Tomomi Matsui. The Minimum Spanning Tree Problem on a Planar Graph