Crossref Citations
This Book has been
cited by the following publications. This list is generated based on data provided by Crossref.
Clarke, Robert J.
Han, Guo-Niu
and
Zeng, Jiang
1997.
A combinatorial interpretation of the Seidel generation ofq-derangement numbers.
Annals of Combinatorics,
Vol. 1,
Issue. 1,
p.
313.
Gasharov, Vesselin
1999.
On Stanley's chromatic symmetric function and clawfree graphs.
Discrete Mathematics,
Vol. 205,
Issue. 1-3,
p.
229.
Finch, Steven R.
1999.
Several constants arising in statistical mechanics.
Annals of Combinatorics,
Vol. 3,
Issue. 2-4,
p.
323.
Holmes, Susan P.
1999.
Statistics in Genetics.
Vol. 112,
Issue. ,
p.
81.
du Cloux, Fokko
1999.
Computational Methods for Representations of Groups and Algebras.
p.
201.
Sagan, Bruce
1999.
Why the characteristic polynomial factors.
Bulletin of the American Mathematical Society,
Vol. 36,
Issue. 2,
p.
113.
Bunke, Olaf
and
Castell, Ernestina
1999.
Regression and Contrast Estimates Based on Adaptive Regressograms Depending on Qualitative Explanatory Variables.
Statistics,
Vol. 33,
Issue. 1,
p.
37.
Kalai, Gil
2000.
Visions in Mathematics.
p.
742.
B�na, Mikl�s
Mclennan, Andrew
and
White, Dennis
2000.
Permutations with roots.
Random Structures and Algorithms,
Vol. 17,
Issue. 2,
p.
157.
Sautoy, Marcus
2000.
Countingp-groups and nilpotent groups.
Publications mathématiques de l'IHÉS,
Vol. 92,
Issue. 1,
p.
63.
Kuniba, Atsuo
and
Nakanishi, Tomoki
2000.
Physical Combinatorics.
p.
185.
Varadarajan, S.
Ngo, H.Q.
and
Srivastava, J.
2000.
An adaptive, perception-driven error spreading scheme in continuous media streaming.
p.
475.
Joswig, Michael
Kaibel, Volker
Pfetsch, Marc E.
and
Ziegler, Günter M.
2001.
Vertex-facet incidences of unbounded polyhedra.
advg,
Vol. 1,
Issue. 1,
p.
23.
Bauer, M.
and
Golinelli, O.
2001.
Random Incidence Matrices: Moments of the Spectral Density.
Journal of Statistical Physics,
Vol. 103,
Issue. 1-2,
p.
301.
Aigner, M.
2001.
Algebraic Combinatorics and Computer Science.
p.
347.
Avidon, Michael
Mabry, Richard
and
Sisson, Paul
2001.
Enumerating Row Arrangements of Three Species.
Mathematics Magazine,
Vol. 74,
Issue. 2,
p.
130.
Owczarek, A. L.
Essam, J. W.
and
Brak, R.
2001.
Scaling Analysis for the Adsorption Transition in a Watermelon Network of n Directed Non-Intersecting Walks.
Journal of Statistical Physics,
Vol. 102,
Issue. 3-4,
p.
997.
Perrin, D.
2001.
Algebraic Combinatorics and Computer Science.
p.
391.
Thomas, L.C.
and
Pikounis, M.
2001.
Many‐player rendezvous search: Stick together or split and meet?.
Naval Research Logistics (NRL),
Vol. 48,
Issue. 8,
p.
710.
Kim, Dongsu
and
Zeng, Jiang
2001.
A New Decomposition of Derangements.
Journal of Combinatorial Theory, Series A,
Vol. 96,
Issue. 1,
p.
192.