Volume 122, Number 1-3, October 2002
- Kazutoshi Ando:
K-submodular functions and convexity of their Lovász extension.
1-12
- Esther M. Arkin, Refael Hassin, Shimon Shahar:
Increasing digraph arc-connectivity by arc addition, reversal and complement.
13-22
- Hans-Jürgen Bandelt, Katharina T. Huber, Vincent Moulton:
Quasi-median graphs from sets of partitions.
23-35
- Gill Barequet, Matthew T. Dickerson, Robert L. (Scot) Drysdale III:
2-Point site Voronoi diagrams.
37-54
- Patrice Bertrand, Melvin F. Janowitz:
Pyramids and weak hierarchies in the ordinal model for clustering.
55-81
- Mingjang Chen, Gerard J. Chang:
Total interval numbers of complete r-partite graphs.
83-92
- Robert J. Cimikowski:
Algorithms for the fixed linear crossing number problem.
93-115
- Charles J. Colbourn:
Projective planes and congestion-free networks.
117-126
- Miranca Fischermann, Arne Hoffmann, Dieter Rautenbach, László A. Székely, Lutz Volkmann:
Wiener index versus maximum degree in trees.
127-137
- Marco Locatelli, Ulrich Raber:
Packing equal circles in a square: a deterministic global optimization approach.
139-166
- David Manlove:
The structure of stable marriage with indifference.
167-181
- Subhas C. Nandy, Tetsuo Asano, Tomohiro Harayama:
Shattering a set of objects in 2D.
183-194
- Hiroshi Narushima, Natalia Misheva:
On characteristics of ancestral character-state reconstructions under the accelerated transformation optimization.
195-209
- Xiangtong Qi, Gang Yu, Jonathan F. Bard:
Single machine scheduling with assignable due dates.
211-233
- Gabriele Ricci:
Some analytic features of algebraic data.
235-249
- Wai Chee Shiu, Peter Che Bor Lam, Kin Keung Poon:
On Wiener numbers of polygonal nets.
251-261
- Detlef Sieling:
The complexity of minimizing and learning OBDDs and FBDDs.
263-282
- David C. Fisher:
Fractional dominations and fractional total dominations of graph complements.
283-291
Last update Fri May 24 20:14:52 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
