@article{Rubinstein-Thomas-Wormald/97,
AUTHOR = {Rubinstein, J.H. and Thomas, D.A. and Wormald, N.C.},
TITLE = {Steiner trees for terminals constrained to curves},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {10},
NUMBER = {1},
PAGES = {1-17},
YEAR = {1997},
EDITOR = {Monma, Clyde L.},
KEYWORDS = {steiner trees, polynomial algorithms},
URL = {http://dx.doi.org/10.1137/S0895480192241190},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Linusson/97,
AUTHOR = {Linusson, Svante},
TITLE = {Partitions with restricted block sizes, M{\"o}bius functions, and the $k$-of-each problem},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {10},
NUMBER = {1},
PAGES = {18-29},
YEAR = {1997},
EDITOR = {Monma, Clyde L.},
KEYWORDS = {decision tree, m{\"{o}}bius function, partitions},
URL = {http://dx.doi.org/10.1137/S089548019426855X},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Kahale/97,
AUTHOR = {Kahale, Nabil},
TITLE = {Isoperimetric inequalities and eigenvalues},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {10},
NUMBER = {1},
PAGES = {30-40},
YEAR = {1997},
EDITOR = {Monma, Clyde L.},
KEYWORDS = {eigenvalues, diameter, chebychev polynomials, expanders},
URL = {http://dx.doi.org/10.1137/S0895480193259825},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Andrews-Crippa-Simon/97,
AUTHOR = {Andrews, George E. and Crippa, Davide and Simon, Klaus},
TITLE = {$q$-series arising from the study of random graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {10},
NUMBER = {1},
PAGES = {41-56},
YEAR = {1997},
EDITOR = {Monma, Clyde L.},
KEYWORDS = {$q$-series, divisor generating functions, polynomials, random graphs, transitive closure, probability distributions},
URL = {http://dx.doi.org/10.1137/S0895480194262497},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Juvan-Mohar/97,
AUTHOR = {Juvan, Martin and Mohar, Bojan},
TITLE = {Obstructions for 2-M{\"o}bius band embedding extension problem},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {10},
NUMBER = {1},
PAGES = {57-72},
YEAR = {1997},
EDITOR = {Monma, Clyde L.},
KEYWORDS = {surface embedding, obstruction, m{\"{o}}bius band, algorithm},
URL = {http://dx.doi.org/10.1137/S0895480194264150},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Richmond-Merlini/97,
AUTHOR = {Richmond, Bruce and Merlini, Donatella},
TITLE = {Stirling numbers for complex arguments},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {10},
NUMBER = {1},
PAGES = {73-82},
YEAR = {1997},
EDITOR = {Monma, Clyde L.},
KEYWORDS = {stirling numbers, asymptotic enumeration},
URL = {http://dx.doi.org/10.1137/S0895480195284329},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Fishburn-Kelly/97,
AUTHOR = {Fishburn, Peter C. and Kelly, Jerry S.},
TITLE = {Super Arrovian domains with strict preferences},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {10},
NUMBER = {1},
PAGES = {83-95},
YEAR = {1997},
EDITOR = {Monma, Clyde L.},
KEYWORDS = {arrow's impossibility theorem, voter preference profiles, minimum profile sets},
URL = {http://dx.doi.org/10.1137/S0895480194263508},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Urbaniak-Weismantel-Ziegler/97,
AUTHOR = {Urbaniak, Regina and Weismantel, Robert and Ziegler, G{\"u}nter M.},
TITLE = {A variant of the Buchberger algorithm for integer programming},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {10},
NUMBER = {1},
PAGES = {96-108},
YEAR = {1997},
EDITOR = {Monma, Clyde L.},
KEYWORDS = {integer programming, upper bounds, test sets, buchberger algorithm, Gr{\"{o}}bner bases, iterative improvement heuristics},
URL = {http://dx.doi.org/10.1137/S0895480195281209},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Brandstadt-Chepoi-Dragan/97a,
AUTHOR = {Brandst{\"a}dt, Andreas and Chepoi, Victor D. and Dragan, Feodor F.},
TITLE = {Clique $r$-domination and clique $r$-packing problems on dually chordal graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {10},
NUMBER = {1},
PAGES = {109-127},
YEAR = {1997},
EDITOR = {Monma, Clyde L.},
KEYWORDS = {graphs, hypergraphs, tree structure, hypertrees, covering and packing problems, transversal and matching problems, dually chordal graphs, clique hypergraphs, generalization of strongly chordal graphs},
URL = {http://dx.doi.org/10.1137/S0895480194267853},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Charpin-Zinoviev/97,
AUTHOR = {Charpin, Pascale and Zinoviev, Victor},
TITLE = {On coset weight distributions of the 3-error-correcting BCH-codes},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {10},
NUMBER = {1},
PAGES = {128-145},
YEAR = {1997},
EDITOR = {Monma, Clyde L.},
KEYWORDS = {BCH-codes, uniformly packed codes, coset, coset weight distribution, orphan, affine permutation},
URL = {http://dx.doi.org/10.1137/S089548019529443X},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Ramachandramurthi/97,
AUTHOR = {Ramachandramurthi, Siddharthan},
TITLE = {The structure and number of obstructions to treewidth},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {10},
NUMBER = {1},
PAGES = {146-157},
YEAR = {1997},
EDITOR = {Monma, Clyde L.},
KEYWORDS = {treewidth, k-trees, graph minors, pathwidth, lower bounds, obstructions},
URL = {http://dx.doi.org/10.1137/S0895480195280010},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Frank-Karzanov-Sebo/97,
AUTHOR = {Frank, Andr{\'a}s and Karzanov, Alexander V. and Seb\H{o}, Andr{\'a}s},
TITLE = {On integer multiflow maximization},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {10},
NUMBER = {1},
PAGES = {158-170},
YEAR = {1997},
EDITOR = {Monma, Clyde L.},
KEYWORDS = {multiflow, polymatroid, network flows, locking, node demands},
URL = {http://dx.doi.org/10.1137/S0895480195287723},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Tassiulas/97,
AUTHOR = {Tassiulas, L.},
TITLE = {Worst case length of nearest neighbor tours for the Euclidean Traveling Salesman problem},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {10},
NUMBER = {2},
PAGES = {171-179},
YEAR = {1997},
EDITOR = {Monma, Clyde L.},
KEYWORDS = {euclidean traveling salesman problem, nearest neighbor tours, worst case analysis},
URL = {http://dx.doi.org/10.1137/S0895480194278246},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Hefner/97,
AUTHOR = {Hefner, Andreas},
TITLE = {A min-max theorem for a constrained matching problem},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {10},
NUMBER = {2},
PAGES = {180-189},
YEAR = {1997},
EDITOR = {Monma, Clyde L.},
KEYWORDS = {constrained matching problem, polyhedral combinatorics, min-max relations},
URL = {http://dx.doi.org/10.1137/S0895480195280538},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Yu-Cheriyan-Haxell/97,
AUTHOR = {Yu, B. and Cheriyan, J. and Haxell, P.E.},
TITLE = {Hypercubes and multicommodity flows},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {10},
NUMBER = {2},
PAGES = {190-200},
YEAR = {1997},
EDITOR = {Monma, Clyde L.},
KEYWORDS = {cube graphs, compression, average degree, multicommodity flows, minimum cuts},
URL = {http://dx.doi.org/10.1137/S089548019426560X},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Ramras/97,
AUTHOR = {Ramras, Mark},
TITLE = {Congestion-free optimal routings of hypercube automorphisms},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {10},
NUMBER = {2},
PAGES = {201-208},
YEAR = {1997},
EDITOR = {Monma, Clyde L.},
KEYWORDS = {hypercube, routing, automorphism, bpc permutation},
URL = {http://dx.doi.org/10.1137/S0895480194275175},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Yuster-Zwick/97,
AUTHOR = {Yuster, Raphael and Zwick, Uri},
TITLE = {Finding even cycles even faster},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {10},
NUMBER = {2},
PAGES = {209-222},
YEAR = {1997},
EDITOR = {Monma, Clyde L.},
KEYWORDS = {graph algorithms, cycles},
URL = {http://dx.doi.org/10.1137/S0895480194274133},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Holzman-Marcus-Peleg/97,
AUTHOR = {Holzman, Ron and Marcus, Yosi and Peleg, David},
TITLE = {Load balancing in quorum systems},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {10},
NUMBER = {2},
PAGES = {223-245},
YEAR = {1997},
EDITOR = {Monma, Clyde L.},
KEYWORDS = {quorum, coterie, intersecting hypergraphs, load balancing},
URL = {http://dx.doi.org/10.1137/S0895480193260303},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Drmota-Soria/97,
AUTHOR = {Drmota, Michael and Soria, Mich{\'e}le},
TITLE = {Images and preimages in random mappings},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {10},
NUMBER = {2},
PAGES = {246-269},
YEAR = {1997},
EDITOR = {Monma, Clyde L.},
KEYWORDS = {random mappings, combinatorial constructions, limiting distributions},
URL = {http://dx.doi.org/10.1137/S0895480194268421},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Mitchell/97a,
AUTHOR = {Mitchell, Chris J.},
TITLE = {de Bruijn sequences and perfect factors},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {10},
NUMBER = {2},
PAGES = {270-281},
YEAR = {1997},
EDITOR = {Monma, Clyde L.},
KEYWORDS = {de bruijn sequence, de bruijn graph, window sequence, perfect factor},
URL = {http://dx.doi.org/10.1137/S0895480195290911},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Sendrier/97,
AUTHOR = {Sendrier, Nicolas},
TITLE = {On the dimension of the hull},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {10},
NUMBER = {2},
PAGES = {282-293},
YEAR = {1997},
EDITOR = {Monma, Clyde L.},
KEYWORDS = {error correcting codes, self-dual codes, weakly self-dual codes, hull},
URL = {http://dx.doi.org/10.1137/S0895480195294027},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Fujishige/97,
AUTHOR = {Fujishige, Satoru},
TITLE = {A min-max theorem for bisubmodular polyhedra},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {10},
NUMBER = {2},
PAGES = {294-308},
YEAR = {1997},
EDITOR = {Monma, Clyde L.},
KEYWORDS = {bisubmodular functions, bisubmodular polyhedra, min--max theorem, submodular functions},
URL = {http://dx.doi.org/10.1137/S0895480194264344},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Bertram-Horak/97,
AUTHOR = {Bertram, Edward and Hor{\'a}k, Peter},
TITLE = {Decomposing 4-regular graphs into triangle-free 2-factors},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {10},
NUMBER = {2},
PAGES = {309-317},
YEAR = {1997},
EDITOR = {Monma, Clyde L.},
KEYWORDS = {decomposition, triangle-free, 2-factor, polynomial algorithm},
URL = {http://dx.doi.org/10.1137/S089548019427144X},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Bollobas-Brightwell/97a,
AUTHOR = {Bollob{\'a}s, B{\'e}la and Brightwell, Graham},
TITLE = {The structure of random graph orders},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {10},
NUMBER = {2},
PAGES = {318-335},
YEAR = {1997},
EDITOR = {Monma, Clyde L.},
KEYWORDS = {partial order, random graph, random partial order},
URL = {http://dx.doi.org/10.1137/S0895480194281215},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Gupta-Impagliazzo/97,
AUTHOR = {Gupta, Arvind and Impagliazzo, Russell},
TITLE = {Bounding the size of planar intertwines},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {10},
NUMBER = {3},
PAGES = {337-358},
YEAR = {1997},
EDITOR = {Monma, Clyde L.},
KEYWORDS = {intertwines, minors, topological embedding},
URL = {http://dx.doi.org/10.1137/S0895480192239931},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Hamel-Steel/97,
AUTHOR = {Hamel, A.M. and Steel, M.A.},
TITLE = {The length of a leaf coloration on a random binary tree},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {10},
NUMBER = {3},
PAGES = {359-372},
YEAR = {1997},
EDITOR = {Monma, Clyde L.},
KEYWORDS = {binary tree, fitch's algorithm, maximum parsimony tree, dna/rna sequences, probability},
URL = {http://dx.doi.org/10.1137/S0895480194271591},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Kierstead/97,
AUTHOR = {Kierstead, H.A.},
TITLE = {Classes of graphs that are not vertex Ramsey},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {10},
NUMBER = {3},
PAGES = {373-380},
YEAR = {1997},
EDITOR = {Monma, Clyde L.},
KEYWORDS = {ramsey, chromatic number, hypergraph},
URL = {http://dx.doi.org/10.1137/S0895480194264769},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Calkin-Erdos-Tovey/97,
AUTHOR = {Calkin, Neil J. and Erd\H{o}s, Paul and Tovey, Craig A.},
TITLE = {New Ramsey bounds from cyclic graphs of prime order},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {10},
NUMBER = {3},
PAGES = {381-387},
YEAR = {1997},
EDITOR = {Monma, Clyde L.},
KEYWORDS = {ramsey, cyclic graphs, probabilistic bounds},
URL = {http://dx.doi.org/10.1137/S0895480196298378},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Weng/97a,
AUTHOR = {Weng, J.F.},
TITLE = {Linear Steiner trees for infinite spirals},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {10},
NUMBER = {3},
PAGES = {388-398},
YEAR = {1997},
EDITOR = {Monma, Clyde L.},
KEYWORDS = {steiner tree, spiral},
URL = {http://dx.doi.org/10.1137/S0895480194274030},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Corneil-Olariu-Stewart/97,
AUTHOR = {Corneil, Derek G. and Olariu, Stephan and Stewart, Lorna},
TITLE = {Asteroidal triple-free graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {10},
NUMBER = {3},
PAGES = {399-430},
YEAR = {1997},
EDITOR = {Monma, Clyde L.},
KEYWORDS = {asteroidal triples, asteroidal triple-free graphs, interval graphs, permutation graphs, trapezoid graphs, cocomparability graphs, dominating pairs, graph decompositions, structural graph theory},
URL = {http://dx.doi.org/10.1137/S0895480193250125},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Sarangarajan/97,
AUTHOR = {Sarangarajan, A.},
TITLE = {A lower bound for adjacencies on the Traveling Salesman polytope},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {10},
NUMBER = {3},
PAGES = {431-435},
YEAR = {1997},
EDITOR = {Monma, Clyde L.},
KEYWORDS = {asymmetric traveling salesman polytope, adjacency},
URL = {http://dx.doi.org/10.1137/S0895480195283798},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Provan-Chari/97,
AUTHOR = {Provan, J. Scott and Chari, Manoj K.},
TITLE = {Counting problems associated with Steiner trees in graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {10},
NUMBER = {3},
PAGES = {436-446},
YEAR = {1997},
EDITOR = {Monma, Clyde L.},
KEYWORDS = {steiner tree, cut, counting, enumeration},
URL = {http://dx.doi.org/10.1137/S0895480194262862},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Tillich-Zemor/97,
AUTHOR = {Tillich, Jean-Pierre and Z{\'e}mor, Gilles},
TITLE = {Optimal cycle codes constructed from Ramanujan graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {10},
NUMBER = {3},
PAGES = {447-459},
YEAR = {1997},
EDITOR = {Monma, Clyde L.},
KEYWORDS = {ramanujan graph, cycle code, error probability},
URL = {http://dx.doi.org/10.1137/S0895480195292065},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Adams-Shader/97,
AUTHOR = {Adams, Michael J. and Shader, Bryan L.},
TITLE = {A construction for $(t,m,s)$-nets in base $q$},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {10},
NUMBER = {3},
PAGES = {460-468},
YEAR = {1997},
EDITOR = {Monma, Clyde L.},
KEYWORDS = {$(t,m,s)$-nets, generalized orthogonal arrays, linear codes},
URL = {http://dx.doi.org/10.1137/S0895480195295975},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Nagamochi-Nishimura-Ibaraki/97,
AUTHOR = {Nagamochi, Hiroshi and Nishimura, Kazuhiro and Ibaraki, Toshihide},
TITLE = {Computing all small cuts in an undirected network},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {10},
NUMBER = {3},
PAGES = {469-481},
YEAR = {1997},
EDITOR = {Monma, Clyde L.},
KEYWORDS = {minimum cuts, graphs, edge-splitting, polynomial algorithm},
URL = {http://dx.doi.org/10.1137/S0895480194271323},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Fang-Venkatesh/97,
AUTHOR = {Fang, Shao C. and Venkatesh, Santosh S.},
TITLE = {A threshold function for harmonic update},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {10},
NUMBER = {3},
PAGES = {482-498},
YEAR = {1997},
EDITOR = {Monma, Clyde L.},
KEYWORDS = {polytopes, threshold function, randomized algorithm, harmonic update, binary integer programming, neural networks, large deviations, normal approximation, poisson approximation},
URL = {http://dx.doi.org/10.1137/S0895480195283701},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Yen/97,
AUTHOR = {Yen, Lily},
TITLE = {A combinatorial proof for Stockhausen's problem},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {10},
NUMBER = {3},
PAGES = {499-504},
YEAR = {1997},
EDITOR = {Monma, Clyde L.},
KEYWORDS = {stockhausen, sequences, bijections, sign-reversing involution, gray codes},
URL = {http://dx.doi.org/10.1137/S0895480195288741},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Baiou-Mahjoub/97,
AUTHOR = {Ba{\"i}ou, Mourad and Mahjoub, Ali Ridha},
TITLE = {Steiner 2-edge connected subgraph polytopes on series-parallel graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {10},
NUMBER = {3},
PAGES = {505-514},
YEAR = {1997},
EDITOR = {Monma, Clyde L.},
KEYWORDS = {steiner 2-edge connected subgraphs, polytopes, series-parallel graphs},
URL = {http://dx.doi.org/10.1137/S0895480193259813},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Brightwell-Trotter/97,
AUTHOR = {Brightwell, Graham R. and Trotter, William T.},
TITLE = {The order dimension of planar maps},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {10},
NUMBER = {4},
PAGES = {515-528},
YEAR = {1997},
EDITOR = {Monma, Clyde L.},
KEYWORDS = {partially ordered sets, dimension, planar maps, planar graphs, convex polytopes},
URL = {http://dx.doi.org/10.1137/S0895480192238561},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Telle-Proskurowski/97,
AUTHOR = {Telle, Jan Arne and Proskurowski, Andrzej},
TITLE = {Algorithms for vertex partitioning problems on partial $k$-trees},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {10},
NUMBER = {4},
PAGES = {529-550},
YEAR = {1997},
EDITOR = {Monma, Clyde L.},
KEYWORDS = {treewidth, algorithms, implementations, graph partitioning},
URL = {http://dx.doi.org/10.1137/S0895480194275825},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Goldberg-Kennedy/97,
AUTHOR = {Goldberg, Andrew V. and Kennedy, Robert},
TITLE = {Global price updates help},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {10},
NUMBER = {4},
PAGES = {551-572},
YEAR = {1997},
EDITOR = {Monma, Clyde L.},
KEYWORDS = {assignment problem, cost scaling, bipartite matching, dual update, push-relabel algorithm, zero-one flow},
URL = {http://dx.doi.org/10.1137/S0895480194281185},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Phillips-Stein-Wein/97,
AUTHOR = {Phillips, Cynthia and Stein, Clifford and Wein, Joel},
TITLE = {Task scheduling in networks},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {10},
NUMBER = {4},
PAGES = {573-598},
YEAR = {1997},
EDITOR = {Monma, Clyde L.},
KEYWORDS = {scheduling, approximation algorithm, np-completeness, networks},
URL = {http://dx.doi.org/10.1137/S0895480194279057},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Heath-Pemmaraju/97,
AUTHOR = {Heath, Lenwood S. and Pemmaraju, Sriram V.},
TITLE = {Stack and queue layouts of posets},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {10},
NUMBER = {4},
PAGES = {599-625},
YEAR = {1997},
EDITOR = {Monma, Clyde L.},
KEYWORDS = {poset, queue layout, stack layout, book embedding, hasse diagram, jumpnumber},
URL = {http://dx.doi.org/10.1137/S0895480193252380},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Bouchet/97,
AUTHOR = {Bouchet, Andr{\'e}},
TITLE = {Multimatroids I. Coverings by independent sets},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {10},
NUMBER = {4},
PAGES = {626-646},
YEAR = {1997},
EDITOR = {Monma, Clyde L.},
KEYWORDS = {matroids, euler tours, coverings},
URL = {http://dx.doi.org/10.1137/S0895480193242591},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Kushilevitz-Mansour/97,
AUTHOR = {Kushilevitz, Eyal and Mansour, Yishay},
TITLE = {Randomness in private computations},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {10},
NUMBER = {4},
PAGES = {647-661},
YEAR = {1997},
EDITOR = {Monma, Clyde L.},
KEYWORDS = {randomness, small probability spaces, privacy, xor function},
URL = {http://dx.doi.org/10.1137/S0895480196306130},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Peer-Shamir/97,
AUTHOR = {Pe'er, Itsik and Shamir, Ron},
TITLE = {Realizing interval graphs with size and distance constraints},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {10},
NUMBER = {4},
PAGES = {662-687},
YEAR = {1997},
EDITOR = {Monma, Clyde L.},
KEYWORDS = {graph algorithms, computational biology, $NP$-completeness, interval graphs, size constraints, distance constraints},
URL = {http://dx.doi.org/10.1137/S0895480196306373},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}