Volume 105,
Number 1-3,
October 2000
- André Barbé:
Symmetric patterns in the cellular automaton that generates Pascal's triangle modulo 2.
1-38
- Andreas Brandstädt, Feodor F. Dragan, Van Bang Le, Thomas Szymczak:
On stable cutsets in graphs.
39-50
- Rainer E. Burkard, Eranda Çela, Helidon Dollani:
2-Medians in trees with pos/neg weights.
51-71
- Peter Butkovic:
Simple image set of (max, +) linear mappings.
73-86
- J. Cel:
On extendibility of voltage and current regimes from subnetworks.
87-97
- Gary Chartrand, Linda Eroh, Mark A. Johnson, Ortrud Oellermann:
Resolvability in graphs and the metric dimension of a graph.
99-113
- Han Hyuk Cho, Suh-Ryung Kim, Yunsun Nam:
The m-step competition graph of a digraph.
115-127
- Zhaohui Liu, Wenci Yu:
Scheduling one batch processor subject to job release dates.
129-136
- Changhong Lu, Juming Xu, Kemin Zhang:
On (d, 2)-dominating numbers of binary undirected de Bruijn graphs.
137-145
- Charles Semple, Mike A. Steel:
A supertree method for rooted trees.
147-158
- Jia-Yu Shao, Zhi-Xiang Hu:
Characterizations of some classes of strong sign nonsingular digraphs.
159-172
- Gerard Sierksma, Ruud H. Teunter:
Partial monotonizations of Hamiltonian cycle polytopes: dimensions and diameters.
173-182
- Hong-Yeop Song, June Bok Lee:
On (n, k)-sequences.
183-192
- Zhi-Hong Sun:
Congruences concerning Bernoulli numbers and Bernoulli polynomials.
193-223
- J. M. Szucs, D. J. Klein:
Regular affine tilings and regular maps on a flat torus.
225-237
- Dimitrios M. Thilikos:
Algorithms and obstructions for linear-width and related search parameters.
239-271
- Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang:
Approximation algorithms for the shortest total path length spanning tree problem.
273-289
- Heping Zhang, Fuji Zhang:
Plane elementary bipartite graphs.
291-311
Copyright © Fri Dec 4 20:29:18 2009
by Michael Ley (ley@uni-trier.de)
