Volume 12,
Number 1,
1999
- Andrew V. Goldberg, Satish Rao:
Flows in Undirected Unit Capacity Networks.
1-5
- Bojan Mohar:
A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface.
6-26
- Kevin T. Phelps, Mike LeVan:
Nonsystematic Perfect codes.
27-34
- Josep Rifà:
Well-Ordered Steiner Triple Systems and 1-Perfect Partitions of the n-cube.
35-47
- Andrzej Czygrinow, Svatopluk Poljak, Vojtech Rödl:
Constructive Quasi-Ramsey Numbers and Tournament Ranking.
48-63
- Louxin Zhang:
Optimal Bounds for Matching Routing on Trees.
64-77
- Ming-Yang Kao, Stephen R. Tate:
On-Line Difference Maximization.
78-90
- Alberto Caprara:
Sorting Permutations by Reversals and Eulerian Cycle Decompositions.
91-110
- Wilfried Imrich, Sandi Klavzar, Henry Martyn Mulder:
Median Graphs and Triangle-Free Graphs.
111-118
- Feodor F. Dragan, Falk Nicolai, Andreas Brandstädt:
Convexity and HHD-Free Graphs.
119-135
- Brigitte Servatius, Walter Whiteley:
Constraining Plane Configurations in Computer-Aided Design: Combinatorics of Directions and Lengths.
136-153
Volume 12,
Number 2,
1999
- Philippe Flajolet, Helmut Prodinger:
On Stirling Numbers for Complex Arguments and Hankel Contours.
155-159
- Jørgen Bang-Jensen, Harold N. Gabow, Tibor Jordán, Zoltán Szigeti:
Edge-Connectivity Augmentation with Partition Constraints.
160-207
- Alan M. Frieze, Michal Karonski, Lubos Thoma:
On Perfect Matchings and Hamilton Cycles in Sums of Random Trees.
208-216
- Zhicheng Gao, Nicholas C. Wormald:
The Size of the Largest Components in Random Planar Maps.
217-228
- Jianer Chen, Saroja P. Kanchi:
Graph Ear Decompositions and Graph Embeddings.
229-242
- Tero Laihonen, Simon Litsyn:
New Bounds On Covering Radius as a Function of Dual Distance.
243-251
- Ding-Zhu Du, Frank K. Hwang, Guoliang Xue:
Interconnecting Highways.
252-261
- Jeannette Janssen, Kyriakos Kilakos:
Bounded Stable Sets: Polytopes and Colorings.
262-275
- Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller:
Independent Sets in Asteroidal Triple-Free Graphs.
276-287
Volume 12,
Number 3,
1999
- Vineet Bafna, Piotr Berman, Toshihiro Fujito:
A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem.
289-297
- Todd G. Will:
Switching Distance Between Graphs with the Same Degrees.
298-306
- Tao Jiang, Dhruv Mubayi, Aditya Shastri, Douglas B. West:
Edge-Bandwidth of Graphs.
307-316
- Xin He, Ming-Yang Kao, Hsueh-I Lu:
Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings.
317-325
- G. Bolotashvili, M. Kovalev, E. Girlich:
New Facets of the Linear Ordering Polytope.
326-336
- Hikoe Enomoto, Miki Shimabara Miyauchi:
Embedding Graphs into a Three Page Book with O(m log n) Crossings of Edges over the Spine.
337-341
- Magnús M. Halldórsson, Kazuo Iwano, Naoki Katoh, Takeshi Tokuyama:
Finding Subsets Maximizing Minimum Structures.
342-359
- Stefan Felsner, Klaus Reuter:
The Linear Extension Diameter of a Poset.
360-373
- Jan Kratochvíl, Zsolt Tuza:
Rankings of Directed Graphs.
374-384
- András Gyárfás, Zoltán Király, Jenö Lehel:
On-Line 3-Chromatic Graphs I. Triangle-Free Graphs.
385-411
- Russell Merris:
Note: An Upper Bound for the Diameter of a Graph.
412-412
Volume 12,
Number 4,
1999
Copyright © Sat Nov 28 22:33:36 2009
by Michael Ley (ley@uni-trier.de)
