|
|
Computational Methods
05-04
| [1] |
David Abelson, Seok-Hee Hong, and D. E. Taylor.
Geometric automorphism groups of graphs.
Discrete Appl. Math., 155(17):2211–2226, 2007. |
| [2] |
David Abelson, Seok-Hee Hong, and Donald E. Taylor.
A group-theoretic method for drawing graphs symmetrically.
In Graph Drawing, volume 2528 of Lecture Notes in
Comput. Sci., pages 86–97. Springer, Berlin, 2002. |
| [3] |
John M. Boyer and Wendy J. Myrvold.
On the cutting edge: Simplified O(n) planarity by edge
addition.
J. Graph Algorithms Appl., 8(3):241–273 (electronic), 2004. |
| [4] |
Florent Hivert and Nicolas M. Thiéry.
MuPAD-Combinat, an open-source package for research in algebraic
combinatorics.
Sém. Lothar. Combin., 51:Art. B51z, 70 pp. (electronic),
2004/05. |
| [5] |
M. (ed.) Klin, G.A. (ed.) Jones, A. (ed.) Jurisic, M. (ed.) Muzychuk, and
I. (ed.) Ponomarenko.
Algorithmic Algebraic Combinatorics and Gröbner Bases.
Springer, Berlin, 2009. |
| [6] |
C. Koukouvinos and S. Stylianou.
On skew-Hadamard matrices.
Discrete Math., 308(13):2723–2731, 2008. |
| [7] |
Paulette Lieby.
Colouring planar graphs.
In Discovering Mathematics with Magma, volume 19 of Algorithms Comput. Math., pages 315–330. Springer, Berlin, 2006. |
| [8] |
Adolfo Piperno.
Search space contraction in canonical labeling of graphs (preliminary
version).
arXiv:0804.4881, 2008. |
| [9] |
Leonard H. Soicher.
Computing with graphs and groups.
In Lowell W. Beineke and Robin J. Wilson, editors, Topics in
algebraic graph theory, volume 102 of Encyclopedia of Mathematics and
its Applications, pages 250–266. Cambridge University Press, Cambridge,
2004. |
| [10] |
Kozo Sugiyama, Seok-Hee Hong, and Atsuhiko Maeda.
The puzzle layout problem.
In Giuseppe Liotta, editor, Graph Drawing, Perugia, 2003, pages
500–501. Springer, 2004. |
| [11] |
Doron Zeilberger.
Deconstructing the Zeilberger algorithm.
J. Difference Equ. Appl., 11(9):851–856, 2005. |
|
