List C - University of Essex

Transcription

List C.
Recent and forthcoming publications.
This list contains combinatorial books and papers, with at least one UK based
author, published, accepted or submitted since the last Bulletin - i.e., during
(approximately) the period April 2013-April 2014 - and have come to the attention of
the Editor. “UK based” is interpreted liberally for those with more than one base.
The intention is that papers whose status has changed (by being accepted, or
appearing in print) will appear again, but not those still under consideration or
revision, or still waiting to be published (except possibly occasionally preprints which
have undergone very substantial revision). Occasionally recent papers from 12-15
months ago which were accidentally omitted from last year’s Bulletin, or preprints
more than a year old which appear to be of combinatorial interest but have not
previously been publicised in the Bulletin, are included. Authors are (hopefully!)
listed in alphabetical order by surname, even if that is not the order in which they
appear on the paper – this is essential to keep the Bulletin orderly - and that all coauthors (UK based or not) are cross-referenced to. In the case of authors who have left
or entered the UK during the relevant period, we are generous about including the
papers, and in particular if an author leaves the UK while his/her paper is working
through the system, it continues to be listed.
Abbreviations of the titles of journals/serials are normally taken from Zentralblatt,
though for less commonly occurring journals, conference proceedings and books the
style may vary. Following a suggestion recently, a list of abbreviations and the
corresponding full titles of journals is included at the end, to help those unfamiliar
with what a particular abbreviation refers to. There will be errors!
Where the Editor is aware of a link to a preprint version of an article (and the
author has no objection) a link to that page is included. Maintenance of these links
will be in the (closed) interval minimal to non-existent: they are used at your own
risk. Use of these versions is likely to be subject to restrictions, e.g. that the version is
used only for purposes of personal study and not for commercial purposes, and should
not be reproduced further: if in any doubt, you should check with the author(s) of the
paper involved before using such links. Preprint versions of a paper may well differ,
often non-trivially, from any eventual version which appears in a journal (and there
may be several competing versions of the preprint!). The copyright of an article rests
with the author(s) unless they have conceded the copyright to (e.g.) a publisher. Some
links may not work unless you, or your institution, has certain access rights. Similarly,
where a valid DOI number has come to the Editor’s attention these are provided:
again, accuracy cannot be guaranteed.
This list should not be taken as a complete record of all such publications during
the period, and absence of listed papers for any individual should not be taken to
imply absence of research activities.
Abdullah, M., Cooper, C. and Draief, M.
Viral Processes by Random Walks on Random Regular Graphs. Ann. Appl. Probab.,
to appear.
Abdullah, M. and Draief, M.
Consensus on the Global Majority by Local Majority Polling on Graphs of a Given
Degree Sequence. Preprint.
http://arxiv.org/pdf/1209.5025
Abogatma, A. and Truss, J. K.
Countable homogeneous lattices. Preprint.
http://www1.maths.leeds.ac.uk/pure/staff/truss/aisha.pdf
Aboulker, P., Radovanović, M., Trotignon, N., Trunck, T. and Vušković, K.
Linear balancable and subcubic balanceable graphs. J. Graph Theory 75 (2014)
150-166. http://dx.doi.org/10.1002/jgt.21728
http://www.comp.leeds.ac.uk/vuskovi/ConfortiRaoConjecture.pdf
Abreu, M., Labbate, D., Rizzi, R. and Sheehan, J.
Odd 2–factored snarks. Eur. J. Comb. 36 (2014) 460-472.
http://dx.doi.org/10.1016/j.ejc.2013.09.008
http://de.arxiv.org/pdf/1210.8101v2
Abreu, M., Labbate, D., Rizzi, R. and Sheehan, J.
A counterexample to the odd 2-factored snarks conjecture. Electron Notes. Discrete
Math. 40 (2013) 205-210.
http://dx.doi.org/10.1016/j.endm.2013.05.037
Abu-Gazalh, N. and Ruškuc, N.
On semigroups which are unions of finitely many copies of the free monogenic
semigroup, Semigroup Forum 87 (2013) 243-256.
http://dx.doi.org/10.1007/s00233-013-9468-9
http://arxiv.org/pdf/1205.6169.pdf
Abu Khzam, F. N., Feghali, C., and Müller, H.
NP-hardness results for partitioning graphs into disjoint cliques and a triangle-free
subgraph. Preprint.
http://arxiv.org/pdf/1403.5248v2
Abu Khzam, F. N., Feghali, C. and Müller, H.
Forbidden subgraph characterization of ( -free,
free)-colourable cographs.
Preprint.
Adamaszek, M.
Special cycles in independence complexes and superfrustration in some lattices.
Topology and its Applications 160 (2013) 943-950
http://dx.doi.org/10.1016/j.topol.2013.03.009
http://arxiv.org//pdf/1109.4914v1.pdf
Adamaszek, M.
Small flag complexes with torsion. Cand. Math. Bull., to appear. .
http://arxiv.org/pdf/1208.3892v1.pdf
Affife Chauouffe, F., Rutherford, C. G. and Whitty, R. W.
Objective functions with redundant domains. J. Comb. Opt. 26 (2013) 372-384.
http://dx.doi.org/10.1007/s10878-012-9468-9
Ahlberg, D., Broman, E., Griffiths, S. and Morris, R. D.
Noise Sensitivity in Continuum Percolation. Israel J. Math., to appear.
Aimino, R. Nicol, M. and Todd, M.
Recurrence statistics for the space of Interval Exchange maps and the Teichmüller
flow on the space of translation surfaces. Preprint.
Akhtar, M. and Kasprzyk, A.
Singularity content. Preprint.
Akhtar, M. and Kasprzyk, A.
Mutations of fake weighted projective planes. Proc. Edin Math. Soc., to appear.
http://magma.maths.usyd.edu.au/users/kasprzyk/research/pdf/triangle_mutation.pdf
Akrida, E. C. and Spirakis, P. G.
Moving in temporal graphs with very sparse random availability of edges. Preprint.
Albert, M. H., Atkinson, M. D., Bouvel, M., Ruškuc, N. and Vatter, V.
Geometric Grid clasess of Permutations. Trans. Am. Math. Soc. 365 (2013)
5859-5881.
http://dx.doi.org/10.1090/S0002-9947-2013-05804-7
Albert, M. H., Atkinson, M. D. and Claesson, A.
Isomorphisms between pattern classes. Preprint.
Albert, M. H. and Brignall, R.
Enumerating indices of Schubert varieties defined by inclusions. J. Comb. Theory
Ser. A 123 (2013), 154–168.
http://dx.doi.org/10.1016/j.jcta.2013.12.003
Albert, M. H., Brignall, R. and Vatter, V.
Large infinite antichains of permutations. Pure Math. Appl., to appear.
Albert, M. H., Ruškuc, N. and Vatter, V.
Inflations of geometric grid classes of permutation. Isr. J. Math, to appear.
Aldred, R. E. L., Bailey, R. A., McKay, B. D. and Wanless, I. M.
Circular desings balanced for neighbours at distances one and two. Submitted.
Aliev, I., Fukshansky, M. and Henk, M.
Generalized Frobenius numbers: Bounds and average behavior. Acta Arith. 155
(2012) 53-62. http://arxiv.org/pdf/1105.0841v1
Aliev, I., Henk, M. and Linke, E.
Integer points in knapsack polytopes and s-covering radius. Electron. J. Comb. 20 (2)
(2013) p42.
http://www.combinatorics.org/ojs/index.php/eljc/article/view/v20i2p42/pdf
Aliev, I. and Letchford, A. N.
Iterated Chvátal-Gomory cuts and the geometry of numbers. Preprint.
Allen, P., Böttcher, J., Hàn, H., Kohayakawa, Y. and Person, Y.
Powers of Hamilton cycles in pseudorandom graphs. Preprint.
Allen, P., Böttcher, J., Hladký, J. and Piguet, D.
A density Corrádi-Hajnal theorem. Preprint.
Allen, P., Böttcher, J., Hladký, J. and Piguet, D.
An extension of Turán's Theorem, uniqueness and stability. Preprint.
Allen, P., Böttcher, J., Kohayakawa, Y. and Person, Y.
Tight Hamilton cycles in random hypergraphs. Random Struct. Algorithms, to appear.
http://personal.lse.ac.uk/boettche/docs/AllKohPer_TightCycles.pdf
Allen, P., Brightwell, G. R. and Skokan, J.
Ramsey-goodness – and otherwise. Combinatorica 33 (2013) 125-169.
http://dx.doi.org/10.1007/s00493-013-2778-4
Allen, P., Keevash, P., Sudakov, B. and Verstraete, J.
Turán numbers of a bipartite graph plus an odd cycle. J. Comb. Theory Ser. B 106
(2014) 134-162
http://dx.doi.org/10.1016/j.jctb.2014.01.007
http://people.maths.ox.ac.uk/keevash/papers/erdos-simonovits-bipartite2.pdf
Allen, P., Kohayakawa, Y., Mota, G. O. and Parente, R. F.
On the number of orientations of random graphs with no directed cycles
of a given length. Electron J. Comb. 21 (1) (2014) p52.
http://www.combinatorics.org/ojs/index.php/eljc/article/download/v21i1p52/pdf
Allen, P., Skokan, J. and Würfl, A.
Maximum planar subgraphs in dense graphs. Electron J. Comb. 20 no 3 (2013) P1.
http://www.combinatorics.org/ojs/index.php/eljc/article/view/v20i3p1
Alon, N., Balogh, J., Morris, R. D. and Samotij, W.
A refinement of the Cameron-Erdős conjecture. Proc. Lond. Math. Soc. 108 (2014)
44-72.
http://dx.doi.org/10.1112/plms/pdt033
Alpern, S. and Fokkink, R.
Illuminating a network from its nodes. Amer. Math. Monthly 120 (2013) 358-359.
http://dx.doi.org/10.4169/amer.math.monthly.120.04.358
http://www.jstor.org/stable/10.4169/amer.math.monthly.120.04.358
Alqahtani, H. M. and Erlebach, T.
Approximation algorithms for disjoint st-paths with minimum activation cost.
Lect. Notes Comput. Sci. 7878 (2013) 1-12 (CIAC2013).
http://dx.doi.org/10.1007/978-3-642-38233-8_1
http://link.springer.com/chapter/10.1007/978-3-642-38233-8_1
Alzer. H. and Chapman, R. J.
On Boole's formula for factorials. Australas. J. Comb 59 (2014) 333--336.
http://ajc.maths.uq.edu.au/?page=get_volumes&volume=59
Amini, H., Fountoulakis, N. and Panagiotou, K.
Bootstrap percolation in inhomogeneous random graphs. Preprint.
Amini, O., Devroye, L, Griffiths, S. and Oliver, N.
Explosion in heavy-tailed branching random walks, Ann. Probab. 41 (2013), no. 3B,
1864-1899.
http://projecteuclid.org/euclid.aop/1368637061
Amini, O., Esperet, L. and van den Heuvel, J.
A Unified Approach to Distance-Two Colouring of Graphs on Surfaces.
Combinatorica 33 (2013) 256-293.
http://dx.doi.org/10.1007/s00493-013-2573-2
Amit, M., Crochemore, M. and Landau, G. M.
Locating All Maximal Approximate Runs in a String. Lect. Notes. Comput. Sci. 7922
(2013) 13-27.
http://dx.doi.org/10.1007/978-3-642-38905-4_4
Anderson, I.
Combinatorial set theory, chapter in Combinatorics: ancient and modern (R.J. Wilson
and J.J. Watkins, editors), Oxford, 2013.
Anderson, I. and Crilly, T.
The mathematician who drove whist forward: William Henry Whitfeld (1856-1915).
BSHM Bulletin 28 (2013) 132-142
Anderson, I. and Crilly, T.
Robert Richard Anstice (1813-1853): a Hertfordshire bicentenary, British Society for
the History of Mathematics Bulletin, 28 (2013) 75-83.
Angel, O., Holroyd, A. E., Martin, J. B.. Wilson, D. B. and Winkler, P. M.
Avoidance Coupling. Electron. Commun. Probab. 18 (2013) no. 58.
http://dx.doi.org/10.1214/ECP.v18-2275
http://ecp.ejpecp.org/article/view/2275/2304
Anthony, M., Boros, E., Crama, Y. and Gruber, A.
Quadratization of Symmetric Pseudo-Boolean Functions. Preprint.
http://arxiv-web3.library.cornell.edu/pdf/1404.6535.pdf
Apostolico, A., Erdős, P. L., Miklós, I. and Siemons, I. J.
Modulated String Searching. Theor. Comput. Sci. 525 (2014) 23-29.
http://dx.doi.org/10.1016/j.tcs.2013.10.013
Araújo, J., Bentz, W. and Cameron, P. J.
Groups synchronizing a transformation of non-uniform kernel. Theor. Comput. Sci.
498 (2013) 1-9.
Araújo, J. and Cameron, P. J.
Primitive Groups Synchronize Non-uniform Maps of Extreme Ranks. J. Comb.
Theory Ser. B. 106 (2014) 98-114.
Archdeacon, D., Griggs, T.S. and Psomas, C.
Representing graphs in Steiner triple systems. Graphs. Comb. 30 (2014) 255-266.
http://dx.doi.org/10.1007/s003e73-012-1279-3
Ardila, F., Rincón, E. F. and Williams, L. K.
Positroids and non-crossing partitions. Trans. Am. Math. Soc., to appear.
Ardila, F., Rincón, E. F. and Williams, L. K.
Positively oriented matroids are realizable. Preprint.
Arias-Castro, E. and Grimmett, G. R.
Cluster detection in networks using percolation. Bernoulli 19 (2013) 676–719
http://dx.doi.org/10.3150/11-BEJ412
http://www.statslab.cam.ac.uk/~grg/papers/BEJ412.pdf
Aschenbrenner, M., Dolich, A., Haskell, D., Macpherson, H. D. and Starchenko,
S.
Vapnik-Chervonenkis density in some theories without the independence property II.
Notre Dame J. Formal Logic 54 (2013) 277-610.
http://www.math.ucla.edu/~matthias/pdf/VC%20Density,%20II.pdf
Askalidis, G., Immorlica, N., Kwanashie, A., Manlove, D.F. and Pountourakis, E.
Socially Stable matchings in the Hospitals / Residents problem. Proceedings of
WADS 2013. Lect. Notes. Comput. Sci. 8037 (2013) 85-96.
http://dx.doi.org/10.1007/978-3-642-40104-6_8
http://www.gla.ac.uk/media/media_290502_en.pdf
Atkinson, M. D.
[see: Albert, M. H.]
Atminas, A., Brignall, R., Korpelainen, N., Lozin, V. V. and Stacho, J.
A Minimal Class of Bipartite Graphs of Unbounded Clique-width. Submitted.
Atminas, A., Brignall, R., Korpelainen, N., Lozin, V. V. and Vatter, V.
Well-quasi-order for permutation graphs omitting a path and a clique. Preprint.
http://users.mct.open.ac.uk/rb8599/papers/wqo-path-clique.pdf
Atminas, A., Kitaev, S., Lozin V. V. and Valyuzhenich, A.
Universal graphs and universal permutations. Discrete Math. Algorithms Appl. 5
(2013) 15 pages.
http://dx.doi.org/10.1142/S1793830913500389
Aval, J.-C, D’Adderio, M., Dukes, W. M. B., Hicks, A. and Le Borgne, Y.
Statistics on parallelogram polyominoes and a q,t-analogue of the Narayana numbers.
J. Comb. Theory Ser. A 123 (2014) 271-286.
Aval, J.-C, D’Adderio, M., Dukes, W. M. B. and Le Borgne, Y.
Two operators on sandpile configurations, the sandpile model on the complete
bipartite graph, and a Cyclic Lemma. Preprint.
Aval, J.-C, Dukes, W. M. B. and Le Borgne, Y.
A note on a bijection of Aldred, Atkinson, and McCaughan. Preprint.
https://personal.cis.strath.ac.uk/mark.dukes/bijection2.pdf
Avineri, E. and Zverovich, V. E.
Braess' Paradox in a Generalised Traffic Network. Journal of Advanced
Transportation, to appear.
Babai, L and Cameron, P. J..
Most primitive groups are full automorphism groups of edge-transitive hypergraphs.
Preprint.
http://arxiv-web3.library.cornell.edu/pdf/1404.6739v1.pdf
Baber, R. and Talbot, J. M.
A solution to the 2/3 conjecture. SIAM J. Discrete Math., to appear.
Baber, R., Christofides, D., Dung, A. D., Riis, S. and Vaughan, E. R.
Multiple Unicasts, Graph Guessing Games and non-Shannon Information Inequalities.
IEEE conference on Network Coding.
http://dx.doi.org/10.1109/NetCod.2013.6570823 .
Babichenko, Y., Peres, Y., Peretz, R. Sousi, P. and Winkler, P. M.
Hunter, Cauchy Rabbit, and Optimal Kakeya Sets. Trans. Am. Math. Soc., to appear. .
http://www.statslab.cam.ac.uk/~ps422/cop-robber2.pdf
Bacher, A., Bernini, A., Ferrari, L, Gunby, B., Pinzani, R. and West, J.
The Dyck pattern poset. Discrete Math. 321 (2014) 12-23.
http://dx.doi.org/10.1016/j.disc.2013.12.011
Badri, G., Kitson, D. and Power, S. C .
The almost periodic rigidity of crystallographic bar-joint frameworks. Preprint.
Bailey, R. A.
Donald Arthur Preece: A life in statistics, mathematics and music. Preprint.
Bailey, R. A., Buratti, M., Rinaldi, G. and Traetta, T.
On 2-pyramidal Hamiltonian cycle systems. Preprint.
Bailey, R. A. and Druilhet, P.
Optimal cross-over designs for full interaction models. Preprint.
http://www.newton.ac.uk/preprints/NI13018.pdf
Bailey, R. A., Hilgers, R.-D. and Schiffl, K.
A note on robustness of D-optimal block designs for two-colour microarray
experiments. J. Stat. Plann. Inference 143 (2013) 1195-1202.
http://dx.doi.org/10.1016/j.jspi.2013.01.005
http://www.newton.ac.uk/preprints/NI12023.pdf
Bailey, R. A.
[see: Aldred, R. E. L.]
Balachandran, P., Jeub, L. G. S., Mahoney, M. W., Mucha, P. J. and Porter, M.
A.
Think Locally, Act Locally: The Detection of Small, Medium-Sized, and Large
Communities in Large Networks. Preprint.
Balbuena, C., Miller, M., Širáň, J. and Zdimalova, M.
Large vertex-transitive graphs of diameter 2 from incidence graphs of biaffine planes.
Discrete Math. 313 (2013) 2014-2019
Balister, P. N., Bollobás, B., Füredi, Z. and Thompson, J.
Minimal symmetric differences of lines in projective planes. J. Comb. Des., to appear.
Balister, P. N., Bollobás, B., Lee, J. D. and Narayanan, B. P.
Line percolation. Preprint.
Balister, P. N. , Bollobás, B., Przykucki, M. and Smith, P.
Subcritical neighbourhood family percolation models have non-trivial phase
transitions. Preprint.
Balister, P. N., Bollobás, B., Lehel, J. and Morayne, M.
Repeated Degrees in Random Uniform Hypergraphs. SIAM J. Discrete Math. 27
(2013) 145-154.
http://dx.doi.org/10.1137/100785156
Balister, P. N., Bollobás, B., and Riordan, O. M.
Essential enhancements revisited. Preprint.
Balister, P. N., Bollobás, B. and Smith, P.
The time of bootstrap percolation in two dimensions. Preprint.
Balog, A. and Roche-Newton, O.
New sum-product estimates for real and complex numbers. Preprint.
Balogh, J., Hu, P., Lidický, D., Pikhurko, O., Udvari, B. and Volec, J.
Minimum number of monotone subsequences of length 4 in permutations. Combin.
Probab. Comput., to appear.
http://www.math.uiuc.edu/~jobal/cikk/monoSeq-1.pdf
Balogh, J., Lo, A. and Molla, T.
Transitive Triangle Tilings in Oriented Graphs. Preprint.
http://www.math.uiuc.edu/~jobal/cikk/transitive.pdf
Balogh, J., Morris, R. D. and Samotij, W.
Independent sets in hypergraphs. J. Amer. Math. Soc., to appear.
http://www.math.uiuc.edu/~jobal/cikk/indhyp.pdf
Balogh, J., Morris, R. D., Samotij, W. and Warnke, L.
The typical structure of
-free graphs. Preprint.
http://www.math.uiuc.edu/~jobal/cikk/typstructure.pdf
Balogh, J., Mycroft, R. and Treglown, A.
A random version of Sperner's theorem. Preprint.
Balogh, J.
[see: Alon, N.]
Bamberg, J., Gill, N., Hayes, T., Helfgott, H., Seress, A. and Spiga, P.
Bounds on the diameter of Cayley graphs of the symmetric group. J. Algbr. Comb., to
appear.
Banerji, C. R. S., Mansour, T. and Severini, S.
A notion of graph likelihood and an infinite monkey theorem. J. Phys. A. Math.
Theor. 47:3 (2014) Article 035101 http://arxiv.org/pdf/1304.3600.pdf
Bansal, N., Han, X., Iwama, K., Sviridenko, M. and Zhang, G.
A Harmonic algorithm for the 3D Strip Packing Problem. SIAM J. Comput. 42 (2013)
579-592. http://dx.doi.org/10.1137/070691607
http://www2.warwick.ac.uk/fac/sci/dcs/people/maxim_sviridenko/3dstrip-29.pdf
Bárány, I., Ginzburg, B. D. and Grinberg, V. S.
2013 Unit Vectors in the Plane. Discrete Math. 313 (2013) 1600-1601.
Bárány, I. and Grinberg, V. S.
Block Partitions of Sequences. Preprint.
Bárány, I., Marckert, J.-F., and Reitzner, M.
Many empty triangles have a common edge. Discrete Comput. Geom. 50 (2013)
244-252. http://dx.doi.org/10.1007/s00454-013-9506-0
Bárány, I. and Pach, J.
Homogeneous selections from hyperplanes. J. Comb. Theory Ser B. 104 (2014) 81-87.
http://www.math.nyu.edu/~pach/publications/hyperplanes080411.pdf
Bárány, I. , Matoušek, J. and Pór, A.
Curves in
intersecting every hyperplane at most
times. Preprint.
Bárány, I. and Roldán-Pensado, E.
Longest convex lattice chains. Comput. Geom. 47 (2014) 367-376.
http://dx.doi.org/10.1016/j.comgeo.2013.09.002
Bárány, I. and Roldán-Pensado, E.
A Question from a Famous Paper of Erdős. Disc. Comput. Geom 50 (2013) 253-261.
http://dx.doi.org/10.1007/s00454-013-9507-z
Bárány, I. , Roldán-Pensado, E. and Tóth, G.
Erdős - Szekeres Theorem for Lines. Preprint.
Bárány, I. and Yuan, L.
Volumes of convex lattice polytopes and a question of V. I. Arnold. Preprint.
Barber, B.
Maximum hitting for sufficiently large. Graphs Comb. 30 (2014)
267-274.
http://dx.doi.org/10.1007/s00373-012-1281-9
Barber, B.
Partition regularity of a system of De and Hindman. Integers, to appear.
Barber, B., Hindman, N. and Leader, I. B.
Partition regularity in the rationals. J. Comb. Theory Ser. A, 120 (2013) 1590-1599.
Barber, B., Hindman, N., Leader, I. B. and Strauss, D.
Partition regularity without the columns property. Preprint.
Barber, B., Hindman, N., Leader, I. B. and Strauss, D.
Distinguishing subgroups of the rationals by their Ramsey properties. Preprint.
http://web.mat.bham.ac.uk/~barberba/papers/colprop.pdf
Barber, B. and Leader, I. B.
Partition regularity with congruence conditions. J. Comb. 4 (2013) 293-297.
http://dx.doi.org/10.4310/JOC.2013.v4.n3.a1
Barber, B. and Long, E. P.
Random walks on quasirandom graphs. Electron J. Comb. 20 (4) (2013) P25.
https://www.dpmms.cam.ac.uk/~bab34/papers/quasirandom-walks.pdf
Bastkowski, S., Moulton, V. and Spillner, A.
Fishing for minimum evolution trees with Neighbor-Nets. Inf. Process Lett.114
(2014) 13-18.
http://dx.doi.org/10.1016/j.ipl.2013.10.003
Batu, T., Fortnow, L, Rubinfeld, R., Smith, W. D. and White, P.
Testing Closeness of Discrete Distributions. J. ACM. 60 (2013) 4
http://dx.doi.org/10.1145/2432622.2432626
Bauer, D., Kahl, N., Schmeichel, E., Woodall, D. R. and Yatauro, M.
Toughness and binding number. Discrete Appl. Math. 165 (2014) 60–68.
http://dx.doi.org/10.1016/j.dam.2012.08.007
Bauer, D., Kahl, N., Schmeichel, E., Woodall, D. R. and Yatauro, M.
Improving theorems in a best monotone sense. Congr. Numerantium 216 (2013)
87–95.
Bauer, D., Nevo, A., Schmeichel, E., Woodall, D. R. and Yatauro, M.
Best monotone degree conditions for binding number and cycle structure, Discrete
Applied Math., to appear.
Beardon, A. F.
Resolving the hypercube. Discrete Appl. Math. 161 (2013) 1882-1887.
de Beaudrap, N., Giovanetti, G., Severini, S. and Wilson, R.
Interpreting the von Neumann entropy of graph Laplacians, and coentropic graphs.
Preprint.
Bednarska-Bzdega, M., Hefetz D. and Łuczak, T.
Picker-Chooser fixed graph games. Submitted.
http://web.mat.bham.ac.uk/D.Hefetz/MyPapers/FixedGraphGamesWCpaper.pdf
Beguerisse Diaz, M., Harrington, H. A., Keating, L., Porter, M. A.
and Rombach, M. P.
Teach Network Science to Teenagers. Network Science 1 (2013) 226-247.
http://dx.doi.org/10.1017/nws.2013.11
Beineke L. and Wilson R. J.
Modern graph theory, Chapter 14 of Combinatorics: Ancient & Modern (R. J. Wilson
and J. J. Watkins, Eds.). Oxford University Press. ISBN 978-0-19-965659-2.
http://ukcatalogue.oup.com/product/9780199656592.do
Belmonte, R., Giannopoulou, A. C., Lokshtanov, D. and Thilikos, D. M.
Structure of W4-immersion free graphs. Preprint.
Belmonte, R. Golovach, P. A., Heggernes, P., van’t Hof, P., Kaminski, M. and
Paulusma, D.
Detecting fixed patterns in chordal graphs in polynomial time. Algorithmica, to
appear.
http://dx.doi.org/10.1007/s00453-013-9748-5
http://www.durham.ac.uk/daniel.paulusma/Papers/Submitted/chordalcon.pdf
Belmonte, R. Golovach, P. A., van’t Hof, P., and Paulusma, D.
Parameterized complexity of two edge contraction problems with degree constraints .
IPEC 2013. Lect. Notes Comput. Sci. 8246 (2013) 16-27.
http://dx.doi.org/10.1007/978-3-319-03898-8_3
Belmonte, R., van’t Hof, P., Kamiński, M. and Paulusma, D.
The price of connectivity for feedback vertex set. EuroComb 2013. CRM Series 16
(2013) 123-128.
http://dx.doi.org/10.1007/978-88-7642-475-5_20
Belmonte, R., van’t Hof, P., Kamiński, M., Paulusma, D. and Thilikos, D. M.
Characterizing graphs of small carving-width. Discrete Appl. Math. 161 (2013)
1888-1893.
Benevides, F. and Przykucki, M. J.
On Slowly Percolating Sets of Minimal Size in Bootstrap Percolation. Electron J.
Comb. 20 (2) (2013) p46.
Benevides, F. and Przykucki, M. J.
Maximum percolation time in two-dimensional bootstrap percolation. Preprint.
Benjamini, I., Ellis, D. and Friedgut, E.
Juntas in the -grid and Lipschitz maps between discrete tori. Preprint.
Benjamini, I. and Stauffer, A.
Perturbing the hexagonal circle packing: a percolation perspective
Annales de l' Institut Henri Poincare 49 (2013) 1141-1157
Bennett, M., Hart, D., Iosevich, A., Pakianthan, J. and Rudnev, M.
Group actions and geometric combinatorics in
Preprint.
Ben-Sasson, E., Ron-Zewi, N., Tulsiani, M. and Wolf, J.
Sampling-based proofs of almost-periodicity results and algorithmic applications.
Preprint.
Bentz, W.
[see: Araújo, J.]
Berenbrink, P., Brinkmann, A., Friedetzky, T. and Nagel, L.
Balls into non-uniform bins. Journal of Parallel and Distributed Computing, to
appear.
Berenbrink, P., Cooper, C. and Friedetzky, T.
Random walks which prefer unexplored edges can cover random regular graphs in
linear time. Random Struct. Algorithms, to appear.
Berestycki, N. and Kozma, G.
Cycle structure of the interchange process and representation theory. Bull. Soc. Math.
France., to appear.
http://www.statslab.cam.ac.uk/~beresty/Articles/schramm_rt9.pdf
Berget, A. and Fink, A.
Equivariant K-classes of matrix orbit closures. Preprint.
Bernini, A.
[see: Bacher, A.]
Bevan, D.
Growth rates of permutation grid classes, tours in graphs, and the spectral radius.
Trans Am. Math. Soc., to appear.
Bevan, D.
Growth rates of geometric grid classes of permutations. Preprint.
Bezakova, I. and Mertzios, G. B.
Computing and counting the longest paths on circular-arc graphs in polynomial time.
Discrete Appl. Math. 164 (2014.) 383–399.
http://www.dur.ac.uk/george.mertzios/papers/Jour/Jour_Longest-Path-CircularArc.pdf
Bezzateev, S., Gadouleau, M. R., Wachter-Zeh, A. and Zeh, A.
Generalizing Bounds on the Minimum Distance of Cyclic Codes Using Cyclic
Product Codes. ISIT 2013
http://dx.doi.org/10.1109/ISIT.2013.6620201
http://arxiv.org/pdf/1301.6231.pdf .
Biggs N. L. and Wilson R.J.
Block designs, Chapter 10 of Combinatorics: Ancient & Modern, Oxford University
Press, CUP.
Bille, P, Gørtz, I. L., Sach, B. and Vildhøj. H. W.
Time-space trade-offs for longest common extensions. J. Discrete Algorithms 25
(2014) 42-50
http://dx.doi.org/10.1016/j.jda.2013.06.003
Bille, P, Fischer, J., Gørtz, I. L., Kopelowitz, T., Sach, B. and Vildhøj. H. W.
Sparse Suffix Tree Construction in Small Space. ICALP13. Lect. Notes Comput. Sci.
7965 (2013) 148-159
http://dx.doi.org/10.1007/978-3-642-39206-1_13
Biró, P., Bomhoff, M., Golovach, P. A., Kern, W. and Paulusma, D.
Solutions for the stable roommates problem with payments. Theor. Comput. Sic., to
appear.
http://www.durham.ac.uk/daniel.paulusma/Papers/Submitted/stable.pdf
Biró, P., Manlove, D. F. and McBride, I.
The Hospitals / Residents problem with Couples: Complexity and Integer
Programming models, to appear in Proceedings of SEA 2014: the 13th International
Symposium on Experimental Algorithms.
Blackburn, S. R.
Enumerating finite racks, quandles and kei. Electron. J. Comb. 20 (3) (2013), P43.
http://www.combinatorics.org/ojs/index.php/eljc/article/view/v20i3p43.
Blackburn, S. R., Gerke, S. and Wildon, M. R. (eds.)
Surveys in Combinatorics 2013. Lond. Math. Soc. Lect. Note Series 408 (2013).
http://www.cambridge.org/us/academic/subjects/mathematics/discrete-mathematicsinformation-theory-and-coding/surveys-combinatorics-2013
Blackburn, S.R., Konyagin, S. V. and. Shparlinski, I. E.
Counting additive decompositions of quadratic residues in finite fields. Preprint.
http://arxiv.org/abs/1403.2589.
Blackburn, S. R. and McCourt, T. A.
Triangulations of the sphere, bitrades and abelian groups. Combinatorica, to appear.
Blagojević, P., Bukh, B. and Karasev, R.
Turán numbers for
free graphs: topological obstructions and algebraic
constructions. Isr J. Math 197 (2013) 199-214.
http://dx.doi.org/10.1007/s11856-012-0184-z
Blanchet, J. and Stauffer, A.
Characterizing optimal sampling of binary contingency tables via the configuration
model. Random Struct. Algorithms 42 (2013) 159-184
http://dx.doi.org/10.1002/rsa.20403
Bloom, T. and Jones, T. G. F.
A sum-product theorem in function fields. Int. Math. Res. Not. (2013)
http://dx.doi:.org/10.1093/imrn/rnt125
Bode, M., Fountoulakis, N. and Müller, T.
The probability that the hyperbolic random graph is connected. Preprint.
http://www.math.uu.nl/~Muell001/Papers/BFM.pdf
Bodirsky, M. and Macpherson, H. D.
Reducts of structures and maximal-closed permutation groups.
http://www1.maths.leeds.ac.uk/Pure/staff/macpherson/bodirsky-macphersonsubmitted.pdf
Bodirsky, M., Macpherson, H. D. and Thapper, J.
Constraint Satisfaction Tractability from Semi-lattice Operations on
Infinite Sets. ACM-TOCL 14 (2013) article 30.
http://dx.doi.org/10.1145/2528933
http://de.arxiv.org/pdf/1111.6616.pdf
Bohn, A.
Chromatic Polynomials of Complements of Bipartite Graphs. Graphs Comb. 30
(2014) 287-301.
http://dx.doi.org/10.1007/s00373-012-1268-6
Bohn, A.
A dense set of chromatic roots which is closed under multiplication by positive
integers. Discrete Math. 321 (2014) 46-62.
Boixo, S., Markström, K., Roy, A., Severini, S., Spedalieri, F. M., Vinci, W. and
Warburton, P. A.
Hearing the shape of Ising models: on the distinguishability power of Physics.
Preprint.
Bollobás, B., Füredi, Z., Kantor, I, Katona, G. O. H. and Leader, I. B.
A coding problem for pairs of subsets. Preprint.
Bollobás, B., Gunderson, K., Holmgren, C., Janson, S. and Przykucki, M.
Bootstrap percolation on Galton-Watson trees. Electron. J. Probab. 19 (2014) no 13
http://ejp.ejpecp.org/article/download/2758/2401
Bollobás, B., Kittipassorn, T., Narayanan, B. and Scott, A. D.
Disjoint induced subgraphs of the same order and size. Preprint.
http://people.maths.ox.ac.uk/scott/Papers/disjoint.pdf
Bollobás, B., Mitsche, D. and Prałat, P.
Metric dimension for random graphs. Electron. J. Comb. 20 (4) (2013)
http://www.combinatorics.org/ojs/index.php/eljc/article/viewFile/v20i4p1/pdf
Bollobás, B., Narayanan, B. and Raigordskii, A. M.
On the stability of the Erdős-Ko-Rado theorem. Preprint.
https://www.dpmms.cam.ac.uk/~bp338/pdf/ekr_stability.pdf
Bollobás, B. and Riordan, O. M.
Counting connected hypergraphs via the probabilistic method. Preprint.
Bollobás, B. and Riordan, O. M.
Exploring hypergraphs with martingales. Preprint.
Bollobás, B. and Scott, A. D.
Intersections of random hypergraphs and tournaments. Preprint.
http://people.maths.ox.ac.uk/scott/Papers/intrand.pdf
Bollobás, B. and Scott, A. D.
Intersections of hypergraphs. J. Comb. Theory Ser B., to appear.
http://people.maths.ox.ac.uk/scott/Papers/hyperint.pdf
Bollobás, B., Smith, P. and Uzzell, A. J.
The time of bootstrap percolation with dense initial sets for all thresholds. Random
Struct. Algorithms, to appear.
Bollobás, B.
[see: Balister, P. N.]
Bomhoff, M.
[see: Biró, P.]
Bonamy, M., Johnson, M., Lignos, I, Patel, V and Paulsma, D.
Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs.
J. Comb. Optim. 27 (2014) 132-143.
http://dx.doi.org/10.1007/s10878-012-9490-y
http://www.durham.ac.uk/daniel.paulusma/Papers/Submitted/pinching.pdf
Bordewich, M., Greenhil, C. S. and Patel, V.
Mixing of the Glauber dynamics for the ferromagnetic Potts model. Preprint.
Bordewich, M. J. and Kang, R. J.
Subset Glauber dynamics on graphs, hypergraphs and matroids of bounded treewidth. Preprint.
Borodin, O. V., Ivanova, A. O. and Woodall, D. R.
Light C4 and C5 in 3-polytopes with minimum degree 5. Preprint.
Boros, E.
[see: Anthony, M.]
Böttcher, J., Hladký, J., Piguet, D. and Taraz, A.
An approximate version of the Tree Packing Conjecture. Preprint.
http://homepages.warwick.ac.uk/~maskai/tree-packing.pdf
Böttcher, J., Kohayakawa, Y., Taraz, A. and Würfl, A.
An Extension of the Blow-up Lemma to arrangeable graphs. Preprint.
Böttcher, J., Kohayakawa, Y. and Taraz, A.
Almost spanning subgraphs of random graphs after adversarial edge removal.
Combin. Probab. Comput. 22 (2013) 639-683.
http://dx.doi.org/10.1017/S0963548313000199
Böttcher, J., Taraz, A. and Würfl, A.
Spanning embeddings of arrangeable graphs with sublinear bandwidth. Preprint.
Böttcher, J.
[see: Allen, P.]
Bourgeois, N. Dąbrowski, K. K., Demange, M. and Paschos, V.
Playing with parameters: structural parameterization in graphs. Preprint.
Bousquet, N., Goncalves, D., Mertzios, G. B., Paul, C., Sau, I. and Thomasse, S.
Parameterized domination in circle graphs. Theory Comput. Syst. 54 (2014) 45-72.
http://www.dur.ac.uk/george.mertzios/papers/Conf/Conf_Parameterized-DominationCircle.pdf
Bousquet-Mélou, M. and Weller, K.
Asymptotic properties of some minor-closed classes of graphs. Combin.
Probab. Comput., to appear.
Bouvel, M.
Bray, J. N., Holt, D. F. and Roney-Dougal, C. M.
The maximal subgroups of the low-dimensional finite classical groups, Lond Math
Soc Lect Note Series 407, Cambridge University Press. ISBN 9780521138604.
http://www.cambridge.org/gb/academic/subjects/mathematics/algebra/maximalsubgroups-low-dimensional-finite-classical-groups?format=PB
Brazil, M. N., Ras, C. J., Swanepoel, K. J. and Thomas, D. A.
Generalised k-Steiner Tree Problems in Normed Planes. Algrithmica, to appear.
http://dx.doi.org/10.1007/s00453-013-9780-5
Breuillard, E. and Green, B. J.
Contractions and expansion. Eur. J. Comb. 34 (2013) 1293-1296.
Breuillard, E., Green, B. J., Guralnick, R. M. and Tao, T. C.
Expansion in finite simple groups of Lie type. Preprint.
Breuillard, E., Green, B. J. and Tao, T. C.
A nilpotent Freiman dimension lemma. Eur. J. Comb. 34 (2013) 1287-1292.
Breuillard, E., Green, B. J. and Tao, T. C.
Small doubling in groups. Bolyai Math. Soc. Studies 25 (2013) 129-151.
http://dx.doi.org/10.1007/978-3-642-39286-3_5
Brien, C. J.
[see: Bailey, R. A.]
Brightwell, G. R. and Keller, M. T.
The reversal ratio of a poset. Order, to appear.
Brightwell, G. R. and Luczak, M. J.
Extinction Times in the Subcritical Stochastic SIS Logistic Epidemic. Preprint.
A fixed-point approximation for a routing model in equilibrium. Preprint.
Vertices of high degree in the preferential attachment tree. Electron J. Probab. 17
(2012)
http://dx.doi.org/10.1214/EJP.v17-1803
http://ejp.ejpecp.org/article/view/1803/2024
Brightwell, G. R. and Massow, M.
Diametral Pairs of Linear Extensions. SIAM J. Discrete Math. 27 (2013) 634–649
http://dx.doi.org/10.1137/080733140
Brightwell, G. R.
[see: Allen, P.]
Brignall, R., Korpelainen, N. and Vatter, V.
Linear clique-width for subclasses of cographs, With connections to permutations.
Preprint.
http://users.mct.open.ac.uk/rb8599/papers/lcw-cographs.pdf
Brignall, R., Lozin , V. V. and Stacho, J.
Bichain graphs: geometric model and universal graphs. Preprint.
http://users.mct.open.ac.uk/rb8599/papers/bichain.pdf
Brignall, R.
[see: Albert, M. H., Atminas, A.]
Brimberg J., Janicijevic S., Mladenovic N. and Urosevic D.
Solving the Clique Partitioning Problem as a Maximally Diverse Grouping Problem.
Preprint.
Bringmann, K., Sauerwald, T., Stauffer, A. and Sun, H.
Balls into bins via local search: cover time and maximum load. Preprint.
http://arxiv.org/abs/1310.0801
Brinkmann, A.
[see; Berenbrink, P.]
Britnell, J. R. and Gill, N.
Perfect commuting graphs. Preprint.
Britnell, J. R. and Wildon, M. R.
Orbit coherence in permutation groups. J. Group Theory 17 (2013) 73-109.
http://dx.doi.org/10.1515/jgt-2013-0029
http://www2.imperial.ac.uk/~jbritnel/OrbitCoherence.pdf
Britnell, J. R. and Wildon, M. R.
The majority game with an arbitrary majority. Preprint.
http://www.ma.rhul.ac.uk/~uvah099/Maths/MajorityGame6b.pdf
Broersma, H. J., Fiala, J., Golovach, P. A., Kaiser, T., Paulusma, D. and
Proskurowski, A.
Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of
Interval Graphs. Lect. Notes Comput. Sci. 8165 (2013) 127-138.
http://dx.doi.org/10.1007/978-3-642-45043-3_12
Broersma, H. J., Golovach, P. and Patel, V.
Tight complexity bounds for FPT subgraph problems parameterized by the
clique-width. Theor. Comput. Sci. 485 (2013) 69-84
Broersma, H. J., Patel, V. and Pyatkin, A.
On Toughness and Hamiltonicity of 2K2-free Graphs. J. Graph Theory 75 (2014)
244-255.
http://dx.doi.org/10.1002/jgt.21734
http://web.mat.bham.ac.uk/~patelvw/2K2free-finalversion.pdf
Broman, E.
[see: Ahlberg, D.]
Brough, T. and Holt, D. F.
Finitely generated soluble groups and their subgroups. Commun. Algebra 41 (2013)
1790-1799.
http://dx.doi.org/10.1080/00927872.2011.651758
Brown, G. and Kasprzyk, A.
Seven new champion linear codes. .LMS J. Comput. Math. 16 (2013) 109-117.
http://dx.doi.org/10.1112/S1461157013000041
Browning, J. M, Cameron, P. J. and Wanless, I. M.
Bounds on the number of small Latin subsquares. J. Comb. Theory Ser. A. 124 (2014)
40-56.
Bruss, D., Kampermann, H,, Kwek, L. C., Macchiavello, C., Rossi, M., Severini,
S. and Wu, J-Y.
Randomized Graph States and their Entanglement Properties. Preprint.
http://arxiv-web3.library.cornell.edu/pdf/1403.3828.pdf
Bukh, B.
[see: Blagojević, P.]
Bulatov, A.. Dyer, M. E., Goldberg, L. A., Jerrum, M. R. and McQuillan, C.
The expressibility of functions on the Boolean domain, with applications to Counting
CSPs. J. ACM. 60 (2013) no 32.
http://dx.doi.org/10.1145/2528401
Buratti, M.
Burgarth, D., D’Alessandro, D., Hogben, L., Severini, S. and Young, M.
Zero forcing, linear and quantum controllability for systems evolving on networks.
IEEE Transactions on automatic control 58 (2013) 2349-2354.
http://dx.doi.org/10.1109/TAC.2013.2250075
Burness, T. C. and Crestani, E.
On the generating graph of direct powers of a simple group. J. Algebr. Comb. 38
(2013) 329-350.
http://dx.doi.org/10.1007/s10801-012-0405-x
http://seis.bristol.ac.uk/~tb13602/docs/BC_1.pdf
Bushaw, N. and Kettle, N.
Turán Numbers for Forests of Paths in Hypergraphs. SIAM J. Discrete Math., to
appear. .
Butkovi , P. and MacCaig, M.
On integer eigenvectors and subeigenvectors in the max-plus algebra. Linear Algebra
Appl. 438 (2013) 3408-3424.
http://dx.doi.org/10.1016/j.laa.2012.12.017
http://web.mat.bham.ac.uk/P.Butkovic/My%20papers/ISEVpaper.revised.pdf
Butkovi , P. and MacCaig, M.
On the integer max-linear programming problem. Discrete Appl. Math. 162 (2014)
128–141
http://web.mat.bham.ac.uk/P.Butkovic/My%20papers/IMLP2.pdf
Butkovi , P. Schneider, H., Sergeev S. nd Tam, B-S.
Two cores of a nonnegative matrix. Linear Algebra Appl. 439 (2013) 1929–1954.
http://dx.doi.org/10.1016/j.laa.2013.05.029
http://web.mat.bham.ac.uk/P.Butkovic/My%20papers/Core%20in%20press.pdf
Butman, A., Clifford, P., Clifford, R., Jalsenius, M., Lewenstein, N., Porat, B.,
Porat, E. and Sach, B.
Pattern Matching under Polynomial Transformation. SIAM J. Comput. 42 (2013) 611-
633.
http://dx.doi.org/10.1137/110853327
Button, J. N. and Roney-Dougal, C. M.
An explicit upper bound for the Helfgott delta in SL(2,p). Submitted.
Buzzard, K. M. and Ciere, M.
Playing simple loony dots and boxes endgames optimally. Preprint.
Cabello, A., Parker, M. G., Scarpa G. and Severini, S.
Exclusivity structures and graph representatives of local complementation orbits.
J. Math. Phys. 54 (2013) 072202
Cabello, A., Severini, S. and Winter, A.
Graph-Theoretic Approach to Quantum Correlations. Phys Rev. Lett. 112 (2014)
040401.
http://dx.doi.org/10.1103/PhysRevLett.112.040401
http://arxiv-web3.library.cornell.edu/pdf/1401.7081v1
Cafieri, S. Hansen, P. and Mladenovic, N.
Edge-Ratio Network Clustering by Variable Neighborhood Search. Preprint.
http://hal-enac.archives-ouvertes.fr/docs/00/97/92/95/PDF/Cafieri_EPJB2014.pdf
Cai, J.-Y,, Galanis, A., Goldberg, L. A., Guo, H., Jerrum, M. R., Stefankovic, D.
and Vigoda, E.
#BIS-Hardness for 2-Spin Systems on Bipartite Bounded Degree Graphs in the Tree
Nonuniqueness Region. Preprint.
Cain, A. J. and Ruškuc, N.
Subalgebras of FA-presentable algebras. Algebra Univers., to appear.
Cameron, P. J.
The random graph. Revised chapter for re-issue of book “The Mathematics of Paul
Erdős. ed. Ronald L. Graham, Jaroslav Nešet&rcaron;il and Steve Butler, Springer,
2013, ISBN 978-1-4614-7253-7.
http://dx.doi.org/10.1007/978-1-4614-7254-4_22
Cameron, P. J.
Groups with right-invariant multiorders. Australas. J. Comb. 56 (2013) 187-193
Cameron, P. J., Fairbairn, B. and Gadouleau, M.
Computing in permutation groups without memory. Preprint.
Cameron, P. J., Fairbairn, B. and Gadouleau, M.
Computing in matrix groups without memory. Preprint.
Cameron, P. J., Glass, C. A. and Schumacher, R. U.
Moving to extremal graph parameters. Preprint.
Cameron, P. J.
[see: Araújo, J., Babai, L., Browning, J. M.]
Campbell, C. M. and Deveci, O.
k-nacci sequences in some special modular groups. Algebra Colloq. 21 (2014) 59-66
Campbell, C. M., Havas, G., Ramsay, C. and Robertson, E. F.
All simple groups with order from 1 million to 5 million are efficient. Int. J. Group
Theory 3 (2014) 17-30.
Candellero, E. and Fountoulakis, N.
Clustering in random geometric graphs on the plane. Preprint.
Candellero, E. and Roberts, M. I.
The number of ends of critical branching random walks. Preprint.
Cannings, C., Huang, J. and Southwell, R.
Complex Networks from Simple Rules. Complex Systems 22 (2013)
Cannings, C. and Jordan, J.
Random walk attachment graphs. Electron. Commun. Probab.18 (2013) article 77.
http://dx.doi.org/10.1214/ECP.v18-2518
http://ecp.ejpecp.org/article/download/2518/2341
Cannings, C. and Southwell, R.
Best Response Games on Regular Graphs. Applied Mathematics 4 (2013) 950-962.
http://dx.doi.org/10.4236/am.2013.46131
Caporossi, G., Cvetković, D. M. and Rowlinson, P.
Spectral reconstruction and isomorphism of graphs using variable neighourhood
search. Bull. Acad. Serbe Sci. Arts, Cl. Sci.Math. Natur., Sci. Math., to appear
Caputo, P., Martinelli, F., Sinclair, A. and Stauffer, A.
Random lattice triangulations: structure and algorithms. Preprint.
Carbery, A. and Iliopoulou, M.
Counting joints in vector spaces over arbitrary fields. Preprint.
Carbery, A. and Valdimarsson, I. S.
Colouring multijoints. Preprint.
Casals-Ruiz, M., Duncan, A. J. and Kazachkov, I.
Conjugacy in Artin groups of extra-large type. J. Algebra, to appear. .
Chalopin, J. and Paulusma, D.
Packing bipartite graphs with covers of complete bipartite graphs. Discrete Appl.
Math. 168 (2014) 40-50.
http://www.durham.ac.uk/daniel.paulusma/Papers/Submitted/pseudobip.pdf
Chaplick, S., Fiala, J., van’t Hof, P., Paulusma, T. and Tesar, M .
Locally constrained homomorphisms on graphs of bounded treewidth and bounded
degree. FCT 2013. Lect. Notes Comput. Sci. 8070 (2013) 121-132
http://dx.doi.org/10.1007/978-3-642-40164-0_14
Chaplick, S. and Stacho, J.
The vertex leafage of chordal graphs. Discrete Appl. Math. 168 (2014) 14-25.
http://www.cs.toronto.edu/~stacho/public/vertex-leafage.pdf
Chapman, R. J.
A Determinant of Derivatives and Powers. Am.. Math. Mon. 120 (2013) 573-574.
Chapman, R. J.
[see: Alzer, H.]
Chatzigiannakis, I. Mertzios, G. B., Michail, O., and Spirakis, P. G.
Temporal network optimization subject to connectivity constraints. ICALP 40. Lect.
Notes. Comput. Sci.
http://dx.doi.org/10.1007/978-3-642-39212-2_57
Chatzigiannakis, I. Michail, O., Nikolaou, S. and Spirakis, P. G.
The computational power of simple protocols for self-awareness on graphs.
Theor. Comput. Sci. 512 (2013) 98-118.
Chebolu, P., Cryan, M. E. and Martin, R.
Exact counting of Euler Tours for Graphs of Bounded Treewidth. Preprint.
Chikalov, I., Lozin, V. V., Lozina, I, Moshkov, M., Nguyen, H. S., Skowron, A.,
Zielosko, B.
Three approaches to data analysis. Springer, 202 p. 2013. ISBN 978-3-642-28666-7.
http://www.springer.com/engineering/computational+intelligence+and+complexity/b
ook/978-3-642-28666-7
Christofides, D., Edwards K. and King, A. D.
A note on hitting maximum and maximal cliques with a stable set. J. Graph Theory
73 (2013) 354-360.
http://christofides.org/Papers/MaxCliques.pdf
Christofides, D., Elllis, D. and Keevash, P.
An approximate isoperimetric inequality for -sets. Electron J. Comb. 20 (4) (2013)
P13.
http://www.maths.qmul.ac.uk/~dellis/approx_iso_for_r_sets_final.pdf
Christofides, D., Hladký, J. and Mathe, A.
Hamilton cycles in dense vertex-transitive graphs. J. Comb. Theory Ser B., to appear.
Christofides, D. and Král’, D.
First order convergence and roots. Preprint.
Christofides, D. and Markström, K.
The range of thresholds for diameter 2 in random Cayley graphs. Eur. J. Comb. 35
(2014) 141-154.
http://dx.doi.org/10.1016/j.ejc.2013.06.030 .
http://christofides.org/Papers/CayleyDiameterRange.pdf
Christofides, D.
[see: Baber, R.]
Christou, M., Crochemore, M., Iliopoulos, C. S., Kubica, M., Pissis, S. P.,
Radoszewski, J., Rytter, W., Szreder, B.and Waleń, T.
Efficient seed computation revisited. Theor. Comput. Sci. 483 (2013) 171-181.
Chudnovsky, M., Dvořák, Z., Klimošová, T. and Seymour, P. D.
Immersion in four-edge-connected graphs. Preprint.
Chudnovsky, M., Edwards, K., Kim R. , Seymour, P. D. and Scott, A. D.
Disjoint disjoins. Preprint.
http://people.maths.ox.ac.uk/scott/Papers/dijoins.pdf
Chudnovsky, M., Penev, I., Scott, A. D. and Trotignon, N.
Substitution and χ-boundedness. J. Comb. Theory Ser. B 103 (2013) 567-586
http://people.maths.ox.ac.uk/scott/Papers/substitution.pdf
Chudnovsky, M., Scott, A. D. and Seymour, P. D.
Excluding pairs of graphs. J. Comb. Theory Ser. B , to appear.
http://people.maths.ox.ac.uk/scott/Papers/cographs.pdf
Chun, C., Chun, D., Clark, B., Mayhew, D. , Whittle G. and van Zwam, S. H. M.
Computer-verification of the structure of some classes of fragile matroids. Preprint.
Chun, C., Chun, D., Mayhew, D. and van Zwam, S. H. M.
Fan-extensions in fragile matroids. Preprint.
Chun, C., Ding, G., Mayhew, D. and Oxley, J. G.
Unavoidable connected matroids retaining a specified minor. Preprint.
http://homepages.ecs.vuw.ac.nz/~mayhew/Publications/CDMO.pdf
Chun, C., Mayhew, D. and Newman, M.
Obstacles to decomposition theorems for sixth-root-of-unity matroids. Ann Comb., to
appear.
Chun, C., Mayhew, D. and Oxley, J. G.
Towards a splitter theorem for internally 4-connected binary matroids II. Eur. J.
Comb. 36 (2014) 550-563.
Towards a splitter theorem for internally 4-connected binary matroids III. Adv. Appl.
Math. 51 (2013) 309-344.
http://dx.doi.org/10.1016/j.aam.2013.04.004
https://www.math.lsu.edu/~oxley/chapter3_19.pdf
Towards a splitter theorem for internally 4-connected binary matroids IV Adv. Appl.
Math. 52 (2014), no. 1, 1-59..
http://homepages.ecs.vuw.ac.nz/~mayhew/Publications/CMOa.pdf
Chun, C., Mayhew, D. and Oxley, J.
Towards a splitter theorem for internally 4-connected binary matroids V. Adv. Appl.
Math. 52 (2014), 60-81.
http://homepages.ecs.vuw.ac.nz/~mayhew/Publications/CMOa.pdf
Chun, C., Moffatt, I., Noble, S. D. and Rueckriemen, R.
Matroids, Delta-matroids and Embedded Graphs. Preprint.
http://www.personal.rhul.ac.uk/uxah/001/papers/dmpd.pdf
Chun, D.
[see: Chun, C.]
Cibulka, J. Hladký, J., LaCrois, M. A and Wagner, D. G.
A combinatorial proof of Rayleigh monotonicity for graphs. Ars. Comb., to appear
Ciere, M.
[see: Buzzard, K. M.]
Ciobanu, L., Hermüller, S., Holt, D. F., and Rees, S. E.
Conjugacy languages in groups. Preprint.
http://www.mas.ncl.ac.uk/~nser/abstracts/cgarxiv.html
Ciobanu, L., Holt, D. F., and Rees, S. E.
Rapid Decay is Preserved by Graph Products. Journal of Topology and Analysis 5
(2013) article 225.
http://dx.doi.org/10.1142/S1793525313500052
Ciobanu, L., Holt, D. F., and Rees, S. E.
Sofic groups: graph products and graphs of groups. Pacific. J. Math., to appear.
Claesson, A., Kitaev, S. and de Mier, A.
An involution on bicubic maps and
trees. Preprint.
Claesson, A., Kitaev, S. and Steingrímsson, E.
An involution on
trees. Adv. Appl. Math. 51 (2013) 276-284.
Claesson, A.
Clark, B.
[see: Chun, C.]
Clemens, D., Ferber, A., Glebov, R., Hefetz, D. and Liebenau, A.
Building spanning trees quickly in Maker-Breaker games. 7th European Conference
on Combinatorics, Graph Theory and Applications.
http://dx.doi.org/10.1007/978-88-7642-475-5_58
Clemens, D., Ferber, A., Krivelevich, M. and Liebenau, A.
Fast strategies in maker-breaker games played on random boards. Combin.
Probab. Comput. 21 (2013) 897-915.
http://dx.doi.org/10.1017/S0963548312000375
Clemens, D., Gebauer, H. and Liebenau, A.
The random graph intuition for the tournament game. Preprint.
http://www.dcs.warwick.ac.uk/~liebenau/tournamentGame.pdf
Clemens, D. and Liebenau, A.
A non-trivial upper bound on the threshold bias of the Oriented-cycle game. Preprint.
http://www.dcs.warwick.ac.uk/~liebenau/OCycle.pdf
Clifford, P.
[see: Butman, A.]
Clifford, R., Jalsensius, M., Porat, E. and Sach, B.
Space Lower Bounds for Online Pattern Matching. Theor. Comput. Sci. 483 (2013)
68-74.
http://www.dcs.warwick.ac.uk/~sach/SLB-preprint.pdf
Clifford, R.
[see: Butman, A.]
Coates, T., Gonshaw, S., Kasprzyk, A. and Nabijou, N.
Mutations of Fake Weighted Projective Spaces. Preprint.
Coates, T.
[see: Akhtar, M.]
Cochefort, M., Couturier, J.-F., Golovach, P. A., Kratsch, D. and Paulusma, D.
Sparse square roots. WG 2013. Lect. Notes. Comput. Sci. 8165 (2013) 177-188.
http://dx.doi.org/10.1007/978-3-642-45043-3_16
Codish, M., Miller, A,, Prosser, P. and Stuckey, P.J.
Breaking Symmetries in Graph Representation, in Proceedings of IJCAI 2013
510-516.
http://www.dcs.gla.ac.uk/people/personal/alice/papers/ijcai13.pdf
Coenen, F., Jiang, C., Sanderson, R. and Zito, M.
A Survey of Frequent Subgraph Mining Algorithms. The Knowledge Engineering
Review 28 (2013) 75--105
http://cgi.csc.liv.ac.uk/~frans/PostScriptFiles/ker-jct-6-May-11.pdf
Cohen, D. E., Cooper, M. C., Creed, P., Jeavons, P. and Zivny, S.
An Algebraic Theory of Complexity for Discrete Optimisation. SIAM J. Comput. 42
(2013) 1915-1939.
http://dx.doi.org/10.1137/130906398
Cohen, D. E., Crampton, J., Gagarin, A., Gutin, G. and Jones, M.
Iterative Plan Construction for the Workflow Satisfiability Problem. Preprint.
Collins, A., Kitaev, S. and Lozin, V. V.
New results on word-representable graphs. Submitted.
Condon, A., Immorlica, I, Leyton-Brown, K. and Rastagari, B.
Two-sided matching with partial information, in Proceedings of EC 2013 733-750,
ACM, 2013.
http://www.cs.ubc.ca/~baharak/papers/2013-MatchingPartialInfo.pdf
Condon, A., Immorlica, I, Irving, R. W., Leyton-Brown, K. and Rastagari, B.
Reasoning about Optimal Stable Matchings under Partial Information, to appear in
Proceedings of EC 2014:
Conlon, D.
The Ramsey number of dense graphs. Bull. Lond. Math. Soc. 45 (2013) 483-496.
http://dx.doi.org/10.1112/blms/bds097
Conlon, D.
On the Ramsey multiplicity of complete graphs. Combinatorica 32 (2012) 171-186.
https://www.dpmms.cam.ac.uk/~dc340/Multiplicity.pdf
Conlon, D.
Combinatorial theorems relative to a random set. Preprint.
http://xxx.tau.ac.il/pdf/1404.3324v1
Conlon, D. and Fox, J.
Graph Removal Lemmas. In: Surveys in Combinatorics 2013 (S. R. Blackburn, S.
Gerke and M. R Wildon, Eds.). pp 1-49.
http://people.maths.ox.ac.uk/~conlond/RemSurvey.pdf
Conlon, D., Fox, J., Gasarch, W., Harris, D., Ulrich, D. and Zbarsky, S.
Distinct volume subsets. Preprint.
http://people.maths.ox.ac.uk/~conlond/distinctvol.pdf
Conlon, D., Fox, J., Lee, C. and Sudakov, B.
Ramsey numbers of cubes versus cliques. Combinatorica, to appear.
http://people.maths.ox.ac.uk/~conlond/cubes-vs-cliques.pdf .
Conlon, D., Fox, J., Lee, C. and Sudakov, B.
The Erdos-Gyarfas problem on generalized Ramsey numbers. Preprint.
http://www.math.ethz.ch/~sudakovb/erdos-gyarfas-problem.pdf
Conlon, D., Fox, J., Pach, J., Sudakov, B. and Suk, A.
Ramsey-type results for semi-algebraic relations. Trans. Am. Math. Soc., to appear. .
Conlon, D., Fox, J. and Sudakov, B.
Essays in extremal combinatorics. Preprint.
Sidorenko's conjecture for a class of graphs: an exposition. Preprint.
On two problems in graph Ramsey theory. Combinatorica 32 (2012) 513-535.
http://dx.doi.org/10.1007/s00493-012-2710-3
http://math.mit.edu/~fox/paper-sparse-ramsey.pdf
Two extensions of Ramsey’s theorem. Duke Math. J. 162 (2013) 2903-2927.
http://dx.doi.org/10.1215/00127094-2382566
http://people.maths.ox.ac.uk/~conlond/ramsey-two-extensions.pdf
Short proofs of some extremal results. Combin. Probab. Comput. 23 (2014)
8-28.
http://dx.doi.org/10.1017/S0963548313000448
http://people.maths.ox.ac.uk/~conlond/essays.pdf
Cycle packing. Preprint.
http://math.mit.edu/~fox/paper-cyclepacking.pdf
Conlon, D., Fox, J. and Zhao, Y.
Extremal results in sparse pseudorandom graphs. Adv. M ath. 256 (2014) 206-290.
http://dx.doi.org/10.1016/j.aim.2013.12.004
A relative Szemerédi theorem. Preprint.
http://people.maths.ox.ac.uk/~conlond/relative-szemeredi.pdf
The Green-Tao theorem: an exposition. Preprint.
http://people.maths.ox.ac.uk/~conlond/green-tao-expo.pdf
Conlon, D., Gowers, W. T., Samotij, W. and Schacht, M.
On the KŁR conjecture in random graphs. Isr. J. Math., to appear.
http://people.maths.ox.ac.uk/~conlond/KLRGNP.pdf
Conlon, D. and Stein, M. J.
Monochromatic cycle partitions in local edge colourings. Preprint.
Coon, J. P., Dettmann, C. P. and Georgiou, O.
Connectivity in Dense Networks Confined within Right Prisms. Preprint.
Network Connectivity: Stochastic vs. Deterministic Wireless Channels. Preprint.
Connectivity of confined 3D Networks with Anisotropically Radiating Nodes.
Preprint.
Network connectivity through small openings. Preprint.
k-connectivity for confined random networks. Europhys. Lett. 103 (2013) 28006
Cooper, A., Pikhurko, O., Schmitt, J., and Warrington, G.
Martin Gardner's Minimum No-3-in-a-line Problem. Amer Math Monthly, 121 (2014)
213-221
http://homepages.warwick.ac.uk/staff/O.Pikhurko/Papers/No3inline.pdf
Cooper, C., Elsässer, R., Ono, H. and Radzik, T.
Coalescing Random Walks and Voting on Connected Graphs. SIAM J. Discrete Math.
27 (2013) 1749-1758.
http://dx.doi.org/10.1137/120900368
Cooper, C. and Frieze, A. M.
Component structure induced by a random walk on a random graph. Random Struct.
Algorithm 42 (2013) 135-158.
http://www.math.cmu.edu/~af1p/Texfiles/fractal.pdf
Long paths in random Apollonian networks. Preprint.
http://www.math.cmu.edu/~af1p/Texfiles/Longpath.pdf
The height of random k-trees and related branching processes. Preprint.
http://www.math.cmu.edu/~af1p/Texfiles/ktreeprocess.pdf
Vacant sets and vacant nets: Component structures induced by a random walk.
Preprint.
Cooper, C., Frieze, A. M. and Lubetsky, E.
Cover time of a random graph with a degree sequence II: Allowing vertices of degree
two. Preprint.
http://www.math.cmu.edu/~af1p/Texfiles/Gnd2.pdf
Cooper, C., Frieze, A. M. and Radzik, T.
The cover times of random walks on random uniform hypergraphs. Theor. Comput.
Sci. 509 (2013) 51-69.
http://www.math.cmu.edu/~af1p/Texfiles/Hypergraphs.pdf
Cooper, C., Radzik, T. and Siantos, Y.
Fast Low-Cost Estimation of Network Properties Using Random Walks. Lect. Notes
Comput. Sci. 8305 (2013) 130-143.
http://dx.doi.org/10.1007/978-3-319-03536-9_11
Cooper, C., Radzik, T. and Siantos, Y.
A fast algorithm to find all high degree vertices in graphs with a power law degree
sequence. Internet Math. 2013.
http://dx.doi.org/10.1080/15427951.2013.819210
Cooper, C.
[see: Abdullah, M., Berenbrink, P.]
Cooper, M. C.
[see: Cohen, D. E.]
Corneil, D. G. and Stacho, J.
Vertex ordering characterizations of graphs of bounded asteroidal number. J. Graph
Theory, to appear.
http://www.cs.toronto.edu/~stacho/public/asterorder2d.pdf
Corran, A., Hoffmann, M., Kuske, D. and Thomas, R. M.
On the automaticity of singular Artin monoids of finite type. International Journal of
Computer Mathematics 90 (2013) 1197-1222.
http://dx.doi.org/10.1080/00207160.2012.734812
Couturier, J.-F., Golovach, P. A., Kratsch, D. and Paulusma, D.
List colouring in the absence of a linear forest. Algorithmica, to appear.
http://dx.doi.org/10.1007/s00453-013-9777-0
http://www.durham.ac.uk/daniel.paulusma/Papers/Submitted/rp1p5.pdf
Couturier, J.-F.
[see; Cochefort, M.]
Crama, Y.
[see: Anthony, M.]
Crampton, J., Crowston, R., Gutin, G., Jones, M. and Ramanujan, M. S.
Fixed-Parameter Tractability of Workflow Satisfiability in the Presence of Seniority
Constraints. Lect. Notes Comput. Sci. 7924 (2013) 198-209
http://dx.doi.org/10.1007/978-3-642-38756-2_21
Crampton, J., Gutin, G. and Yeo, A.
On the parameterized complexity and kernelization of the workflow satisfiability
problem ACM Transactions on Information and System Security, to appear.
Crampton, J.
[see: Cohen, D. E.]
Creed, P. and Cryan, M. E.
The number of Euler tours of random directed graphs. Electron J. Comb. 20 (3)
(2013) p13.
Creed, P.
[see: Cohen, D. E.]
Crestani, E.
[see: Burness, T. C.]
Crilly, T.
[see: Anderson, I.]
Crochemore, M. and Daykin, J. E. (editors)
Stringmasters 2011 special issue. J. Discrete. Algorithms 20 (2013) 1-2.
Crochemore, M., Grossi, R., Kärkäinnen, J. and Landau, G. M.
A Constant-Space Comparison-Based Algorithm for Computing the BurrowsWheeler Transform. In CPM 2013. Lect. Notes. Comput. Sci. 7922 (2013) 74-82.
http://dx.doi.org/10.1007/978-3-642-38905-4_9
Crochemore, M, Iliopoulos, C. S., Kubica, M., Radoszewski, J., Rytter, W. and
Walen, T.
Extracting powers and periods in a word from its runs structure. Theor. Comput. Sci.
521 (2014) 29-41.
Crochemore, M.
[see: Amit, M., Christou, M. ]
Crowston, R., Fellows, M. R., Gutin, G., Jones, M., Kim, E.-J., Rosamond, F.,
Ruzsa, I. Z., Thomassé, S. and Yeo, A.
Satisfying more than half of a system of linear equations over GF(2): A multivariate
approach. J. Comput. Syst. Sci. 80 (2014) 687-696
http://dx.doi.org/10.1016/j.jcss.2013.10.002
Crowston, R., Gutin, G., Jones, M. and Muciaccia, G.
Maximum Balanced Subgraph Problem Parameterized Above Lower Bound. Theor.
Comput. Sci. 513 (2013) 53-64.
Crowston, R., Gutin, G., Jones, M. and Muciaccia, G.
Maximum Balanced Subgraph Problem Parameterized Above Lower Bound.
COCOON 2013. Lect. Notes. Comput. Sci. 7936 (2013) 434-445.
Crowston, R., Gutin, G., Jones, M., Raman, V. and Saurabh, S.
Parameterized Complexity of MaxSat Above Average. Theor. Comput. Sci. 511
(2013) 77-84.
Crowston, R., Gutin, G., Jones, M., Raman, V., Saurabh, S. and Yeo, A.
Fixed-Parameter Tractability of Satisfying Beyond the Number of Variables.
Algorithmica 68 (2014) 739-757
http://dx.doi.org/10.1007/s00453-012-9697-4
Crowston, R., Gutin, G., Jones, M and Yeo, A.
Parameterized Complexity of Satisfying Almost All Linear Equations over
Theory Comput. Syst. 52 (2013) 719-728
http://dx.doi.org/10.1007/s00224-012-9415-2
Crowston, R., Jones, M., Muciaccia, G. Philip, G., Rai, A. and Saurabh, S.
Polynomial Kernels for λ-extendible Properties Parameterized Above the PoljakTurzík Bound. Preprint.
Crowston, R.
[see: Crampton, J.]
Cryan, M. E.
[see: Chebolu, P., Creed, P.]
Csaba, B., Kühn, D, Lo, A., Osthus, D. and Treglown, A.
Proof of the 1-factorization and Hamilton decomposition conjectures II: approximate
decompositions. Preprint.
http://web.mat.bham.ac.uk/D.Kuehn/bipartitecase10.pdf
Csaba, B., Kühn, D, Lo, A., Osthus, D. and Treglown, A.
Proof of the 1-factorization and Hamilton decomposition conjectures III: the bipartite
case. P reprint.
http://web.mat.bham.ac.uk/D.Kuehn/almost9.pdf
Csóka, E.
Invariant Gaussian processes and independent sets on regular graphs of large girth.
Preprint.
Csóka, E.
A local flow algorithm in bounded degree networks. Seventh European Conference
on Combinatorics, Graph Theory and Applications, 129-134.
http://dx.doi.org/10.1007/978-88-7642-475-5_21
Cubitt, T., Mancinska, L., Roberson, D., Severini, S., Stahlke, D. and Winter, A.
Bounds on entanglement assisted source-channel coding via the Lovasz theta number
and its variants. Preprint.
http://arxiv-web3.library.cornell.edu/pdf/1310.7120
Cummings, J., Král’, D., Pfender, F., Sperfeld, K., Treglown, A. and Young, M.
Monochromatic triangles in three-coloured graphs. J. Comb. Theory Ser. B. 103
(2013) 489-503. http://dx.doi.org/10.1016/j.jctb.2013.05.002
Cvetković, D. M., Rowlinson P., Stanić, Z. and Yoon, M. G.
Controllability of multi-agent dynamical systems with a broadcasting control signal,
Asian Journal of Control, to appear.
http://dx.doi.org/10.1002/asjc.793
Cvetković, D. M.
[see: Caporossi, G.]
Cygan, M., Englert, M., Gupta, A., Mucha, M. and Sankowski, P.
Catch Them if You Can: How to Serve Impatient Users. ITCS’13, 485-494 .
http://www.dcs.warwick.ac.uk/~englert/publications/matching_itcs13.pdf
Cyman, J., Dzido, T., Lapinskas J. and Lo, A.
On-line Ramsey numbers for paths and cycles. Preprint.
Czabarka, E., Erdős, P. L., Johnson, V. and Moulton,V.
Generating functions for multi-labeled trees. Discrete App. Math. 161 (2013)
107–117.
http://dx.doi.org/10.1016/j.disopt.2013.08.002
Dąbrowski, K. K., Golovach, P. A. and Paulusma, D.
Colouring of Graphs with Ramsey-Type Forbidden Subgraphs.
Theor. Comput. Sci., 522 (2014) 34-43.
http://dx.doi.org/10.1007/978-3-642-45043-3_18
http://community.dur.ac.uk/konrad.dabrowski/h1h2.pdf)
Dąbrowski, K. K. and Lozin, V. V.
Augmenting Graphs in Subclasses of P5-free Graphs. Preprint.
Dąbrowski, K. K., Lozin, V. V., Müller, H. and Rautenbach, D.
Parameterized Complexity of the Weighted Independent Set Problem beyond Graphs
of Bounded Clique Number. J. Discrete Algorithms 14 (2012) 207-213.
http://www.dur.ac.uk/konrad.dabrowski/fpt-iwoca-final2.pdf
Dąbrowski, K. K., Lozin, V. V., and Stacho, J.
Graph Partitions Below 3-colourability. Submitted.
http://www.cs.toronto.edu/~stacho/public/partitions7.pdf
Dąbrowski, K. K., Lozin, V. V., and Stacho, J.
Stable
partitions of graphs. Discrete Appl. Math., to appear. .
http://www.cs.toronto.edu/~stacho/public/partitions-dam-go.pdf
Dąbrowski, K. K., and Paulusma, D.
Clique-width of Graph Classes Defined by Two Forbidden Induced Subgraphs.
Preprint.
Dąbrowski, K. K., and Paulusma, D.
Classifying the Clique-Width of $H$-Free Bipartite Graphs. Preprint.
Dąbrowski, K. K.
[see: Bourgeois, N]
D’Adderio, M.
[see: Aval, J-C.]
D’Alessandro, D.
[see: Burgarth, D.]
Dalmau, V. and Krokhin, A.
Robust satisfiability for CSPs. Hardness and algorithmic results. ACM Trans.
Comput. Theory 5 (2013) article 15.
http://dx.doi.org/10.1145/2540090
http://www.dur.ac.uk/andrei.krokhin/papers/robust1.pdf
Danziger, P., Horsley, D. and Webb, B. S.
Resolvabiltiy of infinite designs. J. Comb. Theor, Ser A, 123 (20141), 73–85.
http://oro.open.ac.uk/39216/1/infinite%20resolvable-f.pdf
Davenport, D., Hindman, N., Leader, I. B. and Strauss, D.
Multiply partition regular matrices. Discrete Math. 322 (2014) 61-68.
Demange, M.
[see: Bourgeois, N]
Daykin, J. E.
[see: Crochemore, M.]
Dellamonica, D., Kohayakawa, Y., Lee, S., Rödl, V. and Samotij, W.
The number of B3-sets of a given cardinality. Submitted.
https://www.dpmms.cam.ac.uk/~ws299/papers/B_3-sets.pdf
Dellamonica, D., Kohayakawa, Y., Lee, S., Rödl, V. and Samotij, W.
The number of Bh sets. Submitted.
https://www.dpmms.cam.ac.uk/~ws299/papers/B_h-sets.pdf
Demers, M. and Todd, M.
Equilibrium states, pressure and escape for multimodal maps. Preprint.
Dereich, S. and Mörters, P.
Cycle length distributions in random permutations with diverging cycle weights.
Random Struct. Algorithms, to appear.
http://people.bath.ac.uk/maspm/Perm_Cond.pdf
Desormeaux, W., Haynes, T., Henning, M. and Yeo, A.
Total Domination in Graphs with Diameter Two. J. Graph Theory 75 (2013) 91-103
Detomi, E., Lucchini, A. and Roney-Dougal, C. M.
On the probability of generating a monolithic group. J. Algebra 407 (2014) 413-433.
http://dx.doi.org/10.1016/j.jalgebra.2014.03.010
Dettmann, C. P.
[see: Coon, J.-P.]
Deveci, O.
[see: Campbell, C. M.]
Devroye, L.
[see: Amini, O.]
Diaz, J., Goldberg, L. A., Mertzios, G. B., Richerby, D., Serna, M. and Spirakis,
P. G.
Approximating Fixation Probabilities in the Generalized Moran Process. Algorithmica
69 (2014) 78-91
http://dx.doi.org/10.1007/s00453-012-9722-7 .
Diaz, J., Goldberg, L. A., Mertzios, G. B., Richerby, D., Serna, M. and Spirakis,
P. G.
On the fixation probability of superstars. Proc. R. Soc. Lond., Ser. A Math. Phys. Eng.
Sci 469 (2013) paper 20130193.
http://dx.doi.org/10.1098/rspa.2013.0193
Diaz, J., Goldberg, L. A., Richerby, D. and Serna, M.
Absorption Time of the Moran Process. Preprint.
Diaz, J. and Merzios, G. B.
Minimum Bisection is NP-hard on Unit Disk Graphs. Preprint.
Ding, G.
[see: Chun, C.]
Distler, A. and Kelsey, T. W.
The semigroups of order 9 and their automorphism groups. Semigroup
Forum 88 (2014) 93-112
http://dx.doi.org/10.1007/s00233-013-9504-9
Dolich, A.
[see: Aschenbrenner, M.]
Dolinka, I. and Ruškuc, N.
Every group is a maximal subgroup of the free idempotent generated semigroup over
a band. Int. J. Algebra Comput. 23 (2013) article 573.
http://dx.doi.org/10.1142/S0218196713500100
Donovan, D. M. and Grannell, M. J.
On the number of transversal designs. J. Comb. Theory Ser. A 120 (2013) 1562-1574.
Donovan, D. M., Griggs, T. S., Lefevre, J. G. and McCourt, T. A.
Cyclic biembeddings of twofold triple systems. Ann. Comb. 18 (2014) 57-74.
http://dx.doi.org/10.1007/s00026-013-0211-8
Donovan, D. M., Griggs, T. S., Lefevre, J. G. and McCourt, T. A.
Further biembeddings of twofold triple systems. Ars Math. Contemp., to appear.
Dowden, C.
Uniform random planar graphs with degree constraints. Preprint.
Downs, M. and Jones, G. A.
Enumerating Regular Objects associated with Suzuki Groups. Preprint.
Downs, M. and Jones, G. A.
The Möbius Function of the Suzuki Groups. Preprint.
Draief, M.
[see: Abdullah, M.]
Draisma, J. and Shaw, R.
Some noteworthy alternating trilinear forms. J. Geom (2014)
http://dx.doi.org/10.1007/s00022-013-0202-2
Drápal, A., Griggs, T. S. and Kozlik, A.
Triple systems and binary operations. Discrete Math. 325 (2014) 1-11.
Drápal, A., Griggs, T. S. and Kozlik, A.
Basics of DTS-quasigroups; Algebra, Geometry and Enumeration. Preprint.
Dress, A.. Huber, K. T.. Koolen, J. H., Moulton, V. and Spillner, A.
Characterizing Block Graphs in Terms of their Vertex-Induced Partitions . Preprint.
Dress, A.. Huber, K. T.. Koolen, J. H. and Moulton, V.
Blocks and cut vertices of the Buneman Graph. SIAM J. Discrete Math., to appear.
Dress, A., Huber, K. T. and Steel, M.
A matroid associated with a phylogenetic tree. Preprint.
Dress, A.. Moulton, V., Spillner, T. and Wu, T.
Obtaining splits from cut sets of tight spans. Discrete Appl. Math. 161 (2013)
1409-1420.
Druilhet, P.
Dudek, A., Pikhurko, O. and Thomason, A. G.
On minimum saturated matrices. Graphs Comb. 29 (2013) 1269-1286.
http://dx.doi.org/10.1007/s00373-012-1199-2
Dukes, W. M. B.
Revstack sort, zigzag patterns, descent polynomials of $t$-revstack sortable
permutations, and Steingrímsson's sorting conjecture. Electron. J. Comb. 21 (2014)
P2.2.
Dukes, W. M. B., Gardi, E., McAslan, H., Scott, D. J. and White, C. D.
Webs and posets. Journal of High Energy Physics 2014 (2014), 1-43.
Dukes, W. M. B.
[see: Aval, J.-C.]
Duminil-Copin, H. and Hammond, A.
Self-avoiding walk is sub-ballistic. Commun. Math. Phys. 324 (2013) 401-423.
http://dx.doi.org/10.1007/s00220-013-1811-1
Duminil-Copin, H. Glazman, A., Hammond, A. and Manolescu, I.
On the probability that self-avoiding random walk ends at a given point. Preprint.
http://www.stats.ox.ac.uk/~hammond/papers/sawendpoint.pdf
Duncan, A. J.
[see: Casals-Ruiz, M.]
Dung, A. D.
[see: Baber, R.]
Dunwoody, M. J.
Structure Trees and Networks. Preprint.
Dvořák, Z. and Klimošová, T.
Strong immersions and maximum degree. SIAM J. Discrete Math. 28 (2014) 177-187
http://dx.doi.org/10.1137/130915467
Dvořák, Z., Král’, D. and Thomas, R.
Three-coloring triangle-free graphs on surfaces III. Graphs of girth five. Preprint.
Three-coloring triangle-free graphs on surfaces IV. Bounding face sizes of 4-critical
graphs. Preprint.
Testing first-order properties for subclasses of sparse graphs. J. ACM 60 (2013) article
36.
http://people.math.gatech.edu/~thomas/PAP/databe.pdf
Dvořák, Z., Sereni, J.-S. and Volec, J.
Subcubic triangle-free graphs have fractional chromatic number at most 14/5. J. Lond.
Math. Soc., to appear.
Dvořák, Z., Sereni, J.-S. and Volec, J.
Fractional coloring of triangle-free planar graphs. Submitted.
Dvořák, Z.
[see: Chudnovsky, M.]
Dyer, M. E., Frieze, A. M., Hayes, T. P and Vigoda, E.
Random coloring constant degree graphs. Random Struct. Algorithms 36 (2013)
181-200.
http://www.math.cmu.edu/~af1p/Texfiles/colourbdd.pdf
Dyer, M. E., Greenhill, C. and Ullrich, M.
Structure and eigenvalues of heat-bath Markov chains. Preprint.
Dyer, M. E. and Richerby, D.
An effective dichotomy for the counting constraint satisfaction problem. SIAM J.
Comput. 42 (2013) 1245-1274.
Dyer, M. E.
[see: Bulatov, A.]
Dzido, T.
[see: Cyman, J.]
East, J., Egri-Nagy, A. and Mitchell, J. D.
On enumerating transformation semigroups. Preprint.
Eberhard, S.
Almost all sets of
points on the
-sphere are not subtransitive.
Mathematika 58 (2013) 267-268.
http://dx.doi.org/10.1112/S0025579313000053
Eberhard, S.
Følner sequences and sum-free sets. Preprint.
Eberhard, S.
The abelian regularity lemma. Preprint.
https://www.dpmms.cam.ac.uk/~se288/abelianregularity.pdf
Eberhard, S., Green, B. J. and Manners, F.
Sets of integers with no large sum-free subset. Ann. Math., to appear.
Eckhoff, M. and Mörters, P.
Vulnerability of robust preferential attachment networks. Preprint.
http://people.bath.ac.uk/maspm/vulnerability.pdf
Edwards, K.
[see: Christofides, D.]
Edwards, K. J.
Achromatic number of collections of paths and cycles. Discrete Math. 313 (2013)
1856-1860.
Egri-Nagy, A.
[see: East, J.]
Ehrenborg, R., Kitaev, S. and Steingrímsson, E.
Number of cycles in the graph of 312-avoiding permutations. Submitted
Ellis, D.
Forbidding just one intersection, for permutations. Preprint.
Ellis, D., Filmus Y. and Friedgut, E.
A quasi-stability result for dictatorships in Sn. Combinatorica, to appear.
http://www.maths.qmul.ac.uk/~dellis/quasistability1arxiv.pdf
Ellis, D., Filmus Y. and Friedgut, E.
A stability result for balanced dictatorships in Sn. Random Struct. Algorithms, to
appear.
http://www.maths.qmul.ac.uk/~dellis/EFF2arxiv1.pdf
Ellis, D. and Linial, N.
On regular hypergraphs of high girth. Electron J. Comb. 21 (1) (2014) p1.54
Ellis, D.
[see: Benjamini, I., Christofides, D.]
Ellis-Monaghan, J. A., McDowell, A., Moffatt, I and Pangborn, G.
DNA origami and the complexity of Eulerian circuits with turning costs, preprint
http://www.personal.rhul.ac.uk/uxah/001/papers/NCEulerTurn.pdf
Ellis-Monaghan, J. A. and Moffatt, I.
The Las Vergnas Polynomial for embedded graphs. Preprint.
http://www.personal.rhul.ac.uk/uxah/001/papers/LV_eulerian.pdf
Ellis-Monaghan, J. A. and Moffatt, I.
Evaluations of topological Tutte polynomials. Combin. Probab. Comput., to appear.
http://www.personal.rhul.ac.uk/uxah/001/papers/topo_tutte.pdf
Elsässer, R.
[see: Cooper, C.]
Englert, M.
[see: Berenbrink, P., Cygan, M.]
Ercolani, N. M. and Ueltschi, D.
Cycle structure of random permutations with cycle weights. Random Struct.
Algorithms 44 (2014) 109-133.
http://www.ueltschi.org/articles/11-EU.pdf
Ercolani, N. M., Jansen, S. and Ueltschi, D.
Random partitions in statistical mechanics. Preprint.
Erde, J.
A note on decomposing the cube into paths. Preprint.
Erdős, P. L.
[see: Apostolico, A., Czabarka, E.]
Erickson, A, and Ruskey, F.
Enumerating maximal tatami mat coverings of square grids with $v$ vertical
dominoes. Preprint.
Domino Tatami Covering is NP-complete. IWOCA13. Lect. Notes Comput. Sci. 8288
(2013) 140-149.
http://dx.doi.org/10.1007/978-3-642-45278-9_13
Generating Tatami Coverings Efficiently. Preprint
Erlebach, T.
[see: Alqahtani, H. M.]
Erskine, G.
Diameter 2 Cayley graphs of dihedral groups. Preprint.
Esperet, L, van den Heuvel, J., Maffray, F. and Sipma, F.
Fire containment in planar graphs. J. Graph Theory 73 (2013) 267-279.
Esperet, L.
[see: Amini, O.]
Estrada, E.
About the Discriminant Power of the Subgraph Centrality and Other Centrality
Measures About the Discriminant Power of the Subgraph Centrality and Other
Centrality Measures. Preprint.
Estrada, E. and de la Peña, J. A.
From Integer Sequences to Block Designs via Counting Walks in Graphs. Preprint.
Estrada, E. and de la Peña, J. A.
On -walk regular graphs. Preprint.
Everitt, B. and Fountain, J. B.
Partial mirror symmetry, lattice presentations and algebraic monoids. Proc. Lond.
Math. Soc.107 (2013) 414-450.
http://dx.doi.org/10.1112/plms/pds068
Evseev, A., Paget, R. E. and Wildon, M. R.
Character deflations and a generalization of the Murnaghan--Nakayama rule. J.
Group Theory, to appear.
Faben, J. and Jerrum, M. R.
The complexity of parity graph homomorphism: an initial investigation. Preprint.
Fairbairn, B.
[see: Cameron, P. J.]
Falgas-Ravry, V., Kittipassorn, T., Korándi, D., Letzter, S. and Narayanan, B.
Separating path systems. Preprint.
https://www.dpmms.cam.ac.uk/~bp338/pdf/sep_path_sys.pdf
Falgas-Ravry, V., Marchant, E., Pikhurko, O. and Vaughan, E. R.
The codegree threshold for 3-graphs with independent neighbourhoods. Preprint.
Fauvel,. J. amd Wilson, R. J.
The Lull before the storm: combinatorics in the Renaissance. Mathematicians and
their Gods (ed. S. Lawrence and M. McCartney), Oxford University Press. To appear.
Fayers, M.
Dyck tilings and the homogeneous Garnir relations for graded Specht modules.
Preprint.
Fayers, M.
A generalisation of core partitions. Submitted.
http://www.maths.qmul.ac.uk/~mf/papers/gencores.pdf
Feghali, C., Johnson, M. and Paulusma, D.
A reconfigurations analogue of Brooks’ theorem. Submitted.
Feghali, C.
[see: Abu Khzam, F. N]
Fellows, M. R.
[see: Crowston, R.]
Felsner, S., Mertzios, G. B. and Mustata, I.
On the recognition of four-directional orthogonal ray graphs. In Proceedings of MFCS
38. Lect. Notes Comput. Sci. 8087 (2013) 373-384.
http://dx.doi.org/10.1007/978-3-642-40313-2_34
http://community.dur.ac.uk/george.mertzios/papers/Conf/Conf_4-DORGsrecognition.pdf
Ferber, A., Glebov, R., Krivelevich, M. and Naor, A.
Biased Games On Random Boards. Random Struct. Algorithms, to appear.
Ferber, A. and Hefetz, D.
Weak and strong k-connectivity games. Eur. J. Comb. 35 (2014) 169–183
http://web.mat.bham.ac.uk/D.Hefetz/MyPapers/FinalkConnectivityPaper.pdf
Ferber, A.
[see: Clemens, D.]
Ferguson, D., Kaiser, T. and Král, D.
The fractional chromatic number of triangle-free subcubic graphs. Eur. J. Comb. 35
(2014) 184-220.
Ferrari, L.
[see: Bacher, A.]
Fewster, C. J. and Siemssen, D.
Enumerating Permutations by their Run Structure. Preprint.
Fiala, J., Kaminski, M. and Paulusma, D.
A note on contracting clas-free graphs. Discrete Math. Theor. Comput. Sci. 15 (2013)
223-232.
http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/2128
Fiala, J.
[see: Broersma, H. J., Chaplick, S.]
Filmus, Y.
[see: Ellis, D.]
Fink, A., Fraenkel, A. and Santos, C.
Lim is not slim. Int. J. Game Theory, to appear.
http://dx.doi.org/10.1007/s00182-013-0380-z.
Fink, A. and Moci, L.
Matroids over a ring. J. Eur. Math. Soc., to appear.
Fink, A. and Rincón, F.
Stiefel tropical linear spaces. Preprint.
Fink, A.
[see: Berget, A.]
Fischer, J.
[see: Bille, P.]
Fiz Pontiveros, G., Griffiths, S., Morris, R. D., Saxton, D. and Skokan, J.
On the Ramsey number of the triangle and the cube. Combinatorica, to appear. .
Fiz Pontiveros, G., Griffiths, S., Morris, R. D., Saxton, D. and Skokan, J.
The Ramsey number of the clique and the hypercube. Proc. Lond. Math. Soc., to
appear.
Fokkink, R.
[see: Alpern, S.]
Fomin, F. V., Giannopoulou, A. C. and Pilipczuk, M.
Computing Tree-depth Faster Than
PEC2013. Lect. Notes Comput. Sci. 8246
(2013) 137-149.
http://dx.doi.org/10.1007/978-3-319-03898-8_13
Foniok, J.
[see: Böttcher, J.]
Forbes, A. D., Griggs, T. S., Psomas. C. and Širáň, J.
Biembeddings of Steiner triple systems in orientable pseudosurfaces with one pinch
point. Glasgow. Math. J. 56 (2014) 251-260.
http://dx.doi.org/10.1017/S0017089513000220
Fortnow, L.
[see: Batu, T.]
Fountain, J. B.
[see: Everitt, B.]
Fountoulakis, N., Kang, R. J., and McDiarmid, C. J. H.
Largest sparse subgraphs of random graphs. Eur. J. Comb. 35 (2014) 232-244.
Fountoulakis, N., Khosla, M. and Panagiotou, K.
The Multiple-orientability Thresholds for Random Hypergraphs. Preprint.
Fountoulakis, N. and Panagiotou, K.
Rumor spreading on random regular graphs and expanders. Random Struct.
Algorithms 43 (2013) 201-220.
Fountoulakis, N., Panagiotou, K. and Steger, A.
On the insertion time of cuckoo hashing. SIAM J. Comput. 42 (2013) 2156-2181.
http://dx.doi.org/10.1137/100797503 .
Fountoulakis, N.
[see: Amini, H., Bode, M., Candellero, E.]
Fox, J.
[see: Conlon, D.]
Fox, J., Grinshpun, A., Liebenau, A., Person, Y and Szabó, T.
What is Ramsey-equivalent to a clique? J. Comb. Theory Ser. B., to appear.
Fraenkel, A.
[see: Fink, A.]
Francis, M., Hell, P. and Stacho, J.
Blocking quadruple: A new obstruction to circular-arc graphs. SIAM J. Discrete
Math., to appear.
http://www.cs.toronto.edu/~stacho/public/cca12.pdf
Freitas, A. C., Freitas, J. M. and Todd, M.
Speed of convergence for laws of rare events and escape rates. Preprint.
Freitas, J. M.
[see: Freitas, A. C.]
Friedetzky, T.
[see: Berenbrink, P.]
Friedgut, E.
[see: Benjamini, I., Ellis, D.]
Friedrich, T., Sauerwald, T. and Stauffer, A.
Diameter and broadcast time of random geometric graphs in arbitrary dimensions
Algorithmica 67 (2013), 65-88
http://dx.doi.org/10.1007/s00453-012-9710-y
Frieze, A. M. and Sorkin, G. B.
Efficient algorithms for three-dimensional Axial and planar random assignment
problems. Random Struct. Algorithms., to appear.
Frieze, A. M.
[see: Cooper, C., Dyer, M. E.]
Fukshansky, M.
[see: Aliev, I.]
Füredi, Z.
[see: Balister, P. N., Bollobás, B.]
Gadouleau, M.
Closure solvability for network coding and secret sharing. IEEE Trans.Inf,. Theory.
59 (2013) 7858-7869.
http://dx.doi.org/10.1109/TIT.2013.2282293
Gadouleau, M.
Entropy of Closure Operators. Preprint.
Gadouleau, M. and Georgiou, N.
New constructions and bounds for Winkler's hat game. Preprint.
Gadouleau, M.
[see: Bezzateev, S., Cameron, P. J.]
Gagarin, A. and Zverovich, V. E.
The probabilistic approach to limited packings in graphs. Preprint.
Gagarin, A.
[see: Cohen, D. E.]
Galanis, A.,
[see: Cai, J.-Y.]
Ganesh, A., Manjunath, D. and Santhana Krishnan, B.
On Connectivity Thresholds in Superposition of Random Key Graphs on Random
Geometric Graphs. IEEE International Symposium on Information Theory
Proceedings (ISIT), 2013.
http://dx.doi.org/10.1109/ISIT.2013.6620654
Gardi, E.
[see: Dukes, W. M. B.]
Gardiner, A. D. and Praeger, C. E.
Symmetric graphs with complete quotients. Preprint. 1
http://arxiv-web3.library.cornell.edu/pdf/1403.4387v1
Garrod, B. J. and Morris, R. D.
The secretary problem on an unknown poset. Random Struct. Algorithms 43 (2013)
429-451.
Gasarch, W.
[see: Conlon, D.]
Gaspers, S. and Sorkin, G. B.
1
This manuscript from 2000 has recently by popular request been uploaded to Arxiv.
Separate, Measure and Conquer: Faster Algorithms for Max 2-CSP and Counting
Dominating Sets. Preprint.
Gate, J. and Stewart, I. A.
The expressibility of fragments of Hybrid Graph Logic on finite digraphs. Journal of
Applied Logic 11 (2013) 272-288.
http://dx.doi.org/10.1016/j.jal.2013.05.002
https://community.dur.ac.uk/i.a.stewart/Papers/HybridGraphLogic.pdf
Gauci, J.-B., Hilton, A. J. W. and Stark, D. S.
Wiggles and Finitely Discontinuous k-to-1 Functions Between Graphs. J. Graph
Theory 74 (2013) 275-308.
Gebauer, H.
[see : Clemens, D.]
Gent, I. P., Kitaev, S., Konovalov, A. B., Linton, S. A. and Nightingale, P.
S-crucial and bicrucial permutations with respect to squares. Preprint.
Georgakopoulos, A.
On graph-like continua of finite length. Preprint.
Georgakopoulos, A.
Characterising planar Cayley graphs and Cayley complexes in terms of group
presentations. Eur. J. Comb. 36 (2014) 282-293
Georgakopoulos, A.
Delay colourings of cubic graphs. Electron J. Comb. 20 (2013) p45.
Georgakopoulos, A., Haeseler, S., Keller, M. Lenz, D. and Wojchiekowski, R.
Graphs of Finte Measure. Preprint.
Georgakopoulos, A. and Kolesko, K.
Brownian motion on graph-like spaces. Preprint.
http://homepages.warwick.ac.uk/~maslar/BMG.pdf
Georgakopoulos, A. and Winkler, P. M.
New Bounds for Edge-Cover by Random Walk. Combin. Probab. Comput., to
appear.
Georgiou, N. and Wade, A. R.
Non-homogeneous random walks on a semi-infinite strip. Preprint.
Georgiou, N.
[see: Gadouleau, M. R.]
Georgiou, O.
[see: Coon, J.-P.]
Gerke, S. and McDowell, A.
Non-Vertex-Balanced Factors in Random Graphs. J. Graph Theory, to appear. .
Gerke, S.
[see: Blackburn, S. R.]
Ghinelli, D., Key, J. D., and McDonough, T. P.
Hulls of codes from incidence matrices of connected regular graphs. Des. Codes
Cryptography 70 (2014) 35-54.
http://dx.doi.org/10.1007/s10623-012-9635-0
http://users.aber.ac.uk/tpd/papers/hulls_of_codes_postprint.pdf
Giandomenico, M., Letchford, A. N., Rossi R, and Smriglio, S.
Approximating the Lovász theta function with the subgradient method (extended
abstract). Electron. Notes Discrete Math. 41 (2013) 157-164.
http://www.lancs.ac.uk/staff/letchfoa/articles/inoc-subgradient.pdf
Gianelli, E. and Wildon, M. R.
Foulkes modules and decomposition numbers of the symmetric group. Preprint.
Giannopoulou, A. C., Kamiński, M. and Thilkos, D. M.
Forbidding Kuratowski Graphs as Immersions. J. Graph Theory, to appear.
Giannopoulou, A. C., Kamiński, M. and Thilkos, D. M.
Excluding Graphs as Immersions in Surface Embedded Graphs. WG 2013.
Giannopoulou, A. C., Lokshtanov, D., Saurabh, S. and Suchy, O.
Tree Deletion Set has a Polynomial Kernel (but no OPT^O(1) approximation).
Preprint.
Giannopoulou, A. C., Salem, I and Zoros, D.
Effective computation of immersion obstructions for unions of graph classes. J.
Comput. Syst. Sci. 80 (2014) 207-216.
Giannopoulou, A. C. and Thilkos, D. M.
Optimizing the Graph Minors Weak Structure Theorem. SIAM J. Discrete Math. 27
(2013) 1209-1227
http://dx.doi.org/10.1137/110857027
Giannopoulou, A. C.
[see: Belmonte, R., Fomin, F. V.]
Gill, N.
A note on the Weiss conjecture. J. Austral. Math. Soc., to appear.
Gill, N.
Orientable regular maps with Euler characteristic divisible by few primes. J. Lond.
Math. Soc. 88 (2013) 118-136.
http://dx.doi.org/10.1112/jlms/jdt010
Gill, N.
groups with Euler characteristic equal to
Electron J. Comb. 20
(2013) p8.
Gill, N. and Helfgott, H. A.
Growth in solvable subgroups of
Math. Ann., to appear.
Gill, N., Helfgott, H. A. and Rudnev, M.
On growth in an abstract plane. Proc. Am. Math. Soc., to appear.
Gill, N.
[see: Bamberg, J., Britnell, J. R.]
Gillespie, N. I.
A note on binary completely regular codes with large minimum distance. Discrete
Math. 313 (2013) 1532-1534.
Gillespie, N. I., Hawtin, D. R. and Praeger, C. E.
The Structure of Elusive Codes in Hamming Graphs. Preprint.
Gillespie, N. I., Hawtin, D. R. and Praeger, C. E.
Elusive codes in Hamming graphs. Bull. Aust. Math. Soc. 88 (2013) 286-296.
http://dx.doi.org/10.1017/S0004972713000051
Gillespie, N. I., and Praeger, C. E.
Neighbour transitivity on codes in Hamming graphs. Des. Codes Cryptography 67
(2013) 385-393
http://dx.doi.org/10.1007/s10623-012-9614-5
Gillespie, N. I., and Praeger, C. E.
Uniqueness of certain completely regular Hadamard codes. J. Comb. Theory Ser. A.
1394-1400.
Gillespie, N. I., Praeger, C. E. and Spiga, P.
Twisted Permutation Codes. Preprint.
Ginzburg, B. D.
[see: Bárány, I.]
Giovanetti, G.
[see: de Beaudrap, N.]
Giudici, M., Liebeck, M. W., Praeger, C. E., Saxl, J. and Tiep, P. H.
Arithmetic results on orbits of linear groups.. Trans. Am.. Math. Soc., to appear.
Giudici, M. and Parker, C.
There is no upper bound for the diameter of the commuting graph of a finite group. J.
Comb. Theory Ser A. 120 (2013) 1600-1603.
Glass, C.
[see: Cameron, P. J.]
Glazman, A.
[see: Duminil-Copin, H.]
Glebov, R., Grzesik, A., Klimošová, T. and Král’, D.
Finitely forcible graphons and permutons. Preprint.
Glebov, R., Klimošová, T. and Král’, D.
Infinite dimensional finitely forcible graphons. Preprint.
Glebov, R., Král’, D. and Volec, J.
An application of flag algebras to a problem of Erdős and Sós. Electron. Notes.
Discrete Math. 43 (2013) 171-177.
A problem of Erdös and Sós on 3-graphs. In: Proceedings of Eurocomb'13, CRM
Series 16 (2013), 3-8.
Compactness and finite forcibility of graphons. Preprint.
Glebov, R., Krivelevich, M. and Szabó, T.
On covering expander graphs by Hamilton cycles. Random Struct. Algorithms 44
(2014) 183-200.
Glebov, R., Sudakov, B. and Szabó, T.
How many colors guarantee a rainbow matching? Electron J. Comb. 21 (2014)
P1.27.
Glebov, R.
[see: Clemens, D., Ferber, A.]
Gnedin, A. and Gorin, V.
Record-dependent measures on the symmetric groups. Random Struct. Algorithms, to
appear.
Gnedin, A., Gorin, V. and Kerov, S.
Block characters of the symmetric groups. J. Algebr. Comb. 38 (2013) 79-101.
http://dx.doi.org/10.1007/s10801-012-0394-9
Göbel, A., Goldberg, L. A., McQuillan, C., Richerby, D. and Yamakami, T.
Counting list matrix partitions of graphs. Proceedings of CCC2014, to appear.
Göbel, A., Goldberg, L. A. and Richerby, D.
The Complexity of Counting Homomorphisms to Cactus Graphs Modulo 2
Proceedings of STACS2014, to appear.
Godsil, C. D., Roberson, D., Šamal, S. and Severini, S.
Sabidussi vs. Hedetniemi for three variations of the chromatic number. Preprint.
Goldberg, L. A., Goldberg, P. W., Krysta, P. and Ventre, C.
Ranking games that have competitiveness-based strategies. Theor. Comput. Sci. 476
(2013) 24-37.
Goldberg, L. A. and Jerrum, M. R.
The Complexity of Approximately Counting Tree Homomorphisms. Preprint.
Goldberg, L. A. and Jerrum, M. R.
A polynomial-time algorithm for estimating the partition function of the
ferromagnetic Ising model on a regular matroid, SIAM. J. Comput. 42 (2013)
1132-1157
http://dx.doi.org/10.1137/110851213
Goldberg, L. A.
[see: Bulatov, A., Cai, J-Y., Diaz, J., Göbel, A.]
Goldberg, P. W.
[see: Goldberg, L. A.]
Golovach, P. A., Heggernes, P., van ‘t Hof, P. , Manne, F.,Paulusma, D. and
Pilipczuk, M.
Modifying a graph using vertex elimination. Algorithmica, to appear.
http://dx.doi.org/10.1007/s00453-013-9848-2
http://www.dur.ac.uk/daniel.paulusma/Papers/Submitted/elimination.pdf
Golovach, P. A., Kamiński, M., Paulusma, D. and Thillkos, D. M.
Increasing the minimum degree of a graph by contractions. Theor. Comput. Sci. 481
(2013) 74-84.
http://www.durham.ac.uk/daniel.paulusma/Papers/Submitted/degree.pdf
Golovach, P. A., Kamiński, M., Paulusma, D. and Thillkos, D. M.
Lift contractions. Eur. J. Comb. 35 (2014) 286-296.
http://www.dur.ac.uk/daniel.paulusma/Papers/Submitted/lift.pdf
Golovach, P. A., Kratsch, D. and Paulusma, D.
Detecting induced minors in AT-free graphs, Theor. Comput. Sci. 482 (2013) 20-32
http://www.durham.ac.uk/daniel.paulusma/Papers/Submitted/imat.pdf
Golovach, P. A. and Paulusma, D.
List coloring in the absence of two subgraphs, Discrete Appl. Math. 166 (2014)
123-130.
http://www.durham.ac.uk/daniel.paulusma/Papers/Submitted/listfor2.pdf
Golovach, P. A., Paulusma, D. and Song, J.
Closing complexity gaps for coloring problems on H-free graphs. Inf. Comput., to
appear.
http://dx.doi.org/10.1016/j.ic.2014.02.004
Golovach, P. A., Paulusma, D. and Song, J.
Coloring graphs without short cycles and long induced paths, Discrete Appl. Math.
167 (2014) 107-120
http://www.dur.ac.uk/daniel.paulusma/Papers/Submitted/girth.pdf
Golovach, P. A., Paulusma, D. and Stewart, I. A.
Graph editing to a fixed target. IWOCA 2013. Lect. Notes. Comput. Sci. 8288 (2013)
192-205.
http://dx.doi.org/10.1007/978-3-642-45278-9_17
https://community.dur.ac.uk/i.a.stewart/Papers/graphedit.pdf
Golovach, P. A.
[see: Belmonte, R., Biro, P., Broersma, H. J., Cochefert , M., Couturier, J.-F.,
Dąbrowski, K. K.]
Goncalves, D.
[see: Bousquet, N.]
Gonshaw, S.
[see: Coates, T.]
Gordon, N. A., Havlicek H. and Shaw, R.
Tetrads of lines spanning PG(7,2). Bull Belg. Math. Soc. Simon Stevin 20 (2013) 735752.
http://www.hull.ac.uk/php/masrs/2013/Tetrads1.pdf
Gorin, V.
[see: Gnedin, A.]
Gørtz, I. L.
[see: Bille, P.]
Gowers, W. T
[see: Conlon, D.]
Grabowski, J. and Launois, S.
Graded quantum cluster algebras and an application to quantum Grassmannians, Proc.
Lond. Math. Soc., to appear.
Graham, B.
A binary deletion channel with a fixed number of deletions. Preprint.
Grannell, M. J., Griggs T. S., Lo Faro, G. and Tripodi, A.
Configurations in bowtie systems. Aequationes Math. 85 (2013) 347-358.
http://dx.doi.org/10.1007/s00010-013-0199-5
http://users.mct.open.ac.uk/mjg47/papers/BOWCFIG.pdf
Grannell, M. J., Griggs T. S., Máčajová, E. and Škoviera, M.
Colouring cubic graphs by point-intransitive Steiner triple systems. J. Graph Theory
74 (2103) 163-181.
http://mcs.open.ac.uk/mjg47/papers/WS2.pdf
Grannell, M. J. and Knor, M.
Dihedral biembeddings and triangulations by complete and complete tripartite graphs.
Graphs Comb. 29 (2013) 921-932
http://dx.doi.org/10.1007/s00373-012-1163-1
http://mcs.open.ac.uk/mjg47/papers/dihedral1.pdf
Rigid Steiner triple systems obtained from projective triple systems. J. Comb. Des., to
appear.
Pasch trades on the projective triple system of order 31. J. Comb. Math. Comb.
Comput., to appear.
Grannell, M. J. and Lovegrove, G. J.
Maximizing the number of Pasch configurations in a Steiner triple system.
Bull. Inst. Comb. Appl. 69 (2013) 25-35.
http://oro.open.ac.uk/39212/
Grannell, M. J. and McCourt, T. A.
Doubly even orientable closed 2-cell embeddings of the complete graph. Electron J.
Comb. 21 (1) (2014) p1.22
Grannell, M. J.., Psomas, C. and Širáň, J.
Biembedding Steiner triple systems in surfaces using the Bose construction. J. Comb.
Des , to appear.
Grannell, M. J.
[see: Donovan, D. M.]
Granovsky, B. and Stark, D. S.
Developments in the Khintchine-Meinardus probabilistic method for asymptotic
enumeration. Preprint.
Granovsky, B. and Stark, D. S.
Asymptotic enumeration of decomposable combinatorial structures with multiple
singularities (Abstract). Electron. Notes Discrete Math. 43 (2013) 15--20.
http://www.sciencedirect.com/science/article/pii/S1571065313001558
Gray, R. and Kambites, M.
A strong geometric hyperbolicity property for directed graphs and monoids. Preprint.
Gray, R., Maltcev, V., Mitchell, J. D. and Ruškuc, N.
Ideals and finiteness conditions for subsemigroups. Glasgow Math. J. 56 (2014)
65-86.
Gray, R., and Ruškuc, N.
On residual finiteness of monoids, their Schützenberger grups and associated actions.
J. Algebra, to appear.
Gray, R. and Truss, J. K.
Countable locally 2-arc-transitive bipartite graphs. Eur. J. Comb. 39 (2014) 122-147.
Green, B. J.
On the chromatic number of random Cayley graphs. Preprint.
Green, B. J.
Approximate algebraic structure. Preprint.
Green, B. J. and Morris, R. D.
Counting sets with small sumset and applications. Combinatorica, to appear.
Green, B. J. and Tao, T. C.
On sets defining few ordinary lines. Discrete Comput. Geom. 50 (2013) 409-468
http://dx.doi.org/10.1007/s00454-013-9518-9
Green, B. J.
[see: Breuillard, E., Eberhard, S.]
Greenhill, C. S.
[see: Bordewich, M., Dyer, M. E.]
Griffiths, S.
Quasi-Random Oriented Graphs. J. Graph Theory 74 (2013) 198-209.
Griffiths, S.
[see: Ahlberg, D., Amini, O., Fiz Pontiveros, G.]
Griggs, T. S.
[see: Archdeacon, D., Donovan, D. M., Drápal, A., Forbes, A. D., Grannell, M. J.]
Grimmett, G. R.
Criticality, universality, and isoradiality. Proceedings of 2014 ICM, Seoul, to appear.
http://www.statslab.cam.ac.uk/~grg/papers/icm.pdf
Grimmett, G. R., Holroyd, A. E., and Kozma, G.
Percolation of finite clusters and infinite surfaces. Math. Proc. Camb. Philos. Soc. 156
(2014) 263-279.
http://dx.doi.org/10.1017/S030500411300073X
http://www.statslab.cam.ac.uk/~grg/papers/plaq-final.pdf
Grimmett, G. R., Holroyd, A. E., and Peres, Y.
Extendable self-avoiding walks. Annales de l'Institut Henri Poincaré D: CPI 1 (2014)
61–75
http://www.statslab.cam.ac.uk/~grg/papers/ext22.pdf
Grimmett, G. R. and Manolescu, I.
Inhomogeneous bond percolation on square, triangular, and hexagonal lattices. Ann.
Probab. 41 (2013) 2990–3025.
http://dx.doi.org/10.1214/11-AOP729
http://www.statslab.cam.ac.uk/~grg/papers/AOP729.pdf
Universality for bond percolation in two dimensions. Ann. Probab. 41 (2013)
3261–3283.
http://dx.doi.org/10.1214/11-AOP740
http://www.statslab.cam.ac.uk/~grg/papers/AOP740.pdf
Bond percolation on isoradial graphs: criticality and universality. Probab. Theory
Relat. Fields, to appear.
http://www.statslab.cam.ac.uk/~grg/papers/iso-final6.pdf
Grimmett, G. R. and Li, Z.
Strict inequalities for connective constants of transitive graphs. SIAM J. Discrete
Math, to appear.
http://www.statslab.cam.ac.uk/~grg/papers/saw-ineq.pdf
Bounds on connective constants of regular graphs. Combinatorica, to appear. .
http://www.statslab.cam.ac.uk/~grg/papers/saw2-final.pdf
Self-avoiding walks and the Fisher transformation. Electron J. Comb. 20 (2013)
Paper P47, 14 pp
Grimmett, G. R.
[see: Arias-Castro, E.]
Grinberg, V. S.
[see: Bárány, I.]
Grindrod, P. and Higham, D. J.
A matrix iteration for dynamic network summaries. SIAM Reveiw 55 (2013) 118-128. http://centaur.reading.ac.uk/28768/1/dynsumresub.pdf
Dynamical Systems to Monitor Complex Networks in Continuous Time. Preprint.
A dynamical systems view of network centrality. Proc. R. Soc. Lond., Ser. A, Math.
Phys. Eng. Sci, to appear.
http://rspa.royalsocietypublishing.org/content/470/2165/20130835.abstract
Grinshpun, A.
[see: Fox, J.]
Grossi, R.
Gruber, A.
[see: Anthony, M.]
Grujicic I., Mladenovic N. and Nikolic N.
Level reduction algorithm for Covering Designs, IMA Journal of Management
Mathematics, to appear.
Grzesik, A., Mikalački, M., Lóránt Nagy, Z., Naor, A., Patkós, B. and Skerman,
F.
Avoider-Enforcer star games. The Seventh European Conference on Combinatorics,
Graph Theory and Applications, CRM Series 16 (2013) 75-379.
Grzesik, A.
[see: Glebov, R.]
Gunby, B.
[see: Bacher, A.]
Gunderson, K. and Przykucki, M. J.
Lower bounds for bootstrap percolation on Galton-Watson trees. Preprint.
Gunderson, K.
[see: Bollobás, B.]
Guo, H.
[see: Cai, J.-Y.]
Gupta, A.
[see; Cygan, M.]
Guralnick, R. M.
[see: Breuillard, E.]
Gutin, G. and Jones, M.
Parameterized Algorithms for Load Coloring Problem. Preprint.
Gutin, G., Jones, M. and Sheng, B.
Parameterized Complexity of the k-Arc Chinese Postman Problem. Preprint.
Gutin, G., Jones, M., Sheng, B. and Wahlström, M.
Parameterized Directed k-Chinese Postman Problem and k Arc-Disjoint Cycles
Problem on Euler Digraphs. Preprint.
Gutin, G., Wahlström, M. and Yeo, A.
Parameterized Rural Postman and Conjoining Matching Problems. Preprint.
Gutin, G., Muciaccia, G. and Yeo, A.
Parameterized Complexity of k-Chinese Postman Problem. Theor. Comput. Sci. 513
(2013) 124-128.
Gutin, G., Rafiey, A., Szeider, S. and Yeo, A.
Corrigendum. The Linear Arrangement Problem Parameterized Above Guaranteed
Value. Theory Comput. Syst. 53 (2013) 690-691
http://dx.doi.org/10.1007/s00224-007-9037-2
Gutin, G. and Szeider, S. (editors)
Parameterized and Exact Computation - 8th International Symposium, IPEC 2013,
Sophia Antipolis, France, September 4-6, 2013, Lect. Notes Comput. Sci. 8246 (2013)
http://dx.doi.org/10.1007/978-3-319-03898-8
Gutin, G.
[see: Cohen, D. E., Crampton, J., Crowston, R.]
Haeseler, S.
[see: Georgakopoulos, A.]
Hamel, A. M. and King, R. C.
Half-turn symmetric alternating sign matrices and Tokuyama type factorisation for
orthogonal group characters. Preprint.
Hammond, A.
Infinite cycles in the random stirring model on trees. Bulletin of the Institute of
Mathematics, Academia Sinica 8, (2013) 85—104.
http://www.stats.ox.ac.uk/~hammond/papers/randstirinfcycle.pdf
Hammond, A.
Sharp phase transition in the random stirring model on trees.
Probab. Theory Relat. Fields, to appear.
http://www.stats.ox.ac.uk/~hammond/papers/randstirsharp.pdf
Hammond, A.
[see: Duminil-Copin, H.]
Hàn, H.
[see: Allen, P.]
Han, X.
[see: Bansal, N. ]
Hansen, J. and Jaworski, J.
Predecessors and successors in random mappings with exchangeable in-degrees. J.
Appl. Probab. 50 (2013) 603-607.
http://dx.doi.org/10.1239/jap/1378401232
http://www.ma.hw.ac.uk/~jennie/papers/predecessors.pdf
Random mappings with Ewens cycle structure. Ars. Comb. 112 (2013) 307-322.
http://www.ma.hw.ac.uk/~jennie/papers/Ewens_struct_final.pdf
Structural transition in random mappings. Electron J. Comb. 21 (1) (2014) p18.
http://www.combinatorics.org/ojs/index.php/eljc/article/viewFile/v21i1p18/pdf
Hansen, P.
[see: Cafieri, S.]
Harden, C. M. and Penman, D. B.
Fixed point polynomials of permutation groups. Electron J. Comb. 20 (2) (2013) p26.
Harden, C. M. and Penman, D. B.
Fixed point polynomials for the conjugation action. Preprint.
Harrington, H. A.
[see: Beguerisse Diaz, M.]
Harris, D.
[see: Conlon, D.]
Harris, L. H., Jones, S. K, Perkins, S. and Roach, P. A..
Bishop Imdpendence. British Journal of Mathematics and Computer Science 3 (2013)
835-843.
Hart, D.
[see: Bennett, M.]
Hart, S. B. and Rowley, P. J.
Involution Statistics in Finite Coxeter Groups. Preprint.
Haskell, D.
Haslegrave, J.
An evasion game on a graph. Discrete Math. 314 (2014) 1-5.
Haslegrave, J.
Extremal results on average subtree density of series-reduced trees. Preprint.
Haslegrave, J., Johnson, R. A. B. and Koch, S.
The Robber Locating game. Preprint.
Havas, G.
Havlicek H.
[see: Gordon, N. A.]
Hawtin, D. R.
[see: Gillespie, N. I.]
Hayes, T.
[see: Bamberg, J., Dyer, M. E.]
Haynes, T.
[see: Desormeaux, W.]
Heckel, A. and Riordan, O. M.
On the threshold for rainbow connection number r in random graphs Preprint.
Hefetz, D. and Keevash, P.
A hypergraph Turán theorem via lagrangians of intersecting families. J. Comb.
Theory Ser. A. 120 (2013) 2020–2038.
http://web.mat.bham.ac.uk/D.Hefetz/MyPapers/Lagrangian181012.pdf
Hefetz, D., Kühn, D., Lapinskas, J. and Osthus, D.
Optimal covers with Hamilton cycles in random graphs. Combinatorica, to appear.
http://web.mat.bham.ac.uk/D.Hefetz/MyPapers/randomcover15.pdf
Hefetz, D., Steger, A. and Sudakov, B.
Random directed graphs are robustly Hamiltonian. Preprint.
Hefetz, D. and Tyomkyn, M.
Universality of graphs with few triangles and anti-triangles. Submitted.
http://web.mat.bham.ac.uk/D.Hefetz/MyPapers/densities.pdf
Hefetz, D.
[see: Bednarska-Bzdega, M., Ben-Shimon, S., Clemens, D., Ferber, A.]
Heggernes, P.
[see: Belmonte, R., Golovach, P. A.]
Heise, C.-G., Panagiotou, K., Pikhurko, O. and Taraz, A.
Coloring -embeddable -uniform hypergraphs. The Seventh European Conference
on Combinatorics, Graph Theory and Applications. CRM Series 16 (2013) 339-344
Helfgott, H. A.
[see: Bamberg, J., Gill, N.]
Hell, P.
[see: Francis, M.]
Henk, M.
[see: Aliev, I.]
Henning, M. A. and Yeo, A.
Distinguishing-Transversal in Hypergraphs and Identifying Open Codes in Cubic
Graphs. Graphs Comb. (2013)
http://dx.doi.org/10.1007/s00373-013-1311-2
Henning, M. A.
[see: Desormeaux, W.]
Henry, K., Paterson, M. B. and Stinson, D. R.
Practical approaches to varying network size in combinatorial key predistribution
schemes. Preprint.
http://eprint.iacr.org/2013/558.pdf
Hermüller, S.
[see: Ciobanu, L.]
van den Heuvel, J., Král’, D., Kupec, M., Sereni, J.-S. and Volec, J.
Extensions of fractional precolorings show discontinuous behavior. J. Graph Theory,
to appear.
van den Heuvel, J.
[see: Amini, O., Bauer, D., Esperet, L.]
Hicks, A.
[see: Aval, J-C.]
Higham, D. J.
[see: Crofts, J. J., Estrada, E., Grindrod, P.]
Hilgers, R.-D.
Hilton, A. J. W.
[see: Gauci, J.-B.]
Hindman, N.
[see: Barber, B., Davenport, D.]
Hirschfeld, J. W. P. and Thas, J. A.
Projective spaces. Section 14.4 in the Handbook of Finite Fields, CRC Press (2013)
567-581.
http://www.crcpress.com/product/isbn/9781439873786
Hirschfeld, J. W. P. and Thas, J. A.
Open problems in finite projective spaces. Preprint.
Hladký, J., Král’, D. and Norine, S.
Rank of divisors on tropical curves. J. Comb. Theory Ser. A 120 (2013) 1521-1538
Hladký, J., Mathe, A., Patel, V. and Pikhurko, O.
Poset limits can be totally ordered. Trans. Am. Math. Soc., to appear.
Hladký, J.
[see: Allen, P., Böttcher, J., Cibulka, J.]
van 't Hof, P.
[see: Belmonte, R., Chaplick, S., Golovach, P. A.]
Hoffmann, M.
[see: Corran, A.]
Holmgren, C.
Holroyd, A. E. and Martin, J. B.
Stochastic domination and comb percolaion. Electron J. Probab. 19 (2014) no 5
Holroyd, A. E.
[see: Angel, O. Grimmett, G. R.,]
Holt, D.F. and Rees, S. E.
Shortlex automaticity and geodesic regularity in Artin groups. Groups, Complexity
and Cryptology 5 (2013) 1-23.
http://dx.doi.org/10.1515/gcc-2013-0001
http://www.mas.ncl.ac.uk/~nser/abstracts/SLartin2.html
Holt, D.F. and Rees, S. E.
Conjugacy in Artin groups of extra-large type. Preprint.
Holt, D. F. and Roney-Dougal, C. M.
Minimal and random generation of permutation and matrix groups. J. Algebra 387
(2013) 195-214.
http://dx.doi.org/10.1016/j.jalgebra.2013.03.035
http://homepages.warwick.ac.uk/~mareg/download/papers/lingens/lingens.pdf
Holt, D. F.
[see: Bray, J. N., Brough, T., Ciobanu, L.]
Horsley, D.
[see: Danziger, P.]
Hu, P.
[see; Balogh, J.]
Hua, B., Jost, J. and Liu, S.
Geometric analysis aspects of infinite semiplanar graphs with nonnegative curvature.
J. Reine Angew. Math., to appear.
Huang, J.
[see: Cannings, C.]
Huber, A. and Kolmogorov, V.
Towards minimizing k-submodular functions. Preprint.
Huber, A. and Krokhin, A.
Oracle Tractability of Skew Bisubmodular Functions. Preprint.
Huber, A., Krokhin, A. and Powell, R.
Skew bimodularity and valued CSPs. SIAM J. Comput., to appear.
http://www.dur.ac.uk/andrei.krokhin/papers/vcsp-three-journal-revised.pdf
Huber, K. T. and Kettleborough. G.
Distinguished minimal toplogical lassos. Preprint.
Huber, K. T. and Moulton, V.
Encoding and Constructing 1-Nested Phylogenetic Networks with Trinets.
Algorithmica, 66 (2013) 714-738.
http://dx.doi.org/10.1007/s00453-012-9659-x
Huber, K. T. and Steel, M.
Reconstructing fully-resolved trees from triplet cover distances. Preprint.
Huber, K. T.
[see : Byrka, J., Dress, A., Gambette, P., Hellmuth, M., Herrmann, S.]
Huczynska, S.
Existence results for finite field polynomials with specified properties. Finite Fields
and Their Applications: Character Sums and Polynomials, P. Charpin, A. Pott and A.
Winterhof (eds), De Gruyter, Berlin, Boston, 2013.
Huczynska, S.
Beyond sum-free sets in the natural numbers. Electron. J. Comb. 21 (1) (2014) p21.
Huczynska, S., Mullen, G. L., Panario, D. and Thomson, D.
Existence and properties of -normal elements over finite fields.
Finite Fields Appl. 124 (2013) 170--183.
http://dx.doi.org/10.1016/j.ffa.2013.07.004
http://people.math.carleton.ca/~dthomson/Research/pdfs/QNB.pdf
Huczynska, S. and Ruškuc, N.
Homomorphis image orders on combinatorial structures. Submitted.
Huggett, S. and Moffatt, I.
Bipartite partial duals and circuits in medial graphs. Combinatorica 33
(2013)
231-252.
http://dx.doi.org/10.1007/s00493-013-2850-0
Humphries, P. and Wu, T.
The neighborhood of tree operations. IEEE/ACM Transactions on Computational
Biology and Bioinformatics 10 (2013) 721-728
Hunt, F. H., Perkins, S. and Smith, D. H.
Decoding Mixed Errors in Permutation Codes. Des. Codes
Cryptography, to appear.
http://dx.doi.org/10.1007/s10623-013-9872-x
Hunt, F. H. and Smith, D. H.
The assignment of CDMA spreading codes constructed from Hadamard matrices and
almost bent functions. Wireless Personal Communications 72 (4) (2013) 2215-2227.
http://dx.doi.org/10.1007/s11277-013-1144-6
Hyde, J., Jonušas, J., Mitchell, J. D. and Péresse, Y. H.
Universal sequences for the order-automorphisms of the rationals. Preprint.
van Iersel, L. and Moulton, V.
Trinets encode tree-child and level-2 phylogenetic networks. J. Math. Biol. (2013)
http://dx.doi.org/10.1007/s00285-013-0683-5
Iliopoulos, C. S.
[see: Christou, M., Crochemore, M.]
Iliopoulou, M.
Counting multijoints. Preprint.
Iliopoulou, M.
[see: Carbery, A.]
Im, S., Sviridenko, M. and van der Zwaam, R.
Preemptive and Non-Preemptive Generalized Min Sum Set Cover. Math. Prog.
(2013)
http://dx.doi.org/10.4230/LIPIcs.STACS.2012.465
http://drops.dagstuhl.de/opus/volltexte/2012/3399/
Immorlica, I.
[see: Condon, A.]
Immorlica, N.
[see: Askalidis, G.]
Inoshita, T, Irving, R. W., Iwama, K., Miyazaki, S. and Nagase, T.
Improving Man-Optimal Stable Matchings by Minimum Change of Preference Lists.
Algorithmica 62 (2013) 371-382.
http://dx.doi.org/10.3390/a6020371
Iommi, G., Jordan, T. and Todd, M.
Transience and multifractal analysis. Preprint.
Iommi, G., Jordan, T. and Todd, M.
Recurrence and transience for suspension flows. Isr. J. Math., to appear.
Iommi, G. and Todd, M.
Thermodynamic formalism for interval maps: inducing schemes. Dynamical Systems
28 (2013) 354-380
http://dx.doi.org/10.1080/14689367.2013.806732
Iommi, G. and Todd, M.
Transience in dynamical systems. Ergodic Theory and Dynamical Systems 33 (2013)
1450-1476.
http://dx.doi.org/10.1017/S0143385712000351
Iosevich, A.
[see: Bennett, M.]
Irving, R. W., Kwanashie, A., Manlove, D. F. and Sing, C. T. S.
Profile-based optimal matchings in the Student/Project Allocation problem. Preprint.
Irving, R. W. and McDermid, E.
Sex-equal stable matchings: complexity and exact algorithms. Algorithmica 68 (2014)
545-570.
http://dx.doi.org/10.1007/s00453-012-9672-0
Irving, R. W.
[see: Condon, A., Inoshita, T.]
Ivanova, A. O.
[see: Borodin, O.V.]
Ivrissimtzis, I. and Peyerimhoff, N.
Spectral representations of vertex transitive graphs, Archimedean solids and finite
Coxeter groups. Groups Geom. Dyn. 7 (2013) 591-615.
Iwama, K.
[see: Bansal, N., Inoshita, T.]
Jackson, B., Jordán, T. and Szabadka, Z.
Globally linked pairs of vertices in rigid frameworks. Submitted.
Jackson, B., McCourt, T. A. and Nixon, A.
Necessary Conditions for the Generic Global Rigidity of Frameworks on Surfaces.
Preprint.
Jackson, B. and Nguyen, V. H.
Graded Sparse Graphs and Body-Length-Direction Frameworks. Preprint.
Jacob, E. and Mörters, P.
Spatial preferential attachment networks: power laws and clustering coefficients. Ann.
Appl. Probab., to appear.
http://people.bath.ac.uk/maspm/spatialpa.pdf
Jacob, E. and Mörters, P.
A spatial preferential attachment model with local clustering. In: Algorithms and
Models for the Web Graph. Proceedings of the 10th International Workshop, WAW
2013. Lect. Notes. Comput. Sci. 8305 (2013) 14-25.
http://dx.doi.org/10.1007/978-3-319-03536-9_2
Jalsenius, M.
[see: Butman, A., Clifford, R.]
Janicijevic S.
[see: Brimberg, J.]
Jansen, S., Tate, S. J., Tsagkarogiannis, D. and Ueltschi, D.
Multispecies Virial Expansions. Comm. Math. Phys., to appear.
Jansen, S.
[see: Ercolani, N. M.]
Janson, S., Luczak, M. and Windridge, P.
Law of large numbers for the SIR epidemic on a random graph with given degrees.
Preprint.
Janson, S. and Severini, S.
An example of graph limits of growing sequences of random graphs. J. Comb. 4
(2013) 67-80
http://www2.math.uu.se/~svante/papers/sj269.pdf
Janson, S. and Sorkin, G. B.
VCG auction mechanism cost expectations and variances. Preprint.
http://www2.math.uu.se/~svante/papers/sj284.pdf
Janson, S.
Járai, A. A.
Sandpile models. Preprint.
Járai, A. A. and Nachmias, A.
Electrical resistance of the low dimensional critical branching random walk. Preprint.
Járai, A. A. and Werning, N.
Minimal configurations and sandpile measures. J. Theor. Probab., 27 (2014) 153-167
http://dx.doi.org/10.1007/s10959-012-0446-z
Jaworski, J.
[see: Hansen, J.]
Jeavons, P., Krokhin, A. and Zivny, S.
The complexity of valued constraint satisfaction. Bulletin of the EATCS, to appear.
http://www.cs.ox.ac.uk/Stanislav.Zivny/homepage/publications/jkz14.pdf
Jeavons, P., Scott, A. D. and Xu, L.
Feedback from nature: an optimal distributed algorithm for maximal independent set
selection and greedy colouring.
http://people.maths.ox.ac.uk/scott/Papers/feedback.pdf
Jeavons, P.
[see: Cohen, D. E.]
Jerrum, M. R. and Meeks, K.
The parameterised complexity of counting connected subgraphs and subgraph motifs.
Preprint.
Jerrum, M. R. and Meeks, K.
Some hard classes of parameterised counting problems. Preprint.
Jerrum, M. R.
[see: Bulatov, A., Cai, J-Y., Faben, J., Goldberg, L. A.]
Jeub, L. G. S.
[see: Balachandran, P.]
Jha, V.
The Ubiquity of the Orders of Fractional Semifields of Even Characteristic
Des. Codes Cryptography (2013)
http://dx.doi.org/10.1007/s10623-013-9795-6
Jiang, C.
[see: Coenen, F.]
Johnson, J. R..
Matchings and Hamilton Cycles with Constraints on Sets of Edges. Preprint.
Johnson, J. R, Leader, I. B. and Russell, P. A.
Set Systems Containing Many Maximal Chains. Preprint.
Johnson, M., van Leeuwen, A. J. and Paulusma, D.
Algorithms to measure diversity and clustering in social networks through dot product
graphs. ISAAC 2013. Lect. Notes Comput. Sci. 8283 (2013) 130-140.
http://dx.doi.org/10.1007/978-3-642-45030-3_13
Johnson, M., Patel, V., Paulusma, D, and Trunck, T.
Obtaining Online Ecological Colourings by Generalizing First-Fit. Theory Comput.
Syst. 54 (2014) 244-260.
http://dx.doi.org/10.1007/s00224-013-9513-9
http://www.durham.ac.uk/daniel.paulusma/Papers/Submitted/ecological.pdf
Johnson, M.
[see: Bonamy, M.. Feghail, C.]
Johnson, R. A. B.
[see: Haslegrave, J.]
Johnson, V.
[see: Czabarka, E.]
Jones, G. A.
Chiral covers of hypermaps. Preprint.
Jones, G. A.
Combinatorial categories and permutation groups. Preprint.
Jones, G. A.
Regular dessins with a given automorphism group. Preprint.
Jones, G. A.
Primitive permutation groups containing a cycle. Bull. Austral. Math. Soc. 89 (2014)
159-165.
http://dx.doi.org/10.1017/S000497271300049X
Jones, G. A.
[see: Downs, M.]
Jones, M., Kitaev, S. and Remmel, J.
Frame patterns in n-cycles. Preprint.
Jones, M., Lokshtanov, D., Ramanujan, M. S., Saurabh, S. and Suchý, O.
Parameterized Complexity of Directed Steiner Tree on Sparse Graphs. Lect. Notes
Comput. Sci. 8125 (2013) 671-682
http://dx.doi.org/10.1007/978-3-642-40450-4_57
Jones, M.
[see: Cohen, D. E., Crampton, J., Crowston, R., Gutin, G.]
Jones, S. A. M. and Thomas, R. M.
Formal languages, word problems of groups and decidability. In RP 2013, Lect.
Notes Comput. Sci. 8169 (2013) 146–158.
http://dx.doi.org/10.1007/978-3-642-41036-9_14
Jones, S. K., Perkins S. and Roach, P. A.
On the Number of Sudoku Grids. Mathematics Today 50 (2) (2014) 94-95.
Jones, S. K.
[see: Harris, L. H.]
Jones, T. G. F.
[see: Bloom, T.]
Jonušas, J.
[see: Hyde, J.]
Jordan, J.
Geometric preferential attachment in non-uniform metric spaces Electron J. Probab.
18 (2013) no 8, pp1-15.
http://ecp.ejpecp.org/article/view/2518/2341
Jordan, J. and Wade, A. R.
Phase transitions for random geometric preferential attachment graphs. Preprint.
Jordan, J.
[see: Cannings, C.]
Jordán, T.
[see: Jackson, B.]
Jordan, T.
[see: Iommi, G.]
Jost, J. and Liu, S.
Ollivier's Ricci curvature, local clustering and curvature dimension inequalities
on graphs. Discrete Comput. Geom. 51 (2014) 300-322
http://dx.doi.org/10.1007/s00454-013-9558-1
Jost, J.
[see: Hua, B.]
Kahl, N.
[see: Bauer, D.]
Kaiser, T.
[see: Broersma, H. J., Ferguson, D.]
Kambites, M.
[see; Gray, R.]
Kamiński, M.
[see: Belmonte, R., Fiala, J., Giannopoulou, A. C., Golovach, P. A.]
Kampermann, H.
[see: Bruss, D.]
Kang, R. J. and McDiarmid, C. J. H.
Colouring random graphs. Preprint.
Kang, R. J., Pach, J., Patel, V. and Regts, G.
A precise threshold for quasi-Ramsey numbers. Preprint.
Kang, R. J.
[see: Bordewich, M. J., Fountoulakis, N., Griffiths, S.]
Kantor, I.
Karasev, R.
[see: Blagojević, P.]
Kärkäinnen, J.
Kasprzyk, A.
[see: Akhtar, M., Brown, G., Coates, T.]
Katona, G. O. H.
Kazachkov, I.
[see: Casals-Ruiz, M.]
Keating, L.
Keedwell A. D.
Construction of bimagic squares using orthogonal Sudoku squares (Extended
Abstract}. Electron. Notes Discrete Math. 40 (2013)
Keedwell A. D.
A problem of sociable dining. Math. Gazette 97 (2013) 311-311.
Keevash, P.
The existence of designs. Preprint.
http://www.maths.ox.ac.uk/~keevash/papers/designs.pdf
Keevash, P., Knox, F. and Mycroft, R.
Polynomial-time perfect matchings in dense hypergraphs. Submitted.
http://www.maths.ox.ac.uk/~keevash/papers/DivBarrier.pdf
Keevash, P., Lenz, J. and Mubayi, D.
Spectral extremal properties for hypergraphs. Isr, J. Math., to appear. .
http://homepages.math.uic.edu/~mubayi/papers/spectralturan-art.pdf
Keevash, P., Li, Z., Mohar, B. and Reed, B. A.
Digraph girth via chromatic number. SIAM J. Disc. Math. 27 (2013) 693--696.
http://www.maths.ox.ac.uk/~keevash/papers/digraph-girth-chromatic-journal.pdf
Keevash, P. and Long, E. P.
Frankl-Rodl type theorems for codes and permutations. Submitted.
http://www.maths.ox.ac.uk/~keevash/papers/franklrodl.pdf
Keevash, P. and Mycroft, R.
A Geometric Theory for Hypergraph Matching. Mem. Am. Math. Soc, to appear.
http://www.maths.ox.ac.uk/~keevash/papers/geom-match-final.pdf
Keevash, P. and Mycroft, R.
A multipartite Hajnal-Szemerédi theorem. The Seventh European Conference on
Combinatorics, Graph Theory and Applications, CRM Series Vol. 16 (2013) 141-146.
http://web.mat.bham.ac.uk/~mycroftr/eurocomb2013.pdf 2
Keevash, P, Sudakov, B. and Verstraete, J.
On a conjecture of Erdős and Simonovits: Even cycles. Combinatorica, to appear.
http://www.maths.ox.ac.uk/~keevash/papers/oddcycle-bipartite.pdf
Keevash, P.
[see: Allen, P., Christofides, D., Hefetz, D.]
Keller, M.
Keller, M. T.
[see; Brightwell, G. R.]
Kelly, F. P. and Yudovina, E.
Lecture Notes on Stochastic Networks. CUP 2014.
http://www.statslab.cam.ac.uk/~frank/BOOKS/sn.html
Kelsey, T. W.
[see: Distler, A.]
Kendall, M., Martin, K. M., Ng, S.-L., Paterson, M. B. and Stinson, D. R.
Broadcast-enhanced Key Predistribution Schemes. ACM Transactions on Network
Sensors, to appear.
Kern, W.
[see: Biró, P.]
Kerov, S.
[see: Gnedin, A.]
Kettle, N.
[see: Bushaw, N.]
Kettleborough. G.
[see: Huber, K. T.]
Key, J. D., Mavron, V. C. and McDonough, T. P.
Codes from Hall planes of even order. J. Geom, to appear.
http://dx.doi.org/10.1007/s00022-013-0189-8
Key, J. D.
2
A more detailed version of this paper is still under review: see
[see: Ghinelli, D.]
Kharlampovich, O., Mohajeri, A., Taam, A. and Vdovina, A.
Quadratic Equations in Hyperbolic Groups are NP-complete. Preprint.
Khosla, M.
[see: Fountoulakis, N.]
Kim, R.
King, A. D.
[see: Christofides, D.]
King, R. C.
[see: Hamel, A. M.]
King, O. H. and Siciliano, A.
Translation ovoids of unitary polar spaces. Adv. Geom., to appear.
Kirkland, S. and Severini, S.
alpha-Kuramoto partitions: graph partitions from the frustrated Kuramoto model
generalise equitable partitions. Preprint.
Kitaev, S.
On graphs with representation number 3. Preprint.
Kitaev, S. and de Mier, A.
Enumeration of fixed points of an involution on
trees. Graphs Comb., to
appear.
Kitaev, S., de Mier, A. and Noy, M.
On the number of self-dual rooted maps, Eur. J. Comb. 35 (2014) 377-387.
Kitaev, S. and Remmel, J.
Quadrant marked mesh patterns in alternating permutations II. J. Comb. 4 (2013)
31-65.
https://personal.cis.strath.ac.uk/sergey.kitaev/index_files/Papers/MMaltII.pdf
Kitaev, S. and Remmel, J.
The 1-box pattern on pattern-avoiding permutations. J. Integer Seq. 17 (2014) Article
14.3.3, 19 pp.
Kitaev, S., Salimov, P., Severs, C. and Úlfarsson, H.
Restricted rooted non-separable planar maps and some pattern avoiding permutations.
Discrete Appl. Math., to appear.
https://personal.cis.strath.ac.uk/sergey.kitaev/index_files/Papers/planarMaps.pdf
Kitaev, S.
[see: Atminas, A., Claesson, A., Collins, A., Ehrenborg, R., Gent, I. P., Jones, M.]
Kitson, D.
Finite and infinitesimal rigidity with polyhedral norms. Preprint.
Kitson, D. and Power, S. C.
Infinitesimal rigidity for non-Euclidean bar-joint frameworks. Bull. Lond. Math. Soc.,
to appear.
Kitson, D. and Power, S. C.
The rigidity of infinite graphs. Preprint.
Kitson, D.
[see: Badri, G.]
Kittipassorn, T. and Narayanan, B .
Approximations to exactly m-coloured complete infinite subgraphs. Preprint.
https://www.dpmms.cam.ac.uk/~bp338/pdf/approx_col.pdf
Kittipassorn, T. and Narayanan, B .
A canonical Ramsey theorem for exactly m-coloured complete subgraphs. Comb.
Probab. Comput. 23 (2014) 102-115.
https://www.dpmms.cam.ac.uk/~bp338/pdf/canon_col.pdf .
Kittipassorn, T.
[see: Bollobás, B., Falgas-Rouvry, V.]
Klazar, M., Loebl, M. and Moffatt, I.
The Potts model and chromatic functions of graphs. Annales de l'Institut Henri
Poincaré D 1 (2014) 47-60.
http://www.personal.rhul.ac.uk/uxah/001/papers/pottschrom.pdf
Klimošova, T. and Král’, D.
Hereditary properties of permutations are strongly testable. Proc. 25th SODA.
http://dx.doi.org/10.1137/1.9781611973402.86
Klimošová, T.
[see: Dvořák, Z., Glebov, R.]
Knor, M. and Širáň, J.
Smallest Vertex-Transitive Graphs of Given Degree and Diameter. J. Graph Theory,
75 (2014) 137-149.
Knor, M.
[see: Grannell, M. J.]
Knox, F., Kühn, D. and Osthus, D.
Edge-disjoint Hamilton cycles in random graphs. Random Stuct. Algorithms, to
appear.
http://web.mat.bham.ac.uk/D.Kuehn/Exact_Ham_9.pdf
Knox, F.
[see: Keevash, P.]
Koch, S.
[see: Haslegrave, J.]
Kohayakawa, Y.
[see: Allen, P., Böttcher, J.. Dellamonica, D.]
Kolesko, K.
Kolmogorov, V., Thapper, J. and Zivny, S.
The power of linear programming for general-valued CSPs. Preprint.
Kolmogorov, V.
[see: Huber, A.]
Konovalov, A. B.
[see: Gent, I. P.]
Konyagin, S. and Rudnev, M.
New sum product type estimates. SIAM J. Discrete Math. 27 (2013) 973–990.
http://dx.doi.org/10.1137/120886418
Konyagin, S. V.
Koolen, J.
[see: Dress, A.]
Kopelowitz, T.
[see: Bille, P.]
Korándi, D.
[see: Falgas-Ravry, V.]
Korpelainen, N., Lozin, V. V. and Mayhill, C.
Split Permutation Graphs. Graphs. Comb. 30 (2014) 633-646.
http://dx.doi.org/10.1007/s00373-013-1290-3
Korpelainen, N., Lozin, V. V. and Purcell, C.
Dominating induced matchings in graphs without a skew star. J. Discrete Algorithms,
to appear.
Korpelainen, N., Lozin, V. V. and Razgon, I.
Boundary Properties of Well-Quasi-Ordered Sets of Graphs. Order 30 (2013)
723-735.
http://dx.doi.org/10.1007/s11083-012-9272-2
Korpelainen, N.
[see: Atminas, A., Brignall, R.]
Kozlik, A.
[see: Drápal, A.]
Kozlowski, K. K. and Sklyanin, E. K.
Combinatorics of generalized Bethe equations.Letters in Mathematical Physics 103
(2013) 1047-1077.
http://dx.doi.org/10.1007/s11005-013-0630-9
Kozma, G.
[see: Berestycki, N., Grimmett, G. R.]
Král’, D. and Pikhurko, O.
Quasirandom permutations are characterised by their 4-point densities. Geom. Funct.
Anal., Geom. Funct. Anal. 23 (2013) 570–579
http://dx.doi.org/10.1007/s00039-013-0216-9
http://homepages.warwick.ac.uk/~maskat/Papers/qrandperm.pdf
Král’, D.
[see: Christofides, D., Cummings, J., Dvořák, Z., Ferguson, D., Glebov, R., van den
Heuvel, J., Hladký, J., Klimošova, T.]
Kratsch, D.
[see: Cochefert , M., Couturier, J.-F., Golovach, P. A.]
Krattenthaler, C. and Müller, T. W.
A Riccati differential equation and free subgroup numbers for lifts of PSL2(Z) modulo
powers of primes. J. Comb. Theory Ser. A 120 (2013) 2039-2063.
http://www.mat.univie.ac.at/~kratt/artikel/psl2zmod.html
Generalised Apéry numbers modulo 9. Preprint.
Periodicity of free subgroup numbers modulo prime powers. Preprint.
A method for determining the mod-3k behaviour of recursive sequences. Preprint.
Krivelevich, M., Reichman, D. and Samotij, W.
Smoothed analysis on connected graphs. Preprint.
https://www.dpmms.cam.ac.uk/~ws299/papers/tree-exp-journal.pdf
Krivelevich, M. and Samotij, W.
Long paths and cycles in random subgraphs of -free graphs. Electron J. Comb. 21
(2014) P1.30.
Krivelevich, M.
[see: Ben-Shimon, S., Clemens, D., Ferber, A., Glebov, R.]
Krokhin, A.
[see: Dalmau, V., Huber, A., Jeavons, P.]
Krysta, P., Manlove, D., Rastagari, B. and Zhang, J.
Size versus truthfulness in the House Allocation problem, to appear in Proceedings of
EC 2014, ACM, 2014.
http://www.mdpi.com/1999-4893/6/2/371/pdf
Krysta, P.
[see: Goldberg, L. A.]
Kubica, M.
Kühn, D., Lapinskas, J. , Osthus, D. and Patel, V.
Proof of a conjecture of Thomassen on Hamilton cycles in highly connected
tournaments. Proc. Lond. Math. Soc., to appear.
http://web.mat.bham.ac.uk/D.Kuehn/tournaments25.pdf
Kühn, D., Lo, A. and Osthus, D.
Proof of the 1-factorization and Hamilton decomposition conjectures IV: exceptional
systems for the two cliques case. Preprint.
http://web.mat.bham.ac.uk/D.Kuehn/1factor_2cli_es4.pdf
Kühn, D., Lo, A., Osthus, D. and Staden, K.
The robust component structure of dense regular graphs and applications. Preprint.
http://web.mat.bham.ac.uk/D.Kuehn/ham3conn_36.pdf
Kühn, D., Lo, A., Osthus, D. and Staden, K.
Solution to a problem of Bollobas and Häggkvist on Hamilton cycles in regular
graphs. Preprint.
http://web.mat.bham.ac.uk/D.Kuehn/ham3connex16.pdf
Kühn, D., Lo, A., Osthus, D. and Treglown, A.
Proof of the 1-factorization and Hamilton decomposition conjectures I: the two
cliques case. Preprint.
http://web.mat.bham.ac.uk/D.Kuehn/1factor_2cli31.pdf
Kühn, D. and Osthus, D.
Hamilton decompositions of regular expanders: applications..J. Comb. Theory Ser B
104 (2014) 1-27.
http://web.mat.bham.ac.uk/D.Kuehn/kellyapplication12.pdf
Decompositions of complete uniform hypergraphs into Hamilton Berge cycles.
Preprint.
http://web.mat.bham.ac.uk/D.Kuehn/bergecycledec5.pdf
Hamilton cycles in graphs and hypergraphs: an extremal perspective. Preprint.
http://web.mat.bham.ac.uk/D.Kuehn/icmsurvey6.pdf
Kühn, D., Osthus, D. and Patel, V.
A domination algorithm for {0,1}-instances of the travelling salesman problem.
Preprint.
http://web.mat.bham.ac.uk/D.Kuehn/TSP15.pdf
Kühn, D., Osthus, D. and Townsend, T.
Fractional and integer matchings in uniform hypergraphs. Eur. J. Comb. 38 (2014)
83-96.
http://web.mat.bham.ac.uk/D.Osthus/HypergraphMatchings3.pdf
Kühn, D., Osthus, D. and Townsend, T.
Proof of a tournament partition conjecture and an application to 1-factors with
prescribed cycle lengths. Combinatorica, to appear.
http://web.mat.bham.ac.uk/D.Kuehn/TournamentConnectivity6.pdf
Kühn, D., Osthus, D., Townsend, T. and Zhao, Y.
On the structure of oriented graphs and digraphs with forbidden tournaments or
cycles.
http://web.mat.bham.ac.uk/D.Osthus/OrientedHFreeGraphs4.pdf
Kühn, D.
[see: Csaba, B., Hefetz, D., Knox, F.]
Kupec, M.
[see: van den Heuvel, J.]
Kurauskas, V. and McDiarmid, C. J. H.
Random graphs containing few disjoint excluded minors. Random Struct. Algorithms
44 (2014) 240-268.
http://web.vu.lt/mif/v.kurauskas/files/2013/08/few-disj-excl-minors-2012-04-10.pdf
Kuske, D.
[see: Corran, A.]
Kwanashie, A. and Manlove, D. F.
An Integer Programming approach to the Hospitals / Residents problem with Ties, to
appear in Proceedings of OR 2013 (2014).
Kwanashie, A.
[see: Askalidis, G., Irving, R. W.]
Kwek, L. C.
[see: Bruss, D.]
Labbate, D.
[see: Abreu, M.]
LaCrois, M. A.
[see: Cibulka, J.]
Landau, G. M.
[see: Amit, M., Crochemore, M.]
Lapinskas, J.
[see: Cyman, J., Hefetz, D., Kühn, D.]
_
Launois, S. and Lenagan, T. H.
Efficient recognition of totally nonnegative matrix cells. Found. Comput. Math., 14
(2014) 371-387.
http://dx.doi.org/10.1007/s10208-013-9169-5
Launois, S.
{see: Grabowski, J.]
Law, H.-F. and McDiarmid, C. J. H.
Independent sets in graphs with given minimum degree. Combin. Probab. Comput. 22
(2013) 8 74-884.
http://dx.doi.org/10.1017/S0963548313000369
Law, H.-F.
[see: Chan, K.-Y.]
Lê, Th. H. and Wolf, J.
Polynomial configurations in the primes. Int. Math. Res. Not. 2013.
http://dx.doi.org/10.1093/imrn/rnt169
Leader, I. B. and Long, E. P.
Long paths and cycles in subgraphs of the cube. Combinatorica 33 (2013) 395-428.
http://dx.doi.org/10.1007/s00493-013-2736-1
Long geodesics in subgraphs of the cube. Discrete Math. 326 (2014) 29-33.
Forbidding a Set Difference of Size 1. Discrete Appl. Math. 169 (2014) 219-224.
Tilted Sperner Families. Discrete Appl. Math. 163 (2014) 194-198.
Leader, I. B. and Tan, T. S.
Connected Colourings of Complete Graphs and Hypergraphs. Preprint.
Leader, I. B.
[see: Barber, B., Bollobás, B., Davenport, D., Johnson, J. R.]
Le Borgne, Y.
[see: Aval, J.-C.]
Lee, C.
[see: Conlon, D.]
Lee, J. D.
Lee, S.
[see: Dellamonica, D.]
van Leeuwen, A. J.
[see: Johnson, M.]
Lefevre, J. G.
[see: Donovan, D. M.]
Lehel, J.
Leinster, T.
The magnitude of a graph. Preprint.
Lenagan, T. H.
[see: Launois, S.]
Lenz, D.
Lenz, J.
[see: Keevash, P.]
Lenz, M.
Lattice points in polytopes, box splines, and Todd operators. Preprint.
Lenz, M.
Interpolation, box splines, and lattice points in zonotopes. Int. Math. Res. Not. , to
appear. http://arxiv.org/pdf/1211.1187v1.pdf
Lenz, M.
The f-vector of a representable-matroid complex is log-concave. Adv. Appl. Math. 51
(2014) 543-545.
Letchford, A. N.
[see: Aliev, I., Giandomenico, M.]
Letzter, S.
[see: Falgas-Ravry, V.]
Lewenstein, N.
[see: Butman, A.]
Lewis, R. R.
The degree-diameter problem for circulant graphs of degree 8 and 9. Preprint.
Leyton-Brown, K.
[see: Condon, A.]
Li, Z.
[see: Grimmett, G. R., Keevash, P.]
Lidický, D.
[see; Balogh, J.]
Liebeck, M. W.
Probabilistic and asymptotic aspects of finite simple groups. In: Probabilistic group
theory, combinatorics and computing, Springer Lecture Notes in Math. 2070 (2013),
1-34.
http://www2.imperial.ac.uk/~mwl/galway2.pdf
Liebeck, M. W.
[see: Giudici, M.]
Liebenau, A.
[see: Clemens, D., Fox, J.]
Lignos, I.
[see: Bonamy, M.]
Linden, N., Mosonyi, M. and Winter, A.
The structure of Renyi entropic inequalities. Proc. R. Soc. Lond., Ser. A, Math. Phys.
Eng. Sci. (2013)
http://dx.doi.org/10.1098/rspa.2012.0737
Linial, N.
[see: Ellis, D.]
Linke, E.
[see: Aliev, I.]
Linton, S. A.
[see: Gent, I. P.]
Liu, H., Pikhurko, O. and Sousa, T.
Monochromatic Clique Decompositions of Graphs. Preprint.
http://homepages.warwick.ac.uk/staff/O.Pikhurko/Papers/general-mono-clique.pdf
Liu, S.
Multi-way dual Cheeger constants and spectral bounds of graphs. Preprint.
Liu, S.
[see: Hua, B ., Jost, J.]
Lo, A.
A note on the minimum size of k-rainbow connected graphs. Discrete Math., to
appear.
Lo, A.
A Dirac type condition for properly coloured paths and cycles. J. Graph Theory 76
(2014) 60-87.
Lo, A.
Properly coloured Hamiltonian cycles in edge-coloured complete graphs.
Combinatorica, to appear.
Lo, A.
An edge-coloured version of Dirac's Theorem. SIAM J. Discrete Math. 28 (2014)
18-36.
http://dx.doi.org/10.1137/120903750
http://web.mat.bham.ac.uk/S.A.Lo/pub/90375.pdf .
Lo, A. and Markström, K.
factors in hypergraphs via absorption. Graphs Comb. 30 (2014) 389-393
http://dx.doi.org/10.1007/s00373-014-1410-8
Lo, A. and Tan, T. S.
A note on rainbow matchings in properly edge-coloured graphs. Graphs Comb.
(2014) 389-393.
http://dx.doi.org/10.1007/s00373-014-1410-8
Lo, A.
[see: Balogh, J., Csaba, B., Cyman, J., Diemunsch, J., Kühn, D.]
Lockett, D. K.
Connected-homomorphism-homogeneous graphs. J. Graph Theory, to appear.
Lockett, D. K. and Macpherson, H. D.
Orbit-equivalent infinite permutation groups. J. Algebr. Comb. 38 (2013) 973-988.
http://dx.doi.org/10.1007/s10801-013-0434-0
Loebl, M.
[see: Klazar, M.]
Lo Faro, G.
Lokshtanov, D.
[see: Belmonte, R., Giannopoulou, A. C., Jones, M.]
Long, E. P.
Forbidding intersection patterns between layers of the cube. Submitted.
Long, E. P.
[see: Barber, B., Leader, I. B., Keevash, P.]
Lopez Peña, J. and Touchette, H.
A network theory analysis of football strategies. In C. Clanet (ed), Sports Physics:
Proc. Euromech Physics of Sports Conf., Éditions de l'École Polytechnique,
Palaiseau, 2013.
Lóránt Nagy, Z.
[see: Grzesik, A.]
Loureiro, A. F. and Zenq, J.
q-Differential equations for q-classical polynomials and q-Jacobi-Stirling numbers,
Preprint.
Lovegrove, G. J.
Odd-cycle systems with prescribed automorphism groups. Discrete Math. 314 (2014)
6-13.
Lovegrove, G. J.
Lozin, V. V. and Milanic, M.
Critical properties of graphs of bounded clique-width. Discrete Math. 313 (2013)
1035–1044.
Lozin, V. V., Milanic, M. and Purcell, C.
Graphs without large apples and the maximum weight independent set problem.
Graphs Comb. 30 (2014) 395-410
http://dx.doi.org/10.1007/s00373-012-1263-y
Lozin, V. V., Monnot, J. and Ries, B.
On the maximum independent set problem in subclasses of subcubic graphs.
Lect. Notes Comput. Sci. 8288 (2013) 314-326.
http://dx.doi.org/10.1007/978-3-642-45278-9_27
Lozin, V. V., Mosca, R. and Purcell, C.
Sparse regular induced subgraphs in 2P3-free graphs. Discrete Optmi. 10 (2013)
304-309.
http://dx.doi.org/10.1016/j.disopt.2013.08.001
Lozin, V. V., Mosca, R. and Purcell, C.
Independent domination in finitely defined classes of graphs: polynomial algorithms,
Discrete Appl. Math., to appear.
Lozin, V. V. and Purcell, C.
Coloring vertices of claw-free graphs in three colors. J. Comb. Optim. (2013)
http://dx.doi.org/10.1007/s10878-012-9577-5
Lozin, V, V. and Zamaraev, V.
Boundary properties of factorial classes of graphs. J. Graph Theory, to appear.
Lozin, V. V.
[see: Atminas, A., Brignall, R., Chikalov, I., Collins, A., Dąbrowski, K.K.,
Korpelainen, N.]
Lozina, I.
[see: Chikalov, I.]
Lubetsky, E.
[see: Cooper, C.]
Lucchini, A.
[see: Detomi, E.]
Luczak, M. J.
[see: Brightwell, G. R., Janson, S.]
Łuczak, T.
[see: Bednarska-Bzdega, M.]
Máčajová, E.
MacCaig, M.
[see: Butkovi , P. ]
Macchiavello, C.
[see: Bruss, D.]
Maclagan, D.
Introduction to tropical algebraic geometry. AMS Contemporary Mathematics
Volume, "Tropical Geometry and Integrable Systems", to appear.
http://arxiv.org/pdf/1207.1925 ó
Maclagan, D. and Rincón, E. F.
Tropical schemes, tropical cycles, and valuated matroids. Preprint.
Macpherson, H. D.
[see: Aschenbrenner, M., Bodirsky, M., Lockett, D. K.]
Maffray, F.
[see: Esperet, L.]
Mahoney, M. W.
Majid, S.
Noncommutative Riemannian Geometry on Graphs. Journal of Geometry and
Physics. 69 (2013) 74-93
Van Maldeghem, H. and Schillewaert, J.
Imbrex geometries. Preprint.
Van Maldeghem, H. and Schillewaert, J.
Quadratic Veronesean caps. Bull. Belgian Math. Soc. 20 (2013) 19–25
http://jeroenschillewaert.com/incs/quadric_veronesean_caps-preprint.pdf
Maltcev, V.
[see: Gray, R.]
Mancinska, L., Scarpa, G. and Severini, S.
A Generalization of Kochen-Specker Sets Relates Quantum Coloring to
Entanglement-Assisted Channel Capacity. Preprint.
Mancinska, L., Scarpa, G. and Severini, S.
New Separations in Zero-Error Channel Capacity Through Projective Kochen–
Specker Sets and Quantum Coloring. IEEE Trans. Inf. Theory 59 (2013) 4025-4032.
http://dx.doi.org/10.1109/TIT.2013.2248031
Mancinska, L.
[see: Cubitt, T.]
Manjunath, D.
[see: Ganesh, A.]
Manlove, D. F. and O’Malley, G.
Paired and altruistic kidney donation in the UK: Algorithms and experimentation.
Proceedings of SEA2012. .Lect. Notes. Comput. Sci. 7276 (2012) 271-282.
http://www.dcs.gla.ac.uk/publications/paperdetails.cfm?id=9383
Manlove, D. F.
[see: Askalidis, G., Biró, P., Irving, R. W., Krysta, P., Kwanashie, A. ]
Manners, F. J.
A solution to the pyjama problem. Preprint.
Manners, F. J.
Periodic nilsequences and inverse theorems on cyclic groups. Preprint.
Manners, F. J.
[see: Eberhard, S.]
Manolescu, I.
[see: Duminil-Copin, H., Grimmett, G. R.]
Mansour, T.
[see: Banerji, C. R. S.]
Marchant, E.
[see: Falgas-Rouvry, V.]
Marckert, J.-F.
[see: Bárány, I.]
Markström, K.
[see: Boixo, S., Christofides, D., Lo, A.]
Marsh, R. J. and Scott, J.
Twists of Plücker coordinates as dimer partition functions. Preprint .
Marsh, R. J. and Schroll, S.
A circular order on edge-coloured trees and RNA m-diagrams, Adv. Appl. Math. 54
(2014) 11-26.
http://www1.maths.leeds.ac.uk/~marsh/research_articles/pp35.pdf
Martin, B. and Stacho, J.
Constraint Satisfaction with Counting Quantifiers 2. CSR2014, to appear.
Martin, J. B.
[see: Angel, O., Holroyd, A. E.]
Martin, K. M.
[see: Kendall, M.]
Martin, P. P. and Mazorchuk, V.
Partitioned equivalence relations.. Mathematica Scandanavica 113 (2013) 30-52.
http://www.mscand.dk/issue.php?year=2013&volume=113&issue=1
Martin, R. R. and Skokan, J.
Asymptotic multipartite version of the Alon-Yuster theorem. Submitted.
Martin, R.
[see: Chebolu, P.]
Martinelli, F.
[see: Caputo, P.]
Mathé, A.
[see: Hladký, J.]
Matoušek, J.
[see: Bárány, I.]
Mavron, V. C.
[see: Key, J. D.]
Mayhew, D.
[see: Chun, C.]
Mayhill, C.
[see: Korpelainen, N.]
Mazorchuk, V.
[see: Martin, P. P.]
McAslan, H.
McConnell, G.
Some non-standard ways to generate SIC-POVMs in dimensions 2 and 3. Preprint.
McCourt, T. A.
Biembedding a Steiner triple system with a hamilton cycle decomposition of a
complete graph. J. Graph Theory, to appear.
McCourt, T. A.
[see: Blackburn, S. R., Cavanagh, N. J., Donovan, D. M., Grannell, M. J., Jackson, B.]
McCreesh, C. and Prosser, P.
Multi-Threading a State-of-the-Art Maximum Clique Algorithm. Algorithms 6
(2013): 618-635.
http://eprints.gla.ac.uk/86452/1/86452.pdf
The Shape of the Search Tree for the Maximum Clique Problem, and the Implications
for Parallel Branch and Bound. Preprint.
Greedy Graph Colouring is a Misleading Heuristic. Preprint.
An Exact Branch and Bound Algorithm with Symmetry Breaking for the Maximum
Balanced Induced Biclique Problem. Proceedings of CPAIOR 2014. To appear in
Lect. Notes. Comput. Sci.
McDermid, E.
[see: Irving, R. W.]
McDiarmid, C. J. H.
Connectivity for bridge-alterable graph classes. Preprint.
McDiarmid, C. J. H.
Random graphs from a weighted minor-closed class.
McDiarmid, C. J. H.
Connectivity for random graphs from a weighted bridge-addable class. Electron J.
Comb. 19 (2012) P53.
McDiarmid, C. J. H. and Müller, T.
The number of disk graphs. Eur. J. Comb. 35 (2014) 413-431.
http://homepages.cwi.nl/~mueller/Papers/countingDGs.pdf
McDiarmid, C. J. H. and Skerman, F.
Modularity in random regular graphs and lattices. Electron. Notes. Discrete Math. 43
(2013) 431-437.
McDiarmid, C. J. H. and Weller, K.
Relatively Bridge-Addable Classes of Graphs. In LATIN 2014. Lect. Notes Comput.
Sci. 8392 (2013) 391-398
http://dx.doi.org/10.1007/978-3-642-54423-1_34
McDiarmid, C. J. H.
[see: Fountoulakis, N., Kang, R. J., Kurauskas, V., Law, H.-F.]
McDonough, T. P., Shaw, R. and Topalova, S.
Classification of book spreads in PG(5,2). Note di Matematica 33 (2) (2013) 43-64
http://www.hull.ac.uk/php/masrs/2013/BSprPG52.pdf
McDonough, T. P.
[see: Ghinelli, D., Key, J. D.]
McDowell, A.
[see: Ellis-Monaghan, J. A., Gerke, S.]
McInroy, J. F.
Biaffine polar spaces. Adv. Geom. 13 (2013) 449-469.
http://dx.doi.org/10.1515/advgeom-2012-0034
McKay, B. D.
[see: Aldred, R. E. L.]
McMullen, P.
Regular Polytopes of Nearly Full Rank: Addendum. Discrete Comp. Geom. 49 (2013)
703-705.
http://dx.doi.org/10.1007/s00454-013-9487-z
McNamara, P. and Steingrímsson, E.
On the topology of the permutation pattern poset. Preprint.
McQuillan, C.
[see: Bulatov, A., Göbel, A.]
Meeks, K.
The challenges of unbounded treewidth in parameterised subgraph counting problems.
Preprint.
http://www.maths.qmul.ac.uk/~kmeeks/preprints/unbdd_treewidth.pdf
Meeks, K. and Scott, A. D.
Spanning trees and the complexity of flood-filling games. Theory Comput. Syst.
(2013).
http://dx.doi.org/10.1007/s00224-013-9482-z
http://www.maths.qmul.ac.uk/~kmeeks/preprints/spanning_trees_j.pdf
Meeks, K. and Scott, A. D.
The complexity of Free-Flood-It on 2xn boards; Theor. Comput. Sci. 500 (2013)
25-43.
http://www.maths.qmul.ac.uk/~kmeeks/preprints/2xn.pdf
Meeks, K.
[see: Jerrum, M. R.]
Menezes, N. E., Quick, M. R. and Roney-Dougal, C. M.
The probability of generating a finite simple group. Isr J. Math. 198 (2013) 371-382.
http://dx.doi.org/10.1007/s11856-013-0034-7
Mertzios, G. B.
The recognition of simple-triangle graphs and of linear-interval orders is polynomial.
In Proceedings of the 21st ESA. Lect. Notes Comput. Sci. 8125 (2013) 719-730.
http://dx.doi.org/10.1007/978-3-642-40450-4_61
Mertzios, G. B.
The recognition of simple-triangle graphs and of linear-interval orders is easy.
Mertzios, G. B.
An intersection model for multitolerance graphs: Efficient algorithms and hierarchy.
Algorithmica, to appear.
http://www.dur.ac.uk/george.mertzios/papers/Jour/Jour_Multitolerance.pdf
Mertzios, G. B.
The recognition of triangle graphs. Theor. Comput. Sci. 438 (2012) 34-47.
http://www.dur.ac.uk/george.mertzios/papers/Jour/Jour_Triangle-Recognition.pdf
Mertzios, G. B. and Spirakis, P. G.
Strong Bounds for Evolution in Undirected Graphs. ICALP 2013 Lect Notes. Comput.
Sci.
http://dx.doi.org/10.1007/978-3-642-39212-2_58
Mertzios, G. B.
[see: Bezakova, I., Bousquet, N., Chatzigiannakis, I., Diaz, J., Felsner, S.]
Michail, O. and Spirakis, P. G.
Simple and Efficient Local Codes for Distributed Stable Network
Construction. Preprint.
Michail, O.
[see: Chatzigiannakis, I.]
de Mier, A.
[see: Claesson, A., Kitaev, S.]
Mikalacki, M.
[see: Grzesik, A.]
Miklós, I.
[see: Apostolico, A.]
Milanic, M.
[see: Lozin, V. V.]
Miller, A.
[see: Codish, M.]
Miller, M.
[see: Balbuena, C.]
Mitchell, J. D.
[see: East, J., Gray, R., Hyde, J.]
Mitsche, D.
Miyazaki, S.
[see: Inoshita, T.]
Mladenovic N.
[see: Brimberg, J., Cafieri, S., Grujicic I.]
Moci, L.
[see: Fink, A.]
Moffatt, I.
Exxcluded minors and the graphs of knots. Preprint.
http://www.personal.rhul.ac.uk/uxah/001/papers/knotmi.pdf
Moffatt, I.
[see: Chun, C., Ellis-Monaghan, J. A., Huggett, S.., Klazar, M.]
Mohajeri, A.
[see: Kharlampovich, O.]
Mohar, B.
[see: Keevash, P.]
Molla, T.
[see: Balogh, J.]
Mönch, C.
[see: Dereich, S.]
Monnot, J.
[see: Lozin, V. V.]
Montemanni, R. and Smith, D. H.
Permutation codes with specified packing radius. Des. Codes Cryptography 69 (2013)
95-106.
http://dx.doi.org/10.1007/s10623-012-9623-4
Montemanni, R., Smith, D. H. and Tulpan, D.
Thermodynamic post-processing versus GC-content pre-processing for DNA codes
satisfying the Hamming distance and reverse-complement constraints. IEEE/ACM
Transactions on Computational Biology and Bioinformatics. Online First (13 January
2014).
http://doi.ieeecomputersociety.org/10.1109/TCBB.2014.2299815
https://ieeexplore.ieee.org/xpl/tocresult.jsp?isnumber=4359833
Montgomery, R.
Almost all friendly matrices have many obstructions. Preprint.
http://arxiv-web.arxiv.org/pdf/1403.3548v1
Montgomery, R.
Logarithmically-small Minors and Topological Minors. Preprint.
http://arxiv-web.arxiv.org/pdf/1309.7886v1
Moore, N.C.A. and Prosser, P.
The Ultrametric Constraint and its Application to Phylogenetics. Preprint.
Morayne, M.
Morris, R. D.
[see: Ahlberg, D., Alon, N., Balogh, J., Fiz Pontiveros, G., Garrod, B. J., Green, B. J.]
Morrison, N., Noel, J. and Scott, A. D.
On Saturated k-Sperner Systems. Preprint.
http://people.maths.ox.ac.uk/scott/Papers/saturatedsperner.pdf
Mörters, P.
[see: Dereich, S., Eckhoff, M., Jacob, E.]
Mortimer, P. R. G and Prellberg, T.
A Bijection on Bilateral Dyck Paths. Australas. J. Comb. 59 (2014) 72-80
http://www.maths.qmul.ac.uk/~tp/papers/pub087.pdf
Mortimer, P. R. G and Prellberg, T.
On the Number of Walks in a Triangular Domain. Submitted.
http://www.maths.qmul.ac.uk/~tp/papers/pub097pre.pdf
Mosca, R.
[see: Lozin, V. V.]
Moshkov, M.
[see: Chikalov, I.]
Mosonyi, M.
[see: Linden, N.]
Mota, G. O.
[see: Allen, P.]
Moulton, V.
[see: Bastkowski, S., Czabarka, E., Dress, A., Huber, K. T., van Iersel, L.]
Mubayi, D.
[see : Keevash, P.]
Mucha, M.
[see; Cygan, M.]
Mucha, P. J.
Muciaccia, G.
[see: Crowston, R., Gutin, G.]
Mullen, G. L.
[see: Huczynska, S.]
Müller, H. and Wilson, S.
Characterising subclasses of perfect graphs with respect to partial orders related to
edge contraction. CTW 2013.
Müller, H. and Wilson, S.
An FPT Certifying Algorithm for the Vertex-Deletion Problem. IWOCA 2013: Lect.
Notes Comput. Sci. 8288 (2013) 468-472.
http://dx.doi.org/10.1007/978-3-642-45278-9_45
Müller, H.
[see: Dąbrowski, K. K., Abu Khzam, F. N.]
Müller, T.
[see: Bode, M., McDiarmid, C. J. H.]
Müller, T. W.
Some congruences associated with the equation
in certain finite
semigroups. Preprint.
http://www.maths.qmul.ac.uk/~twm/SemiCongs.pdf
Müller, T. W.
[see: Kauers, M., Krattenhaler, C.]
Murphy, B., Roche-Newton, O. and Shkredov, I. D.
Variations on the Sum-Product Problem. Preprint.
Mustata, I.
[see: Felsner, S.]
Mycroft, R.
Packing k-partite k-uniform hypergraphs. Preprint.
Mycroft, R.
[see: Balogh, J., Keevash, P.]
Nabijou, N.
[see: Coates, T.]
Nachmias, A.
[see: Járai, A. A.]
Nagase, T.
[see: Inoshita, T.]
Nagel, L.
[see: Berenbrink, P.]
Naor, A.
[see: Ferber, A., Grzesik, A.]
Narayanan, B. P.
Exactly m-coloured complete infinite subgraphs. J. Comb. Theory Ser. B . 106 (2014)
Narayanan, B. P.
[see: Balister, P. N., Bollobás, B., Falgas-Rouvry, V., Kittipasorn, T.]
Naves, H. and Pikhurko, O.
How unproportional must a graph be? Preprint.
http://homepages.warwick.ac.uk/staff/O.Pikhurko/Papers/general-mono-clique.pdf
Nazarov, M. L. and Sklyanin, E. K.
Macdonald operators at infinity. J. Algebr. Comb. 2013.
http://dx.doi.org/10.1007/s10801-013-0477-2
Sekiguchi-Debiard operators at infinity. Commun. Math. Phys. 324 (2013) 831-849.
http://dx.doi.org/10.1007/s00220-013-1821-z
Integrable Hierarchy of the Quantum Benjamin-Ono Equation. SIGMA 9 (2013), 078,
14 pages
Neunhöffer, M. and Praeger, C. E.
Sporadic neighbour-transitive codes in Johnson graphs. Des. Codes Crypography
July 2013.
http://dx.doi.org/10.1007/s10623-013-9853-0
Nevo, A.
[see: Bauer, D.]
Newman, M.
[see: Chun, C.]
Ng, S.-L.
[see: Kendall, M.]
Nguyen, H. S.
[see: Chikalov, I.]
Nguyen, V. H.
[see: Jackson, B.]
Nicol, M.
[see: Aimino, R.]
Nightingale, P.
[see: Gent, I. P.]
Nikolaou, S.
[see: Chatzigiannakis, I.]
Nikoletseas, S., Panagopoulou, P. N., Raptopoulos, C. and Spirakis, P. G.
On the Structure of Equilibria in Basic Network Formation. FCT 2013. Lect. Notes.
Comput. Sci. 8070 (2013) 259-270.
Nikoletseas, S., Raptopoulos, C. and Spirakis, P. G.
A Guided Tour in Random Intersection Graphs. Lect. Notes. Comput. Sci. 7966
(2013)
29-35.
http://dx.doi.org/10.1007/978-3-642-39212-2_5
Nikoletseas, S.
[see: Mertzios, G. B.]
Nikolic N.
[see: Grujicic I.]
Nixon, A. and Ross, E.
One brick at a time: a survey of inductive constructions in rigidity theory. To appear
in Fields Institute Communcations 70.
Nixon, A. and Schulze, B.
Symmetry-forced rigidity of frameworks on surfaces. Preprint.
Nixon, A.
[see: Jackson, B.]
Noble, S. D. and Royle, G. F.
The Merino-Welsh Conjecture holds for Series-Parallel Graphs. Eur. J. Comb. 38
(2014) 24-36.
Noble, S. D.
[see: Chun, C.]
Noel, J.
[see: Morrison, N.]
Norine, S.
[see: Hladký, J.]
Noy, M.
[see: Kitaev, S.]
O’Carroll, L., Planas-Vilanova, F. and Villareal, R. H.
Degree and algebraic properties of lattice and binomial matrix ideals. SIAM J.
Discrete Math. 28 (2014),, 394--427, to appear.
http://dx.doi.org/10.1137/130922094
O’Connell, N.
Whittaker functions and related stochastic processes. To appear in Proceedings of an
MSRI seminar on Random Matrix Theory, Interacting Particle Systems and Integrable
Systems.
O’Connell, N.
Geometric RSK and the Toda lattice. Preprint.
O’Connell, N. and Pei, Y.
A q-weighted version of the Robinson-Schensted algorithm. Electron J. Probab. 18
(2013) article 95.
http://dx.doi.org/10.1214/EJP.v18-2930
O’Connell, N., Seppäläinen, T. and Zygouras, N.
Geometric RSK correspondence, Whittaker functions and symmetrized random
polymers. Invent. Math. (2013).
http://dx.doi.org/10.1007/s00222-013-0485-9
Oliver, N.
[see: Amini, O.]
O’Malley, G.
[see: Manlove, D. F.]
Ono, H.
[see: Cooper, C.]
Ordyniak, S, Paulusma, D. and Szeider, S.
Satisfiability of acyclic and almost acyclic CNF formulas. Theor. Comput. Sci., 481
(2013) 85-99.
Osthus, D. and Staden, K.
Approximate Hamilton decompositions of robustly expanding regular digraphs.
SIAM J. Discrete Math. 27 (2013) 1372-1409
http://dx.doi.org/10.1137/120880951
http://web.mat.bham.ac.uk/D.Osthus/rob30.pdf
Osthus, D.
[see: Csaba, B., Hefetz, D., Knox, F., Kühn, D.]
Oukanine, J. and Worrell, J.
On the Positivity Problem for Simple Linear Recurrence Sequences.
Preprint.
Oukanine, J. and Worrell, J.
Ultimate Positivity is Decidable for Simple Linear Recurrence
Sequences. Preprint.
Oury, N., Pedersen, M. and Petersen, R.
Canonical Labelling of Site Graphs. Preprint.
Owen, J. C.
[see: Jackson, B.]
Oxley, J. G.
[see: Chun, C.]
Pach, J. and Swanepoel, K. J.
Double-normal pairs in the plane and on the sphere. Preprint.
Pach, J. and Swanepoel, K. J.
Double-normal pairs in space. Preprint.
Pach, J.
[see: Bárány, I., Conlon, D., Kang, R. J. ]
Paget, R. E.
[see: Evseev, A.]
Pakianthan, J.
[see: Bennett, M.]
Panagiotou, K.
[see: Amini, H., Fountoulakis, N., Heise, C.-G.]
Panagopoulou, P. N.
[see: Nikoletseas, S.]
Panario, D.
Pangborn, G.
[see: Ellis-Monaghan, J. A.]
Parker, C.
[see: Giudici, M.]
Parker, M. G.
[see: Cabello, A.]
Paschos, V.
[see: Bourgeois, N]
Patel, V.
[see: Bonamy, M., Bordewich, M., Broersma, H. J., Hladký, J., Johnson, M., Kang, R.
J., Kühn, D.]
Paterson, M. B. and Stinson, D. R.
Optimal constructions for ID-based one-way-function key predistribution schemes
realizing specified communication graphs. Preprint.
A unified approach to combinatorial key predistribution schemes for sensor networks.
Des. Codes Cryptography 71 (2014) 433-457
http://dx.doi.org/10.1007/s10623-012-9749-4
A Simple Combinatorial Treatment of Constructions and Threshold Gaps of Ramp
Schemes. Cryptogr. Commun. (2013) 229-240 (2013)
http://dx.doi.org/10.1007/s12095-013-0082-1
Paterson, M. B. , Stinson, D. R. and Upadhyay, J.
A coding theory foundation for the analysis of general unconditionally secure proofof-retrievability schemes for cloud storage. J. Math. Cryptol. 7 (2013) 183-216.
http://dx.doi.org/10.1515/jmc-2013-5002
Paterson, M. B.
[see: Dinitz, J., Henry, K., Kendall, M.]
Patkós, B.
[see: Grzesik, A.]
Paul, C.
[see: Bousquet, N.]
Paulusma, D.
[see: Belmonte, R., Biró, P., Bonamy, M., Broersma, H. J., Chalopin, J., Chaplick, S.,
Cochefort, M., Couturier, J.-F., Dąbrowski, K. K., Fiala, J., Golovach, P. A., Johnson,
M., Ordyniak, S.]
Pedersen, M.
[see: Oury, N.]
Pei, Y.
[see: O’Connell, N.]
Peled, R., Samotij, W. and Yehudayoff, A.
Lipschitz functions on expanders are typically flat. Comb. Probab. Comput. 22 (2013)
566-591.
http://dx.doi.org/10.1017/S0963548313000163
http://www.dpmms.cam.ac.uk/~ws299/papers/M-Lipschitz_expanders.pdf
Peled, R., Samotij, W. and Yehudayoff, A.
Grounded Lipschitz functions on trees are typically flat. Electron. Commun. Probab.
18 (2013), A55.
https://www.dpmms.cam.ac.uk/~ws299/papers/LipOnTree-final.pdf
de la Peña, J. A.
[see: Estrada, E.]
Penev, I.
Penman, D. B. and Wells, M. D.
On sets with more restricted sums than differences. Integers 13 (2013) A57.
http://www.emis.de/journals/INTEGERS/papers/n57/n57.pdf
Penman, D. B. and Wells, M. D.
Sum-dominant sets and restricted-sum dominant sets in finite abelian groups. Preprint.
Penman, D. B.
[see: Harden, C. M.]
Penrose, M. D.
Connectivity of soft random graphs. Preprint.
Peres, Y. and Sousi, P.
Total variation cutoff in a tree. Preprint.
http://www.statslab.cam.ac.uk/~ps422/tree-cutoff.pdf
Peres, Y. and Sousi, P.
Mixing times are hitting times of large sets. J. Theor. Probab. (May 2013).
http://dx.doi.org/10.1007/s10959-013-0497-9
http://www.statslab.cam.ac.uk/~ps422/mix-hit.pdf
Peres, Y., Sousi, P. and Stauffer, A.
The isolation time of Poisson Brownian motions. ALEA, Latin American Journal of
Probability and Mathematical Statistics 10 (2013) 813-829.
Peres, Y.
[see: Babichenko, Y., Grimmett, G. R.]
Péresse, Y. H.
[see: Hyde, J.]
Peretz, R.
[see: Babichenko, Y.]
Perkins, S.
[see: Harris, L. H., Hunt, F. H., Jones, S. K.]
Person, Y.
[see: Allen, P., Fox, J.]
Petersen, R.
[see: Oury, N.]
Petridis, G.
The
-norm of exponential sums in
Math. Proc. Camb. Philos. Soc, 154
(2013)
381–391.
Peyerimhoff, N.
[see: Ivrissimtzis, I.]
Pfender, F.
[see: Cummings, J.]
Philip, G.
[see: Crowston, R.]
Phongpattanacharoen, T. and Siemons, I. J.
Metric intersection problems in Cayley graphs and the Stirling recursion.
Aequationes Math. 85 (2013) 387-408
http://dx.doi.org/10.1007/s00010-013-0196-8
Piguet, D.
[see: Allen, P., Böttcher, J..]
Pikhurko, O. and Vaughan, E. R.
Minimum Number of -Cliques in Graphs with Bounded Independence Number.
Combin. Probab. Comput. 22 (2013) 910-934
http://dx.doi.org/10.1017/S0963548313000357
http://homepages.warwick.ac.uk/~maskat/Papers/Fkl.pdf
Pikhurko, O.
[see: Balogh, J., Cooper, A., Dudek, A., Falgas-Ravry, V., Heise, C.-G., Hladký, J.,
Král’, D., Liu, H., Naves, H.]
Pilipczuk, M.
[see: Giannopoulou, A. C., Golovach, P. A.]
Pinto, T. A.
Biclique Covers and Partitions. Electron. J. Comb. 21 ( 2014) P1.19.
Pinzani, R.
[see: Bacher, A.]
Pissis, S. P.
[see: Christou, M.]
Pittel, B. and Sorkin, G. B.
The satisfiability threshold for -XORSAT. Preprint.
Planas-Vilanova, F.
[see: O’Carroll, L.]
Pokrovskiy, A.
A linear bound on the Manickam, Miklós and Singhi Conjecture. Preprint.
http://personal.lse.ac.uk/pokrovsk/MMSConjecture.pdf
Pokrovskiy, A.
Partitioning edge-coloured complete graphs into monochromatic cycles and paths. J.
Comb. Theory Ser B.106 (2014) 70-97.
http://personal.lse.ac.uk/pokrovsk/Partitioning.pdf
Pokrovskiy, A.
Edge growth in graph powers. Australas. J. Comb. 58 (2014) 347-357.
http://ajc.maths.uq.edu.au/pdf/58/ajc_v58_p347.pdf
Pokrovskiy, A.
Calculating Ramsey numbers by partitioning coloured graphs. Preprint.
Porat, B.
[see: Butman, A.]
Porat, E.
[see: Butman, A., Clifford, R.]
Porter, M. A.
[see: Balachandran, P., Beguerisse Diaz, M.]
Potapov, I.
Composition problems for braids. FSTCS 2013.
http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2013.175
Pountourakis, E.
[see: Askalidis, G.]
Powell, R.
[see: Huber, A.]
Power, S. C.
Polynomials for crystal frameworks and the rigid unit mode spectrum. Philos Trans A
Math Phys Eng Sci. 2013
http://dx.doi.org’10.1098/rsta.2012.0030
Power, S. C.
Crystal frameworks, matrix-valued functions and rigidity operators, In: Concrete
operators, spectral theory, operators in harmonic analysis and approximation: 22nd
International Workshop in Operator Theory and its Applications, Sevilla, July 2011.
Power, S. C.
[see: Badri, G., Kitson, D.]
Praeger, C. E.
[see: Gardiner, A. D., Gillespie, N. I., Giudici, M.]
Prałat, P.
Prellberg, T.
Rare event sampling with stochastic growth algorithms. EPJ Web of Conferences 44,
01001 (2013)
http://dx.doi.org/10.1051/epjconf/20134401001
http://www.maths.qmul.ac.uk/~tp/papers/pub089pre.pdf
Prellberg, T.
[see: Mortimer, P. R. G.]
Proskurowski, A.
[see: Broersma, H. J.]
Prosser, P.
Stable Roommates and Constraint Programming, to appear in Proceedings of
CPAIOR 2014. Lect. Notes Comput. Sci. Springer, 2014
Prosser, P. and Unsworth, C.
An n-ary Constraint for the Stable Marriage Problem,Preprint.
Prosser, P.
[see: Codish, M., McCreesh, C., Moore, N.C.A.]
Przykucki, M.
Maximal percolation time in hypercubes under 2-bootstrap percolation. Electron J.
Comb. 19 (2012) P41.
Przykucki, M.
[see: Balister, P. N., Benevides, F., Bollobás, B., Gunderson, K.]
Psomas, C.
[see:Archdeacon, D., Grannell, M. J., Forbes, A. D.]
Purcell, C.
[see: Korpelainen, N., Lozin, V. V.]
Pyatkin, A.
[see: Broersma, H. J.]
Pymar, R. and Sousi, P.
A permuted random walk exits faster. Preprint.
Quick, M. R.
[see: Menezes, N. E.]
Radoszewski, J.
Radovanović, M.
[see: Aboulker, P.]
Radzik, T.
[see: Cooper, C.]
Rafiey, A.
[see: Gutin, G.]
Rai, A.
[see: Crowston, R.]
Raigordskii, A. M.
Raman, V.
[see: Crowston, R.]
Ramanujan, M. S.
[see: Crampton, J., Jones, M.]
Ramsay, C.
Raptopoulos, C.
[see: Nikoletseas, S]
Ras, C. J.
[see: Brazil, M.]
Rastagari, B.
[see: Condon, A., Krysta, P.]
Rautenbach, D.
[see: Dąbrowski, K. K.]
Razgon, I.
[see: Korpelainen, N.]
Reed, B. A.
[see: Keevash, P.]
Rees, S. E.
[see: Ciobanu, L., Holt, D. F.]
Regts, G.
[see: Kang, R. J.]
Reichman, D.
[see: Krivelevich, M.]
Reitzner, M.
[see: Bárány, I.]
Remmel, J.
[see: Jones, M., Kitaev, S.]
Richerby, D.
[see: Diaz, J., Dyer, M. E., Göbel, A.,]
Ries, B.
[see: Lozin, V. V.]
Riis, S.
[see: Baber, R..]
Rinaldi, G.
Rincón, E. F.
Local tropical linear spaces.Discrete Comput. Geom. 50 (2013) 700-713.
http://dx.doi.org/10.1007/s00454-013-9519-8
Rincón, E. F.
[see: Ardila, F., Fink, A., McLagan, D.]
Rino Nesin, G. A. and Thomas, R. M.
Groups with a recursively enumerable irreducible word problem, in 19th FCT. Lect.
Notes Comput. Sci. 8070 (2013) 283-292.
http://dx.doi.org/10.1007/978-3-642-40164-0_27
Riordan, O. M.
Long cycles in random subgraphs of graphs with large minimum degree. Preprint.
Riordan, O. M. and Warnke, L.
The evolution of subcritical Achlioptas processes. Random Struct. Algorithms, to
appear.
Riordan, O. M. and Warnke, L.
The Janson inequalities for general up-sets. Random Struct. Algorithms, to appear.
Riordan, O. M.
[see: Balister, P. N., Bollobás, B., Heckel, A.]
Rizzi, R.
[see: Abreu, M.]
Roach, P. A.
[see: Harris, L. H., Jones, S. K.]
Roberson, D.
[see: Godsil, C. D.]
Roberts, M. I.
[see: Candellero, E.]
Robertson, E. F.
Roche-Newton, O. and Rudnev, M.
On the Minkowski distances and products of sum sets. Isr. J. Math., to appear.
Roche-Newton, O.
[see: Balog, A., Jones, T. G. F., Murphy, T.]
Rödl, V.
[see: Dellamonica, D.]
Roldán-Pensado, E.
[see: Bárány, I. ]
Rombach, M. P
Roney-Dougal, C. M.
[see: Bray, J. N., Button, J. N., Detomi, M., Holt, D. F., Menezes, N. E.]
Ron-Zewi, N.
[see: Ben-Sasson, E.]
Rosamond, F.
[see: Crowston, R.]
Ross, E.
[see: Nixon, A.]
Rossi, M.
[see: Bruss, D.]
Rossi R.
[see: Giandomenico, M.]
Rowley, P. J.
[see: Hart, S. B.]
Rowlinson P.
On independent star sets in finite graphs. Linear Algebra Appl. 442 (2014) 82-91
Rowlinson P.
Star complements and connectivity in finite graphs, Linear Algebra Appl. 442 (2014)
92-98
Rowlinson P.
Eigenvalue multiplicity in cubic graphs. Linear Algebra Appl. 444 (2014) 211-218.
Rowlinson, P.
[see: Caporossi, G., Cvetković, D. M.,]
Roy, A.
[see: Boixo, S.]
Royle, G. F. and Sokal, A. D.
Linear bound in terms of maxmaxflow for the chromatic roots of series-parallel
graphs. Preprint.
Royle, G. F.
[see; Noble, S. D.]
Rubey, M., Sagan, B. E. and Westbury, B. W.
Descent sets for symplectic groups. J. Algebr. Comb., to appear.
Rubinfeld, R.
[see: Batu, T.]
Rudnev, M.
[see: Bennett, M., Gill, N., Konyagin, S., Roche-Newton, O.]
Rueckriemen, R.
[see: Chun, C.]
Ruskey, F.
[see: Erickson, A.]
Ruškuc, N.
[see: Abu-Gazalh, N., Albert, M. H., Cain, A. J., Dolinka, I., Gray, R., Huczynska,
S.]
Russell, P. A.
[see: Johnson, J. R.]
Rutherford, C. G.
[see: Affife Chauouche, F.]
Ruzsa, I. Z.
[see: Crowston, R.]
Rytter, W.
Sach, B.
[see: Bille, P., Butman, A., Clifford, R.]
Sagan, B. E.
[see: Rubey, M.]
Salem, I.
[see: Giannopoulou, A. C.]
Samal, S.
[see: Godsil, C. D.]
Samotij, W.
Stability results for random discrete structures. Random Struct. Algorithms 44 (2014)
269-289.
http://www.dpmms.cam.ac.uk/~ws299/papers/stability.pdf
Samotij, W.
[see: Alon, N., Balogh, J., Conlon, D., Dellamonica, D., Krivelevich, M., Peled, R.]
Sanders, T. W.
Approximate (Abelian) Groups. Proceedings of 6ECM, December 2013, 824 pages,
Hardcover, ISBN: 978-3-03719-120-0. .
Sanderson, R.
[see: Coenen, F.]
Sankowski, P.
[see: Cygan, J.]
Santhana Krishnan, B.
[see: Ganesh, A.]
Santos, C.
[see: Fink, A.]
Sau, I.
[see: Bousqet, N.]
Sauerwald, T.
[see: Bringmann, K., Friedrich, T.]
Saurabh, S.
[see: Crowston, R, Giannpoulou, A. C., Jones, M.]
Saxl, J.
[see: Giudici, M.]
Saxton, D.
Essential positive covers of the cube. J. Comb. Theory Ser. A. 120 (2013) 971-975.
Saxton, D. and Thomason, A. G.
Simple containers for simple hypergraphs. Preprint.
Saxton, D.
[see: Fiz Pontiveros, G.]
Scarpa G.
[see: Cabello, A., Mancinska, L.]
Schacht, M.
[see: Conlon, D.]
Schiffl, K.
Schillewaert, J. and Thas, K.
Construction and Comparison of Authentication Codes. SIAM J. Discrete Math. 28
(2014) 474–489.
http://dx.doi.org/10.1137/130920988
Schillewaert, J. and Verstraete, J.
Small maximal partial ovoids in generalized quadrangles. Preprint.
Schillewaert, J.
[see: van Maldeghem, H.]
Schmeichel, E.
[see: Bauer, D.]
Schmitt, J.
[see: Cooper, A.]
Schneider, H.
[see: Butkovi , P.]
Schroll, S.
[see: Marsh, R. J.]
Schulze, B.
[see: Nixon, A.]
Schumacher, R. U.
[see: Cameron, P. J. ]
Scott, A. D. and Sokal, A. D.
Complete monotonicity for inverse powers of some combinatorially defined
polynomials. Acta Math., to appear
Scott, A. D. and Sorkin, G.
Structure of random r-SAT below the pure literal threshold. Submitted.
http://people.maths.ox.ac.uk/scott/Papers/unsat.pdf
Scott, A. D. and Wilmer, E.
Hypergraphs of bounded disjointness. SIAM J. Discrete Math. 28 (2014) 372-384.
http://dx.doi.org/10.1137/130925670
http://people.maths.ox.ac.uk/scott/Papers/boundeddisjointness.pdf
Scott, A. D.
[see: Bollobás, B, Chudnovsky, M., Jeavons, P., Kang, R. J., Meeks, K., Morrison,
N.]
Scott, D. J.
Scott, J.
[see: Marsh, R. J.]
Seppäläinen, T.
Sereni, J.-S. and Volec, J.
A note on acyclic vertex-colorings. Preprint.
Sereni, J.-S.
[see: Dvořák, Z., van den Heuvel. J., Král’, D.]
Seress, A.
[see; Bamberg, J.]
Sergeev, S.
[see: Butkovi , P.]
Serna, M.
[see: Diaz, J.]
Severini, S.
[see: Banerji, C. R. S., de Beaudrap, N., Boixo, S., Bruss, D., Cabello, A., Cubitt, T.,
Godsil, C. D., Janson, S., Kirkland, S., Mancinska, L]
Severs, C.
[see: Kitaev, S.]
Seymour, P. D.
Shaw, R. and Topalova, S.
Book spreads in PG(7,2). Discrete Math., to appear.
http://www.hull.ac.uk/php/masrs/2014/pubbspr_Sh_Top_rev1.pdf
Shaw, R.
[see: Draisma, J., Gordon, N. A., McDonough, T. P.]
Sheehan, J.
[see: Abreu, M.]
Sheng, B.
[see: Gutin, G.]
Shkredov, I. D.
[see: Murphy, B.]
Shparlinski, I. E.
Siantos, Y.
[see: Cooper, C.]
Siciliano, A.
[see: King, O. H.]
Siemons, I. J. and Smith, D.
Some homological representations for Grassmannians in cross-characteristics.
Russian Academy of Science 414 (2013) 157-180
Siemons, I. J.
[see: Apostolico, A.., Phongpattanacharoen, T.]
Siemssen, D.
[see: Fewster, C. J.]
Sinclair, A.
[see: Caputo, P.]
Sing, C. T. S.
[see: Irving, R. W.]
Singerman, D.
[see: Martin, P.]
Sipma, F.
[see: Esperet, L.]
Širáň, J.
[see: Balbuena, C., Forbes, A. D., Grannell, M. J., Knor, M., Šiagiová, J.]
Skerman, F.
[see: Grzesik, A.., McDiarmid, C. J. H.]
Sklyanin, E. K.
[see: Kozlowski, K. K., Nazarov, M. L.]
Skokan, J.
[see: Allen, P., Fiz Pontiveros, G., Martin, R. R.]
Škoviera, M.
Skowron, A.
[see: Chikalov, I.]
Smith, D. H.
[see: Hunt, F. H., Montemanni, R.]
Smith, P.
[see: Balister, P. N., Bollobás, B.]
Smith, D.
[see: Simeons, I. J.]
Smith, W. D.
[see: Batu, T.]
Smriglio, S.
[see: Giandomenico, M.]
Sokal, A. D.
[see: Royle, G. F., Scott, A. D.]
Song, J.
[see: Golovach, P. A.]
Sorkin, G. B.
Alternative Proof of a Technical Lemma for the Analysis of Random k-XORSAT.
Preprint.
Sorkin, G. B.
[see: Frieze, A. M., Gaspers, S., Janson, S., Pittel, B., Scott, A. D.]
Sousa, T.
[see: Liu, H.]
Sousi, P. and Winkler, P. M.
Mixing times and moving targets. Combin. Probab. Comput., to appear.
http://www.statslab.cam.ac.uk/~ps422/moving-fixed2.pdf
Sousi, P.
[see: Babichenko, Y., Peres, Y., Pymar, R. ]
Southwell, R.
[see: Cannings, C.]
Spedalieri, F. M.
[see: Boixo, S.]
Sperfeld, K..
[see: Cummings, J.]
Spiga, P.
[see; Bamberg, J., Gillespie, N. I.]
Spirakis, P. G.
[see: Chatzigiannakis, I., Diaz, J.. Mertzios, G. B.]
Spillner, A.
[see: Bastkowski, S.]
Spirakis, P. G.
[see: Akrida, E. C., Diaz, J., Mertzios, G. B., Michail, O., Nikoletseas, S.]
Spöhel, R., Steger, A. and Warnke, L.
General deletion lemmas via the Harris inequality. J. Comb. 4 (2013)
251-271.
http://dx.doi.org/10.4310/JOC.2013.v4.n2.a5
http://www.mpi-inf.mpg.de/~rspoehel/general-deletion-lemmas.pdf
Stacho, J.
[see: Atminas, A., Brignall, R., Chaplick, S., Corneil, D. G., Dąbrowski, K. K.,
Francis, M., Martin, B.]
Staden, K.
[see: Kühn, D., Osthus, D.]
Stahlke, D.
[see: Cubitt, T.]
Stanić, Z.
[see: Cvetković, D. M..]
Starchenko, S.
Stark, D. S.
[see: Gauci, J.-B., Granovsky, B.]
Stauffer, A.
[see: Blanchet, J., Bringmann, K, Caputo, P., Friedrich, T., Peres, Y.]
Steel, M.
[see: Dress, A., Huber, K. T.]
Stefankovic, D.
[see: Cai, J.-Y.]
Steger, A.
[see: Brightwell, G. R., Fountoulakis, N., Hefetz, D., Spöhel, R.]
Steiger, W.
[see: Bárány, I.]
Stein, M. J.
[see: Conlon, D., Skokan, J.]
Steingrímsson, E.
Some open problems on permutation patterns. Surveys in Combinatorics 2013,
239-263. London Mathematical Society Lecture Note Series,
Steingrímsson, E.
[see: Claesson, A., Ehrenborg, R, McNamara, P.]
von Stengel, B. and de Végh, L.
Oriented Euler Complexes and Signed Perfect Matchings. Mathematical
Programming Series B., to appear.
Stewart, I. A.
Hamiltonicity in multiswapped networks. Preprint.
Stewart, I. A.
Multiswapped networks and their topological and algorithmic properties.
J. Comput. Syst. Sci. 79 (2013) 1269-1286.
https://community.dur.ac.uk/i.a.stewart/Papers/Multiswapped.pdf
Stewart, I. A.
Interconnection networks of degree three obtained by pruning two-dimensional tori.
IEEE Transactions on Computers, to appear.
https://community.dur.ac.uk/i.a.stewart/Papers/DegreeThreeNets.pdf
Stewart, I. A.
[see: Gate, J., Golovach, P. A.]
Stinson, D. R.
[see: Henry, K., Kendall, M., Paterson, M. B.]
Strauss, D.
[see: Barber, B., Davenport, D.]
Stuckey, P.J.
[see: Codish, M.]
Suchý, O.
[see: Giannopoulou, A. C., Jones, M.]
Sudakov, B.
[see: Allen, P., Conlon, D., Hefetz, D., Glebov, R., Keevash, P.]
Suk, A.
[see: Conlon, D.]
Sun, H.
[see: Bringmann, K.]
Sviridenko, M. and Ward, J.
Large Neighborhood Local Search for the Maximum Set Packing Problem. ICALP
2013 792-803.
http://dx.doi.org/10.1007/978-3-642-39206-1_67
Sviridenko, M.
[see: Bansal, N., Im, S., Schudy, W.]
Swanepoel, K. J. and Villa, R.
Maximal equilateral sets. Discrete Comput. Geom. 50 (2013) 354–373.
http://dx.doi.org/10.1007/s00454-013-9523-z
Swanepoel, K. J.
[see: Brazil, M., Pach, J.]
Szabadka, Z.
[see: Jackson, B.]
Szabó, T.
[see: Fox, J., Glebov, R.]
Szeider, S.
[see: Gutin, G., Ordyniak, S]
Szreder, B.
[see: Christou, M.]
Taam, A.
Talbot, J. M.
[see: Baber, R.]
Tam, B-S.
[see: Butkovi , P.]
Tan, T.-S.
[see: Leader, I. B.., Lo, A.]
Tao, T. C.
[see: Breuillard, E., Green, B. J.]
Taraz, A.
[see: Böttcher, J., Heise, C.-G.]
Tate, S. J.
[see: Jansen, S.]
Tesar, M.
[see: Chaplick, S.]
Thapper, J.
[see: Bodirsky, M., Kolmogorov, V.]
Thas, J. A.
[see: Hirschfeld, J. W. P.]
Thas, K.
[see: Schillewaert, J.]
Thilikos, D. M.
[see: Belmonte, R., Giannopoulou, A. C., Golovach, P. A.]
Thomas, D. A.
[see: Brazil, M.]
Thomas, R.
[see: Dvořák, Z.]
Thomas, R. M.
[see: Corran, A., Jones, S. A. M., Rino Nesin, G. A.]
Thomason, A. G.
[see: Dudek, A., Saxton, D.]
Thomassé, S., Trotignon, N. and Vušković, K.
Parameterized algorithm for weighted independent set problem in bull-free graphs.
Preprint.
Thomassé, S.
[see: Bousquet, N., Crowston, R.]
Thompson, J.
Thomson, D.
Tiep, P. H.
[see: Giudici, M.]
Tiskin, A.
Fast distance multiplication of unit-Monge matrices. Algorithmica, to appear
http://dx.doi.org/10.1007/s00453-013-9830-z
Todd, M.
[see: Aimino, R., Demers, M., Freitas, A. C.]
Tointon, M.
Freiman’s theorem in an arbitrary nilpotent group. Proc. Lond. Math. Soc., to appear.
Tointon, M.
Bracket polynomials have large Gowers uniformity norm. Preprint.
Topalova, S.
[see: McDonough, T. P., Shaw, R.]
Tóth, G.
Touchette, H.
[see: Lopez Peña, J.]
Townsend, T.
[see: Kühn, D.]
Traetta, T.
Treglown, A.
A degree sequence Hajnal-Szemerédi theorem. Preprint.
Treglown, A.
On directed versions of the Hajnal-Szemerédi theorem. Preprint.
Treglown, A. and Zhao, Y.
Exact minimum degree thresholds for perfect matchings in uniform hypergraphs II.
J. Comb. Theory Ser A 120 (2013) 1463-1482.
http://web.mat.bham.ac.uk/~treglowa/exactmatchingFINAL.pdf
Treglown, A. and Zhao, Y.
Tight minimum degree conditions forcing perfect matchings in uniform hypergraphs.
Seventh European Conference on Combinatorics, Graph Theory and Applications,
CRM Series Vol. 16 (2013) 33-38.
http://web.mat.bham.ac.uk/~treglowa/eurocombTZ.pdf
Treglown, A.
[see: Balogh, J., Csaba, B., Cummings, J., Kühn, D.]
Tripodi, A.
Trotignon, N.
[see: Aboulker, P., Chudnovsky, M., Thomassé, S.]
Trunck, N.
[see: Aboulker, P.]
Trunck, T.
[see: Johnson, M.]
Truss, J. K.
[see: Abogatma, A., Gray, R..]
Tsagkarogiannis, D.
[see: Jansen, S.]
Tulpan, D.
[see: Montemanni, R.]
Tulsiani, M.
[see: Ben-Sasson, E.]
Tyomkyn, M.
[see: Hefetz, D.]
Udvari, B.
[see; Balogh, J.]
Ueltschi, D.
[see; Ercolani, N. M., Jansen, S.]
Úlfarsson, H.
[see: Kitaev, S.]
Ulrich, D.
[see: Conlon, D.]
Ullrich, M.
[see: Dyer, M. E.]
Unsworth, C.
[see: Prosser, P.]
Upadhay, J.
[see: Paterson, M. B.]
Urosevic, D.
[see: Brimberg, J.]
Uzzell, A. J.
Valdimarsson, I. S.
[see: Carbery, A.]
Valyuzhenich, A.
[see: Atminas, A.]
Varju, P. P.
Random walks in compact groups. Documenta Math. 2013.
Vatter, V.
[see: Albert, M. H., Brignall, R.]
Vaughan, E. R.
[see: Baber, R., Falgas-Ravry, V., Pikhurko, O.]
Vdovina, A.
de Végh, L.
[see: von Stengel, B.]
Ventre, C.
[see: Goldberg, L.A.]
Verstraete, J.
[see: Allen, P., Keevash, P., Schillewaert, J.]
Vigoda, E.
[see: Cai, J.-Y., Dyer, M. E.]
Vildhøj, H. W.
[see: Bille, P.]
Villa, R.
[see: Swanepoel, K. J.}
Villareal, R. H.
[see: O’Carroll, L.]
Vinci, W.
[see: Boixo, S.]
Volec, J.
[see: Balogh, J., Dvořák, Z., Glebov, R., van den Heuvel, J., Sereni, J.-S.]
Volz, M. G.
[see: Brazil, M.]
Vušković, K.
The world of hereditary graph classes viewed through Truemper configurations.
Surveys in Combinatorics 2013, 265-305.
http://www.comp.leeds.ac.uk/vuskovi/truemper.pdf
Vušković, K.
[see: Aboulker, P., Thomassé, S.]
Wachter-Zeh, A.
[see: Bezzateev, S.]
Wade, A. R.
[see: Georgiou, N., Jordan, J.]
Wagner, D. G.
[see: Cibulka, J.]
Wagner, S.
Wahlström, M.
[see: Gutin, G.]
Walen, T.
Wanless, I. M.
[see: Aldred, R. E. L., Browning, J. M.]
Warburton, P. A.
[see: Boixo, S.]
Ward, J.
[see: Sviridenko, M.]
Warnke, L.
When does the K_4-free process stop? Random Struct. Algorithms 44 (2014) 355-397.
Warnke, L.
[see: Balogh, J., Riordan, O. M., Spöhel, R.]
Warrington, G.
[see: Cooper, A.]
Watkins, J. J. and Wilson R. J. (editors)
Combinatorics: Ancient & Modern, Oxford University Press, July 2013, c.380 pp.
Webb, B. S.
[see: Danziger, P.]
Weller, K.
[see: Bousquet-Mélou, M., McDiarmid, C. J. H.]
Wells, M. D.
[see: Penman, D. B.]
Werning, N.
[see: Járai, A. A.]
West, J.
[see: Bacher, A.]
Westbury, B. W.
[see: Rubey, M.]
White, C. D.
White, P.
[see: Batu, T.]
Whittle G.
[see: Chun, C.]
Whitty, R. W.
[see: Affife Chauouffe, F.]
Wildon, M. R.
[see: Blackburn, S. R., Britnell, J. R., Evseev, A., Gianelli, E.]
Williams, L. K.
[see: Ardila, F.]
Wilmer, E.
[see: Scott, A. D.]
Wilson, D. B.
[see: Angel, O.]
Wilson, R. C.
[see: de Beaudrap, N.]
Wilson R. J.
Solving dotty problems: some puzzles in graph theory. Procedings ot the Recreational
M athematics Colloquium III (Azores, April 2013) (ed. J. N. Silva), Associacao
Ludus, 2013, 105-114.
Wilson R. J.
Early graph theory, Chapter 8 of Combinatorics: Ancient & Modern, Oxford
University Press. ISBN
Wilson, R. J.
Four colors suffice. (Revised color edition). Princeton Science Seris, Princeton
University Press, 2013.
Wilson, R. J.
[see: Beineke, L. W., Biggs, N. L., Fauvel, R., Watkins, J. J.]
Wilson, S.
[see: Müller, H.]
Windridge, P.
[see: Janson, S.]
Winkler, P. M.
[see: Angel, O., Babichenko, Y., Georgakopoulos, A., Sousi, P.]
Winter, A.
[see: Cabello, A., Cubitt, T., Duan, R., Linden, N.]
Wojchiekowski, R.
Wolf, J.
[see: Ben-Sasson, E.; Lê, Th. H.]
Woodall, D. R.
[see: Bauer, D., Borodin, O. V.]
Worrell, J.
[see: Oukanine, J.]
Wu, J-Y.
[see: Bruss, D.]
Wu, T.
[see: Dress, A., Humphries, P.]
Würfl, A.
[see: Allen, P., Böttcher, J.]
Xu, L.
[see: Jeavons, P.]
Yamakami, T.
[see: Göbel, A.]
Yatauro, M.
[see: Bauer, D.]
Yehudayoff, A.
[see: Peled, R.]
Yeo, A.
[see: Crampton, J., Crowston, R., Desormeaux, W., Gutin, G., Henning, M. A.]
Yoon, M. G.
[see: Cvetković, D. M..]
Young, M.
[see: Cummings, J.]
Yuan, L.
Yudovina, E.
[see: Kelly, F. P.]
Zbarsky, S.
[see: Conlon, D.]
Zdimalova, M.
[see: Balbuena, C.]
Zeh, A.
[see: Bezzateev, S.]
Zenq, J.
[see: Loureiro, A. F.]
Zhang, G.
[see: Bansal, N. ]
Zhang, J.
[seeL Krysta, P.]
Zhao, Y.
[see: Conlon, D., Kühn, D., Treglown, A.]
Zielosko, B.
[see: Chikalov, I.]
Zito, M.
[see: Coenen, F., McGrae, A. R.]
Zivny, S.
[see: Cohen, D. E., Jeavons, P., Kolmogorov, V .]
Zoros, D.
[see: Giannopoulou, A. C.]
Zverovich, V.
[see: Avineri, E., Gagarin, A.]
van der Zwaan, R.
[see: Im, S.]
van Zwam, S.
[see: Chun, C.]
Zygouras, N.
List of journal abbreviations for BCB.
This is a list of the abbreviations used for some of the journals we have recently
encountered in the Bulletin. They are taken, for consistency, from Zentralblatt. There
are journals which we cannot find a “standard” journal abbreviation for, in such cases
usually the name of the journal is spelled out in full when referring to it. Accuracy is,
as usual, not guaranteed!
Some further journals will be added to the list in future.
ACM J. Exp. Algorithm.- The ACM Journal of Experimental Algorithmics
ACM Trans. Algorithms - ACM Transactions on Algorithms
ACM Trans. Comput. Logic – ACM Transactions on Computation and Logic
ACM Trans. Comput. Theory – ACM Transactions on Computation Theory
Acta Appl. Math. - Acta Applicandae Mathematicae
Acta Arith. – Acta Arithmetica
Acta. Inf – Acta Informatica
Acta Math. – Acta Mathematica.
Acta Math. Appl. Sin., Engl. Ser. - Acta Mathematicae Applicatae Sinica (English
Series)
Acta. Math. Hung. – Acta Math Hungarica. .
Adv. Appl. Probab. – Advances in Applied Probability
Adv. Appl. Math. – Advances in Applied Mathematics
Adv. Geom. – Advances in Geometry
Adv. Math. –Advances in Mathematics
Adv. Math. Commun. – Advances in Mathematics of Communications
Adv. Theor. Math. Phys. - Advances in Theoretical and Mathematical Physics
Aequationes Math. - Aequationes Mathematicae.
Algebra Colloq. – Algebra Colloquium
Algebr. Represent. Theory - Algebras and Representation Theory
Algebra Univers. – Algebra Universalis.
Algorithmica – Algorithmica
Algorithms. Comb. – Algorithms and Combinatorics
Am. J. Math – American Journal of Mathematics.
Am. Math. Mon. - American Mathematical Monthly
Anal. PDE. - Analysis and PDE
Ann. Appl. Probab. – Annals of Applied Probability
Ann. Comb. – Annals of Combinatorics
Ann. Math. – Annals of Mathematics
Ann. Math. Artif. Intell. - Annals of Mathematics and Artificial Intelligence.
Ann. Probab. – Annals of Probability
Appl. Anal. Discrete Math. – Applicable Analysis and Discrete Mathematics
Appl. Math. Lett. – Applied Mathematics Letters
Arch. Math. Logic – Archive for Mathematical Logic
Arch. Math. – Archiv der Mathematik
Ars. Comb. – Ars Combinatorica.
Ars Math. Contemp. - Ars Mathematica Contemporanea
Australas. J. Comb. – Australasian Journal of Combinatorics.
Bernoulli - Bernoulli
Bull. Aust. Math. Soc. - Bulletin of the Australian Mathematical Society
Bull. Inst. Comb. Appl. - Bulletin of the Institute of Combinatorics and its
Applications
Bull. Lond. Math. Soc. – Bulletin of the London Mathematical Society
Bull. Soc. Math. Fr. - Bulletin de la Société Mathématique de France
Can. J. Math. - Canadian Journal of Mathematics.
Combinatorica – Combinatorica
Comb. Probab. Comput. – Combinatorics, Probability and Computing.
Commentat. Math. Univ. Carol. - Commentationes Mathematicae Universitatis
Carolinae.
Commun. Algebra – Communications in Algebra
Comput. Complexity – Computational Complexity.
Comput. Oper. Res. – Computers & Operational Research.
Congr. Numerantium - Congressus Numerantium
Contemp. Math. – Contemporary Mathematics
Contrib. Discrete Math. - Contributions to Discrete Mathematics
Des. Codes. Cryptography – Designs, Codes and Cryptography
Discrete Appl. Math. – Discrete Applied Mathematics.
Discrete Comput. Geom. – Discrete & Computational Geometry
Discrete Contin. Dyn. Syst. - Discrete and Continuous Dynamical Systems
Discrete Math. – Discrete Mathematics
Discrete Math. Algorithms Appl. - Discrete Mathematics, Algorithms and
Applications
Discrete Math. Appl. – Discrete Mathematics and its Applications
Discrete Math. Theor. Comput. Sci. - Discrete Mathematics and Theoretical
Computer Science
Discrete Optim. – Discrete Optimization
Discuss. Math. Graph Theory. - Discussiones Mathematicae. Graph Theory
Duke Math. J. – Duke Mathematical Journal
Electron. Commun. Probab. – Electronic Communications in Probability
Electron. J. Comb. – The Electronic Journal of Combinatorics
Electron. J. Probab – Electronic Journal of Probability
Electron. J. Stat. - Electronic Journal of Statistics
Electron. Notes Discrete Math. - Electronic Notes in Discrete Mathematics
Electron. Res. Announc. Math. Sci. - Electronic Research Announcements in
Mathematical Sciences
Electron. Trans. Numer. Anal. - Electronic Transactions on Numerical Analysis
Eur. J. Appl. Math. - European Journal of Applied Mathematics
Eur. J. Comb. – European Journal of Combinatorics
Eur. J. Oper. Res. – European Journal of Operational Research
Exp. Math. – Experimental Mathematics
Finite Fields Appl. – Finite Fields and their Applications
Forum. Math. – Forum Mathematicum
Funct. Approximatio. – Functiones et Approximatio. Commentarii Mathematicii
Fund. Math. – Fundamenta Mathematicae
Fundam. Inform. – Fundamentae Informaticae
Geom. Dedicata. - Geometriae Dedicata
Geom. Funct. Anal. - Geometric and Functional Analysis
Glasg. Math. J. - Glasgow Mathematical Journal
Graphs Comb. – Graphs and Combinatorics
Groups Complex. Cryptol. - Groups, Complexity, Cryptology
Groups Geom. Dyn. - Groups, Geometry, and Dynamics
IEEE Trans. Inf. Theory - IEEE Transactions on Information Theory.
IMA J. Numer. Anal. - IMA Journal of Numerical Analysis
Indian J. Math. - Indian Journal of Mathematics
Inf. Comput. – Information and Computation
Inf. Process. Lett. - Information Processing Letters
Inf. Sci – Information Sciences
Innov. Incidence Geom.- Innovations in Incidence Geometry
Int. Electron. J. Algebra - International Electronic Journal of Algebra
Int. J. Algebra Comput. - International Journal of Algebra and Computation
Int. J. Comb. - International Journal of Combinatorics
Int. J. Comput. Geom. Appl. - International Journal of Computational Geometry &
Applications
Int. J. Found. Comput. Sci. – International Journal of Foundations of Computer
Science
Int. J. Game Theory - International Journal of Game Theory
Int J. Number Theory - International Journal of Number Theory
Int. Math. Forum - International Mathematical Forum
Int. Math. Res. Not. – International Mathematics Research Notices
Internet Math. – Internet Mathematics
Invent. Math. – Inventiones Mathematicae
Isr. J. Math. – Israel Journal of Mathematics
J. ACM. – Journal of the Asoociation for Computing Machinery
J. Algebra - Journal of Algebra.
J. Algebr. Comb. – Journal of Algebraic Combinatorics.
J. Am. Math. Soc. - Journal of the American Mathematical Society.
J. Anal. Math. – Journal de Analyse Mathematique
J. Appl. Math. Comput. - Journal of Applied Mathematics and Computing.
J. Appl. Probab.- Journal of Applied Probability
J. Aust. Math. Soc. - Journal of the Australian Mathematical Society
J. Autom. Lang. Comb. - Journal of Automata, Languages and Combinatorics
J. Classif. - Journal of Classification
J. Comb – Journal of Combinatorics
J. Comb. Math. Comb. Comput. - Journal of Combinatorial Mathematics and
Combinatorial Computing
J. Comb. Des. - Journal of Combinatorial Designs
J. Comb. Optim. - Journal of Combinatorial Optimization
J. Comb. Theory Ser. A/ B – Journal of Combinatorial Theory Series A (or B).
J. Comput Geom. – Journal of Computational Geometry.
J. Comput. Syst. Sci. - Journal of Computer and System Sciences
J. Discrete Algorithms – Journal of Discrete Algorithms
J. Eur. Math. Soc. - Journal of the European Mathematical Society (JEMS).
J. Geom. – Journal of Geometry
J. Graph Algorithms Appl.- Journal of Graph Algorithms and Applications
J. Graph Theory – Journal of Graph Theory
J. Group Theory – Journal of Group Theory
J. Inst. Math. Jussieu - Journal of the Institute of Mathematics of Jussieu.
J. Integer Seq. – Journal of Integer Sequences
J. K-Theory - Journal of K-Theory. K-Theory and its Applications in Algebra,
Geometry, Analysis \& Topology.
J. Log. Comput. – Journal of Logic and Computation
J. Lond. Math. Soc. – Journal of the London Mathematical Society
J. Math. Biol. - Journal of Mathematical Biology
J. Math. Cryptol. – Journal of Mathematical Cryptology
J. Math. Sci – Journal of Mathematical Sciences
J. Number Theory – Journal of Number Theory.
J. Phys. A. Math. Theor. - Journal of Physics A: Mathematical and Theoretical
JP J. Algebra Number Theory Appl. - JP Journal of Algebra, Number Theory and
Applications
J. Pure Appl. Algebra – Journal of Pure and Applied Algebra
J. Reine Angew. Math.- Journal für die Reine und Angewandte Mathematik
J. Sched. – Journal of Scheduling
J. Stat. Mech. Theory Exp. - Journal of Statistical Mechanics: Theory and
Experiment
J. Stat. Phys – Journal of Statistical Physics.
J. Stat. Plann. Inference – Journal of Statistical Planning and Inference
J. Symb. Log. – Journal of Symbolic Logic
J. Symb. Comput. – Journal of Symbolic Computation
J. Theor. Probab. – Journal of Theoretical Probability.
Lect. Notes Math. - Lecture Notes in Mathematics
Lect. Notes Comput. Sci. – Lecture Notes in Computer Science
Linear Algebra Appl. – Linear Algebra and its Applications.
LMS J. Comput. Math. – London Mathematical Society Journal of Computation and
Mathematics.
Lond. Math. Soc. Lect. Note Ser. – London Mathematical Society Lecture Note Series
Math. Comput. – Mathematics of Computation.
Math. Comput. Sci. - Mathematics in Computer Science
Math. Gaz. – Mathematical Gazette
Math. Intell. - The Mathematical Intelligencer
Math Log. Q. – Mathematical Logic Quarterly
Math. Methods Oper. Res. – Mathematical Methods of Operational Research
Math. Proc. Camb. Philos. Soc. – Mathematical Proceedings of the Cambridge
Philsophical Society
Math. Semesterber. - Mathematische Semesterberichte
Math. Soc. Sci - Mathematical Social Sciences
Math. Z – Mathematische Zeitschrift
Mem. Am. Math. Soc. - Memoirs of the American Mathematical Society
Mich. Math. J. – Michigan Mathematical Journal
Monatsh. Math. - Monatshefte für Mathematik
Networks – Networks
Online J. Anal. Comb. - Online Journal of Analytic Combinatorics
Open J. Discrete Math. – Open Journal of Discrete Mathematics
Oper. Res. - Operations Research
Oper. Res. Lett. - Operations Research Letters
Order – Order
Period. Math. Hung. - Periodica Mathematica Hungarica.
Philos. Trans. R. Soc. Lond., A - Philosophical Transactions of the Royal Society of
London A
Phys. Rev. E – Physical Review E.
Probab. Theory Relat. Fields - Probability Theory and Related Fields
Proc. Am. Math. Soc. - Proceedings of the American Mathematical Society.
Proc. Edinb. Math. Soc. - Proceedings of the Edinburgh Mathematical Society
Proc. Lond. Math. Soc. – Proceedings of the London Mathematical Society
Proc. R. Soc. Lond., Ser. A, Math. Phys. Eng. Sci. - Proceedings of the Royal Society:
Mathematical, Physical and Engineering Sciences
Publ. Math., Inst. Hautes Étud. Sci. - Publications Mathématiques. Institut des Hautes
Études Scientifiques.
Pure Math. Appl. - Pure Mathematics and Applications
Q. J. Math. Quarterly Journal of Mathematics
Quasigroups Relat. Syst. - Quasigroups and Related Systems
RAIRO, Theor. Inform. Appl. - RAIRO. Theoretical Informatics and Applications
Ramanujan J. – Ramanujan Journal.
Random Struct. Algorithms – Random Structures and Algorithms
Rend. Mat. Appl., VII. Ser. - Rendiconti di Matematica e delle Sue Applicazioni. Serie
VII.
Semigroup Forum – Semigroup Forum
Sémin. Lothar. Comb. - Séminaire Lotharingien de Combinatoire
Siam J. Comput. – Society for Industrial and Applied Mathematics Journal on
Computing
SIAM J. Control Optim. – Society for Industrial and Applied Mathematics Journal on
Control and Optimisation
SIAM J. Discrete Math. - Society for Industrial and Applied Mathematics Journal on
Discrete Mathematics
Stochastic Processes Appl. – Stochastic Processes and their Applications
Theor. Comput. Sci. – Theoretical Computer Science
Theory Comput. Syst. – Theory of Computing Systems
Topolog. Appl. – Topology and its Applications
Trans. Am. Math. Soc. – Transactions of the American Mathematical Society
Turk. J. Math. - Turkish Journal of Mathematics
Util. Math. – Utilitas Mathematica
4OR: A Quarterly Journal of Operations Research

List C - University of Essex

Transcription

Similar documents