Discrete Applied Mathematics - researchr journal

183	--	196	Nilotpal Chakravarti. Sensitivity Analysis in Isotonic Regression
197	--	204	János Csirik, J. B. G. Frenk, Martine Labbé. Two-Dimensional Rectangle Packing: On-Line Methods and Results
205	--	220	C. Carvalho de Souza, Celso C. Ribeiro. Heuristics for the Minimum Rectilinear Steiner Tree Problem: New Algorithms and a Computational Study
221	--	232	Ding-Zhu Du, Frank K. Hwang. Competitive Group Testing
233	--	248	Jens Gustedt. On the Pathwidth of Chordal Graphs
249	--	259	Hans Kellerer, Gerhard J. Woeginger. A Tight Bound for 3-Partitioning
261	--	275	Donna Crystal Llewellyn, Jennifer Ryan. A Primal Dual Integer Programming Algorithm
277	--	289	Barry A. Tesman. List ::::T::::-Colorings of Graphs
291	--	312	Stan P. M. van Hoesel, Albert P. M. Wagelmans. Sensitivity Analysis of the Economic Lot-Sizing Problem

93	--	115	Mustafa Akgül. A Genuinely Polynomial Primal Simplex Algorithm for the Assignment Problem
117	--	123	Darko Babic, Ante Graovac. Enumeration of Acyclic Walks in a Graph
125	--	137	Norman J. Finizio. Whist Tournaments - Three Person Property
139	--	159	Michael E. Houle. Algorithms for Weak and Wide Separation of Sets
161	--	168	Jonathan Klimó. On the Minimal Covering of Infinite Sets
169	--	179	Shmuel Wimer, Israel Koren, Israel Cederbaum. On Paths with the Shortest Average Arc Length in Weighted Graphs

1	--	28	Eliezer Agasi, Ronald I. Becker, Yehoshua Perl. A Shifting Algorithm for Constrained min-max Partition on Trees
29	--	49	Jürgen Dassow, Friedhelm Hinz. Decision Problems and Regular Chain Code Picture Languages
51	--	62	James S. Diamond, Alberto O. Mendelzon. Cycle Structure of Edge Labelled Graphs
63	--	70	Patrick Solé, Thomas Zaslavsky. The Covering Radius of the Cycle Code of a Graph
71	--	87	Rob J. M. Vaessens, Emile H. L. Aarts, Jacobus H. van Lint. Genetic Algorithms in Coding Theory - A Table for A::3::(::::n, d::::)

External Links