Abstract is missing.
- Near-Optimal Dominating Sets in Dense Random Graphs in Polynomial Expected TimeSotiris E. Nikoletseas, Paul G. Spirakis. 1-10
- Approximating Minimum Weight Perfect Matchings for Complete Graphs Satisfying the Triangle InequalityN. W. Holloway, Somasundaram Ravindran, Alan Gibbons. 11-20
- Hierarchical Specified Unit Disk Graphs (Extended Abstract)Madhav V. Marathe, Venkatesh Radhakrishnan, Harry B. Hunt III, S. S. Ravi. 21-32
- Bounded Tree-Width and LOGCFLEgon Wanke. 33-44
- On Reduction Algorithms for Graphs with Small TreewidthHans L. Bodlaender. 45-56
- Algorithms and Complexity of Sandwich Problems in Graphs (Extended Abstract)Martin Charles Golumbic, Haim Kaplan, Ron Shamir. 57-69
- On-line Graph Algorithms for Incremental CompilationAlberto Marchetti-Spaccamela, Umberto Nanni, Hans Rohnert. 70-86
- Average Case Analysis of Fully Dynamic Connectivity for Directed GraphsPaola Alimonti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Xavier Messeguer. 87-98
- Fully Dynamic Maintenance of Vertex CoverZoran Ivkovic, Errol L. Lloyd. 99-111
- Dynamic Algorithms for Graphs with Treewidth 2Hans Leo Bodlaender. 112-124
- Short Disjoint Cycles in Graphs with Degree ConstraintsAndreas Brandstädt, Heinz-Jürgen Voss. 125-131
- Efficient Algorithms for Tripartitioning Triconnected Graphs and 3-Edge-Connected GraphsKoichi Wada, Kimio Kawaguchi. 132-143
- Toward a Solution of the Holyer s ProblemZbigniew Lonc. 144-152
- Graphs, Hypergraphs and HashingGeorge Havas, Bohdan S. Majewski, Nicholas C. Wormald, Zbigniew J. Czech. 153-165
- Coloring k-Colorable Graphs in Constant Expected Parallel TimeLudek Kucera. 166-176
- Deciding 3-Colourability in Less Than O(1.415^n) StepsIngo Schiermeyer. 177-188
- A Rainbow About T-Colorings for Complete GraphsKlaus Jansen. 189-199
- Approximating the Chromatic Polynomial of a GraphNai-Wei Lin. 200-210
- Asteroidal Triple-Free GraphsDerek G. Corneil, Stephan Olariu, Lorna Stewart. 211-224
- The Parallel Complexity of Elimination Ordering ProceduresElias Dahlhaus. 225-236
- Dually Chordal GraphsAndreas Brandstädt, Feodor F. Dragan, Victor Chepoi, Vitaly I. Voloshin. 237-251
- The Size of Reduced OBDDs and Optimal Read-once Branching Programs for Almost all Boolean FunctionsIngo Wegener. 252-263
- Regular Marked Petri NetsJörg Desel. 264-275
- The Asynchronous Committee Meeting ProblemJavier Esparza, Bernhard von Stengel. 276-287
- Gossiping in Vertex-Disjoint Path Mode in Interconnection NetworksJuraj Hromkovic, Ralf Klasing, Elena Stöhr. 288-300
- The Folded Petersen Network: A New Versatile Multiprocessor Interconnection TopologySabine R. Öhring, Sajal K. Das. 301-314
- Fast Load Balancing in Cayley Graphs and in CircuitsJacques E. Boillat. 315-326
- Concurrent Flows and Packet Routing in Cayley Graphs (Preliminary Version)Farhad Shahrokhi, László A. Székely. 327-337
- On Multi-Label Linear Interval Routing Schemes (Extended Abstract)Evangelos Kranakis, Danny Krizanc, S. S. Ravi. 338-349
- An All Pairs Shortest Path Distributed Algorithm Using 2n² MessagesS. Haldar. 350-363
- Linear Layouts of Generalized HypercubesKoji Nakano. 364-375
- Graph Ear Decompositions and Graph Embeddings (Extended Abstract)Jianer Chen, Saroja P. Kanchi. 376-387
- Improving Bounds for the Crossing Numbers on Surfaces of Genus gFarhad Shahrokhi, László A. Székely, Ondrej Sýkora, Imrich Vrto. 388-395
- Two Algorithms for Finding Rectangular Duals of Planar GraphsGoos Kant, Xin He. 396-410
- A More Compact Visibility RepresentationGoos Kant. 411-424