Discrete Applied Mathematics, Volume 100

Volume 100, Number 1-2, March 2000

• Amotz Bar-Noy, Shlomo Kipnis, Baruch Schieber: Optimal multiple message broadcasting in telephone-like communication systems. 1-15
• Mauro Dell'Amico, Paolo Toth: Algorithms and codes for dense assignment problems: the state of the art. 17-48
• Martin Gavalec: Computing orbit period in max-min algebra. 49-65
• Daniel Granot, Frieda Granot, W. R. Zhu: Naturally submodular digraphs and forbidden digraph configurations. 67-84
• Tomas Kovacs, Andrzej Lingas: Maximum packing for biconnected outerplanar graphs. 85-94
• Mauricio G. C. Resende, Leonidas S. Pitsoulis, Panos M. Pardalos: Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP. 95-113

• David Damanik: Local symmetries in the period-doubling sequence. 115-121
• Satoru Fujishige: A laminarity property of the polyhedron described by a weakly posi-modular set function. 123-126
• Svetlana A. Kravchenko: On the complexity of minimizing the number of late jobs in unit time open shop. 127-132
• Chung-Yee Lee, Yong He, Guochun Tang: A note on "parallel machine scheduling with non-simultaneous machine available time". 133-135
• Juan José Salazar: A note on the generalized steiner tree polytope. 137-144

Volume 100, Number 3, March 2000

• Gerard J. Chang, Xuding Zhu: Pseudo-Hamiltonian-connected graphs. 145-153
• Rodney G. Downey, Michael R. Fellows, Venkatesh Raman: The complexity of irredundant sets parameterized by size. 155-167
• Qian-Ping Gu, Hisao Tamaki: Multicolor routing in the undirected hypercube. 169-181
• Venkatesan Guruswami, C. Pandu Rangan: Algorithmic aspects of clique-transversal and clique-independent sets. 183-202
• Joseph Naor, Ariel Orda, Yael Petruschka: Dynamic storage allocation with known durations. 203-213
• Thomas Raschle, Klaus Simon: On the P4-components of graphs. 215-235