@Article{Akutsu98, author = {T.~Akutsu}, title = {On Determining the Congruence of Point Sets in {$d$} Dimensions}, journal = {Comput.~Geom.}, year = {1998}, volume = {9}, number = {4}, pages = {247--256}, } @InCollection{Babai95, author = {L.~Babai}, title = {Automorphism groups, isomorphism, reconstruction}, editor = {{Graham et al.}, R. L.}, booktitle = {Handbook of Cominatorics}, publisher = {Elsevier}, address = {Amsterdam, North-Holland}, volume = {2}, year = {1995}, pages = {1447--1540}, } @Article{Bayer88, author = {Margaret Bayer}, title = {Barycentric Subdivisions}, journal = {Pac. J. Math.}, volume = {135}, number = {1}, year = {1988}, pages = {1--17}, } @Article{BlindMani87, author = {R.~Blind and P.~Mani-Levitska}, title = {On puzzles and polytope isomorphisms}, journal = {Aequationes Math.}, volume = {34}, number = {2--3}, year = {1987}, pages = {287--297}, } @Article{Booth78, author = {K.~Booth}, title = {Isomorphism testing for graphs, semigroups, and finite automata are polynomially equivalent problems}, journal = {SIAM J.~Comput.}, volume = {7}, number = {3}, year = {1978}, pages = {273--279}, } @InProceedings{BoothLueker75, author = {K.~Booth and G.~S.~Lueker}, title = {Linear algorithms to recognize interval graphs and test for the consecutive ones property}, booktitle = {Proc.~7th Ann.~ACM Symp.~Theory Comput.}, year = {1975}, pages = {255--265}, } @Article{BrassKnauer02, author = {P.~Brass and C.~Knauer}, title = {Testing the congruence of $d$-dimensional point sets}, journal = {J.~Comput.~Geom.~Appl.}, year = {2002}, volume = {12}, number = {1/2}, pages = {115--124}, } @Article{ColbournColbourn78, author = {M.J.~Colbourn and J.~Colbourn}, title = {Graph isomorphism and self-complementary graphs}, journal = {SIGACT News}, year = {1978}, volume = {10}, number = {1}, pages = {25-30}, } @Article{CorneilKirkpatrick80, author = {D.~Corneil and D.~Kirkpatrick}, title = {A theoretical analysis of various heuristics for the graph isomorphism problem}, journal = {SIAM J.~Comput.}, volume = {9}, number = {2}, year = {1980}, pages = {281--297}, } @TechReport{Fortin96, author = {S.~Fortin}, title = {The Graph Isomorphism Problem}, institution = {Dept.~of Computer Science, University of Alberta}, year = {1996}, number = {TR 96-20}, address = {Edmonton, Alberta, Canada}, note = {\\\url{ftp://ftp.cs.ualberta.ca/pub/TechReports/1996/TR96-20/TR96-20.ps.gz}} } @InCollection{GawrilowJoswig00b, author = {E. Gawrilow and M. Joswig}, title = {polymake: {A} Framework for Analyzing Convex Polytopes}, editor = {G.~Kalai and G.M.~Ziegler}, booktitle = {Polytopes --- Combinatorics and Computation}, publisher = {Birkh\"auser-Verlag Basel}, series = {{\sl DMV-Seminars}}, year = {2000}, pages = {43--74}, note = {See also \url{http://www.math.tu-berlin.de/diskregeom/polymake}} } @Book{Harary69, author = {F.~Harary}, title = {Graph Theory}, publisher = {Addison-Wesley}, address = {Reading, MA}, year = {1969}, } @Book{Hoffmann82, author = {C.~Hoffmann}, title = {Group-Theoretic Algorithms and Graph Isomorphism}, publisher = {Springer}, year = {1982}, volume = {136}, series = {Lecture Notes in Computer Science}, address = {Berlin-Heidelberg-New York}, } @InProceedings{HopcroftWong74, author = {J.~Hopcroft and J.~Wong}, title = {A linear time algorithm for isomorphism of planar graphs}, booktitle = {Proc.~6th Ann.~ACM Symp.~Theory Comput.}, year = {1974}, pages = {172--184}, } @Article{KaibelPfetsch02, author = {V.~Kaibel and M.~E.~Pfetsch}, title = {Computing the face lattice of a polytope from its vertex-facet incidences}, journal = {Comput.~Geom.}, OPTyear = {2002}, note = {(to appear)}, } @Article{Kalai88, author = {G.~Kalai}, title = {A simple way to tell a simple polytope from its graph}, journal = {J.~Comb.~Theory Ser.~A}, year = {1988}, volume = {49}, number = {2}, pages = {381--383}, } @Book{KoeblerSchoeningToran93, author = {J.~K{\"o}bler and U.~Sch{\"o}ning and J.~Tor{\'a}n}, title = {The Graph Isomorphism Problem: Its Structural Complexity}, publisher = {Birkh\"auser}, series = {Progress in Theoretical Computer Science}, address = {Boston, MA}, year = {1993}, } @InProceedings{Kozen77, author = {D.~Kozen}, title = {On the complexity of finitely presented algebras}, booktitle = {Proc.~9th Ann.~ACM Symp.~Theory Comput.}, pages = {164--177}, year = {1977}, } @TechReport{Kutz02, author = {M.~Kutz}, title = {Computing roots of directed graphs is graph isomorphism hard}, institution = {FU Berlin}, year = {2002}, note = {\texttt{arXiv:math.CO/0207020}} } @Article{Lubiw81, author = {A.~Lubiw}, title = {Some {$\NP$}-complete problems similar to graph isomorphism}, journal = {SIAM J.~Comput.}, year = {1981}, volume = {10}, number = {1}, pages = {11--21}, } @Article{Luks82, author = {E.~Luks}, title = {Isomorphism of graphs of bounded valence can be tested in polynomial time}, journal = {J.~Comput.~System~Sci.}, volume = {25}, number = {1}, year = {1982}, pages = {42--65}, } @Misc{Luks01, author = {Luks, E.}, title = {Personal communication}, month = {May}, year = {2001}, } @Article{Mathon79, author = {R.~Mathon}, title = {A note on the graph isomorphism counting problem}, journal = {Inf.~Process.~Lett.}, year = {1979}, volume = {8}, number = {2}, pages = {131--132}, } @InProceedings{McKay81, author = {McKay, Brendan}, title = {Practical graph isomorphism}, booktitle = {Numerical mathematics and computing, Proc.~10th Manitoba Conf., Winnipeg/Manitoba 1980, Congr.~Numerantium 30}, year = {1981}, pages = {45--87}, note = {See also \url{http://cs.anu.edu.au/people/bdm/nauty}}, } @Article{Miller79, author = {G.~L.~Miller}, title = {Graph isomorphism, general remarks}, journal = {J.~Comput.~System~Sci.}, year = {1979}, volume = {18}, number = {2}, pages = {128--142}, } @InCollection{PolthierKhademPreussReitebuch01, author = {K.~Polthier and S.~Khadem and E.~Peu{\ss} and U. Reitebuch}, title = {Publication of interactive visualizations with \texttt{JavaView}}, booktitle = {Multimedia Tools for Communicating Mathematics}, publisher = {Springer}, year = {2001}, editor = {J.~Borwein et al.}, note = {to appear}, annote = {See also \url{http://www.javaview.de/}} } @Misc{PolthieKhademPreuss00, author = {Polthier, K. and Khadem-Al-Charieh, S. and Preu{\ss}, E. and Eitebuch, U.}, year = 2000, title = {Java{V}iew~-- 3{D} {G}eometry in {W}eb {P}ages}, howpublished = {\url{http://www.javaview.de/}} } @Article{ReadCorneil77, author = {R.~Read and D.~Corneil}, title = {The graph isomorphism disease}, journal = {J.~Graph Theory}, volume = {1}, number = {4}, year = {1977}, pages = {339--363}, } @Article{Shawe-TaylorPisanski94, author = {J.~Shawe-Taylor and T.~Pisanski}, title = {Homeomorphism of $2$-complexes is graph isomorphism complete}, journal = {SIAM J.~Comput.}, year = {1994}, volume = {23}, number = {1}, pages = {120--132}, } @Article{Whitney35, author = {H.~Whitney}, title = {Congruent graphs and the connectivity of graphs}, journal = {Am.~J.~Math.}, volume = 54, OPTnumber = {}, year = {1932}, pages = {150--168}, } @article{ZalcsteinFranklin86, author = {Y.~Zalcstein and S.~P.~Franklin}, title = {Testing homotopy equivalence is isomorphism complete.}, journal = {Discrete Appl.~Math.}, volume = {13}, number = {1}, year = {1986}, pages = {101--104}, } @Book{Ziegler95, author = {G.M.~Ziegler}, title = {Lectures on Polytopes}, publisher = {Springer}, series = {Graduate Texts in Mathematics}, volume = 152, address = {New York}, year = {1995, revised edition 1998}, } @book {Gruenbaum67, AUTHOR = {Gr{\"u}nbaum, Branko}, TITLE = {Convex Polytopes}, PUBLISHER = {Interscience Publishers John Wiley \& Sons, Inc., New York}, YEAR = {1967} }