Volume 103,
Number 1-3,
July 2000
- Nesrine Abbas, Lorna K. Stewart:
Biconvex graphs: ordering and algorithms.
1-19
- Philippe Baptiste:
Scheduling equal-length jobs on identical parallel machines.
21-32
- Jesús Mario Bilbao, Paul H. Edelman:
The Shapley value on convex geometries.
33-40
- Elias Dahlhaus, Peter Horák, Mirka Miller, Joseph F. Ryan:
The train marshalling problem.
41-54
- Peter Eades, Antonios Symvonis, Sue Whitesides:
Three-dimensional orthogonal graph drawing algorithms.
55-87
- Fritz von Haeseler, Heinz-Otto Peitgen, Guentcho Skordev:
On the fractal structure of the rescaled evolution set of Carlitz sequences of polynomials.
89-109
- Ariel Halpert, Flórián Lengyel, János Pach:
Cellular telephone networks and random maps in hypergraphs.
111-126
- Steven B. Horton, R. Gary Parker, Richard B. Borie:
On minimum cuts and the linear arrangement problem.
127-139
- D. Frank Hsu, Xiao-Dong Hu:
On shortest three-edge-connected Steiner networks with Euclidean distance.
141-152
- Lucian Ilie, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa:
On strongly context-free languages.
153-165
- Monika Molnárová, Ján Pribis:
Matrix period in max-algebra.
167-175
- Jeffrey L. Poet, Bryan L. Shader:
Score certificate numbers of upset tournaments.
177-189
- Fred S. Roberts, Li Sheng:
Phylogeny numbers for graphs with two triangles.
191-207
- H. Edwin Romeijn, Dolores Romero Morales:
A class of greedy algorithms for the generalized assignment problem.
209-235
- Martin Sauerhoff, Ingo Wegener, Ralph Werchner:
Optimal ordered binary decision diagrams for read-once formulas.
237-258
- Wenxun Xing, Jiawei Zhang:
Parallel machine scheduling with splitting jobs.
259-269
- Mordecai Avriel, Michal Penn, Naomi Shpirer:
Container ship stowage problem: complexity and connection to the coloring of circle graphs.
271-279
- Gerard J. Chang, Bor-Liang Chen, Hung-Lin Fu, Kuo-Ching Huang:
Linear k-arboricities on trees.
281-287
- William Duckworth, Michele Zito:
Sparse Hypercube 3-spanners.
289-295
- Samir Khuller, Azriel Rosenfeld, Angela Y. Wu:
Centers of sets of pixels.
297-306
- Dongsoo S. Kim, Ding-Zhu Du, Panos M. Pardalos:
A coloring problem on the n-cube.
307-311
Copyright © Sat Nov 28 22:27:55 2009
by Michael Ley (ley@uni-trier.de)
