SIAM Journal on Discrete Mathematics, Volume 9
Volume 9, Number 1, 1996
Ulrich Faigle, Alan J. Hoffman, Walter Kern: A Characterization of Nonnegative Box-Greedy Matrices. 1-6- Marie-Claude Heydemann, Joseph G. Peters, Dominique Sotteau: Spanners of Hypercube-Derived Networks. 37-54
- Shi-Chun Tsai: Lower Bounds on Representing Boolean Functions as Polynomials in Zm. 55-62
- Satoru Iwata, Kazuo Murota: Horizontal Principal Structure of Layered Mixed Matrices: Decomposition of Discrete Systems by Design-Variable Selections. 71-86
- Ming-Yang Kao: Data Security Equals Graph Connectivity. 87-100
- Daniel P. Sanders: On Linear Recognition of Tree-Width at Most Four. 101-117
- Kimmo Eriksson: Chip-Firing Games on Mutating Graphs. 118-128
- Lyudmil Aleksandrov, Hristo Djidjev: Linear Algorithms for Partitioning Embedded Graphs of Bounded Genus. 129-150
- Brian Alspach, Yi-Ping Liu, Cun-Quan Zhang: Nowhere-Zero 4-Flows and Cayley Graphs on Solvable Groups. 151-154
Volume 9, Number 2, 1996
- Glenn K. Manacher, Terrance A. Mankus: Finding a Domatic Partition of an Interval Graph in Time O(n). 167-172
- R. Ravi, Ravi Sundaram, Madhav V. Marathe, Daniel J. Rosenkrantz, S. S. Ravi: Spanning Trees - Short or Small. 178-200
- Tuvi Etzion: On the Nonexistence of Perfect Codes in the Johnson Scheme. 201-209
- Frank Hoffmann, Klaus Kriegel: A Graph-Coloring Result and Its Consequences For Polygon-Guarding Problems. 210-224
- Martin Grötschel, Alexander Martin, Robert Weismantel: Packing Steiner Trees: Separation Algorithms. 233-257
- Eddy Mayoraz: On the Power of Democratic Networks. 258-268
- Binay K. Bhattacharya, Pavol Hell, Jing Huang: A Linear Algorithm for Maximum Weight Cliques in Proper Circular Arc Graphs. 274-289
- Jason I. Brown, Richard J. Nowakowski, Douglas F. Rall: The Ultimate Categorical Independence Ratio of a Graph. 290-300
- Don Coppersmith, Uriel Feige, James B. Shearer: Random Walks on Regular and Irregular Graphs. 301-308
- Thomas M. Kratzke, Douglas B. West: The Total Interval Number of a Graph II: Trees and Complexity. 339-348
Volume 9, Number 3, 1996
- Jovan Dj. Golic: Constrained Embedding Probability for Two Binary Strings. 360-364
- E. Andrew Boyd: On the Complexity of a Cutting Plane Algorithm for Solving Combinatorial Linear Programs. 365-376
- Jason I. Brown, Charles J. Colbourn, David G. Wagner: Cohen-Macaulay Rings in Network Reliability. 377-392
- Tuvi Etzion: Nonequivalent q-ary Perfect Codes. 413-423
- Jürgen Bierbrauer, K. Gopalakrishnan, Douglas R. Stinson: Orthogonal Arrays, Resilient Functions, Error-Correcting Codes, and Linear Programming Bounds. 424-452
- Robert Connelly, Walter Whiteley: Second-Order Rigidity and Prestress Stability for Tensegrity Frameworks. 453-491
- Olivier Goldschmidt, Dorit S. Hochbaum, Cor A. J. Hurkens, Gang Yu: Approximation Algorithms for the k-Clique Covering Problem. 492-509
Volume 9, Number 4, 1996
- Yinan N. Shen, Fabrizio Lombardi: Graph Algorithms for Conformance Testing Using the Rural Chinese Postman Tour. 511-528
- David G. Wagner: Multipartition Series. 529-544
- Kazuo Murota: Valuated Matroid Intersection I: Optimality Criteria. 545-561
- Kazuo Murota: Valuated Matroid Intersection II: Algorithms. 562-576
- Andrzej Proskurowski, Maciej M. Syslo, Pawel Winter: Plane Embeddings of 2-trees and Biconnected Partial 2-Trees. 577-596
- Ian F. Blake, Vahid Tarokh: On the Trellis Complexity of the Densest Lattice Packings in Rn. 597-601
- Sunil Chopra, Giovanni Rinaldi: The Graphical Asymmetric Traveling Salesman Polyhedron: Symmetric Inequalities. 602-624
- Lynne L. Doty, R. J. Goldstone, Charles L. Suffel: Cayley Graphs with Neighbor Connectivity One. 625-642
- Jennifer Ryan: IIS-Hypergraphs. 643-653
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T211851 by the dblp team