Volume 115,
Number 1-3,
November 2001
- David Avis, Antoine Deza:
On the binary solitaire cone.
3-14
- Endre Boros, Peter L. Hammer, Federica Ricca, Bruno Simeone:
Combinatorial problems related to origin-destination matrices.
15-36
- András Frank, Tibor Jordán, Zoltán Szigeti:
Combinatorial problems related to origin-destination matrices.
37-47
- Harold N. Gabow, Tibor Jordán:
Bipartition constrained edge-splitting in directed graphs.
49-62
- Hiro Ito, Hideyuki Uehara, Mitsuo Yokoyama:
Lengths of tours and permutations on a vertex set of a convex polygon.
63-71
- Atsushi Kaneko:
Spanning trees with constraints on the leaf degree.
73-76
- Gyula Károlyi, Emo Welzl:
Crossing-free segments and triangles in point configurations.
77-88
- Kenji Kashiwabara:
Subdivisions of integral base polytopes.
89-97
- Gyula Y. Katona:
A large set of non-Hamiltonian graphs.
99-115
- Ton Kloks, Richard B. Tan:
Bandwidth and topological bandwidth of graphs with few P4's.
117-133
- Tetsushi Koide, S. Shinmori, H. Ishii:
Topological optimization with a network reliability constraint.
135-149
- Kazuo Murota, Akiyoshi Shioura:
Relationship of M-/L-convex functions with discrete convex functions by Miller and Favati-Tardella.
151-176
- Takao Nishizeki, Jens Vygen, Xiao Zhou:
The edge-disjoint paths problem is NP-complete for series-parallel graphs.
177-186
- Norbert Radics:
Rigidity of multi-story buildings.
187-198
- András Recski:
Some polynomially solvable subcases of the detailed routing problem in VLSI design.
199-208
- Tadashi Sakuma:
On kernel-less clique-acyclic orientations of minimally imperfect graphs.
209-219
Copyright © Wed Dec 9 20:20:41 2009
by Michael Ley (ley@uni-trier.de)
