Abstract is missing.
- Equitable and ::::m::::-Bounded Coloring of Split GraphsBor-Liang Chen, Ming-Tat Ko, Ko-Wei Lih. 1-5
- Four Coloring for a Subset of Maximal Planar Graphs with Minimum Degree FivePhilippe Rolland. 6-17
- Enumeration Algorithm for the Edge Coloring Problem on Bipartite GraphsYasuko Matsui, Tomomi Matsui. 18-26
- On-Line Recognition of Interval Graphs in ::::O::::(::::m:::: + ::::nlog n::::) TimeWen-Lian Hsu. 27-38
- Connected Proper Interval Graphs and the Guard Problem in Spiral PolygonsChiuyuan Chen, Chin-Chen Chang. 39-47
- Weighted Connected Domination and Steiner Trees in Distance-Hereditary GraphsHong-Gwa Yeh, Gerard J. Chang. 48-52
- On Central Spanning Trees of a GraphSergei L. Bezrukov, Firoz Kaderali, W. Poguntke. 53-57
- Complete Bipartite Decompositions of Crowns, with Applications to Complete Directed GraphsChiang Lin, Jenq-Jong Lin, Tay-Woei Shyu. 58-66
- Finding an Antidirected Hamiltonian Path Starting with a Forward Arc from a Given Vertex of a TournamentEvripidis Bampis, Pavol Hell, Yannis Manoussakis, Moshe Rosenfeld. 67-73
- Complementary ::::l::::::1::-Graphs and Related Combinatorial StructuresMichel Deza, Tayuan Huang. 74-90
- Double Description Method RevisitedKomei Fukuda, Alain Prodon. 91-111
- On Skeletons, Diameters and Volumes of Metric PolyhedraAntoine Deza, Michel Deza, Komei Fukuda. 112-128
- Improving Branch and Bound for Jobshop Scheduling with Constraint PropagationYves Caseau, François Laburthe. 129-149
- A New Efficiently Solvable Special Case of the Three-Dimensional Axial Bottleneck Assignment ProblemBettina Klinz, Gerhard J. Woeginger. 150-162
- Ramsey Numbers by Stochastic Algorithms with New HeuristicsJihad Mohamad Jaam. 163-181
- On the Hybrid Neural Network Model for Solving Optimization ProblemsFouad B. Chedid. 182-193
- Constructive - Non-constructive Approximation and Maximum Independent Set ProblemMarc Demange, Vangelis Th. Paschos. 194-207
- Weakly Greedy Algorithm and Pair-Delta-MatroidsTakashi Takabatake. 208-217
- On Integer Multiflows and Metric Packings in MatroidsKarina Marcus, András Sebö. 218-233
- Optimum Alphabetic Binary TreesT. C. Hu, J. David Morgenthaler. 234-243
- Block Codes for Dyadic Phase Shift KeyingPatrick Solé, Jean-Pierre Tillich. 244-262
- Zigzag Codes and Z-Free HullsBruno Patrou. 263-274
- Contiguity OrdersVincent Bouchitté, Abdelmajid Hilali, Roland Jégou, Jean-Xavier Rampon. 275-287
- Worst-Case Analysis for On-Line Data CompressionJózsef Békési, Gábor Galambos, Ulrich Pferschy, Gerhard J. Woeginger. 288-300
- Gossiping in Cayley Graphs by PacketsJean-Claude Bermond, Takako Kodate, Stephane Perennes. 301-315
- On Embedding 2-Dimensional Toroidal Grids into de Bruijn Graphs with Clocked Congestion OneThomas Andreae, Michael Nölle, Christof Rempel, Gerald Schreiber. 316-327
- N-Cube String Matching Algorithm with Long TextsFouzia Moussouni, Christian Lavault. 328-340
- Combinatorics for Multiprocessor Scheduling Optimization and Oter Contexts in Computer ArchitectureHåkan Lennerstad, Lars Lundberg. 341-347
- Some Applications of Combinatorial Optimization in Parallel ComputingReinhardt Euler, Laurent Lemarchand. 348-366
- On the Parallel Complexity of the Alternating Hamiltonian Cycle ProblemEvripidis Bampis, Yannis Manoussakis, Ioannis Milis. 367-377
- Threshold Graphs and Synchronization ProtocolsRossella Petreschi, Andrea Sterbini. 378-395
- Task Assignment in Distributed Systems Using Network Flow MethodsIoannis Milis. 396-405
- Distributed Rerouting in DCS Mesh NetworksDritan Nace, Jacques Carlier. 406-415