## List CRecent and forthcoming publications |

This list contains combinatorial books and papers that
have been published, accepted or submitted for publication since the last
issue of the *Bulletin*. This should not be taken as a complete
record of all such
publications for the period, and absence of listed publications for any
individual should not be taken to imply absence of research activity.

Maximum graphs not spannable by r disjoint paths,

Allen, S.M., Hurley, S. Smith, D.H. and Thiel, S.U.

Using lower bounds in minimum span frequency assignment,

Allen, S.M., Hurley, S. Smith, D.H. and Watkins, W.J.

Solving Frequency Assignment Problems,

Allen, S.M., Hurley, S. and Smith, D.H.

Lower bounding techniques for frequency assignment,

Anderson, I.

On the construction of balanced Room Squares,

Balancing carry-over effects in tournaments,

Anderson, I., Finizio, N.J.

On the construction of triplewhist tournaments, to appear

Anderson, I., Finizio, N.J., Leonard, P.A.

New product theorems for whist tournaments,

Anderson, I., Griggs, T.S.

Anstice and Kirkman: mathematical clerics,

Anthony, M.

Probabilistic 'generalisation' of functions and dimension-based uniform convergence results,

Anthony, M. and Bartlett, P.

Neural Network Learning: Theoretical Foundations, Cambridge University Press, 1999, to be published

Anthony, M., Bartlett, Shawe-Taylor and Williamson, R.C.

Structural Risk minimisation over data-dependent hierachies,

Accuracy of techniques for the logical analysis of data,

Anthony, M. and Holden, S.B.

Cross-validation for binary classification by real-valued functions, in

Araujo, I. and Ruskuc, N.

On finite presentability of direct products of semigroups, submitted

Arrowsmith, D.K. and Essam, J.W.

Chromatic Polynomials and mod-q flows on directed graphs and their applications, submitted

Atkinson, M.D.

Permutations which are the union of an increasing and decreasing sequence,

Restricted Permutations,

Ayik, H. Campbell, C.M., O'Connor, J.J. and Ruskuc, N.

On the efficiency of finite simple semigroups, submitted

The semigroup efficiency of groups, submitted

Azais, J.-M., Monod, H. and Bailey, R.A.

The influence of designs on validity and efficiancy of neighbour methods,

Automorphisms and enumeration of switching classes of tournaments, in preparation

Bailey, R.A.

Statistics and Mathematics: the appropriate use of Mathematics within statistics,

Resolved designs viewed as sets of partitions, in

Four families of efficient resolvable designs in three replicates, in preparation

Bailey, R.A. and Monod, H.

Efficient semi-latin rectangles: designs for plant disease experiments, in preparation

Bang-Jensen, J. and Gutin, G.

Generalisations of tournaments: A survey,

Alternating cycles and trails in 2-edge-coloured multigraphs,

Bang-Jensen, J., Gutin, G. and Yeo, A.

A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs,

Properly coloured Hamiltonian paths in edge-coloured complete graphs,

Bang-Jensen, J. and Jackson, B.

Augmenting hypergraphs by edges of size two,

Bedford, D.

Quasi-orthogonal Latin squares and related designs ,

Bedford, D. and Johnson, M.

Weak uniquely completable sets for finite groups, submitted

Bedford, D. and Whitaker, R.

Enumeration of transversals in the Cayley tables of the non-cyclic groups of order 8,

New and old values for maximal MOLS(n),

Large sets of mutually quasi-orthogonal Latin squares, submitted

Bell, S., Jones, P. and Siemons I. J.

On modular homology in the Boolean algebra II,

Bender E.A., Cameron, P.J., Odlyzko, A.M. and Richmond B.L.

Connectedness, classes, and cycle index,

Bending, T.D. and Fon-Der-Flaass, D.

Crooked Functions, Bent Functions, and Distance Regular Graphs,

Bennet, G. K., Grannell, M.J. and Griggs, T.S.

Bi- embeddings of the projective space PG(3,2),

Bi-embeddings of Steiner triple system of order 15, submitted

Bhattacharjee, M., Macpherson, H.D. Moller, R.G., Neumann, P.M.

Notes on infinite permutation groups, Hindustan Book Agency, (New Delhi: 1997), (to appear in Springer Lecture Notes, in Mathematics No. 1698)

Biggs, N.L.

Constructions for cubic graphs with large girth,

Review of 'Spectral Graph theory' and 'Eigenspaces of Graphs',

Biggs, N.L. andFon-der-Flaass, D.G.

Optimising the signal to noise ratio,

Biggs, N.L., Lloyd E.K. and Wilson R.J.

Graph theory 1736-1936, Clarendon Press, reprinted with corrections, 1998

Billington, E.J. and Cavenagh, N.J.

Decompositions of complete n-partite graphs into cycles,

Bondy, J. A. and Jackson, B.

Uniquely Hamiltonian graphs,

Bonnington, P., Grannell, M.J., Griggs, T.S.

Exponential families of non-isomorphic triangulations of complete graphs, submitted

Borodin, O.V., Kostochka, A.V. and Woodall, D.R.

List edge and list total colourings of multigraphs,

Total colourings of planar graphs with large girth,

Acyclic colourings of planar graphs with large girth,

On Kernel perfect orientations of line graphs,

Borodin, O.V. and Woodall, D.R.

Cyclic degrees of 3-polytopes,

Short cycles of low weight in normal plane maps with minimum degree 5,

Cyclic colourings in 3-polytopes with large maximum face size, submitted

Weights of faces in plane maps, submitted (in Russian)

Bouchet, A. and Jackson, B.

Parity Systems and the delta matroid intersection problem, submitted

Breuer, T. and Linton S.A.

The GAP4-type system: organising algebraic algorithms,

Brien, C.J. and Payne, R.W.

Tiers, structure formulae and the analysis of complicated experiments,

Brightwell, G., Balinska, K. and Quintas, L.

Graphs whose vertices are graphs with bounded degree: distance problems,

Brightwell, G. and Bollobás, B.

Convex bodies, graphs and partial orders,

Brightwell, G., Grable, D. and Promel, H.-J.

Forbiddden induced partial orders,

Balanced pairs in partial orders,

Brightwell, G., Häggström, O. and Winkler, P.

Non-monotonic behaviour in hard-core and Widom-Rowlinson models,

Brightwell, G. and Winkler, P.

Graph homomorphisms and phase transitions,

Brightwell, G., Oriolo, G. and Shepherd, F.B.

Some strategies for reserving resilient capacity,

Bruckner P., Gladky, A., Hoogeveen, J.A, Kovalyov, M.Y., Potts, C.N., Tautenhahn, T. and Velde, S.L.v.d.

Scheduling a batching machine,

Bubley, R. and Dyer, M.

Path coupling: a technique for proving rapid mixing in Markov chains, in

Graph orientations with no sink and an approximation for a hard case of SAT, in

Faster random generation of linear extensions, in

Bubley, R., Dyer, M. and Greenhill, C.

Beating the 2Δ bound for approximately counting colourings: a computer assisted proof of rapid mixing, in

Bubley, R., Dyer, M. and Jerrum, M.

An elementary analysis of a procedure for sampling points in a convex body,

Some result on the achromatic number,

The achromatic number,

Calkin, N.J. and Cameron, P.J.

Almost odd random sum-free sets,

Cameron, P.J.

Introduction to Algebra, Oxford University Press, Oxford: 1998, 295pp.)

Sets, Logic and Categories, SUMS, Springer Verlag, London, to appear in February 1999

Permutation Groups, LMS Student Texts, Cambridge University Press, Cambridge, to appear

On an algebra related to orbit-counting,

A census of infinite distance transitive graphs,

SGDs with 2-transitive automorphism group, in preparation

Some counting problems related to permutation groups, in preparation

Some bridges between codes and designs, in preparation

Cameron, P.J. and Erdös, P.

Notes on sum-free and related sets,

Cameron, P.J. and Hodges, W.A.

Some combinatorics of imperfect information, in preparation

Cameron, P.J. and Szabo, C.

Independence algebras, in preparation

Campbell, C.M., Robertson, E.F. , Ruskuc, N. and Thoman, R.M.

Direct products of automatics semigroups, submitted

Campbell, C.M., Havas, George, Linton S.A. and Robertson, E.F.

Symetric presentations and orthogonal groups, in

Chapman, R.J.

Moments of Dyck Paths,

Cavenagh, N.J.

Decompositions of complete tripartite graphs into k-cycles, A

Chen, B., Potts, C.N. and Woeginger, G.J

A review of machine scheduling: Complexity, algorithms, and approximability, in

Chen, B., Potts, C.N. and Strusevich, V.A.

Approximation for two machine flow shop scheduling with batch setup times,

Chen, B., Vestjens, A.P. and Woeginger, G.J

On-line scheduling of two machine open shops where jobs arrive over time,

Chen, B. and Vestjens, A.P.

Scheduling on identical machines: How good is LPT in an on-line setting?,

Chetwynd, A., Diggle, P., Drewett, R. and Young B.

A mixture model for sucking patterns of breast-fed infants,

Chetwynd and A., Diggle, P.

On estimating the reduced second moment measure of a stationary spatial point process,

Chetwynd, A., Diggle, P., Marshall, A. and Parslow, R.

Investigation of spatial clustering from matched and stratified case-control studies, submitted

Christie, D.A., Irving, R.W.

Sorting strings of global transformation, submitted

Christofi, C.

On the number of 6 x 7 double Youden rectangles,

Cohen, S.D.

Polynomial factorisation and an application to regular directed graphs,

Some function field estimates with applications, in Number theory and applications,

Cohen, S.D. and Hachenberger

The dynamics of linearised polynomials,

Colbourn, C.J., Grannell, C.J., Griggs, T.S. and Siran J.

Construction techniques for anti-Pasch steiner triple systems, submitted

Conway, J.H. Hulpke, J.A. and McKay, J.

On transitive permutation groups,

Cooper, S., Hirschhorn, M. and Lewis, R.P.

Powers of Euler's product and related identities, submitted

Cossidente, A., Hirschfeld, J.W.P., Korchmaros, G. and Torres, F.

On plane maximal curves,

Crane, C., Duffy, J. Knight, B. and Rooney, J.

An investigation of some special motions of an octahedron manipulator using screw theory,

Crauwels, H.A.J., Potts, C.N. and Van Wassenhove, L.N.

Local search heuristics for the single machine total weighted tardiness scheduling problem,

Cropper, M.M., Hilton A.J.W, Goldwasser, J.L., Hoffmann, D.G. and Johnson, P.D.

Extending the disjoint representation theorems of Hall Halmos and Vaughan to lost multicolourings of graphs, submitted

Cryan, M., Goldberg, L.A. and Goldberg, P.W.

Evolutionary trees can be learned in Polynomial Time in the two state General Markov Model,

Curtis, R.T.

The exceptional automorphism and covers of the symmetric groups, (preprint)

Cuypers, H., Sterk, H. and Soicher, L.H.

Working with finite groups, in

Project: the small Mathieu groups, in

Cvetkovic, D., Lepovic, M., Rowlinson, P., Simic, S.K.

A database of star complements of graphs, submitted

On the 2-parallel chromatic index of Steiner triple systems, submitted

Davis, J.A. and Jedwab, J.

A new family of relative difference sets in 2-groups,

Peak-to-mean power control in OFDM, Golay complementary sequences and Reed-Muller codes,

Some recent developments in difference sets,

A unified approach to difference sets with gcd(v,n)>1, submitted

Davis, J.A. and Jedwab, J. and Mowbray, M.

New families of semi-regular relative difference sets,

Davis, J.A. and Jedwab, J. and Paterson, K.G.

Codes, correlations and power control in OFDM, submitted

Dent S. and Siemons, I.J.

On a conjecture of Foulkes, submitted

Du, D., Han J. and Chen B.

An improved heuristic for one-machine scheduling with delays constraints,

Dugdale, J.K. and A.J.W. Hilton

A sufficient condition for a graph to be the core of a class 2 graph,

Duff, J., Lee, J. and Rooney J.

Tensigrity and compegrity configurations in anti-prism manipulator platforms,

Dunbar, J.E., Monroe, T.R. and Whitehead, C.A.

Sensitivity of the upper irredundance number to edge addition, submitted

Dyer, M., Frieze, A. and Jerrum, M.

On counting independent sets in sparse graphs, (1998), preprint

Approximately counting Hamilton paths and cycles in dense graphs,

Dyer, M. and Greenhill, C.

A genuinely polynomial-time algorithm for sampling two-rowed contingency tables, in

A more rapidly mixing Markov chain for graph colourings,

Some #P-completeness proofs for colourings and independent sets,

On Markov chains for independent sets, (1997), preprint

Complete systems of lines on a Hermitian surface over a finite field, submitted

Edwards, H., Hierons, R.M. and Jackson, B.

The Zero-free Intervals for Characteristic Polynomials of Matroids,

Edwards, K.J.

A new upper bound for harmonious chromatic number,

The harmonious chromatic number of complete

Escott, A.E. and Jenkins, S.

Binary Huffmann equivalent codes with a short synchronising codeword,

Eslakchi, Ch. and Hilton, A.J.W.

The Hall-condition index of a graph and the overfull conjecture, submitted

The maximum number of edges in a graph with fixed edge-degree,

Fitzpatrick, P. and Jennings, S.M.

Comparison of two algorithms for decoding alternant codes, to appear in AAECC

Fleischmann, P.

Finite fields, root systems, and orbit numbers of Chevalley groups,

Polynomial identities for orbit numbers of general linear unitary groups over finite fields,

Squarefree Polynomials over finite fields and regular semisimple classes of certain classical groups,

Flury, B.D., Gloria, M.N. and Irving R.W.

Magic Dice,

Fon-der-Flaass, Dima

On exponential trees,

Fon-der-Flaass, D.G. and Belegradek, B.

New approach to pricing: earn while you earn, submitted to

More Distance Regular Graphs and Association Schemes from Crooked Functions, submitted to

Fon-der-Flaass, D.G. and Bending, T.

Crooked Functions, Bent Functions, and Distance Regular Graphs,

Real-valued frequency assignment,

Fon-der-Flaass, D.G. and Biggs, N.

Optimising the signal-to-noise ration,

Fon-der-Flaass, D.G., Kostochka, A.V. and Woodall, D.R.

Transversals in uniform hypergraphs with property (7,2), submitted.

Real-valued frequency assignment,

The travelling salesman problem in circulant graphs, submitted

Gibbons, A., Muthukrishnan, S. and Pu, I.

Exact expected case analysis of a simple heuristic for compressed Array storage,

Gibbons, A. and Pu, I.

A Las Vegas RNC Algorithm for the uniform Generation of unlabelled Graphs,

Gilbey, J.D., and Kalikow, L.H.

Parking functions, valet functions and priority queues,

Giudici, M.R. and Praeger, C.E.

Completely transitive codes in Hamming graphs, in preparation

Goddyn, L.A. and Jackson, B.

Removable circuits in binary matroids, to appear

Goldberg , L.A. and Jerrum, M.

The "Burnside process" converges slowly ,

Randomly sampling Molecules, to appear in

Goldberg , L.A., Jerrum, M. and Mac Kenzie, P.D.

An Ω(√(log log n)) lower bound for routing in optical networks,

Gordon, N.A., Jarvis, T.M. and Shaw, R.

The classes of GL (n,2), n<=6, submitted

Sp(2m,2) inside GL(2m,2),

Gordon, N.A., Lunardon, G. and Shaw, R.

Linear sections of Gl (4,2),

Grannell, M.J. and Griggs, T.S.

Configurations in Steiner triple systems, in

Grannell, M.J., Griggs, T.S. and Mathon, R.

Steiner systems S(5,6,v) with v=72 and 84,

Grannell, M.J., Griggs, T.S. and Murphy, J.P.

Perfect Steiner triple systems,

Switching cycles in Steiner triple systems,

Grannell, M.J., Griggs, T.S. and Quinn, K.A.S.

All possible 3.(v,4, λ)directed design exists,

Mendelsohn directed triple systems, submitted

Grannell, M.J. and Griggs, T.S. and Siran, J.

Surface embeddings of Steiner triple systems,

Face 2-colourable triangular embeddings of complete graphs,

Grannell, M.J., Griggs, T.S. and Wallace, J.

The smallest defining set of Steiner triple system,

Grannell, M.J. and Rosa A.

Cycles in 2-factorisations,

Griggs, T.S.

(see Anderson, I, Bennet, G.K., Bonnington, P., Colbourn, C.J., Danziger, P., and Grannel, M.J.)

Gutin, G.

A note on cardinality of certain classes of unlabeled multipartite tournaments,

Exponential neighbourhood local search for the travelling salesman problem, To appear in Special Issue of

Connected (g,f)-factors and supereulerian disgraphs, To appear in

Gutin, G., Kostochka, A., and Toft, B.

On the Hajós number of Graphs, to appear in

Gutin, G., Sudakov, B. and Yeo A.

Note on altering directed cycles,

Gutin, G. and Yeo A.

Small diameter neighbourhood graphs for the travelling salesman problem; at most four moves from tour to tour, to appear in Special Issue of

Note on the path covering number of a semicomplete multipartite digraph, to appear in

Gutin, G. and Zverovich V.

Upper Domination and Upper Irredundance Perfect Graphs,

Scheduling with finite capacity output buffers,

Scheduling with finite capacity input buffers,

Hammond, P.R., Lewis, R.P. and Liu Z.-G.

Hirschhorn's identities, submitted

Hartnell, B.L. and Whitehead C.A.

On k-packings of Graphs,

Hartnell, B.L., Jorgenson, L.K., Vestergaard, P.D. and Whitehead, C.A.

Edge Stability of the k-domination number of trees,

Hartnell, B.L. Rall, D.F. and Whitehead C.A.

The watchman's walk problem: an introduction, to appear

Hierons, R.M.

Testing from semi-independent communicating finite state machines with a slow environment,

Minimising the costs of Fault Location when testing from a finite state machine,

Adaptive testing of a deterministic Implementation against a nondeterministic finite state machine,

Higgins, P.M., Howie, J. M, and Ruskuc, N.

On relative ranks of full transformation semigroups,

Generators and Factorisation of transformation Semigroups,

Hill, R.

Giuseppe Tallini - a survey of some of his papers and personal memories,

The pigeonhole principle, letter to

An extension theorem for linear codes,

Book review of "Projective Geometries over finite fields" by Hirschfeld, J.W.P., B

Hill, R., Berlekamp, E.R. and Karim, J.P.

The solution of a problem of Ulam on searching with lies,

Hill, R. and Elzaidi, S.M.

Cubes and inverses of magic squares,

Hill, R. and Jones, C.M.

The nonexistence of ternary (47,6,29) codes,

Hill, R. and Kolev E.

A survey of recent results on optimal linear codes, in

An improved bound on the covering number K2(9,1),

Hill, R. and Landjev, I.N.

On the non-existence of some quaternary codes, in A

Hill, R. and Lizak, P.

Some geometric constructions of optimal quaternary codes

Hilton, A.J.W. and Goldwasser, J.L.

The scope of three colouring conjectures,

Hilton, A.J.W. and Hind, H.R.

Non-conformable subgraphs of non-conformable graphs, submitted

Hilton, A.J.W., Holroyd, F.C. and Zhao, C.

The overfull conjecture and the conformability conjecture, submitted

Hilton, A.J.W. and Johnson, P.D.

The Hall number, the Hall index and the total Hall number of a graph,

Relations among the fractional chromatic, choice, Hall and Hall-condition numbers of simple graphs, submitted

Hilton, A.J.W. and Rodger, C.A.

Hamiltonian double latin squares, to appear

Hilton, A.J.W., Slivnik, T. and Stirling, D.S.G.

A vertex splitting lemma, de Werra's theorem and improper list colourings,

Hilton, A.J.W. and Stirling, D.S.G.

The dual of an identity of Ahlwede and Zhang,

Hilton, A.J.W. and Wojciechowski, J.

Fractional latin squares, simplex algebras and generalised quotients, in

Hiramine, Y., Jha, V. and Johnson, N.L.

Two-transitive ovals in generalised twisted field planes,

Hirschfeld, J.W.P,

Buekenhout-Metz unital, in

Unital, in

W.L. Edge, in

Codes on Curves and their geometry,

Curves and configurations in finite spaces,

Hirschfeld, J.W.P and Korchmaros, G.

On the number of rational points on an algebraic curve over a finite field,

Arcs and curves over a finite field, submitted

Hirschfeld, J.W.P and Ledermann, W.

D.B. Scott,

Hirschfeld, J.W.P and Storme, L.

The packing problem in statistics, coding problems and finite projective spaces,

Hobbs, J.D. and Rooney, J.

Towards kinematic classification schemes for planetary surface locomotion systems, submitted

Hochstattler, W. and Jackson, B.

Large circuits in binary matroids of large cogirth I and II,

Hoggar, S. G.

64 lines from a quaternionic polytope,

Fractal dimension and equine bone,

Hoggar, S.G., and Martinelli, M.J.

The computer as a search tool, in

Hoggar, S.G., McAlpine, K. and Miranda, E.T.

Dynamical Systems and applications in music compositions,

A cellular automaton-based music algorithm,

Making music with algorithms,

Hoggar, S.G., Menzies, L.

Fractal compression and the jigsaw property I,

Fractal compression and the jigsaw property II, under revision

Holroyd, F.C., Quinn, K.A.S., Rowley, C.A., Webb, B.S. (eds.)

Balancing carry-over effects in tournament,

Holroyd, F.C., Quinn, K.A.S., Rowley, C.A., Webb, B.S.

Combinatorial Design and their Applications, Chapman & Hall / CRC Press Research notes in Mathematics, to appear

Hulpke, J.A.

Computing normal Subgroups,

Galois Groups through irrelevant relations,

Hulpke, J.A. and Linton, S.A.

Construction of Co3. An example of the use of an integrated system for Computational Group Theory,

Hurley, S., Smith, D.H. and Valenzuela C.

A permutation based algorithm for minimum span frequency assignment, to appear

Hurley, S. and Smith, D.H.

Meta-heuristics and channel assignment, to appear

Huybrechts, C. and Pasini, A.

Flag-transitive extensions of dual projective spaces,

Matching medical students to pairs of hospitals: a new variation on an old theme,

Irving, R.W., Manlove, D.F.

The B-chromatic number of a graph,

On graphs with complete bipartite star complements, submitted

Jackson, B. and Sheehan, J.

The structure of transform graphs,

Jackson, B. and Whitehead, C.A.

Some remarks on Jaeger's Dual-Hamiltonian Conjecture,

Jackson, B. and Yu, X.

Hamilton cycles in plane triangualtions,

Jha, V. and Johnson, N.L.

Finite doubly transitive affine planes, (Notes),

Cyclic Ostrom planes,

Jones, G.A. and Lloyd E.K.

Reaction Graphs,

Jennings, S.M. and Kessels, J.

Comparison of two Reed-Solomon Decoding Algorithms for the DCC Player in a VLSI Programming Language, to appear in

Jerrum, M.

Mathematical foundations of the Markov chain Monte Carlo method, in

Jerrum, M. and Sorkin, G.B.

The Metropolis algorithm for graph bisection,

Sparse sets in the complements of graphs with given girth, submitted

Choosability conjectures and multicircuits, submitted

Density conditions for panchromatic colourings of hypergraphs, submitted

A note on weighted matching with penalty problem,

Efficient optimal equation formulation in lumped power conserving systems,

Landjev, I., Maruta, T. and Hill, R.

On the non-existence of optimal quaternary, (51, 4,37) codes,

Leedham-Green, C.R. and Soicher, L.H.

Symbolic Collection using Deep Thought,

Lewis, R.P. and Liu, Z.-G.

On two identities of Ramanujan,

On an identity of Ramanujan, submitted

A conjecture of Hirschhorn on the 4-dissection of Ramanujan's continued fraction, submitted

Linton, S.A., Pfeifer, G., Robertson, E.F. and Ruskuc, N.

Groups and actions in transformation semigroups,

Liu, Bo Lian and Rowlinson, P.

Dominating properties of star complements, submitted

Lloyd, E.K.

Reaction graphs, and Cayley diagrams,

Bell polynomial, in:

Lah number, in

Some graphs associated with the seven point plane, submitted

Lothian, P.J.G. and Paterson, K.G.

Bounds on partial correlations of sequences,

Orbits of soluble infinite permutation groups, in

Extending partial orders on o-minimal structures to definable total orders,

Manlove, D.F.

On the algorithmic complexity of twelve covering and independence parameters of graphs,

Maynard, P. and Siemons, I.J.

On the reconstruction of linear codes,

On the reconstruction index of a permutation group I, in preparation

Mc Donough, T.P., Mavron V.C., Pallikaros, C.A.

Generalised Hadamard Matrices and Translations, submitted

Mc Kee, J.F., Rowlinson, P., Smyth, C.J.

Salem number and Pisot numbers from stars,

Mitchell, C.J. and Paterson, K.G.

Perfect factors from cyclic codes and interleaving,

Mnukhin, V.B. and Siemons, I.J.

An orbit theorem, submitted

On modular homology in projective space, submitted

The modular homology of shellable complexes, in preparation

Morgan, J.P. and Bailey, R.A.

Optimal design with many blocking factors, in preparation

Obituary , Eric Charles Milner,

Nash-Williams, C.St.J.A., and White, D.J.

An application of flows to rearrangement of series,

Noble, S.

Evaluating the Tutte Polynomial for graphs of bounded tree-width,

Noble, S. and Welsh, D.J.A.

A weighted graph polynomial from Vassiliev invariants, to appear in

Nowakowski, R.J. and Whitehead, C.A.

On ordered graceful, labellings of the 2-star, submitted

Binary sequence sets with favourable correlation properties from difference sets and MDS Codes,

Root counting, the DFT and the linear complexity of non-linear filtering,

Generalised Reed-Muller codes and power control in OFDM modulation, submitted

Bounds on envelope power of trace codes for OFDM, submitted

Paterson, K.G. and Tuliani, J.

Some new circuit codes,

Payne, R.W.

Detection of partial confounding in generally balanced designs,

Construction of efficient identification schemes using batches of discrete-valued tests,

Design keys, pseudo factors and general balance,

Perkins, S. and Smith D.H.

Synchronising codewords of q-ary Huffmann codes ,

Perkins, S. and Escott A.E.

Two short notes on Huffmann codes, submitted

Perkins, S. and Smith, D.H.

A scheme for the synchronisation of variable length codewords, submitted

Peterson, D, and Woodall, D.R.

Edge-choosability in line-perfect multigraphs,

Phillips, N.C.K. and Preece D.A.

Tight single-change covering designs with v=12, k=4,

Preece, D.A. and Phillips, N.C.K.

A new type of Freeman- Youden rectangle,

Preece, D.A. and Vowden, B.J.

Some series of cyclic balanced hyper-Graeco-Latin superimpositions of Youden squares,

Preece, D.A., Vowden, B.J. and Phillips N.C.K.

Double Youden rectangles of sizes p x (2p+1) and (p+1) x (2p+1),

Double Youden rectangles of sizes (p+1) x (p+p+1),

Prince, A.R.

A complete classification of the flag-transitive affine planes of order 125,

Oval configurations of involutions in symmetric groups,

Parallelisms of PG(3,3), in

Uniform parallelisms of PG(3,3), in

The cyclic parallelism of PG(3,5), E

Projective planes of order 12 and PG(3,3), Proceedings of Combinatorics '96 Conference, (Assisi, Italy, 1996),

Flag-transitive affine planes of order 64,

Difference matrices and orthomorphisms over non-A|belian groups,

Bounds for key distribution patterns ,

An Atlas of Graphs, Oxford University Press, Oxford 1998-12-18

Rees, D.H.

Some new generalised Kirkman systems,

Rees, D.H. and Preece, D.A.

Perfect Graeco-Latin balanced incomplete block designs,

Rees, S.E. and Soicher, L.H.

An algorithmic approach to fundamental groups and covers of combinatorial cell complexes,

Rhodes, F. and Melter, R.A.

Geodetic metrisations of graphs,

Robertson, E.F. and Ruskuc, N. and Wiegold, J.

Generators and relations of direct products of semigroups,

Rowlinson, P.

Star sets in regular graphs,

On graphs with multiple eigenvalues,

Star sets and star complements in finite graphs: a spectral construction technique,

Ruskuc, N.

On large sub-semigroups and finiteness conditions of semigroups,

Ruskuc, N. and Thomas, R.M.

Syntactic and Rees indices of sub-semigroups,

Ryley, A., Thomas, O.D.J., Perkins, S. and Smith, D.H.

Synchronisation of sequences of variable length codewords, submitted

Simulated Factorisations III,

Shaw, R.

The classes of GL(n,q),

Every element of Gamma L (V) of finite order has a long cycle,

Configuration of planes in PG (5,2),

A property of A 7, and a maximal 3-dimensional linear section of GL(4,2),

Siemons, I.J.

Kernels of modular inclusion maps, Discrete Mathematics, No. 174, (1997), pp. 309-315.

Siemons, I.J. and Zalesski, A.

Intersection of matrix algebras and permutation representations of PSL (n,q), in preparation

Smith, D.H., Allen, S.M. and Hurley S.

Lower bounds for channel assignment, to appear

Smith, D.H., Allen, S.M. and Hurley S. and Watkins, W.J.

Frequency assignment: Methods and Algorithms,

Smith, D.H., Hurley, S. and Thiel S.U.

Improving heuristics for frequency assignment problem,

Smith, D.H., Thomas, O.D.J. and Ryley, A.

Robust data compression applied to rotary head DSS-3 tapes,

Soicher, L.H.

GRAPE, in

Sparks, T.H., Biley, R.A. and Elston, D.A

Pseudoreplication- enough is enough, in preparation

Spence, E.

All 2-(27,7,3) designs are residual,

Spence, E. and van Dam, E.R.

Small regular graphs with four eigenvalues,

Spence, E. and Pavcevic, M.O.

Some new symetric designs with λ = 10 having an automorphism of order 5,

Radio channel assignment on 2-dimensional lattices,

van den Heuvel, J., Bauer, D., Morgana, A. and Schmeichel, E.

The complexity of toughness in regular graphs,

van den Heuvel, J. and Jackson B.

On the edge connectivity, hamiltonicity and toughness of vertex transitive graphs, submitted

van den Heuvel, J., Leese, R.A. and Shepherd, M.A.

Graph labelling and radio channel assignment,

van den Heuvel, J. and McGuiness, S.

Colouring and labelling of planar graphs,

von Stengel, Bernhard

New maximal numbers of equilibria in bimatrix games,

Vowden, B.J.

A new infinite series of double Youden rectangles,

Vowden, B.J. and Preece, D.A.

Some new infinite series of Freeman-Youden rectangles, A

Wilson, R.J.

Graph Theory, in

Woodall, D.R.

Edge-choosability of multicircuits,

To the Top of the page

To the BCB Home page

Last change: 6 May 1999

Send comments to: bcb@cdam.lse.ac.uk.