@article{Goldberg-Rao/99,
AUTHOR = {Goldberg, Andrew V. and Rao, Satish},
TITLE = {Flows in undirected unit capacity networks},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {12},
NUMBER = {1},
PAGES = {1-5},
YEAR = {1999},
EDITOR = {Shmoys, David B.},
KEYWORDS = {algorithms, combinatorial optimization, maximum flow, undirected graphs, sparcification},
URL = {http://dx.doi.org/10.1137/S089548019733103X},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Mohar/99a,
AUTHOR = {Mohar, Bojan},
TITLE = {A linear time algorithm for embedding graphs in an arbitrary surface},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {12},
NUMBER = {1},
PAGES = {6-26},
YEAR = {1999},
EDITOR = {Shmoys, David B.},
KEYWORDS = {surface embedding, obstruction, algorithm, graph embedding, forbidden subgraph, forbidden minor},
URL = {http://dx.doi.org/10.1137/S089548019529248X},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Phelps-LeVan/99,
AUTHOR = {Phelps, Kevin T. and LeVan, Mike},
TITLE = {Nonsystematic perfect codes},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {12},
NUMBER = {1},
PAGES = {27-34},
YEAR = {1999},
EDITOR = {Shmoys, David B.},
KEYWORDS = {perfect codes},
URL = {http://dx.doi.org/10.1137/S0895480196312206},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Rifa/99,
AUTHOR = {Rif{\`a}, Josep},
TITLE = {Well-ordered Steiner triple systems and 1-perfect partitions of the $n$-cube},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {12},
NUMBER = {1},
PAGES = {35-47},
YEAR = {1999},
EDITOR = {Shmoys, David B.},
KEYWORDS = {1-perfect binary codes, 1-perfect partitions, steiner triple systems, sloops, distance-compatible action},
URL = {http://dx.doi.org/10.1137/S0895480197330722},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Czygrinow-Poljak-Rodl/99,
AUTHOR = {Czygrinow, A. and Poljak, S. and R{\"o}dl, V.},
TITLE = {Constructive quasi-Ramsey numbers and tournament ranking},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {12},
NUMBER = {1},
PAGES = {48-63},
YEAR = {1999},
EDITOR = {Shmoys, David B.},
KEYWORDS = {discrepancy, linear ordering problem, derandomization, regularity lemma},
URL = {http://dx.doi.org/10.1137/S0895480197318301},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Zhang/99b,
AUTHOR = {Zhang, Louxin},
TITLE = {Optimal bounds for matching routing on trees},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {12},
NUMBER = {1},
PAGES = {64-77},
YEAR = {1999},
EDITOR = {Shmoys, David B.},
KEYWORDS = {matching routing, off-line algorithms, trees},
URL = {http://dx.doi.org/10.1137/S0895480197323159},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Kao-Tate/99,
AUTHOR = {Kao, Ming-Yang and Tate, Stephen R.},
TITLE = {On-line difference maximization},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {12},
NUMBER = {1},
PAGES = {78-90},
YEAR = {1999},
EDITOR = {Shmoys, David B.},
KEYWORDS = {analysis of algorithms, on-line algorithms, financial games, secretary problem},
URL = {http://dx.doi.org/10.1137/S0895480196307445},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Caprara/99a,
AUTHOR = {Caprara, Alberto},
TITLE = {Sorting permutations by reversals and Eulerian cycle decompositions},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {12},
NUMBER = {1},
PAGES = {91-110},
YEAR = {1999},
EDITOR = {Shmoys, David B.},
KEYWORDS = {sorting by reversals, breakpoint graph, eulerian graph, cycle decomposition, complexity},
URL = {http://dx.doi.org/10.1137/S089548019731994X},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Imrich-Klavzzar-Mulder/99,
AUTHOR = {Imrich, Wilfried and Klav{\v{z}}zar, Sandi and Mulder, Henry Martyn},
TITLE = {Median graphs and triangle-free graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {12},
NUMBER = {1},
PAGES = {111-118},
YEAR = {1999},
EDITOR = {Shmoys, David B.},
KEYWORDS = {median graph, triangle-free graph, algorithm, complexity},
URL = {http://dx.doi.org/10.1137/S0895480197323494},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Dragan-Nicolai-Brandstadt/99,
AUTHOR = {Dragan, Feodor F. and Nicolai, Falk and Brandst{\"a}dt, Andreas},
TITLE = {Convexity and HHD-free graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {12},
NUMBER = {1},
PAGES = {119-135},
YEAR = {1999},
EDITOR = {Shmoys, David B.},
KEYWORDS = {convexity, convex geometry, antimatroid, chordal graphs, hhd-free graphs, weak bipolarizable graphs, semisimplicial ordering, lexicographic breadth first search, dominating clique problem},
URL = {http://dx.doi.org/10.1137/S0895480195321718},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Servatius-Whiteley/99,
AUTHOR = {Servatius, Brigitte and Whiteley, Walter},
TITLE = {Constraining plane configurations in computer-aided design: Combinatorics of directions and lengths},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {12},
NUMBER = {1},
PAGES = {136-153},
YEAR = {1999},
EDITOR = {Shmoys, David B.},
KEYWORDS = {computer-aided design, constraint frameworks, generic rigidity, matroid, parallel drawings, plane configurations},
URL = {http://dx.doi.org/10.1137/S0895480196307342},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Flajolet-Prodinger/99,
AUTHOR = {Flajolet, Philippe and Prodinger, Helmut},
TITLE = {On Stirling numbers for complex arguments and Hankel contours},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {12},
NUMBER = {2},
PAGES = {155-159},
YEAR = {1999},
EDITOR = {Shmoys, David B.},
KEYWORDS = {stirling numbers, complex arguments, hankel contours},
URL = {http://dx.doi.org/10.1137/S0895480198332594},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Bang-Jensen-Gabow-Jordan-Szigeti/99,
AUTHOR = {Bang-Jensen, J{\o}rgen and Gabow, Harold N. and Jord{\'a}n, Tibor and Szigeti, Zolt{\'a}n},
TITLE = {Edge-connectivity augmentation with partition constraints},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {12},
NUMBER = {2},
PAGES = {160-207},
YEAR = {1999},
EDITOR = {Shmoys, David B.},
KEYWORDS = {edge-connectivity augmentation of graphs, edge splitting, connectivity, rigidity, combinatorial algorithms},
URL = {http://dx.doi.org/10.1137/S0895480197324700},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Frieze-Karonski-Thoma/99,
AUTHOR = {Frieze, Alan and Karo{\'n}ski, Michal and Thoma, Lubo{\v{s}}},
TITLE = {On perfect matchings and Hamilton cycles in sums of random trees},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {12},
NUMBER = {2},
PAGES = {208-216},
YEAR = {1999},
EDITOR = {Shmoys, David B.},
KEYWORDS = {sums of random trees, perfect matching, hamilton cycle},
URL = {http://dx.doi.org/10.1137/S0895480196313790},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Gao-Wormald/99,
AUTHOR = {Gao, Zhicheng and Wormald, Nicholas C.},
TITLE = {The size of the largest components in random planar maps},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {12},
NUMBER = {2},
PAGES = {217-228},
YEAR = {1999},
EDITOR = {Shmoys, David B.},
KEYWORDS = {planar map, 4-connected component, triangulation, cubic graph},
URL = {http://dx.doi.org/10.1137/S0895480195292053},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Chen-Kanchi/99,
AUTHOR = {Chen, Jianer and Kanchi, Saroja P.},
TITLE = {Graph ear decompositions and graph embeddings},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {12},
NUMBER = {2},
PAGES = {229-242},
YEAR = {1999},
EDITOR = {Shmoys, David B.},
KEYWORDS = {graph connectivity, graph embedding, ear decomposition, graph maximum genus, algorithm},
URL = {http://dx.doi.org/10.1137/S0895480196304234},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Laihonen-Litsyn/99,
AUTHOR = {Laihonen, Tero and Litsyn, Simon},
TITLE = {New bounds on covering radius as a function of dual distance},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {12},
NUMBER = {2},
PAGES = {243-251},
YEAR = {1999},
EDITOR = {Shmoys, David B.},
KEYWORDS = {covering radius, dual distance, hahn polynomials, discrete chebyshev polynomials},
URL = {http://dx.doi.org/10.1137/S0895480197331703},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Du-Hwang-Xue/99,
AUTHOR = {Du, Ding-Zhu and Hwang, Frank K. and Xue, Guoliang},
TITLE = {Interconnecting highways},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {12},
NUMBER = {2},
PAGES = {252-261},
YEAR = {1999},
EDITOR = {Shmoys, David B.},
KEYWORDS = {interconnecting networks, optimality conditions, steiner trees},
URL = {http://dx.doi.org/10.1137/S089548019732653X},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Janssen-Kilakos/99,
AUTHOR = {Janssen, Jeannette and Kilakos, Kyriakos},
TITLE = {Bounded stable sets: Polytopes and colorings},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {12},
NUMBER = {2},
PAGES = {262-275},
YEAR = {1999},
EDITOR = {Shmoys, David B.},
KEYWORDS = {fractional graph coloring, bounded coloring, stable set polytope},
URL = {http://dx.doi.org/10.1137/S089548019630978X},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Broersma-Kloks-Kratsch-Muller/99,
AUTHOR = {Broersma, Hajo and Kloks, Ton and Kratsch, Dieter and M{\"u}ller, Haiko},
TITLE = {Independent sets in asteroidal triple-free graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {12},
NUMBER = {2},
PAGES = {276-287},
YEAR = {1999},
EDITOR = {Shmoys, David B.},
KEYWORDS = {graph algorithms, at-free graphs, independent set, independent dominating set},
URL = {http://dx.doi.org/10.1137/S0895480197326346},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Bafna-Berman-Fujito/99,
AUTHOR = {Bafna, Vineet and Berman, Piotr and Fujito, Toshihiro},
TITLE = {A 2-approximation algorithm for the undirected feedback vertex set problem},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {12},
NUMBER = {3},
PAGES = {289-297},
YEAR = {1999},
EDITOR = {Shmoys, David B.},
KEYWORDS = {approximation algorithm, performance guarantee, feedback vertex set problem, local ratio theorem},
URL = {http://dx.doi.org/10.1137/S0895480196305124},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Will/99,
AUTHOR = {Will, Todd G.},
TITLE = {Switching distance between graphs with the same degrees},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {12},
NUMBER = {3},
PAGES = {298-306},
YEAR = {1999},
EDITOR = {Shmoys, David B.},
KEYWORDS = {graph, switching, degree sequence, np-complete},
URL = {http://dx.doi.org/10.1137/S0895480197331156},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Jiang-Mubayi-Shastri-West/99,
AUTHOR = {Jiang, Tao and Mubayi, Dhruv and Shastri, Aditya and West, Douglas B.},
TITLE = {Edge-bandwidth of graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {12},
NUMBER = {3},
PAGES = {307-316},
YEAR = {1999},
EDITOR = {Shmoys, David B.},
KEYWORDS = {bandwidth, edge-bandwidth, clique, biclique, caterpillar},
URL = {http://dx.doi.org/10.1137/S0895480197330758},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
NOTE = {see Erratum in SIAM J. Disc.~Math., Vol. 13, 2000, No. 1, 1-1},
}
@article{He-Kao-Lu/99a,
AUTHOR = {He, Xin and Kao, Ming-Yang and Lu, Hsueh-I},
TITLE = {Linear-time succinct encodings of planar graphs via canonical orderings},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {12},
NUMBER = {3},
PAGES = {317-325},
YEAR = {1999},
EDITOR = {Shmoys, David B.},
KEYWORDS = {data compression, graph encoding, canonical ordering, planar graphs, triconnected graphs, triangulations},
URL = {http://dx.doi.org/10.1137/S0895480197325031},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Bolotashvili-Kovalev-Girlich/99,
AUTHOR = {Bolotashvili, G. and Kovalev, M. and Girlich, E.},
TITLE = {New facets of the linear ordering polytope},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {12},
NUMBER = {3},
PAGES = {326-336},
YEAR = {1999},
EDITOR = {Shmoys, David B.},
KEYWORDS = {linear ordering polytope, facets, linear ordering, ranking},
URL = {http://dx.doi.org/10.1137/S0895480196300145},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Enomoto-Miyauchi/99,
AUTHOR = {Enomoto, Hikoe and Miyauchi, Miki Shimabara},
TITLE = {Embedding graphs into a three page book with $O(m \log n)$ crossings of edges over the spine},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {12},
NUMBER = {3},
PAGES = {337-341},
YEAR = {1999},
EDITOR = {Shmoys, David B.},
KEYWORDS = {graphs, book embedding, crossings of edges over the spine},
URL = {http://dx.doi.org/10.1137/S0895480195280319},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Halldorsson-Iwano-Katoh-Tokuyama/99,
AUTHOR = {Halld{\'o}rsson, Magn{\'u}s M. and Iwano, Kazuo and Katoh, Naoki and Tokuyama, Takeshi},
TITLE = {Finding subsets maximizing minimum structures},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {12},
NUMBER = {3},
PAGES = {342-359},
YEAR = {1999},
EDITOR = {Shmoys, David B.},
KEYWORDS = {minimum spanning tree, traveling salesperson tour, steiner tree, dispersion},
URL = {http://dx.doi.org/10.1137/S0895480196309791},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Felsner-Reuter/99,
AUTHOR = {Felsner, Stefan and Reuter, Klaus},
TITLE = {The linear extension diameter of a poset},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {12},
NUMBER = {3},
PAGES = {360-373},
YEAR = {1999},
EDITOR = {Shmoys, David B.},
KEYWORDS = {poset, linear extension, diameter, greedy},
URL = {http://dx.doi.org/10.1137/S0895480197326139},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Kratochvil-Tuza/99,
AUTHOR = {Kratochv{\'{i}}l, Jan and Tuza, Zsolt},
TITLE = {Rankings of directed graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {12},
NUMBER = {3},
PAGES = {374-384},
YEAR = {1999},
EDITOR = {Shmoys, David B.},
KEYWORDS = {graph, directed graph, oriented graph, ranking, algorithm, np-completeness},
URL = {http://dx.doi.org/10.1137/S0895480197330242},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Gyarfas-Kiraly-Lehel/99,
AUTHOR = {Gy{\'a}rf{\'a}s, Andr{\'a}s and Kir{\'a}ly, Zolt{\'a}n and Lehel, Jen\H{o}},
TITLE = {On-line 3-chromatic graphs I. Triangle-free graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {12},
NUMBER = {3},
PAGES = {385-411},
YEAR = {1999},
EDITOR = {Shmoys, David B.},
KEYWORDS = {on-line coloring, forbidden subgraphs},
URL = {http://dx.doi.org/10.1137/S089548019631030X},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Merris/99,
AUTHOR = {Merris, Russell},
TITLE = {Note: An upper bound for the diameter of a graph},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {12},
NUMBER = {3},
PAGES = {412-412},
YEAR = {1999},
EDITOR = {Shmoys, David B.},
KEYWORDS = {laplacian, diameter, eigenvalues},
URL = {http://dx.doi.org/10.1137/S0895480195282471},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Bjorner-Welker/99,
AUTHOR = {Bj{\"o}rner, Anders and Welker, Volkmar},
TITLE = {Complexes of directed graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {12},
NUMBER = {4},
PAGES = {413-424},
YEAR = {1999},
EDITOR = {Shmoys, David B.},
KEYWORDS = {directed graph, acyclic, strongly connected, complex of graphs, lattice of posets},
URL = {http://dx.doi.org/10.1137/S0895480198338724},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Raghavachari-Veerasamy/99,
AUTHOR = {Raghavachari, Balaji and Veerasamy, Jeyakesavan},
TITLE = {A 3/2-approximation algorithm for the mixed postman problem},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {12},
NUMBER = {4},
PAGES = {425-433},
YEAR = {1999},
EDITOR = {Shmoys, David B.},
KEYWORDS = {mixed postman problem, chinese postman problem, np-completeness, graphs, approximation algorithms},
URL = {http://dx.doi.org/10.1137/S0895480197331454},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Gittenberger/99,
AUTHOR = {Gittenberger, Bernhard},
TITLE = {On the contour of random trees},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {12},
NUMBER = {4},
PAGES = {434-458},
YEAR = {1999},
EDITOR = {Shmoys, David B.},
KEYWORDS = {random trees, generating functions, singularity analysis, branching processes, brownian excursion},
URL = {http://dx.doi.org/10.1137/S0895480195289928},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Gavoille-Peleg/99,
AUTHOR = {Gavoille, Cyril and Peleg, David},
TITLE = {The compactness of interval routing},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {12},
NUMBER = {4},
PAGES = {459-473},
YEAR = {1999},
EDITOR = {Shmoys, David B.},
KEYWORDS = {random graphs, shortest path, compact routing tables, interval routing},
URL = {http://dx.doi.org/10.1137/S0895480197328631},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Mahajan-Vinay/99,
AUTHOR = {Mahajan, Meena and Vinay, V.},
TITLE = {Determinant: Old algorithms, new insights},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {12},
NUMBER = {4},
PAGES = {474-490},
YEAR = {1999},
EDITOR = {Shmoys, David B.},
KEYWORDS = {determinant, algorithms, combinatorics, graphs, matrices},
URL = {http://dx.doi.org/10.1137/S0895480198338827},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Lih-Liu-Zhu/99,
AUTHOR = {Lih, Ko-Wei and Liu, Daphne Der-Fen and Zhu, Xuding},
TITLE = {Star extremal circulant graphs},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {12},
NUMBER = {4},
PAGES = {491-499},
YEAR = {1999},
EDITOR = {Shmoys, David B.},
KEYWORDS = {circular chromatic number, fractional chromatic number, circulant graph, distance graph, star extremal graph, independence ratio},
URL = {http://dx.doi.org/10.1137/S0895480198342838},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Hager-Krylyuk/99,
AUTHOR = {Hager, William W. and Krylyuk, Yaroslav},
TITLE = {Graph partitioning and continuous quadratic programming},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {12},
NUMBER = {4},
PAGES = {500-523},
YEAR = {1999},
EDITOR = {Shmoys, David B.},
KEYWORDS = {graph partitioning, min-cut, max-cut, quadratic programming, optimality conditions, graph laplacian, edge separators, fiedler vector},
URL = {http://dx.doi.org/10.1137/S0895480199335829},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}
@article{Dasgupta/99,
AUTHOR = {Dasgupta, Samit},
TITLE = {On the size of minimum super Arrovian domains},
JOURNAL = {SIAM J. Disc.~Math.},
VOLUME = {12},
NUMBER = {4},
PAGES = {524-534},
YEAR = {1999},
EDITOR = {Shmoys, David B.},
KEYWORDS = {arrow's impossibility theorem, voter preference profiles, minimum profile sets},
URL = {http://dx.doi.org/10.1137/S0895480198332521},
PUBLISHER = {Society for Industrial and Applied Mathematics},
ADDRESS = {Philadelphia, PA},
}