Discrete Applied Mathematics - researchr journal

93	--	103	J. D. Annan. The Complexities of the Coefficients of the Tutte Polynomial
105	--	120	John R. Birge, Michael A. H. Dempster. Optimal Match-up Strategies in Stochastic Scheduling
121	--	132	Peter Butkovic. Regularity of Matrices in Min-algebra and Its Time- Complexity
133	--	144	Keith Edwards, Colin McDiarmid. The Complexity of Harmonious Colouring for Trees
145	--	165	Kevin D. Glazebrook. Stochastic Scheduling and Forwards Induction
167	--	192	Claire Hanen, Alix Munier. A Study of the Cyclic Scheduling Problem on Parallel Processors
193	--	212	Ludek Kucera. Expected Complexity of Graph Partitioning Problems
213	--	227	Bruce A. Reed. Rooted Routing in the Plane
229	--	241	Eric Sanlaville. Nearly on Line Scheduling of Preemptive Independent Tasks
243	--	253	Nei Yoshihiro Soma, Alan Solon Ivor Zinober, Horacio Hideki Yanasse, Peter John Harley. A Polynomial Approximation Scheme for the Subset Sum Problem
255	--	269	Anand Srivastav, Peter Stangier. Weighted Fractional and Integral K-matching in Hypergraphs

1	--	10	Noga Alon, Joel Spencer, Prasad Tetali. Covering with Latin Transversals
11	--	28	Omer Berkman, Uzi Vishkin. Almost Fully-parallel Parentheses Matching
29	--	44	Elias Dahlhaus. Efficient Parallel Recognition Algorithms of Cographs and Distance Hereditary Graphs
45	--	65	Yakov S. Smetanich, Yakov B. Kazanovich, Vyacheslav V. Kornilov. A Combinatorial Approach to the Problem of Self-assembly
67	--	74	Kirk Pruhs. Using Local Adaptations to Reconfigure a Spanning Tree of a Network
75	--	83	Frank Ruskey, Ming Jiang 0008, Andrew Weston. The Hamiltonicity of Directed sigma - tao Cayley Graphs (or: A Tale of Backtracking)
85	--	90	Andreas S. Schulz. The Permutahedron of Series-parallel Posets

External Links