Discrete Applied Mathematics, Volume 116
Volume 116, Number 1-2, January 2002
R. Julian R. Abel, Frank E. Bennett, Gennian Ge: Almost resolvable perfect Mendelsohn designs with block size five. 1-15- Dominique Barth, Paraskevi Fragopoulou, Marie-Claude Heydemann: Uniform emulations of Cartesian-product and Cayley graphs. 37-54
- Gunnar Brinkmann, U. von Nathusius, A. H. R. Palser: A constructive enumeration of nanotube cap. 55-71
- Maw-Shang Chang, Shaur-Ching Wu, Gerard J. Chang, Hong-Gwa Yeh: Domination in distance-hereditary graphs. 103-113
- Elias Dahlhaus: Minimal elimination ordering for graphs of bounded degree. 127-143
- Peter Dankelmann, Wayne Goddard, Ortrud Oellermann, Henda C. Swart: Augmenting trees so that every three vertices lie on a cycle. 145-159
- Carlos Eduardo Ferreira, C. Carvalho de Souza, Yoshiko Wakabayashi: Rearrangement of DNA fragments: a branch-and-cut algorithm. 161-177
Volume 116, Number 3, February 2002
- Andrzej Czygrinow: Partitioning problems in dense hypergraphs. 179-191
- Tali Eilam-Tzoreff, Daniel Granot, Frieda Granot, Greys Sosic: The vehicle routing problem with pickups and deliveries on some special graphs. 193-229
- Aristide Mingozzi, Serena Morigi: Partitioning a matrix with non-guillotine cuts to minimize the maximum cos. 243-260
- Aleksander Vesel: Recognizing pseudo-median graphs. 261-269
- Katarína Cechlárová: On the complexity of exchange-stable roommates. 279-287
- Joan Gimbert, Yaokun Wu: The underlying line digraph structure of some (0, 1)-matrix equations. 289-296
- Juha Honkala: On infinite words generated by polynomial D0L systems. Juha Honkala. 297-305
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T203413 by the dblp team