SIAM Journal on Discrete Mathematics, Volume 4
Volume 4, Number 1, February 1991
James Abello: The Weak Bruhat Order of SSigma, Consistent Sets, and Catalan Numbers. 1-16- Maurizio A. Bonuccelli: A Polynomial Time Optimal Algorithm for Satellite-Switched Time-Division Multiple Access Satellite Communications with General Switching Modes. 28-35
- Edward G. Coffman Jr., Peter W. Shor: A Simple Proof of the O(sqrt(n log3/4 n) Upright Matching Bound. 48-57
- Hortensia Galeana-Sánchez, Laura Pastrana Ramírez, Hugo Alberto Rincón-Mejía: Semikernels, Quasi Kernels, and Grundy Functions in the Line Digraph. 80-83
- Nicholas Pippenger: The Expected Capacity of Concentrators. 121-129
- Alexander Schrijver: Edge-Disjoint Homotopic Paths in Straight-Line Planar Graphs. 130-138
Volume 4, Number 2, May 1991
- Fawzi Al-Thukair, Andrzej Pelc, Ivan Rival, Jorge Urrutia: Motion Planning, Two-Directional Point Representations, and Ordered Sets. 151-163
- Marek Chrobak, Howard J. Karloff, T. H. Payne, Sundar Vishwanathan: New Results on Server Problems. 172-181
- Zoltán Füredi: Maximal Independent Subsets in Steiner Systems and in Planar Sets. 196-199
- Eric Goles Ch., Servet Martínez A.: Lyapunov Functionals for Automata Networks Defined by Cyclically Monotone Functions. 200-206
- Jan Kratochvíl, Anna Lubiw, Jaroslav Nesetril: Noncrossing Subgraphs in Topological Layouts. 223-244
- Jeffrey B. Remmel, Mei Yang: Special Rim Hook Tabloids and Some New Multiplicity-Free S-Series. 253-274
- Louis W. Shapiro, A. B. Stephens: Bootstrap Percolation, the Schröder Numbers, and the N-Kings Problem. 275-280
- Philip K. McKinley, Nany Hasan, Ran Libeskind-Hadas, C. L. Liu: Disjoint Covers in Replicated Heterogeneous Arrays. 281-292
- Martin Dowd: An Integer Program for Codes. 293-303
Volume 4, Number 3, August 1991
- Daniel Granot, Darko Skorin-Kapov: NC Algorithms for Recognizing Partial 2-Trees and 3-Trees. 342-354
- Jack E. Graver: Rigidity Matroids. 255-368
- Sung Kwon Kim: Optimal Parallel Algorithms for Region Labeling and Medial Axis Transform of Binary Images. 385-396
- Gary MacGillivray: On the Complexity of Colouring by Vertex-Transitive and Arc-Transitive Digraphs. 397-408
- Moni Naor: A Lower Bound on Probabilistic Algorithms for Distributive Ring Coloring. 409-412
- Gara Pruesse, Frank Ruskey: Generating the Linear Extensions of Certain Posets by Transpositions. 413-422
- Shmuel Onn: On the Geometry and Computational Complexity of Radon Partitions in the Integer Lattice. 436-447
- Edward R. Scheinerman: A Note on Planar Graphs and Circle Orders. 448-451
Volume 4, Number 4 November 1991
- Peter Alles, Jaroslav Nesetril, Svatopluk Poljak: Extendability, Dimensions, and Diagrams of Cycle Orders. 453-471
- Richard B. Borie, R. Gary Parker, Craig A. Tovey: Deterministic Decomposition of Recursive Graph Classes. 481-501
- Mee Yee Chan, Shiang-Jen Lee: On the Existence of Hamiltonian Circuits in Faulty Hypercubes. 511-527
- Arie Tamir: Obnoxious Facility Location on Graphs. 550-567
- Clara Chan: Plane Trees and H-Vectors of Shellable Cubical Complexes. 568-574
- Stanley Xi Wang, Edward C. Waymire: A Large Deviation Rate and Central Limit Theorem for Horton Ratios. 575-588
- Martin Dowd: Erratum: An Integer Program for Codes. 589
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T214307 by the dblp team