@article{Schrijver-Seymour-Winkler/98,
AUTHOR = {Schrijver, Alexander and Seymour, Paul and Winkler, Peter},
TITLE = {The ring loading problem},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {11},
NUMBER = {1},
PAGES = {1-14},
YEAR = {1998},
EDITOR = {Shmoys, David B.},
KEYWORDS = {sonet ring, load balancing, optical network design},
URL = {http://dx.doi.org/10.1137/S0895480195294994},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Fishburn-Kim-Lagarias-Wright/98,
AUTHOR = {Fishburn, P.C. and Kim, J.H. and Lagarias, J.C. and Wright, P.E.},
TITLE = {Interference-minimizing colorings of regular graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {11},
NUMBER = {1},
PAGES = {15-40},
YEAR = {1998},
EDITOR = {Shmoys, David B.},
KEYWORDS = {graph coloring, interference threshold, regular graph},
URL = {http://dx.doi.org/10.1137/S089548019427545X},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Stinson-Wei/98,
AUTHOR = {Stinson, D.R. and Wei, R.},
TITLE = {Combinatorial properties and constructions of traceability schemes and frameproof codes},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {11},
NUMBER = {1},
PAGES = {41-53},
YEAR = {1998},
EDITOR = {Shmoys, David B.},
KEYWORDS = {traceability scheme, frameproof code, $t$-design, hash family},
URL = {http://dx.doi.org/10.1137/S0895480196304246},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Calkin-Wilf/98,
AUTHOR = {Calkin, Neil J. and Wilf, Herbert S.},
TITLE = {The number of independent sets in a grid graph},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {11},
NUMBER = {1},
PAGES = {54-60},
YEAR = {1998},
EDITOR = {Shmoys, David B.},
KEYWORDS = {independent sets, grid graphs},
URL = {http://dx.doi.org/10.1137/S089548019528993X},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Kushilevitz-Rosen/98,
AUTHOR = {Kushilevitz, Eyal and Ros{\'e}n, Adi},
TITLE = {A randomness-rounds tradeoff in private computation},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {11},
NUMBER = {1},
PAGES = {61-80},
YEAR = {1998},
EDITOR = {Shmoys, David B.},
KEYWORDS = {private distributed computations, randomness, lower bounds, sensitivity},
URL = {http://dx.doi.org/10.1137/S089548019427634X},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Deneko-Rudolf-Woeginger/98,
AUTHOR = {De{\u{\i}}neko, Vladimir G. and Rudolf, R{\"u}diger and Woeginger, Gerhard J.},
TITLE = {Sometimes travelling is easy: The master tour problem},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {11},
NUMBER = {1},
PAGES = {81-93},
YEAR = {1998},
EDITOR = {Shmoys, David B.},
KEYWORDS = {travelling salesman problem, kalmanson condition, master tour, combinatorial optimization},
URL = {http://dx.doi.org/10.1137/S0895480195281878},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Proskurowski-Ruskey-Smith/98,
AUTHOR = {Proskurowski, Andrzej and Ruskey, Frank and Smith, Malcolm},
TITLE = {Analysis of algorithms for listing equivalence classes of $k$-ary strings},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {11},
NUMBER = {1},
PAGES = {94-109},
YEAR = {1998},
EDITOR = {Shmoys, David B.},
KEYWORDS = {combinatorial generation, $k$-ary strings, stirling numbers, restricted growth function, $k$-paths},
URL = {http://dx.doi.org/10.1137/S0895480192234009},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Riordan/98,
AUTHOR = {Riordan, Oliver},
TITLE = {An ordering on the even discrete torus},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {11},
NUMBER = {1},
PAGES = {110-127},
YEAR = {1998},
EDITOR = {Shmoys, David B.},
KEYWORDS = {isoperimetric inequality, discrete torus},
URL = {http://dx.doi.org/10.1137/S0895480194278234},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Guichard/98,
AUTHOR = {Guichard, David R.},
TITLE = {Competition graphs of Hamiltonian digraphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {11},
NUMBER = {1},
PAGES = {128-134},
YEAR = {1998},
EDITOR = {Shmoys, David B.},
KEYWORDS = {competition graph, hamiltonian digraph},
URL = {http://dx.doi.org/10.1137/S089548019629735X},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Poonen-Rubinstein/98,
AUTHOR = {Poonen, Bjorn and Rubinstein, Michael},
TITLE = {The number of intersection points made by the diagonals of a regular polygon},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {11},
NUMBER = {1},
PAGES = {135-156},
YEAR = {1998},
EDITOR = {Shmoys, David B.},
KEYWORDS = {regular polygons, diagonals, intersection points, roots of unity, adventitious quadrangles},
URL = {http://dx.doi.org/10.1137/S0895480195281246},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Fiduccia-Forcade-Zito/98,
AUTHOR = {Fiduccia, Charles M. and Forcade, Rodney W. and Zito, Jennifer S.},
TITLE = {Geometry and diameter bounds of directed Cayley graphs of Abelian groups},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {11},
NUMBER = {1},
PAGES = {157-167},
YEAR = {1998},
EDITOR = {Shmoys, David B.},
KEYWORDS = {cayley graphs, abelian groups, diameter, network topologies, translational tilings, degree-diameter problems},
URL = {http://dx.doi.org/10.1137/S0895480195286456},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Bodlaender-Deogun-Jansen-Kloks-Kratsch-Muller-Tuza/98,
AUTHOR = {Bodlaender, Hans L. and Deogun, Jitender S. and Jansen, Klaus and Kloks, Ton and Kratsch, Dieter and M{\"u}ller, Haiko and Tuza, Zsolt},
TITLE = {Rankings of graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {11},
NUMBER = {1},
PAGES = {168-181},
YEAR = {1998},
EDITOR = {Shmoys, David B.},
KEYWORDS = {ranking of graphs, vertex ranking, edge ranking, graph algorithms, treewidth, graph coloring},
URL = {http://dx.doi.org/10.1137/S0895480195282550},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Chen-Zame-Odlyzko-Shepp/98,
AUTHOR = {Chen, Robert W. and Zame, Alan and Odlyzko, Andrew M. and Shepp, Larry A.},
TITLE = {An optimal acceptance policy for an urn scheme},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {11},
NUMBER = {2},
PAGES = {183-195},
YEAR = {1998},
EDITOR = {Shmoys, David B.},
KEYWORDS = {optimal stopping, acceptance policy, urn models, bayesian approach},
URL = {http://dx.doi.org/10.1137/S0895480195282148},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Kleinberg-Goemans/98,
AUTHOR = {Kleinberg, Jon and Goemans, Michel X.},
TITLE = {The Lov{\'a}sz theta function and a semidefinite programming relaxation of vertex cover},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {11},
NUMBER = {2},
PAGES = {196-204},
YEAR = {1998},
EDITOR = {Shmoys, David B.},
KEYWORDS = {vertex cover, independent sets, approximation algorithms, semidefinite programming.},
URL = {http://dx.doi.org/10.1137/S0895480195287541},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Etzion-Vardy/98,
AUTHOR = {Etzion, Tuvi and Vardy, Alexander},
TITLE = {On perfect codes and tilings: Problems and solutions},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {11},
NUMBER = {2},
PAGES = {205-223},
YEAR = {1998},
EDITOR = {Shmoys, David B.},
KEYWORDS = {perfect codes, tilings, intersection, embedding, rank, kernel},
URL = {http://dx.doi.org/10.1137/S0895480196309171},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Bafna-Pevzner/98,
AUTHOR = {Bafna, Vineet and Pevzner, Pavel A.},
TITLE = {Sorting by transpositions},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {11},
NUMBER = {2},
PAGES = {224-240},
YEAR = {1998},
EDITOR = {Shmoys, David B.},
KEYWORDS = {computational molecular biology, genome rearrangements, transpositions, the symmetric group, approximation algorithm},
URL = {http://dx.doi.org/10.1137/S089548019528280X},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Mitchell-Paterson/98,
AUTHOR = {Mitchell, Chris J. and Paterson, Kenneth G.},
TITLE = {Perfect factors from cyclic codes and interleaving},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {11},
NUMBER = {2},
PAGES = {241-264},
YEAR = {1998},
EDITOR = {Shmoys, David B.},
KEYWORDS = {de bruijn sequence, de bruijn graph, window sequence, perfect factor, cyclic code, lempel homomorphism, interleaving},
URL = {http://dx.doi.org/10.1137/S089548019630649X},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Feng-Kwak-Kim-Lee/98,
AUTHOR = {Feng, Rongquan and Kwak, Jin Ho and Kim, Juyoung and Lee, Jaeun},
TITLE = {Isomorphism classes of concrete graph coverings},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {11},
NUMBER = {2},
PAGES = {265-272},
YEAR = {1998},
EDITOR = {Shmoys, David B.},
KEYWORDS = {concrete graph coverings, voltage assignments, enumeration},
URL = {http://dx.doi.org/10.1137/S089548019630443X},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Kwak-Chun-Lee/98,
AUTHOR = {Kwak, Jin Ho and Chun, Jang-Ho and Lee, Jaeun},
TITLE = {Enumeration of regular graph coverings having finite Abelian covering transformation groups},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {11},
NUMBER = {2},
PAGES = {273-285},
YEAR = {1998},
EDITOR = {Shmoys, David B.},
KEYWORDS = {regular coverings of a graph, (ordinary) voltage assignments, enumeration},
URL = {http://dx.doi.org/10.1137/S0895480196304428},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Hofmeister/98,
AUTHOR = {Hofmeister, Michael},
TITLE = {A note on counting connected graph covering projections},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {11},
NUMBER = {2},
PAGES = {286-292},
YEAR = {1998},
EDITOR = {Shmoys, David B.},
KEYWORDS = {graph covering, enumeration, p{\'{o}}lya's theorem},
URL = {http://dx.doi.org/10.1137/S0895480195293873},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Lenart/98,
AUTHOR = {Lenart, Cristian},
TITLE = {A generalized distance in graphs and centered partitions},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {11},
NUMBER = {2},
PAGES = {293-304},
YEAR = {1998},
EDITOR = {Shmoys, David B.},
KEYWORDS = {chain distance, heyting semigroup, generalized distance, semiring, clustering, minimum centered forest, centered partition},
URL = {http://dx.doi.org/10.1137/S089548019426303X},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Espona-Serra/98,
AUTHOR = {Espona, M. and Serra, O.},
TITLE = {Cayley digraphs based on the de Bruijn networks},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {11},
NUMBER = {2},
PAGES = {305-317},
YEAR = {1998},
EDITOR = {Shmoys, David B.},
KEYWORDS = {cayley digraphs, permutation networks, routing algorithms},
URL = {http://dx.doi.org/10.1137/S0895480196288644},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Luczak/98,
AUTHOR = {{\L}uczak, Tomasz},
TITLE = {A greedy algorithm estimating the height of random trees},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {11},
NUMBER = {2},
PAGES = {318-329},
YEAR = {1998},
EDITOR = {Shmoys, David B.},
KEYWORDS = {random trees, greedy algorithms},
URL = {http://dx.doi.org/10.1137/S0895480193258960},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Collins/98b,
AUTHOR = {Collins, Karen L.},
TITLE = {Circulants and sequences},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {11},
NUMBER = {2},
PAGES = {330-339},
YEAR = {1998},
EDITOR = {Shmoys, David B.},
KEYWORDS = {cayley graph, chromatic difference sequence, circulant, graph homomorphism, independence ratio, no-homomorphism lemma, partitionable graph},
URL = {http://dx.doi.org/10.1137/S0895480193252136},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Galeana-Sanchez-Li/98,
AUTHOR = {Galeana-S{\'a}nchez, H. and Li, Xueliang},
TITLE = {Semikernels and $(k,l)$-kernels in digraphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {11},
NUMBER = {2},
PAGES = {340-346},
YEAR = {1998},
EDITOR = {Shmoys, David B.},
KEYWORDS = {kernel, $(k,l)$-kernels, line digraph, semikernels},
URL = {http://dx.doi.org/10.1137/S0895480195291370},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Komlos-Ma-Szemeredi/98,
AUTHOR = {Koml{\'o}s, J{\'a}nos and Ma, Yuan and Szemer{\'e}di, Endre},
TITLE = {Matching nuts and bolts in $O(n \log n)$ time},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {11},
NUMBER = {3},
PAGES = {347-372},
YEAR = {1998},
EDITOR = {Shmoys, David B.},
KEYWORDS = {sorting, matching, selection, parallel computation, aks sorting algorithm, random graphs},
URL = {http://dx.doi.org/10.1137/S0895480196304982},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Rispoli-Cosares/98,
AUTHOR = {Rispoli, Fred J. and Cosares, Steven},
TITLE = {A bound of 4 for the diameter of the symmetric Traveling Salesman polytope},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {11},
NUMBER = {3},
PAGES = {373-380},
YEAR = {1998},
EDITOR = {Shmoys, David B.},
KEYWORDS = {diameter, polytope, travelling salesman problem},
URL = {http://dx.doi.org/10.1137/S0895480196312462},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Lichtner/98,
AUTHOR = {Lichtner, Jonathan},
TITLE = {Iterating an $\alpha$-ary Gray code},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {11},
NUMBER = {3},
PAGES = {381-386},
YEAR = {1998},
EDITOR = {Shmoys, David B.},
KEYWORDS = {gray codes},
URL = {http://dx.doi.org/10.1137/S0895480196308736},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Faigle-Kern/98,
AUTHOR = {Faigle, Ulrich and Kern, Walter},
TITLE = {Approximate core allocation for binpacking games},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {11},
NUMBER = {3},
PAGES = {387-399},
YEAR = {1998},
EDITOR = {Shmoys, David B.},
KEYWORDS = {binpacking, core, cost, n-person game},
URL = {http://dx.doi.org/10.1137/S0895480296308074},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Czumaj-Gasieniec-Pelc/98,
AUTHOR = {Czumaj, Artur and G{\c{a}}sieniec, Leszek and Pelc, Andrzej},
TITLE = {Time and cost trade-offs in gossiping},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {11},
NUMBER = {3},
PAGES = {400-413},
YEAR = {1998},
EDITOR = {Shmoys, David B.},
KEYWORDS = {algorithm, lower bounds, gossiping, time, cost},
URL = {http://dx.doi.org/10.1137/S0895480295292934},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Chepoi/98,
AUTHOR = {Chepoi, Victor},
TITLE = {On distance-preserving and domination elimination orderings},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {11},
NUMBER = {3},
PAGES = {414-436},
YEAR = {1998},
EDITOR = {Shmoys, David B.},
KEYWORDS = {distance-preserving ordering, domination elimination ordering, breadth-first search, lexicographic breadth-first search, weakly modular graph},
URL = {http://dx.doi.org/10.1137/S0895480195291230},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Brandstadt-Dragan-Chepoi-Voloshin/98,
AUTHOR = {Brandst{\"a}dt, Andreas and Dragan, Feodor and Chepoi, Victor and Voloshin, Vitaly},
TITLE = {Dually chordal graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {11},
NUMBER = {3},
PAGES = {437-455},
YEAR = {1998},
EDITOR = {Shmoys, David B.},
KEYWORDS = {graphs, hypergraphs, tree structure, hypertrees, duality, chordal graphs, clique hypergraphs, neighborhood hypergraphs, disk hypergraphs, helly property, chordality of line graphs, maximum neighborhood orderings, linear time recognition, doubly chordal graphs, strongly chordal graphs, bipartite incidence graphs},
URL = {http://dx.doi.org/10.1137/S0895480193253415},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Rubinov-Timkovsky/98,
AUTHOR = {Rubinov, Anatoly R. and Timkovsky, Vadim G.},
TITLE = {String noninclusion optimization problems},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {11},
NUMBER = {3},
PAGES = {456-467},
YEAR = {1998},
EDITOR = {Shmoys, David B.},
KEYWORDS = {string inclusion, longest, shortest, common, subsequence, substring, supersequence, superstring, polynomial-time algorithm, $NP$-hard problem},
URL = {http://dx.doi.org/10.1137/S0895480192234277},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Kochol/98a,
AUTHOR = {Kochol, Martin},
TITLE = {Partial intersection theorem and flows in abstract networks},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {11},
NUMBER = {3},
PAGES = {468-486},
YEAR = {1998},
EDITOR = {Shmoys, David B.},
KEYWORDS = {partial intersection theorem, abstract network, (generalized, quasi) polymatroid, matroid, v-transversal, v-gammoid, operations on matroids and (generalized) polymatroids, edge-cut},
URL = {http://dx.doi.org/10.1137/S0895480195295987},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Ramras/98,
AUTHOR = {Ramras, Mark},
TITLE = {Congestion-free routings of linear complement permutations},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {11},
NUMBER = {3},
PAGES = {487-500},
YEAR = {1998},
EDITOR = {Shmoys, David B.},
KEYWORDS = {hypercube, routing, congestion-free, linear complement permutation},
URL = {http://dx.doi.org/10.1137/S0895480196301461},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Padro-Morillo-Munoz/98,
AUTHOR = {Padr{\'o}, C. and Morillo, P. and Mu{\~n}oz, X.},
TITLE = {Fault-tolerant fixed routings in some families of digraphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {11},
NUMBER = {3},
PAGES = {501-509},
YEAR = {1998},
EDITOR = {Shmoys, David B.},
KEYWORDS = {fault-tolerant interconnection networks, fixed routings, surviving route digraph, generalized de bruijn and kautz digraphs, iterated line digraphs},
URL = {http://dx.doi.org/10.1137/S0895480195280940},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Chor-Sudan/98,
AUTHOR = {Chor, Benny and Sudan, Madhu},
TITLE = {A geometric approach to betweenness},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {11},
NUMBER = {4},
PAGES = {511-523},
YEAR = {1998},
EDITOR = {Shmoys, David B.},
KEYWORDS = {approximation algorithm, semidefinite programming, np-completeness, computational biology},
URL = {http://dx.doi.org/10.1137/S0895480195296221},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Gerards-Shepherd/98,
AUTHOR = {Gerards, A.M.H. and Shepherd, F.B.},
TITLE = {The graphs with all subgraphs $t$-perfect},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {11},
NUMBER = {4},
PAGES = {524-545},
YEAR = {1998},
EDITOR = {Shmoys, David B.},
KEYWORDS = {stable sets, polyhedra, odd circuits, decomposition},
URL = {http://dx.doi.org/10.1137/S0895480196306361},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Even-Litman-Rosenberg/98,
AUTHOR = {Even, Shimon and Litman, Ami and Rosenberg, Arnold L.},
TITLE = {Monochromatic paths and triangulated graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {11},
NUMBER = {4},
PAGES = {546-556},
YEAR = {1998},
EDITOR = {Shmoys, David B.},
KEYWORDS = {planar graphs, triangulated graphs},
URL = {http://dx.doi.org/10.1137/S0895480195283336},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Frank-Ibaraki-Nagamochi/98,
AUTHOR = {Frank, Andr{\'a}s and Ibaraki, Toshihide and Nagamochi, Hiroshi},
TITLE = {Two arc-disjoint paths in Eulerian digraphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {11},
NUMBER = {4},
PAGES = {557-589},
YEAR = {1998},
EDITOR = {Shmoys, David B.},
KEYWORDS = {eulerian digraph, disjoint paths, minimum cut, planar graph, polynomial time algorithm},
URL = {http://dx.doi.org/10.1137/S0895480196304970},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Guan-Zhu/98,
AUTHOR = {Guan, D.J. and Zhu, Xuding},
TITLE = {Multiple capacity vehicle routing on paths},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {11},
NUMBER = {4},
PAGES = {590-602},
YEAR = {1998},
EDITOR = {Shmoys, David B.},
KEYWORDS = {vehicle routing, motion planning, graph algorithms},
URL = {http://dx.doi.org/10.1137/S0895480197319951},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Bang-Jensen-Jordan/98,
AUTHOR = {Bang-Jensen, J{\o}rgen and Jord{\'a}n, Tibor},
TITLE = {Edge-connectivity augmentation preserving simplicity},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {11},
NUMBER = {4},
PAGES = {603-623},
YEAR = {1998},
EDITOR = {Shmoys, David B.},
KEYWORDS = {edge-connectivity augmentation of graphs, network design, connectivity, combinatorial optimization},
URL = {http://dx.doi.org/10.1137/S0895480197318878},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Paturi-Zane/98,
AUTHOR = {Paturi, Ramamohan and Zane, Francis},
TITLE = {Dimension of projections in Boolean functions},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {11},
NUMBER = {4},
PAGES = {624-632},
YEAR = {1998},
EDITOR = {Shmoys, David B.},
KEYWORDS = {projections, ramsey theory, circuit complexity},
URL = {http://dx.doi.org/10.1137/S0895480197318313},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Hwang-Chang/98,
AUTHOR = {Hwang, Shiow-Fen and Chang, Gerard J.},
TITLE = {$k$-neighborhood-covering and -independence problems for chordal graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {11},
NUMBER = {4},
PAGES = {633-643},
YEAR = {1998},
EDITOR = {Shmoys, David B.},
KEYWORDS = {$k$-neighborhood-covering, $k$-neighborhood-independence, chordal graph, strongly chordal graph, strong elimination order},
URL = {http://dx.doi.org/10.1137/S0895480193244322},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Caro-Ellingham-Ramey/98,
AUTHOR = {Caro, Yair and Ellingham, M.N. and Ramey, J.E.},
TITLE = {Local structure when all maximal independent sets have equal weight},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {11},
NUMBER = {4},
PAGES = {644-654},
YEAR = {1998},
EDITOR = {Shmoys, David B.},
KEYWORDS = {well-covered graph, maximal independent set, local structure, polynomial time algorithm, recognition algorithm, hypergraph matching, independence system},
URL = {http://dx.doi.org/10.1137/S0895480196300479},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Gimbel-Trenk/98,
AUTHOR = {Gimbel, John G. and Trenk, Ann N.},
TITLE = {On the weakness of an ordered set},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {11},
NUMBER = {4},
PAGES = {655-663},
YEAR = {1998},
EDITOR = {Shmoys, David B.},
KEYWORDS = {partially ordered sets, weak orders},
URL = {http://dx.doi.org/10.1137/S0895480197319628},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Han/98,
AUTHOR = {Han, Yunghsiang S.},
TITLE = {A new decoding algorithm for complete decoding of linear block codes},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {11},
NUMBER = {4},
PAGES = {664-671},
YEAR = {1998},
EDITOR = {Shmoys, David B.},
KEYWORDS = {coding, decoding, linear codes, block codes},
URL = {http://dx.doi.org/10.1137/S0895480197323974},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}