@article{and90-random,
     author="S. L. Anderson",
     title="Random number generators on vector supercomputers
            and other advanced architectures",
     journal="SIAM Review",
     volume="32",
     year="1990",
     pages="221-251"}

@misc{ash97-utah,
   AUTHOR="C. Ashcraft and S. C. Eisenstat and J. W. H. Liu",
   title="Practical extensions of the multisection ordering for
          sparse matrices",
   howpublished="Minisymposium presentation at
             the Sixth SIAM Conference on Applied Linear Algebra,
             Snowbird, Utah",
   year="October 29, 1997"}

@misc{ash94-utah,
   AUTHOR="C. Ashcraft and J. W. H. Liu",
   title="Generalized nested dissection: some recent progress",
   howpublished="Minisymposium presentation at
             the Fifth SIAM Conference on Applied Linear Algebra,
             Snowbird, Utah",
   year="June 18, 1994"}

@misc{rot96-balance,
   AUTHOR="E. Rothberg",
   title="Exploring the tradeoff between imbalance and separator
          size in nested dissection ordering",
   howpublished="unpublished",
   year="1996"}

@misc{ro95-hybrid,
   AUTHOR="E. Rothberg",
   title="Robust ordering of sparse matrices: a minimum degree,
          nested dissection hybrid",
   howpublished="unpublished",
   year="1995"}

@misc{rothberg95,
   AUTHOR="E. Rothberg",
   howpublished="private communication",
   year="1995"}

@conference{rot96-mindefIdaho,
   author="E. Rothberg",
   title="Ordering sparse matrices 
          using approximate minimum local fill",
   booktitle="Second SIAM Conference on Sparse Matrices",
   year="1996",
   note="Conference presentation"}

@techreport{hr96-msndtalk,
     author="B. Hendrickson and E. Rothberg",
     title="Improving the runtime and quality of nested dissection
           ordering",
     booktitle="Second SIAM Conference on Sparse Matrices",
     year="1996",
     note="Conference presentation"}

@conference{ng96-mindefIdaho,
   author="E. Ng and P. Raghavan",
   title="Minimum deficiency ordering",
   booktitle="Second SIAM Conference on Sparse Matrices",
   year="1996",
   note="Conference presentation"}

@article{gib76-profile,
     AUTHOR = {N. E. Gibbs and W. G. Poole Jr and P. K. Stockmeyer},
     JOURNAL = {SIAM. J. Numer. Anal.},
     KEY = {LLt band profile},
     PAGES = {236-250},
     TITLE = {An algorithm for reducing the bandwidth and profile
              of a sparse matrix},
     VOLUME = {13},
     YEAR = {1976} }

@techreport{rag95-PCO,
     author="P. Raghavan",
     title="Parallel ordering using edge contraction",
     number="CS-95-293",
     institution="Dept. of Computer Science, The University of
                 Tennessee",
     address="Knoxville, Tennessee",
     year="1995"}

@techreport{ame94-amdTR,
     author="P. Amestoy and T. Davis and I. Duff",
     title="An approximate minimum degree ordering algorithm",
     number = "TR-94-039",
     institution="University of Florida",
     year="1994"}

@article{ame96-amd,
     author="P. Amestoy and T. Davis and I. Duff",
     title="An approximate minimum degree ordering algorithm",
     journal="SIAM J. Matrix Anal. Appl.",
     volume="17",
     pages="886-905",
     year="1996"}

@techreport{hr96-msnd,
     author="B. Hendrickson and E. Rothberg",
     title="Improving the runtime and quality of nested dissection
           ordering",
     institution="Sandia National Laboratories",
     year="1996"}

@article{ash89-relaxed,
     author="C. Ashcraft and R. Grimes",
     title="The influence of relaxed supernode partitions on the
            multifrontal method",
     journal="ACM Trans. Math. Software",
     volume="15",
     year="1989",
     pages="291-309"}

@techreport{ash95-AGL,
     author="C. Ashcraft and R. G. Grimes and J. G. Lewis",
     title="Accurate symmetric indefinite linear equation solvers",
     number="ISSTECH-95-029",
     institution="Boeing Computer Services",
     year="1995",
     note="Accepted for publication in {\it SIAM J. Matrix. Anal.}"}

@techreport{ash96-multisection,
     author="C. Ashcraft and J. W. H. Liu",
     title="Robust ordering of sparse matrices using multisection",
     number="ISSTECH-96-002",
     institution="Boeing Information and Support Services",
     year="1996",
     note="Accepted for publication in {\it SIAM J. Matrix. Anal.}"}

@techreport{ash95-DDSEP,
     author="C. Ashcraft and J. W. H. Liu",
     title="Using domain decompositions to find graph bisectors",
     number="ISSTECH-95-024",
     institution="Boeing Computer Services",
     year="1995",
     note="Accepted for publication in {\it BIT}"}

@techreport{ash95-robust,
     author="C. Ashcraft and J. W. H. Liu",
     title="Robust ordering of sparse matrices using multisection",
     number="ISSTECH-96-002",
     institution="Boeing Computer Services",
     year="1996"}

@techreport{ash96-maxflow,
     author="C. Ashcraft and J. W. H. Liu",
     title="Applications of the {D}ulmage-{M}endelsohn decomposition
            and network flow to graph bisection improvement",
     number="ISSTECH-96-017",
     institution="Boeing Computer Services",
     year="1996",
     note="Accepted for publication in {\it SIAM J. Matrix. Anal.}"}

@techreport{ash93-compressed-graphs-TR,
     author="C. Ashcraft",
     title="Compressed graphs and the minimum degree algorithm",
     number="BCSTECH-93-024",
     institution="Boeing Computer Services",
     year="1993"}
 
@techreport{ash94-partition,
     author="C. Ashcraft and J. W. H. Liu",
     title="A partition improvement algorithm for generalized nested dissection",
     number="BCSTECH-94-020",
     institution="Boeing Computer Services",
     year="1994",
     note="Accepted for publication in {\it BIT}"}
 
@article{ber90-mindeg,
     author="P. Berman and G. Schnitger",
     title="On the performance of the minimum degree ordering for
            {G}aussian elimination",
     journal="SIAM J. Matrix Analysis and Applic.",
     volume="11",
     year="1990",
     pages="83-88"}
 
@article{bha93-localND,
     author="M. V. Bhat and W. G. Habashi and J. W. H. Liu
             and V. N. Nguyen and M. F. Peeters",
     title="A note on nested dissection for rectangular grids",
     journal="SIAM J. Matrix Analysis and Applic.",
     volume="14",
     year="1993",
     pages="253-258"}

@phdthesis{dam92-compressed,
     author="A. C. Damhaug",
     title="Sparse Solution of Finite Element Equations",
     school="The Norwegian Institute of Technology",
     year="1992"}

@article{duf83-multifrontal,
     author="I. Duff and J. Reid",
     title="The multifrontal solution of indefinite sparse
            symmetric linear equations",
     journal="ACM Trans. Math. Software",
     volume="6",
     year="1983",
     pages="302-325"}

@inproceedings{eis76-elementModel,
     author="S. C. Eisenstat and M. H. Schultz and A. H. Sherman",
     title="Applications of an element model 
            for {G}aussian elimination",
     booktitle="Sparse Matrix Computations",
     pages="85-96",
     publisher="Academic Press",
     year="1976",
     editor="J. R. Bunch and D. J. Rose"}

@inproceedings{fid82-partition,
     author="C. M. Fiduccia and R. M. Mattheyses",
     title="A linear-time heuristic for improving network partition",
     booktitle="ACM IEEE Proc. 19th Design Automation Conference,
                Las Vegas, Nevada",
     year="1982",
     pages="175-181"}

@article{geo80-1way,
     author="J. A. George",
     title="An automatic one-way dissection algorithm for irregular finite
     element problems",
     journal="SIAM J. Numer. Anal.",
     volume="17",
     year="1980",
     pages="740-751"}
 
@article{sparsematlab,
     author="J. Gilbert and C. Moler and R. Schreiber",
     title="Sparse matrices in {MATLAB}: design and implementation",
     journal="SIAM J. Matrix Analysis and Applic.",
     volume="13",
     year="1992",
     pages="335-356"}

@techreport{gup96-WGPP,
     author="A. Gupta",
     title="{WGPP}: {W}atson {G}raph {P}artitioning and sparse matrix 
             ordering {P}ackage",
     number="Users Manual",
     institution="IBM T.J. Watson Research Center",
     address="New York",
     year="1996"}


@techreport{hea92-dissection,
     author="M.T. Heath and P. Raghavan",
     title="A Cartesian nested dissection algorithm",
     number="UIUCDCS-R-92-1772",
     institution="Dept of Computer Science, University of Illinois",
     address="Urbana, IL",
     year="1992"}

@techreport{hen92-partition,
     author="B. Hendrickson and R. Leland",
     title="An improved spectral graph partitioning algorithm for
mapping parallel computations",
     number="SAND92-1460",
     institution="Sandia National Laboratories",
     address="Albuquerque, NM",
     year="1992"}

@techreport{hen93-partition,
     author="B. Hendrickson and R. Leland",
     title="Multidimensional spectral load balancing",
     number="SAND93-074",
     institution="Sandia National Laboratories",
     address="Albuquerque, NM",
     year="1993"}

@article{ker70-partition,
     author="B. W. Kernighan and S. Lin",
     title="An efficient heuristic procedure for partitioning graphs",
     journal="Bell System Technical Journal",
     volume="49",
     year="1970",
     pages="291-307"}

@inproceedings{lei89-fidmat,
     author="C. E. Leiserson and J. G. Lewis",
     title="Orderings for parallel sparse symmetric factorization",
     booktitle="Parallel Processing for Scientific Computing",
     year="1989",
     pages="27-31"}

@article{lip79-separators,
     author="R. J. Lipton and R. E. Tarjan",
     title="A separator theorem for planar graphs",
     journal="SIAM J. Applied Math",
     volume="36",
     year="1979",
     pages="177-189"}

@article{liu89-separators,
     author="J. W. H. Liu",
     title="A graph partitioning algorithm by node separators",
     journal="ACM Trans. on Math. Software",
     volume="15",
     year="1989",
     pages="198-219"}

@article{liu85-mfstorage,
     author="J. W. H. Liu",
     title="On the storage requirement in the out-of-core
            multifrontal method for sparse factorization",
     journal="ACM Trans. on Math. Software",
     volume="12",
     year="1986",
     pages="249-264"}

@article{liu85-mmd,
     author="J. W. H. Liu",
     title="Modification of the minimum degree algorithm by
            multiple elimination",
     journal="ACM Trans. on Math. Software",
     volume="11",
     year="1985",
     pages="141-153"}

@article{liu89-mindeg,
     author="J. W. H. Liu",
     title="On the minimum degree ordering with constraints",
     journal="SIAM J. Sci. Stat. Comput.",
     volume="10",
     year="1989",
     pages="1136-1145"}

@article{liu90-etree,
     author="J. W. H. Liu",
     title="The role of elimination trees in sparse factorization",
     journal="SIAM J. Matrix Analysis and Applic.",
     volume="11",
     year="1990",
     pages="134-172"}

@article{liu91-generalizedEnvelope,
     author="J. W. H. Liu",
     title="A generalized envelope method 
            for sparse factorization by rows",
     journal="ACM Trans. on Math. Software",
     volume="17",
     year="1991",
     pages="112-129"}

@article{mar57,
     author="H. M. Markowitz",
     title="The elimination form of the inverse and its application to
            linear programming",
     journal="Management Sci.",
     volume="3",
     year="1957",
     pages="255-269"}

@mastersthesis{ng79-master,
     author="E. Ng",
     title="On one-way dissection schemes",
     school="Dept of Computer Science, University of Waterloo",
     address="Waterloo, Ontario",
     year="1979"}

@techreport{rag93-separators,
     author="P. Raghavan",
     title="Line and plane separators",
     number="UIUCDCS-R-93-1794",
     institution="Dept of Computer Science, University of Illinois",
     address="Urbana, IL",
     year="1993"}

@inproceedings{ros72-elimination,
     author="D. J. Rose",
     title="A graph-theoretic study of the numerical solution of sparse
            positive definite systems of linear equations",
     booktitle="Graph Theory and Computing",
     publisher="Academic Press",
     editor="R. Read",
     year="1972",
     pages="183-217"}

@article{ros70-elimination,
     author="D. J. Rose",
     title="Triangulated graphs and the elimination process",
     journal="J. Math. Anal. & Appl.",
     volume="32",
     year="1970",
     pages="597-609"}

@techreport{ten91-separators,
     author="S.H. Teng",
     title="Points, Spheres, and Separators",
     number="CMU-CS-91-184",
     institution="School of Computer Science, Carnegie Mellon University",
     address="Pittsburgh, PA",
     year="1991"}
 
@article{tin67-order,
     author="W. F. Tinney and J. W. Walker",
     title="Direct solutions of sparse network equations by optimally ordered
     triangular factorization",
     journal="J Proc. IEEE",
     volume="55",
     year="1967",
     pages="1801-1809"}

@book{aho83,
     author="A. V. Aho and J. E. Hopcroft and J. D. Ullman",
     title="Data Structures and Algorithms",
     publisher="Addison-Wesley",
     address="Reading, MA",
     year="1983"}

@book{duf87-book,
     author="I. S. Duff and A. M. Erisman and J. K. Reid",
     title="Direct Methods for Sparse Matrices",
     publisher="Oxford University Press",
     address="London",
     year="1987"}

@book{geo81-book,
     author="J. A. George and J. W. H. Liu",
     title="Computer Solution of Large Sparse Positive Definite Systems",
     publisher="Prentice-Hall",
     address="Englewood Cliffs, NJ",
     year="1981"}

@article{ash87-progress,
     AUTHOR = {C. Ashcraft and R. Grimes and J. Lewis and B. Peyton
        and H. Simon},
     JOURNAL = {Intern. J. of Supercomputer Applications},
     KEY = {LLt vector},
     PAGES = {10-30},
     TITLE = {Progress in sparse matrix methods for large sparse
        linear systems on vector supercomputers},
     VOLUME = {1},
     YEAR = {1987}
}

@techreport{ash90-partition,
     author="C. Ashcraft",
     title="The domain/segment partition for the factorization of sparse
symmetric positive definite matrices",
     number="ECA-TR-148",
     institution="Boeing Computer Services",
     address="Seattle, WA",
     year="1990"}

@article{ash95-compressed-graphs,
     author="C. Ashcraft",
     title="Compressed graphs and the minimum degree algorithm",
     journal="SIAM J. Sci. Comput.",
     pages = "1404-1411",
     volume = 16,
     year="1995"}

@inproceedings{ash90-lookahead,
     author="C. Ashcraft and S. C. Eisenstat and J. W. H. Liu and
             B. W. Peyton and A. H. Sherman",
     title="A compute-ahead fan-in scheme for parallel sparse
            matrix factorization",
     booktitle="Fourth Canadian Supercomputing Symposium (1990)",
     editor="D. Pelletier",
     year="June, 1990",
     pages="351-361"}


@inproceedings{ash94-multisection,
     author="C. Ashcraft and J. W. H. Liu",
     title="Generalized nested dissection: some recent progress",
     booktitle="Fifth SIAM Conference on Applied Linear Algebra",
     address="Snowbird, Utah",
     year="June 18, 1994"}

@inproceedings{bar93-partition,
     author="S. T. Barnard and H. D. Simon",
     title="A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems",
     booktitle="Proceedings of the Sixth SIAM Conference on Parallel Processing for Scientific Computing",
     year="1993",
     pages="711-718"}

@inproceedings{bar95-partition,
     author="S. T. Barnard and H. D. Simon",
     title="A parallel implementation of multilevel recursive spectral bisection for applications in adaptive unstructured meshes",
     booktitle="Proceedings of the seventh SIAM Conference on Parallel Processing for Scientific Computing",
     year="1995",
     pages="627-632"}

@article{bui92-partition,
     author="T. Bui and C. Jones",
     title="Finding good approximate vertex and edge partitions is {NP}-hard",
     journal="Information Processing Letters",
     volume="42",
     year="1992",
     pages="153-159"}

@inproceedings{bui93-partition,
     author="T. Bui and C. Jones",
     title="A heuristic for reducing fill-in in sparse matrix factorization",
     booktitle="Proceedings of Sixth SIAM Conference on Parallel Processing ",
     year="1993",
     pages="445-452"}


@article{geo73-nested,
     author="J. A. George",
     title="Nested dissection of a regular finite element mesh",
     journal="SIAM J. Numer. Anal.",
     volume="10",
     year="1973",
     pages="345-363"}

@article{geo89-mindeg,
     author="J.A. George and J. W. H. Liu",
     title="The evolution of the minimum degree ordering algorithm",
     journal="SIAM Review",
     volume="31",
     year="1989",
     pages="1-19"}

@techreport{goe95-partition,
     author="T. Goehring and Y. Saad",
     title="Heuristic algorithms for automatic graph partitioning",
     number="",
     institution="Computer Science Department, University of Minnesota",
     address="Minnesota",
     year="1995"}

@article{hal35,
     author = "P. Hall",
     title = "On representatives of subsets",
     journal = "J. London Math. Society",
     volume = "10",
     year = "1935",
     pages = "26-30"}

@article{Harwell-Boeing-Matrices,
     author = "I.S. Duff and R.G. Grimes and J.G. Lewis",
     title = "Sparse matrix test problems",
     journal="ACM Trans. on Math. Software",
     volume = "15",
     year = "1989",
     pages = "1-14"}

@article{dul58,
     author = "A.L. Dulmage and N.S. Mendelsohn",
     title = "Coverings of bipartite graphs",
     journal="Can. J. Math",
     volume = "10",
     year = "1958",
     pages = "517-534"}

@techreport{sparspak80,
     author="J. A. George and J. W. H. Liu and E. G. Ng",
     title="User's guide for {SPARSPAK}: {W}aterloo sparse linear
           equations package",
     number = "Tech. Rep. CS78-30(revised)",
     institution = "Dept. of Computer Sciences, Univ. of Waterloo",
     address="Waterloo, Ontario, Canada",
     year = "1980"}

@techreport{hen93-chaco,
     author="B. Hendrickson and R. Leland",
     title="The {C}haco user's guide",
     number="SAND93-2339",
     institution="Sandia National Laboratories",
     address="Albuquerque, NM",
     year="1993"}

@techreport{hen93-partition,
     author="B. Hendrickson and R. Leland",
     title="A multilevel algorithm for partitioning graphs",
     number="SAND93-1301",
     institution="Sandia National Laboratories",
     address="Albuquerque, NM",
     year="1993"}

@techreport{hen93-spectral,
     author="B. Hendrickson and R. Leland",
     title="Multidimensional spectral load balancing",
     number="SAND93-074",
     institution="Sandia National Laboratories",
     address="Albuquerque, NM",
     year="1993"}

@techreport{kar95-kway,
     author="G. Karypis and V. Kumar",
     title="Multilevel $k$-way partitioning scheme for irregular graphs",
     institution="Department of Computer Science, University of Minnesota",
     address="Minnesota",
     year="1995"}
%    number="Technical Report",

@techreport{kar95-multilevel,
     author="G. Karypis and V. Kumar",
     title="A fast and high quality multilevel scheme for partitioning irregular graphs",
     number="TR 95-035",
     institution="Department of Computer Science, University of Minnesota",
     address="Minnesota",
     year="1995"}

@techreport{kar95-metis,
     author="G. Karypis and V. Kumar",
     title="{METIS}: Unstructured graph partitioning and sparse matrix ordering system",
     institution="Department of Computer Science, University of Minnesota",
     address="Minnesota",
     year="1995"}
%    number="TR 95-???",

@techreport{kar95-partition,
     author="G. Karypis and V. Kumar",
     title="Analysis of multilevel graph partitioning",
     number="TR 95-037",
     institution="Department of Computer Science, University of Minnesota",
     address="Minnesota",
     year="1995"}

@inproceedings{kar95,
     author="G. Karypis and V. Kumar",
     title="Multilevel graph partition and sparse matrix ordering",
     booktitle="Intl. Conf. on Parallel Processing",
     year="1995"}

@article{lip79,
     author="R. J. Lipton and R. E. Tarjan",
     title="A separator theorem for planar graphs",
     journal="SIAM J. Applied Math",
     volume="36",
     year="1979",
     pages="177-189"}

@techreport{mai94-partition,
     author="H.S. Maini and K.G. Mehrotra and S. Ranka",
     title="Genetic algorithms for graph partitioning and incremental
        graph partitioning",
     number="Technical report",
     institution="Center for Science and Technology, Syracuse University",
     address="Synracuse, N.Y.",
     year="1994"}

@article{pot90-triangular,
     author="A. Pothen and C. Fan",
     title="Computing the block triangular form of a sparse matrix",
     journal="ACM Trans. on Math. Software",
     volume="16",
     year="1990",
     pages="303-324"}

@article{pot90-partition,
     author="A. Pothen and H. Simon and K.P. Liou",
     title="Partitioning sparse matrices with eigenvectors of graphs",
     journal="SIAM J. Matrix Analysis and Applic.",
     volume="11",
     year="1990",
     pages="430-452"}

@book{aho83,
     author="A. V. Aho and J. E. Hopcroft and J. D. Ullman",
     title="Data Structures and Algorithms",
     publisher="Addison-Wesley",
     address="Reading, MA",
     year="1983"}

@book{ull84-vlsi,
     author="J. D. Ullman",
     title="Computational Aspects of VLSI",
     publisher="Computer Science Press",
     address="Rockville, Md",
     year="1984"}

@book{duf87-book,
     author="I. S. Duff and A. M. Erisman and J. K. Reid",
     title="Direct Methods for Sparse Matrices",
     publisher="Oxford University Press",
     address="London",
     year="1987"}

@book{geo81-book,
     author="J. A. George and J. W. H. Liu",
     title="Computer Solution of Large Sparse Positive Definite Systems",
     publisher="Prentice-Hall",
     address="Englewood Cliffs, NJ",
     year="1981"}

@book{zzzz99-book,
     author="J. A. George and J. W. H. Liu",
     title="Computer Solution of Large Sparse Positive Definite Systems",
     publisher="Prentice-Hall",
     address="Englewood Cliffs, NJ",
     year="1981"}


@article{arn85,
     author="S. Arnborg",
     title="Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey",
     journal="BIT",
     volume="25",
     year="1985",
     pages="2-23"}

@techreport{bar81,
     author="E. R. Barnes",
     title="An algorithm for partitioning the nodes of a graph",
     number="RC8690",
     institution="IBM Thomas J. Watson Research Center",
     address="Yorktown Heights, New York",
     year="1981"}

@inproceedings{bar85,
     author="E. R. Barnes",
     title="Partitioning the nodes of a graph",
     booktitle="Graph Theory with Applications to Algorithms and Computer Science",
     editor="Y. Alavi and G. Chartrand and D. Lick and C. Wall and L. Lesuiak",
     publisher="John Wiley \& Sons Inc.",
     address="New York",
     year="1985",
     pages="57-72"}

@article{bha84,
     author="S. N. Bhatt and F. T. Leighton",
     title="A framework for solving {VLSI} graph layout problems",
     journal="Journal of Computer \& Systems Sciences",
     volume="28",
     year="1984",
     pages=""}

@inproceedings{bre77,
     author="M. A. Breuer",
     title="A class of min-cut placement algorithms",
     booktitle="Proc. 14th Design Automation Conference",
     year="1977",
     pages="284-290"}

@inproceedings{bui84,
     author="S. N. Bui and S. Chaudhuri and T. Leighton and M. Sipser",
     title="Graph bisection algorithms with good average case behavior",
     booktitle="Proceedings of the 25th Annual Symposium of Foundations of Computer Science",
     year="1984",
     pages="181-192"}

@article{dji81,
     author="H. N. Djidjev",
     title="A separator theorem",
     journal="Comptes rendus de l' Academie bulgare des Sciences",
     volume="34",
     year="1981",
     pages="643-645"}

@article{dji82-linear,
     author="H. N. Djidjev",
     title="A linear algorithm for partitioning graphs",
     journal="Comptes rendus de l' Academie bulgare des Sciences",
     volume="35",
     year="1982",
     pages="1053-1056"}

@article{dji82-planar,
     author="H. N. Djidjev",
     title="On the problem of partitioning planar graphs",
     journal="SIAM J. Alg. \& Disc. Meth.",
     volume="3",
     year="1982",
     pages="229-240"}

@article{don72,
     author="W. E. Donath and A. J. Hoffman",
     title="Algorithms for partitioning of graphs and computer logic based on eigenvectors of connection matrices",
     journal="IBM Technical Disclosure Bulletin",
     volume="15",
     year="1972",
     pages="938-944"}

@article{don73,
     author="W. E. Donath and A. J. Hoffman",
     title="Lower bounds for the partitioning of graphs",
     journal="IBM J. Res. Develop.",
     volume="17",
     year="1973",
     pages="420-425"}

@article{fie73,
     author="M. Fiedler",
     title="Algebraic connectivity of graphs",
     journal="Czechoslovak Math J.",
     volume="23",
     year="1973",
     pages="298-305"}

@book{fre86,
     author="G. N. Fredrickson and R. Janardan",
     title="Separator-based strategies for efficient message routing",
     booktitle="27th Annual Symposium on Foundation of Computer Science",
     publisher="IEEE",
     year="1986",
     pages="428-437"}

@book{gaz87,
     author="H. Gazit and G. L. Miller",
     title="A parallel algorithm for finding a separator in planar graphs",
     booktitle="28th Annual Symposium on Foundation of Computer Science",
     publisher="IEEE",
     year="1987",
     pages="238-248"}

@techreport{gil80,
     author="J. R. Gilbert",
     title="Graph separator theorems and sparse {G}aussian elimination",
     number="Ph.D. Thesis",
     institution="DCS, Stanford University",
     year="1980"}

@article{gil84-genus,
     author="J. R. Gilbert and J. P. Hutchinson and R. E. Tarjan",
     title="A separator theorem for graphs of bounded genus",
     journal="J. of Algorithms",
     volume="5",
     year="1984",
     pages="391-407"}

@article{gil84-chordal,
     author="J. R. Gilbert and D. J. Rose and A. Edenbrandt",
     title="A separator theorem for chordal graphs",
     journal="SIAM J. Alg. \& Disc. Meth.",
     volume="5",
     year="1984",
     pages="306-313"}

@inproceedings{gol83,
     author="M. K. Goldberg and M. Burstein",
     title="Heuristic improvement technique for bisection of {VLSI} networks",
     booktitle="Proc. IEEE International Conf. on Computer Design",
     address="Port Chester, New York",
     year="1983",
     pages="122-125"}

@techreport{gol87,
     author="M. K. Goldberg and S. Lath and J. W. Roberts",
     title="Heuristics for the graph bisection problem",
     number="Report",
     institution="Rensselaer Polytechnic Institute",
     year="1987"}

@techreport{hen92,
     author="B. Hendrickson and R. Leland",
     title="An improved spectral graph partitioning algorithm for mapping parallel computations",
     number="SAND92-1460",
     institution="Sandia National Laboratories",
     address="Albuquerque, NM",
     year="1992"}

@techreport{hen93,
     author="B. Hendrickson and R. Leland",
     title="Multidimensional spectral load balancing",
     number="SAND93-074",
     institution="Sandia National Laboratories",
     address="Albuquerque, NM",
     year="1993"}

@article{hu81,
     author="T. C. Hu and M. T. Shing",
     title="An O(n) algorithm to find a near-optimum partition",
     journal="Journal of Algorithms",
     volume="2",
     year="1981",
     pages="122-138"}

@article{hu85,
     author="T. C. Hu and M. T. Shing",
     title="A decomposition algorithm for circuit routing",
     journal="Math. Programming Study",
     volume="24",
     year="1985",
     pages="87-103"}

@article{hu86,
     author="T. C. Hu and M. T. Shing",
     title="A decomposition algorithm for multi-terminal network flows",
     journal="J. Discrete Applied Math.",
     volume="13",
     year="1986",
     pages="165-181"}

@article{joh88,
     author="D. S. Johnson and C. R. Aragon and L. A. McGeoch and C. Schevon",
     title="Optimization by simulated annealing: an experimental evaluation",
     journal="Operations Research",
     note="((submitted))",
     year="1988"}

@article{kan91,
     author="A. Kanevsky and V. Ramachandran",
     title="Improved algorithms for graph four-connectivity",
     journal="J. of Computer Science and Systems",
     volume="42",
     year="1991",
     pages="288-306"}

@article{kan9x,
     author="A. Kanevsky",
     title="Finding all minimum size vertex sets in a graph",
     journal="J. of Networks",
     year="199x"}

@inproceedings{kan90,
     author="A. Kanevsky",
     title="On the number of minimum size separating vertex sets of a graph and how to find all of them",
     booktitle="First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '90)",
     year="January 22-24,1990",
     pages="411-421"}

@article{kao90,
     author="M. Kao and F. Wan",
     title="Not all planar digraphs have small cycle separators",
     journal="Information Processing Letters",
     year="1990"}

@techreport{ker69,
     author="B. W. Kernighan",
     title="Some graph partitioning problems related to program segmentation",
     number="Ph.D. Thesis",
     institution="Princeton University",
     year="1969"}

@article{ker70,
     author="B. W. Kernighan and S. Lin",
     title="An efficient heuristic procedure for partitioning graphs",
     journal="Bell System Technical Journal",
     volume="49",
     year="1970",
     pages="291-307"}

@article{kir83,
     author="S. Kirkpatrick and C. D. Gelatt Jr. and M. P. Vecchi",
     title="Optimization by simulated annealing",
     journal="Science",
     volume="220",
     year="1983",
     pages="671-680"}

@article{kom85,
     author="J. Komlos and M. T. Shing",
     title="Probabilistic partitioning algorithms for the rectilinear Steiner problem",
     journal="Networks",
     volume="15",
     year="1985",
     pages="413-423"}

@article{kri84,
     author="B. Krishnamurthy",
     title="An improved min-cut algorithm for partitioning {VLSI} networks",
     journal="IEEE Trans. on Computers",
     volume="C-33",
     year="1984",
     pages="438-446"}

@article{kri87,
     author="B. Krishnamurthy",
     title="Constructing test cases for partitioning heuristics",
     journal="IEEE Trans. on Computers",
     volume="C-36",
     year="198",
     pages="1112-1114"}

@inproceedings{lei82,
     author="F. T. Leighton",
     title="A layout strategy for {VLSI} which is provably good",
     booktitle="Proceedings of the 14th Annual ACM Symposium on Theory of Computing",
     year="1982",
     pages="85-98"}

@book{lei80,
     author="C. Leiserson",
     title="Area-efficient graph layout (for vlsi)",
     booktitle="21st Annual Symposium on Foundation of Computer Science",
     publisher="IEEE",
     year="1980",
     pages="270-281"}

@article{lin77,
     author="T. D. Lin and R. S. H. Mah",
     title="Hierarchical partition -- a new optimal pivoting algorithm",
     journal="Math. Programming",
     volume="12",
     year="1977",
     pages="260-278"}

@article{lip80,
     author="R. J. Lipton and R. E. Tarjan",
     title="Applications of a planar separator theorem",
     journal="SICOMP",
     volume="9",
     year="1980",
     pages="615-627"}

@techreport{mac78,
     author="R. M. Macgregor",
     title="On partitioning a graph: a theoretical and empirical study",
     number="UCB/ERL M78/14 (Ph.D. Thesis)",
     institution="Standford University",
     year="1978"}

@inproceedings{mil84,
     author="G. L. Miller",
     title="Finding small simple cycle separators for 2-connected planar graphs",
     booktitle="Proceedings of the 16th Annual ACM Symposium on Theory of Computing",
     year="1984",
     pages="376-382"}

@techreport{moo88,
     author="D. Moore",
     title="A round-robin parallel partitioning algorithm",
     number="TR 88-916",
     institution="DCS, Cornell University",
     year="1988"}

@article{pai87,
     author="R. Paige and R. E. Tarjan",
     title="Three partition refinement algorithm",
     journal="SICOMP",
     volume="16",
     year="1987",
     pages="973-989"}

@article{pow88,
     author="D. Powers",
     title="Graph partitioning by eigenvectors",
     journal="Lin. Alg. Appl.",
     volume="101",
     year="1988",
     pages="121-133"}

@book{rao87,
     author="S. Rao",
     title="Finding near optimal separators in planar graphs",
     booktitle="28th Annual Symposium on Foundation of Computer Science",
     publisher="IEEE",
     year="1987",
     pages="225-237"}

@article{rav87,
     author="S. Ravi and H. Hunt III",
     title="An application of the planar separator theorem to counting problem",
     journal="Inform. Process. Letters",
     volume="25",
     year="1987",
     pages="317-322"}

@techreport{ren90,
     author="F. Rendl and H. Wolkowicz",
     title="A projection technique for partitioning the nodes of a graph",
     number="CORR 90-20",
     institution="University of Waterloo",
     address="Waterloo, Ontario",
     year="1990"}

@inproceedings{san76,
     author="A. Sangiovanni-Vincentelli",
     title="An optimization problem arising from tearing methods",
     booktitle="Sparse Matrix Computations",
     editor="J.R. Bunch and D.J. Rose",
     publisher="Academic Press",
     year="1976",
     pages="97-110"}

@inproceedings{sch79,
     author="D. G. Schweikert and B. W. Kernighan",
     title="A proper model for the partitioning of electrical circuits",
     booktitle="Proc. 9th Design Automation Workshop",
     year="1979",
     pages="57-62"}

@article{sen92,
     author="A. Sen and H. Deng and S. Guha",
     title="On a graph partition problem with application to vlsi layout",
     journal="Information Processing Letters",
     year="1992",
     volume="43",
     pages="87-94"}

@techreport{she87,
     author="T. J. Sheffler",
     title="A graph separator theorem and its application to {G}aussian elimination to optimize {B}oolean expression for parallel evaluation",
     number="CMU-CS-87-123",
     institution="DCS, Carnegie-Mellon University",
     year="1987"}

@inproceedings{shi80,
     author="H. Shiraishi and F. Hirose",
     title="Efficient placement and routing for masterslice {LSI}",
     booktitle="Proc. 17th Design Automation Conference",
     year="1980",
     pages="458-464"}

@article{sua88,
     author="P. Suaris and G. Kedem",
     title="An algorithm for quadrisection and its application to standard cell placement",
     journal="IEEE Trans. Circuits and Systems",
     volume="35",
     year="1988",
     pages="294-303"}

@article{tar??,
     author="R. E. Tarjan",
     title="Decomposition by clique separators",
     journal="Discrete Math",
     year="to appear"}

@article{ven87,
     author="S. Venkatesan",
     title="Improved constants for some separator theorems",
     journal="J. Algorithms",
     volume="8",
     year="1987",
     pages="572-578"}

@article{wan91,
     author="F. Wan",
     title="A linear-processor algorithm for finding small cycle separators on undirected planar graphs",
     journal="SICOMP",
     year="1991?"}

@article{whi81,
     author="S. H. Whitesides",
     title="An algorithm for finding clique cutsets",
     journal="Inf. Proc. Letters",
     volume="12",
     year="1981",
     pages="31-32"}

@incollection{matrixmarket97,
    author="R. F. Boisvert and R. Pozo and K. Remington 
            and R. F. Barrett and J.  J. Dongarra",     
    title="Matrix {M}arket: a web resource for test matrix collections",
    booktitle="The Quality of Numerical Software: 
               Assessment and Enhancement",
    publisher="Chapman and Hall, London",
    year="1997",
    editor="R. F. Boisvert",
    pages="125-137"}

@article{ne92-rook,
     author="L. Neal and G. Poole",
     title="A geometric analysis of {G}aussian elimination II.}",
     journal="Linear Alg. and Appl.",
     volume="173",
     year="1992",
     pages="239-264"}

@misc{fo96-rook,
     author="L. V. Foster",
     title="The growth factor and efficiency of {G}aussian
            elimination with rook pivoting",
     note="Accepted for publication in {\it J. Comp. and Appl.  Math.}"}