default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 140
Volume 140, Numbers 1-3, 15 May 2004
- Katarína Cechlárová
, Sona Ferková:
The stable crews problem. 1-17 - Hanyuan Deng, Jianer Chen, Qiaoliang Li, Rongheng Li, Qiju Gao:
On the construction of most reliable networks. 19-33 - Mordecai J. Golin, Xuerong Yong, Yuanping Zhang, Li Sheng:
New upper and lower bounds on the channel capacity of read/write isolated memory. 35-48 - Andrew Rechnitzer, Esaias J. Janse van Rensburg:
Exchange relations, Dyck paths and copolymer adsorption. 49-71 - J. Mark Keil, Patrice Belleville:
Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs. 73-89 - Huiqing Liu, Mei Lu, FengFeng Tian:
Neighborhood unions and cyclability of graphs. 91-101 - Hiroshi Nagamochi, Kohei Okada:
A faster 2-approximation algorithm for the minmax p-traveling salesmen problem on a tree. 103-114 - Lata Narayanan, Yihui Tang:
Worst-case analysis of a dynamic channel assignment strategy. 115-141 - Michael A. Henning, Ortrud Oellermann:
The average connectivity of a digraph. 143-153 - Joseph Rabinoff:
Hybrid grids and the Homing Robot. 155-168 - Frank Recker:
Searching in trees. 169-183 - Nir Halman, Arie Tamir:
Continuous bottleneck tree partitioning problems. 185-206 - Jean-Luc Baril, Vincent Vajnovszki:
Gray code for derangements. 207-221 - Andrew Vince:
The integrity of a cubic graph. 223-239 - Marco A. Boschetti:
New lower bounds for the three-dimensional finite bin packing problem. 241-258
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 2025-02-15 00:20 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:
