% Bibliography for DESIGN
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%
%S Publishers . . . . . . . . . . . . . . . . abbreviations for publishers
%%
%% The following strings are abbreviations for publishers, which are used in
%% *books*, *inbook*, and *proceedings*.
%%
@string{ AcaPress = "Academic Press" }
@string{ ACM = "ACM Press" }
@string{ AddWes = "Addison-Wesley" }
@string{ AMS = "American Mathematical Society" }
@string{ Birkhaeus = "Birkh{\accent127 a}user, Basel" }
@string{ BIWissV = "BI-Wis\-sen\-schafts\-ver\-lag, Mannheim" }
@string{ CUP = "Cambridge University Press" }
@string{ Dover = "Dover Publications, New York" }
@string{ Gruyter = "Walter de Gruyter, Berlin, New York" }
@string{ HDeutsch = "Verlag Harri Deutsch, Frankfurt/Main" }
@string{ Macmillan = "The Macmillan Company, New York" }
@string{ OxUnPress = "Oxford University Press" }
@string{ Pergamon = "Pergamon Press, Oxford" }
@string{ Springer = "Springer, Berlin, Heidelberg and New York" }
@string{ Wiley = "John Wiley, New York" }
@string{ Reidel = "Reidel, Dordrecht, Boston" }
@inproceedings{BaCa,
author = "R.~A. Bailey and P.~J. Cameron",
title = "Combinatorics of optimal designs",
crossref = "BCC09",
pages = "19--73",
}
@proceedings{BCC09,
booktitle = "Surveys in Combinatorics 2009",
editor = "S. Huczynska and
J.~D. Mitchell and
C.~M. Roney-Dougal ",
series = "London Math. Soc. Lecture Note Series",
volume = "365",
year = "2009",
publisher = CUP,
}
@ article{Dotw,
author = "R.~A. Bailey and P.~J. Cameron and P.~Dobcs\'anyi
and J.~P. Morgan and L.~H. Soicher ",
title = "Designs on the web",
journal = "Discrete Math.",
volume = "306",
year = "2006",
pages = "3014--3027",
note = "\URL{https://doi.org/10.1016/j.disc.2004.10.027}",
}
@ article{BaCh,
author = "R.~A. Bailey and P.~E. Chigbu",
title = "Enumeration of semi-Latin squares",
journal = "Discrete Math.",
volume = "167-168",
year = "1997",
pages = "73--84",
note = "\URL{https://doi.org/10.1016/S0012-365X(96)00217-8}",
}
@ article{BaRo,
author = "R.~A. Bailey and G.~Royle",
title = "Optimal semi-Latin squares with side six and block size two",
journal = "Proc. Roy. Soc. London, Ser. A",
volume = "453",
year = "1997",
pages = "1903--1914",
note = "\URL{https://doi.org/10.1098/rspa.1997.0102}",
}
@manual{Extrep,
author = {P.~J. Cameron and P. Dobcs \'anyi and J.~P. Morgan and L.~H. Soicher},
title = "The external representation of block designs, Version 2.0",
year = "2004",
note = "\URL{https://webspace.maths.qmul.ac.uk/l.h.soicher/designtheory.org/library/extrep/}",
}
@manual{GAPDoc,
author = {F. L \"ubeck and M. Neunh \"offer},
title = "The GAPDoc package for GAP, Version 1.6.7",
year = "2024",
note = "\URL{http://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc/}",
}
@ article{CaSo,
author = "P.~J. Cameron and L.~H. Soicher",
title = "Block intersection polynomials",
journal = "Bull. Lond. Math. Soc.",
volume = "39",
year = "2007",
pages = "559--564",
note = "\URL{https://doi.org/10.1112/blms/bdm034}",
}
@ article{McSo,
author = "J.~P. McSorley and L.~H. Soicher",
title = "Constructing $t$-designs from $t$-wise balanced designs",
journal = "European J. Combin.",
volume = "28",
year = "2007",
pages = "567--571",
note = "\URL{https://doi.org/10.1016/j.ejc.2005.02.003}",
}
@ article{Soi10,
author = "L.~H. Soicher",
title = "More on block intersection polynomials and new applications
to graphs and block designs ",
journal = "J. Comb. Theory, Ser. A",
volume = "117",
year = "2010",
pages = "799--809",
note = "\URL{https://doi.org/10.1016/j.jcta.2010.03.005}",
}
@manual{Grape,
author = "L.~H. Soicher",
title = "The GRAPE package for GAP, Version 4.9.2",
year = "2024",
note = "\URL{https://gap-packages.github.io/grape}",
}
@manual{Nau90,
author = "B.~D. McKay",
title = "{nauty} user's guide (version 1.5),
Technical report TR-CS- 90- 02",
year = "1990",
organization = "Australian National University",
address = "Computer Science Department",
note = "nauty homepage:
\URL{ http://cs.anu.edu.au/people/bdm/nauty/}",
}
@inproceedings{JK07,
author = "T. Juntilla and P. Kaski",
title = "Engineering an efficient canonical labeling tool for large and sparse graphs",
crossref = "ALENEX07",
pages = "135--149",
note = "bliss homepage: \URL{http://www.tcs.hut.fi/Software/bliss/}",
}
@proceedings{ALENEX07,
title = "2007 Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX)",
booktitle = "Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments and the
Fourth Workshop on Analytic Algorithmics and Combinatorics ",
editor = "D. Applegate et al.",
publisher = "SIAM",
year = "2007",
}
@ article{MP14,
title = "Practical graph isomorphism, II",
author = "B.~D. McKay and A. Piperno",
journal = "J. Symbolic Comput.",
volume = "60",
year = "2014",
pages = "94--112",
note = "\URL{https://doi.org/10.1016/j.jsc.2013.09.003}",
}
@inproceedings{Soi24,
author = "L.~H. Soicher",
title = "Using {GAP} packages for research in graph theory,
design theory, and finite geometry ",
crossref = "ACMG",
pages = "527--566",
note = "accepted manuscript available at:
\URL{ https://webspace.maths.qmul.ac.uk/l.h.soicher/g2g2_final.pdf}",
}
@proceedings{ACMG,
booktitle = "Algebraic Combinatorics and the Monster Group",
editor = "A.~A. Ivanov",
publisher = CUP,
series = "London Math. Soc. Lecture Note Series",
volume = "487",
year = "2024",
}
@inproceedings{Soi13,
author = "L.~H. Soicher",
title = "Designs, groups and computing",
crossref = "PGTCC",
pages = "83--107",
}
@proceedings{PGTCC,
booktitle = "Probabilistic Group Theory, Combinatorics, and Computing. Lectures from the Fifth de Br\'{u}n Workshop",
editor = "A. Detinko and
D. Flannery and
E. O 'Brien",
series = "Lecture Notes in Mathematics",
volume = "2070",
year = "2013",
publisher = Springer,
}
@ article{Soi17,
author = "L.~H. Soicher",
title = "On classifying objects with specified groups of automorphisms, friendly subgroups, and Sylow tower groups",
journal = "Port. Math.",
volume = "74",
year = "2017",
pages = "233--242",
note = "\URL{https://doi.org/10.4171/PM/2004}",
}
¤ Dauer der Verarbeitung: 0.1 Sekunden
(vorverarbeitet am 2026-11-04)
¤
*© Formatika GbR, Deutschland
|
|