Volume 113,
Number 1,
September 2001
Selected Papers:
12th Workshop on Graph-Theoretic Concepts in Com puter Science,
Ascona,
Switzerland,
June 2001
- Ronny Hadany, David Harel:
A multi-scale algorithm for drawing graphs nicely.
3-21
- Paola Flocchini, Frédéric Geurts, Nicola Santoro:
Optimal irreversible dynamos in chordal rings.
23-42
- Olivier Baudon, Guillaume Fertin, Ivan Havel:
Routing permutations and 2-1 routing requests in the hypercube.
43-58
- Jirí Fiala, Ton Kloks, Jan Kratochvíl:
Fixed-parameter complexity of lambda-labelings.
59-72
- Hans-Christoph Wirth, Jan Steffan:
Reload cost problems: minimum diameter spanning tree.
73-85
- Dietrich Hauptmeier, Sven Oliver Krumke, Jörg Rambau, Hans-Christoph Wirth:
Euler is standing in line dial-a-ride problems with precedence-constraints.
87-107
- Assaf Natanzon, Ron Shamir, Roded Sharan:
Complexity classification of some edge modification problems.
109-128
Volume 113,
Number 2-3,
October 2001
- Amir Averbuch, Yehuda Roditty, Barack Shoham:
Efficient line broadcasting in a d-dimensional grid.
129-141
- Derek G. Corneil, Feodor F. Dragan, Michel Habib, Christophe Paul:
Diameter determination on restricted graph families.
143-166
- T. Easton, R. Gary Parker:
On completing latin squares.
167-181
- David Hartvigsen:
A strongly polynomial time algorithm for a constrained submodular optimization problem.
183-194
- Kiyoshi Hosono, Henk Meijer, David Rappaport:
On the visibility graph of convex translates.
195-210
- Charles R. Johnson, Michael Lundquist, Thomas J. Lundy, John S. Maybee:
Deterministic inverse zero-patterns.
211-236
- Serge Lawrencenko, Michael D. Plummer, Xiaoya Zha:
Bounds for isoperimetric constants of infinite plane graphs.
237-241
- Malwina J. Luczak, Steven D. Noble:
Optimal arrangement of data in a tree directory.
243-253
- Celina M. Herrera de Figueiredo, Kristina Vuskovic:
Recognition of quasi-Meyniel graphs.
255-260
- Jean-Luc Fouquet, Gena Hahn:
Cycle regular graphs need not be transitive.
261-264
- J. Freixas, M. A. Puente:
A note about games-composition dimension.
265-273
- Alan J. Hoffman, Baruch Schieber:
The edge versus path incidence matrix of series-parallel graphs and greedy packing.
275-284
- Juha Honkala:
Easy cases of the D0L sequence equivalence problem.
285-290
- Kiyoshi Hosono:
On an estimate of the size of the maximum matching for a family of disjoint compact convex sets in the plane.
291-298
- Frank K. Hwang, J. S. Lee:
Optimal quantitative group testing on cycles and paths.
299-302
- Pranava K. Jha:
Smallest independent dominating sets in Kronecker products of cycles.
303-306
- Peter Che Bor Lam, Wai Chee Shiu, Chong Sze Tong, Zhongfu Zhang:
On the equitable chromatic number of complete n-partite graphs.
307-310
- Xiangwen Li, Bing Wei, Fan Yang:
A degree condition of 2-factors in bipartite graphs.
311-318
- Weifa Liang:
Finding the k most vital edges with respect to minimum spanning trees for fixed k.
319-327
- Mei Lu, Zhengguang Yu:
Cycles of length 1 modulo 3 in graph.
329-336
- Jovanka Pantovic, Ratko Tosic, Gradimir Vojvodic:
Relative completeness with respect to two unary functions.
337-342
Copyright © Thu Nov 26 19:40:19 2009
by Michael Ley (ley@uni-trier.de)
