@article{Faigle-Hoffman-Kern/96,
AUTHOR = {Faigle, Ulrich and Hoffman, Alan J. and Kern, Walter},
TITLE = {A characterization of nonnegative box-greedy matrices},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {9},
NUMBER = {1},
PAGES = {1-6},
YEAR = {1996},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Diks-Pelc/96a,
AUTHOR = {Diks, Krzysztof and Pelc, Andrzej},
TITLE = {Efficient gossiping by packets in networks with random faults},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {9},
NUMBER = {1},
PAGES = {7-18},
YEAR = {1996},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Barnes-Feige/96,
AUTHOR = {Barnes, Greg and Feige, Uriel},
TITLE = {Short random walks on graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {9},
NUMBER = {1},
PAGES = {19-28},
YEAR = {1996},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Boppana-Narayanan/96,
AUTHOR = {Boppana, Ravi B. and Narayanan, Babu O.},
TITLE = {The biased coin problem},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {9},
NUMBER = {1},
PAGES = {29-36},
YEAR = {1996},
KEYWORDS = {pseudo-randomness, slightly random sources, randomized algorithm},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Heydemann-Peters-Sotteau/96,
AUTHOR = {Heydemann, Marie-Claude and Peters, Joseph G. and Sotteau, Dominique},
TITLE = {Spanners of hypercube-derived networks},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {9},
NUMBER = {1},
PAGES = {37-54},
YEAR = {1996},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Tsai/96,
AUTHOR = {Tsai, Shi-Chun},
TITLE = {Lower bounds on representing Boolean functions as polynomials in $Z_m$},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {9},
NUMBER = {1},
PAGES = {55-62},
YEAR = {1996},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Haglin-Wolf/96,
AUTHOR = {Haglin, David J. and Wolf, Marty J.},
TITLE = {On convex subsets in tournaments},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {9},
NUMBER = {1},
PAGES = {63-70},
YEAR = {1996},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Iwata-Murota/96,
AUTHOR = {Iwata, Satoru and Murota, Kazuo},
TITLE = {Horizontal principal structure of layered mixed matrices: Decomposition of discrete systems by design-variable selections},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {9},
NUMBER = {1},
PAGES = {71-86},
YEAR = {1996},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Kao/96,
AUTHOR = {Kao, Ming-Yang},
TITLE = {Data security equals graph connectivity},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {9},
NUMBER = {1},
PAGES = {87-100},
YEAR = {1996},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Sanders/96d,
AUTHOR = {Sanders, Daniel P.},
TITLE = {On linear recognition of tree-width at most four},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {9},
NUMBER = {1},
PAGES = {101-117},
YEAR = {1996},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Eriksson/96,
AUTHOR = {Eriksson, Kimmo},
TITLE = {Chip-firing games on mutating graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {9},
NUMBER = {1},
PAGES = {118-128},
YEAR = {1996},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Aleksandrov-Djidjev/96,
AUTHOR = {Aleksandrov, L. and Djidjev, H.},
TITLE = {Linear algorithms for partitioning embedded graphs of bounded genus},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {9},
NUMBER = {1},
PAGES = {129-150},
YEAR = {1996},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Alspach-Liu-Zhang/96,
AUTHOR = {Alspach, Brian and Liu, Yi-Ping and Zhang, Cun-Quan},
TITLE = {Nowhere-zero 4-flows and Cayley graphs on solvable groups},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {9},
NUMBER = {1},
PAGES = {151-154},
YEAR = {1996},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Luby-Naor-Orda/96,
AUTHOR = {Luby, Michael G. and Naor, Joseph (Seffi) and Orda, Ariel},
TITLE = {Tight bounds for dynamic storage allocation},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {9},
NUMBER = {1},
PAGES = {155-166},
YEAR = {1996},
KEYWORDS = {on-line algorithms, memory management, dynamic storage allocation, bandwidth allocation, First Fit, interval graph},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Manacher-Mankus/96,
AUTHOR = {Manacher, Glen K. and Mankus, Terrance A.},
TITLE = {Finding a domatic partition of an interval graph in time $O(n)$},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {9},
NUMBER = {2},
PAGES = {167-172},
YEAR = {1996},
KEYWORDS = {domination, domatic number, domatic partition, interval graph},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Coppersmith-Phillips/96,
AUTHOR = {Coppersmith, Don and Phillips, Steven},
TITLE = {On a question of Erd{\H{o}}s on subsequence sums},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {9},
NUMBER = {2},
PAGES = {173-177},
YEAR = {1996},
KEYWORDS = {sequence, integers, density, external problem},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Ravi-Sundaram-Marathe-Rosenkrantz-Ravi/96,
AUTHOR = {Ravi, R. and Sundaram, R. and Marathe, M.V. and Rosenkrantz, D.J. and Ravi, S.S.},
TITLE = {Spanning trees---Short or small},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {9},
NUMBER = {2},
PAGES = {178-200},
YEAR = {1996},
KEYWORDS = {approximation algorithm, network design, spanning tree},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Etzion/96,
AUTHOR = {Etzion, Tuvi},
TITLE = {On the nonexistence of perfect codes in the Johnson scheme},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {9},
NUMBER = {2},
PAGES = {201-209},
YEAR = {1996},
KEYWORDS = {perfect code, Steiner system, Hamming scheme, Johnson graph, Johnson scheme},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Hoffmann-Kriegel/96,
AUTHOR = {Hoffmann, Frank and Kriegel, Klaus},
TITLE = {A graph-coloring result and its consequences for polygon-guarding problems},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {9},
NUMBER = {2},
PAGES = {210-224},
YEAR = {1996},
KEYWORDS = {graph coloring, visibility in polygons},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Aichholzer-Aurenhammer/96,
AUTHOR = {Aichholzer, Oswin and Aurenhammer, Franz},
TITLE = {Classifying hyperplanes in hypercubes},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {9},
NUMBER = {2},
PAGES = {225-232},
YEAR = {1996},
KEYWORDS = {$d$-cube, hyperplane cuts, hyperplane enumeration},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Grotschel-Martin-Weismantel/96,
AUTHOR = {Gr{\"o}tschel, M. and Martin, A. and Weismantel, R.},
TITLE = {Packing Steiner trees: Separation algorithms},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {9},
NUMBER = {2},
PAGES = {233-257},
YEAR = {1996},
KEYWORDS = {dual graph, dynamic programming, multicuts, separation, shortest path, Steiner tree},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Mayoraz/96,
AUTHOR = {Mayoraz, E.N.},
TITLE = {On the power of democratic networks},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {9},
NUMBER = {2},
PAGES = {258-268},
YEAR = {1996},
KEYWORDS = {artificial neural network, weight quantization, linear threshold function, majority function, circuit complexity},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Albertson-Haas/96,
AUTHOR = {Albertson, Michael O. and Haas, Ruth},
TITLE = {Bounding functions and rigid graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {9},
NUMBER = {2},
PAGES = {269-273},
YEAR = {1996},
KEYWORDS = {graphs, extremal graph theory},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Bhattacharya-Hell-Huang/96,
AUTHOR = {Bhattacharya, Binay and Hell, Pavol and Huang, Jing},
TITLE = {A linear algorithm for maximum weight cliques in proper circular arc graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {9},
NUMBER = {2},
PAGES = {274-289},
YEAR = {1996},
KEYWORDS = {proper circular arc graph, maximum clique, maximum weight clique, coloring, algorithms, complexity},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Brown-Nowakowski-Rall/96,
AUTHOR = {Brown, Jason I. and Nowakowski, Richard J. and Rall, Douglas},
TITLE = {The ultimate categorical independence ratio of a graph},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {9},
NUMBER = {2},
PAGES = {290-300},
YEAR = {1996},
KEYWORDS = {independence number, ultimate categorical independence ratio, decomposition, self-universal},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Coppersmith-Feige-Shearer/96,
AUTHOR = {Coppersmith, Don and Feige, Uriel and Shearer, James},
TITLE = {Random walks on regular and irregular graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {9},
NUMBER = {2},
PAGES = {301-308},
YEAR = {1996},
KEYWORDS = {random walks, graphs, electrical resistance},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Chang-Kuo/96,
AUTHOR = {Chang, Gerard J. and Kuo, David},
TITLE = {The $L(2,1)$-labeling problem on graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {9},
NUMBER = {2},
PAGES = {309-316},
YEAR = {1996},
KEYWORDS = {$L(2,1)$-labeling, $T$-coloring, union, join, chordal graph, perfect graph, tree, bipartite matching, algorithm},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Arikati-Maheshwari/96,
AUTHOR = {Arikati, Srinivasa R. and Maheshwari, Anil},
TITLE = {Realizing degree sequences in parallel},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {9},
NUMBER = {2},
PAGES = {317-338},
YEAR = {1996},
KEYWORDS = {design and analysis of algorithms, parallel computation, graph algorithms, degree sequence, majorization, PRAM},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Kratzke-West/96,
AUTHOR = {Kratzke, Thomas M. and West, Douglas B.},
TITLE = {The total interval number of a graph II: Trees and complexity},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {9},
NUMBER = {2},
PAGES = {339-348},
YEAR = {1996},
KEYWORDS = {interval representation, complexity, tree, trail},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}