Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNetworks, Volume 32
Volume 32, Number 1, August 1998
- Jean-Claude König, David W. Krumme, Emmanuel Lazard:
Diameter-preserving orientations of the torus. 1-11 - Ewa Malesinska, Steffen Piskorz, Gerhard Weißenfels:
On the chromatic number of disk graphs. 13-22 - Ming-Yang Su, Gen-Huey Chen, Dyi-Rong Duh:
Topological properties of incomplete WK-recursive networks. 23-45 - Ralf Klasing, Reinhard Lüling, Burkhard Monien:
Compressing cube-connected cycles and butterfly networks. 47-65 - Raanan Manor, Michal Penn:
An extended planar algorithm for maximum integral two-flow. 67-76
Volume 32, Number 2, September 1998
- Yiu Kwok Tham:
Routing in asymmetrical multiconnection three-stage Clos networks. 77-83 - Alf Kimms, Andreas Drexl:
Proportional lot sizing and scheduling: Some extensions. 85-101 - Lata Narayanan, Sunil M. Shende:
Partial characterizations of networks supporting shortest path interval labeling schemes. 103-113 - Ronald I. Becker, Isabella Lari, Mario Lucertini, Bruno Simeone:
Max-min partitioning of grid graphs into connected components. 115-125 - Hans-Jürgen Bandelt, Victor Chepoi:
Embedding into the rectilinear grid. 127-132 - D. Frank Hsu, Xiao-Dong Hu:
On shortest two-connected Steiner networks with Euclidean distance. 133-140 - Byung-Wook Wie, Roger L. Tobin:
On the relationship between dynamic Nash and instantaneous user equilibria. 141-163
Volume 32, Number 3, October 1998
- Paola Flocchini, Bernard Mans, Nicola Santoro:
Sense of direction: Definitions, properties, and classes. 165-180 - Toshinori Yamada, Shuichi Ueno:
Fault-tolerant graphs for tori. 181-188 - Andrew B. Kahng, Gabriel Robins, Elizabeth A. Walkup:
How to test a tree. 189-197 - Teresa W. Haynes, Peter J. Slater:
Paired-domination in graphs. 199-206 - Thorsten Koch
, Alexander Martin:
Solving Steiner tree problems in graphs to optimality. 207-232
Volume 32, Number 4, December 1998
- Nicholas G. Hall, Wei-Ping Liu, Jeffrey B. Sidney:
Scheduling in broadcast networks. 233-253 - Arie Tamir, Dionisio Pérez-Brito, José A. Moreno-Pérez:
A polynomial algorithm for the p-centdian problem on a tree. 255-262 - Michel Gendreau, Gilbert Laporte, Frédéric Semet:
A branch-and-cut algorithm for the undirected selective traveling salesman problem. 263-273 - Michael R. Fellows, Pavol Hell, Karen Seyffarth:
Constructions of large planar networks with given degree and diameter. 275-281 - Sönke Hartmann, Andreas Drexl:
Project scheduling with multiple modes: A comparison of exact algorithms. 283-297 - Khee Meng Koh, Eng Guan Tay:
On optimal orientations of Cartesian products of even cycles. 299-306 - Jung-Sing Jwo, Tai-Ching Tuan:
On container length and connectivity in unidirectional hypercubes. 307-317
a service of 
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-04-22 20:02 CEST 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:
