Journal: Discrete Applied Mathematics

Volume 116, Issue 3

179 -- 191Andrzej Czygrinow. Partitioning problems in dense hypergraphs
193 -- 229Tali Eilam-Tzoreff, Daniel Granot, Frieda Granot, Greys Sosic. The vehicle routing problem with pickups and deliveries on some special graphs
231 -- 242Frank K. Hwang, Wenan Zang. Group testing and fault detection for replicated files
243 -- 260Aristide Mingozzi, Serena Morigi. Partitioning a matrix with non-guillotine cuts to minimize the maximum cos
261 -- 269Aleksander Vesel. Recognizing pseudo-median graphs
271 -- 278Esther M. Arkin, Refael Hassin. A note on orientations of mixed graphs
279 -- 287Katarína Cechlárová. On the complexity of exchange-stable roommates
289 -- 296Joan Gimbert, Yaokun Wu. The underlying line digraph structure of some (0, 1)-matrix equations
297 -- 305Juha Honkala. On infinite words generated by polynomial D0L systems. Juha Honkala

Volume 116, Issue 1-2

1 -- 15R. Julian R. Abel, Frank E. Bennett, Gennian Ge. Almost resolvable perfect Mendelsohn designs with block size five
17 -- 36József Balogh, Béla Bollobás, David Weinreich. Measures on monotone properties of graphs
37 -- 54Dominique Barth, Paraskevi Fragopoulou, Marie-Claude Heydemann. Uniform emulations of Cartesian-product and Cayley graphs
55 -- 71Gunnar Brinkmann, U. von Nathusius, A. H. R. Palser. A constructive enumeration of nanotube cap
73 -- 102Rostislav Caha, Václav Koubek. Optimal embeddings of odd ladders into a hypercube
103 -- 113Maw-Shang Chang, Shaur-Ching Wu, Gerard J. Chang, Hong-Gwa Yeh. Domination in distance-hereditary graphs
115 -- 126Gary Chartrand, John Frederick Fink, Ping Zhang. Convexity in oriented graphs
127 -- 143Elias Dahlhaus. Minimal elimination ordering for graphs of bounded degree
145 -- 159Peter Dankelmann, Wayne Goddard, Ortrud Oellermann, Henda C. Swart. Augmenting trees so that every three vertices lie on a cycle
161 -- 177Carlos Eduardo Ferreira, C. Carvalho de Souza, Yoshiko Wakabayashi. Rearrangement of DNA fragments: a branch-and-cut algorithm