default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete 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 - József Balogh, Béla Bollobás, David Weinreich:
Measures on monotone properties of graphs. 17-36 - Dominique Barth, Paraskevi Fragopoulou, Marie-Claude Heydemann:
Uniform emulations of Cartesian-product and Cayley graphs. 37-54 - Gunnar Brinkmann, Ulrike von Nathusius, A. H. R. Palser:
A constructive enumeration of nanotube cap. 55-71 - Rostislav Caha, Václav Koubek:
Optimal embeddings of odd ladders into a hypercube. 73-102 - Maw-Shang Chang
, Shaur-Ching Wu, Gerard J. Chang, Hong-Gwa Yeh:
Domination in distance-hereditary graphs. 103-113 - Gary Chartrand, John Frederick Fink, Ping Zhang:
Convexity in oriented graphs. 115-126 - 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 - Frank K. Hwang, Wenan Zang:
Group testing and fault detection for replicated files. 231-242 - 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 - Esther M. Arkin, Refael Hassin:
A note on orientations of mixed graphs. 271-278 - 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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-21 20:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
