SIAM Journal on Discrete Mathematics, Volume 11

Volume 11, Number 1, 1998

• Alexander Schrijver, Paul D. Seymour, Peter Winkler:
  The Ring Loading Problem. 1-14
  
• Peter C. Fishburn, J. H. Kim, J. C. Lagarias, Paul E. Wright:
  Interference-Minimizing Colorings of Regular Graphs. 15-40
  
• Douglas R. Stinson, Ruizhong Wei:
  Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes. 41-53
  
• Neil J. Calkin, Herbert S. Wilf:
  The Number of Independent Sets in a Grid Graph. 54-60
  
• Eyal Kushilevitz, Adi Rosén:
  A Randomness-Rounds Tradeoff in Private Computation. 61-80
  
• Vladimir G. Deineko, Rüdiger Rudolf, Gerhard J. Woeginger:
  Sometimes Travelling is Easy: The Master Tour Problem. 81-93
  
• Andrzej Proskurowski, Frank Ruskey, Malcolm Smith:
  Analysis of Algorithms for Listing Equivalence Classes of k-ary Strings. 94-109
  
• Oliver Riordan:
  An Ordering on the Even Discrete Torus. 110-127
  
• David R. Guichard:
  Competition Graphs of Hamiltonian Digraphs. 128-134
  
• Bjorn Poonen, Michael Rubinstein:
  The Number of Intersection Points Made by the Diagonals of a Regular Polygon. 135-156
  
• Charles M. Fiduccia, Rodney W. Forcade, Jennifer S. Zito:
  Geometry and Diameter Bounds of Directed Cayley Graphs of Abelian Groups. 157-167
  
• Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, Zsolt Tuza:
  Rankings of Graphs. 168-181
  

Volume 11, Number 2, 1998

• Robert W. Chen, Alan Zame, Andrew M. Odlyzko, Larry A. Shepp:
  An Optimal Acceptance Policy for an Urn Scheme. 183-195
  
• Jon M. Kleinberg, Michel X. Goemans:
  The Lovász Theta Function and a Semidefinite Programming Relaxation of Vertex Cover. 196-204
  
• Tuvi Etzion, Alexander Vardy:
  On Perfect Codes and Tilings: Problems and Solutions. 205-223
  
• Vineet Bafna, Pavel A. Pevzner:
  Sorting by Transpositions. 224-240
  
• Chris J. Mitchell, Kenneth G. Paterson:
  Perfect Factors from Cyclic Codes and Interleaving. 241-264
  
• Rongquan Feng, Jin Ho Kwak, Juyoung Kim, Jaeun Lee:
  Isomorphism Classes of Concrete Graph Coverings. 265-272
  
• Jin Ho Kwak, Jang-Ho Chun, Jaeun Lee:
  Enumeration of Regular Graph Coverings Having Finite Abelian Covering Transformation Groups. 273-285
  
• Michael Hofmeister:
  A Note on Counting Connected Graph Covering Projections. 286-292
  
• Cristian Lenart:
  A Generalized Distance in Graphs and Centered Partitions. 293-304
  
• Margarida Espona, Oriol Serra:
  Cayley Digraphs Based on the de Bruijn Networks. 305-317
  
• Tomasz Luczak:
  A Greedy Algorithm Estimating the Height of Random Trees. 318-329
  
• Karen L. Collins:
  Circulants and Sequences. 330-339
  
• Hortensia Galeana-Sánchez, Xueliang Li:
  Semikernels and (k, l)-Kernels in Digraphs. 340-346
  

Volume 11, Number 3, 1998

• János Komlós, Yuan Ma, Endre Szemerédi:
  Matching Nuts and Bolts in O(n log n) Time. 347-372
  
• Fred J. Rispoli, Steven Cosares:
  A Bound of 4 for the Diameter of the Symmetric Traveling Salesman Polytope. 373-380
  
• Jonathan Lichtner:
  Iterating an alpha-ary Gray Code. 381-386
  
• Ulrich Faigle, Walter Kern:
  Approximate Core Allocation for Binpacking Games. 387-399
  
• Artur Czumaj, Leszek Gasieniec, Andrzej Pelc:
  Time and Cost Trade-Offs in Gossiping. 400-413
  
• Victor Chepoi:
  On Distance-Preserving and Domination Elimination Orderings. 414-436
  
• Andreas Brandstädt, Feodor F. Dragan, Victor Chepoi, Vitaly I. Voloshin:
  Dually Chordal Graphs. 437-455
  
• Anatoly R. Rubinov, Vadim G. Timkovsky:
  String Noninclusion Optimization Problems. 456-467
  
• Martin Kochol:
  Partial Intersection Theorem and Flows in Abstract Networks. 468-486
  
• Mark Ramras:
  Congestion-free Routings of Linear Complement Permutations. 487-500
  
• Carles Padró, Paz Morillo, Xavier Muñoz:
  Fault-Tolerant Fixed Routings in Some Families of Digraphs. 501-509
  

Volume 11, Number 4, 1998

• Benny Chor, Madhu Sudan:
  A Geometric Approach to Betweenness. 511-523
  
• A. M. H. Gerards, F. Bruce Shepherd:
  The Graphs with All Subgraphs T-Perfect. 524-545
  
• Shimon Even, Ami Litman, Arnold L. Rosenberg:
  Monochromatic Paths and Triangulated Graphs. 546-556
  
• András Frank, Toshihide Ibaraki, Hiroshi Nagamochi:
  Two Arc-Disjoint Paths in Eulerian Digraphs. 557-589
  
• D. J. Guan, Xuding Zhu:
  Multiple Capacity Vehicle Routing on Paths. 590-602
  
• Jørgen Bang-Jensen, Tibor Jordán:
  Edge-Connectivity Augmentation Preserving Simplicity. 603-623
  
• Ramamohan Paturi, Francis Zane:
  Dimension of Projections in Boolean Functions. 624-632
  
• Shiow-Fen Hwang, Gerard J. Chang:
  k-Neighborhood-Covering and -Independence Problems for Chordal Graphs. 633-643
  
• Yair Caro, Mark N. Ellingham, J. E. Ramey:
  Local Structure When All Maximal Independent Sets Have Equal Weight. 644-654
  
• John G. Gimbel, Ann N. Trenk:
  On the Weakness of an Ordered Set. 655-663
  
• Yunghsiang S. Han:
  A New Decoding Algorithm for Complete Decoding of Linear Block Codes. 664-671