Volume 34,
Number 1,
August 1999
- Maw-Shang Chang, Sheng-Lung Peng, Jenn-Liang Liaw:
Deferred-query: An efficient approach for some problems on interval graphs.
1-10
- Lior Shabtay, Adrian Segall:
On the memory overhead of distributed snapshots.
11-17
- Giri Kumar Tayi, Daniel J. Rosenkrantz, S. S. Ravi:
Path problems in networks with vector-valued edge weights.
19-35
- Tamar Eilam, Shlomo Moran, Shmuel Zaks:
Lower bounds for linear interval routing.
37-46
- Michele Flammini:
Deadlock-free interval routing schemes.
47-60
- J. Gómez, M. Escudero:
Optimal edge coloring of large graphs.
61-65
- Priyalal Kulasinghe, Saïd Bettayeb:
An optimal algorithm for layered wheel floorplan designs.
67-72
- Shlomi Dolev, Michael Kate, Jennifer L. Welch:
A competitive analysis for retransmission timeout.
73-80
Volume 34,
Number 2,
September 1999
- Hoàng-Oanh Le, Van Bang Le:
Optimal tree 3-spanners in directed path graphs.
81-87
- Eleni Hadjiconstantinou, Nicos Christofides:
An efficient implementation of an algorithm for finding K shortest simple paths.
88-101
- Dimitris Bertsimas, Chung-Piaw Teo, Rakesh Vohra:
Analysis of LP relaxations for multiway and multicut problems.
102-114
- Gary Chartrand, Weizhen Gu, Michelle Schultz, Steven J. Winters:
Eccentric graphs.
115-121
- Tsutomu Anazawa, Takayuki Kodera, Masakazu Jimbo:
Optimum requirement spanning trees and reliability of tree networks.
122-131
- Tsutomu Anazawa:
On a condition for obtaining an explicit solution of optimum requirement spanning tree.
132-135
- Jessen T. Havill, Weizhen Mao:
Greedy online algorithms for routing permanent virtual circuits.
136-153
- J. Gómez, Ignacio M. Pelayo, Camino Balbuena:
New large graphs with given degree and diameter six.
154-161
- Michel Gendreau, Jean-Francois Larochelle, Brunilde Sansò:
A tabu search heuristic for the Steiner Tree Problem.
162-172
Volume 34,
Number 3,
October 1999
- Robert S. Garfinkel, Ian R. Webb:
On crossings, the Crossing Postman Problem, and the Rural Postman Problem.
173-180
- Cees Duin, Stefan Voß:
The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs.
181-191
- Sheshayya A. Choudum, N. Priya:
Tenacity of complete graph products and grids.
192-196
- Angeles Carmona, Josep Fàbrega:
On the superconnectivity and the conditional diameter of graphs and digraphs.
197-205
- Evangelos Kranakis, Andrzej Pelc, Anthony Spatharis:
Optimal adaptive fault diagnosis for simple multiprocessor systems.
206-214
- Robert F. Easley, David Hartvigsen:
Crossing properties of multiterminal cuts.
215-220
- Masafumi Yamashita, Tsunehiko Kameda:
Modeling K-coteries by well-covered graphs.
221-228
- Andreas T. Ernst, Mohan Krishnamoorthy, Robert H. Storer:
Heuristic and exact algorithms for scheduling aircraft landings.
229-241
Volume 34,
Number 4,
December 1999
Special Issue:
Centrality Concepts in Network Location
- Peter J. Slater:
A survey of sequences of central subgraphs.
244-249
- S. Louis Hakimi, Martine Labbé, Edward F. Schmeichel:
Locations on time-varying networks.
250-257
- Ortrud Oellermann:
On Steiner centers and Steiner medians of graphs.
258-263
- K. Brooks Reid:
Balance vertices in trees.
264-271
- Juhani Nieminen, Matti Peltola:
The subtree center of a tree.
272-278
- Karen Klemm, Steven J. Winters:
Properties of edge-deleted distance stable graphs.
279-282
- Stefan Nickel, Justo Puerto:
A unified approach to network location problems.
283-290
- Gianpaolo Ghiani, Gilbert Laporte:
Eulerian location problems.
291-302
- Christian Smart, Peter J. Slater:
Center, median, and centroid subgraphs.
303-311
- Peter Dankelmann, Wayne Goddard, Michael A. Henning, Henda C. Swart:
Generalized eccentricity, radius, and diameter in graphs.
312-319
Last update Tue Feb 14 04:21:45 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
