BRITISH COMBINATORIAL COMMITTEEBRITISH COMBINATORIAL BULLETIN 2017 This is the 2017 British...
181
British Combinatorial Bulletin 2017
Transcript of BRITISH COMBINATORIAL COMMITTEEBRITISH COMBINATORIAL BULLETIN 2017 This is the 2017 British...
British
Combinatorial
Bulletin
2017
BRITISH COMBINATORIAL BULLETIN 2017
This is the 2017 British Combinatorial Bulletin. The format is essentially as in
previous years. The Newsletter (produced twice a year, in April and October) gives
some rather more informal information. I am again this year trying to provide links to
papers etc. where I am aware of them, which I hope will help users.
Can I again thank all institutional representatives for their enormous help in
preparing this Bulletin. The BCB is very much what you make of it, and thus your
suggestions (or those of your colleagues) for improvements remain very welcome. If
anyone is interested in becoming a representative for an institution which doesn’t
currently have one, please let me know – the object of the exercise is to spread
information, and so the more representatives we can have the better.
Recall that the Bulletin website has now formally moved to
http://privatewww.essex.ac.uk/~dbpenman/BCB/index.htm There is forwarding from
the old site to the new one which seems to be working well: please advise the editor
of any issues.
I apologise for the slightly late going to press this year: this is due to a variety of
small issues. The cut-off date for inclusion is still 1st May so comparability with
previous and subsequent years should have been maintained.
You are again reminded that the Bulletin Editor also maintains a mailing list for
the announcement of meetings, research-student and above level courses, job adverts
and other occasional items (e.g. inaugural lectures) in the UK. Any person who
wishes to join or leave this list may do so at any time by emailing the Editor (email as
below). Use of the list is subject to the listholder being satisfied as to an applicant’s
bona fides and to adherence to the Responsible Usage Policy.
David Penman
Editor
7 May 2017.
The BCB webpage is: http://privatewww.essex.ac.uk/~dbpenman/BCB/index.htm
Email should be addressed to: [email protected]
The British Combinatorial Committee is a charity registered in Scotland, No:
SC019723.
Committee Membership.
The Committee currently consists of: Peter Cameron (Chairman), James Hirschfeld
(Secretary), Keith Edwards (Treasurer), Simon Blackburn, David Conlon, Jan van den
Heuvel, Sophie Huczynska, Sergey Kitaev (BCC26 Local Organiser),. Anja Komatar
(PCC Organiser), Iain Moffatt, David Penman (Bulletin editor), Bridget Webb
(Archivist).
Support for Conferences
Please contact the British Combinatorial Committee if you are thinking of organizing
a meeting on combinatorial topics in the UK: in most cases, the Committee can offer
financial support. Institutions requesting support are normally expected to make a
contribution from their own funds or elsewhere. Proposals for consideration by the
Committee, including outline plans and an outline budget, should be sent by email to
the Secretary, James Hirschfeld ([email protected])
Archive
Bridget Webb now holds the archive at the Open University. If you have any items for
inclusion or would like to see any items please contact her: [email protected]
News of forthcoming meetings.
As noted in the Introduction, we have moved the news of forthcoming meetings to the
Newsletter so as to avoid overlap. Remember that (all) British Combinatorial
Newsletters are available at http://www.essex.ac.uk/maths/BCB/newsletters.htm
and the most recent one, produced at (essentially) the same time as this Bulletin, is
number 22. The Newsletter also includes details of e.g. visitors, recent Ph.D theses
and some other items.
Accounts
Please note that the statement about accounts on the next page has still to be
approved by the Committee at its meeting in mid-May 2017.
BRITISH COMBINATORIAL COMMITTEE
Receipts and Payments Account for the period
1 October 2015 to 30 September 2016
Year to Year to
30/9/2016 30/9/2015
Receipts £ £
Interest 68.31 62.69
Royalties from Cambridge University Press 2034.62
Return of unused part of grant for PCC2015 394.40
Total receipts 2497.33 62.69
Payments
Grants for one-day conferences (6 events in 2014/15) 781.41 2941.94
Grant for London 2-day conferences (QMUL/LSE, 2015 and 2016) 2001.33 926.96
Scottish Combinatorics Meeting, April 2016. 365.00 413.00
(Expenses for committee meetings) 165.00
(Open University Combinatorics Prize) 100.00
(Postgraduate Combinatorics Conference 2015) 500.00
Total payments 3147.74 5046.90 Surplus / (deficit) for year (650.41) (4984.21)
All funds are unrestricted
Statement of Balances as at 30 September 2016 2015
£ £
Bank accounts:
Opening balances 18568.61 23552.82
Surplus (deficit) for year (650.41) (4984.21)
Closing balances 17918.20 18568.21 Made up of:
Bank of Scotland Treasurer’s Account 1428.76 1147.48
Scottish Widows Bank Charity Deposit Account 16489.44 17421.13
17918.20 18568..61
The British Combinatorial Committee is a charity registered in Scotland,
No: SCO19723
BRITISH COMBINATORIAL COMMITTEE
BRITISH COMBINATORIAL COMMITTEE
(Scottish Charity Number SC019723)
The financial statement for the period 1 October 2015 to 30 September 2016 was
approved by the Trustees on
(date):
and is signed on their behalf by :
Dr K J Edwards (Treasurer)
LIST A.
Combinatorial Mathematicians based in Britain.
A Agarwal, Lovush Leeds
Ahmed, Chwas Leeds
Akrida, Eleni Liverpool
Alabdullah, Salam Sussex
Alderman, James RHUL
Al-Krizi, Athraa Liverpool
Allen, Dr Peter LSE
Allen, Dr Stuart M. Cardiff Al-Kharoosi, Fatma QMUL Alpern, Prof Steve Warwick
Alshamrani, Sultan Liverpool
Anastasiadis,
Eleftherios
Liverpool
Anderson, Dr Ian Glasgow Anthony, Prof Martin LSE Appa, Prof Gautam LSE Arrowsmith, Prof
David K. QMUL
Arikiez, Mohamed Liverpool
Attesis, George Leeds
B
Babbage, Dr Steve Vodafone Group
Baber, Rahil UCL
Badkobeh, Dr. Golnaz Warwick
Bagdasar, Dr Ovidiu D. Derby
Bailey, Prof R.A. St. Andrews/QMUL
Ball, Prof Keith M. Warwick
Bárány, Prof Imre UCL
Barber, Dr. Ben A. Bristol
Barbina, Dr Silvia Open
Batu, Dr Tugkan LSE
Bazlov, Dr Yuri Manchester
Bedford, Dr David Keele
Bello Aguirre, Ricardo Leeds
Bending, Dr Thomas D. Middlesex
Bennett, Mr. Daniel St Andrews
Bevan, Dr. David Strathclyde
Bieniecka, Ewa St Andrews
Bienvenu, Pierre-Yves Bristol
Biggs, Prof Norman L. LSE
Biktasheva, Dr I Liverpool
Blackburn, Prof Simon RHUL
Bleak, Dr Collin St Andrews
Bogacka, Dr Barbara QMUL
Bollobás, Prof Béla Cambridge
Bone, Dr Nicholas Vodafone Group
Bordewich, Dr Magnus Durham
Borovik, Prof
Alexendre V.
Manchester
Böttcher, Dr Julia LSE
Bourne, Mr. Thomas St Andrews
Bowler, Dr Andrew Birkbeck
Bowman, Dr
Christopher
Kent
Bradley-Williams,
David
Central Lancashire
Branke, Prof Jurgen Warwick
Bray, Dr John QMUL
Briggs, Dr Keith BT Martlesham Labs
Brignall, Dr Robert Open
Brightwell, Prof G. R. LSE
Britnell, Dr John R. Imperial
Broomhead, Prof David
S.
Manchester
Bryant, Prof Roger M. Manchester
Burcea, Mihai Liverpool
Burrows, Prof Brian L. Staffordshire
Buxton, Daniel Nottingham Trent
Byott, Dr Nigel P. Exeter
C Cameron, Prof Peter J. /St. Andrews/QMUL Camina, Prof Alan R. UEA Campbell, Dr Colin M. St Andrews Candellero, Dr
Elisabetta
Warwick
Cannnings, Prof Chris Sheffield
Castillo-Ramirez, Dr
Alonso
Durham
Carey, Miss R. St Andrews
Carmesin, Dr. Johannes Cambridge
Chapman, Dr Robin J. Exeter Chen, Prof Bo Warwick Chervak, Ostap Warwick
Chetwynd, Prof
Amanda G Lancaster
Chicot, Dr Katie M. Open Christodolou, Dr G. Liverpool
Chuang, Prof Joseph City
Chuzhanova, Prof
Nadia
Nottingham Trent
Cid, Prof Carlos RHUL Ciechanowicz, Dr C. RHUL
Clarke, Dr Francis W. Swansea Clayton, Mr. Ashley St Andrews
Clifford, Dr Raphael Bristol
Cohen, Prof David E. RHUL Collins, Andrew Warwick
Condon, Padraig Birmingham
Conlon, Dr David Oxford
Constable, Robin L. St Andrews Cooper, Prof. Colin KCL Cooper, Frances Glasgow
Cormode, Prof Graham Warwick
Cosh, Ben Reading Coulson, Matthew Birmingham
Cox, Dr Anton City
Crampton, Prof Jason RHUL Crane, Dr Edward Bristol
Crofts, Dr Jonathan J. Nottingham Trent
Crouch, Dr Simon York Cryan, Dr Mary Edinburgh Csornyei, Prof
Marianna UCL
Czumaj, Prof Artur Warwick
D Dąbrowski, Konrad Durham
Dantchev, Dr Stefan Durham David, Stefan Cambridge
Davies, Ewan LSE
Davies, Peter Warwick
Dawson, Mr. Laurence Durham
Deineko, Dr Vladimir Warwick Deligkas, Argyrios Liverpool
Dettmann, Prof. Carl Bristol
Devine, Dr Paul Liverpool
Dietmann, Dr Rainer RHUL
Doan, Dr Xuan Vinh Warwick
Dong, Keren Liverpool
Donovan, Mr. Casey St Andrews
Duffield, Drew Leicester
Dugdale, Dr J. Keith Reading Dukes, Dr W. Mark B. Strathclyde
Duncan, Dr Andrew J. Newcastle Dunne, Prof Paul. Liverpool
Dyer, Prof Martin Leeds Džamonja, Prof Mirna UEA
E Edwards, Dr Keith J. Dundee Eleftheriou, Andria Essex Ellis, Dr David QMUL
Englert, Dr Matthias Warwick Enright, Dr. Jessica Stirling
Erickson, Alejandro Durham
Erskine, Grahame Open
Erlebach, Prof Thomas Leicester Essam, Prof John W. RHUL Espuny, Alberto Birmingham
Evans, Prof David M. Imperial Everett, Prof M. G. Manchester
F Fairbairn, Dr Ben Birkbeck Falconer, Prof Kenneth
J. St Andrews
Farrugia, Ashley Liverpool
Fearnley, Dr John Liverpool
Federici, Bruno Warwick
Feghali, Carl Durham
Fenner, Prof Trevor I. Birkbeck Fischer, Dr. Felix Glasgow
Fitch, Matthew Warwick
Fleischmann, Prof
Peter Kent
Foniok, Dr. Jan Manchester
Metropolitan
Forbes, Dr Tony D. Open Forster, Dr Thomas. E. Cambridge
Fountoulakis, Dr
Nikolaos
Birmingham
Fraser, James Open
Fraser, Dr. J. St Amdrews
Friedetzky, Dr Tom Durham
G Gadouleau, Dr
Maximilien
Durham
Gagarin, Dr Andrei Cardiff
Gairing, Dr Martin Liverpool
Garbe, Frederik Birmingham
Gąsieniec, Prof Leszek Liverpool Georgakopoulos, Dr
Agelos
Warwick
Georgiou, Dr Nicholas Durham
Gerke, Dr Stefanie RHUL Gilmour, Prof S. G. KCL Glass, Prof Celia A. City Glen, Marc Strathclyde
Glock, Stefan Birmingham
Goldberg, Prof Leslie
A. Oxford
Goldberg, Prof Paul W Oxford Goldschmidt, Prof
Christina
Oxford
Gordon, Dr Neil A. Hull Gorry, Thomas Liverpool
Gowers, Prof W. Tim Cambridge Grabowski, Jan Lancaster
Grabowski, Lukasz Lancaster
Grannell, Prof Mike J. Open Green, Prof Ben J. Oxford Grekioti, Anastasia Leeds
Griggs, Prof Terry Open Grimm, Uwe Open Grimmett, Prof
Geoffrey R.
Cambridge
Grindrod, Prof Peter Oxford
Gulpinar, Dr Nalan Warwick
Gumbrell, Lee RHUL
Gutin, Prof Gregory RHUL Gwynllyw, Dr Rhys West of England
H
Hagen, Dr. Mark Cambridge
Hall, Dr Rhiannon Brunel
Hamed, Zainab Sussex
Hamilton, David Liverpool
Hancock, Robert Birmingham
Handley, Dr Andrew Warwick
Harris, Liam South Wales
Hart, Prof Sarah Birkbeck
Haslegrave, Dr. John Warwick
Hatton, Prof Les Kingston
Hauser, Dr Raphael Oxford
Hazzazi, Mohammad Sussex
Hebbes, Dr Luke Kingston
Heckel, Annika Oxford
Hetherington, Dr
Timothy J.
Nottingham Trent
van den Heuvel, Prof J. LSE
Higgins, Prof Peter M. Essex
Higham, Prof.
Desmond
Strathclyde
Hill, Prof Ray Salford
Hilton, Prof A. J. W. Reading
Hirschfeld, Prof James
W. P.
Sussex
Hmaida, Mufida Leeds
Holroyd, Dr Fred C. Open
Hook, James Manchester
Howard, Dr John LSE
Hu, Ping Warwick
Hubai, Dr. Tamas Warwick
Huber, Dr Anna Derby
Huber, Dr Katharina UEA
Huczynska, Dr Sophie St Andrews
Huggett, Dr Stephen Plymouth
Hunt, Dr Francis South Wales
Hunter, Dr Gordon J.A. Kingston University
Hussein, Ahmed Leeds
Hutchinson, Daniel RHUL
Hyde, James St. Andrtews
I Igwe, Tobenna Peter Liverpool
Ioannou, Anastasia Leicester
Irving, Dr Rob Glasgow
J Jackson, Prof Bill QMUL Jackson, Dr Penelope
S. Stirling
Jennings, Dr Sylvia London South Bank Jensen, Matthew LSE
Jerrum, Prof Mark QMUL Jha, Dr Vikram
Johnson, Dr Marianne Manchester
Johnson, Dr Matthew Durham Johnson, Dr J. Robert QMUL Johnstone, Dr W. Roy Reading Jones, Prof Gareth A. Southampton Jones, Dr Mark C. W. Kingston Jones, Dr Sian South Wales
Jonusas, Mr. Julius St Andrews
Joos, Dr. Felix Birmingham
Jordan, Dr Jonathan Sheffield
Jowhari, Dr. Hossein Warwick
Jurdzinski, Dr Marcin Warwick
K Kambites, Dr Mark Manchester Karaoglu, Fatma Sussex
Keedwell, Dr A. D. Surrey Keevash, Prof Peter Oxford Kelly, Prof F. P. Cambridge
Kemp, Dr A. W.
(Freda) St Andrews
Kemp, Prof David St Andrews Kessar, Prof Radha City
Key, Professor Jennifer
D.
Aberystwyth
Khalid, Nayab St Andrews
Khudaverdian, Dr
Hovannes Manchester
Kim, Jaehoon Birmingham
King, Dr Oliver H. Newcastle King, Prof R. C. Southampton Kirk, David Durham
Kisil, Dr V.V. Leeds Kitaev, Dr Sergey Strathclyde
Kitson, Dr Derek Lancaster
Knapp, Chris Brunel
Konovalov, Dr
Alexander B.
St. Andrews
Korpelainen, Nicholas Derby
Kovalenko, Dr Igor N. London Metropolitan Kowalski, Prof Darius Liverpool
Král’, Prof Dan Warwick
Krasikov, Dr Ilia Brunel Krokhin, Prof Andrei Durham Krysta, Prof Piotr Liverpool Kuber, Mr Amit Manchester
Kühn, Prof Daniela Birmingham
L Laczkovich, Prof
Miklos UCL
Laing, Thalia RHUL
Lamb, Dr John D. Aberdeen Lapinskas, John Oxford
Larcombe, Prof Peter J. Derby Larman, Prof David G. UCL Launois, Prof.
Stephane Kent
Lawson, Dr Mark V. Heriot-Watt Laycock, Prof Patrick
J. Manchester
Lazic, Dr Ranko Warwick
Leader, Prof Imre B. Cambridge
Leese, Dr Robert Oxford Lemmens, Dr Bas Kent
Letzter, Dr. Shoham Cambridge
Lewis, Robert Open
Liebeck, Prof Martin Imperial College Lignos, Ioannis Durham Lindelmann, Prof
Markus
City
Linton, Prof Steve A. St. Andrews Liu, Hong Warwick
Liu, Hsiang Hsuan Liverpool
Lloyd, Dr E. Keith Southampton Lo, Allan Birmingham
Long, Jason Cambridge
Lotfifar, Foad Durham
Loureiro, Dr Ana F. Kent
Lozin, Prof Vadim V. Warwick Luczak, Prof Malwina QMUL Lyle, Dr Sinead UEA
M Macpherson, Prof
H. Dugald Leeds
Mailler, Dr. Cecile Bath
Makroglou, Dr Athena Portsmouth Manlove, Dr David Glasgow Marchant, David Open
Marsh, Prof Robert J. Leeds Martin, Dr. Barnaby Durham
Martin, Dr James Oxford Martin, Prof Keith. RHUL Martin, Prof Paul P. Leeds
Martin, Dr Russell Liverpool Martins, Taisa Lopes Warwick
Mavron, Prof Vassili
C. Aberystwyth
Mazowiecki, Dr. Filip Warwick
McAlpine, Kenneth M. Abertay McCabe, Dr A. Liverpool
McCabe, Dr John H. St Andrews McCreesh, Ciaran Glasgow
McDevitt, Matt St Andrews
McDiarmid, Prof
Colin. J.H. Oxford
McDonough, Dr Tom
P. Aberystwyth
McDowell, Dr. Andrew KCL
McKee, Prof James RHUL McMullen, Prof Peter UCL Meeks, Dr Kitty Glasgow
Meroueh, Ares Cambridge
Mertzios, Dr George B. Durham
van der Merwe, Thyla RHUL
Meshkinfamfard, Mr.
Sepher
Durham
Mijovic, Vuksan St Andrews
Milecevich, Luka Cambridge
Millar, Colin St Andrews
Miller, Dr Alice Glasgow
Min, Jie Liverpool
Mitchell, Prof Chris J. RHUL Mitchell, Dr James D. St Andrews Moffatt, Dr Iain RHUL
Montanaro, Dr Ashley Cambridge
Montgomery, Dr.
Richard
Cambridge
Mordcovich, Adan St Andrews
Morris, Prof Alun O. Aberystwyth Morrison, Natasha Oxford
Mörters, Prof Peter Bath Muller, Haiko Leeds Müller, Prof Thomas
W. QMUL
Murawski, Prof
Andrzej
Warwick
Murphy, Prof Sean P. RHUL Mycroft, Dr Richard Birmingham
N Naia dos Santos, Tassio Birmingham
Narayanan, Dr.
Bhargav
Cambridge
Neale, Dr Vicky Cambridge
Ng, Dr Siaw-Lynn RHUL Nixon, Dr Tony Lancaster
Noble, Dr Steven Birkbeck Noel, Jonathan Oxford
O O'Connor, Dr John J. St Andrews O’Donovan, Bill RHUL
Ojiaku, Jude-Thaddeus Liverpool
Olaosebikan, Sofiat Glasgow
Olsen, Prof Lars St Andrews Osthus, Prof Deryk Birmingham O'Toole, Lawrence RHUL
P
Paget, Dr Rowena E Kent Polanco, Ricardo
Villanueva
RHUL
Paris, Prof Jeff Manchester Parker, Dr Alison Leeds
Paterson, Prof Kenny RHUL Paterson, Dr Maura Birkbeck Paterson, Prof Mike Warwick Patterson, Derek QMUL Paulusma, Dr Daniel Durham Pech, Dr. Clelia M. A. Kent
Penman, Dr David Essex Penrose, Prof Mathew Bath Peresse, Dr Yann Hertfordshire
Perarnau, Dr. Guillem Birmingham
Perkins, Dr Stephanie South Wales Perkins, Dr Will Birmingham
Peyerimhoff, Dr
Norbert
Durham
Pflügel, Dr Eckhard Kingston Pfeiffer, Dr Markus St. Andrews
Pikhurko, Prof Oleg Warwick
Pilipchuk, Dr Marcin Warwick
Pinch, Dr Richard G.E. GCHQ, Cheltenham Poghosyan,
Anush West of England
Potapov, Dr Igor Liverpool
Potts, Prof Chris N. Southampton Powell, Robert Durham
Prellberg, Dr Thomas QMUL Prendiville, Dr. Sean Manchester
Prosser, Dr Patrick Glasgow
Przykucki, Michal J. Oxford
Pu, Dr Ida Goldsmiths, London
Q Quick, Dr Martyn R. St Andrews Quinn, Dr Kathleen
A.S. Open
R Rackham, Tom Oxford Radoja, Matthew Leicester
Radomirović, Dr. Saša Dundee
Rattan, Dr Amarpreet Birkbeck Ray, Prof Nigel Manchester Rees, Prof Sarah E. Newcastle Reilly, Craig Glasgow
Reinert, Prof Gesine Oxford Richerby, Dr David Oxford
Riordan, Prof Oliver Oxford Roberts, Alexander Oxford
Roberts, Bartnaby LSE
Robertson, Prof
Edmund F. St Andrews
Ronel, Tahel Manchester
Roney-Dougal, Dr
Colva. M. St Andrews
Rowley, Prof Peter J. Manchester Rowlinson, Prof Peter Stirling Rudnev, Dr Misha Bristol Ruškuc, Prof Nik St Andrews Russell, Mr. Chris St Andrews
Russell, Dr Paul A. Cambridge Rutherford, Dr Carrie London South Bank
S Saker, Dr Chris J. Essex Salhi, Prof. Abdel Essex Sands, Dr Arthur D. Dundee Sanders, Dr Tom Oxford Sangha, Pavan Liverpool
Sanhueza, Nicolas Birmingham
Savani, Dr Rahul Liverpool Saxl, Prof Jan Cambridge Schroll, Dr Sibyille Leicester
Schulze, Dr Bernd Lancaster
Scott, Prof Alex D. Oxford Selig, Dr. Thomas Strathclyde
Semeraro, Dr. Jason Leicester
Sendova-Franks, Dr A West of England. Sgouritsa, Alkmini Liverpool
Shakhlevich, Natasha Leeds Shang, Tao Liverpool
Shank, Dr R. J. Kent Shareef, Dr Fuad QMUL Shawe-Taylor, Prof
John S. UCL
Sheikh, Aleen RHUL
Sheng, Bin RHUL
Shreeve, Richard I. Royal Grammar School,
High Wycombe Sibborn, Dale RHUL
Siemons, Dr I.
Johannes UEA
Singerman, Prof David Southampton Singmaster, Prof D. B. London South Bank Širáň, Prof Jozef Open Skerman, Fiona Bristol
Skokan, Dr Jozef LSE Smith, Prof Derek H. South Wales Smith, Dr. Jason Strathclyde
Smith, Dr. Paul Cambridge
Soicher, Prof Leonard
H. QMUL
Sokal, Prof Alan D UCL Spirakis, Prof Paul G. Liverpool
Staden, Katherine Warwick
Stauffer, Alexandre Bath
Stark, Dr Dudley S. QMUL Steingrimsson, Prof
Einar
Strathclyde
von Stengel, Prof
Bernhard LSE
Steinberg, Prof Richard LSE Stevens, Sophie Bristol
Stewart, Anthony Durham
Stewart, Prof Iain A Durham Stirling, Dr David S.G. Reading Stöhr, Prof Ralph Manchester
Strauss, Dr Arne Warwick
Strusevich, Dr V. A. Greenwich Sulzbach, Dr. Henning Birmingham
Swanepoel, Dr Konrad LSE
T Tamimi, Baha Essex
Tan, Wei En Birmingham
Tang, Bo Oxford
Talbot, Dr John M. UCL Talbot, Dr Richard F. Staffordshire Tamimi, Bahadeen K. Essex
Thomas, Dr A. D. Swansea Thomas, Prof Richard
M. Leicester
Thomason, Prof
Andrew G. Cambridge
Tiskin, Dr Alex Warwick Todd, Dr Mike St Andrews
Tointon, Dr. Matthew Cambridge
Tokac, Nihan Durham
Tomon, Istvan Cambridge
Torpey, Mr. Michael St Andrews
Treglown, Dr Andrew Birmingham
Trimble, Dr. James Glasgow
Troscheit, Sascha St Andrews
Truman, Paul Keele
Truss, Prof John K. Leeds Tuite, James Open
V Vámos, Prof Peter Exeter Varju, Dr P. P. Cambridge
Vaughan, Dr Emil QMUL Vdovina, Dr Alina Newcastle Vernitski, Dr Alexei Essex De Visschar, Dr Maud City
Vušković, Dr Kristina Leeds
W Wahlström, Dr
Magnus
RHUL
Walker, Prof Mike RHUL Walters, Dr Mark QMUL
Wakters, Steven Glasgow Caledonian
Warnke, Lutz Cambridge
Wastell, Chris Durham
Webb, Dr Bridget S. Open Weber, Prof Richard
R.
Cambridge
Wells, Matthew Essex
Welsh, Prof Dominic Oxford Whistler, William Durham
Whitaker, Dr Roger Cardiff White, Dr Lynda V. ICL, London Whitty, Prof Robin W. QMUL Wildon, Dr Mark RHUL
Williams, Conrad RHUL
Williams, Dr Gerald Essex Williams, Prof H. Paul LSE Wilson, Prof Robert A. QMUL Wilson, Prof Robin J. Open Wilson, Mr. Wilf St Andrews
Willmott, Dr Colin M. Nottingham Trent
Wilson, Samuel Leeds
Wojtczak, Dr D. Liverpool
Wolf, Dr Julia Bristol
Wong, Dr Prudence H Liverpool Woodage, Joanne RHUL
Woodall, Dr Douglas
R. Nottingham
Woodcock, Dr Chris F. Kent Wright, Rob. Vodafone Group Wu, Dr Taoyang UEA
X
Y
Z Zalesskii, Prof A.E. UEA Zito, Dr Michele Liverpool Živný, Dr Stanislav Oxford
Zsak, Dr Andras Cambridge Zverovich, Dr Vadim West of England
List B.
Combinatorial staff, research students, lecture
courses and seminars at departments in Britain.
An asterisk denotes a contact name from whom further information can be obtained.
Under some entries the combinatorial journals currently being taken are listed; a key to the
titles is as follows:
A
Aequationes Mathematicae N
Discrete Mathematics
B
Algebra Universalis O
Discussiones Mathematicae:
GraphTheory
C
Ars Combinatoria P
European Journal of Combinatorics
D
Australasian Journal of Combinatorics Q
Finite Fields and Applications
E
Biometrics R
Geometriae Dedicata
F
Biometrika S
Graphs and Combinatorics
G
Bulletin of the Institute of
Combinatorics and itsApplications
T
IEEE Transactions on Information
Theory
H
Combinatorica U
Journal of Algebraic Combinatorics
I
Combinatorics, Probability and
Computing.
V
Journal of Combinatorial Designs
J
Design, Codes and Cryptography W
Journal of Combinatorial Mathematics
and Combinatorial Computing
L
Discrete and Computational Geometry X
Journal of Combinatorial Theory
Series A
M
Discrete Applied Mathematics Y
Journal of Combinatorial Theory
Series B
a
Journal of Geometry Z
Journal of Cryptology
b
Journal of Graph Theory f
Order
c
Journal of Statistical Planning and
Inference
g
Random Structures and Algorithms
d
Linear Algebra and its Applications h SIAM Journal on Discrete
Mathematics
e
Networks i Utilitas Mathematica
UNIVERSITY OF ABERDEEN Business School University of Aberdeen, Edward Wright Building, Dunbar Street,
Old Aberdeen, AB24 3QY. Tel: 01224 272167
http://www.abdn.ac.uk/business
Dr J.D. Lamb* (graphs, matroids, combinatorial optimisation)
Lecture Courses: There are a number of general discrete mathematics courses.
Current Periodicals; A, B, E, F, H, I, J, L, M, N, P, Q, R, T, V, W, Z, d, g (some electronic
access only).
ABERYSTWYTH UNIVERSITY
Institute of Mathematics, Physics & Computer Science, Aberystwyth University,
Aberystwyth, SY23 3BZ. Tel: 01970 622802 Fax: 01970 622826 email:
http://www.aber.ac.uk/maps/en/
Prof J. D. Key (Honorary Professor: combinatorics, codes)
Prof V.C. Mavron* (Emeritus: designs, codes)
Dr T. P. McDonough (retired, Honorary Lecturer: designs, permutation groups, codes)
Prof A.O. Morris (Emeritus: representation theory and algebraic combinatorics)
Lecture courses None currently.
Current periodicals: P, U, h
UNIVERSITY OF BATH Department of Mathematical Sciences University of Bath, Bath, BA2 7AY Tel:
01225 386989 Fax: 01225 386492
http://www.bath.ac.uk/math-sci
Dr. Ceclie Mailler (probability)
Prof Peter Mörters (Probability, including random walks and random networks)
Prof Mathew Penrose (probability theory, geometric random graphs)
Dr Alexandre Stauffer* (probability including random walks,, random graphs,
percolation and Markov chain mixing times)
Forthcoming visitors to Bath in probability (often interacting with combinatorics) are
listed at http://www.bath.ac.uk/research/centres/probability-laboratory/seminars/
( scroll down the page).
Seminar Probability Seminar (Monday, 12.15):
http://www.bath.ac.uk/research/centres/probability-laboratory/seminars/
Current Periodicals: A, B, D, E, F, H, J, L, M, N, P, Q, R, S, T, U,V, X, Y, Z, a, b, c,
d, e, f, g, h. Most of these are electronic access only (sometimes only after a fixed date)
but E and F are paper access.
BIRKBECK COLLEGE
School of Economics, Mathematics and Statistics Birkbeck College, Malet Street,
London WC1E 7HX. Tel: 0207 631 6428 Fax: 0207 631 6416
http://www.ems.bbk.ac.uk/
Dr Andrew Bowler* (symmetric designs, combinatorial matrices, permutation groups)
Dr Ben Fairbairn (combinatorial algebra).
Prof. Sarah Hart (permutation groups, sum-free sets)
Dr. Steven Noble (graph polynomials and matroids)
Dr Maura B. Paterson (frameproof codes, key distribution schemes, multivariate
equation solving techniques).
Dr Amarpreet Rattan (factorizations of permutations, combinatorial representation
theory, lattice path combinatorics).
School of Computer Science and Information Systems Birkbeck College, Malet
Street, London WC1E 7HX. Tel: 0207 631 6700 Fax: 0207 631 6727
http://www.dcs.bbk.ac.uk/
Prof Trevor I. Fenner (combinatorial algorithms, probabilistic algorithms, random
graphs)
Prof George Loizou (combinatorial algorithms)
Dr Oded Lachish (combinatorial algorithms).
UNIVERSITY OF BIRMINGHAM
School of Mathematics University of Birmingham, Edgbaston, Birmingham B15 2TT.
Tel: 0121 414 6587 Fax: 0121 414 3389
http://www.mat.bham.ac.uk
http://web.mat.bham.ac.uk/combinatorics/main.html (for combinatorics group).
Dr Nikolaos Fountoulakis (Random Graphs, Randomized Algorithms)
Prof Daniela Kühn (Extremal and Probabilistic Combinatorics)
Dr Allan Lo (Extremal Combinatorics)
Dr Richard Mycroft (Extremal Combinatorics)
Prof Deryk Osthus* (Extremal and Probabilistic Combinatorics)
Dr. Guillem Pernarua (Probabilistic Combinatorics)
Dr Will Perkins (Probabilistic Statistics, Algorithms)
Dr Andrew Treglown (Extremal Combinatorics)
Research Fellows
Dr. Felix Joos (Combinatorics)
Dr Jaehoon Kim (Combinatorics)
Research Students
Padraig Condon
Matthew Coulson
Alberto Espuny
Frederik Garbe (Dr Mycroft)
Stefan Glock (Prof Osthus)
Robert Hancock (Dr Treglown)
Tassio Naia Dos Santos (Dr Mycroft)
Nicolas Sanhueza
Wei En Tan (Dr Hefetz)
Amelia Taylor (Prof Kühn)
Lecture courses
Combinatorial Optimisation (22 lectures, 3rd
year)
Discrete Mathematics (22 lectures, 1st year)
Combinatorics (22 lectures, 3rd
and 4th
year)
Communication Theory (22 lectures, 3rd
and 4th
year)
Computability (22 lectures, 3rd
and 4th
years)
Advanced Topics in Combinatorics (22, 4th
year)
Graph Theory (44, 3rd
and 4th
year)
Seminar Combinatorics Research Seminar (usually Thursdays 2 p.m)
http://web.mat.bham.ac.uk/combinatorics/
UNIVERSITY OF BRISTOL
Department of Mathematics University of Bristol, University Walk, Bristol, BS8
1TW, Tel: 0117 928 7978, Fax: 0117 928 7999.
http://www.maths.bris.ac.uk
Prof Carl Dettmann (random geometric graphs, wireless networks, dynamical
systems, statistical physics)
Dr Oliver Johnson (group testing, entropy, log-concavity)
Dr Misha Rudnev (harmonic analysis, geometric combinatorics, hard Erdős problems)
Dr Julia Wolf (additive Combinatorics)
Prof Trevor Wooley (number theory)
Research Fellows
Dr. Ben Barber* (extremal combinatorics)
Dr Thomas Bloom (arithmetic combinatorics)
Dr Edward Crane (Geometric function theory, circle packings, holomorphic dynamics,
discrete probability, two-dimensional statistical mechanics)
Dr Neil Gillespie (error-correcting codes, permutation groups, codes in graphs)
Dr Justin McInroy (groups, algebras, finite geometry, codes)
Department of Computer Science Merchant Venturers Building, Woodland Road,
Bristol, BS8 1UB, Tel. 0117 954 5264, Fax 0117 954 5208
http://www.cs.bris.ac.uk/
Dr Raphael Clifford (algorithms)
Dr Ashley Montanaro (quantum computation, including combinatorial aspects)
Dr He Sun (spectral graph theory, randomised algorithms)
Research Fellows
Dr Allyx Fontaine (algorithms)
Research Students
Pierre-Yves Bienvenu
Daniel El-Baz
Luka Rimanic
Sophie Stevens
Lecture Courses
Combinatorics (36 lectures, 2nd
year)
Optimisation 2 (36 lectures, 2nd
year)
Information Theory (18 lectures, 3rd
year)
Experimental Design (18 lectures, 3rd
year)
Quantum Information Theory (16 lectures, 4th
year)
Complex Networks (36 lectures, 3rd
and 4th
year)
Topics in Discrete Mathematics (15 lectures, 3rd
and 4th
year)
Seminar Combinatorics Seminar on Thursdays at 4.15 p.m: see
http://www.bristol.ac.uk/maths/events/combinatorics/
Current Periodicals:
A, B, E, F, H, I, J, L, M, N, P, Q, R, S, T, U, V, X, Y, Z, a, b, c, d, e, f, g, h (online). E,
h (paper):, plus some old paper copies of A, B, F, H, J, L, M, N, R, T, X, Y, b, d, i.
BT MOBILITY RESEARCH CENTRE, ADASTRAL PARK, MARTLESHAM.
http://keithbriggs.info/
Dr Keith Briggs (graph theory and stochastic processes for network applications).
BRUNEL UNIVERSITY
Department of Mathematical Sciences Brunel University, Kingston Lane, Uxbridge,
Middlesex UB8 3PH. Tel: 01895 265745 Fax: 01895 265732
http://www.brunel.ac.uk/about/acad/siscm/maths
Dr Carolyn Chun (matroids)
Dr Rhiannon Hall* (matroids, graphs)
Dr Ilia Krasikov (graph theory, combinatorics, coding theory, number theory,
orthogonal polynomials)
Lecture courses
Encryption and Data Compression (48 lectures, 3rd
year, Dr Krasikov)
Elements of Combinatorics (24 lectures, 2nd
year, Dr Krasikov)
Fundamentals (24 lectures, 1st year, Dr Winter)
Probability (36 lectures, 1st year, Dr Tajik)
Institutional Research Repository (containing preprints etc.): http://bura.brunel.ac.uk/
Current Periodicals: A, B, E, F, H, I, J, L, M, N, O, P, Q, R, S, T, U, V, X, Y, a, b, c,
d, e, f, g
UNIVERSITY OF CAMBRIDGE
Department of Pure Mathematics and Mathematical Statistics Centre for
Mathematical Sciences, Wilberforce Rd, Cambridge CB3 0WB. Tel: 01223 337999
Fax: 01223 337920
http://www.dpmms.cam.ac.uk/
Prof W. T. Gowers (Trinity) (analysis, combinatorics)
Prof G. R. Grimmett (Churchill) (probability theory, combinatorial theory)
Prof F. P. Kelly (Christ’s) (random processes, networks, optimization)
Prof I. B. Leader* (Trinity) (extremal combinatorics, Ramsey theory)
Prof J. Saxl (Caius) (group theory)
Prof A. G. Thomason (Clare) (combinatorics, graph theory, algorithms)
Prof R. R. Weber (Queen’s) (mathematical operational research, stochastic networks)
Fellows and Research Fellows
Prof Béla. Bollobás (Trinity) (combinatorics, graph theory)
Dr. Johannes Carmesin (infinite graph theory)
Dr Thomas E. Forster (Clare Hall) (logic, set theory, combinatorics)
Dr. Vytautas Gruslys
Dr. Mark Hagen
Dr. Richard Montgomery
Dr. Bhargav P Narayanan
Dr Paul Russell (Churchill) (Ramsey theory)
Dr Matthew Tointon (additive combinatorics)
Dr. Peter Varju
Dr Lutz Warnke (random graphs, probabilistic methods)
Research students
Stefan David (Prof. Bollobás)
Antonio Girao (Prof. Thomason)
Jason Long (Prof. Leader)
Ares Meroueh (Prof Thomason)
Luka Milecevich (Prof. Leader)
Marius Tiba (Prof. Bollobás)
Istvan Tomon (Prof Bollobás)
Lecture courses
Numbers and Sets (24 lectures, 1st year, Prof Leader)
Graph Theory (24 lectures, 3rd
year, Prof Thomason)
Coding and Cryptography (24 lectures, 3rd
year, Dr Keith Carne)
Ramsey Theory (24 lectures, Part III, Prof Leader)
Concentration in discrete random processes (16 lectures, Part III, Dr Warnke)
Extremal and Probabilistic Problems in Combinatorics (16 lectures, Part III, Prof
Bollobás)
Percolation and related topics (16 lectures, Part 3, Prof Grimmett and Dr Kiss)
Additive Combinatorics and Equidistribution (16 lectures, graduate, Dr Peter Varju).
Seminars
Combinatorics (Thursdays at 2.30 p.m.)
Discrete Analysis (Wednesdays at 4.00 p.m.)
UNIVERSITY OF CARDIFF
School of Computer Science Cardiff University, Queen's Buildings, Newport Road,
PO Box 916, Cardiff CF24 3XF. Tel: 029 2087 4812 Fax: 029 2087 4598
http://www.cs.cardiff.ac.uk/
Dr S. M. Allen* (mobile communications, frequency assignment, combinatorial
optimisation, latin squares)
Dr. A. Gagarin (combinatorics, algorithms)
Prof S. Hurley (mobile communications, frequency assignment, combinatorial
optimisation)
Dr R. M. Whitaker (mobile communications, frequency assignment, combinatorial
optimisation, latin squares)
Lecture courses
Discrete mathematics I (1st year)
Discrete mathematics II (2nd
year)
Information Security (3rd
year)
Optimisation and Meta-Heuristics (3rd
year)
Discrete mathematics (M.Sc.)
CITY UNIVERSITY LONDON Faculty of Actuarial Science and Statistics Cass Business School, 106 Bunhill Row,
London EC1Y 8TZ Tel: 020 7040 8959 Fax: 020 7040 8572
http://www.cass.city.ac.uk/facact
Prof C. Glass* (operation research, combinatorial optimisation; computational
complexity; graph theory)
Department of Mathematics Tait Building, Northampton Square, London EC1V 0HB.
Tel 020 7040 6051. Fax 020 7040 8566
http://www.city.ac.uk/department-mathematics
Dr A. Cox (representation theory)
Prof J. Chuang (representation theory of finite groups)
Dr M. De Visschar (representation theory)
Prof R. Kessar (representation theory of finite groups)
Prof M. Lindelmann (representation theory of finite groups)
UNIVERSITY OF DERBY School of Computing and Mathematics Faculty of Business, Computing and Law,
University of Derby, Kedleston Road, Derby DE22 1GB. Tel: 01332 591896
Fax: +44 (0)1332 597741.
http://www.derby.ac.uk/computing
Dr Ovidiu D. Bagdasar (Discrete Mathematics, Optimization, Mathematical
Modelling, Geometry, Complex Analysis)
Dr Anna Huber (Combinatorics)
Dr Nicholas Korpelainen (combinatorics)
Prof Peter J. Larcombe* (hypergeometric function theory, generating functions,
binomial coefficient sums)
Dr Nicholas Korpelainen (structural and algorithmic graph theory, permutation
patterns)
Research students: None
Lecture courses: Graph Theory and its Applications (3rd
year)
Current periodicals: None
UNIVERSITY OF DUNDEE
Computing Computing, University of Dundee, Dundee DD1 4HN. Tel: 01382
388035
http://www.computing.dundee.ac.uk
Dr K. J. Edwards* (Graph colourings, graph decompositions, complexity)
Dr. Saša Radomirović (Combinatorics on words, cryptographic protocols, information
security)
Division of Mathematics University of Dundee, Dundee DD1 4HN. Tel. 01382
386986
http://www.maths.dundee.ac.uk
Dr Arthur D. Sands (retired: Combinatorial problems on finite Abelian groups)
Lecture Courses:
Graph Theory (level 3()
Theory of Computation (Level 3)
Current Periodicals: T, V, b, d
DURHAM UNIVERSITY
Department of Computer Science Science Laboratories, South Road, Durham DH1
3LE Tel: 0191 33 41700 Fax: 0191 33 41701
http://community.dur.ac.uk/algorithms.complexity/
Dr M. Bordewich (computational complexity; randomised algorithms; phylogenetics)
Dr S. Dantchev (proof complexity)
Dr T. Friedetzky (randomised algorithms; probabilistic analysis; sub-linear time
algorithms; communication networks)
Dr M. Gadouleau (coding, network coding, information theory and their links to
combinatorics and matroid theory)
Dr M. Johnson* (graph theory, combinatorial optimization, combinatorial designs)
Prof A. Krokhin (algebra; logic; discrete mathematics; constraint satisfaction;
computational complexity; temporal reasoning)
Dr. B. Martin (computation complexity)
Dr G. Mertzios (Algorithms, Complexity, Networks, Combinatorial Optimization,
Algorithmic Game Theory)
Dr D. Paulusma (graph theory; algorithms; combinatorial optimization; cooperative
game theory)
Prof I. A. Stewart (computational complexity; finite model theory; descriptive
complexity; graph theory; interconnection networks; group theory)
Department of Mathematical Sciences Department of Mathematical Sciences,
Durham University, Science Laboratories, South Rd, Durham DH1 3LE. Tel: 0191-
334-3050
Fax: 0191-334-3051
Dr Nicholas Georgiou (Probabilistic combinatorics and partial orders; modular
decomposition and its connection to the Reconstruction Conjecture)
Dr Norbert Peyerimhoff (global analysis, graph theory, Riemannian geometry)
Research Staff (in Computer Science)
Konrad Dąbrowski (graph algorithms, parameterized complexity)
Alejandro Erickson (combinatorial algorithms, interconnection networks,
mathematical art, tilings and coverings)
Research Students
Laurence Dawson (Prof Stewart)
Carl Feghali (graph algorithms, graph colouring, Dr Johnson)
David Kirk (Dr Dantchev)
Foad Lotfifar (Dr Johnson)
Sepehr Meshkinfamfard (Dr Friedetzky)
Anthony Stewart (graph algorithms, Dr Paulusma)
Adam Symonds (Dr Dantchev)
Dan Thomas (Dr Johnson)
Nihan Tokac (Dr Bordewich)
Chris Wastell (Dr Friedetzky)
William Whistler (Prof Krokhin).
Lecture Courses:
Algorithms and Data Structures (1st year, 40 lectures, Dr Friedetzky and Dr Johnson)
Logic and Discrete Mathematics (1st year, 40 lectures, Prof Krokhin and Dr Paulusma)
Algorithms and Complexity (2nd year, 20 lectures, Dr Gadouleau and Dr Mertzios)
Advanced Algorithms (3rd year, 10 lectures, Dr Johnson)
Advanced Computational Complexity (3rd year, 10 lectures, Prof Krokhin)
Algorithmic Game Theory (3rd year, 10 lectures, Dr Dantchev)
Information Theory (3rd year, 10 lectures, Dr Gadouleau)
Seminars
The Algorithms and Complexity Group have a weekly seminar, current webpage.
http://community.dur.ac.uk/algorithms.complexity/seminars.html
Current Periodicals: A, B, D, H, I, J, L, M, N, O, P, S, U, V, X, Y, Z, a, b, g, h.
(electronic only except H, I. H which are hardcopies).
UNIVERSITY OF EAST ANGLIA, NORWICH
School of Mathematics University of East Anglia, Norwich NR4 7TJ. Tel: 01603
456161 Fax: 01603 259515
http://www.uea.ac.uk/mth
Prof A.R. Camina (block designs, finite groups)
Prof M. Džamonja (logic, set theory, infinite combinatorics)
Dr Robert D. Gray* (algebra and combinatorics)
Dr S. Lyle (representation theory).
Dr I. J. Siemons (permutation groups, topological and homological methods)
Prof A.E. Zalesskii (group theory, ring theory)
School of Computing Sciences University of East Anglia,Norwich, NR4 7TJ,
United Kingdom. Tel. +44 (0) 1603 592607. Fax. +44 (0) 1603 593345
http://www.uea.ac.uk/cmp/
Dr Katharina Huber (finite metic spaces, phylogenetics, discrete algorithms,
applications of combinatorial approaches to computational biology)
Prof Vincent Moulton (finite metric spaces, phylogenetics, discrete algorithms, graph
theory, applications of combinatorial approaches to computational biology)
Research students
Mr. Badr Allhadri (Dr Lyle)
Miss S. Bastkowsk (phylogenetics, Prof Moulton)
Mr. S. Greatrix (phylogenetics, Prof Moulton)
Mr. R. Suchecki (phylogenetics, Dr Huber)
Lecture courses (check availability):
Discrete Mathematics (2nd
year)
Set theory (3rd
year)
Infinite permutation groups (4th
year, p/g)
Representation Theory (3rd
year)
Graph theory (3rd
year)
Group theory (3rd
year)
Computability (3rd
year)
Model theory (3rd
year)
UNIVERSITY OF EDINBURGH
School of Informatics 2 Buccleuch Place, Edinburgh EH8 9LW Tel. 0131 650 2691
Fax: 0131 650 6626
http://www.inf.ed.ac.uk
Dr Mary Cryan* (algorithms and complexity)
Research students
Lecture Courses
Algorithms and Data Structures (3rd
year)
Computability and Intractability (3rd
year, MSc)
Computational Complexity (4th
year)
Current Periodicals: E, H, M, T, X, Y
UNIVERSITY OF ESSEX
Department of Mathematical Sciences University of Essex, Wivenhoe Park,
Colchester CO4 3SQ. Tel: 01206 873040 Fax: 01206 873043
http://www.essex.ac.uk/maths
Dr David Branson (retired: applied probability, combinatorics of Stirling numbers)
Dr. Jessica Claridge (part-time: cryptography)
Prof Peter.M. Higgins (combinatorics of algebraic semigroup theory, cryptography)
Dr. Vanni Noferini (numerical analysis, linear algebra, graphs).
Dr David Penman* (random and pseudo-random graphs, aspects of poset theory and
additive combinatorics)
Dr Chris Saker (part-time: combinatorics on words, semigroup theory, cryptography)
Dr Abdellah Salhi (combinatorial optimisation)
Dr Alexei Vernitski (algebra, combinatorics, computer security)
Dr Gerald Williams (computational group theory)
Research students
Andria Eleftheriou (reliability of graphs: Dr Penman: part-time)
Baha Tamimi (critical groups of graphs, Dr Penman and Dr Williams, part-time)
Lecture Courses
Graph Theory (3rd
year, Dr Martin Griffiths) (30 lectures)
Codes and Cryptography (Dr Williams, 3rd
year) (30 lectures)
Combinatorial optimisation (Dr Xinan Yang, 3rd
year) (30 lectures)
Current periodicals: H, P, h.
UNIVERSITY OF EXETER
School of Engineering, Computing and Mathematics Harrison Building, University
of Exeter, North Park Road, Exeter EX4 4QF.
Tel: 01392 263650 Fax: 01392 264067
http://www.secam.ex.ac.uk/mat
Dr R. J. Chapman* (finite fields,coding theory, enumerative combinatorics)
Prof P. Vámos (retired: representation of matroids)
Lecture courses
Discrete Mathematics and Probability (1st year)
Coding theory (3rd
year)
Combinatorics (3rd
year)
Graphs, Networks and Algorithms (3rd
year)
Current periodicals: C, D, W
(For “Glamorgan”, see now “University of South Wales”).
UNIVERSITY OF GLASGOW
School of Mathematics and Statistics University of Glasgow, University Gardens,
Glasgow G12 8QW. Tel: 0141 330 5176 Fax: 0141 330 4111
www.gla.ac.uk/schools/mathematicsstatistics
Dr I. Anderson (Honorary research fellow: designs, whist tournaments)
School of Computing Science Sir Alwyn Williams Building, Lilybank Gardens,
Glasgow G12 8QQ Tel: 0141 330 4256 Fax: 0141 330 4913
http://www.gla.ac.uk/schools/computing/
Dr. F. Fischer (mechanism design, optimization, algorithms)
Dr R.W. Irving (combinatorial and graph algorithms) (Honorary Research Fellow)
Dr D.F. Manlove (combinatorial and graph algorithms)
Dr K. Meeks* (graph theory, algorithms, parameterised complexity, networks.
Dr A. Miller (combinatorial and graph algorithms)
Dr P. Prosser (combinatorial and graph algorithms)
Research students
Frances Cooper (combinatorial and graph algorithms, Dr Manlove)
Ciaran McCreesh (combinatorial and graph algorithms, Dr Prosser)
Sofiat Olaosebikan (combinatorial and graph algorithms, Dr Manlove)
Craig Reilly (Parallel graph search with isomporphism elimination, Dr Miller)
James Trimble (combinatorial and graph algorithms, Dr Manlove and Dr Prosser)
Lecture courses
Algorithmic Foundations 2 (Computing Science, 2nd
year, 22 lectures, Dr Norman)
Algorithms and Data Structures 2 (Computing Science, 2nd
year, 22 lectures, Dr.
Prosser)
Algorithmics I (H) (Computing Science, 3rd year, 20 lectures, Dr Norman)
Algorithmics II (H) (Computing Science, 4th year, 20 lectures, Dr. Fischer and Dr
Manlove)
Constraint Programming M (Computing Science, 4th year, 20 lectures, Dr Prosser)
Graphs and Networks (Maths, 22 lectures, 2nd year)
Topics in Discrete Mathematics (Maths, 21 lectures, 2nd year)
Seminars: Formal Analysis, Theory and Algorithms (Tuesday, 1 pm, during semester
time). (Dr Michele Sevegnani)
http://www.gla.ac.uk/schools/computing/research/researchoverview/fata-section
Current periodicals: C, O, i (paper only)
M, N, Q, R, V, X, Y, b, c, h (paper and electronic)
A, B, F, H, I, L, P, S, T, U, Z, a, d, e, f, g (electronic only).
GOLDSMITHS COLLEGE
Department of Computing Goldsmiths College, University of London, New Cross,
London SE14 6NW. Tel: 0207 919 7850 Fax: 0207 919 7853
http://www.goldsmiths.ac.uk/computing/
Dr I. Pu* (combinatorial algorithms, randomized, parallel, probabilistic and average
case algorithmics)
Lecture courses
Discrete Mathematics (1st year)
Data Structures and algorithms (2nd
year, Dr Pu)
Graph Theory (3rd
year)
Current Periodicals: X, Y, b
GOVERNMENT COMMUNICATIONS HEADQUARTERS Hubble Road, Cheltenham, GL51 0EX. Tel: 01242 221491 Fax: 01242 226816
http://www.gchq.gov.uk/
Dr R.G.E. Pinch*
UNIVERSITY OF GREENWICH
School of Computing and Mathematical Sciences University of Greenwich, London,
SE18 6PF Tel: 0208 316 8000 Fax: 0208 855 4033
http://www.gre.ac.uk/schools/cms
Prof V.A. Strusevich (combinatorial optimization, scheduling theory)
Current Periodicals: T
HERIOT-WATT UNIVERSITY
Department of Mathematics Heriot-Watt University, Riccarton, Edinburgh EH14
4AS. Tel: 0131 451 3221 Fax: 0131 451 3249
http://www.ma.hw.ac.uk/maths.html
Dr. Laura Ciobanu (group theory, combinatorics, formal languages)
Dr M.V. Lawson (semigroup theory, combinatorics on words)
Department of Actuarial Mathematics and Statistics Heriot-Watt University,
Riccarton, Edinburgh EH14 4AS. Tel: 0131 451 3202 Fax: 0131 451 3249
http://www.ma.hw.ac.uk/ams
Dr Jennie Hansen (probabilistic combinatorics)
Lecture course Discrete mathematics (45 lectures, 3rd year honours degree)
Current periodicals: E, F, I, c, g, h
UNIVERSITY OF HERTFORDSHIRE
School of Physics, Astronony and Mathematics. University of Hertforshire, College
Lane, Hatfield, Hertfordshire, AL10 9AB
Tel. +44 (0)1707 284394
http://www.herts.ac.uk/apply/schools-of-study/physics-astronomy-and-mathematics
Dr Catarinha Carvalho (algebra, combinatorics, theoretical computer science)
Dr Yann Peresse (algebra, combinatorics)
ROYAL GRAMMAR SCHOOL, HIGH WYCOMBE.
Dr Richard I Shreeve (retired) (combinatorics in general, specifically enumeration of
3-topes and 𝑛-topes).
Lectures: Occasional lectures to Oxbridge applicants.
UNIVERSITY OF HULL
Department of Computer Science University of Hull, Hull HU6 7RX Tel: 01482
465951/465067 Fax: 01482 466666
http://www.dcs.hull.ac.uk
Dr N.A. Gordon (465038) (finite geometry, computer algebra)
Research report series http://www.hull.ac.uk/php/masrs/
Current periodicals: T. Electronic access to H, J, P, Q, R, S, U, V, X, Y, a, b, d
IMPERIAL COLLEGE LONDON
Department of Mathematics Imperial College London, London SW7 2AZ. Tel: 0207
594 8517 Fax: 0207 594 8483
http://www.ma.ic.ac.uk
Dr John Britnell (group theory, algebraic combinatorics)
Prof D. M. Evans (permutation groups, automorphism groups of infinite structures)
Prof A. Ivanov (distance-transitive graphs)
Prof M. W. Liebeck (group theory, algebraic combinatorics)
Dr O. Pretzel (combinatorics)
Dr Alexander Kasprzyk (algebraic geometry, combinatorics of convex lattice
polytopes).
Department of Electrical Engineering Imperial College
Dr Moez Draeif (applied probability including random graphs).
KEELE UNIVERSITY
School of Computing and Mathematics Keele University, Keele, Staffordshire ST5
5BG. Tel: 01782 733258 Fax: 01782 734268
http://www.keele.ac.uk/scm/
Dr D. Bedford* (latin squares; designs)
Dr J. Preater (applied probability, random graphs)
Dr. P. Truman (Algebraic number theory and combinatorics)
Lecture courses
Advanced Combinatorics (40 lectures, 4th
year, Dr Bedford)
Codes and Cryptography (30 lectures, 3rd
year, Dr Truman)
UNIVERSITY OF KENT
School of Mathematics, Statistics and Actuarial Science Sibson Building, University
of Kent, Canterbury, Kent CT2 7FS. Tel: 01227 827181 Fax: 01227 827932
http://www.kent.ac.uk/smsas/
Dr. C. D. Bowman (combinatorics and representation theories of diagrammatic
algebras)
Prof P. Fleischmann (algebraic combinatorics, root systems, Mobius function)
Prof. S. Launois (q-calculus)
Dr B. Lemmens (applications of discrete geometry in dynamics and analysis)
Dr. A. F. Loureiro (orthogonal polynomials)
Dr R. E. Paget* (representation theory of symmetric groups and related algebras,
plethysm)
Dr. C. M. A. Pech (cluster algebras)
Dr R. J. Shank (modular invariant theory)
Dr C. F. Woodcock (orthogonal Latin squares)
Dr M. Towers (representation theory of quantum algebras)
Research students
Reuben Green (Dr Paget)
Brendan Nolan (Prof Launois)
Alexandra Rogers (Prof Launois)
Lecture courses
Discrete mathematics (36 lectures, 3rd year, Dr Woodcock) Graphs and combinatorics (36 lectures, 3rd year / M.Sc., Dr Lemmens) Symmetries, Groups and Invariants (3rd year / M.Sc., Prof Fleischmann)
Current periodicals: electronic access to A, B, E, F, H, J, L, M, N, O, P, Q, R, S, U, V,
X, Y, Z, a, b, c, d, e, f, g.
KING'S COLLEGE LONDON
Department of Computer Science King's College, Strand, London, WC2R 2LS Tel
020 7848 2588 Fax: 020 7848 2851
http://www.dcs.kcl.ac.uk
Dr Colin Cooper (random graphs, random algorithms)
Dr Tomasz Radzik (algorithms, combinatorial algorithms etc.).
Research Fellow
Dr. Andrew McDowell (Combinatorics)
KINGSTON UNIVERSITY
Faculty of Science, Engineering and Computing Kingston University,
Penrhyn Road, Kingston-upon-Thames, KT1 2EE
http://sec.kingston.ac.uk/
School of Mathematics
Dr Gordon J. A. Hunter* (Applications of graph theory to Natural Language
Modelling, Statistical Physics and Computational Networks)
Dr Mark Jones (Number Theory and Cryptography)
School of Computing and Information Systems
Prof Les Hatton (forensic software engineering).
Dr Luke Hebbes (software, turbocodes)
Dr Eckhard Pflügel (Cryptography and Information Security)
Lecture courses
Mathematical Programming (final year BSc, Dr Jones)
Internet security (final year BSc, Dr Pflügel);
Cryptography (MSc, Dr Pflügel)
The Department runs MSc Programmes in Network & Information Security,
Networking & Data Communications.
Current periodicals: E, F, N, P, X, Y
UNIVERSITY OF LANCASTER
Department of Mathematics and Statistics Fylde College, University of Lancaster,
Lancaster LA1 4YF. Tel: 01524 593960 Fax: 01524 592681
http://www.maths.lancs.ac.uk
Dr. Natasha Blitvic (algebraic combinatorics, q-series and combinatorics of
mathematical physics)
Prof A.G. Chetwynd (combinatorial applications in statistics)
Dr. Jan Grabowski (cluster algebras, quantum spaces and the combinatorics of their
torus-invariant prime ideal spectrum)
Dr Lukasz Grabowski (graph limits)
Dr. Derek Kitson (geometric and combinatorial rigidity, operator theory, analysis)
Dr. Nadia Mazza (representation theory)
Dr Tony Nixon* (combinatorial rigidity, discrete geometry, graph theory, matroid
theory)
Dr Bernd Schulze (discrete geometry, rigidity and flexibility of geometric constraint
systems, graph theory, matroid theory)
Prof. Stephen Power (combinatorial rigidity, geometric constraint systems, rigidity
operators).
Research Students:
Thomas Booker Price (Dr Grabowski)
Hattie Serocold (Dr Schulze)
Lecture courses:
Discrete Mathematics (1st year)
Combinatorics (3rd year)
Current periodicals: E, F, T, U., Y, b, e
UNIVERSITY OF LEEDS
School of Mathematics University of Leeds, Leeds LS2 9JT. Tel: 0113 3435140 Fax:
0113 3435090.
http://www.amsta.leeds.ac.uk/
Dr V. V. Kisil (Applications of coherent states, wavelet transform and group
representations in quantum mechanics, combinatorics, etc).
Prof H. D. Macpherson (permutation groups and related combinatorics, logic)
Prof R. J. Marsh (Cluster algebras and related combinatorics, Coxeter groups,
Representation Theory)
Prof P. P. Martin (Representation theory, connections to Combinatorics)
Dr A. E. Parker (Representation theory and connections to Combinatorics)
Prof J. K. Truss (permutation groups, automorphisms of graphs and ordered structures,
logic)
School of Computing University of Leeds, Leeds LS6 2HN Tel. 0113 343 5430 Fax
0113 343 5468
http://www.scs.leeds.ac.uk
Prof Martin Dyer (algorithms and complexity)
Dr Haiko Müller* (algorithms, graph theory)
Dr Natasha Shakhlevich (deterministic scheduling theory, combinatorial optimisation,
computational complexity)
Prof Kristina Vušković (graph theory, algorithms and combinatorial optimisation)
Research Students
Lokush Agarwal (Prof Truss)
Chwas Ahmed (Dr Parker, Prof Martin)
Andres Aranda Lopez (Prof MacPherson)
George Attesis (Prof MacPherson)
Robert Barham (Prof Truss)
Ricardo Bello Aguirre (Prof MacPherson)
David Bradley-Williams (Prof MacPherson and Prof Truss)
Heather Burke (Prof Martin, Prof Crawley-Boevey)
Cong Chen (Prof Truss)
Ragab Elageili (Prof Truss)
Anastasia Grekoiti (Dr Shakhlevich)
Mufida Hmaida (Prof Martin)
Ahmed Hussein (Dr Parker, Prof Martin)
Tristram Jenkinson (Prof Truss)
Mayra Montalvo Ballasteros (Prof Truss)
Andrew Reeves (Prof Martin, Prof Crawley-Boevey)
Samuel Wilson (Dr Müller)
Daniel Wood (Prof MacPherson)
Lecture courses
Introduction to Discrete Mathematics (22 lectures, 2nd
year, Dr Penazzi)
Graph theory (33 lectures, 3rd
year, Prof MacPherson)
Advanced Graph Theory (44 lectures, 4th
year/M.Sc., Prof MacPherson)
Coding Theory (22 lectures, 3rd
year, Prof Read)
Combinatorics (22 lectures, 3rd
year, Dr Parker)
Mathematics for Computing (22 lectures, 1st year, Prof Vušković)
Current periodicals: (all online only): E, F, M, N, P, Q, T, V, X, Y, b,c,d,e,g,h.
UNIVERSITY OF LEICESTER
Department of Informatics University of Leicester, University Road, Leicester LE1
7RH. Tel: 0116 252 3887 Fax: 0116 252 3604
http://www2.le.ac.uk/departments/informatics
Prof T. Erlebach* (combinatorial optimization, approximation algorithms,
algorithmic graph theory)
Prof R. M. Thomas (combinatorial group and semigroup theory, automata theory)
Research Students
Anastasia Ioannou (modelling systems via Petri nets, Prof Thomas)
Matthew Radoja (algorithmic game theory, Prof Erlebach)
Lecture courses
Discrete Structures (14 lectures, 1st year, Prof Thomas)
Automata, Languages and Computation (30 lectures, 2nd year, Prof Thomas)
Analysis and Design of Algorithms (30 lectures, 3rd year, Dr Fung)
Cryptography and Information Security (30 lectures, 3rd year, Dr Fung and Dr Tuosto)
Discrete Event Systems (24 lectures, M.Sc., Dr Hoffmann)
Algorithms for Bioinformatics (24 lectures, M.Sc., Dr. Fung)
Game Theory in Computer Science (24 lectures, M.Sc., Dr de Vries)
Seminars There is a regular seminar program, see
http://www2.le.ac.uk/departments/informatics/news/researchevents
Department of Mathematics, University of Leicester, University Road, Leicester LE1
7RH. Tel: 0116 252 3917 Fax: 0116 252 3915
http://www2.le.ac.uk/departments/mathematics
Dr S. Schroll (representation theory of algebras, homological algebra, matroids and
hypergraphs)
Dr. J. Semeraro (combinatorics, group theory, representations).
Research students
Drew Duffield (Brauer graph algebras, Dr Schroll)
Dr. Schroll also has a joint PhD student with Duardo Marcos in Sao Paolo, Brazil.
Seminars There is a regular seminar program, see
http://www2.le.ac.uk/departments/mathematics/research/pure/colloquium
http://www2.le.ac.uk/departments/mathematics/research/applied/applied_seminar
Current periodicals: E, F, M, N, T, X, Y, b, d, h (paper)
E, F, M, N, P, Q, R, T, U, X, Y, b, c, d, e, f, g, h (electronic)
UNIVERSITY OF LIVERPOOL
Department of Computer Science University of Liverpool, Ashton Building,
Liverpool L69 3BX, United Kingdom. Tel. 0151 795 4276 Fax: 0151 795 4235.
http://www.csc.liv.ac.uk/
Prof P. Dunne (Complexity theory and algorithm design)
Prof L. Gasieniec (Distributed and parallel computing; network communication;
algorithmic agent design; string matching)
Prof D. Kowalski (Distributed computing; network communication
algorithms; fault tolerance; combinatorial and randomized data structures)
Prof P. Krysta (algorithmic game theory, Algorithmic mechanism design,
Combinatorial optimisation, Approximation algorithsm)
Prof P. Spirakis (Algorithms & Complexity, Probabilistic methods in algorithms,
algorithmic game theory)
Dr A. McCabe (auctions and mechanism design).
Dr I. Biktasheva (Computational mathematics; computational biology; autowaves and
autowave vortices; computer modeling for cardiology; high performance computing)
Dr G. Christodoulou (Algorithmic game theory, Inefficiency of equilibria,
Algorithmic mechanism design)
Dr M. Gairing (Algorithmic Game Theory, Approximation Algorithms)
Dr R. Martin (Distributive computing, randomized algorithma, enumerative
combinatorics)
Dr I. Potapov (Design and analysis of algorithms; computational models and automata
theory; decidability issues)
Dr R. Savani (Algorithmic Game Theory, Equilibrium Computation, Automated and
Algorithmic Trading)
Dr D. Wojtczak (stochastic games, Markov chains, algorithmic game theory, control
theory, modelling of biological and queueing systems)
Dr P. Wong (combinatorial algorithms, scheduling, packing, computational biology)
Dr M. Zito* (algorithms and complexity, random structures)
Research Fellows
Dr John Fearnley (Algorithmic Game Theory. Logic and Computation).
Dr. Pavel Semukhrin (reachability problems, automatic structures, computational
learning theory, computability theory)
Dr Jinshan Zhang (Algorithmic game theory, Algorithmic mechanism design)
Research Students
Eleni Akrida (algorithms, graph theory, random graphs)
Athraa Al-Krizi (network security)
Sultan Alshamrani (cloud computing, network patrolling)
Eleftherios Anastasiadis (Algorithmic game theory, Mechanism design)
Mohamed Arikiez (Smart home energy management systems)
Mihai Burcea (Energy-efficient algorithms; energy-efficient scheduling; windows
scheduling; dynamic bin packing)
Thomas Carroll (String algorithms, Combinatorics, Bioinformatics, GPU Computing)
Argyrios Deligkas (Mechanism design, Revenue maximisation)
Keren Dong (Automated and Algorithmic Trading)
Ashley Farrugia (Dynamic vehicle routing mechanisms; off-line and online time
series analysis of vehicle data)
Thomas Gorry (Distributed computing; algorithmic agent design; rendezvous)
David Hamilton (visualisation and animation mechnisms for large networks)
Tobenna Peter Igwe (Algorithmic Game Theory)
Hsiang Hsuan Liu (algorithm design, parameterized complexity)
Jie Min (recognition of structural properties in complex networks)
Reino Niskanen
Jude-Thaddeus Ojiaku (Energy efficient algorithms, GPU computing)
Pavan Sangha (Random graphs)
Alkmini Sgouritsa (Algorithmic Mechanism Design, Algorithmic Game Theory,
Algorithms, Complexity)
Tao Shang (migration mechanisms in social networks)
Bo Tang (Algorithmic game theory)
Lecture courses:
Comp108: Algorithmic Foundations (1st year)
Comp109: Foundations of Computer Science (1st year)
Comp202: Complexity of Algorithms (2nd
year)
Comp218: Decision, Computation and Language (2nd
year)
Comp309: Efficient Sequential Algorithms (3rd
year)
Comp323: Introduction to Computational Game Theory (3rd
year)
Comp324: Complex Information and Social Networks (3rd
year)
Comp523: Advanced Algorithmic Techniques (Master’s)
Comp526: Applied Algorithmics (Master’s)
Comp557: Optimisation (Master’s)
Comp559: Computational Auctions and Mechanism Design (Master’s)
Seminar:
Each research group holds regular seminars.
With strong mathematical interests is also the NeST initiative:
http://www.liv.ac.uk/network-science-technologies
LONDON SCHOOL OF ECONOMICS
Department of Mathematics London School of Economics, Houghton Street, London
WC2A 2AE. Tel: 0207 955 7732 Fax: 0207 955 6877
http://www2.lse.ac.uk/maths
Dr Peter Allen (extremal graph theory)
Prof Martin Anthony (computational learning theory, neural networks, theory of
computing)
Dr Tugkan Batu (randomized computation, algorithms on massive data sets, property
testing, statistical testing, streaming algorithms)
Prof Norman Biggs (algebraic graph theory, history of combinatorics, applications in
physics and finance)
Dr Julia Böttcher (extremal graph theory)
Prof Graham Brightwell* (partially ordered sets, random structures)
Prof Jan van den Heuvel (graph theory, discrete mathematics, applications)
Prof Jozef Skokan (quasi-randomness, applications of the regularity lemma, Ramsey
theory, extremal set theory, probabilistic combinatorics)
Prof Bernhard von Stengel (game theory and complexity)
Dr Konrad Swanepoel (combinatorial and discrete geometry, finite geometries,
extremal combinatorics)
Dr Laszlo Vegh (approximation algorithms, combinatorics)
Dr Giacomo Zambelli (combinatorics, combinatorial optimization)
Operational Research Group, Department of Management. London School of
Economics, Houghton Street, London WC2A 2AE Tel: 0207 955 7653 Fax: 0207 955
6885
http://www.lse.ac.uk/collections/operationalResearch/
Prof Gautam Appa (Emeritus: orthogonal latin squares, mixed integer programming,
robust regression)
Prof Gregory Sorkin (combinatorial optimisation).
Prof Richard Steinberg (operations management, combinatorial auctions,
transportation networks)
Prof Paul Williams (Emeritus: linear and integer programming)
Research students
Marta Casetti (Prof von Stengel)
Ewan Davies (Dr Skokan)
Nora Frankl (Dr. Skokan and Dr. Swanepoel)
Matthew Jensen (Dr Böttcher and Skokan)
Aaraon Lin (Dr. Swanepoel and Prof. von Stengel)
Daniel Quiroz (Prof. van den Heuvel and Dr. Batu)
Barnaby Roberts (Dr Skokan and Dr. Allen)
Pongphat Taptagaporn (Dr. Batu and Dr. Anthony)
Lecture courses
Discrete Mathematics (20 lectures, 2nd
year, Dr Skokan)
Combinatorial Optimization (20 lectures, M.Sc., Prof Appa)
Theory of Algorithms (20 lectures, 3rd
year, Prof von Stengel)
Computational Learning Theory and Neural Networks (20 lectures, M.Sc., Dr Batu)
Algorithms and Computation (20 lectures, M.Sc., Prof von Stengel)
Discrete Mathematics and Complexity (20 lectures, M.Sc., Dr Skokan)
Information, Communication and Cryptography (20 lectures, M.Sc., Prof Biggs)
Seminars
Seminar on Discrete and Applicable Mathematics, Thursdays 2:00
CDAM Informal Workshop, Fridays 12:00
http://www2.lse.ac.uk/maths/Seminars
LONDON SOUTH BANK UNIVERSITY
Faculty of Business, Computing and Information Management B.C.I.M., London
South Bank University, 103 Borough Road, London SE1 0AA. Tel: 0207 928 8989
Fax: 0207 815 7793
http://www.lsbu.ac.uk/bcim/depts/msfs/
Dr Elroy Benjamin
Dr Carrie Rutherford* (graph and matroid theory)
Lecture courses
Discrete mathematics occurs in the first year of all the computing courses (Dr
Benjamin) .
Applications of combinatorics appear in the 2nd
year module Business Manamgnet
with Analytics (Dr Rutherford)
Study group/working paper series:
http://myweb.lsbu.ac.uk/~ruthercg/MathsStudyGroup/
Current periodicals: A B H J L M a c d N O P Q R S T U X Y Z f
UNIVERSITY OF MANCHESTER
School of Mathematics University of Manchester, Oxford Road, Manchester M13
9PL. Tel: 0161 275 5800 Fax: 0161 275 5819
http://www.manchester.ac.uk/maths/
Dr Y. Bazlov (representation theory, including interactions with combinatorics)
Prof A.V. Borovik (matroids and generalisations, Coxeter matroids, Coxeter groups)
Prof D. S. Broomhead (applied tropical algebra and geometry, dynamics on graphs)
Prof R. M. Bryant (emeritus: groups, Lie algebras)
Dr J. Hook (stochastic processes on graphs)
Dr M. Johnson* (tropical algebra and geometry, free Lie algebras and Young tableaux)
Prof. M. Kambites (tropical algebra and geometry, combinatorial group and
semigroup theory, automata, computational complexity and cryptography)
Dr H. Khudaverdian (Lie groups and algebras; symmetric functions; Schur
functions; Young tableaux; combinatorics in geometry)
Prof P. J. Laycock (Emeritus: experimental design)
Prof J. Paris (logic, including interactions with combinatorics)
Dr. S. Prendiville (additive combinatorics)
Prof N. Ray (combinatorial Hopf algebras, geometry and combinatorics of polytopes)
Prof P. J. Rowley (group theory)
Dr R. Sandling (Steenrod algebra: lattices)
Prof R. Stöhr (Group theory and Lie algebras, including combinatorial aspects and
methods).
Lecture courses
Discrete Mathematics (24 lectures, 2nd
year, Dr Mark Muldoon)
Coding Theory (24 lectures, 3rd
year, Dr Bazlov)
Combinatorics and Graph Theory (24 lectures, 3rd
year, Dr Gabor Megyesi)
Mathematical Programming (24 lectures, 3rd
year, Mr. Mike Tso)
Computation and Complexity (32 lectures, 4th
year/MSc, Dr Kambites)
Current periodicals: A, B, E, F, H, I, L, M, N, P, R, S, T, U, V, X, Y, Z, a, b, c, d, e, f,
g, h.
MANCHESTER METROPOLITAN UNIVERSITY
School of Computing, Mathematics & Digital Technology John Dalton Building,
Manchester Metropolitan University, Chester Street, Manchester M1 5GD
0161 247 1677
http://www.scmdt.mmu.ac.uk/
Dr. Jan Foniok* (discrete mathematics)
MIDDLESEX UNIVERSITY
Design Engineering and Mathematics Department School of Science and
Technology, Middlesex University The Burroughs, London NW4 4BT
Tel: 020 8411 5137
http://www.mdx.ac.uk/aboutus/Schools/science-and-technology/index.aspx
Dr Thomas D. Bending* (Bent functions; finite geometries; lotteries).
Lecture Courses
Logic and Structures (1st year)
Combinatorics (3rd
year)
Discrete Mathematics and Geometry (2nd
year)
Current Periodicals: F, I, P, S, V, X. Y, b, e
UNIVERSITY OF NEWCASTLE UPON TYNE
School of Mathematics and Statistics Newcastle University, Newcastle upon Tyne
NE1 7RU. Tel: 0191 222 6000 Fax: 0191 222 8020
http://www.ncl.ac.uk/math/
Dr A. J. Duncan (combinatorial group theory, one-relator products of groups, decision
problems and equations over presentations of groups)
Dr O. H. King* (subgroup structure of classical groups, finite geometry)
Prof S. Rees (algorithms in group theory and geometry, automatic groups and related
classes of groups, connections between group theory and formal language theory)
Dr Alina Vdovina (geometric group theory, noncommutative geometry, knot theory,
Riemannian geometry)
Lecture courses
Enumeration and Combinatorics (24 lectures, 2nd
year, Dr Vdovina)
Geometries and Designs (24 lectures, 3rd
year, Dr Vdovina)
Coding Theory (24 lectures, 3rd
year, Prof Rees) .
Current periodicals: A, B, F, H, I, J, L, M, N, P, Q, R, S, T, U, V, X, Y, Z, a, b, c, d,
e, f, g. Almost all current issues are electronic access only.
UNIVERSITY OF NOTTINGHAM
School of Mathematical Sciences University of Nottingham, University Park,
Nottingham NG7 2RD. Tel: 0115 951 4949 Fax: 0115 951 4951
http://www.maths.nottingham.ac.uk
Dr D.R. Woodall* (retired: graph colourings)
Lecture courses
Graph Theory (20 lectures, 3rd
year, Dr Diamantis)
Coding and cryptography (20 lectures, 3rd
year, Dr Stromberg)
Current periodicals: several (electronic access only).
NOTTINGHAM TRENT UNIVERSITY
School of Science and Technology, Nottingham Trent University, Clifton Campus,
Nottingham NG11 8NS. Tel: 0115 848 8417
http://www.ntu.ac.uk/sat/about/academic_teams/phys_maths.html
Prof Nadia. Chuzhanova (bioinformatics, combinatorics on words)
Dr Jonathan J. Crofts (computational graph theory, complex networks, combinatorics,
data-mining, computational biology)
Dr Timothy J. Hetherington* (graph theory, particularly graph colourings)
Dr Colin M. Willmott ((Algebra, combinatorics, geometry, quantum coding, quantum
cryptography and entanglement theory)
Research students:
Daniel Buxton (applications of complex networks: Prof. Chuzhanova).
Lecture courses:
Topics in Pure Mathematics: Graph Theory (12 lectures, 3rd
year, Dr Hetherington).
Coding Theory and Cryptography (24 lectures, 3rd
and 4th
year, Dr Wilmott and Dr
Hetherington).
Current periodicals: several (electronic access only).
THE OPEN UNIVERSITY
Department of Mathematics and Statistics The Open University, Walton Hall,
Milton Keynes MK7 6AA. Tel: 01908 653479 Fax: 01908 653744
http://www.mathematics.open.ac.uk/
Dr Silvia Barbina (permutation groups, automorphism groups of countable structures)
Dr Robert Brignall (permutation classes, relational structures, graph theory, well quasi
order)
Dr Katie Chicot (infinite combinatorics)
Prof Mike Grannell (Emeritus: combinatorial design theory, combinatorial computing,
Steiner systems, topological design theory)
Prof Terry Griggs (Emeritus: combinatorial design theory, combinatorial computing,
Steiner Systems, topological design theory)
Prof Uwe Grimm (enumerative combinatorics, words, tilings, applications to physics)
Dr Fred Holroyd (retired: fractional graph colourings, graceful and related tree
labellings, Erdős-Ko-Rado properties of graphs)
Dr Kathleen Quinn* (designs and their applications)
Prof Jozef Širáň (topological graph theory, Cayley graphs)
Dr Bridget Webb (automorphisms of designs, Latin squares, infinite designs)
Prof Robin Wilson (Emeritus: history of graph theory and combinatorics, graph
colourings)
Visiting research fellows
Dr Tony Forbes (Mathematics: combinatorial designs)
Research students
Grahame Erskine (vertex-transitive and Cayley graphs in the degree-diameter and the
degree-girth problem: Prof Širáň and Dr Webb)
James Fraser (Prof Širáň)
Robert Lewis (analysis and construction of extremal highly symmetric graphs with
given metric properties: Prof Širáň and Dr Webb: part-time)
David Marchant (permutation patterns: Dr Brignall, part time)
Jakub Sliacan (permutation patterns: Dr Brignall)
James Tuite (vertex-transitive and Cayley graphs and embeddings: Prof Širáň)
Courses
MT365: Graphs, networks and design (3rd
year)
M836: Coding Theory (M.Sc.).
M840: Dissertation in mathematics (algebraic graph theory option) (M.Sc.).
Current periodicals: A, B, C, D, E, F, H, I, J, L, M, N, P, Q, R, S, T, U, V, W, X, Y,
Z, a, b, c, d, e, f, g, h, i (some electronic access only).
UNIVERSITY OF OXFORD
The Mathematical Institute 24-29 St. Giles, Oxford OX1 3LB. Tel: 01865 273525
Fax: 01865 273583
http://www.maths.ox.ac.uk
Prof David Conlon (graph theory and combinatorics)
Prof Ben Green (additive combinatorics)
Dr Raphael Hauser (continuous optimization, applied probability)
Prof Peter Keevash (extremal and probabilistic Combinatorics)
Dr Robert Leese (channel assignment problems)
Dr Mason Porter (applications of networks)
Prof Oliver Riordan (combinatorics, graph theory)
Dr Tom Sanders (additive combinarorics)
Prof Alex Scott (combinatorics, graph theory)
Prof Dominic J. A. Welsh (retired: combinatorics, applied probability, complexity)
Research fellows/assistants
Dr. Annika Heckel (combinatorics)
Dr. Eoin Long (combinatorics)
Dr Michal Przykucki (probabilistic combinatorics)
Dr. Yufei Zhao (combinatorics)
Department of Statistics 1 South Parks Road, Oxford OX1 3TG. Tel: 01865 272860
Fax: 01865 272595
http://www.stats.ox.ac.uk
Prof Christina Goldschmidt (probability theory and combinatorics)
Prof Colin J. H. McDiarmid* (probability and algorithms, probabilistic methods in
combinatorics, colouring problems)
Dr James Martin (probability theory, links to statistical physics and theoretical
computer science)
Prof Gesine Reinert (network statistics (including small world graphs), applied
probability).
Department of Computer Science Wolfson Building, Parks Road, Oxford OX1 3QD
Tel: 01865 73838 Fax: 01856 73839
http://www.cs.ox.ac.uk
Prof Peter Jeavons (algorithms and complexity, constraint satisfaction)
Prof Leslie.A. Goldberg (combinatorial algorithms, complexity of counting and
sampling)
Prof Paul Goldberg (algorithms, game theory)
Prof Georg Gottlob (algorithms and complexity)
Dr Stanislav Živný (discrete optimisation, constraint satisfaction, generalisations of submodularity)
Research students
Hannah Guggiari
Jakub Konieczny (Prof. Green)
Sofia Lindqvist (Prof. Green)
Przemyslaw Mazur (Prof. Green)
Natasha Morrison (Prof Scott)
Alexander Roberts (Prof Scott)
Aled Walker (Prof Green)
Lecture courses
Communication theory (16 lectures, 3rd
year, Dr D. Stirzaker)
Integer programming (16 lectures, 3rd
year, Dr Hauser)
Graph Theory (8 lectures, 2nd
year, Prof McDiarmid)
Graph Theory (16 lectures, 4th
year, Prof Riordan)
Probabilistic Combinatorics (16 lectures, 4th
year, Prof McDiarmid)
Seminar Combinatorial theory (Tuesdays at 2.30 p.m.)
Current periodicals: D, E, J, K, L, N, P, Q, T, Y
UNIVERSITY OF PLYMOUTH School of Computing, Electronics and Mathematics University of Plymouth, Drake
Circus, Plymouth. PL4 8AA. Tel: +44 (0)1752 586888.
http://math-sciences.org/research-groups/research-pure-mathematics
Prof Stephen Huggett* (graph theory, twistor theory).
Research students
Mary Griffiths (Prof. Huggett).
Lecture courses
Optimisation, Networks and Graphs (3rd year, 12 weeks, 6 hours per week of which 3
are on discrete topics).
Seminars
Pure Mathematics Seminar (weekly).
UNIVERSITY OF PORTSMOUTH Department of Mathematics Buckingham Building, Lion Terrace, Portsmouth,
Hampshire PO1 3HE Tel: 023 9284 6367 Fax: 023 9284 6364
http://www.port.ac.uk/departments/academic/maths
Dr Murad Banaji (graph theory and applications to chemical reactions).
Dr A. Makroglou*
Current periodicals: X, Y, b
QUEEN MARY, UNIVERSITY OF LONDON
School of Mathematical Sciences (Mathematics Research Centre) Queen Mary,
University of London, Mile End Road, London E1 4NS. Tel: 0207 975 5440 Fax:
0208 980 9587
http://www.maths.qmw.ac.uk/
Prof David. K. Arrowsmith (graph colourings, percolation theory, interaction models
and knot invariants)
Prof Rosemary A. Bailey (design of experiments,latin squares and their
generalisations, designs for complicated block structures, association schemes,
partition species)
Dr John N. Bray (group theory)
Prof Peter J. Cameron* (groups and their operands, graphs, codes, designs, models,
orbits and enumeration)
Dr David Ellis (combinatorics, especially its interaction with other parts of
mathematics)
Dr Dvir Falk (Combinatorics)
Dr Matt Fayers (representation theory and Combinatorics)
Dr Alex Fink (Combinatorics and tropical geometry)
Prof Anthony Hilton (Emeritus Professor: graph theory, design theory, finite set
systems)
Prof Bill Jackson (graph theory)
Prof Mark Jerrum (computational complexity, probabilistic computation, the
complexity of combinatorial enumeration)
Dr J. Robert Johnson (graph theory and combinatorics)
Prof Malwina Luczak (probability, including combinatorial probability)
Prof Thomas Müller (group theory, combinatorics, analysis)
Prof Thomas Prellberg (statistical mechanics, dynamics, enumerative combinatorics)
Prof Leonard H. Soicher (computational group theory, graph theory, finite geometry,
design theory)
Dr Dudley S. Stark (probability and combinatorics)
Dr Mark Walters (probabilistic combinatorics, percolation, extremal problems)
Prof Robin Whitty (combinatorics)
Prof Rob A. Wilson (computational group theory)
Researchers
Dr. Heng Guo
Dr Emil Vaughan (graph theory and statistics)
Research students
Jack Bartley (Dr. Walters)
Katie Clinch (Prof. Jackson)
Nick Day (Dr. Johnson)
Hakan Guler (Prof Jackson)
Teerasak Khoploykang (Prof. Jackson)
Trevor Pinto (Dr. Johnson)
Anitha Rajkumar (Prof. Jackson)
Adthasit Sinna (Prof. Jackson)
Lecture courses
Algorithmic Graph Theory (36 lectures, 2nd year)
Combinatorics (36 lectures, 3rd
year, Prof Jackson)
Coding Theory (36 lectures, 3rd
year, Dr Fayers)
Cryptography (36 lectures, 3rd
year, Prof Jackson)
Extremal combinatorics (24 lectures, M.Sc)
Seminars Combinatorics study group (Fridays 4:30pm)
http://www.maths.qmul.ac.uk/~pjc/csg.html
Design of Experiments (Dr Coad, Thursday 4:30pm)
Pure Mathematics (Dr Tomasic, Monday 4:30pm)
Current periodicals: A, B, E, F, H, I, J, L, M, N, P, Q, R, S, T, U, V, X, Y, a, b, c, d,
e, f, g. Print only for g, electronic only for A, I, J, L, M, Q, S, a, c,d.e.f. All others
available both electronically and in print.
UNIVERSITY OF READING Department of Mathematics University of Reading, Whiteknights, P.O. Box 220
Reading, Berks RG6 6AX. Tel: 0118 378 8996 Fax: 0118 931 3423
Prof P. Grindrod (applications of graph theory and networks)
Prof A. J. W. Hilton* (graph theory, design theory, finite set systems)
Dr W. R. Johnstone (graph theory)
Dr D. S. G. Stirling (graph theory)
Lecture courses
Linear Algebra and Coding Theory (44 lectures, Dr T. Kuna)
Current periodicals: C, N, P, S, X, Y, b
ROYAL HOLLOWAY, UNIVERSITY OF LONDON
Department of Mathematics Royal Holloway, Egham Hill, Egham, Surrey TW20
0EX. Tel: 01784 443093 Fax: 01784 430766
http://www.ma.rhul.ac.uk
Prof Simon R. Blackburn* (group theory, algebra and combinatorics of data
communications, coding theory, cryptography)
Prof Carlos Cid (cryptography, security, computational algebra)
Prof Jason Crampton (applications of discrete mathematics to access control)
Dr Rainer Dietmann (analytic number theory, diophantine equations, additive
combinatorics)
Prof John W. Essam (applications of graph theory, combinatorics, numerical analysis
and computing techniques to problems in critical phenomena theory, in particular to
phase transitions, conduction in disordered materials, polymer science, epidemic
models and cellular automata)
Dr Stefanie Gerke (graph theory, combinatorics, random structures and algorithms)
Prof Keith M. Martin (cryptography and information security)
Prof James McKee (Salem numbers, Pisot numbers, Mahler measure, elliptic curves,
computational number theory)
Prof Chris Mitchell (cryptography and information security)
Dr Iain Moffatt (algebraic combinatorics, topological graph theory, knot theory)
Prof Sean P. Murphy (spatial probability, cryptography)
Dr Siaw-Lynn Ng (combinatorics, finite geometry, applications to information
security)
Prof Kenneth G. Paterson (cryptography and coding)
Dr Mark Wildon (representation theory, group theory, combinatorics)
Visiting Professors Prof Nelson Stephens, Prof Mike Walker (Vodafone Chair in
Communications)
Department of Computer Science Royal Holloway, Egham Hill, Egham, Surrey
TW20 0EX. Tel: 01784 443421 Fax: 01784 443420
http://www.cs.rhul.ac.uk
Prof Dave. Cohen (constraint satisfaction, graphs and hypergraphs)
Prof Gregory Gutin (graphs and combinatorics, combinatorial optimisation, access
control)
Dr Iddo Tzameret (theory of computation);
Dr Magnus Wahlström (combinatorial algorithms)
Postdoctoral researchers
Dr Chris Dowden (graph theory and communication theory)
Dr Mark Jones (combinatorial algorithms)
Dr Rémi Watrigant (combinatorial algorithms)
Research students
James Alderman (access control and cryptography, Prof Crampton)
Elizabeth Berners-Lee (cryptography, Prof. Cid)
Jonathan Cooley (number theory, Prof McKee)
Alex Davidson (cryptography, Prof. Cid)
Naomi Farley (access control, Prof Crampton and Prof Gutin)
David Hutchinson (cryptography, Prof Paterson)
Christian Janson (cryptography, Prof Cid)
Thalia Laing (cryptography, Prof Martin)
Thyla van der Merwe (cryptography, Prof Paterson)
Mwawi Nyirenda (combinatorial applications to cryptography, Prof Martin, Dr Ng)
Bill O’Donovan (representation theory, Dr Wildon)
Laurence O'Toole (DES, MARS, feistel networks)
Rachel Player (learning with errors-based schemes, Prof Cid)
Ricardo Villanueva Polanco (cryptography, Prof Paterson)
Gordon Procter (cryptography, Prof Cid)
Sam Scott (cryptography,Prof. Paterson)
James Sellwood (access control, Prof Crampton)
Aleen Sheikh (number theory, Prof Blackburn)
Bin Sheng (combinatorial algorithms, Prof Gutin)
Dale Sibborn (cryptography, Prof Paterson)
Benjamin Smith (graph theory, Dr Moffatt)
Conrad Williams (access control, Prof Crampton)
Joanne Woodage (cryptography, Prof. Paterson)
Pavlo Yatsyna (matrices and polynomials, Prof McKee).
Lecture courses
Graphs and Optimisation (33 lectures, 2nd
year)
Cipher systems (33 lectures, 3rd
year)
Error correcting codes (33 lectures, 3rd
year)
Theory of error correcting codes (44 lectures, p/g)
Channels (33 lectures, p/g)
Combinatorics (33 lectures, p/g)
Principles of Algorithm Design (33 lectrures, p/g)
Public Key Cryptography (33 lectures)
Advanced Cypher Systems (44 lectures, p/g)
Applications of Field Theory (33 lectures, p/g)
The Department of Mathematics runs taught M.Sc. programmes in Information
Security, Mathematics of Cryptography and Communications, and Mathematics for
Applications.
Seminars Pure Maths Seminar (Dr Moffatt, Dr. Martin Widmer) (Tuesdays at 2.00
p.m. in room 219).
Information Security Seminar (Dr Lorenzo Cavallaro) (Thursdays 11.00 in Room
C229).
Current periodicals: E, F, H, J, M, N, P, S, T, X, b, h (available electronically).
UNIVERSITY OF ST. ANDREWS
School of Mathematics and Statistics The Mathematical Institute, North Haugh, St.
Andrews, Fife KY16 9SS. Tel: 01334 463745 Fax: 01334 463748
http://www.mcs.st-and.ac.uk
Prof R. A. Bailey (design of experiments,latin squares and their generalisations,
designs for complicated block structures, association schemes, partition species)
Dr C. Bleak (geometric group theory, automatic structures)
Prof P. J. Cameron (groups and their operands, graphs, codes, designs, models, orbits
and enumeration)
Dr C. M. Campbell (combinatorial group theory, combinatorics of semigroup
presentations)
R. L. Constable (combinatorics)
Prof K. J. Falconer (combinatorial geometry)
Dr S. Huczynska (Applications of finite fields, permutation arrays, combinatorial
designs)
Dr A W. Kemp (combinatorial applications in statistics)
Prof C. D. Kemp (combinatorial applications in statistics)
Dr T. Kempton
Dr J. H. McCabe (graph theory, number theory)
Dr J. D. Mitchell (combinatorial and topological applications of group and semigroup
theory)
Dr J. J. O'Connor (combinatorial group theory)
Prof L. Olsen (analysis and combinatorics)
Dr M. R. Quick (group theory)
Prof I. Rivin (combinatorics, number theory, geometric topology, group theory)
Prof E. F. Robertson (combinatorial group theory, combinatorics of semigroup
presentations)
Dr C. M. Roney-Dougal* (finite permutation and matrix groups, computational group
theory, geometric group theory)
Prof N. Ruškuc (combinatorics of words, mappings, permutations: combinatorial
semigroup theory)
Dr. L. Theran
Dr M. Todd (ergodic theory)
Research Students
Mr. D. Bennett
Miss E. Bieniecka
Mr. T. Bourne
Miss R. Carey
Mr. A. Clayton
Miss N. Khalid
Mr. M. McDevitt
Mr. V. Mijovik
Mr. C. Millar
Mr. A. Mordcovich
Mr. C. Russell
Mr. M. Torpey
Mr. S. Troscheit
Mr. W. Wilson
Lecture courses
Combinatorics and Probability (24 lectures, 2nd
year)
Finite mathematics (24 lectures, 3rd
/4th
year, alternate years)
Graph Theory (24 lectures, 3rd
/4th
year, alternate years)
Advanced combinatorics (24 lectdure, 4th
/5th
year, alternate years)
Various courses involving algorithms and complexity at 3rd
/4th
year level.
Seminars Pure Mathematics Colloquium 4pm Thursdays
Algebra and Combinatorics Seminar 4pm Wednesdays
CIRCA Seminar 1pm Thursdays
School of Computer Science North Haugh, St Andrews, Fife KY16 9SX.
Tel: 01334 463253 Fax: 01334 463278
http://www.cs.st-andrews.ac.uk/
Prof Steve A. Linton (computational algebra: systems, algorithms and applications)
Dr A. B. Konovalov
Dr M. Pfeiffer (automatic structures)
Current periodicals: A, B, E, F, H, J, L, M, N, P, Q, R, S, U, V, X, Y, Z, a, b, c, d, e, f,
g (all online only).
UNIVERSITY OF SALFORD
Mathematics Section, School of Computing, Science and Engineering University of
Salford, Salford M5 4WT.
http://www.cse.salford.ac.uk
Emeritus Professor: Ray Hill* (coding theory, finite geometry)
Current periodicals: T
UNIVERSITY OF SHEFFIELD
School of Mathematics and Statistics University of Sheffield, Hicks Building,
Hounsfield Road, Sheffield S3 7RH. Tel: 0114 222 3752. Fax 0114 222 3809
Prof Chris Cannings (evolutionary conflicts, random graphs, stochastic processes,
mathematical genetics)
Dr Paul Johnson (algebraic geometry, combinatorics)
Dr Jonathan Jordan (probability, random graphs)
UNIVERSITY OF SOUTHAMPTON
School of Mathematics University of Southampton, Southampton SO17 1BJ. Tel:
023 8059 3612 Fax: 023 8059 5147
http://www.maths.soton.ac.uk
Prof G. A. Jones* (permutation groups, connections between groups and graphs)
Prof R. C. King (retired: representations theory of Lie algebra and superalgebras,
applications in Physics)
Dr E. K. Lloyd (retired: combinatorics and graph theory including applications and
history)
Prof C. N. Potts (combinatorial optimization and scheduling)
Prof D. Singerman (discontinuous groups with applications to Riemann surfaces and
the theory of maps)
Department of Management 023 8059 3966
http://www.management.soton.ac.uk
Dr Julia A. Bennell
Lecture courses
Combinatorics and Graph theory (13 lectures, 1st year, Dr Ann Hirst)
Theory of numbers (36 lectures, 3rd
/4th
year, Dr Mary Jones)
Scheduling (10 lectures, M.Sc., Prof Potts)
Algorithms (36 lectures, 2nd
year, Prof Jones)
Information and coding Theory (36 lectures, 3rd
year, Prof Jones)
Algorithms, machines and languages (36 lectures, 3rd
/4th
year, Prof Jones)
Finite Mathematics (36 lectures, 3rd
/4th
year, Dr Jim Renshaw)
Graph Theory (36 lectures, 3rd
/4th
year, Dr Renshaw)
Current periodicals: A, C, E, F, M, N, P, R, T, X, Y
UNIVERSITY OF SOUTH WALES
Division of Mathematics and Statistics University of South Wales, Pontypridd, Mid
Glamorgan CF37 1DL. Tel: 01443 482136 Fax: 01443 482169
http://www.southwales.ac.uk/maths/research/
Dr F. Hunt (coding theory, signal sets with low correlation)
Dr S. Jones* (properties of Sudoku puzzles and their variants)
Dr S. Perkins (coding theory, synchronization, combinatorial puzzles)
Prof D. H. Smith (emeritus professor: coding theory, permutation codes, DNA codes,
frequency assignment)
Research students
Liam Harris (combinatorial problems on the chessboard, Dr Perkins)
Lecture courses
Codes and Information (3rd year, Dr Perkins, Dr Hunt)
Combinatorics and Network flows (2nd year, Dr Perkins and Dr Jones)
Current periodicals: J, N, T, X, Y, e. T is online only after Vol. 51. J is only from
2004.
STAFFORDSHIRE UNIVERSITY
Faculty of computing, Engineering and Technology, Staffordshire University, Leek
Road, Stoke-on-Trent, ST4 2AZ. Tel/Fax: 01782 294026
Prof Brian Burrows
Dr Sarah J. Easton*
UNIVERSITY OF STIRLING
Mathematics and Statistics Group, Institute of Computing Science & Mathematics The University of Stirling, Institute of Computing Science and Mathematics, Stirling,
Scotland FK9 4LA. Tel: 01786 467460 Fax: 01786 464551
http://www.cs.stir.ac.uk/maths/
Dr J Enright (graph theory, contagion on graphs)
Dr P. S. Jackson (algebraic graph theory)
Prof P. Rowlinson* (Emeritus: algebraic graph theory) http://www.cs.stir.ac.uk/~pr/
Lecture courses
Discrete structures (44 lectures, 1st year)
Combinatorics (32 lectures, 3rd
/4th
year, alternate years)
Algebra and codes (32 lectures, 3rd
/4th
year, alternate years)
Current periodicals: F, H, J, M, N, P, R, S, U, V, X, Y, b, d (all electronic).
STRATHCLYDE UNIVERSITY
Department of Computer and Information Sciences Livingstone Tower, 26
Richmond Street, Glasgow G1 1XH. Tel: 0141 548 2934 Fax: 0141 548 4523
http://www.strath.ac.uk/cis/
Dr. David Bevan* (enumerative combinatorics, permutation patterns)
Dr Sergey Kitaev (combinatorics, discrete analysis, graph theory, formal languages)
Prof Einar Steingrimsson (algebraic and enumerative combinatorics)
Research associates
Dr. Thomas Selig (enumerative combinatorics, graph theory)
Dr. Jason Smith (topological combinatorics, posets, permutation patterns)
Honorary Senior Lecturer
Dr. Mark Dukes (combinatorial and discrete mathematics, statistical mechanics,
applied probability)
Research students
Marc Glen (graph theory, formal languages)
Lecture Courses
Combinatorics for Computer Science 1 (1st year)
Combinatorics for Computer Science 2 (2nd
year)
Department of Mathematics and Statistics Livingstone Tower, 26 Richmond Street,
Glasgow G1 1XH. Tel: 0141 548 3804 Fax: 0141 548 3345
http://www.mathstat.strath.ac.uk/
Prof Des Higham (small-world graphs, applications, links to numerical analysis)
Dr Andrew Wade (applied probability, including random graphs).
UNIVERSITY OF SURREY
Department of Mathematics University of Surrey, Guildford, Surrey GU2 7XH. Tel:
01483 300800 Fax: 01483 686071
http://www.maths.surrey.ac.uk/
Honorary Visiting Senior Research Fellow Dr A.D. Keedwell* (Latin squares and
quasigroups, finite projective planes, coding theory)
Lecture courses
Groups and rings (33 lectures, 2nd
year, Dr D. Fisher)
Advanced Algebra (33 lectures, 3rd
year, Dr D. Fisher)
Galois theory (33 lectures, 3rd
year, Dr D. Fisher)
Algebra and codes (33 lectures,2nd
year, Dr D. Fisher )
Graphs and networks (33 lectures, 3rd
year, Dr D. Fisher in 2014/15 session)
Experimental design (33 lectures, 3rd
year (alternate years), Dr J. D. Godolphin)
Current periodicals: C, i (paper).
UNIVERSITY OF SUSSEX
Department of Mathematics University of Sussex, Brighton, East Sussex BN1 9QH.
Tel: 01273 877345 Fax: 01273 678097
http://www.sussex.ac.uk/maths
Prof J. W. P. Hirschfeld* (finite geometry, algebraic geometry, coding theory)
Research students
Awss Jabbar (finite geometry, Prof. Hirschfeld)
Salam Alabdullah (finite geometry, Prof Hirschfeld)
Zainab Hamed (finite geometry, Prof Hirschfeld)
Mohammad Hazzari (finite geometry, Prof Hirschfeld)
Fatma Karaoglu (finite geometry, Prof Hirschfeld)
Lecture courses
Galois Theory (36 lectures, 3rd
/4th
year, Dr R. A. Fenn)
Coding Theory (36 lectures, 3rd
/4th
year, Prof Hirschfeld)
Cryptography (36 lectures, 3rd/4th year, Dr K. Blyuss)
Current periodicals: None
SWANSEA UNIVERSITY
Mathematics Department Swansea University, Singleton Park, Swansea SA2 8PP
Tel: 01792 295457 Fax: 01792 295843
http://www-maths.swan.ac.uk
Dr F. W. Clarke
Dr A.D. Thomas
Lecture courses
Combinatorics (20 lectures, 3rd
year)
Applied algebra (40 lectures, 3rd
year, Dr Clarke)
UNIVERSITY COLLEGE LONDON
Department of Mathematics University College London, Gower Street, London
WC1E 6BT. Tel: 020 7679 2839 Fax: 020 7383 5519
http://www.ucl.ac.uk/Mathematics
Prof I. Bárány (Visiting professor: convex geometry, geometry of numbers, theory of
integer programming)
Prof. A. Granville (number theory, combinatorics)
Dr. J. A. Haight (Combinatorics)
Prof M. Laczkovich (real analysis)
Prof D.G. Larman (geometric analysis, combinatorics)
Prof P. McMullen (Emeritus: convexity, regular polytopes)
Prof A. Sokal (combinatorial aspects of mathematical physics)
Dr J. Talbot* (combinatorics, complexity theory)
Department of Economics University College London, Gower Street, London WC1E
6BT Tel: 020 7679 5888 Fax: 020 7916 2775
http://www.ucl.ac.uk/economics/
Prof K. Binmore (Emeritus: game theory)
Lecture courses
Optimisation (2nd
year)
Graph Theory and Combinatorics (3rd
year)
Geometry of numbers (3rd
year, Prof Larman)
Computational Geometry (3rd
year, Prof McMullen)
Game theory (3rd
year, Prof Binmore)
Seminar Colloquium (Tuesdays at 4.00 p.m.)
Informal Seminar (Wednesdays at 4.30pm)
VODAFONE GROUP UK. Vodafone House, 1 The Connection, Newbury RG14 2FN. Tel: 01635 33251 Fax: 01635
31127
http://www.vodafone.com
Dr S. Babbage*
Dr N. Bone
Prof M. Walker
R. Wright
The group is interested in cryptography, randomness, statistics, auctions and game
theory.
Current periodicals: Z
UNIVERSITY OF WARWICK
Coventry, CV4 7AL
Department of Computer Science Tel: 0247652 3193 Fax: 024 7657 3024
http://www.dcs.warwick.ac.uk/
Dr. Golnaz Badkobeh (Combinatorics on words, algorithms)
Prof Graham Cormode (managing and working with large amounts of data, with particular
emphasis on privacy and anonymization, and large scale analytics)
Prof Artur Czumaj (analysis and design of algorithms and data structures, randomized
algorithms, graph theory, game theory)
Dr Alina Ene (approximation algorithms for combinatorial optimisation problems)
Dr Matthias Englert (analysis and design of algorithms and data structures,
approximation algorithms)
Dr Ping Hu (extrenal and probabilistic graph theory)
Dr Tamas Hubai (graph limjits and extremal combinatorics)
Dr Marcin Jurdziński (algorithmic game theory, logic in computer science, optimization)
Dr Ranko Lazić (computer science and combinatorics)
Dr. Filip Mazowecki (automata, FO2 and bidon theory)
Dr Andrzej Murawski (semantics of programming languages and its applications to
program verification)
Prof Mike Paterson (computational complexity, analysis and design of algorithms)
Dr Marcin Pilipczuk (graph algorithms, fixed parameter tractability and exact
computations of NP-hard problems, approximation algorithms)
Dr Alex Tiskin (discrete mathematics, parallel computation, combinatorial optimization)
Warwick Business School Tel. 024 7652 8220 Fax: 024 7652 4539
http://www.wbs.ac.uk
Prof Steve Alpern (game theory, search games)
Prof Jurgen Branke (combinatorial optimisation)
Prof Bo Chen (combinatorial optimisation: game theory)
Dr Vladimir Deineko (combinatorial optimisation, polynomially solvable cases of
NP-hard problems)
Dr Xuan Vinh Doan (combinatorial optimisation)
Dr Nalan Gulpinar (combinatorial optimisation)
Dr Arne Strauss (combinatorial optimisation)
Warwick Mathematics Institute Tel. 024 7652 4661 Fax: 024 7652 4182.
http://www.maths.warwick.ac.uk
Dr Agelos Georgakopoulos (random walks, electrical networks, infinite graphs)
Dr. John Haslegrave (random and extremal graphs)
Prof Roman Kotecký (Probability; statistical physics; theory of phase transitions)
Prof Daniel Král’ (extremal and probabilistic combinatorics)
Dr. Hong Liu (extremal combinatorics, Ramsey theory and random graphs)
Prof Vadim Lozin (algorithmic and structural graph theory)
Prof Oleg Pikhurko* (Extremal combinatorics)
Dr Katherine Staden (extremal combinatorics)
Dr. Victor Zamaraev (graph classes, algorithms)
Postdocs
Christoph Koch (Phase transitions, percolation processes, real-world networks,
structural and extremal graph theory)
Florian Lehner (Infinite, locally finite graphs; connections between groups and
graphs; games on graphs; random structures and probabilistic methods)
Maryam Sharifzadeh (Extremal combinatorics)
Department of Statistics Tel. 024 7657 4812 Fax: 024 7652 4532
Dr Elisabetta Candellero (random graphs)
Dr David Croydon (random graphs)
Dr Ben Graham (percolation)
Research Students
Ostap Chervak (extremal combinatorics, graph limits, Prof Pikhurko)
Andrew Collins (Prof Lozin)
Peter Davies (algorithms, Prof Czumaj).
Michail Fasoulakis (algorithmic game theory, Prof Czumaj and Marcin Jurdzinski)
John Fearnley (algorithmic game theory, Dr Jurdzinski)
Bruno Federici (Dr Georgakopoulos)
Matthew Fitch (extremal combinatorics, Prof Pikhurko)
Sarah Gunnels (product portfolio, Prof Chen)
Fei Liu (electricity market, Prof Chen)
Taisa Lopes Martins (extremal combinatorics and flag algebras, Prof Král’)
Nicolaos Matsakis (algorithms; Matthias Englert)
Mahdi Noorizadegan (facility location and vehicle routing, Prof Chen & Dr Gulpinar)
Chenlan Wang (network routing, Prof Chen & Dr Doan)
Lecture courses
Discrete Mathematics and its Applications 1 and 2 (1st year)
Combinatorics (2nd
year)
Algorithm Design (2nd
year)
Algorithmic Graph Theory (2nd
year)
Mathematical Programming (2nd
year)
Combinatorial Optimisation (2nd
year)
Probability and Discrete Mathematics (2nd
year)
Combinatorics II (3rd
year)
Complexity of Algorithms (3rd
year)
Efficient Parallel Algorithms (3rd
year)
Advanced Topics in Algorithms (3rd
year)
Random Discrete Structures (3rd
year)
Graph Theory (4th
year)
Modelling and Algorithmic Analysis of Systems (4th
year)
Algorithmic Game Theory (4th
year)
Mathematical Programming and Heuristics (MSc)
Operational Research (4th
year)
Combinatorial Optimisation (MSc)
Some of the people listed above at Warwick are affiliated with DIMAP, the Centre for
Discrete Mathematics and its Applications; see http://www.dcs.warwick.ac.uk/dimap
for details.
UNIVERSITY OF THE WEST OF ENGLAND, BRISTOL
Faculty of Computing, Engineering and Mathematical Sciences University of the
West of England, Coldharbour Lane, Bristol BS16 1QY. Tel: 0117 344 2783 Fax:
0117 344 2734
http://www.cems.uwe.ac.uk/amg/
Dr Rhys Gwynllyw (graph theory and its applications)
Dr Ana Sendova-Franks (graph theory and its applications)
Dr Vadim Zverovich* (graph theory, combinatorial optimisation)
Research Students:
Anush Poghosyan (graph theory and algorithms, Dr Zverovich).
Lecture courses
Discrete Mathematics (2nd
year)
Operational Research (2nd
year)
Decision Analysis (3rd
year)
Mathematical Programming (3rd
year)
Current periodicals: D, N, S, b
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 2016-April 2017 - 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 slighty
more than 12 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 co-authors (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. and Fountoulakis, N.
A phase transition on the evolution of bootstrap percolation processes on preferential
attachment graphs. Preprint.
http://web.mat.bham.ac.uk/N.Fountoulakis/PrefPercC72.pdf
AbouEisha, H., Lozin, V. V., Monnot, J., Ries, B. and Zamaraev, V.
A boundary property for upper domination. Lect. Notes Comput. Sci. 9843 (2016)
229-240.
http://dx.doi.org/10.1007/978-3-319-44543-4_18
AbouEisha, H., Lozin, V. V., Monnot, J., Ries, B. and Zamaraev, V.
Upper Domination: towards a dichotomy through boundary properties. Algorithmica,
to appear.
http://arxiv.org/pdf/1609.01510.pdf
Acín, A., Duan, R., Roberson, D. E., Sainz, A. B. and Winter, A.
A new property of the Lovász theta function and duality relations between graph
parameters. Discrete Appl. Math. 216 (2017) 489-501.
http://doi.org/10.1016/j.dam.2016.04.028
http://arxiv.org/pdf/1505.01265
Adamaszek, A., Allen, P., Grosu, C. and Hladký, J.
Almost all trees are almost graceful. Preprint.
https://arxiv.org/pdf/1608.01577
Addario-Berry, L. and Roberts, M. I.
Robustness of mixing under rough isometry, via bottleneck sequences. Preprint.
http://arxiv.org/pdf/1610.07874.pdf
Adler, I., Le, N. K., Müller, H., Radovanović, M. Trotignon, N., and Vušković. K.
On rank-width of even-hole-free graphs. Preprint.
http://arxiv.org/pdf/1611.09907
Ahlberg, D., Griffiths, S., Janson, S. and Morris, R. D.
Competition in growth and urns. Preprint.
http://www2.math.uu.se/~svante/papers/sj312.pdf
Akhtar, M. and Kasprzyk, A. M.
Mutations of fake weighted projective planes. Proc. Edinb. Math. Soc. 59 (2016)
271-285.
http://dx.doi.org/10.1017/S0013091515000115
http://arxiv.org/pdf/1302.1152
Akrida, E. C., Czyzowicz, J., Gąsieniec, L., Kuszner, L. and Spirakis, P. G.
Temporal flows in Temporal networks. Preprint.
https://arxiv.org/pdf/1606.01091
Akrida, E. C., Czyzowicz, J., Gąsieniec, L., Kuszner, L. and Spirakis, P. G.
Flows in Temporal networks. Preprint.
https://arxiv.org/pdf/1606.01091.pdf
Akrida, E. C., Gąsieniec, L., Mertzios, G. B. and Spirakis, P. G.
The complexity of optimal design of temporally connected graphs. Theory. Comput.
Sys., to appear.
http://community.dur.ac.uk/george.mertzios/papers/Jour/Jour_Complexity-Design-
Temporally-Connected.pdf
Aksoy Yazici, E., Murphy, B.. Rudnev, M. and Shkredov, I.
Growth Estimates in Positive Characteristic via Collisions. Int. Math. Res. Not., to
appear.
http://arxiv.org/pdf/1512.06613
Alatabbi, A., Sohidull Islam, A. S., Rahman, M. S., Simpson, J. and Smyth, W. F.
Enhanced Covers of Regular & Indeterminate Strings using Prefix Tables. J.
Automata, Languages & Combinatorics, to appear. http://arxiv.org/pdf/1506.06793
Albert, M. H., Atminas, A. and Brignall, R.
Characterising when the simple permutations of a class are monotone griddable.
Preprint.
http://users.mct.open.ac.uk/rb8599/papers/simple-21s.pdf
Albert, M. H. and Brignall, R.
2×2 monotone grid classes are finitely based. Discrete Math. Theor. Comput. Sci. 18
(2016,) #1 (Permutation Patterns 2015)
http://users.mct.open.ac.uk/rb8599/papers/grid-basis.pdf
Aldridge, M., Johnson, O. and Scarlett, J. Improved group testing rates with constant column weight designs. IEEE
International Symposium on Information Theory, Barcelona, Spain, July 2016, 1381-
1385
http://dx.doi.org/10.1109/ISIT.2016.7541525
http://arxiv.org/pdf/1602.03471
Aliev, I., Bassett, R., De Loera, J. A. and Louveaux, Q.
A Quantitative Doignon-Bell-Scarf Theorem, Combinatorica, to appear.
http://arxiv.org/pdf/1405.2480
Aliev, I., De Loera, J. A. and Louveaux, Q.
Parametric Polyhedra with at least k Lattice Points: Their Semigroup Structure and the
k-Frobenius Problem. In: In: Beveridge, A., Griggs, J. R., Hogben, L., Musiker, G.
and Tetali, P. eds. Recent Trends in Combinatorics, The IMA Volumes in
Mathematics and its Applications, Springer, 753-778
http://dx.doi.org/10.1007/978-3-319-24298-9_29
http://arxiv.org/pdf/1409.5259
Allen, P., Böttcher, J., Cooley, O. and Mycroft, R.
Tight cycles and regular slices in dense hypergraphs. J. Comb. Theory Ser A 149
(2017) 30-100.
http://dx.doi.org/10.1016/j.jcta.2017.01.003 http://arxiv.org/pdf/1411.4957
Allen, P., Böttcher, J., Hàn, H., Kohayakawa, Y. and Person, Y.
Blow-up lemmas for sparse graphs. Preprint.
http://arxiv.org/pdf/1612.00622
Allen, P., Böttcher, J., Ehrenmüller, J. and Taraz, A.
The Bandwidth Theorem in sparse graphs Preprint.
http://arxiv.org/pdf/1612.00661
Allen, P., Böttcher, J., Griffiths, S., Kohayakawa, Y. and Morris, R. D.
Chromatic thresholds in sparse random graphs. Random Struct. Algorithms, to appear.
http://arxiv.org/pdf/1508.03875
Allen, P., Böttcher, J., Griffiths, S., Kohayakawa, Y. and Morris, R. D.
Chromatic thresholds in dense random graphs. Random Struct. Algorithms, to appear.
http://arxiv.org/pdf/1508.03870
Allen, P., Böttcher, J., Kohayakawa, Y. and Roberts, B.
Triangle-free subgraphs of random graphs. Combin. Probab. Comput., to appear.
http://arxiv.org/pdf/1507.05226
Allen, P., Böttcher, J.,, Skokan, J. and Stein, M. J.
Regularity inheritance in pseudorandom graphs. Preprint.
https://arxiv.org/pdf/1606.01168
Allen, P.
[see: Adamaszek, A.]
Alves, S. R., Dąbrowski, K. K., Faria, L, Klein, S., Dos Santos Souza, U. and Sau,
I.
On the (parameterized) complexity of recognizing well-covered (r,l)-graphs. COCOA
2016. Lect. Notes Comput. Sci. 10043 (2016) 423-437
http://dx.doii.org/10.1007/978-3-319-48749-6_31
Amini, O., Devroye, L, Griffiths, S. and Olver, N.
Explosion and linear transit times in infinite trees. Probab. Theory. Relat. Fields, 167
(2017) 325–347.
http://dx.doi.org/10.1007/s00440-015-0683-z http://arxiv.org/pdf/1411.4426
Anabanti, C. S.
A characterisation of elementary abelian 3-groups. Preprint.
http://arxiv.org/pdf/1611.06546
Anabanti, C. S., Erskine, G. and Hart, S. B.
Groups whose locally maximal product-free sets are complete. Preprint.
http://arxiv.org/pdf/1609.09662
Anabanti, C. S. and Hart, S. B.
On a conjecture of Street and Whitehead on locally maximal product-free sets.
Australas. J. Comb. 63 (2015) 385-3981.
http://arxiv.org/pdf/1506.02430
Anabanti, C. S. and Hart, S. B.
Groups containing small locally maximal product-free sets. Int. J. Comb. 2016 (2016)
Article ID 8939182 (2016), 5 pp.
Anderson, I., Ollis, M. A. and Preece, D. A.
On power-sequence and matryoshka terraces for 𝑍𝑛. Preprint.
Anta, A F., Chrobak, M.,. Gąsieniec, L. and Klasing, R. (eds).
Algorithms for Sensor Systems: 12th International Symposium on Algorithms and
Experiments for Wireless Sensor Networks, ALGOSENSORS 2016, Lect. Notes.
Comput. Sci. 10050 (2017)
http://dx.doi.org/10.1007/978-3-319-53058-1
Antolin, Y. and Ciobanu, L.
Finite generating sets of relatively hyperbolic groups and applications to geodesic
languages. Trans. Am. Math. Soc. 368 (2016) 7965–8010.
http://dx.doi.org/10.1090/tran/6701
https://arxiv.org/pdf/1402.2985
Antolin, Y. and Ciobanu, L.
Formal conjugacy growth in acylindrically hyperbolic groups. Int Math Res Not.
(2017) 121-157.
http://doi.org/10.1093/imrn/rnw026
http://arxiv.org/pdf/1508.06229
Aprahamian, M., Higham, D. J. and Higham, N. J. Matching Exponential-Based and Resolvent-Based Centrality Measures. Journal of
Complex Networks 4 (2015)2 157-176.
http://eprints.ma.man.ac.uk/2305/01/covered/MIMS_ep2015_3.pdf
1 Accidentally not updated in last year’s Bulletin – apologies.
2 Also accidentally not update last year.
Araújo, J., Araújo, J. P., Cameron, P. J., Dobson, T., Hulpke, A. and Lopes, P.
Imprimitive permutations in primitive groups. Preprint.
http://arxiv.org/pdf/1611.06450v1
Araújo, J., Bentz, W., Royle, G. F. and Schaefer, A.
Primitive groups, graph endomorphisms and synchronization, Proc. London Math.
Soc. 113 (2016) 829-867.
http://dx.doi.org/10.1112/plms/pdw040
http://arxiv.org/pdf/1504.01629v3
Araújo, J. and Cameron, P. J.
Primitive groups, road closures and idempotent generation. Preprint.
https://arxiv.org/pdf/1611.08233v1
Araújo, J. [see: André, J.]
Araújo, J. P.
[see: Araújo, J.]
Archdeacon, D. S., Griggs, T. S. and Psomas, C.
Representing graphs in Steiner triple systems. – II. Australas. J. Combin. 67 (2017)
243-258.
https://ajc.maths.uq.edu.au/pdf/67/ajc_v67_p243.pdf
Arratia, R., Barbour, A. D. and Tavaré, S.
Exploiting the Feller coupling for the Ewens Sampling Formula. Statist. Sci. 31,
(2016) 27—29.
http://dx.doi.org/10.1214/15-STS537
http://user.math.uzh.ch/barbour/pub/Barbour/ABT_Crane.pdf
Arrigo, F., Grindrod, P, Higham, D. J. and Noferini, V.
Nonbacktracking walk centrality for directed networks. Preprint.
http://eprints.ma.man.ac.uk/2535/01/covered/MIMS_ep2017_9.pdf
Aru, J., Narayanan, B. P., Scott, A. D. and Venkatesan, R.
Balancing sums of random vectors. Preprint.
https://www.dpmms.cam.ac.uk/~bp338/pdf/balance_rv.pdf
Arulselvan, A., Cseh, A., , Gross, M. Manlove D. F. and Matuschke, J. Many-to-one matchings with lower quotas: Algorithms and complexity. Algorithmica, to
appear.
http://arxiv.org/pdf/1412.0325
Aschenbrenner M., Dolich A., Haskell D., Macpherson, H. D. and Starchenko, S. Vapnik-Chervonenkis density in some theories without the independence property.
Trans. Am. Math. Soc. 368 (2016) 5889-5949.
http://doi.org/10.1090/tran/6659
http://arxiv.org/pdf/1109.5438
Ashford, M.
Graphs of kei and their diameters. Preprint.
http://arxiv.org/pdf/1610.06021
Ashford, M. and Riordan, O. M.
Counting racks of order n. Preprint.
http://arxiv.org/pdf/1607.07036
Atkins, R., Rombach, M. P. and Skerman, F.
Guessing Numbers of Odd C:ycles. Electron J. Comb. 24 (2017) P1.45
http://www.combinatorics.org/ojs/index.php/eljc/article/view/v24i1p45/pdf
Atminas, A., Brignall, R., Lozin, V., and Stacho, J.
Minimal classes of graphs of unbounded clique-width defined by finitely many
forbidden induced subgraphs. Preprint.
http://users.mct.open.ac.uk/rb8599/papers/bichain-min.pdf
Atminas, A., Collins, A., Foniok, J. and Lozin, V. V.
Deciding the Bell number for hereditary graph properties. SIAM J. Discrete Math. 30
(2016) 1015–1031.
http://dx.doi.org/10.1137/15M1024214
http://arxiv.org/pdf/1405.3118
Atminas, A.
[see: Albert, M. H.]
Atserias, A., Mančinska, L., Roberson, D. E., Šámal, R., Severini, S. and
Varvitsiotis, A.
Quantum and non-signalling graph isomorphisms. Preprint.
http://arxiv.org/pdf/1611.09837
Atzmon, N., Ellis, D. and Kogan, D.
An isoperimetric inequality for conjugation-invariant sets in the symmetric group. Isr.
J. Math. 212 (2016) 139-162
http://arxiv.org/pdf/1409.4542
Awang, J.,. Pfeiffer, M. and Ruškuc, N.
Finite presentability and isomorphism of Cayley graphs of monoids. Proc. Amer.
Math. Soc., to appear.
http://arxiv.org/pdf/1602.08502
Axenovich, M., Goldwasser, J. L., Hansen, R., Lidický, B., Martin, R. R., Offner,
D, Talbot, J. M. and Young, M.
Polychromatic colorings of complete graphs with respect to 1-,2-factors and
Hamiltonian cycles. Preprint.
http://arxiv.org/pdf/1612.03298
Axenovich, M., Goldwasser, J. L., Lidický, B., Martin, R. R., Offner, D, Talbot, J.
M. and Young, M.
Polychromatic Colorings on the Integers. Preprint.
http://arxiv.org/pdf/1704.00042
Aziz, H. and Savani, R.
Hedonic Games. Chapter 15, Handbook of Computational Social Choice.
http://www.cambridge.org/gb/academic/subjects/computer-science/artificial-
intelligence-and-natural-language-processing/handbook-computational-social-choice
Badkobeh, G., Bannai, H., Goto, K., I, T. Iliopoulos, C. S., Inenaga, S., Puglisi, S.
J.,, Sugimoto, S. and Tomohiro, I.
Closed factorization. Discrete Appl. Math. 212 (2016) 23-29.
http://dx.doi.org/10.1016/j.dam.2016.04.009
Badkobeh, G. and Crochemore, M.
Computing Maximal-exponent Factors in an overlap-free word. J. Comput. Syst.
Sci. 82 (2016) 477-487
http://doi.org/10.1016/j.jcss.2015.11.007
Badkobeh, G., Crochemore, M. and Marcaş G.
Counting Maximal-Exponent Factors in Words. Theor. Comput. Sci. 658 (2017)
27-35.
http://dx.doi.org/10.1016/j.tcs.2016.02.035
Badkobeh, G., Crochemore, M., Mohamed, M. and Toopsuwan, C.
Efficient computation of maximal anti-exponent in palindrome-free strings. Theor.
Comput. Sci. 656 (2016) 241-248.
http://dx.doi.org/10.1016/j.tcs.2016.02.014
Badkobeh, G.,, Gagie, T., Grabowski, S., Nakashima, Y., Puglisi, S. J. and
Sugimoto, S.
Longest Common Abelian Factors and Large Alphabets. Lect. Notes. Comput. Sci.
9954 (2016) 254-259
http://dx.doi.org/10.1007/978-3-319-46049-9_24
Bagdasar, O. D., Ceauşu, T. and Popa, I.-L.
Characterizations of generalized exponential trichotomies for linear discrete-time
systems. Electron. Notes. Discrete Math. 56 (2016) 65-70.
http://dx.doi.org/10.1016/j.endm.2016.11.010
Bagdasar, O. D. and Popa, I.-L.
On the geometry of certain periodic non-homogeneous Horadam sequences. Electron.
Notes. Discrete Math. 56 (2016) 7-13.
http://dx.doi.org/10.1016/j.endm.2016.11.002
Bagdasar, O. D. and Larcombe, P. J.
On the Masked Periodicity of Horadam Sequences: A Generator-Based
Approach, Fibonacci Quarterly, to appear.
Bailey, R. A.,
Relations among partitions. In: Surveys in Combinatorics 2017 (ed. Sergey Kitaev et
al.), Cambridge University Press, to appear.
Bailey, R. A.,
Design keys for multiphase experiments. In mODa 11—Advances in Model-Oriented
Design and Analysis (eds. Joachim Kunert, Christine H. Müller and Anthony C.
Atkinson), Springer International Publishing, 2016, pp. 27–35.
http://dx.doi.org/10.1007/978-3-319-31266-8_4
Bailey, R. A.,, Cameron, P. J., Filipiak, K., Kunert, J. and Markiewicz, A.
On optimality and construction of circular repeated-measurements designs. Statistica
Sinica , 27 (2017), 1-22
http://dx.doi.org/10.5705/ss.202015.0045
http://arxiv.org/pdf/1410.1661
Bailey, R. A. and Grömping, U.
Regular Fractions of Factorial Arrays. In mODa 11—Advances in Model-Oriented
Design and Analysis (eds. Joachim Kunert, Christine H. Müller and Anthony C.
Atkinson), Springer International Publishing, 2016, pp. 143–151.
http://dx.doi.org/10.1007/978-3-319-31266-8_17
Bailey, R. A., Kobilinsky, A. and Monod, H.
Automatic generation of generalised regular factorial designs. Computational
Statistics and Data Analysis, to appear.
Bal, D., Bennett, P., Cooper, C., Frieze, A. M. and Prałat, P.
Rainbow arborescence in random digraphs. J. Graph Theory 83 (2016) 251-265.
http://dx.doi.org/10.1002/jgt.21995
http://www.math.cmu.edu/~af1p/Texfiles/Arborescence.pdf
Baladi, V. and Todd. M.
Linear response for intermittent maps. Comm. Math. Phys. 347 (2016) 857-874.
http://dx.doi.org/10.1007/s00220-016=2577-z
http://arxiv.org/pdf/1508.02700
Balister, P. N., Binski, S., Bollobás, B. and Narayanan, B. P.
Catching a fast robber on the grid. Preprint.
https://arxiv.org/pdf/1609.01002
Balister, P. N., Bollobás, B., Füredi, Z., Leader, I. B. and Walters, M. J.
Subtended angles. Isr. J. Math. 214 (2016) 995-1012.
http://dx.doi.org/10.1007/s11856-016-1370-1
http://arxiv.org/pdf/1502.07869
Balister, P. N., Bollobás, B. and Gunderson, K.
Positive independence densities of finite rank countable hypergraphs are achieved by
finite hypergraphs. Eur. J. Comb .57 (2016) 85-93.
http://dx.doi.org/10.1016/j.ejc.2016.04.005
http://arxiv.org/pdf/1505.08044
Balister, P. N., Bollobás, B., Haeneggi, M. and Walters, M. J.
Sentry Selection in Sensor Networks: Theory and Algorithms. International Journal
of Sensor Networks 1 (2016) 1-1
http://dx.doi.org/10.1504/IJSNET.2015.10001255
Balister, P. N., Bollobás, B., Lee, J. and Narayanan, B. P.
Coalescence on the real line. Preprint.
https://arxiv.org/pdf/1610.07430
Balister, P. N., Bollobás, B., Lehel, J.and Morayne, M.
Random Hypergraph Irregularity. SIAM J. Discrete Math. 30 (2016) 465-473.
http://dx.doi.org/10.1137/120897717
Balister, P. N., Bollobás, B. and Morris, R. D.
The sharp threshold for making squares. Preprint.
https://arxiv.org/pdf/1608.03857
Balister, P. N., Bollobás, B. and Narayanan, B. P.
Reconstructing random jigsaws. Preprint.
https://www.dpmms.cam.ac.uk/~bp338/pdf/jigsaw_recon.pdf
Balister, P. N., Bollobás, B. and Sarkar, A.
Barrier Coverage. Random Struct. Algorithms 49 (2016) 429-478
http://dx.doi.org/10.1002/rsa.20656
Balister, P. N. , Gerke, S. and McDowell, A.
Adversarial resilience of matchings in bipartite random graphs. J. Comb 8 (2017) 79-
92.
http://dx.doi.org/10.4310/JOC.2017.v8.n1.a4
http://www.memphis.edu/msci/people/pbalistr/adverserial.pdf
Balla, I., Draxler, F., Keevash P. and Sudakov, B.
Equiangular lines and spherical codes in Euclidean space. Preprint.
http://people.maths.ox.ac.uk/keevash/papers/equiangular-lines-spherical-codes.pdf
Balletti, G. and Kasprzyk, A. M.
Three-dimensional lattice polytopes with two interior lattice points. Preprint.
http://arxiv.org/pdf/1612.08918
Balletti, G., Kasprzyk, A. M. and Nill, B.
On the maximum dual volume of a canonical Fano polytope. Preprint.
http://arxiv.org/pdf/1611.02455
Balogh, J., Bollobás, B. and Narayanan, B. P. Transference for the Erdós-Ko-Rado theorem. Forum Math. Sigma. to appear.
http://arxiv.org/pdf/1609.01001
Balogh, J., Bushaw, N.,. Collares Neto, M., Liu, H., Morris, R. D. and
Sharifzadeh, M.
The typical structure of graphs with no large cliques. Combinatorica, to appear.
http://arxiv.org/pdf/1406.6961.pdf
Balogh, J., Butterfield, J., Hu, P. and Lenz, J.
Mantel's Theorem for Random Hypergraphs, Random Struct. Algorithms 48 (2016)
641-654.
http://dx.doi.org/10.1002/rsa.20629
http://arxiv.org/pdf/1310.1501
Balogh, J., Eberhard, S., Narayanan, B. P., Treglown, A. and Wagner, A. Zs.
An improved lower bound for Folkman's Theorem. Preprint.
http://arxiv.org/pdf/1703.02473
Balogh, J., Hu, P., Lidický, D. and Pfender, F.
Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle.
Eur. J. Comb. 52 (2016) 47-58.
http://dx.doi.org/10.1016/j.ejc.2015.08.006
http://arxiv.org/pdf/1411.4645
Balogh, J., Hu, P., Lidický, D., Pikhurko, O., Volec, J. and Young, M. Rainbow triangles in three-colored graphs. J. Comb. Theory Ser B., to appear.
http://www.math.uiuc.edu/~jobal/cikk/RBT.pdf
Balogh, J., Hu, P., and Simonovits, M.
Phase transitions in the Ramsey-Turán theory. J. Comb. Theory. Ser. B., to appear.
http://arxiv.org/pdf/1304.1036
Balogh, J., Liu, H. and Montgomery, R. Rainbow spanning trees in properly coloured complete graphs. Preprint.
http://arxiv.org/pdf/1704.07200.pdf
Balogh, J., Liu, H. and Sharifzadeh, M.
The number of subsets of integers with no k-term arithmetic progression. Int. Math.
Res. Not. to appear.
https://arxiv.org/pdf/1605.03172
Balogh, J., Liu, H. and Sharifzadeh, M.
On two problems in Ramsey-Turán theory. Preprint.
http://arxiv.org/pdf/1607.06393
Balogh, J., Liu, H., Sharifzadeh, M. and Treglown, A.
Sharp bound on the number of of maximal sum-free subsets of integers. Preprint.
http://www.math.uiuc.edu/~jobal/cikk/sharp_max_sumfree.pdf
Balogh, J., Lo, A. and Molla, T.
Transitive triangle tilings in oriented graphs. J. Comb. Theory Ser B. 124 (2017)
64-87.
http://doi.org/10.1016/j.jctb.2016.12.004
https://arxiv.org/pdf/1401.0460
Balogh, J., McDowell, A., Mycroft, R. and Molla, T.
Triangle-tilings in graphs without large independent sets. Preprint.
http://arxiv.org/pdf/1607.07789
Balogh, J., Molla, T. and Sharifzadeh, M. (with an appendix by C. Reiher and M.
Schacht).
Triangle factors of graphs without large independent sets and of weighted graphs.
Random Struct. Algorithms 49 (2016) 669-693.
http://dx.doi.org/10.1002/rsa.20670
http://www.math.uiuc.edu/~jobal/cikk/k3tiling_tm_with_appendix.pdf
Balogh, J., Treglown, A. and Wagner, Zs. A. Applications of graph containers in the Boolean lattice. Random Struct. Algorithms 49
(2016) 845-872.
http://dx.doi.org/10.1002/rsa.20666
http://web.mat.bham.ac.uk/~treglowa/BaTrWaUPDATE.pdf
Banaji, M. and Pantea, C.
The inheritance of nondegenerate multistationarity in chemical reaction networks.
Preprint.
http://arxiv.org/pdf/1608.08400
Banakh, T.,Idzik, A., Pikhurko. O., Protaso, I. and Pszczola, K.
Isometric copies of directed trees in orientations of graphs. Preprint.
http://arxiv.org/pdf/1606.01973.pdf
Banchi, L., Coutinho, G., Godsil, C. D. and Severini, S.
Pretty Good State Transfer in Qubit Chains - The Heisenberg Hamiltonian. Preprint.
http://arxiv.org/pdf/1608.04722
Bang-Jensen, J., Bessy, S., Jackson, B. and Kriesell, M.
Antistrong digraphs. J. Comb. Theory, Ser. B 122 (2017) 68-90.
http://dx.doi.org/10.1016/j.jctb.2016.05.004
http://arxiv.org/pdf/1605.07832
Bannai, H..
[see: Badkobeh, G.]
Bárány, I., Bureaux, J. and Lund, B. Convex cones, integral zonotopes, limit shape. Preprint.
http://arxiv.org/pdf/1610.06400.pdf
Bárány, I., Blagojević, P. and Ziegler, G. M.
Tverberg’s Theorem at 50: Extensions and Counterexamples Notices Am. Math. Soc.
63 (2016) 732-739.
http://dx.doi.org/10.1090/noti1415
http://www.ams.org/journals/notices/201607/rnoti-p732.pdf
Bárány, I., Hug, D., Reitzner, M. and Schneider, R.
Random points in halfspheres. Random Struct. Algorithms 50 (2017) 3-22.
http://dx.doi.org/10.1002/rsa.20644
https://arxiv.org/pdf/1505.04672.pdf
Bárány, I. , Kalai, G. and Meshulam, R.
A Tverberg type theorem for matroids. In M. Loebl, J. Nešetřil, R. Thomas (Eds.), A
Journey Through Discrete Mathematics: A Tribute to Jiří Matoušek. Switzerland:
Springer International Publishing
Bárány, I. , Meshulam, R., Nevo, E. and Tancer, M.
Pach’s selection theorem does not admit a topological Extension. Preprint.
http://arxiv.org/pdf/1610.05053.pdf
Barany, I., and Pór, A. Paths on the Sphere Without Small Angles. Convexity and Discret Geometry ncluding
Graph Theory 239-249, Springer (2016).
http://dx.doi.org/10.1007/978-3-319-28186-5_20
Bárány, I., and Solymosi, J. Gershgorin disks for multiple eigenvalues of non-negative matrices. In M. Loebl, J.
Nešetřil, R. Thomas (Eds.), A Journey Through Discrete Mathematics: A Tribute to
Jiří Matoušek. Switzerland: Springer International Publishing.
Barber, B., Kühn, D., Lo, A., Osthus, D. and Taylor, A.
Clique decompositions of multipartite graphs and completion of Latin squares. J.
Comb. Theory Ser A., to appear.
http://web.mat.bham.ac.uk/D.Kuehn/r_decompartite4.pdf
Barbina, S. and Chicot, K. M.
A classification of countable lower 1-transitive linear orders. Order, to appear.
http://arxiv.org/pdf/1504.03372
Barbosa, R., Ene, A. Nguyen, H. L. and Ward, J.
A New Framework for Distributed Submodular Maximization. Foundations of
Computer Science (FOCS), 2016 IEEE 57th Annual Symposium on, 645-654.
https://arxiv.org/pdf/1507.03719.pdf
Barbour, A. D., Luczak, M. J. and Xia, A.
Multivariate approximation in total variation I; equilibrium distributions of Markov
jump. Preprint3.
http://arxiv.org/pdf/1512.07400
Barbour, A. D., Luczak, M. J. and Xia, A.
Multivariate approximation in total variation II: discrete normal approximation.
Preprint.
https://arxiv.org/pdf/1612.07519
Barbour, A. D.
[see: Arratia, R.]
Barki, H., Boguslawski, P., Fadli, F., Mahdjoubi, L. and Zverovich, V. E.
Two-graph building interior representation for emergency response applications.
ISPRS conference, 12–19 July 2016, Prague, Czech Republic.
http://www.isprs-ann-photogramm-remote-sens-spatial-inf-sci.net/III-2/9/2016/isprs-
annals-III-2-9-2016.pdf
Barki, H., Boguslawski, P., Fadli, F., Mahdjoubi, L. and Zverovich, V. E.
Automated construction of variable density navigable networks in a 3D indoor
environment for emergency response. Automation in Construction, 72 (2016)
115-128.
http://dx.doi.org/10.1016/j.autcon.2016.08.041
Barki, H., Boguslawski, P., Fadli, F., Mahdjoubi, L, Shaat, A. and Zverovich, V.
E.
3D capture techniques for BIM enabled LCM. In: Bouras, A., Eynard, B., Foufou, S.
and Thoben, K.-D., eds. Product Lifecycle Management in the Era of Internet of
Things, Springer, 183-192.
Barrantes, D., Gill, N. and Ramirez, J.
Abelian covers of alternating groups. Arch. Math. 107 (2016) 135-150.
http://dx.doi.org/10.1007/s00013-016-0926-y
http://arxiv.org/pdf/1510.05953
Barto, L, Krokhin, A. and Willard, R.
Polymorphisms, and how to use them. Survey in: The Constraint Satisfaction Problem:
Complexity and Approximability, 1-44, 2017.
http://www.dur.ac.uk/andrei.krokhin/papers/polymorphisms.pdf
Bassett, R.
[see: Aliev, I.]
Bastowski, S., Moulton, V., Spillner, A. and Wu, T.
The minimum evolution problem is hard: A novel link between tree inference and
graph clustering problems. Bioinformatics 32 (2016):518-22,
http://dx.doi.org/10.1093/bioinformatics/btv623
Bednarska-Bzdega, M., Hefetz , D., Krivelevich, M. and Łuczak, T.
Manipulative waiters with probabilistic intuition. Combin. Probab. Comput.,25 (2016)
823-849.
https://doi.org/10.1017/S0963548315000310
https://arxiv.org/pdf/1407.8391
3 This paper has been substantially revised so is re-included.
Behrstock, J.,. Falgas-Ravry, V., Hagen, M. F. and Susse, T.
Global structural properties of random graphs. Int. Math. Res. Not. rnw287.
http://doi.org/10.1093/imrn/rnw287
http://arxiv.org/pdf/1505.01913
Behrstock, J.,. Caprace, P.E., Hagen, M. F. and, Sisto, A.
Thickness, relative hyperbolicity, and randomness in Coxeter groups. Algebr. Geom.
Topol. 17 (2017) 705-740
https://doi.org/10.2140/agt.2017.17.705
https://arxiv.org/pdf/1312.4789
Bell, P. C., Hirvensalo. M. and Potapov, I.
The Identity Problem for Matrix Semigroups in SL2(ℤ) is NP-complete. SODA 2017:
187-206.
http://dx.doi.org/10.1137/1.9781611974782.13
Benjamini, I. and Ellis, D. Juntas in the ℓ1-grid and Lipschitz maps between discrete tori
†. Random Struct.
Algorithms 49 (2016) 253-279.
http://dx.doi.org/10.1002/rsa.20623
http://arxiv.org/pdf/1311.6958.pdf
Benjamini, I. and Ellis, D. On the structure of graphs which are locally indistinguishable from a lattice Forum
Math. Sigma 4 (2016) e31.
https://doi.org/10.1017/fms.2016.30
https://arxiv.org/pdf/1409.7587
Bennett, P.
[see; Bal, D.]
Bentz, W.
[see: Araújo, J.]
Benzi, M. and Estrada, E.
Core-satellite Graphs, Clustering, Assortativity and Spectral Properties. Linear
Algebra Appl 517 (2017) 30-52.
http://dx.doi.org/10.1016/j.laa.2016.12.007
http://arxiv.org/pdf/1510.07954
Ben-Zvi, A., Blackburn, S. R. and Tsaban, B.
A Practical Cryptanalysis of the Algebraic Eraser. CRYPTO2016 Part I,. Lect. Notes
Comput. Sci. 9814 (2016) 179-189
https://eprint.iacr.org/2015/1102.pdf
Berenbrink, P., Friedetzky, T., Giakkoupos, G. and Kling, P
Efficient Plurality Consensus, Or: the Benefits of Cleaning up from Time to Time.
ICALP 2016 136:1-136:14.
http://dx.doi.org/10.4230/LIPIcs.ICALP.2016.136
Berenbrink, P., Friedetzky, T., Kling, P., Malmann-Trenn, F., Nagel, L. and
Wastell, C.
Self-stabilizing Balls & Bins in Batches: the Power of Leaky Bins. PODC2016 83-92.
https://doi.org/10.1145/2933057.2933092
http://dro.dur.ac.uk/20061/1/20061.pdf?DDD10+dcs0tf1+d700tmt+dul4eg
Berenbrink, P., Friedetzky, T., Kling, P., Malmann-Trenn, F., and Wastell, C.
Plurality Consensus in Arbitrary Graphs: Lessons Learned from Load Balancing. ESA
2016, 10:1-10:18.
http://dx.doi.org/10.4230/LIPIcs.ESA.2016.10
http://dro.dur.ac.uk/20060/1/20060.pdf?DDD10+dcs0tf1+d700tmt+dul4eg
Berenbrink, P., Elsässer, R. and Friedtzky, T.,
Efficient randomised broadcasting in random regular networks with applications in
peer-to-peer systems. Distributed Computing 29 (2016) 317-339.
http://dx.doi.org/10.1007/s00446-016-0264-0
Bergé, P., Crampton, J., Gutin, G. and Watrigant, R.
The Authorization Policy Existence Problem. Preprint.
http://arxiv.org/pdf/1612.06191
Berget., A. and Fink, A.
Equivariant Chow classes of matrix orbit closures. Tranformation Groups (2016)
http://dx.doi.org/10.1007/s00031-016-9406-5
http://arxiv.org/pdf/1507.05054
Bessenrodt, C. and Bowman, C. D.
Multiplicity-free Kronecker products of characters of the symmetric groups. Preprint.
http://arxiv.org/pdf/1609.03596
Bessy, S.
[see: Bang-Jensen, J.]
Bettinelli, J., Fusy, E., Mailler, C. and Randazzo, L.
A bijective study of Basketball walks. Sémin. Lothar. Comb, to appear.
http://arxiv.org/pdf/1611.01478
Bevan, D.
Intervals of permutation class growth rates. Combinatorica (2017)
http://dx.doi.org/10.1007/s00493-016-3349-2
http://arxiv.org/pdf/1410.3679
Bevan, D.
The permutation class Av(4213,2143). Discrete Math. Theor. Comput. Sci 18 (2016).
http://arxiv.org/pdf/1510.06328
Bevan, D., Erskine G. and Lewis, R. R.
Large circulant graphs of fixed diameter and arbitrary degree . Ars. Math. Contemp.
13 (2017) 275-291.
http://amc-journal.eu/index.php/amc/article/view/969
Bevan, D., Homberger, C. and Tenner, B. E.
Prolific permutations and permuted packings: downsets containing many large
patterns. Preprint.
https://arxiv.org/pdf/1608.06931
Bevan, D., Levin, D., Nugent, P., Pantone, J., Pudwell, L, Riehl, M. and Tlachac,
M L.
Pattern avoidance in forests of binary shrubs. Discrete Math. Theor. Comput. Sci 18
(2016).
http://dmtcs.episciences.org/1541/pdf
van Bevern, R., Fluschnik, T., Mertzios, G. B., Molter, H.,. Sorge, M. and Suchy,
O.
Finding secluded places of special interest in graphs. IPEC2016. pp. 5:1-5:16.
http://community.dur.ac.uk/george.mertzios/papers/Conf/Conf_secluded_probs.pdf
Bezakova, I., Galanis, A,., Goldberg, L. A., Guo, H. and Štefankovič, D.
Approximation via Correlation Decay when Strong Spatial Mixing Fails. ICALP2016
45:1-45:13
http://dx.doi.org/10.4230/LIPIcs.ICALP.2016.45
http://arxiv.org/pdf/1510.09193
Bhattacharya, B. B., Ganguly, S., Lubetzky, E. and Zhao, Y.
Upper tails for arithmetic progressions in a random set. Preprint.
http://arxiv.org/pdf/1605.02994
Binski, S. [see: Balister, P. N.]
Biró, P.,, Fleiner, T. and Irving, R. W.
Matching couples with Scarf’s algorithm. Annals of Mathematics and Artificial
Intelligence 77 (2016) 303-316.
http://dx.doi.org/10.1007/s10472-015-9491-5
http://www.cs.bme.hu/~pbiro/BFI13jh_proc.pdf
Biró, P., Kern, W., Paulusma, D. and Wojuteczky, P.
The Stable Fixtures Problem with Payments. Games and Economic Behaviour, to
appear.
http://dx.doi.org/10.1016/j.geb.2017.02.002
http://community.dur.ac.uk/daniel.paulusma/Papers/Submitted/capacitated.pdf
Bjelde, A., Fischer, F. and Klimm, M.
Impartial Selection And the Power of Up to Two Choices. ACM Transactions on
Economics and Computation, to appear.
Blackburn, S. R. Maximum likelihood decoding for multilevel channels with gain and offset mismatch.
IEEE Trans. Inform. Theory 62 (2016) 1144-1149.
https://doi.org/10.1109/TIT.2016.2521658
http://arxiv.org/pdf/1509.02748
Blackburn, S.R. and Etzion, T.
PIR array codes with optimal PIR rate. Preprint.
https://arxiv.org/pdf/1607.00235
Blackburn, S.R., Etzion, T. and Paterson, M. B.
PIR schemes with small download complexity and low storage requirements. Preprint.
https://arxiv.org/pdf/1609.07027
Blackburn, S. R. and Robshaw, M. J. B.
On the security of the Algebraic Eraser tag authentication protocol.
14th International Conference on Applied Cryptography and Network Security
(ACNS 2016), Lect. Notes Comput. Sci. 9696 (2016) 3-17
http://arxiv.org/pdf/1602.00860.pdf
Blackburn, S. R.
[see: Ben-Zvi, A.]
Blagojević, P.
[see: Bárány, I.,]
Blanché, A., Dąbrowski, K. K., Johnson, M. and Paulusma, D.
Hereditary Graph Classes: When Colouring and Clique Cover Coincide. Preprint.
https://arxiv.org/pdf/1607.06757
Bode, M., Fountoulakis, N. and Müller, T.
The probability that the hyperbolic random graph is connected, Random Struct.
Algorithms 49 (2016), 65-94.
http://dx.doi.org/10.1002/rsa.20626
http://web.mat.bham.ac.uk/N.Fountoulakis/BFM.pdf
Bodirsky, M., Evans, D. M.., Kompatscher, M. and Pinsker, M.
A counterexample to the reconstruction of ω-categorical structures from their
endomorphism monoids. Isr J. Math., to appear.
https://arxiv.org/pdf/1510.00356
Bodirsky, M. and Macpherson, H. D.
Reducts of structures and maximal-closed permutation groups. J. Symb. Log 81 (2016)
http://dx.doi.org/10.1017/jsl.2015.78
http://eprints.whiterose.ac.uk/94046/7/reducts-of-structures-and-maximal-closed-
permutation-groups.pdf
Bodirsky, M., Martin, B., Pinsker, M. and Pongrácz, A.
Constraint satisfaction problems for reducts of homogeneous graphs. ICALP2016.
http://arxiv.org/pdf/1602.05819
Bodor, B., Cameron, P. J. and Szabó, Cs.
Infinitely many reducts of homogeneous structures. Preprint.
http://arxiv.org/pdf/1609.07694
Boguslawski, P., Fadli, F., Mahdjoubi, L, and Zverovich, V. E.
Analytic prioritization of indoor routes for search and rescue operations in hazardous
environments. Computer-Aided Civil and Infrastructure Engineering, to appear.
Boguslawski, P.
[see: Barki, H.]
Bollobás, B., Duminil-Copin, H., Morris, R. D. and Smith, P.
The sharp threshold for the Duarte model. Ann. Probab., to appear.
http://arxiv.org/pdf/1603.05237
Bollobás, B., Fill, J. A. and Riordan, O. M.
A local limit theorem for Quicksort key comparisons via multi-round smoothing.
Preprint.
https://arxiv.org/pdf/1701.04365
Bollobás, B., Lee, J. D. and Letzter, S.
Eigenvalues of subgraphs of the cube. Preprint.
https://arxiv.org/pdf/1605.06360
Bollobás, B. and Riordan, O. M. Counting dense connected hypergraphs via the probabilistic method. Combin. Probab.
Comput. 25 (2016) 21-75.
https://doi.org/10.1017/S0963548315000309
http://arxiv.org/pdf/1511.04739
Bollobás, B. and Riordan, O. M. Exploring hypergraphs with martingales. Random Struct. Algorithms 50 (2017)
325-352
http://dx.doi.org/10.1002/rsa.20678
http://arxiv.org/pdf/1403.6558
Bollobás, B. and Scott, A. D.
On a problem of Erdős and Moser. Abhandlungen des Mathematischen Seminars der
Universität Hamburg (2017),1-10.
http://dx.doi.org/10.1007/s12188-016-0162-1
http://people.maths.ox.ac.uk/scott/Papers/erdosmoser.pdf
Bollobás, B.
[see: Balister, P. N., Balogh, J.]
Bonamy, M. and Meeks, K.
The interactive sum choice number of graphs. Preprint.
http://arxiv.org/pdf/1703.05380
Boncompagni, V., Radovanović, M. and Vušković, K.
The structure of (theta, pyramid, 1-wheel, 3-wheel)-free graphs. Preprint.
http://www.comp.leeds.ac.uk/vuskovi/MKV-Sept-2016.pdf
Bonsma, P. and Paulusma, D.
Using Contracted Solution Graphs for Solving Reconfiguration Problems. MFCS
2016: 20:1-20:15.
http://dx.doi.org/10.4230/LIPIcs.MFCS.2016.20
http://dro.dur.ac.uk/20026/2/20026.pdf
Bordewich, M. J., Linz\, S. and Semple, C.
Lost in space? Generalising subtree prune and regraft to spaces of phylogenetic
networks. J. Theor. Biol, to appear.
http://www.math.canterbury.ac.nz/~c.semple/papers/BLS17.pdf
Bordewich, M. J. and Semple, C.
Determining phylogenetic networks from inter-taxa distances. J. Math. Biol, 73
(2016). 283-303.
http://dx.doi.org/10.1137/130924469
http://dro.dur.ac.uk/17201/1/17201.pdf?DDD10+dcs0mjb+d700tmt
Bordewich, M. J. and Semple, C.
Reticulation-Visible Networks. Adv. Appl. Math. 78 (2016) 114-141.
http://dx.doi.org/10.1016/j.aam.2016.04.004
http://arxiv.org/pdf/1508.05424.pdf
Bordewich, M. J. and Tokac, N.
An algorithm for reconstructing ultrametric tree-child networks from inter-taxa
distances. Discrete Appl. Math. 213 (2016) 47-59.
http://dx.doi.org/10.1016/j.dam.2016.05.011
Borgs, C., Chayes, J. T., Cohn, H. and Zhao, Y.
An 𝐿𝑝 theory of sparse graph convergence II: LD convergence, quotients, and right
convergence. Ann. Probab., to appear.
Böttcher, J.,
Large-scale structures in random graphs. Survey paper for BCC2017.
https://arxiv.org/pdf/1702.02648
Böttcher, J.
[see: Allen, P.]
Bourne, D., Cushing, D., Liu, S. , Münch, F. and Peyerimhoff, N.
Ollivier-Ricci idleness functions of graphs. Preprint.
http://arxiv.org/pdf/1704.04398
Bourne, T. and Ruškuc, N.
On the star-height of subword counting languages and their relationship to Rees zero-
matrix semigroups, Theor. Comput. Sci. 653 (2016) 87--96.
http://dx.doi.org/10.1016/j.tcs.2016.09.024
https://arxiv.org/pdf/1603.06236
Bowler, N., Carmesin, J. and Postle, L.
Reconstruction of infinite matroids from their 3-connected minors. Preprint.
http://arxiv.org/pdf/1606.04235
Bowler, N., Erde, J., Heinig, P., Lehner, F. and Pitz, M. Non-reconstructible locally finite graphs. Preprint.
http://arxiv.org/pdf/1611.04370
Bowler, N., Erde, J., Heinig, P., Lehner, F. and Pitz, M. A counterexample to the reconstruction conjecture for locally finite trees. Preprint.
http://arxiv.org/pdf/1606.02926
Bowler, N., Erde, J., Lehner, F., Merker, M. Pitz, M. and Stavropoulos, K.
A counterexample to Montgomery's conjecture on dynamic colourings of regular
graphs. Preprint.
https://arxiv.org/pdf/1702.00973
Bowman, C. D., Enyang, J. and de Visscher, M.
Simple modules for the partition algebra and monotone convergence of Kronecker
coefficients. Preprint.
http://arxiv.org/pdf/1607.08495
Bowman, C. D.
[see: Bessenrodt, C.]
Brandstädt, A., Dąbrowski, K. K., Huang, S. and Paulusma, D.
Bounding the Clique-Width of H-free split graphs. Discrete Appl. Math. 211 (2016)
30-39.
http://dx.doi.org/10.1016/j.dam.2016.04.003
http://arxiv.org/pdf/1509.04273v1
Brandstädt, A., Dąbrowski, K. K., Huang, S. and Paulusma, D.
Bounding the Clique-Width of H-free Chordal Graphs, J. Graph Theory, to appear.
http://arxiv.org/pdf/1502.06948
Brewster, R. C., McGuinness, S., Moore, B. and Noel, J. A.
A Dichotomy Theorem for Circular Colouring Reconfiguration. Theor. Comput. Sci.,
639 (2016) 1-13.
http://dx.doi.org/10.1016/j.tcs.2016.05.015
http://arxiv.org/pdf/1508.05573
Briand, E., Rattan, A. and Rosas, M.
On the growth of the Kronecker coefficients. Preprint.
https://arxiv.org/abs/1607.02887
Bridson, M. R. and Wilton, H.
Undecidability and the developability of permutoids and rigid pseudogroups. Forum
Math. (Sigma) (2017) 5 (e10).
https://doi.org/10.1017/fms.2017.6
https://people.maths.ox.ac.uk/bridson/papers/BWiltPerm/BWperm.pdf
Brightwell, G. R., Janson, S. and Luczak, M. J.
The greedy independent set in a random graph with given degrees. Random Struct.
Algorithms, to appear.
http://arxiv.org/pdf/1510.05560
Brignall, R., Choi, H., Jeong, J., and Oum, S.-I.
Deciding whether there are infinitely many prime graphs with forbidden induced
subgraphs. Preprint.
http://users.mct.open.ac.uk/rb8599/papers/2016prime.pdf
Brignall, R., Korpelainen, N., and Vatter, V.
Linear clique-width for hereditary classes of cographs. J. Graph Theory 84 (2017),
501-511.
http://dx.doi.org/10.1002/jgt.22037
http://users.mct.open.ac.uk/rb8599/papers/lcw-cographs.pdf
Brignall, R., and Sliačan, J.
Juxtaposing Catalan permutation classes with monotone ones. Preprint.
http://users.mct.open.ac.uk/rb8599/papers/juxt.pdf
Brignall, R.
[see: Albert, M. H., Atminas, A.]
Bringmann, K., Sauerwald, T., Stauffer, A. and Sun, H.,
Balls into bins via local search:cover time and maximum load. Random Struct.
Algorithms 48 (2016) 681-702.
http://dx.doi.org/10.1002/rsa.20602
http://arxiv.org/pdf/1310.0801
Brinkmann, A., Johnson, M., Lotifar, F.., Mäsker, M. and Nagel, L.
Smart Grid-aware scheduling in data centres. Computer Communications 96 (2016)
73-85.
http://dx.doi.org/10.1016/j.comcom.2016.04.021
Britnell, J. R. and Gill, N.
Perfect commuting graphs. J. Group Theory, to appear.
http://arxiv.org/pdf/1309.2237
Britnell, J. R. and Wildon, M. R.
Bell numbers, partition moves and the eigenvalues of the random-to-top shuffle in
Dynkin Types A, B and D. J. Comb. Theory Ser.A. 148 (2016) 116-144.
http://dx.doi.org/10.1016/j.jcta.2016.12.003
http://arxiv.org/pdf/1507.04803
Britnell, J. R. and Wildon, M. R.
The majority game with an arbitrary majority. Discrete Appl. Math. 208 (2016) 1-6.
http://dx.doi.org/10.1016/j.dam.2015.12.016
https://arxiv.org/pdf/1402.5913
Britz, T. and Cameron, P. J.
Codes, chapter in Handbook of the Tutte Polynomial (ed. J. Ellis-Monaghan).
Bromberg, L., Shpilrain, V. and Vdovina, A.
Navigating in the Cayley graph of 𝑆𝐿2(𝐹𝑝) and applications to hashing. Semigroup
Forum 94 (2017) 314-324.
http://dx.doi.org/10.1007/s00233-015-9766-5
http://eprint.iacr.org/2014/814.pdf
Brough T., Ciobanu, L.. Elder, M. and Zetzsche, G.
Permutations of context-free, ETOL and indexed languages. Discrete Math. Theor.
Comput. Sci. 17 (2016)
https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/2751/4740.html
Browning, T. D. and Prendiville, S.
A transference approach to a Roth-type theorem in the squares. Int. Math. Res. Not.
(2016)
https://doi.org/10.1093/imrn/rnw096
http://arxiv.org/pdf/1510.00136
Bruhn, H., Chopin, M, Joos, F. and Schaudt, O.
Structural Parameterizations for Boxicity. Algorithmica 74 (2016), 1453-1472.
http://doi.org/10.1007/s00453-015-0011-0
http://arxiv.org/pdf/1402.4992
Bruhn, H., Heinlein, M. and Joos, F.
Long cycles have the edge-Erdős-Pósa property. Preprint.
http://arxiv.org/abs/1607.01903
Bruhn, H. and Joos, F.
A stronger bound for the strong chromatic index. Combin. Probab. Comput., to
appear.
http://arxiv.org/pdf/1504.02583
Bruhn, H., Joos, F. and Schaudt, O.
Long cycles through prescribed vertices have the Erdős-Pósa property. J. Graph
Theory, to appear.
http://arxiv.org/pdf/1412.2894
Bruin, H., Demers, M. and Todd, M.
Hitting and escaping statistics: mixing, targets and holes. Preprint.
http://arxiv.org/pdf/1609.01196
Bryant, D., Herke, S., Maenhaut, B. and Webb, B. S.
On Hamilton Decompositions of Infinite Circulant Graphs. Preprint.
http://arxiv.org/pdf/1701.08506
Bulatov, A., Goldberg, L. A., Jerrum, M. R., Richerby, D. and Živný, S.
Functional Clones and Expressibility of Partition Functions. Preprint.
http://arxiv.org/pdf/1609.07377
Bureaux, J. [see: Bárány, I.,]
Burness, T. C. and Giudici, M.
Permutation groups and derangements of odd prime order. J. Comb. Theory Ser. A.,
to appear.
http://arxiv.org/pdf/1602.07617
Burness, T. C. and Tong-Viet, H. P.
Primitive permutation groups and derangements of prime power order. Manuscripta
Math., 150 (2016) 255-291
http://dx.doi.org/10.1007/s00229-015-0795-x
http://arxiv.org/pdf/1410.5799
Buset, D., El Amiri, M., Erskine, G., Miller, M. and Pérez-Rosés, H.
A revised Moore bound for mixed graphs.Discrete Math. 339 (2016) 2066–20694
http://dx.doi.org/10.1016/j.disc.2016.03.005
http://arxiv.org/pdf/1508.02596
Bushaw, N., Gunderson, K. and Kalikow, S.
Random Markov processes for countable and uncountable alphabets. 5
Isr. J. Math. 216 (2016) 181.
http://dx.doi.org/10.1007/s11856-016-1407-5
https://arxiv.org/pdf/1410.1457
Bushaw, N.
[see: Balogh, J.]
Butkovič, P.
On tropical supereigenvectors. Linear Algebra Appl. 498 (2016) 574–591.
http://dx.doi.org/10.1016/j.laa.2016.02.033
http://web.mat.bham.ac.uk/P.Butkovic/My%20papers/Supereigs.pdf
Butterfield, J.,
[see: Balogh, J.]
Cai, J.-Y,, Galanis, A., Goldberg, L. A., Guo, H., Jerrum, M. R., Štefankovič, D. and
Vigoda, E. #BIS-Hardness for 2-Spin Systems on Bipartite Bounded Degree Graphs in the Tree
Nonuniqueness Region. J. Comput. Syst. Sci. 82 (2016) 690-711.
http://dx.doi.org/10.1016/j.jcss.2015.11.009
http://arxiv.org/pdf/1311.4451
Cai, L. and Sauerwald, T.
Randomized Load Balancing on Networks with Stochastic Inputs. Preprint.
http://arxiv.org/pdf/1703.08702
Cai, X. S., Perarnau, G., Reed, B. A. and Watts, A. B.
Acyclic edge colourings of graphs with large girth. Random Struct. Algorithms, to
appear.
http://arxiv.org/pdf/1411.3047.pdf
Cain, A. J. and Pfeiffer, M.
4 Some older versions of this paper referred to “partially directed” rather than “mixed” graphs.
5 An earlier version of this paper had the title “Random-step Markov processes”.
Decision problems for word-hyperbolic semigroups. J. Algebra 465 (2016) 287-321.
http://dx.doi.org/10.1016/j.jalgebra.2016.07.007
Cain, A. J.
[see: Brough, T.]
Cameron, A. and Fink, A.
A lattice point counting generalisation of the Tutte polynomial. FPSAC2016
http://arxiv.org/pdf/1604.00962
Cameron, A. and Mayhew, D.
A splitter theorem for connected clutters. Preprint.
http://arxiv.org/pdf/1703.00945.pdf
Cameron, K., Huang, S ., da Silva, M. G.,. and Vušković, K.
Structure and algorithms for (cap, even hole)-free graphs. Preprint.
http://www.comp.leeds.ac.uk/vuskovi/capcolor.pdf
Cameron, P. J.
Asymmetric Latin squares, Steiner triple systems, and edge-parallelisms. Preprint.
Cameron, P. J.
Notes on counting: An introduction to enumerative combinatorics, Austral. Math. Soc.
Lecture Notes series, to appear.
Cameron, P. J.
Enumerative Combinatorics, pp. 1-39 in Algebra, Logic and Combinatorics (ed.
Shaun Bullett, Frank Smith and Tom Fearn), LTCC Advanced Mathematics Series 3,
World Scientific.
Cameron, P. J., Castillo-Ramirez, A., Gadouleau. M. and Mitchell, J. D.
Lengths of words in transformation semigroups generated by digraphs. J. Algebr.
Comb. 45 (2017) 149-170.
http://dx.doi.org/10.1007/s10801-016-0703-9
http://arxiv.org/pdf/1602.00935
Cameron, P. J., Fernandes, E. M., Leemans, D. and Mixer, M.
Highest rank of a polytope for 𝐴𝑛. Proc. Lond. Math. Soc., to appear.
http://arxiv.org/pdf/1605.09173
Cameron, P. J., Gadouleau, M.. R., Mitchell, J. D. and Peresse, Y.
Chains of subsemigroups, Isr. J. Math., to appear.
http://arxiv.org/pdf/1501.06394
Cameron, P. J. and Morgan, K.
Algebraic properties of chromatic roots. Electron. J. Com. 24 (2017), paper #P1.21
http://www.combinatorics.org/ojs/index.php/eljc/article/view/v24i1p21/pdf
Cameron, P. J., Kusuma, J. and Solé, P.
𝑍4 codes and their Gray map images as orthogonal arrays. Des. Codes Cryptography,
published online 23/05/2016.
http://dx.doi.org/10.1007/s10623-016-0225-4
http://arxiv.org/pdf/1510.01509
Cameron, P. J., Lucchini, A. and Roney-Dougal, C. M.
Generating sets of finite groups. Preprint.
https://arxiv.org/pdf/1609.06077
Cameron, P. J. and Nilson, T.
Triple arrays from difference sets. Preprint.
https://arxiv.org/pdf/1609.00152
Cameron, P. J. and Semeraro, J.
The cycle index of a permutation group. Preprint.
http://arxiv.org/pdf/1701.06954
Cameron, P. J.
[see: Araújo, J., Bailey, R. A., Bodor, B., Britz, T., ]
Candellero, E. and Fountoulakis, N.
Clustering and the hyperbolic geometry of complex networks. Internet Math. 12
(2016) 2-53.
http://arxiv.org/pdf/1309.0459
Candellero, E., Ganguly, S., Hoffman, C. and Levine, L.
Oil and water: a two-type internal aggregation model. Ann. Probab., to appear.
http://arxiv.org/pdf/1408.0776
Cannings, C. and Haslegrave, J.
Majority dynamics with one nonconformist. Discrete Appl. Math. 219 (2017) 32-39
http://dx.doi.org/10.1016/j.dam.2016.12.004
Cannon, S., Levin, D. A. and Stauffer, A. Polynomial mixing of the edge-flip Markov chain for unbiased dyadic tilings. Preprint.
http://arxiv.org/pdf/1611.03636
Caprace, P.E.
[see: Behrstock, J.]
Caputo, P., Martinelli, F., Sinclair, A. and Stauffer, A.
Dynamics of Lattice Triangulations on Thin Rectangles. Electron. J. Probab. 21
(2016) 1-22.
http://dx.doi.org/10.1214/16-EJP4321
http://opus.bath.ac.uk/49856/1/Published_Version.pdf
Carbonnel, C., Cohen, D. A., Cooper, M. C. and Živny, S.
On Singleton Arc Consistency for Natural CSPs Defined by Forbidden Patterns.
Preprint.
http://arxiv.org/pdf/1704.06215
Cardoso, D. M., Lozin, V. V., Luz, C. J. and Pacheco, M. F.
Efficient domination through eigenvalues. Discrete Appl. Math. 214 (2016) 54-62.
http://dx.doi.org/10.1016/j.dam.2016.06.014
Carmesin, J.
Topological cycle matroids of infinite graphs. Eur. J. Comb. 60 (2017) 135-150.
http://dx.doi.org/10.1016/j.ejc.2016.09.008
http://www.dpmms.cam.ac.uk/~jc964/cycle_matroids.pdf
Carmesin, J. A short proof that every finite graph has a tree-decomposition displaying its tangles,
Eur. J. Comb. 58 (2016) 61-65.
http://doi.org/10.1016/j.ejc.2016.04.007
http://arxiv.org/pdf/1511.02734
Carmesin, J., Diestel, R., Hamann, M. and Hundertmark, F.
Canonical tree-decompositions of finite graphs II. Essential parts. J. Comb. Theory
Ser B. 118 (2016) 268-283.
http://dx.doi.org/10.1016/j.jctb.2014.12.009
http://arxiv.org/pdf/1305.4909
Carmesin, J. and Gollin, J. P.
Canonical tree-decompositions of a graph that display its k-blocks J. Comb. Theory
Ser. B. 122 (2017) 1-22.
http://dx.doi.org/10.1016/j.jctb.2016.05.001
http://arxiv.org/pdf/1506.02904.pdf
Carmesin, J.
[see: Bowler, N.]
Carvalho, C. and Krokhin, A.
On Algebras with many Symmetric Operations. Int. J. Algebra Comput 26 (2016)
http://dx.doi.org/10.1142/S0218196716500429
https://arxiv.org/pdf/1406.5061
Carvalho, C., Martin, B . and Zhuk, D.
The complexity of quantified constraints. Preprint.
http://arxiv.org/pdf/1701.04086
Castillo-Ramirez, A. and Gadouleau, M.
Ranks of finite semigroups of one-dimensional cellular automata. Semigroup Forum
93 (2016) 347-362.
http://dx.doi.org/10.1007/s00233-016-9783-z
http://arxiv.org/pdf/1510.00197
Castillo-Ramirez, A. and Gadouleau, M.
On Finite Monoids of Cellular Automata. AUTOMATA 2016. Lect. Notes Comput.
Sci. 9664 (2016) 90-104
https://doi.org/10.1007/978-3-319-39300-1_8
http://arxiv.org/pdf/1601.05694
Castillo-Ramirez, A. and Gadouleau, M.
Von Neumann Regular Cellular Automata. Proc. international workshop on cellular
automata and discrete complex systems, Milan, Italy, June 2017, to appear
http://arxiv.org/pdf/1701.02692
Castillo-Ramirez, A. and Gadouleau, M.
Cellular Automata and Finite Groups. Preprint.
http://arxiv.org/pdf/1610.00532
Castillo-Ramirez, A.
[see: Cameron, P. J.]
Castro, F. N., Chapman, R. J., Medina, L. A. and Sepulveda, L. B.
Recursions associated to trapezoid, symmetric and rotation symmetric functions over
Galois fields. Preprint.
http://arxiv.org/pdf/1702.08038.pdf
Cavenagh, N. J. and Griggs, T. S.
Subcubic trades in Steiner triple systems. Discrete Math. 340 (2017) 1351-1358
http://doi.org/10.1016/j.disc.2016.10.021
Ceausu, T.
[see: Bagdasar, O. D.]
Cechlárová, K., Eirinakis, P., Flleiner, T., Magos, D., Manlove, D. F., Mourtos, I.
Ocel’akova, E. and Rastegari, B.
Pareto Optimal Matchings in Many-to-Many Markets with Ties, Theory Comput. Syst
59 (2016) 700-721.
http://dx.doi.org/10.1007/s00224-016-9677-1
http://arxiv.org/pdf/1507.02866
Cechlárová, K., Fleiner, T., Manlove, D. F., and McBride, I.
Stable matchings of teachers to schools. Theor. Comput. Sci. 653 (2016) 15-25.
http://doi.org/10.1016/j.tcs.2016.09.014
http://arxiv.org/pdf/1501.05547
Cechlárová, K., Klaus, B. and Manlove, D. F.
Pareto optimal matchings of students to courses in the presence of prerequisites.
COMSOC 2016.
http://eprints.gla.ac.uk/121256/1/121256.pdf
Cela, E., Deineko, V. and Woeginger, G. J.
New special cases of the Quadratic Assignment Problem with diagonally structured
coefficient matrices. Preprint.
http://arxiv.org/pdf/1609.09796.pdf
Cela, E., Deineko, V. and Woeginger, G. J.
The multi-stripe travelling salesman problem. Preprint.
http://arxiv.org/pdf/1609.09796.pdf
Chapman, R. J.
[see: Castro, F. N.]
Chapuy, G. and Perarnau, G.
Local convergence and stability of tight bridge-addable graph classes. APPROX-
RANDOM 2016.
http://arxiv.org/abs/1609.03974
Chapuy, G. and Perarnau, G.
Connectivity in bridge-addable graph classes: the McDiarmid-Steger-Welsh
conjecture. SODA 2016. .
http://arxiv.org/pdf/1504.06344.pdf
Chatzigeorgiou, I. and Claridge, J.
Probability of Partially Solving Random Linear Systems in Network Coding, Preprint.
http://arxiv.org/pdf/1607.04725
Chayes, J. T.
[see: Borgs, C.]
Chen, T., Martin, B., Martin, J. and Rainmondi, F.
The packing chromatic number of the infinite square lattice is between 13 and 15.
Preprint.6
http://arxiv.org/pdf/1510.02374
Chen, T. Z. Q., Kitaev, S., Mütze, T. and Sun, B. Y.
On universal partial words7. Preprint.
http://arxiv.org/pdf/1601.06456
Chen, T. Z. Q., Kitaev, S. and Sun, B. Y.
Word-representability of face subdivisions of triangular grid graphs. Graphs Comb.
32 (2016) 1749–1761.
http://dx.doi.org/10.1007/s00373-016-1693-z
http://arxiv.org/pdf/1503.08002
Chen, T. Z. Q., Kitaev, S. and Sun, B. Y.
Word-representability of triangulations of grid-covered cylinder graphs. Discrete Appl.
Math. 213 (2016) 60-70.
http://dx.doi.org/10.1016/j.dam.2016.05.025
http://arxiv.org/pdf/1507.06749
Chicot, K. M. and Truss, J. K.
Countable 1-transitive trees, to appear in 'New pathways between group theory and
model theory', Springer-Verlag, 2017.
http://www1.maths.leeds.ac.uk/~pmtjkt/katienew.pdf
Chicot, K. M.
[see: Barbina, S.]
Choi, H.
[see: Brignall, R.]
6 Sufficiently substantial update of previous version, with title about less than 16, to merit
reinclusion. 7 Earlier versions (omitted Mütze as co-author and) appended “over binary alphabets” in the
title.
Choi, I., Kim, J., Kostochka, A. V. and Raspaud, A.
Strong edge-colorings of sparse graphs with large maximum degree. Preprint.
http://arxiv.org/pdf/1610.05406
Chopin, M,
[see: Bruhn, H.]
Chow, S.
Roth--Waring—Goldbach. Int. Math. Res. Not. 307 (2017) 1-27.
http://dx.doi.org/10.1093/imrn/rnw307
http://arxiv.org/pdf/1602.04012
Chow, S.
Birch's theorem with shifts, Ann. Sc. Norm. Super. Pisa Cl. Sci, to appear.
http://arxiv.org/pdf/1410.7789
Christou, M., Crochemore, M. and Iliopoulos, C. S.
Quasiperiodicities in Fibonacci strings. Ars Comb. 129 (2016) 211-225
Chrobak, M.
[see: Anta, A F.]
Chudnovsky, M., Edwards, K.,,Kim, R.,. Scott, A. D. and Seymour, P. D.
Disjoint disjoins. J. Comb. Theory Ser. B. 120 (2016) 18-35.
http://doi.org/10.1016/j.jctb.2016.04.002
https://arxiv.org/pdf/1412.1415
Chudnovsky, M., Scott, A. D. and Seymour, P. D.
Induced subgraphs of graphs with large chromatic number. II Three steps towards
Gyárfás' conjecture. J. Comb. Theory Ser. B., 118 (2016),109-128.
http://dx.doi.org/10.1016/j.jctb.2016.01.003
http://people.maths.ox.ac.uk/scott/Papers/gyarfas.pdf
Chudnovsky, M., Scott, A. D. and Seymour, P. D.
Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes.
Preprint.
https://people.maths.ox.ac.uk/scott/Papers/longer.pdf
Chudnovsky, M., Scott, A. D. and Seymour, P. D.
Induced subgraphs of graphs with large chromatic number. XI. Orientations. Preprint.
http://people.maths.ox.ac.uk/scott/Papers/orientations.pdf
Chudnovsky, M., Scott, A. D. and Seymour, P. D.
Induced subgraphs of graphs with large chromatic number. XII. Two-legged
caterpillars. Preprint.
http://people.maths.ox.ac.uk/scott/Papers/caterpillars.pdf
Chudnovsky, M., Scott, A. D.. Seymour, P. D. and Spirkl, S.
Induced subgraphs of graphs with large chromatic number VIII. Long odd holes.
http://arxiv.org/pdf/1701.07217
Chun, C., Chun. D. and Noble, S. D.
Inductive tools for connected ribbon graphs, delta-matroids and multimatroids.
Preprint.
http://arxiv.org/pdf/1702.07179
Chun, C., Ding, G., Mayhew, D. and Oxley, J. G.
Unavoidable connected matroids retaining a specified minor. SIAM J. Discrete Math.,
30 (2016) 1590–1606.
http://dx.doi.org/10.1137/14096089X
http://www.math.lsu.edu/~oxley/cdmosplitter10.pdf
Chun, C., Hall, R., Merino, C. and Noble, S. D.
On zeros of the characteristic polynomial of matroids of bounded tree-width. Eur. J.
Comb. 60 (2017) 10-20.
https://doi.org/10.1016/j.ejc.2016.08.011
http://arxiv.org/pdf/1703.02393
Chun, C., Mayhew, D. and Oxley, J. G.
Towards a Splitter Theorem for internally 4-connected binary matroids IX: The
theorem. J. Comb. Theory, Ser. B 121 (2016) 2-67.
http://dx.doi.org/10.1016/j.jctb.2016.08.001
http://homepages.ecs.vuw.ac.nz/~mayhew/Publications/CMO16.pdf
Chun, C., Moffatt, I. Noble, S. D. and Rueckriemen, R. D.
On the interplay between embedded graphs and delta-matroids. Preprint.
http://arxiv.org/pdf/1602.01306
Chun, C., Moffatt, I. Noble, S. D. and Rueckriemen, R. D.
Matroids, Delta-matroids and Embedded Graphs. Preprint.
http://arxiv.org/pdf/1403.0920 8
Chun, D.
[see: Chun, C.]
Chuzhanova, N., Crofts, J. J. and Pearcy, N.
Complexity and robustness in hypernetwork models of metabolism. J. Theor. Biol.
406 (2016) 99-104.
https://doi.org/10.1016/j.jtbi.2016.06.032
Ciobanu, L., Diekert, V. and Elder, M. Solution sets for equations over free groups are EDT0L languages. Int. J. Algebra
Comput 26 (2016) 843-886.
http://arxiv.org/pdf/1508.02149
Ciobanu, L. and Kolpakov, I.
Geodesic growth of right-angled Coxeter groups based on trees, J. Algebr. Comb. 44
(2016) 249-264.
http://dx.doi.org/10.1007/s10801-016-0667-9
http://arxiv.org/pdf/1504.02774
Ciobanu, L.
[see: Antolin, Y., Brough, T.]
Claridge, J.
[see: Chatzigeorgiou, I.]
Clifford, R., Jalsenius, M. and Sach, B.
Cell-Probe Lower Bounds for Bit Stream Computation. ESA 2016.
http://dx.doi.org/10.4230/LIPIcs.ESA.2016.31
http://drops.dagstuhl.de/opus/volltexte/2016/6382/pdf/LIPIcs-ESA-2016-31.pdf
Clifford, R., Fontaine, A., Starkovskaya, T. and Vidhøj, H. W.
Dynamic and Approximate Pattern Matching in 2D. SPIRE 2016. Lect. Notes.
Comput. Sci. 9954 133-144.
http://dx.doi.org/10.1007/978-3-319-46049-9_13
http://link.springer.com/chapter/10.1007/978-3-319-46049-9_13/fulltext.html
Clifford, R. and Starkovskaya, T.
Approximate Hamming distance in a stream. ICALP 2016.
http://dx.doi.org/10.4230/LIPIcs.ICALP.2016.20
http://arxiv.org/pdf/1602.07241
8 These two papers by Chun//Moffatt.Noble/Rueckrienen are an (expansion of and) spilltitng
of an earlier paper.
Clinch, K., Global rigidity of 2-dimensional direction-length frameworks with connected rigidity
matroids, Preprint.
http://arxiv.org/pdf/1608.08559
Clinch, K., Jackson, B. and Keevash, P.
Global rigidity of 2-dimensional direction-length frameworks. Preprint.
http://arxiv.org/pdf/1607.00508
Cochefert, M., Couturier, J.-F., Golovach, P. A., Kratsch, D., Paulusma, D. and
Stewart, A.
Squares of Low Maximum Degree. Preprint.
http://arxiv.org/pdf/1608.06142
Codish, M., Frank, M., Itzhakov, A. and Miller, A.
Computing the Ramsey number R(4,3,3) using abstraction and symmetry breaking,
Constraints 21 (2016) 75-393.
https://doi.org/10.1007/s10601-016-9240-3
http://arxiv.org/pdf/1510.08266
Cohen, D. A., Crampton, J., Gagarin, A., Gutin, G. Z. and Jones, M.
Algorithms for the workflow satisfiability problem engineered for counting
constraints. J. Comb. Optim. 32 (2016) 3-24.
http://dx.doi.org/10.1007/s10878-015-9877-7
Cohen, D. A., and Jeavons, P. G.
The power of propagation: when GAC is enough. Constraints 22 (2017) 3-23.
https://doi.org/10.1007/s10601-016-9251-0
Cohen, D. A., Cooper, M. C., Jeavons, P. G., Krokhin, A., Powell, R. and Živny,
S.
Binarisation for Valued Constraint Satisfaction Problems. Preprint.
http://arxiv.org/pdf/1608.01628
Cohen, D. A., Cooper, M. C., Jeavons, P. G. and Živny, S.
Binary Constraint Satisfaction Problems Defined by Excluded Topological Minors.
Preprint.
http://arxiv.org/pdf/1608.05358
Cohen, D. A.
[see: Carbonnel, C.]
Cohen, E., Csikväri, P., Perkins, W. and Tetali, P.
The Widom-Rowlinson model, the hard-core model and the extremality of the
complete graph. Eur. J. Comb., to appear.
http://arxiv.org/pdf/1606.03718
Cohen, E., Perkins, W. and Tetali, P.
On the Widom-Rowlinson Occupancy Fraction in Regular Graphs. Combin. Probab.
Comput. 26 (2017) 183-194.
http://doi.org/10.1017/S0963548316000249
http://arxiv.org/pdf/1512.06398.pdf
Cohen-Addad, V., Hebdige, M. Král’, D., Li, Z. and Salgado, E.
Steinberg's Conjecture is false. J. Comb. Theory Ser. B. 122 (2017) 452-456.
http://dx.doi.org/10.1016/j.jctb.2016.07.006
http://arxiv.org/pdf/1604.05108.pdf
Cohn, H.
[see: Borgs, C.]
Coja-Oghlan, A. and Perkins, W.
Belief propagation on replica symmetric random factor graph models.
APPROX/RANDOM 2016.
http://dx.doi.org/10.4230/LIPIcs.APPROX-RANDOM.2016.27
http://arxiv.org/pdf/1603.08191
Coja-Oghlan, A.. Perkins, W. and Skubch, K.
Limits of discrete distributions and Gibbs measures on random graphs. Eur. J. Comb.
http://arxiv.org/pdf/1512.06798
Coja-Oghlan, A.. Krzakala, F., Perkins, W. and Zdeborova, L.
Information-theoretic thresholds from the cavity method. Preprint.
http://arxiv.org/pdf/1611.00814
Collares Neto, M.
[see: Balogh, J.]
Collini-Baldeschi, R., Goldberg, P. W., de Keijzer, B., Leonardi, S.,
Roughgarden, T. and Turchetta, S.
Approximately Efficient Two-Sided Combinatorial Auctions. Preprint.
http://arxiv.org/pdf/1611.05342
Collins, A., Foniok, J., Korpelainen, N., Lozin, V. V. and Zamaraev, V.
Infinitely many minimal graph classes of unbounded clique-width. Discrete Appl.
Math, to appear.
http://arxiv.org/pdf/1701.08857
Collins, A., Kitaev, S. and Lozin, V. V.
New results on word-representable graphs, Discrete Appl. Math. 216 (2017)
136–141.
http://doi.org/10.1016/j.dam.2014.10.024
http://arxiv.org/pdf/1307.1810
Collins, A.
[see: Atminas, A.]
Conder, M. E., and Širáň, J.
Orientably-regular maps with given exponent group. Bull. Lond. Math. Soc. 48 (2016)
1013-1017.
https://doi.org/10.1112/blms/bdw059
Conlon, D.
A sequence of triangle-free pseudorandom graphs. Combin. Probab. Comput. 26
(2017) 195-200.
https://doi.org/10.1017/S0963548316000298
http://people.maths.ox.ac.uk/~conlond/Triangle-free.pdf
Conlon, D., Ferber, A., Nenadov, R. and Škorić, R.
Almost-spanning universality in random graphs. Random Struct. Algorithms 50 (2017)
380-393.
http://dx.doi.org/10.1002/rsa.20661
http://arxiv.org/pdf/1503.05612
Conlon, D., Fox, J., Lee, C. and Sudakov, B.
Ramsey numbers of cubes versus cliques. Combinatorica 36 (2016) 37-70.
http://dx.doi.org/10.1007/s00493-014-3010-x
http://people.maths.ox.ac.uk/~conlond/cubes-vs-cliques.pdf
Conlon, D., Fox, J., Lee, C. and Sudakov, B.
Ordered Ramsey numbers. J. Comb. Theory Ser. B. 122 (2017) 353-383.
http://dx.doi.org/10.1016/j.jctb.2016.06.007
http://people.maths.ox.ac.uk/~conlond/OrderedRamsey.pdf
Conlon, D., Fox, J. and Rödl V.
Hedgehogs are not colour blind, J. Comb. to appear.
http://people.maths.ox.ac.uk/~conlond/Hedgehogs.pdf
Conlon, D., Fox, J. and Sudakov, B.
Short proofs of some extremal results II. J. Comb. Theory Ser. B. 121 (2016) 173-196.
https://doi.org/10.1016/j.jctb.2016.03.005
http://people.maths.ox.ac.uk/~conlond/essays2.pdf
Conlon, D., Fox, J. and Sudakov, B.
Tower-type bounds for unavoidable patterns in words. Preprint.
http://www.math.ethz.ch/~sudakovb/zimin-words.pdf
Conlon, D., Fox, J., Sudakov, B.
Hereditary quasirandomness without regularity. Math. Proc. Camb. Philos. Soc., to
appear.
http://people.maths.ox.ac.uk/~conlond/hereditary.pdf
Conlon, D. and Gowers, W. T.
Freiman homomorphisms on sparse random sets, Q. J. Math., to appear.
http://people.maths.ox.ac.uk/~conlond/homomorphisms.pdf
Conlon, D. and Gowers, W. T.
Combinatorial theorems in sparse random sets. Ann. Math. 184 (2016) 367-454.
http://people.maths.ox.ac.uk/~conlond/SparseRandom.pdf
Conlon, D. and Lee, J.
Finite reflection groups and graph norms. Preprint.
http://people.maths.ox.ac.uk/~conlond/norming.pdf
Conlon, D. and Zhao, Y.
Quasirandom Cayley graphs. Discrete Anal. 2017, Paper No. 6, 14 pp.
http://dx.doi.org/10.19086/da.1294
http://people.maths.ox.ac.uk/~conlond/quasirandom_cayley.pdf
Cooley, O., Kang, M., and Koch, C.
Threshold and Hitting Time for High-Order Connectedness in Random Hypergraphs.
Electron. J. Comb. 23 (2016) P2.48
http://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i2p48
Cooley, O. and Mycroft, R.
The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform
hypergraph. Discrete Math., to appear.
http://arxiv.org/pdf/1606.05616
Cooley, O.
[see: Allen, P.]
Cooper, C.,. Dyer M. E., Frieae, A. M. and Rivera, N.
Discordant voting processes on finite graphs. ICALP2016.
http://www.math.cmu.edu/~af1p/Texfiles/Vote.pdf
Cooper, C.,. Dyer M. E., Greenhill, C. and Handley, A. J.
The flip Markov chain for connected regular graphs. Preprint.
https://arxiv.org/pdf/1701.03856
Cooper, C., Frieze, A. M., and Pegden, W.
Minors of a random binary matroid. Preprint.
https://www.math.cmu.edu/~af1p/Texfiles/Minors.pdf
Cooper, C. Radzik, T. and Rivera, N.
The coalescing-branching random walk on expanders and the dual epidemic process.
PODC’16 proceedings 461-467.
https://doi.org/10.1145/2933057.2933119
http://arxiv.org/pdf/1602.05768
Cooper, C. Radzik, T., Rivera, N. and Shiraga, T. Fast plurality consensus in regular expanders. Preprint.
http://arxiv.org/pdf/1605.08403
Cooper, C. Radzik, T.and Siantos, Y.
Fast Low-Cost Estimation of Network Properties Using Random Walks. Internet
Math. 12 (2016) 221-238.
http://dx.doi.org/10.1080/15427951.2016.1164100
Cooper, C. and Rivera, N.
The Linear Voting Model. ICALP2016.
http://dx.doi.org/10.4230/LIPIcs.ICALP.2016.144
http://drops.dagstuhl.de/opus/volltexte/2016/6288/pdf/LIPIcs-ICALP-2016-144.pdf
Cooper, C.
[see: Bal, D.]
Cooper, J. W., Kaiser, T., Král’, D. and Noel, J. A.
Weak regularity and finitely forcible graph limits. Trans. Am. Math. Soc., to appear.
http://arxiv.org/pdf/1507.00067
Cooper, J. W., Král’, D. and Martins, T.
Finitely forcible graph limits are universal. Preprint.
http://arxiv.org/pdf/1701.03846
Cooper, M. C. and Živný, S.
The power of arc consistency for CSPs defined by partially-ordered forbidden
patterns. Preprint.
http://arxiv.org/pdf/1604.07981
Cooper, M. C.
[see: Carbonnel, C., Cohen, D. A.]
Cossidente, A. King, O.H., and Marino, G.
Hyperovals arising from a Singer group action on H(3,𝑞2), q even. Adv. Geom. 16
(2016) 481-486.
https://doi.org/10.1515/advgeom-2016-0021
https://www.staff.ncl.ac.uk/o.h.king/CossidenteKingMarinoAG16.pdf
Coutinho, G.
[see: Banchi, L.]
Couturier, J.-F.
[see; Cochefort, M.]
Craik, J. Gray, R. D., Kilibarda, V., Mitchell, J. D. and Ruškuc, N.
Ends of semigroups. Semigroup Forum 93 (2016). 330-346.
http://dx.doi.org/10.1007/s00233-016-9814-9
http://arxiv.org/pdf/1409.1044
Crampton, J., Farley, N., Gutin, G., Jones, M. and Poettering, B.
Cryptographic Enforcement of Information Flow Policies without Public Information
via Tree Partitions. Preprint.
http://arxiv.org/pdf/1608.08386
Crampton, J., Gagarin, A., Gutin, G., Jones, M. and Wählstrom, M.
On the Workflow Satisfiability Problem with Class-Independent Constraints for
Hierarchical Organizations. ACM Trans. Priv. Secur. 19 (2016) 8:1-8:29
http://doi.acm.org/10.1145/2988239
Crampton, J., Gutin, G., Karapetyan, D. and Watrigant, R.
The Bi-Objective Workflow Satisfiability Problem and Workflow Resiliency. J.
Computer Security (2016).
http://dx.doi.org/10.3233/JCS-16849
http://arxiv.org/pdf/1512.07019
Crampton, J., Gutin, G., Koutecky, M. and Watrigant, R.
Parameterized Resiliency Problems via Integer Linear Programming. Preprint.
http://arxiv.org/pdf/1605.08738
Crampton, J., Gutin, G.,, and Watrigant, R.
A Multivariate Approach for Checking Resiliency in Access Control. AAIM 2016
173-184.
http://dx.doi.org/10.1007/978-3-319-41168-2_15
http://arxiv.org/pdf/1604.01550
Crampton, J., Gutin, G., and Watrigant, R.
Resiliency Policies in Access Control Revisited. SACMAT2016.
https://doi.org/10.1145/2914642.2914650
Crampton, J. and Sellwood, J.
Relationships, Paths and Principal Matching: A New Approach to Access Control.
CODASPY 2016, 219-230.
http://arxiv.org/pdf/1505.07945
Crampton, J.
[see: Bergé, P., Cohen, D. A.]
Crochemore, M,, Epifanio, C., Grossi, R. and Mignosi, F.
Linear-size suffix tries. Theor. Comput. Sci. 638 (2016) 171-178.
http://dx.doi.org/10.1016/j.tcs.2016.04.002
Crochemore, M, Iliopoulos, C. S., Kociumaka, T., Kubica, M., Langiu, A., Pissis,
S. P., Radoszewski, J., Rytter, W., and Walen, T.
Order-preserving indexing. Theor. Comput. Sci. 638 (2016) 122-135.
http://dx.doi.org/10.1016/j.tcs.2015.06.050
Crochemore, M, Iliopoulos, C. S., Kociumaka, T., Kundu, R., Langiu, A., Pissis,
S. P., Radoszewski, J., Rytter, W., and Walen, T.
Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE
Queries. SPIRE 2016 22-34
http://dx.doi.org/10.1007/978-3-319-46049-9_3
http://arxiv.org/pdf/1606.08275
Crochemore, M, Iliopoulos, C. S., Langiu, A and Mignosi, F.
The longest common substring problem. Mathematical Structures in Computer
Science 27 (2017) 277-295
http://dx.doi.org/10.1017/S0960129515000110
Crochemore, M. and Mercas, R.
On the density of Lyndon roots in factors. Theor. Comput. Sci. 656 (2016) 234-240.
http://dx.doi.org/10.1016/j.tcs.2016.02.015
Crochemore, M. [see: Badkobeh, G., Christou, G..]
Crofts, J.J., Forrester, M. and O’Dea, R.
Structure-function clustering in multiplex brain networks. Europhysics Letters 116
(2016) 18003.
https://doi.org/10.1209/0295-5075/116/18003
Crofts, J. J.
[see: Chuzhanova, N.]
Cruickshank, J., Kitson, D. and Power, S. C.
The generic rigidity of triangulated spheres with blocks and holes. J. Comb. Theory
Ser B. 122 (2016) 550-577.
http://dx.doi.org/10.1016/j.jctb.2016.08.003
http://arxiv.org/pdf/1507.02499
Csaba, B. , Kühn, D., Lo, A., Osthus, D. and Treglown, A.
Proof of the 1-factorization and Hamilton decomposition conjectures, Mem. Am. Math.
Soc. 224 (2016), monograph 1154
http://web.mat.bham.ac.uk/S.A.Lo/pub/1fact_final.pdf
Cseh, A., Irving, R. W. and Manlove, D. F.
The Stable Roommates problem with short lists. SAGT 2016. Lect. Notes Comput.
Sci. 9928 (2016) 207-219
http://dx.doi.org/10.1007/978-3-662-53354-3_17
http://arxiv.org/pdf/1605.04609
Cseh, A. and Manlove, D. F.
Stable marriage and roommates problems with restricted edges: Complexity and
approximability. Discrete Optim. 20 (2016) 62-89.
http://doi.org/10.1016/j.disopt.2016.03.002
http://arxiv.org/pdf/1412.0271
Cseh, A.
[see: Arulselvan, A.]
Csikvári, P. Frenkel, P. E.,. Hladky, J. and Hubai, T.
Chromatic roots and limits of dense graphs. Discrete Math. 340 (2017) 1129–1135
http://dx.doi.org/10.1016/j.disc.2016.11.009
http://arxiv.org/pdf/1511.09429
Csikvári, P.
[see: Cohen, E.]
Csóka, E., Grabowski, L.. Mathe, A., Pikhurko, O. and Tyros, K.
Borel version of the Local Lemma. Preprint.
http://arxiv.org/pdf/1605.04877
Csóka, E., Lippner, G. and Pikhurko, O.
Konig's Line Coloring and Vizing's Theorems for Graphings. Forum Math (Sigma) 4
(2016)
http://arxiv.org/pdf/1408.1973
Csóka, E., Lo, I., Norin, S., Wu, H. and Yepremyan, L.
The extremal function for disconnected minors. J. Comb. Theory. Ser. B., to appear.
http://arxiv.org/pdf/1509.01185
Cucuringu, M., Lee, S. H., Porter, M. A. and Rombach, M. P.
Detection of Core-Periphery Structure in Networks Using Spectral Methods and
Geodesic Paths. European Journal of Applied Mathematics 27 (2016)
846-887
https://doi.org/10.1017/S095679251600022X
http://arxiv.org/pdf/1410.6572
Curticapean, R., Dell, H. Fomin, F., Goldberg, L. A. and Lapinskas, J.
A Fixed-Parameter Perspective on #BIS. Preprint.
http://arxiv.org/pdf/1702.05543
Cushing, D., Liu, S. and Peyerimhoff, N.
Bakry-Émery curvature functions of graphs. Preprint.
http://arxiv.org/pdf/1606.01496
Cushing, D.
[see: Bourne, D.]
Cutler, J. and Pebody, L.
Maximal-clique partitions and the Roller Coaster Conjecture. J. Comb. Theory Ser A.
145 (2017) 25-35.
https://doi.org/10.1016/j.jcta.2016.06.019
http://arxiv.org/pdf/1412.4595
Czumaj, A. and Davies, P.
Faster Deterministic Communication in Radio Networks. ICALP2016, article 139.
http://arxiv.org/pdf/1506.00853
Czumaj, A. and Davies, P.
Optimal leader election in multi-hop radio networks. PODC2016 47-49.
http://arxiv.org/pdf/1505.06149
Czumaj, A. and Davies, P.
Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio
Networks. Preprint.
http://arxiv.org/pdf/1703.01859
Czumaj, A., Deligkas, A., Fasoulakis, M., Fearnley, J., Jurdziński, M. and
Savani, R. Distributed Methods for Computing Approximate Equilibria. WINE 2016. Lect.
Notes. Comput. Sci. 10123 (2016) 15-28.
http://doi.org/10.1007/978-3-662-54110-4_2
https://arxiv.org/pdf/1512.03315
Czumaj, A., Fasoulakis, M. and Jurdziński, M. Approximate Plutocratic and Egalitarian Nash Equilibria. AAMAS 2016 1409 – 1410.
http://trust.sce.ntu.edu.sg/aamas16/pdfs/p1409.pdf
Czumaj, A., Peng, P. and Sohler, C.
Relating Two Property Testing Models for Bounded Degree Directed Graphs. STOC
2016, 1033 – 1045.
http://acm-stoc.org/stoc2016/
Czyzowicz, J., Derenowski, D., Gąsieniec, L., Klasing, R., Kosowski, A. and
Pajak, D.
Collision-free network exploration. J. Comput. Syst. Sci. 86 (2017) 70-81.
http://doi.org/10.1016/j.jcss.2016.11.008
https://hal.inria.fr/docs/00/73/62/76/PDF/collision-free-exploration.pdf
Czyzowicz, J.
[see: Akrida, E. C.]
Dąbrowski, K. K., Dross, F.. and Paulusma, D.
Colouring Diamond-free Graphs. SWAT2016.
Leibniz International Proceedings in Informatics 53 (2016) 16:1-16:14
http://dx.doi.org/10.4230/LIPIcs.SWAT.2016.16
http://arxiv.org/pdf/1512.07849
Dąbrowski, K. K., de Werra, D., Lozin, V. V. and Zamaraev, V.
Combinatorics and algorithms for augmenting graphs. Graphs. Comb. 32 (2016)
1339-1352.
http://dx.doi.org/10.1007/s00373-015-1660-0
http://arxiv.org/pdf/1410.8774
Dąbrowski, K. K., Golovach, P. A., van ‘t Hot, P., Paulusma, D. and Thilikos, D.
M.
Editing to a Planar Graph of Given Degrees. J. Comput. Syst. Sci. 85 (2017) 168-182.
http://dx.doi.org/10.1016/j.jcss.2016.11.009
http://arxiv.org/pdf/1508.02773
Dąbrowski, K. K., Huang, S. and Paulusma, D.
Bounding Clique-Width via Perfect Graphs. J. Comput. Syst. Sci., to appear.
http://arxiv.org/pdf/1406.6298
Dąbrowski, K. K.,, Lozin, V. V. and Paulusma, D.
Well-quasi-ordering versus clique-width: new results on bigenic classes. Lect. Notes
Comput. Sci. 9843 (2016) 253-265.
http://dx.doi.org/10.1007/978-3-319-44543-4_20
http://arxiv.org/pdf/1611.03671
Dąbrowski, K. K., and Paulusma, D.
Clique-width of Graph Classes Defined by Two Forbidden Induced Subgraphs. The
Computer Journal 59 (2016) 650-666
https://doi.org/10.1093/comjnl/bxv096
http://arxiv.org/pdf/1405.7092
Dąbrowski, K. K.
[see: Alves, S. R., Blanché, A., Brandstädt, A.]
Dairyko, M., Hogben, L.., Lin, J. C.-H.,. Lockhart, J.,. Roberson, D. E.. Severini,
S. and Young, M. Note on von Neumann and Rényi entropies of a graph. Linear Algebra Appl., to
appear.
http://arxiv.org/pdf/1609.00420
Dalmau, V., Kozik M,, Krokhin, A., Makarychev, K., Makarychev, Y. and
Oprsal, J.
Robust algorithms with polynomial loss for near-unanimity CSPs. SODA'17, 340-357,
2017.
http://arxiv.org/pdf/1607.04787
Dalmau, V., Krokhin, A. and Manokaran, R.
Towards a Characterization of Constant-Factor Approximable Finite-Valued CSPs.
Preprint.
http://arxiv.org/pdf/1610.01019
Dalmau, V.
[see: Bodirsky, M]
Daniels, C. and Penrose, M. D.
Percolation of even sites for enhanced random sequential adsorption. Stochastic
Processes Appl 127 (2017) 803-830.
http://dx.doi.org/10.1016/j.spa.2016.07.001
David, S., Spink, H. and Tiba, M.
Geometric Symmetric Chain Decompositions. Preprint.
http://arxiv.org/pdf/1703.10954
Davidson, A. and Ganesh, A. J.
The Robot Crawler Model on Complete k-Partite and Erdós-Rényi Random Graphs.
Preprint.
http://arxiv.org/pdf/1702.08371.pdf
Davies, E., Jenssen, M. Perkins, W. and Roberts, B.
Extremes of the internal energy of the Potts model on cubic graphs. Preprint.
http://arxiv.org/pdf/1610.08496
Davies, E., Jenssen, M. Perkins, W. and Roberts, B.
On the average size of independent sets in triangle-free graphs. Proc. Am. Math. Soc.,
to appear.
http://arxiv.org/pdf/1606.01043.pdf
Davies, E., Jenssen, M. Perkins, W. and Roberts, B.
Multicolour Ramsey numbers of paths and even cycles. Preprint.
https://arxiv.org/pdf/1606.00762
Davies, E., Jenssen, M. Perkins, W. and Roberts, B.
Tight bounds on the coefficients of partition functions via stability. Preprint.
http://arxiv.org/pdf/1704.07784
Davies, P.
[see: Czumaj, A.]
Davis, J. A., Huczynska, S. and Mullen, G. L.
Near-complete external difference families. Des. Codes Cryptography (2016) 1-10.
http://dx.doi.org/10.1007/s10623-016-0275-7
Dawar, A., Severini, S. and Zapata, O.
Descriptive complexity of graph spectra. WOLLIC 2016. Lect. Notes.Comput. Sci.
9803 (2016)
http://dx.doi.org/10.1007/978-3-662-52921-8_12
http://arxiv.org/pdf/1603.07030
Day, A. N.
Saturated Graphs of Prescribed Minimum Degree. Combin. Probab. Comput. 26
(2016) 201-207.
https://doi.org/10.1017/S0963548316000377
http://arxiv.org/pdf/1407.6664
Day, A. N. and Johnson, J. R.
Multicolour Ramsey Numbers of Odd Cycles. J. Comb. Theory Ser. B. 124 56-63.
http://dx.doi.org/10.1016/j.jctb.2016.12.005
http://arxiv.org/pdf/1602.07607
Daykin, J. W., Groult, R., Guesnet, Y., Lecroq, T., Lefebvre, A., Léonard, M.
and Prieur-Gaston, E.
Binary block order Rouen Transform. Theor. Comput. Sci. 656 (2016) 118–134.
http://dx.doi.org/10.1016/j.tcs.2016.05.028
Daykin, J. W.
[see: Alatabbi, A.,]
DeCorte, E. and Pikhurko, O.
Spherical sets avoiding a prescribed set of angles. Int. Math. Res. Not. 2016
6095-6117.
http://dx.doi.org/10.1093/imrn/rnv319
http://imrn.oxfordjournals.org/content/early/2015/11/29/imrn.rnv319.full.pdf+html
Deineko, V.
A framework for small but rich vehicle routing problems. Preprint.
http://arxiv.org/pdf/1610.01876.pdf
Deineko, V.
[see: Cela, E.]
Deligkas, A., Fearnley, J. and Savani, R.
Inapproximability Results for Approximate Nash Equilibria. Preprint.
http://arxiv.org/pdf/1608.03574
Deligkas, A., Mertzios, G. B. and Spirakis, P. G.
The computational complexity of weighted greedy matching. AAAI-17.
http://arxiv.org/pdf/1602.05909
Deligkas, A., Mertzios, G. B. and Spirakis, P. G.
Binary Search in Graphs Revisited. Preprint.
https://arxiv.org/pdf/1702.08899
Deligkas, A.. [see: Czumaj, A.]
Dell, H.
[see: Curticapean, R.]
Demers, M. and Todd, M.
Slow and fast escape for open intermittent maps. Commun. Math.Phys. 351 (2017)
775–835
http://dx.doi.org/10.1007/s00220-017-2829-6
http://arxiv.org/pdf/1603.05706
Demers, M. and Todd, M.
Equilibrium states, pressure and escape for multimodal maps with holes. Isr. J. Math.,
to appear.
http://arxiv.org/pdf/1402.4278
Demers, M.
[see: Bruin, H.]
Dereich, S., Mailler, C. and Mörters, P.
Non-extensive condensation in reinforced branching processes. Ann. Appl. Probab., to
appear.
http://people.bath.ac.uk/maspm/reinforced_accepted.pdf
Derenowski, D.
[see: Czyzowicz, J.]
Dettmann, C. P. and Georgiou, O.
Isolation probabilities in dynamic soft random geometric graphs. Preprint.
http://arxiv.org/pdf/1610.09884
Dettmann, C. P., Georgiou, O. and Knight, G.
Spectral statistics of random geometric graphs. Preprint.
http://arxiv.org/pdf/1608.01154
Dettmann, C. P., Georgiou, O. and Pratt, P.
How does mobility affect the connectivity of interference-limited ad-hoc networks?
SPASWIN 2016, to appear.
http://dx.doi.org/10.1109/WIOPT.2016.7492959
https://arxiv.org/pdf/1511.02113
Devi, P., Gagarin, A. and Rajkumar, R.
Classification of finite groups with toroidal or projective-planar permutability graphs.
Commun. Algebra 44 (2016) 3705-2726.
http://dx.doi.org/10.1080/00927872.2015.1087004
Devroye, L., Holmgren, C. and Sulzbach, H.
The heavy path approach to Galton-Watson trees with an application to Apollonian
networks. Preprint.
http://arxiv.org/pdf/1701.02527
Devroye, L,
[see: Amini, O.]
de Werra, D.
[see: Dąbrowski, K. K.,]
Diaz, J., Goldberg, L. A., Richerby, D. and Serna, M.
Absorption Time of the Moran Process. Random Struct. Algorithms 49 (2016) 137-
159.
http://dx.doi.org/10.1002/rsa.20617
http://www.cs.ox.ac.uk/people/leslieann.goldberg/publications.html#MoranDir
Diaz, J. and Mertzios, G. B.
Minimum bisection is NP-hard on unit disk graphs. Inf. Comput., to appear.
http://community.dur.ac.uk/george.mertzios/papers/Jour/Jour_Bisection-Unit-
Disk.pdf
Dickerson, J. P., Manlove, D. F., Plaut, B., Samdholm, T. and Trimble, J.
Position-indexed formulations for kidney exchange. In Proceedings of EC 2016: the
17th ACM Conference on Economics and Computation, pages 25-42, ACM, 2016.
http://doi.org/10.1145/2940716.2940759
http://arxiv.org/pdf/1606.01623
Diekert, V. [see: Ciobanu, L.]
Diestel, R.
[see: Carmesin, J.]
Ding, G.
[see: Chun, C.]
Dobson, T.
[see: Araújo, J.]
Doležal, M., Hladký, J. and Máthé, A.
Cliques in dense inhomogeneous random graphs. Random. Struct. Algorithms, to
appear. http://arxiv.org/pdf/1510.02335
Dolich A. [see: Aschenbrenner M.]
Dolinka, I., East, J. and Gray, R. D.
Motzkin moniods and partial Brauer monoids. J. Algebra 471 (2017) 251-298.
http://doi.org/10.1016/j.jalgebra.2016.09.018
http://arxiv.org/pdf/1512.02279
Donoven, C., Mitchell, J.. D. and Wilson, W.
Computing maximal subsemigroups of a finite semigroup. Preprint.
http://arxiv.org/pdf/1606.05583
Drápal, A. and Griggs, T. S.
On cosets in Steiner loops. Bull. Acad. Stiiinte a Rep. Moldova Mat. 1 (80) (2016)
118-124.
http://www.mathnet.ru/php/getFT.phtml?jrnid=basm&paperid=411&what=fullt&opti
on_lang=eng
Draxler, F.
[see: Balla, I.]
Dress, A., Huber, K. T., Koolen, J. Moulton, V. and Spillner, A.
Characterizing block graphs in terms of their vertex-induced partitions. Australas. J.
Comb. 66 (2016) 1-9.
https://ajc.maths.uq.edu.au/pdf/66/ajc_v66_p001.pdf
Dross, F. [see: Dąbrowski, K. K.]
Duan, A., Severini, S. and Winter, A.
On zero-error communication via quantum channels in the presence of noiseless
feedback. IEEE Trans. Inf. Theory 62 (2016) 5260-5277
https://doi.org/10.1109/TIT.2016.2562580
http://arxiv.org/pdf/1502.02987
Duan, R.
[see: Acín, A.]
Duffy, K. R., Dukes, W. M. B., Glaser, S., Miles, D., Nailk, S. and Weber, T. S.
Site-specific recombinatorics: in situ cellular barcoding with the Cre Lox system.
BMC Systems Biology 10:43.
http://dx.doi.org/10.1186/s12918-016-0290-3
http://arxiv.org/pdf/1602.02190
Dugan, W., Glennon, S., Gunnells, P. E. and Steingrímsson, E.
Tiered trees, weights, and q-Eulerian numbers. Preprint.
http://arxiv.org/pdf/1702.02446
Dukes, W. M. B. and Selig, T.
Decomposing recurrent states of th Abelian Sandpile Model. Electron. Notes.
Discrete Math. 54 (2016) 97-102.
http://dx.doi.org/10.1016/j.endm.2016.09.018
Dukes, W. M. B.
[see: Duffy, K. R.]
Duminil-Copin, H.
[see: Bollobás, B.]
Dütting, P, Fischer, F. and Klimm, M.
Revenue Gaps For Discriminatory and Anonymous Sequential Posted Pricing.
Preprint.
http://arxiv.org/pdf/1607.07105
Dütting, P, Fischer, F. and Parkes, D. C.
Truthful Outcomes From Non-Truthful Position Auctions. In Proceedings of the 17th
ACM Conference on Economics and Computation, 813. ACM Press.
http://arxiv.org/pdf/1602.07593
Dvořák, Z., Král’,. D. and Mohar, B.
Graphic TSP in Cubic Graphs. STACS 2017: 27:1-27:13
http://dx.doi.org/10.4230/LIPIcs.STACS.2017.27
https://arxiv.org/pdf/1608.07568
Dvořák, Z., Král’,. D. and Thomas, R. Three-coloring triangle-free graphs on surfaces VII. A linear-time algorithm Preprint.
http://arxiv.org/pdf/1601.01197
Dvořák, Z., Král’,. D. and Thomas, R. Three-coloring triangle-free graphs on surfaces VI. 3-colorability of quadrangulations.
http://arxiv.org/pdf/1509.01013
Dvořák, Z., Král’,. D. and Thomas, R. Three-coloring triangle-free graphs on surfaces IV. Bounding face sizes of 4-critical
graphs.
http://arxiv.org/pdf/1404.6356
Dvořák, Z., Král’,. D. and Thomas, R. Three-coloring triangle-free graphs on surfaces I. Extending a coloring to a disc with
one triangle. J. Comb. Theory Ser. B. 120 (2016) 1-17.
http://dx.doi.org/10.1016/j.jctb.2016.04.003
http://arxiv.org/pdf/1010.2472
Dyer, M. E., Goldberg, L. A. and Richerby, D.
Counting 4×4 matrix partitions of graphs. Discrete Appl. Math. 213 (2016) 76-92.
http://dx.doi.org/10.1016/j.dam.2016.05.001
http://arxiv.org/pdf/1407.7799
East J., Gadouleau, M. and Mitchell, J. D.
On transformation semigroups based on digraphs. Preprint.
http://arxiv.org/pdf/1704.00937
East J. and Gray, R. D.
Diagram monoids and Graham–Houghton graphs: Idempotents and generating sets of
ideals. J. Comb. Theory Ser. A. 140 (2017) 63-128.
http://doi.org/10.1016/j.jcta.2016.09.001
http://arxiv.org/pdf/1404.2359
East J. [see: Dolinka I.,]
Eberhard, S.
The abelian arithmetic regularity lemma. Preprint.
http://arxiv.org/pdf/1606.09303
Eberhard, S.
More on additive triples of bijections. Preprint.
http://arxiv.org/pdf/1704.02407.pdf
Eberhard, S., Ford, K. and Green, B. J.
Invariable generation of the symmetric group. Duke Math. J. , to appear.
http://arxiv.org/pdf/1508.01870
Eberhard, S., Ford, K. and Koukopoulos, D.
Permutations contained in transitive subgroups. Discrete Anal. 2016:12, 36.
https://arxiv.org/pdf/1605.01068
Eberhard, S.
[see: Balogh, J.]
Eccles, T.
A Stability Result for the Union-Closed Size Problem. Combin. Probab. Comput. 25
(2016) 399-418.
https://doi.org/10.1017/S0963548315000176
Edwards, K., Girão, A., van den Heuvel, J., Kang, R. J., Puleo, G. J. and
Sereni, J.-S.
Extension from precoloured sets of edges. Preprint9.
http://arxiv.org/pdf/1407.4339.pdf
Edwards, K..
[see: Chudnovsky, M.]
Eftekhari, Y. Jackson, B., Nixon, A., Schulze, B., Tanigawa, S-I. and Whiteley,
W.
Point-hyperplane frameworks, slider joints, and rigidity preserving transformations.
Preprint.
http://arxiv.org/pdf/1703.06844
Ehrenmüller, J.
[see: Allen, P.]
Eirinakis, P.
[see: Cechlárová, K.]
El Amiri, M.
[see; Buset, D.]
Elder, M.
[see: Brough, T., Ciobanu, L. ]
Ellis, D., Friedgut, E., Kindler, G. and Yehudayoff, A.
Geometric stability via information theory. Discrete Anal. 2016:10
http://arxiv.org/pdf/1510.00258
Ellis, D., Kalai, G. and Narayanan, B. P.
On symmetric intersecting families. Preprint.
http://arxiv.org/pdf/1702.02607
Ellis,. D., Keller, N. and Lifshitz, N.
Stability versions of Erdős-Ko-Rado type theorems, via isoperimetry. Preprint.
http://arxiv.org/pdf/1604.02160
9 Substantial revision of an earlier preprint.
Ellis,. D., Keller, N. and Lifshitz, N.
On the structure of subsets of the discrete cube with small edge boundary. Preprint.
http://arxiv.org/pdf/1612.06680
Ellis,. D., Keller, N. and Lifshitz, N.
On a Biased Edge Isoperimetric Inequality for the Discrete Cube. Preprint.
http://arxiv.org/pdf/1702.01675
Ellis, D. and Leader, I. B.
An isoperimetric inequality for antipodal subsets of the discrete cube, Preprint.
http://www.maths.qmul.ac.uk/~dellis/antipodal_iso_2.pdf
Ellis,. D. and Lifshitz, N.
On the union of intersecting families. Preprint.
http://arxiv.org/pdf/1610.03027
Ellis, D. and Narayanan, B. P.
On symmetric 3-wise intersecting families. Proc. Am. Math. Soc, to appear.
http://arxiv.org/pdf/1608.03314
Ellis, D.
[see: Arzmon, N. Benjamini, I.]
Ellis-Monaghan, J. A., Goodall, A. J., Makowsky, J. A. and Moffatt, I.
Graph Polynomials: Towards a Comparative Theory. Dagstuhl Reports 6 (2016)
26-48.
http://dx.doi.org/10.4230/DagRep.6.6.26
Elsässer, R.
[see: Berenbrink, P.]
Ene, A., Miller, G., Pachocki, J. and Sidford, A.
Routing under Balance. STOC16 598-611.
https://doi.org/10.1145/2897518.2897654
http://arxiv.org/pdf/1603.09009
Ene, A., Mnich, M., Pilipczuk, M. and Risteski, A.
On Routing Disjoint Paths in Bounded Treewidth Graphs. SWAT2016.
http://dx.doi.org/10.4230/LIPIcs.SWAT.2016.15
http://arxiv.org/pdf/1512.01829
Ene, A., Nguyen, H. L and Vegh, L.
Decomposable Submodular Function Minimization: Discrete and Continuous.
Preprint.
http://arxiv.org/pdf/1703.01830
Englert, M., Gupta, A., Krauthgamer, R., Rácke, H., Talgam-Cohen, I. and
Talwar, K.
Reachability in Two-Dimensional Unary Vector Addition Systems with States is
NL-Complete. LICDS2016, 477-484.
https://doi.org/10.1145/2933575.2933577
http://arxiv.org/pdf/1602.00477
Enright, J. and Faben, J.
Building a Better Mouse Maze. FUN2016.
http://dspace.stir.ac.uk/bitstream/1893/23541/1/EnrightFabenLIPIcsJune2016.pdf
Enright, J. and Kao, R.
A fast algorithm for calculating an expected outbreak size on dynamic contagion
networks, Epidemics 16 (2017) 56-62
http://dspace.stir.ac.uk/bitstream/1893/23544/1/Enright_and_Kao_Epidemics_2016.p
df
Enright, J. and Meeks, K.
Deleting edges to restrict the Size of an epidemic: a new application for treewidth.
Algorithmica, to appear.
http://arxiv.org/pdf/1504.05773.pdf
Enright, J. and Stewart, L.
Games on interval and permutation graph representations. Theor. Comput. Sci. 609
(2016) 87-103.
https://doi.org/10.1016/j.tcs.2015.09.009
Enyang, J.
[see: Bowman, C. D.]
Epifanio, C.
[see: Crochemore, M.]
Erde, J. and Walters, M. J.
An n-in-a-row type game. Electron J. Comb. 23 (2016) P3.7
http://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i3p7/pdf
Erde, J. [see: Bowler, N.]
Erickson, A., Kiasari, A., Navaridas, J. and Stewart, I. A.
The stellar transformation: from interconnection networks to datacenter networks.
Computer Networks 113 (2017) 29–45
http://dx.doi.org/10.1016/j.comnet.2016.12.001
http://arxiv.org/pdf/1510.02181
Erickson, A., Kiasari, A., Navaridas, J. and Stewart, I. A.
An Optimal Single-Path Routing Algorithm in the Datacenter Network DPillar. IEEE
Trans. Parallel Disttrib. Syst. 28 (2017) 689-703.
http://dx.doi.org/10.1109/TPDS.2016.2591011
http://arxiv.org/pdf/1509.01746
Erickson, A., Navaridas, J. and Stewart, I. A.
Relating the bisection width of dual-port, server-centric datacenter networks and the
solution of edge-isoperimetric problems in graphs. Preprint.
https://community.dur.ac.uk/i.a.stewart/Papers/bisectionwidth.pdf
Erickson, A., Navaridas, J., Pascual, J. A. and Stewart, I. A.
Improved routing algorithms in the dual-port datacenter networks HCN and BCN.
Preprint.
https://community.dur.ac.uk/i.a.stewart/Papers/BCNDataCentreNetworks.pdf
Erickson, A., Navaridas, J., Pascual, J. A. and Stewart, I. A.
Routing algorithms for recursively-defined datacenter networks. Preprint.
https://community.dur.ac.uk/i.a.stewart/Papers/SearchRouting.pdf
Erickson, A. and Stewart, I. A.
The influence of data center usage on symmetry in data center network design.
Preprint.
https://community.dur.ac.uk/i.a.stewart/Papers/Symmetry.pdf
Erlebach, T.
Algorithms for Queryable Uncertainty. FAW 2016. Lect. Notes. Comput. Sci. 9711
(2016)
http://dx.doi.org/10.1007/978-3-319-39817-4_1
Erskine, G., Hriňáková, K. and Širáň, J.
Orientably-regular maps on twisted linear fractional groups. Preprint.
http://arxiv.org/pdf/1701.05781
Erskine, G.
[see: Anabanti, C. S., Bevan, D., Buset, D.]
Estrada, E. and Hatamo. N.
Communicability Angle and the Spatial Efficiency of Networks. SIAM Review 58
(2016) 692-715.
http://dx.doi.org/10.1137/141000555
http://arxiv.org/pdf/1412.7388
Estrada, E., Meloni, S., Moreno, Y. and Sheerin, M.
Epidemic spreading in Random Rectangular Networks. Phys Rev. E. 94 (2016)
052316
http://doi.org/10.1103/PhysRevE.94.052316
http://arxiv.org/pdf/1507.06002
Estrada, E. and Ross, G.
Centralities in Simplicial Complexes. Preprint.
http://arxiv.org/pdf/1703.03641
Estrada, E. and Sheerin, M.
Consensus Dynamics on Random Rectangular Graphs. Physica D 323-324 20-26.
http://dx.doi.org/10.1016/j.physd.2015.10.021
http://www.estradalab.org/wp-content/uploads/2015/10/Paper_Physica-D1.pdf
Estrada, E. and Silver, G.
Accounting for the Role of Long Walks on Networks via a New Matrix Function
http://arxiv.org/pdf/1607.06807
Estrada, E.
[see: Benzi, M.]
Etzion, T.
[see: Blackburn, S.R.]
Evans, D. M.
Finite homogeneous geometries. Preprint.10
http://arxiv.org/pdf/1701.05129
Evans, D. M.
[see: Bodirsky, M.]
Faben, J.
[see: Enright, J.]
Fadli, F.
[see: Barki, H., Boguslawski, P] Falgas-Ravry, V. and Lo, A.
High codegree subgraphs in weakly quasirandom 3-graphs. Preprint.
http://arxiv.org/pdf/1610.06378.pdf
Fallat, S., Johnson, C. R. and Sokal, A. D.
Total positivity of sums, Hadamard products and Hadamard powers: Results and
counterexamples. Linear Algebra Appl. 520 (2017) 242-259.
http://doi.org/10.1016/j.laa.2017.01.013
https://arxiv.org/pdf/1612.02210
Faria, L
[see: Alves, S. R.]
Farley, N..
[see: Crampton, J.]
Fasoulakis, M. [see: Czumaj, A.]
10
This is actually an extract from the author’s D.Phil thesis (1985) but has not appeared before.
Fanchon, A., Gadouleau, M. and Richard, A.
Reduction and Fixed Points of Boolean Networks and Linear Network Coding
Solvability. IEEE Trans. Inf. Theory 62 (2016) 2504-2519.
http://dx.doi.org/10.1109/TIT.2016.2544344
http://arxiv.org/pdf/1412.5310
Fauser, B., Jarvis, P. D. and King, R. C.
Plethystic Vertex Operators and Boson-Fermion Correspondences. J. Phys. A: Math.
Theor. 49 (2016) 425201 (24pp)
http://dx.doi.org/10.1088/1751-8113/49/42/425201
https://arxiv.org/pdf/1606.01695
Fayers, M.
The irreducible representations of the alternating group which remain irreducible in
characteristic p. Trans. Am. Math. Soc. 368 (2016) 5807-5855
http://doi.org/10.1090/tran/6531
http://www.maths.qmul.ac.uk/~mf/papers/altredproof.pdf
Fayers, M.
(s,t)-cores: a weighted version of Armstrong's conjecture. Electron J. Comb. 23
(2016) #P4.32
http://www.emis.de/journals/EJC/ojs/index.php/eljc/article/download/v23i4p32/pdf
Fayers, M.
Dyck tilings and the homogeneous Garnir relations for graded Specht modules. J.
Algebr. Comb. (2016) 1-42.
http://dx.doi.org/10.1007/s10801-016-0734-2
http://www.maths.qmul.ac.uk/~mf/papers/dyckgarnir.pdf
Fayers, M. and Speyer, L.
Generalised column removal for graded homomorphisms between Specht modules. J.
Algebr. Comb.44 (2016) 393–432.
http://dx.doi.org/10.1007/s10801-016-0674-x
http://arxiv.org/pdf/1404.4415
Fearnley, J. [see: Czumaj, A., Deligkas, A.]
Federici, B. and Georgakopoulos, A.
Hyperbolicity vs. Amenability for planar graphs. Disc. Comput. Geom. (2017) 1-13.
http://dx.doi.org/10.1007/s00454-017-9859-x
http://arxiv.org/pdf/1509.02028
Feghali, C. and Johnson, M.
Enclosings of Decompositions of Complete Multigraphs in 2-Factorizations. Preprint.
http://arxiv.org/pdf/1608.06961
Feghali, C., Johnson, M. and Paulusma, D.
A reconfigurations analogue of Brooks' theorem and its consequences. J. Graph
Theory 83 (2016) 340-358.
http://dx.doi.org/10.1016/j.endm.2015.06.034
http://arxiv.org/pdf/1501.05800
Feghali, C., Johnson, M. and Paulusma, D.
Kempe equivalence of colourings of cubic graphs. Eur. J. Comb. 59 (2017) 1-10.
http://dx.doi.org/10.1016/j.ejc.2016.06.008
http://arxiv.org/pdf/1503.03430
Felsner, S., Kanuer, K. Mertzios, G. B. and Ueckerdt T.
Intersection graphs of L-shapes and segments in the plane. Discrete Appl. Math. 206
(2016) 48-55.
http://dx.doi.org/10.1016/j.dam.2016.01.028
http://community.dur.ac.uk/george.mertzios/papers/Jour/Jour_Intersection-Graphs-L-
shapes.pdf
Fenu, C. and Higham, D. J.
Block Matrix Formulations for Evolving Networks. SIAM Journal on Matrix Analysis
and Applications, to appear.
http://arxiv.org/pdf/1511.07305
Fenner, P., Johnson, M. E. and Kambites, M.
NP-completeness in the gossip monoid. Preprint.
http://arxiv.org/pdf/1606.01026
Fennessey, E. J. and Larcombe, P. J.
On a Scaled Balanced-Power Product Recurrence. Fibonacci Quarterly 54 (2016)
242-246.
http://www.fq.math.ca/Papers/54-3/LarcombeFennessey02282016.pdf
Fennessey, E. J. and Larcombe, P. J.
A Scaled Power Product Recurrence Examined Using Matrix Methods, Bull. Inst.
Comb. Appl. 78 (2016) 41-51
Fennessey, E. J. and Larcombe, P. J.
On Sequence-Based Closed Form Entries for an Exponentiated General 2 × 2
Matrix: A Re-Formulation and an Application, Bull. Inst. Comb. Appl. 79 (2017)
82-94.
Fennessey, E. J. and Larcombe, P. J.
Closed Form Formulation for the General Term of a Scaled Triple Power Product
Recurrence Sequence, Fibonacci Quarterly, to appear.
Ferber, A., Kronenberg, G. and Long, E. P.
Packing, counting and covering Hamilton cycles in random directed graphs, Isr. J.
Math., to appear.
http://arxiv.org/pdf/1506.00618
Ferber, A. and Long, E. P.
Packing and counting arbitrary Hamilton cycles in random digraphs. Random Struct.
Algorithms, to appear.
http://arxiv.org/pdf/1603.03614
Ferber, A., Long, E. P. and Sudakov, B.
Counting Hamilton decompositions of oriented graphs. Int. Math. Res. Not., to appear.
http://arxiv.org/pdf/1609.09550
Ferber, A.
[see: Conlon, D.]
Fernandes, M. E.
[see: Cameron, P. J.]
Filipiak, K.
[see: Bailey, R. A.]
Fill, J. A.
[see: Bollobás, B.]
Fink, A. Rajchgot, J. and Sullivant, S.
Matrix Schubert varieties and Gaussian conditional independence models. J. Algebr.
Comb. 44 (2016) 1009–1046.
http://doi.org/10.1007/s10801-016-0698-2
http://arxiv.org/pdf/1510.04124
Fink, A.,.Speyer, D. E. and Woo, A.
A Gröbner basis for the graph of the reciprocal plane. Preprint.
http://arxiv.org/pdf/1703.05967
Fink, A.
[see: Cameron, A.]
Fischer, F., Hudry, O. and Niedermeier, R.
Weighted Tournament Solutions. In Handbook of Computational Social Choice, 85–
102. Cambridge University Press.
https://doi.org/10.1017/CBO9781107446984.005
https://www.safaribooksonline.com/library/view/handbook-of-
computational/9781316489093/Text/chapter4.html
Fischer, F.
[see: Bjelde, A., Dütting, P, ]
Fischer, M., Kelk, S., Moulton, V. and Wu, T.
Reduction rules for the maximum parsimony distance on phylogenetic trees. Theor.
Comput. Sci. 646 (2016) 1-15.
http://doi.org/10.1016/j.tcs.2016.07.010
http://arxiv.org/pdf/1512.07459
Fitch, M.
Rational exponents for hypergraph Turan problems. Preprint.
http://arxiv.org/pdf/1607.05788
Fleiner, T.
[see: Biró, P., Cechlárová, K.]
Florescu, L. and Perkins, W.
Spectral Thresholds in the Bipartite Stochastic Block Model. COLT2016.
http://www.jmlr.org/proceedings/papers/v49/florescu16.html
Fluschnik, T., Komusiewicz, C. Mertzios, G. B.,. Nichterlein, A., Niedermeier, R.
and Talmon, N.
When can Graph Hyperbolicity be computed in Linear Time? Preprint.
http://arxiv.org/pdf/1702.06503
Fluschnik, T.
[see: van Bevern, R.]
Fomin, F.
[see: Curticapean, R.]
Foniok, J. and Tardif, C.
Hedetniemi's conjecture and adjoint functors in thin categories. Preprint.
http://arxiv.org/pdf/1608.02918
Foniok, J.
[see: Atminas, A., Collins, A.]
Fontaine, A.
[see: Clifford, R.]
Forbes, A. D.
Designs for 24-vertex snarks. Util. Math., to appear.
http://arxiv.org/pdf/1607.04847
Forbes, A. D. and Forbes, T. J.
Hanoi revisited. Math. Gaz. 100 (2016) 435-441
http://doi.org/10.1017/mag.2016.108
Forbes, A. D., Forbes, T. J. and Griggs, T. S.
Archimedean graph designs – II. Discrete Math., to appear.
Forbes, A. D., Forbes, T. J. and Griggs, T. S.
Theta graph designs. Preprint.
http://arxiv.org/pdf/1703.01483.pdf
Forbes, A. D. and Griggs, T. S.
Designs for graphs of six vertices and nine edges. Preprint.
Forbes, T. J.
[see: Forbes, A. D.]
Ford, K., Green, B. J., Konyagin, S., Maynard, J. and Tao, T. C.
Large gaps between consecutive primes. Ann. Math.. 183 (2016) 935-974
http://www.math.uiuc.edu/~ford/wwwpapers/primegaps.pdf
Ford, K., Green, B. J., Konyagin, S., and Tao, T. C.
Long gaps between primes. J. Amer. Math. Soc., to appear.
http://www.math.uiuc.edu/~ford/wwwpapers/primegaps2.pdf
Ford. K. Maynard, J. and Tao, T. C.
Chains of large gaps between primes. To appear in book "Irregularities in the
distribution of prime numbers", dedicated to Helmut Maier, 16 pages.
http://www.math.uiuc.edu/~ford/wwwpapers/primegaps_chains.pdf
Ford, K.
[see: Eberhard, S.]
Forrester, M.
[see; Crofts, J. J.]
Foucaud, F., Mertzios, G. B., Naserasr, R., Parreau, A. and Valicov, P.
Identification, location–domination and metric dimension on interval and permutation
graphs. I. Bounds. Theor. Comput. Sci. 668 (2017) 43-58.
http://community.dur.ac.uk/george.mertzios/papers/Jour/Jour_Metric-Dimension-
Interval-Perm-Bounds.pdf
Foucaud, F., Mertzios, G. B., Naserasr, R., Parreau, A. and Valicov, P.
Identification, location-domination and metric dimension on interval and permutation
graphs. II. Algorithms and complexity. Algorithmica 2016.
http://dx.doi.org/10.1007/s00453-016-0184-1
http://community.dur.ac.uk/george.mertzios/papers/Jour/Jour_Metric-Dimension-
Interval-Perm-Algorithms.pdf
Foucaud, F., Perarnua, G. and Serra, O.
Random subgraphs make identification affordable. J. Comb. to appear.
http://arxiv.org/pdf/1306.0819.pdf
Fountoulakis, N., Joos, F. and Perarnau, G.
Percolation on random graphs with a fixed degree sequence. Preprint.
http://arxiv.org/pdf/1611.08496
Fountoulakis, N., Kang, M., Koch, C. and Makai, T. A phase transition on the evolution of bootstrap processes in inhomogeneous random
graphs. Preprint.
http://arxiv.org/pdf/1609.08892
Fountoulakis, N. and Müller, T.
Law of large numbers for the largest component in a hyperbolic model of complex
networks. Preprint.
http://arxiv.org/pdf/1604.02118
Fountoulakis, N., Khosla, M. and Panagiotou, K.
The Multiple-Orientability Thresholds for Random Hypergraphs. Combin. Probab.
Comput. 25 (2016) 870-908.
http://doi.org/10.1017/S0963548315000334
http://arxiv.org/pdf/1309.6772
Fountoulakis, N.
[see: Abdullah, M., Bode, M., Candellero, E.]
Fowler, P., Guest, S. and Schulze, B.
Mobility of a class of perforated polyhedra, International Journal of Solids and
Structures 85-86 (2016) 105-113.
http://dx.doi.org/10.1016/j.ijsolstr.2016.02.006
Fox, J., Grinshpun, A., Liebenau, A., Person, Y and Szabó, T.
On the minimum degree of minimal Ramsey graphs for multiple colours. J. Comb.
Theory Ser B. 120 (2016) 64–82
http://dx.doi.org/10.1016/j.jctb.2016.03.006
http://math.mit.edu/~fox/paper-Ramseymultiplecolors.pdf
Fox, J., Lovász, L. M. and Zhao, Y.
On regularity lemmas and their algorithmic applications. Combin. Probab. Comput.,
to appear.
http://arxiv.org/pdf/1604.00733
Fox, J.
[see: Conlon, D.]
Franchi, C., Ivanov, A. A. and Mainardis, M.
Standard Majorana representations of the symmetric groups. J. Algebr. Comb.. 44
(2016)
http://dx.doi.org/10.1007/s10801-016-0668-8
Franchi, C., Ivanov, A. A. and Mainardis, M.
Permutation modules for the symmetric group. Proc. Am. Math. Soc, to appear.
https://doi.org/10.1090/proc/13474
http://www.ams.org/journals/proc/0000-000-00/S0002-9939-2017-13474-1/S0002-
9939-2017-13474-1.pdf
Francis, A., Huber, K. T. and Moulton, V.
Tree-based unrooted phylogenetic networks. Preprint.
http://arxiv.org/pdf/1704.02062
Francis, A., Huber, K. T. , Moulton, V. and Wu, T.
Bounds for phylogenetic network space metrics. Preprint.
http://arxiv.org/pdf/1702.05609
Frank, M.
[see: Codish, M.]
Freitas, A. C., Freitas, J. M., Todd, M. and Vaienti, S.
Rare events for the Manneville-Pomeau map. Stochastic Processes Appl 126 (2016)
3463-3479.
http://arxiv.org/pdf/1503.01372
Freitas, J. M.
[see: Freitas, A. C.]
Frenkel, P. E.
[see: Csikvári, P. ]
Friedetzky, T.
[see: Berenbrink, P.]
Friedgut, E.
[see: Ellis, D.]
Frieze, A. M., Pegden, W. and Sorkin, G. B .
Minors of a random binary matroid. Preprint.
http://www.math.cmu.edu/~af1p/Texfiles/Minors.pdf
Frieze, A. M., Pegden, W. and Sorkin, G. B .
On the distribution of the minimum weight clique. Preprint.
http://arxiv.org/pdf/1606.04925.pdf
Frieze, A. M.
[see: Bal, D., Cooper, C.]
Froese, A., Nichterlein, A. and Niedermeier, R.
Win-Win Kernelization for Degree Sequence Completion Problems. J. Comput. Syst.
Sci. 82 (2016) 1100–1111
http://dx.doi.org/10.1016/j.jcss.2016.03.009
http://arxiv.org/pdf/1404.5432
Fulek, R., Kynčl, J. and Pálvölgyi, D.
Unified Hanani-Tutte theorem. Preprint. http://arxiv.org/pdf/1612.00688.pdf
Fulla, P. and Živný, S.
On Planar Valued CSPs. J. Comput. Syst. Sci., to appear.
http://arxiv.org/pdf/1602.06323
Fulla, P. and Živný, S.
A Galois connection for weighted (relational) clones of infinite size. ACM
Transactions on Computation Theory 8 (2016), Article No. 9.
http://zivny.cz/publications/fz16toct-preprint.pdf
Fulla, P. and Živný, S.
The complexity of Boolean surjective general-valued CSPs. Preprint.
http://arxiv.org/pdf/1702.04679 Funk, D., Mayhew, D. and Noble, S. D.
How many delta-matroids are there? Preprint.
http://arxiv.org/pdf/1609.08244
Füredi, Z.
[see: Balister, P. N.]
Fusy, E.
[see: Bettinelli, J.]
Gadouleau, M. and Richard, A.
Simple dynamics on graphs. Theor. Comput. Sci.. 628 ( 2016) 62–77
http://dx.doi.org/10.1016/j.tcs.2016.03.013
http://arxiv.org/pdf/1503.04688
Gadouleau, M.
[see: Cameron, P. J., Castillo-Ramirez, A., East, J.]
Gagarin, A.
[see: Cohen, D. A., Crampton, J., Devi, P.]
Gagie, T.
[see: Badkobeh, G.]
Galanis, A., Göbel, A., Goldberg, L. A., Lapinskas, J. and Richerby, D.
Amplifiers for the Moran Process. J. ACM. 64 (2017) no 5.
http://doi.org/10.1145/3019609
http://arxiv.org/pdf/1512.05632
Galanis, A. and Goldberg, L. A.
The complexity of approximately counting in 2-spin systems on k-uniform bounded-
degree hypergraphs. Inf. Comput. 251 (2016) 36-66
http://dx.doi.org/10.1016/j.ic.2016.07.003
http://arxiv.org/pdf/1505.06146
Galanis, A., Goldberg, L. A. and Jerrum, M. R.
A complexity trichotomy for approximately counting list H-colourings. ICALP2016.
http://dx.doi.org/10.4230/LIPIcs.ICALP.2016.46
http://arxiv.org/pdf/1602.03985
Galanis, A., Goldberg, L. A. and Jerrum, M. R.
Approximately Counting H-Colorings is #BIS-Hard. SIAM. J,. Comput. 45 (2016)
680-711.
http://dx.doi.org/10.1137/15M1020551
Galanis, A., Goldberg, L .A. and Štefankovič, D
Inapproximability of the independent set polynomial below the Shearer threshold.
Preprint.
http://arxiv.org/pdf/1612.05832
Galanis, A., Goldberg, L. A. and Yang, K.
Approximating partition functions of bounded-degree Boolean counting Constraint
Satisfaction Problems. Preprint.
http://arxiv.org/pdf/1610.04055
Galanis, A., Štefankovič, D. and Vigoda, E.
Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-
Core Models. Combin. Probab. Comput. 25 (2016) 500-559.
http://dx.doi.org/10.1017/S0963548315000401
Galanis, A., Štefankovič, D., Vigoda, E. and Yang, L.
Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results. SIAM J.
Comput. 45 (2016) 2004-2065
http://dx.doi.org/10.1137/140997580
Galanis, A.
[see: Bezakova, I., Cai, J.-Y.]
Gambette, P., Huber, K. T. and Kelk, S.
Reconstructing level 1 phylogenetic networks from triplets and clusters. J. Math. Biol,
to appear.
Ganesh, A. J.
[see: Davidson, A.]
Ganguly, S.
[see: Bhattacharya, B. B., Candellero, E.]
Gao, A., Kitaev, S. and Zhang, P.
Avoiding vincular patterns on alternating words, Discrete Math. 339 (2016)
2079-2093 https://doi.org/10.1016/j.disc.2016.02.013
http://arxiv.org/pdf/1507.06154
Gao, A., Kitaev, S. and Zhang, P.
Pattern-avoiding alternating words, Discrete Appl. Math. 207 (2016) 56-66.
http://doi.org/10.1016/j.dam.2016.03.007
http://arxiv.org/pdf/1505.04078
Gao, A., Kitaev, S. and Zhang, P.
On Pattern-avoiding indecompasable permutations. Preprint.
http://arxiv.org/pdf/1605.05490
Garbe, F., McDowell, A. and Mycroft, R.
Contagious sets in a degree-proportional bootstrap percolation process. Prepriut.
https://arxiv.org/pdf/1610.06144v1.pdf
Garbe, F. and Mycroft, R.
Hamilton cycles in hypergraphs below the Dirac threshold. Preprint
https://arxiv.org/pdf/1609.03101v1.pdf
Garoufalidis, S., Moffatt, I. and Thurston, D.
Non-peripheral ideal decompositions of alternating knots. Preprint
http://arxiv.org/pdf/1610.09901
Gąsieniec, L.
[see: Akrida, E. C., Czyzowicz, J.,. Anta, A. F.]
Genitrini, A. and Mailler, C.
Generalised and Quotient Models for Random And/Or Trees and Application to
Satisfiability. Algorithmica 76 (2016) 1106-1138.
https://doi.org/10.1007/s00453-016-0113-3
http://arxiv.org/pdf/1507.08448
Genitrini, A., Gittenberger, B., Kraus, V. and Mailler, C.
The relation between tree size complexity and probability for Boolean functions
generated by uniform random trees. Appl. Anal. Discrete Math. 10 (2016) 408-446
http://arxiv.org/pdf/1407.0501
Georgakopoulos, A. and Hamann, M.
The planar Cayley graphs are effectively enumerable. Preprint.
http://arxiv.org/pdf/1506.03361
Georgakopoulos, A. and Haslegrave, J. Percolation on an infinitely generated group. Preprint.
http://arxiv.org/pdf/1703.09011
Georgakopoulos, A. and Kolountzakis, M.
On particles in equilibrium on the real line. Preprint.
http://arxiv.org/pdf/1609.05194
Georgakopoulos, A. and Tyros, K.
The Bradley-Terry condition is 𝐿1 testable. Preprint.
http://arxiv.org/pdf/1609.05194
Georgakopoulos, A. and Wagner, S.
Subcritical graph classes containing all planar graphs. Preprint.
http://arxiv.org/pdf/1701.00973
Georgakopoulos, A. and Wagner, S.
Limits of subcritical random graphs and random graphs with excluded minors.
Preprint.
http://arxiv.org/pdf/1512.03572
Georgakopoulos, A. and Wagner, S.
Hitting Times, Cover Cost, and the Wiener Index of a Tree. J. Graph Theory 84
(2017) 311-326.
http://dx.doi.org/10.1002/jgt.22029
http://arxiv.org/pdf/1302.3212
Georgiou, N., Menshikov, M., Mijaatović, A. and Wade, A. R.
Anomalous recurrence properties of many-dimensional zero-drift random walks. Adv.
Appl. Probab. 48 (2016) 99–118
http://dx.doi.org/10.1017/apr.2016.44
http://arxiv.org/pdf/1506.08541
Georgiou, O.
[see: Dettmann, C. P.]
Gerbner, D., Keszegh, B., Pálvölgyi, D., Patkós, B., Vizer, M. and Wiener, G.
Finding a non-minority ball with majority answers. Discrete Appl. Math. 219 (2017)
18-31.
http://dx.doi.org/10.1016/j.dam.2016.11.012
Gerbner, D., Keszegh, B., Palmer, C. T. and Pálvölgyi, D.
Topological orderings of weighted directed acyclic graphs. Inf. Process Lett. 116
(2016) 564-568.
https://doi.org/10.1016/j.ipl.2016.04.007
http://arxiv.org/pdf/1310.0516
Gerke, S.
[see: Balister, P. N.]
Giakkoupos, G.
[see: Berenbrink, P.]
Giandomenico, M.,. Letchford, A. N., Rossi, F. and Smriglio, S.
Ellipsoidal Relaxations of the Stable Set Problem: Theory and Algorithms SIAM J.
Optim. 25 (2016) 1944-1963.
http://dx.doi.org/10.1137/140966332
http://www.lancaster.ac.uk/staff/letchfoa/articles/ellipsoids.pdf
Gianelli, E., Lim, K. J., O’Donovan, W. and Wildon, M. R.
On signed Young permutation modules and signed p-Kostka numbers J. Group
Theory, to appear.
http://www.ma.rhul.ac.uk/~uvah099/Maths/sept16v4.pdf
Giannopoulou, A. C. and Mertzios, G. B.
New geometric representations and domination problems on tolerance and
multitolerance graphs. SIAM J. Discrete Math. 30 (2017) 1685-1725.
http://dx.doi.org/10.1137/15M1039468
http://community.dur.ac.uk/george.mertzios/papers/Jour/Jour_Dominating-
Multitolerance.pdf
Gill, N.
Quasirandom group actions. Forum Math. (Sigma), to appear.
Gill, N.
Transitive projective planes and insoluble groups. Trans. Am. Math. Soc. 368 (2016)
3017–3057.
http://doi.org/10.1090/tran/6366
http://www.ams.org/journals/tran/2016-368-05/S0002-9947-2016-06366-7/S0002-
9947-2016-06366-7.pdf
Gill, N. , Gillespie, N. I., Praeger, C. E. and Semeraro, J.
Conway’s groupoid and its relatives. Contemp. Math., to appear.
http://arxiv.org/pdf/1604.04429
Gill, N., Gillespie, N. I. and Semeraro, J.
Conway groupoids and completely transitive codes. Combinatorica (2017) 1-44.
http://dx.doi.org/10.1007/s00493-016-3433-7
http://arxiv.org/pdf/1410.4785
Gill, N. and Spiga, P.
Binary permutation groups: alternating and classical groups. Preprint.
http://arxiv.org/pdf/1610.01792
Gill, N.
[see: Barrantes, D., Britnell, J. R.]
Gillespie, N. I. and Hawtin, D. R.
Alphabet-Almost-Simple 2-Neighbour Transitive Codes. Preprint.
http://arxiv.org/pdf/1609.01886
Gillespie, N. I. and Praeger, C. E.
New Regularity Properties of the Nordstrom-Robinson Codes. Bull. Lond. Math. Soc.,
to appear.
http://arxiv.org/pdf/1205.3878
Gillespie, N. I.
[see: Gill, N.]
Girão, A. and Kang, R. J.
Precolouring extension of Vizing's theorem. Preprint.
http://arxiv.org/pdf/1611.09002
Girão, A., Kittipassorn. T. and Popielarz, K. Generalised Majority Colourings of Digraphs. Preprint.
http://arxiv.org/pdf/1701.03780
Girão, A., Mészáros, G. and Smith, S. G. Z.
Recent Results in Zero-Forcing of Graphs. Preprint.
http://arxiv.org/pdf/1611.07513
Girão, A. [see: Edwards, K.]
Giscard, P.-L, Kriege, N. and Wilson, R. C.
A general purpose algorithm for counting simple cycles and simple paths of any
length. Preprint.
http://arxiv.org/pdf/1612.05531
Giscard, P.-L, Rochet, P. and Wilson, R. C.
An Hopf algebra for counting simple cycles. Preprint.
http://arxiv.org/pdf/1607.00902
Gittenberger, B.
[see: Genitrini, A.]
Giudici, M.
[see: Burness, T. C..]
Glaser, S.
[see: Duffy, K. R.]
Glebov, R., Grzesik, A., Hu, P., Hubai, T., Král’, D. and Volec, J.
Densities of 3 vertex graphs. Preprint.
http://arxiv.org/pdf/1610.02446
Glebov, R., Hoppen, C., Klimošová, T., Kohayakawa, Y., Král’, D. and Liu, H.
Densities in large permutations and parameter testing. Eur. J. Comb. 60 (2017)
89-99.
http://doi.org/10.1016/j.ejc.2016.09.006
http://arxiv.org/pdf/1412.5622
Gleeson, J. P and Porter, M. A.
Message-Passing Methods for Complex Contagions. Preprint.
http://arxiv.org/pdf/1703.08046
Glen, M.
Colourability and word-representability of near-triangulations. Preprint.
http://arxiv.org/pdf/1605.01688
Glen, M.. Kitaev, S. and Pyatkin, A.
On the representation number of a crown graph. Preprint.
http://arxiv.org/pdf/1609.00674
Glennon, S.
[see: Dugan, W.]
Glock, S., Kühn, D., Lo, A. and Osthus, D.
The existence of designs via iterative absorption. Preprint.
http://web.mat.bham.ac.uk/S.Glock/designs.pdf
Gnaciński, P, Horodecki, K., Horodecki, M., Ramanathan, R., Rosicka, M. and
Severini, S.
Linear game non-contextuality and Bell inequalities - a graph-theoretic approach.
http://arxiv.org/pdf/1511.05415
Gnedin, A. and Gorin, V.
Spherically Symmetric Random Permutations. Preprint.
http://arxiv.org/pdf/1611.01860.pdf
Göbel, A., Goldberg, L. A. and Richerby, D.
Counting Homomorphisms to Square-Free Graphs, Modulo 2. ACM Trans. Comput.
Theory 8 (2016) 12:1-12:29
http://doi.acm.org/10.1145/2898441
http://arxiv.org/pdf/1501.07539
Göbel, A.
[see: Galanis, A.]
Godsil, C. D., Roberson, D. E. , Rooney, B., Šámal, R. and Varvitsiotis, A.
Graph Homomorphisms via Vector Colorings. Preprint.
http://arxiv.org/pdf/1610.10002
Godsil, C. D., Roberson, D. E., Šámal, R. and Severini, S.
Sabidussi versus Hedetniemi for three variations of the chromatic number.
Combinatorica 36 (2016) 395-415.
http://dx.doi.org/10.1007/s00493-014-3132-1
http://arxiv.org/pdf/1305.5545
Godsil, C. D.
[see: Banchi, L]
Goldberg, L. A. and Guo, H.
The complexity of approximating complex-valued Ising and Tutte partition functions.
Comput. Complexity, to appear.
http://arxiv.org/pdf/1409.5627
Goldberg, L. A., Gysel, R. and Lapinskas, J.
Approximately counting locally-optimal structures. J. Comput. Syst. Sci..82 (2016)
1144-1160.
http://doi.org/10.1016/j.jcss.2016.04.001
http://arxiv.org/pdf/1411.6829v1
Goldberg, L. A. and Jerrum, M. R.
The complexity of counting locally maximal satisfying assignments of Boolean CSPs
Theor. Comput. Sci, 634 (2016) 35-46.
http://dx.doi.org/10.1016/j.tcs.2016.04.008
http://arxiv.org/pdf/1509.03543
Goldberg, L. A., Lapinskas, J., Lengler, J. Meier, F. Panagiotou, K. and Pfister,
P.
Asymptotically Optimal Amplifiers for the Moran Process .Preprint.
http://arxiv.org/pdf/1611.04209
Goldberg, L. A.
[see: Bezakova, I.,. Bulatov, A., Cai, J-Y., Curticapean, R . Diaz, J., Dyer, M. E.,
Galanis, A., Göbel, A.]
Goldberg, P. W., Manlove, D. F. and Rastegari, B. Preference elicitation in matching markets via interviews: A study of offline
benchmarks (extended abstract). AAMAS 2016, abstract. 1393-1394.
https://arxiv.org/pdf/1602.04792
Goldberg, P. W., Manlove, D. F. and Rastegari, B. Preference elicitation in matching markets via interviews: A study of offline
benchmarks. EXPLORE 2016 proceedings.
Goldberg, P. W., Marmolejo-Cossio, F. J. and Wu, Z. S. Logarithmic Query Complexity for Approximate Nash Computation in Large Games
SAGT2016. Lect. Notes Comput. Sci. 9928 (2016)
http://dx.doi.org/10.1007/978-3-662-53354-3_1
http://arxiv.org/pdf/1610.08906
Goldberg, P. W.
[see: Collini-Baldeschi, R.]
Goldschmidt, C. and Przykucki, M. J.
Parking on a random tree. Preprint.
http://arxiv.org/pdf/1610.08786
Goldwasser, J. L.
[see: Axenovich, M.]
Gollin, J. P.
[see: Carmesin, J.]
Golovach, P. A., Heggernes, P.,. Kratsch, D., Lima, P. T. and Paulusma, D.
Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2.
Preprint.
http://arxiv.org/pdf/1703.05102
Golovach, P. A., Johnson, M., Martin, B., Paulusma, D. and Stewart, A.
Surjective H-Colouring: New Hardness Results. Preprint.
http://arxiv.org/pdf/1701.02188
Golovach, P. A., Johnson, M., Paulusma, D. and Song, J.
A survey on the computational complexity of colouring graphs with forbidden
subgraphs. J. Graph Theory 84 (2017) 331-363.
http://dx.doi.org/10.1002/jgt.22028
http://arxiv.org/pdf/1407.1482
Golovach, P. A., Kratsch, D., Paulusma, D. and Stewart, A.
A linear kernel for finding square roots of almost planar graphs. SWAT2016. Leibniz
International Proceedings in Informatics 53.
http://dx.doi.org/10.4230/LIPIcs.SWAT.2016.4
https://community.dur.ac.uk/a.g.stewart/preprints/square-swat.pdf
Golovach, P. A., Kratsch, D., Paulusma, D. and Stewart, A.
Squares of low clique number. Electron. Notes Discrete Math. 55 (2016) 195-198.
http://doi.org/10.1016/j.endm.2016.10.048
https://community.dur.ac.uk/a.g.stewart/preprints/square-endm.pdf
Golovach, P. A., Kratsch, D., Paulusma, D. and Stewart, A.
Finding Cactus Roots in Polynomial Time. IWOCA 2016 361-372.
http://dx.doi.org/10.1007/978-3-319-44543-4_28
Golovach, P. A. and Mertzios, G. B.
Graph Editing to a Given Degree Sequence. Theor. Comput. Sci. 665 (2017) 1-12.
http://doi.org/10.1016/j.tcs.2016.12.007
http://arxiv.org/pdf/1601.03174
Golovach, P. A., Paulusma, D. and van Leeuwen, J.
Induced disjoint paths in circular-arc graphs in linear time. Theor. Comput. Sci. 640
(2016) 70-83
http://doi.org/10.1016/j.tcs.2016.06.003
http://arxiv.org/pdf/1403.0789
Golovach, P. A., Paulusma, D. and Stewart, I. A.
Graph editing to a fixed target. Discrete Appl. Math. 216 (2017) 181-190.
http://dx.doi.org/10.1016/j.dam.2014.07.008
Golovach, P. A. [see: Cochefert , M., Dąbrowski, K. K.]
Goodall, A. J., Hermann, M., Kolek, T., Makowsky, M. and Noble, S. D.
On the complexity of generalized chromatic polynomials. Preprint.
http://arxiv.org/pdf/1701.06639
Goodall, A. J.
[see: Ellis-Monaghan, J. A.]
Gorin, V.
[see: Gnedin, A.]
Goto, K..
[see: Badkobeh, G.]
Gould, V., Hartmann, M. and Ruškuc, N.
Free monoids are coherent. Proc. Edinb. Math. Soc. 60 (2017) 127-131.
http://dx.doi.org/10.1017/S0013091516000079
http://www.math.u-szeged.hu/~hartm/PDFs/shortnote300713.pdf
Gowers, W. T.
Generalizations of Fourier analysis, and how to apply them. Preprint.
http://arxiv.org/pdf/1608.04127
Gowers, W. T. and Long, J.
The length of an s-increasing sequence of r-tuples. Preprint.
http://arxiv.org/pdf/1609.08688
Gowers, W. T. and Viola, E. The Communication Complexity of Interleaved Group Products . FOCS2016.
http://doi.org/10.1109/FOCS.2016.39
Gowers, W. T
[see: Conlon, D.]
Grabowski, J. and Gratz, S. Graded quantum cluster algebras of infinite rank as colimits. Preprint.
http://arxiv.org/pdf/1510.04109
Grabowski, Ŀ., Mathé, A. and Pikhurko, O.
Measurable circle squaring, Ann. Math. 185 (2017) 671-710
http://dx.doi.org/10.4007/annals.2017.185.2.6
http://annals.math.princeton.edu/2017/185-2/p06
Grabowski, L.
[see: Csóka, E.]
Grabowski, S.
[see: Badkobeh, G.]
Gracar, P. and Stauffer, A.
Multi-scale Lipschitz percolation of increasing events for Poisson random walks.
Preprint.
http://arxiv.org/pdf/1702.08748
Gracar, P. and Stauffer, A.
Random walks in random conductances: decoupling and spread of infection. Preprint.
http://arxiv.org/pdf/1701.08021
Grannell, M. J. and Knor, M.
Pasch trades on the projective triple system of order 31. J. Comb. Math. Comb.
Comput. 96 (2016) 23-32.
http://users.mct.open.ac.uk/mjg47/papers/proj31.pdf
Grannell, M. J. and Lovegrove, G. J.
Identical twin Steiner triple systems. Australas. J. Comb. 66 (2016) 130-141
http://ajc.maths.uq.edu.au/pdf/66/ajc_v66_p130.pdf
Gratz, S. [see: Grabowski, J.]
Gray, R. D.
[see: Craik, J., Dolinka, I., East, J.]
Greaves, G. and Soicher, L. H.
On the clique number of a strongly regular graph. Preprint.
http://arxiv.org/pdf/1604.08299
Green, B. J.
On the Chromatic Number of Random Cayley Graphs. Combin. Probab. Comput. 26
(2017) 248-266.
http://doi.org/10.1017/S0963548316000304
http://arxiv.org/pdf/1308.1872
Green, B. J.
Sarkozy's theorem in function fields. Preprint.
http://arxiv.org/pdf/1605.07263
Green, B. J. and Kane, D.
An example concerning set addition in 𝐹2𝑛. Preprint.
http://arxiv.org/pdf/1703.01036
Green, B. J. and Lindquist, S.
Monochromatic solutions to 𝑥 + 𝑦 = 𝑧2 . Preprint.
http://arxiv.org/pdf/1608.08374
Green, B. J. and Morris, R. D.
Counting sets with small sumset and applications. Combinatorica 36 (2016) 129-159.
http://dx.doi.org/10.1007/s00493-015-3129-4
http://arxiv.org/pdf/1305.3079
Green, B. J. and Sanders, T.
Monochromatic sums and products Discrete Anal. 2016:5 48pp.
http://dx.doi.org/10.19086/da.613
http://arxiv.org/pdf/1510.08733
Green, B. J.
[see: Eberhard, S., Ford, K.]
Green, E. L. and Schroll, S.
Multiserial and special multiserial algebras and their representations. Adv. Math. 302
(2016) 1111-1136.
http://dx.doi.org/10.1016/j.aim.2016.07.006
https://arxiv.org/pdf/1509.00215
Green, E. L. and Schroll, S.
Special multiserial algebras are quotients of symmetric special multiserial algebras.
J. Algebra 473 (2017) 397-405.
http://doi.org/10.1016/j.algebra.2016/10.033
http://arxiv.org/pdf/1601.00550
Greenhill, C. S.
[see: Cooper, C.]
Griffiths, S.
[see: Ahlberg, D., Allen, P,. Amini, O.]
Griggs T.S.
Combinatorics of the sonnet. J. Humanistic Math. 6 (2016) 36-46.
http://dx.doi.org/10.5642/jhummath.201602.05
http://scholarship.claremont.edu/cgi/viewcontent.cgi?article=1248&context=jhm
Griggs, T. S., Psomas, C. and Širáň, J.
Maximum genus embeddings of Latin squares. Glasg. Marh. J., to appear.
Griggs, T. S.
[see: Archdeacon, D. S.. Cavenagh, N. J.. Drápal, A., Forbes, A. D.]
Grimmett, G. R.
The work of Lucio Russo on percolation. Mathematics and Mechanics of Complex
Systems 4 (2016) 199–211.
https://doi.org/10.17863/CAM.4187
http://www.statslab.cam.ac.uk/~grg/papers/russo3.pdf
Grimmett, G. R.
Correlation inequalities for the Potts model. Mathematics and Mechanics of Complex
Systems 4 (2016) 327–334
http://www.statslab.cam.ac.uk/~grg/papers/gks.pdf
Grimmett, G. R., Janson, S. and Norris, J. R.
Influence in product spaces. Adv. Appl. Probab. 48A (2016) 145–152
http://www.statslab.cam.ac.uk/~grg/papers/gjn5.pdf
Grimmett, G. R. and Li, Z.
Critical surface of the hexagonal polygon model. J. Stat. Phys. 163 (2016) 733–753.
http://dx.doi.org/10.1007/s10955-016-1497-9
http://arxiv.org/pdf/1508.07492
Grimmett, G. R. and Li, Z.
Critical surface of the 1-2 model. Int. Math. Res. Not., to appear.
http://arxiv.org/pdf/1506.08406
Grimmett, G. R. and Li, Z.
Cubic graphs and the golden mean. Preprint.
http://arxiv.org/pdf/1610.00107
Grimmett, G. R. and Li, Z.
Connective constants and height functions for Cayley graphs. Trans. Am. Math. Soc. ,
to appear.
http://arxiv.org/pdf/1501.00476
Grimmett, G. R. and Li, Z.
Self-avoiding walks and connective constants. Preprint.
http://arxiv.org/pdf/1704.05884
Grindrod, P, Higham, D. J. and Noferini, V.
The deformed graph Laplacian and its applications to network centrality analysis.
Preprint.
http://repository.essex.ac.uk/18919/1/Jan17.pdf
Grindrod, P,
[see: Arrigo, F.]
Grinshpun, A.
[see: Fox, J.]
Grömping, U.
[see: Bailey, R. A.]
Gross, M.
[see: Arulselvan, A.]
Grossi, R.
[see: Crochemore, M. ]
Grosu, C.
[see: Adamaszek, A.]
Groult, R..
[see: Daykin, J. W.]
Gruslys, V.
Decomposing the vertex set of a hypercube into isomorphic subgraphs. Preprint.
http://arxiv.org/pdf/1611.02021
Gruslys, V. , Leader, I. B. and Tan, T. S.
Tilings with arbitrary tiles. Proc. Lond. Math. Soc. 112 (2016) 1019-1039.
http://doi.org/10.1112/plms/pdw017
http://arxiv.org/pdf/1505.03697
Gruslys, V. , Leader, I. B. and Tomon, I.
Partitioning the Boolean lattice into copies of a poset. Preprint.
http://arxiv.org/pdf/1609.02520
Gruslys, V. and Letzter, S. B.
Almost partitioning the hypercube into copies of a graph. Preprint.
http://arxiv.org/pdf/1612.04603
Gruslys, V. and Letzter, S. B.
Minimising the number of triangular edges. Preprint.
http://arxiv.org/pdf/1605.00528
Grzesik, A., Hu, P. and Volec, J.
Minimum number of edges that occur in odd cycles. Preprint.
http://arxiv.org/pdf/1605.09055
Grzesik, A.
[see: Cooper, J. W., Glebov, R.]
Guesnet, Y.
[see: Daykin, J. W.]
Guest, S.
[see: Fowler, P.]
Guggiari, H. and Scott, A. D.
Maximising H-Colourings of Graphs. Preprint.
https://people.maths.ox.ac.uk/scott/Papers/Hcol.pdf
Gunderson, K. and Semeraro, J.
Tournaments, 4-uniform hypergraphs, and an exact extremal result. J. Comb. Theory
Ser B., to appear.
http://arxiv.org/pdf/1509.03268
Gunderson, K.
[see: Balister, P. N., Bushaw, N.]
Gunnells, P. E.
[see: Dugan, W.]
Guo, H.
Mapping the complexity of counting problems. Bulletin of the European Association
for Theoretical Computer Science 120 (2016)
http://bulletin.eatcs.org/index.php/beatcs/article/view/458/437
Guo, H. and Jerrum, M. R.
Random cluster dynamics for the Ising model is rapidly mixing. SODA17, to appear.
http://dx.doi.org/10.1137/1.9781611974782.118
http://arxiv.org/pdf/arXiv:1605.00139 11
Guo, H., Jerrum, M. R. and Liu, J.
Uniform sampling through the Lovász Local Lemma. STOC17, to appear.
http://arxiv.org/pdf/1611.01647
Guo, H. and Lu, P. On the Complexity of Holant Problems. The Constraint Satisfaction Problem 2017,.
159-177.
11
A journal version has also been submitted.
http://dx.doi.org/10.4230/DFU.Vol7.15301.6
Guo, H. and Lu, P. Uniqueness, Spatial Mixing, and Approximation for Ferromagnetic 2-Spin Systems.
APPROX RANDOM 2016.
http://dx.doi.org/10.4230/LIPIcs.APPROX-RANDOM.2016.31
http://drops.dagstuhl.de/opus/volltexte/2016/6654/pdf/LIPIcs-APPROX-RANDOM-
2016-31.pdf
Guo, H.
[see: Bezakova, I., Cai, J.-Y., Goldberg, L. A.]
Gupta, A.
[see; Englert, M.]
Gutin, G.
A note on perfect forests. J. Graph Theory 82 (2016) 233-235.
http://dx.doi.org/10.1002/jgt.21897
Gutin, G. Jones, M. and Sheng, B.
Parameterized complexity of the k-arc Chinese Postman Problem. J. Comput. Syst.
Sci. 84 (2017) 107-119.
http://dx.doi.org/10.1016/j.jcss.2016.07.006
Gutin, G. Jones, M., Sheng, B., Wahlstrom, M. and Yeo, A.
Acyclicity in Edge-Colored Graphs. Discrete Math. 340 (2017) 1-8.
http://doi.org/10.1016/j.disc.2016.07.012
http://arxiv.org/pdf/1601.01824
Gutin, G. Jones, M., Sheng, B., Wahlstrom, M. and Yeo, A.
Chinese Postman Problem on Edge-Colored Multigraphs. Discrete Appl. Math. 217
(2017) 196-202.
http://doi.org/10.1016/j.dam.2016.08.005
http://arxiv.org/pdf/1512.06283
Gutin, G. Jones, M. and Wahlstrom, M.
The Mixed Chinese Postman Problem Parameterized by Pathwidth and Treedepth.
SIAM J. Discrete Math. 30 (2016) 2177-2205
http://dx.doi.org/10.1137/15M1034337
Gutin, G., Kratsch, S. and Wahlström, M.
Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem.
Algorithmica 75 (2016) 383-402.
http://dx.doi.org/10.1007/s00453-015-9986-9
Gutin, G. and Li, R.
Seymour's second neighbourhood conjecture for quasi-transitive oriented graphs.
Preprint.
http://arxiv.org/pdf/1704.01389
Gutin, G.,Reidl, F. and Wahlström, M.
k -Distinct In- and Out-Branchings in Digraphs. Preprint.
http://arxiv.org/pdf/1612.03607
Gutin, G., Sheng, B. and Wahlström, M.
Odd properly colored cycles in edge-colored graphs. Discrete Math. 340 (2017)
817-821.
http://dx.doi.org/10.1016/j.disc.2016.11.017
Gutin, G., Wahlström, M. and Yeo, A.
Rural postman parameterized by the number of components of required edges. J.
Comput. Syst. Sci. 83 (2017) 121-131
http://dx.doi.org/10.1016/j.jcss.2016.06.001
Gutin, G. and Yeo, A.
Note on Perfect Forests in Digraphs. J. Graph Theory, to appear.
http://arxiv.org/pdf/1511.01661
Gutin, G. and Yeo, A.
Parameterized Constraint Satisfaction Problems: A Survey. The Constraint
Satisfaction Problem 2017, 179-203
http://drops.dagstuhl.de/opus/volltexte/2017/6964/pdf/DFU-Vol7-15301-7.pdf
Gutin, G.
[see: Bergé, P., Crampton, J., Cohen, D. A.]
Gutman, Y. Manners, F. J. and Varjú, P. P.
The structure theory of Nilspaces III: Inverse limit representations and topological
dynamics. Preprint.
http://arxiv.org/pdf/1605.08950
Gutman, Y. Manners, F. J. and Varjú, P. P.
The structure theory of Nilspaces II: Representation as nilmanifolds. Preprint.
http://arxiv.org/pdf/1605.08948
Gutman, Y. Manners, F. J. and Varjú, P. P.
The structure theory of Nilspaces I. Preprint.
http://arxiv.org/pdf/1605.08945
Gysel, R.
[see: Goldberg, L. A.]
Haeneggi, M.
[see: Balister, P. N.]
Hagen, M. F.
[see: Behrstock, J.]
Hall, R.
[see: Chun, C.]
Hamann, M.
[see: Carmesin, J., Georgakopoulos, A.]
Hamel, A. M. and King, R. C.
Factorial characters of some classical Lie groups. Preprint.
http://arxiv.org/pdf/1607.06982
Hàn, H.
[see: Allen, P.]
Han, J.
Decision problem for Perfect Matchings in Dense k-uniform Hypergraphs. Trans. Am.
Math. Soc. 369 (2017) 5197-5218
https://doi.org/10.1090/tran/6999
http://www.ams.org/journals/tran/2017-369-07/S0002-9947-2017-06999-3/S0002-
9947-2017-06999-3.pdf
Han, J. and Kim, J.
Two-regular subgraphs of odd-uniform hypergraphs. Preprint.
http://arxiv.org/pdf/1604.07283
Han, J. and Kohayakawa, Y.
Maximum size of a non-trivial intersecting uniform family that is not a subfamily of
the Hilton-Milner family. Proc. Am. Math. Soc. 145 (2017) 73-87
https://doi.org/10.1090/proc/13221
http://arxiv.org/pdf/1509.05464
Han, J., Lo, A. and Sanhueza-Matamala, N. Covering and tiling hypergraphs with tight cycles. Preprint.
http://arxiv.org/pdf/1701.08115
Han, J., Lo, A., Treglown, A. and Zhao, Y.
Exact minimum codegree threshold for 𝐾4− factors. Combin. Probab. Comput., to
appear.
http://arxiv.org/pdf/1509.02577
Han, J. and Treglown, A.
The complexity of perfect matchings and packings in dense hypergraphs. Preprint.
http://arxiv.org/pdf/1609.06147
Han, J. and Zhao, Y.
Forbidding Hamilton cycles in uniform hypergraphs. J. Comb. Theory, Ser. A 143
(2016) 107–115.
http://doi.org/10.1016/j.jcta.2016.05.005
http://arxiv.org/pdf/1508.05623
Hancock, R., Staden, K. and Treglown, A.
Independent sets in hypergraphs and Ramsey properties of graphs and the integers.
Preprint.
http://web.mat.bham.ac.uk/~rah410/indRamseyFINAL.pdf
Hancock, R. and Treglown, A.
On solution-free sets of integers. Eur. J. Comb., to appear.
http://web.mat.bham.ac.uk/~rah410/solutionfreeFINISHED.pdf
Hancock, R. and Treglown, A.
A note on solution-free sets of integers. Preprint.
http://web.mat.bham.ac.uk/~rah410/notesolutionfreeFINAL.pdf
Hancock, R. and Treglown, A.
Enumerating solution-free sets in the integers. Electron. Notes. Discrete Math. 56
(2016) 21-30
https://doi.org/10.1016/j.endm.2016.11.004
http://web.mat.bham.ac.uk/~rah410/TCDM2016format1.pdf
Handley, A. J.
[see: Cooper, C.]
Hansen, R.,
[see: Axenovich, M.]
Hart, S. B.
How many elements of a Coxeter group have a unique reduced expression? Preprint.
http://arxiv.org/pdf/1701.01138
Hart, S. B.
[see: Anabanti, C. S.]
Hartinger, T. R., Johnson, M., Milanič, M. and Paulusma, D.
The price of connectivity for cycle transversals. Eur. J. Comb. 58 (2016) 203-224.
http://doi.org/10.1016/j.ejc.2016.06.003
Hartmann, M.
[see: Gould, V.]
Haskell D. [see: Aschenbrenner M.]
Haslegrave, J., Johnson, R. A. B. and Koch, S.
Subdivisions in the Robber Locating Game. Discrete Math. 339 (2016)
2804-2811.
http://dx.doi.org/10.1016/j.disc.2016.05.024
http://arxiv.org/pdf/1509.04701
Haslegrave, J., Johnson, R. A. B. and Koch, S.
Locating a robber with multiple probes. Preprint.
http://arxiv.org/pdf/1703.06482
Haslegrave, J. and Jordan, J.
Preferemtial attachment with choice. Random Struct. Algorithms 48 (2016)
751-766.
http://dx.doi.org/10.1016/j.disc.2016.05.024
http://arxiv.org/pdf/1407.8421.pdf
Haslegrave, J. and Puljiz, M.
Reaching consensus on a connected graph. J. Appl. Probab. 54 (2017) 181-198.
https://doi.org/10.1017/jpr.2016.94
http://arxiv.org/pdf/1511.05435
Haslegrave, J.
[see: Cannings, C., Georgakopoulos, A.]
Hatamo. N.
[see: Estrada. E]
Haug, N., Olde Daalhuis, A. and Prellberg, T.
Higher-order Airy scaling in deformed Dyck paths. J. Stat. Phys. 166 (2017) 1193
http://dx.doi.org/10.1007/s10955-016-1708-4
http://arxiv.org/pdf/1606.06983
Haug, N., Prellberg, T. and Siudern, G.
Area-width scaling in generalised Motzkin paths. Preprint.
http://arxiv.org/pdf/1605.09643
Hawtin, D. R.
[see: Gillespie, N. I.]
Haxell, P. E. and Scott, A. D.
A note on intersecting hypergraphs with large cover number. Preprint.
https://people.maths.ox.ac.uk/scott/Papers/ryser1.pdf
Haxell, P. E. and Scott, A. D.
On lower bounds for the matching number of subcubic graphs. J. Graph Theory 85
(2017) 336-348.
http://dx.doi.org/10.1002/jgt.22063
https://people.maths.ox.ac.uk/scott/Papers/subcubic.pdf
Haydn, N. and Todd, M.
Return times at periodic points in random dynamics. Nonlinearity 30 (2016)
http://doi.org/10.1088/0951-7715/30/1/73
http://arxiv.org/pdf/1511.01657
Hebdige, M.
[see: Cohen-Addad, V.]
Heckel, A.
The chromatic number of dense random graphs. Random Struct. Algorithms, to appear.
http://arxiv.org/pdf/1603.04836
Hefetz, D., Krivelevich, M. and Tan, W.-E.
Waiter-Client and Client-Waiter Hamiltonicity games on random graphs. Eur. J.
Comb. 63 (2017) 26-43.
http://doi.org/10.1016/j.ejc.2017.02.002
http://arxiv.org/pdf/1509.05356.pdf
Hefetz, D. and Tyomkyn, M.
Universality of Graphs with Few Triangles and Anti-Triangles. Combin. Probab.
Comput. 25 (2016) 560-576.
https://doi.org/10.1017/S0963548315000188
http://arxiv.org/pdf/1401.5735
Hefetz, D.
[see: Bednarska-Bzdega, M.]
Heggernes, P.
[see: Golovach, P. A.]
Heinig, P. [see: Bowler, N.]
Heinlein, M.
[see: Bruhn, H.]
Henning, M. A., Joos, F., Löwenstein, C. and Rautenbach, D.
Induced 2-Regular Subgraphs in k-Chordal Cubic Graphs. Discrete Appl. Math. 205
(2016) 73-79.
http://arxiv.org/pdf/1406.2438
Henning, M. A., Joos, F., Löwenstein, C. and Sasse, T.
Induced cycles in graphs. Graphs Comb. 32 (2016) 2425-2441.
http://doi.org/10.1007/s00373-016-1713-z
http://arxiv.org/abs/1406.0606
Herke, S.
[see: Bryant, D.]
Hermann, M.
[see: Goodall, A. J.]
van den Heuvel, J., Kierstead, H. J. and Quiroz, D.
Chromatic Numbers of Exact Distance Graphs. Preprint.
http://arxiv.org/pdf/1612.02160
van den Heuvel, J., Kreutzer, S., Pilipczuk, M., Quiroz, D., Rabinovich, R. and
Siebertz, S.
Model-Checking for Successor-Invariant First-Order Formulas on Graph Classes of
Bounded Expansion. LICS2017, to appear.
http://arxiv.org/pdf/1701.08516
van den Heuvel, J. and Wood, D. R.
Improper Colourings inspired by Hadwiger's Conjecture. Preprint.
http://arxiv.org/pdf/1704.06536.pdf
van den Heuvel, J. [see: Edwards, K.]
Higham, D. J.
[see: Aprahmian, M., Arrigo, F., Fenn, C.]
Higham, N. J.
[see: Aprahmian, M.]
Hillebrand, A. and McDiarmid, C. J. H.
Colour degree matrices of graphs with at most one cycle. Discrete Appl. Math. 209
(2016) 144-152.
http://doi.org/10.1016/j.dam.2015.07.025
Hindman, N., Leader, I. B. and Strauss, D.
Pairwise sums in colourings of the reals. Abhandlungen aus dem Mathematischen
Seminar der Universität Hamburg (2016) 1-13.
http://dx.doi.org/10.1007/s12188-016-0166-x
http://arxiv.org/pdf/1505.02500
Hindman, N., Leader, I. B. and Strauss, D.
Duality for image and kernel partition regularity of infinite matrices. Preprint.
http://arxiv.org/pdf/1609.03225
Hirschfeld, J. W. P. and Thas, J. A.
General Galois Geometries, second edition, Springer, London, xvi+409 pp., 2016.
http://www.springer.com/gb/book/9781447167884
Hirvensalo. M.
[see: Bell, P. C.]
Hladký, J., Hu, P. and Piguet, D.
Tilings in graphons. Preprint.
http://arxiv.org/pdf/1606.03113
Hladký, J., Hu, P. and Piguet, D.
Komlós's tiling theorem via graphon covers. Prreprint.
http://arxiv.org/pdf/1607.08415
Hladký, J., Komlós, J., Piguet, D., Simonovits, M., Stein, M. J. and Szemerédi,
E.
The approximate Loebl-Komlós-Sós Conjecture III: The finer structure of LKS
graphs. SIAM J. Discrete Math., to appear.
http://arxiv.org/pdf/1408.3871.pdf
Hladký, J., Král’, D. and Norin, S.
Counting flags in triangle-free digraphs. Combinatorica 37 (2017) 49-76.
http://dx.doi.org/10.1007/s00493-015-2662-5
http://arxiv.org/pdf/0908.2791
Hladký, J.
[see: Adamaszek, A., Csikvári, P. Doležal, M.]
Hoffmann, R., McCreesh, C. and Reilly, C.
Between Subgraph Isomorphism and Maximum Common Subgraph. AAAI 2017
3907-3914.
http://dcs.gla.ac.uk/~ciaran/papers/aaai17-nearly-subgraph-isomorphism-paper.pdf
van der Hofstad, R., Janson, S. and Luczak, M.
Component structure of the configuration model: barely supercritical case. Preprint.
http://www2.math.uu.se/~svante/papers/sj313.pdf
Hogben, L., Palmowski, K. F., Roberson, D. E. and Severini,, S.
Fractional Zero Forcing via Three-color Forcing Games. Discrete Appl. Math. 213
(2016) 114-129.
http://doi.org/10.1016/j.dam.2016.05.004
http://arxiv.org/pdf/1509.02883
Hogben, L., Palmowski, K. F., Roberson, D. E. and Severini,, S.
Orthogonal Representations, Projective Rank, and Fractional Minimum Positive
Semidefinite Rank: Connections and New Directions. Electronic Journal of Linear
Algebra, to appear.
http://arxiv.org/pdf/1502.00016
Hogben, L. [see: Dairyko, M.]
Holland, M. and Todd, M.
Weak convergence to extremal processes and record events for non-uniformly
hyperbolic dynamical systems. Preprint.
http://arxiv.org/pdf/1608.05620
Holmgren, C.
[see: Devroye, L.]
Holt, D.F. Rees, S. E. and Röver, C. M.
Groups, Languages and Automata. Lond. Math. Soc. Student Texts 88, Cambridge
University Press 2017, ISBN 9781316588246
http://dx.doi.org/10.1017/9781316588246
Holt, D. F. [see: Ciobanu, L.]
Hoppen, C.
[see: Glebov, R.]
Horodecki, K.
[see: Gnaciński, P,]
Horodecki, M.
[see: Gnaciński, P,]
House, T., Janson, S., Luczak, M. and Windridge, P.
Near-Critical SIR epidemic on a random graph with given degrees. J. Math. Biol. 74
(2016) 843-866.
http://dx.doi.org/10.1007/s00285-016-1043-z
http://arxiv.org/pdf/1501.05798
Howison, S. D. and Porter, M. A.
The Role of Network Analysis in Industrial and Applied Mathematics. Preprint.
http://arxiv.org/pdf/1703.06843
Hriňáková, K.
[see: Erskine, G.]
Hu, P.
[see; Balogh, J., Grzesik, A., Hladký, J.]
Huang, S..
[see: Brandstädt, A., Cameron, K., Dąbrowski, K. K.]
Hubai, T., Kunszenti-Kovács, D. and Lovász, L.
Positive graphs. Electron Notes. Discrete Math. 54 (2016) 355-360.
https://doi.org/10.1016/j.endm.2016.09.061
http://www.sciencedirect.com/science/article/pii/S157106531630155X?via%3Dihub#
Hubai, T.
[see: Csikvári, P., Glebov, R., Grzesik, A.]
Huber, K. T., van Iersel, L., Moulton, V., Scarnavacca, C. and Wu, T. Reconstructing phylogenetic level-1 networks from nondense binet and trinet sets.
Algorithmica 77 (2017) 173-200.
http://dx.doi.org/10.1007/s00453-015-0069-8
http://arxiv.org/pdf/1411.6804.pdf
Huber, K. T., Moulton, V. and Steel, M.
Minimum triplet covers of binary phylogenetic X_trees. Preprint.
Huber, K. T., Moulton, V., Steel, M. and Wu, T.
Folding and unfolding phylogenetic trees and networks.. J. Math,. Biol., 73 (2016)
1761-1780.
http://dx.doi.org/10.1007/s00285-016-0993-5
http://arxiv.org/pdf/1506.04438.pdf
Huber, K. T., Moulton, V., and Wu, T.
Transforming phylogenetic networks: Moving beyond tree space. Journal of
Theoretical Biology 404 (2016) 30-39.
http://doi.org/10.1016/j.jtbi.2016.05.030
http://arxiv.org/pdf/1601.01788
Huber, K. T., Moulton, V., and Wu, T.
Hierarchies from least stable ancestors in nonbinary phylogenetic networks. Preprint.
Huber, K. T. and Scholz, G. E.
Beyond representing orthology relations by trees. Algorithmica, to appear.
http://arxiv.org/pdf/1603.04632
Huber, K. T.
[see : Dress, A., Francis, A., Gambette, P.]
Huczynska, S. and Paterson, M. B.
Existence and Non-Existence Results for Strong External Difference Families.
Preprint.
http://arxiv.org/pdf/1611.05652
Huczynska, S. and Ruškuc, N.
On well quasi-order of graph classes under homomorphic image orderings. Eur. J.
Comb., to appear.
http://arxiv.org/pdf/1611.01200
Huczynska, S.
[see: Davis, J. A.]
Hudry, O.
[see: Fischer, F.]
Hug, D.
[see: Bárány, I.]
Hulpke, A.
[see: Araújo, J.]
Hundertmark, F.
[see: Carmesin, J.]
Huynh, T., Joos, F. and Wollan, P.
A unified theorem for packing disjoint cycles under constraints via doubly group-
labeled graphs, Preprint.
http://arxiv.org/pdf/1605.07082
Hyde J. T. , Jonusas, J. , Mitchell, J. D. and Peresse, Y. H.
Universal sequences for the order-automorphisms of the rationals. J.. Lond. Math.
Soc. 94 (2016) 21-37.
http://doi.org/10.1112/jlms/jdw015
http://arxiv.org/pdf/1401.7823
Idzik, A.
[see: Banakh, T.]
van Iersel, L., Moulton, V., Oldham, J. and Wu, T.
Piecing together small networks to reconstruct reticulate evolutionary histories.
Molecular Biology and Evolution 33 (2016) 2151-2162.
http://dx.doi.org/10.1093/molbev/msw068
http://ueaeprints.uea.ac.uk/58283/1/Full_Manuscript.pdf
van Iersel, L., Moulton, V., de Swart, E. and Wu, T.
Binets: fundamental building blocks for phylogenetic networks. Bull. Math. Biol., to
appear.
Iliopoulos, C. S.
[see: Badkobeh, G., Christou, G., Crochemore, M.]
Inenaga, S.
[see: Badkobeh, G.]
Iommi, G., Jordan, T. and Todd. M.
Transience and multifractal analysis. Ann. Inst. H. Poincare Anal. Non Lineaire 34
(2017) 407-421.
http://doi.org/10.1016/j.anihpc.2015.12.007
http://www.mcs.st-and.ac.uk/~miket/Papers/mfa_trans.pdf
Irving, J. and Rattan, A.
Parking functions, tree depth and factorizations of the full cycle into transpositions.
FPSAC2016.
http://econ109.econ.bbk.ac.uk/arattan/mypubs/final_144.pdf
Irving, R. W.
[see: Biró, P., Cseh, A.]
Itzhakov, A.
[see: Codish, M.]
Iwamasa, Y., Murota, K. and Živný, S.
Discrete Convexity in Joint Winner Property. Preprint.
https://arxiv.org/pdf/1701.07645
Ivanov, A. A.
[see: Franchi, C.]
Ivaskovic, A., Kosowski, A., Pajak, D. and Sauerwald, T.
Random Walks on Paths and Grids. STACS 2017: 44:1-44:14.
http://dx.doi.org/10.4230/LIPIcs.STACS.2017.44
Jackson, B., Jordán, T. and Tanigawa, S. Unique Low Rank Completability of Partially Filled Matrices. J. Comb. Theory Ser B.
121 (2016) 432-462.
http://doi.org/10.1016/j.jctb.2016.07.013
https://www.cs.elte.hu/egres/tr/egres-15-08.pdf
Jackson, B., Kaszanitzky, V. and Nixon, A.
Rigid cylindrical frameworks with two coincident points, Preprint.
http://arxiv.org/pdf/1607.02039
Jackson, B. and Nixon, A.
Global rigidity of generic frameworks on the cylinder. Preprint.
http://arxiv.org/pdf/1610.07755
Jackson, B. and Owen, J. C.
A characterisation of the generic rigidity of 2-dimensional point-line frameworks. J.
Comb. Theory Ser B 119 (2016) 96-121.
http://doi.org/10.1016/j.jctb.2015.12.007
http://arxiv.org/pdf/1407.4675
Jackson, B.
[see: Bang-Jensen, J.., Clinch, K., Eftekhari, Y.]
Jacob, E. and Mörters, P.
Robustness of scale-free spatial networks. Ann. Probab. 45 (2017) 1680-1722.
http://people.bath.ac.uk/maspm/sparob_revise.pdf
Jahanbekan, S., Kim, J., O, S. and West, D. B.
On r-Dynamic Coloring of Graphs. Discrete Appl. Math 206 (2017) 65-72.
http://doi.org/10.1016/j.dam.2016.01.016
http://web.mat.bham.ac.uk/~kimjs/papers/dynamic/rdynam5.pdf
Jajcay, R. and Jones, G. A.
Cayley properties of merged Johnson graphs. J. Algebr. Comb. 44 (2016) 1047-1067.
http://dx.doi.org/10.1007/s10801-016-0699-1
http://arxiv.org/pdf/1509.03125
Jalsenius, M.
[see: Clifford, R.]
Janson, S. and Warnke, L.
On the critical probability in percolation Preprint.
http://www2.math.uu.se/~svante/papers/sj314.pdf
Janson, S.
[see: Ahlberg, D., Brightwell, G. R., Grimmett, G. R., van der Hofstad, R., House, T.]
Járai, A. A.
Phase transition in a sequential assignment problem on graphs. Ann. Appl. Probab., to
appear.
http://arxiv.org/pdf/1507.04169
Jarvis, P. D.
[see: Fauser, B.]
Jeavons, P., Scott, A. D. and Xu, L.
Feedback from nature: simple randomised distributed algorithms for maximal
independent set selection and greedy colouring. Distributed Computing 29 (2016)
377-393.
http://dx.doi.org/10.1007/s00446-016-0269-8
https://people.maths.ox.ac.uk/scott/Papers/feedback.pdf
Jeavons, P.
[see: Cohen, D. A.]
Jefferson, C., Jonauskyte, E., Pfeiffer, M. and Waldecker, R.
Minimal and Canonical Images. Preprint.
http://arxiv.org/pdf/1703.00197
Jefferson, C., Pfeiffer, M. and Waldecker, R.
Orbital Graphs. Preprint.
http://arxiv.org/pdf/1703.04272
Jefferson, C., Pfeiffer, M. and Waldecker, R.
New refiners for permutation group search. Preprint.
http://arxiv.org/pdf/1608.08489
Jenssen, M. and Skokan, J.
Exact Ramsey numbers of odd cycles via nonlinear optimisation. Preprint.
http://arxiv.org/pdf/1608.05705
Jenssen, M.
[see: Davies. E.]
Jeong, J.
[see: Brignall, R.]
Jerrum, M. R.
Counting Constraint Satisfaction Problems. In "The Constraint Satisfaction Problem:
Complexity and Approximability", Dagstuhl Follow-Ups, vol 7, Schloss Dagstuhl -
Leibniz-Zentrum für Informatik (2017), 205–231.
http://dx.doi.org/10.4230/DFU.Vol7.15301.205
Jerrum, M. R. and Meeks, K.
The parameterised complexity of counting even and odd induced subgraphs.
Combinatorica (2016) 1-26.
http://dx.doi.org/10.1007/s00493-016-3338-5
http://arxiv.org/pdf/1410.3375.pdf
Jerrum, M. R.
[see: Bulatov, A., Cai, J-Y., Galanis, A., Goldberg, L. A., Guo, H.]
Johnson, C. R.
[see: Fallat, S.]
Johnson, J. R., Leader, I. B. and Walters, M. J.
Transitive avoidance games. Electron J. Comb. 24 (2017), P1.61.
http://www.combinatorics.org/ojs/index.php/eljc/article/view/v24i1p61
Johnson, J. R. and Pinto, T.
Saturated Subgraphs of the Hypercube. Combin. Probab. Comput. 26 (2017), 52-67.
http://dx.doi.org/10.1017/S0963548316000316
http://arxiv.org/pdf/1406.1766
Johnson, J. R.
[see: Day, A. N.]
Johnson, M., Kratsch, D., Kratsch, S., Patel, V. and Paulusma, D. Finding shortest paths between graph colourings. Algorithmica 75 (2016) 295-321,
http://dx.doi.org/10.1007/s00453-015-0009-7
http://arxiv.org/pdf/1403.6347
Johnson, M. [see: Blanché, A., Brinkmann, A., Dąbrowski, K. K., Feghali, C., Golovach, P. A.,
Hartinger, T. R.]
Johnson, M. E.
[see: Fenner, P.]
Johnson, O.
Strong converses for group testing from finite blocklength results. IEEE Trans. Inf.
Theory
https://doi.org/10.1109/TIT.2017.2697358
http://arxiv.org/pdf/1509.06188
Johnson, O. [see: Aldridge, M.]
Johnson, R. A. B.
[see: Haslegrave, J.]
Jonauskyte, E.
[see: Jefferson, C.]
Jones, G. A.
Paley and the Paley graphs. Preprint.
http://arxiv.org/pdf/1702.00285.pdf
Jones, G. A.
Automorphism groups of edge-transitive maps. Preprint.
https://arxiv.org/pdf/1605.09461
Jones, G. A.
[see: Jajcay, R.]
Jones, M.
[see: Cohen, D. A., Crampton, J., Gutin, G.]
Jones, S. A. M. and Thomas, R. M.
Characterizing word problems of groups, In K. G. Larsen, I. Potapov & J. Srba
(editors), Reachability Problems - 10th International Workshop, RP 2016, Aalborg,
Denmark, 2016. Lect. Notes Comput. Sci. 9899 (2016) 104-118.
http://dx.doi.org/10.1007/978-3-319-45994-3_8
Jones, S. K. and Perkins, S.
A P-box and S-box approach to encryption using Sudoku grids. Preprint.
http://arxiv.org/pdf/1605.09461
Jonusas, J.
[see: Hyde J. T.]
Joos, F.
Parity linkage and the Erdős-Pósa property of odd cycles through prescribed vertices
in highly connected graphs. J. Graph Theory, to appear.
Joos, F.
Induced Matchings in Graphs of Bounded Maximum Degree. SIAM J. Discrete Math.
30 (2016),1876-1882)
http://dx.doi.org/10.1137/16M1058078
https://arxiv.org/pdf/1406.2440
Joos, F., Kim, J., Kühn, D. and Osthus, D.
Optimal packings of bounded degree trees. Preprint.
http://arxiv.org/pdf/1606.03953
Joos, F. and Perarnau, G.
Critical percolation on random regular graphs. Preprint.
http://arxiv.org/pdf/1703.03639
Joos, F., Perarnau, G., Rautenbach, D. and Reed, B.
How to determine if a random graph with a fixed degree sequence has a giant
component. Probab. Theory Relat. Fields, to appear. 12
http://arxiv.org/pdf/1601.03714
Joos, F.
[see: Bruhn, H., Fountoulakis, N., Henning, M. A., Huynh, T. ] Jordan, J.
[see: Haslegrave, J.]
Jordan, T.
[see: Iommi, G.]
Jordán, T.
[see: Jackson, B.]
Jurdziński, M. [see: Czumaj, A.]
Juul, J. S. and Porter, M. A.
Synergistic effects in threshold models on Networks. Preprint.
http://arxiv.org/pdf/1701.06646.pdf
Kabluchko, Z., Marynych, A. and Sulzbach, H.
General Edgeworth expansions with applications to profiles of random trees. Ann.
Appl. Probab., to appear.
http://arxiv.org/pdf/1606.03920
Kabluchko, Z., Marynych, A. and Sulzbach, H.
Mode and Edgeworth Expansion for the Ewens Distribution and the Stirling Numbers.
J. Integer Seq. 19 (2016) Article 16.8.8.
https://cs.uwaterloo.ca/journals/JIS/VOL19/Kabluchko/kabl2.pdf
Kaiser, T.
[see: Cooper, J. W]
Kalai, G.
[see: Bárány, I., Ellis, D. ]
Kalikow, S.
[see: Bushaw, N.]
Kambites, M.
[see: Fenner, P.]
Kamiński, M., Paulusma, D., Stewart, A. and Thilikos, D. M.
Minimal disconnected cuts in planar graphs..Networks 68 (2016) 250-259
http://dx.doi.org/10.1002/net.21696
https://community.dur.ac.uk/daniel.paulusma/Papers/Submitted/minimaldisconnected
cut.pdf
Kanade, V., Malmann-Trenn, F. and Sauerwald, T.
On coalescence time in graphs--When is coalescing as fast as meeting? Preprint.
12
Conference version in FOCS2016.
http://arxiv.org/pdf/1611.02460
Kane, D.
[see: Green, B. J.]
Kang, D. Y., Kim, J., Kim, Y. and Law, H.-F.
On the number of r-matchings in a tree. Electron J. Comb. 24 (2017) #P1.24
http://www.combinatorics.org/ojs/index.php/eljc/article/view/v24i1p24/pdf
Kang, M.
[see: Cooley, O., Fountoulakis, N.]
Kang, R. J. [see: Edwards, K., Girão, A.]
Kangaslampi, R. and Vdovina, A.
Hyperbolic triangular buildings without periodic planes of genus two .Experimental
Mathematics 26 (2017) 54-61.
http://dx.doi.org/10.1080/10586458.2015.1110541
http://arxiv.org/pdf/1409.1401
Kao, R.
[see: Enright, J.]
Karapetyan, D., Punnen, A. P. and Parkes, A. J.
Markov Chain methods for the bipartite Boolean quadratic programming problem.
Preprint.
http://arxiv.org/pdf/1605.02038
Karapetyan, D.
[see: Crampton, J.]
Kardoš, F., Kráľ, D., Liebenau, A. and Mach, L.
First order convergence of matroids, Eur. J. Comb. 59 (2017) 150-168
http://doi.org/10.1016/j.ejc.2016.08.005
http://arxiv.org/pdf/1501.06518
Karpas, I. and Long, E. P.
Set families with a forbidden pattern. Eur. J. Comb. 62 (2017) 183-196.
http://doi.org/10.1016/j.ejc.2016.11.005
http://arxiv.org/pdf/1510.05134
Kasprzyk, A. M., Nill, B. and Prince, T.
Minimality and mutation-equivalence of polygons. Forum Math (Sigma), to appear.
http://arxiv.org/pdf/1501.05335
Kasprzyk, A.
[see: Akhtar, M., Balletti, G.]
Kaszanitzky, V. and Schulze, B.
Lifting symmetric pictures to polyhedral scenes. Ars Math. Contemp. 13 (2017)
31-47.
https://www.cs.elte.hu/egres/tr/egres-15-07.pdf
Kaszanitzky, V., Schulze, B. and Tamigawa, S.-I.
Global Rigidity of Periodic Graphs under Fixed-lattice Representations. Preprint.
http://arxiv.org/pdf/1612.01379
Kaszanitzky, V.
[see: Jackson, B.]
Keevash, P.
Counting designs. J. Eur. Math. Soc., to appear.
http://people.maths.ox.ac.uk/keevash/papers/count-designs-final.pdf
Keevash, P. and Lochet, W.
The structure of typical eye-free graphs and a Turan-type result for two weighted
colours. Combin. Probab. Comput., to appear.
http://people.maths.ox.ac.uk/keevash/papers/EyeFreeArxiv.pdf
Keevash, P. and Long, E. P.
On the normalized Shannon capacity of a union. Combin. Probab. Comput. 25 (2016)
766-767.
http://doi.org/10.1017/S0963548316000055
http://arxiv.org/pdf/1603.03616
Keevash, P. and Long, E. P.
Frankl-Rödl-type theorems for codes and permutations. Trans. Am. Math. Soc. 369
(2017) 1147-1162
http://doi.org/10.1090/tran/7015
http://www.ams.org/journals/tran/2017-369-02/S0002-9947-2016-07015-4/S0002-
9947-2016-07015-4.pdf
Keevash, P. and Long, E. P.
A stability result for the cube edge isoperimetric inequality. Preprint.
http://arxiv.org/pdf/1703.10122
Keevash P.
[see: Balla, I., Clinch, K.]
de Keijzer, B.
[see: Collini-Baldeschi, R.]
Kelk, S.
[see: Fischer, M.]
Keller, N.
[see: Ellis, D.]
Kern, W.
[see: Biró, P.]
Keszegh, B., Lemons, N. and Pálvölgyi, D.
Online and Quasi-online Colorings of Wedges and Intervals. Order 33 (2016)
389-409.
http://dx.doi.org/10.1007/s11083-015-9374-8
Keszegh, B. and Pálvölgyi, D.
Proper Coloring of Geometric Hypergraphs. Preprint.
http://arxiv.org/pdf/1612.02158.pdf
Keszegh, B. [see: Gerbner, D.]
Key, J..D., Mavron, V. C. and McDonough, T. P.
Codes from Hall planes of odd order. Advances in Mathematics of Communications
11 (2017) 179-185.
http://dx.doi.org/10.3934/amc.2017011
http://aimsciences.org/journals/doIpChk.jsp?paperID=13691&mode=full
Key, J..D., Mavron, V. C. and McDonough, T. P.
Improved partial permutation decoding for Reed-Muller codes. Discrete Math. 340
(2017) 722-728.
http://dx.doi.org/10.1016/j.disc.2016.11.031
Kharlampovich, O., Mohajeri, O., Taam, A. and Vdovina, A.
Quadratic Equations in Hyperbolic Groups are NP-complete. Trans. Am. Math. Soc.
(2017)
http://dx.doi.org/10.1090/tran/6829
http://www.ams.org/journals/tran/0000-000-00/S0002-9947-2017-06829-X/S0002-
9947-2017-06829-X.pdf
Khosla, M.
[see: Fountoulakis, N.]
Kiasari, A.
[see: Erickson, A.]
Kierstead, H. J.
[see: van den Heuvel, J.]
Kilibarda, V.
[see: Craik, J.]
Kim, J.
Regular Subgraphs of Uniform Hypergraphs. J. Comb. Theory Ser. B 119 (2016)
214-236
http://web.mat.bham.ac.uk/~kimjs/papers/regularhypergraphs/regular_submitted.pdf
Kim, J., Kühn, D. and Osthus, D.
Bipartitions of Highly Connected Tournaments. SIAM J. Discrete Math. 30 (2016),
895-911.
http://dx.doi.org/10.1137/15M1006611
http://web.mat.bham.ac.uk/~kimjs/papers/tournamentconnectivity/TournamentBipartit
ionConnectivity8.pdf
Kim, J., Liu, H, Sharifzadeh, M. and Staden, K.
Proof of Komlós's conjecture on Hamiltonian subsets. Preprint.
http://arxiv.org/pdf/1701.06784
Kim, J. and Ok, S.
Dynamic choosability of triangle-free graphs and sparse random graphs. J. Graph
Theory, to appear.
Kim, J.
[see: Choi, I., Han, J., Jahanbekan, S.,, Joos, F., Kang, D. Y.]
Kim, R.
[see: Chudnovsky, M.]
Kim, Y.
[see: Kang, D. Y.]
Kindler, G.
[see: Ellis, D.]
King, O.H.
[see: Cossidente, A.]
King, R. C.
[see: Fauser, B., Hamel, A. M.]
Kitaev, S.
Existence of u-representation of graphs, J. Graph Theory, to appear
Kitaev, S. and Remmel, J.
A note on p-ascent sequences. J. Comb. (2016) 2156-3527
http://arxiv.org/pdf/1503.00914
Kitaev, S.
[seeChen, T. Z. Q.,. Collins, A., Gao, A., Glen, M., Jones, M.]
Kitson, D. and Schulze, B.
Symmetric isostatic frameworks with 𝑙1 or 𝑙∞ distance constraints. Electron. J. Comb.
23 (2016) P4.23.
http://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i4p23/pdf
Kitson, D. and Schulze, B.
Motions of grid-like reflection frameworks. J. Symb. Comput.. to appear.
Kitson, D.
[see: Cruickshank, J.,]
Kittipassorn, T.
[see: Girão, A.]
Klasing, R., Kosowski, A., Pajak, D. and Sauerwald, T.
The multi-agent rotor-router on the ring: a deterministic alternative to parallel random
walks. Distributed Computing 30 (2017) 127-148.
http://dx.doi.org/10.1007/s00446-016-0282-y
Klasing, R.
[see: Anta, A F., Czyzowicz, J.]
Klein, S.
[see: Alves, S. R.]
Klimm, M.
[see: Bjelde, A., Dütting, P,]
Klimošová, T.
[see: Glebov, R.]
Kling, P.
[see: Berenbrink, P.]
Knight, G.
[see: Dettmann, C. P.]
Knor, M.
[see: Grannell, M. J.]
Ko, S.-K. and Potapov, I.
Matrix Semigroup Freeness Problems in SL(2,Z). SOFSEM2017 268-279.
http://dx.doi.org/10.1007/978-3-319-51963-0_21
Kobilinsky, A.
[see: Bailey, R. A.]
Koch, C. and Lengler, J.
Bootstrap Percolation on Geometric Inhomogeneous Random Graphs. ICALP2016 1-
15.
http://drops.dagstuhl.de/opus/volltexte/2016/6291/pdf/LIPIcs-ICALP-2016-147.pdf
Koch, C.
[see: Cooley, O., Fountoulakis, N.]
Koch, S.
[see: Haslegrave, J.]
Kociumaka, T.
[see: Crochemore, M.]
Kogan, D.
[see: Atzmon, N.]
Kohayakawa, Y.
[see: Allen, P., Glebov, R., Han, J.]
Kolek, T.
[see: Goodall, A. J.]
Kolmogorov,V., Krokhin, A. and Rolinek, M.
The complexity of general-valued CSPs. SIAM J. Comput., to appear. http://arxiv.org/pdf/1502.07327
Kolountzakis, M.
[see: Georgakopoulos, A.]
Kolpakov, I.
[see: Ciobanu, L.]
Komlós, J.
[see: Hladký, J.]
Kompatscher, M.
[see: Bodirsky, M.]
Komusiewicz, C [see: Fluschnik, T.]
Konyagin, S. V.
[see: Ford, K.]
Koolen, J.
[see: Dress, A.]
Korpelainen, N.
[see: Brignall, R., Collins, A.]
Kosowski, A.
[see: Czyzowicz, J., Ivaskovic, A., Klasing, R.]
Kostochka, A. V.
[see: Choi, I.]
Kotthoff, L, McCreesh, C. and Solnon, C.
Portfolios of Subgraph Isomorphism Algorithms. LION2016, to appars.
Koukopoulos, D.
[see: Eberhard, S.]
Koutecky, M.
[see: Crampton, J.]
Kozik, M,
[see: Dalmau, V.]
Král’, D.
[see: Cohen-Addad, V ,, Cooper, J. W.. Dvořák, Z., Glebov, R., Hladký, J., Kardoš,
F..]
Kratsch, D.
[see: Cochefert , M., Golovach, P. A., Johnson, M.]
Kratsch, S.
[see: Johnson, M. Gutin, G.]
Krattenthaler, C. and Müller, T. W.
Normalising graphs of groups. Monatsh. Math., to appear.
https://arxiv.org/pdf/1608.03538
Krattenthaler, C. and Müller, T. W.
Motzkin numbers and related sequences modulo powers of 2. Preprint.
http://arxiv.org/pdf/1608.05657
Kraus, V.
[see: Genitrini, A.]
Krauthgamer, R..
[see: Englert, M.]
Kreutzer, S.
[see: van den Heuvel, J.]
Kriege, N.
[see: Giscard, P.-L]
Kriesell, M.
[see: Bang-Jensen, J.]
Krivelevich, M., McDiarmid, C. J. H., Panagiotou, K. and Penrose, M. D.
Random Graphs, Geometry and Asymptotic Structure. Lond. Math. Soc. Student Texts
84 (2016).
http://www.cambridge.org/catalogue/catalogue.asp?isbn=9781316501917
Krivelevich, M.
[see: Bednarska-Bzdega, M., Hefetx, D.]
Krokhin, A. and Živný. S. The complexity of valued CSPs. Survey in The Constraint Satisfaction Problem:
Complexity and Approximability, 233-266, 2017.
http://www.dur.ac.uk/andrei.krokhin/papers/kzsurvey16.pdf
Krokhin, A.
[see: Barto, I., Carvalho, C., Cohen, D. A., Dalmau, V., Kolmogorov, V.]
Kronenberg, G.
[see: Ferber, A.]
Krzakala, F.
[see: Coja-Oghlan, A.]
Kuba, M. and Sulzbach, H.
On martingale tail sums in affine two-color urn models with multiple drawings. J.
Appl. Probab. 54 (2017) 96-117.
http://doi.org/10.1017/jpr.2016.89
https://arxiv.org/pdf/1511.01618
Kubica, M.
[see: Crochemore, M.]
Kühn, D., Osthus, D. and Patel, V.
A domination algorithm for {0,1}-instances of the travelling salesman problem.
Random Struct. Algorithms 48 (2016) 427–453
http://dx.doi.org/10.1002/rsa.20600
http://web.mat.bham.ac.uk/D.Kuehn/TSP(revised).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. J. Comb. Theory Ser. B 121 (2016) 85-145.
http://doi.org/10.1016/j.jctb.2015.12.003
http://web.mat.bham.ac.uk/D.Kuehn/ham3connex25.pdf
Kühn, D., Osthus, D. and Taylor, A.
On the random greedy F-free hypergraph process. SIAM J. Discrete Math. 30 (2016)
1343-1350.
http://dx.doi.org/10.1137/15M1050343
http://web.mat.bham.ac.uk/D.Kuehn/randomgreedy3.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 36 (2016) 451–469.
http://dx.doi.org/10.1007/s00493-015-3186-8
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.
J. Comb. Theory Ser B 124 (2017) 88–127
http://doi.org/10.1016/j.jctb.2016.12.008
http://web.mat.bham.ac.uk/D.Kuehn/OrientedHFreeGraphs6.pdf _ Kühn, D.
[see: Barber, B., Csaba, B., Glock, S., Joos, F., Kim, J.]
Kundu, R.
[see; Crochemore,. M.]
Kunszenti-Kovács, D.
[see; Hubai, T.]
Kupavskii, A., Pach, J. and Tomon, I.
On the size of k -cross-free families. Preprint.
http://arxiv.org/pdf/1704.02175
Kusuma, J.
[see: Cameron, P. J. ]
Kuszner, L.
[see: Akrida, E. C.]
Kynčl, J.
[see: Fulek, R.]
Laing, T. M., Martin, K. M., Paterson, M. B. and Stinson, D. R.
Localised Multisecret Sharing. Cryptography and Communications, 31.08.2016, 1-17.
http://dx.doi.org/10.1007/s12095-016-0202-9
http://eprint.iacr.org/2015/922.pdf
Lamprou, I., Martin, R. and Spirakis, P. G.
Bounding the Cover Time in Edge-Uniform Stochastic Graphs. Preprint.
http://arxiv.org/pdf/1702.05412
Langiu, A.
[see: Crochemore,. M.]
Lapinskas, J.
[see: Curticapean, R., Galanis, A.,. Goldberg, L. A.]
Larcombe, P. J.
On the Evaluation of Sums of Exponentiated Multiples of Generalized
Catalan Number Linear Combinations Using a Hypergeometric Approach, Fibonacci
Quarterly, to appear.
Larcombe, P. J.
Alwyn Francis Horadam, 1923-2016: A Personal Tribute to the Man and His
Sequence,. Bull. Inst. Comb. Appl 78 (2016) 93-107.
Larcombe, P. J.
[see: Bagdasar, O. D., Fennessey, E. J. ]
Launois, S. and Lecoutre, C.
Poisson Deleting Derivations Algorithm and Poisson Spectrum. Commun. Algebra.,
45 (2017) 1294-1313.
http://dx.doi.org/10.1080/00927872.2016.1175619
http://arxiv.org/pdf/1409.4604.pdf
Law, H.-F.
[see: Kang, D. Y.]
Le, N. K.,
[see: Adler, I.]
Leader, I. B., Milićević, L. and Tan, T S.
Decomposing the Complete r –Graph. Preprint.
http://arxiv.org/pdf/1701.08335
Leader, I. B. and Tan, T. S.
Connected Colourings of Complete Graphs and Hypergraphs. Graphs. Comb. 32
(2016) 257-269
http://dx.doi.org/10.1007/s00373-015-1537-2
http://arxiv.org/pdf/1402.2087
Leader, I. B.
[see: Balister, P. N., Ellis, D., Gruslys, V., Hindman, N., Johnson, J. R.]
Lecoutre, C.
[see: Launois, S.]
Lecroq, T.
[see: Daykin, J. W.]
Lee, C.
[see: Conlon, D.]
Lee, J. D.
[see: Balister, P. N., Bollobás, B., Conlon, D.]
Lee, S. H.
[see: Cucuringu, J. ]
Leemans, D. and Liebeck, M. W.
Chiral polyhedra and finite simple groups. Bull. Lond. Math. Soc., to appear.
http://arxiv.org/pdf/1603.07713
Leemans D.
[see: Cameron, P. J.]
van Leeuwen, E. J.
[see: Golovach, P.]
Lefebvre, A.
[see: Daykin, J. W.]
Lehel, J.
[see: Balister, P. N.]
Lehner, F.
Distinguishing graphs with intermediate growth. Combinatorica 36 (2016) 333-347.
http://dx.doi.org/10.1007/s00493-015-3071-5
https://arxiv.org/pdf/1301.0393
Lehner, F.
Pursuit evasion on infinite graphs. Theor. Comput. Sci. 655 (2016) 30-40.
http://doi.org/10.1016/j.tcs.2016.04.024
Lehner, F.
Breaking graph symmetries by edge-colorings. Preprint.
http://arxiv.org/pdf/1604.08144
Lehner, F. [see: Bowler, N.]
Lemmens, B., Lins, B. and Nussbaum, R.
Detecting fixed points of nonexpansive maps by illuminating the unit ball. Isr. J.
Math., to appear.
http://arxiv.org/pdf/1607.01602
Lemons, N.
[see: Keszegh, B.]
Lengler, J.
[see: Goldberg, L. A., Koch, C.]
Lenz, J.,. Mycroft, R. and Mubayi, D.
Hamilton cycles in quasirandom hypergraphs. Random Struct. Algorithms 49 (2016)
363-378.
http://dx.doi.org/10.1002/rsa.20638
http://arxiv.org/pdf/1502.04041
Lenz, J.
[see: Balogh, J..]
Léonard, M.
[see: Daykin, J. W.]
Leonardi, S.
[see: Collini-Baldeschi, R.]
Letchford, A. N.
[see: Giandomenico, M.]
Letzter, S.
Radon numbers for trees. Discrete Math. 340 (2017) 33-344.
http://doi.org/10.1016/j.disc.2016.08.025
http://arxiv.org/pdf/1302.1599
Letzter, S.
Path Ramsey Number for Random Graphs. Combin. Probab. Comput. 25 (2016)
612-622.
https://doi.org/10.1017/S0963548315000279
http://arxiv.org/pdf/1405.6670
Letzter, S. and Snyder, R.
The homomorphism threshold of {𝐶3 ,𝐶5 } free graphs. Preprint.
http://arxiv.org/pdf/1610.04932
Letzter, S.
[see: Bollobás, B., Gruslys, V.]
Lev, V. F. and Rudnev, M.
Minimizing the sum of projections of a finite set. Preprint.
http://arxiv.org/pdf/1610.02504
Levin, D.
[see: Bevan, D.]
Levin, D. A.
[see: Cannon, S.]
Levine, L.
[see: Candellero, E.]
Lewis, R. R.
[see: Bevan, D.]
Li, R.
[see: Gutin, G.]
Li, Z.
[see: Cohen-Addad, V., Grimmett, G. R.,]
Lidický, B.
[see; Axenovich, M.]
Lidický, D.
[see; Balogh, J.]
Liebeck, M. W. [see: Leemans, D.]
Liebenau, A.
[see: Fox, J., Kardoš, F.]
Lifshitz, N.
[see: Ellis, D.]
Lim, K. J.
[see: Gianelli, E.]
Lima, P. T.
[see: Golovach, P. A.]
Lin, A., Makhul, M., Moharrad, H. N., Schicho. J.,. Swanepoel, K. and de
Zeeuw, F.
On sets defining few ordinary circles. Discrete Comput. Geom., to appear.
http://arxiv.org/pdf/1607.06597
Lin, J. C.-H., [see: Dairyko, M.]
Lindqvist, S.
Partition regularity of generalised Fermat equations. Combinatorica, to appear.
http://arxiv.org/pdf/1606.07334.pdf
Lindqvist, S.
[see: Green, B. J.]
Linek, V., Soicher, L. H. and Stevens, B.
Cube designs, J. Combin. Des. 24 (2016) 223-233
http://www.maths.qmul.ac.uk/~leonard/cubedesigns.pdf
Lins, B.
[see: Lemmens, B.]
Linz, S.
[see: Bordewich, M. J.]
Lippner, G.
[see: Csóka, E.]
Liu, H., and Montgomery, R.
A proof of Mader's conjecture on large clique subdivisions in 𝐶4 −free graphs.
J. Lond. Math. Soc., to appear.
https://www.dpmms.cam.ac.uk/~rhm34/papers/3maderconjecture.pdf
Liu, H., Sharifzadeh, M. and Staden, K.
Local conditions for exponentially many subdivisions. Combin. Probab. Comput. 26
(2017) 423-430.
http://dx.doi.org/10.1017/S0963548316000365
http://arxiv.org/pdf/1612.00206
Liu, H.,
[see: Balogh, J., Glebov, R. Kim, J.]
Liu, J.
[see: Guo. H.]
Liu, S. , Münch, F. and Peyerimhoff, N.
Bakry-Emery curvature and diameter bounds on graphs. Preprint.
http://arxiv.org/pdf/1608.07778
Liu, S.
[see: Bourne, D., Cushing, D.] Lo, A.
[see: Balogh, J., Barber, B.,, Csaba, B., Falgas-Ravry, V., Glock, S. Han, J.. Kühn, D.]
Lo, I.
[see: Csóka, E.]
Lochet, W.
[see: Keevash, P.]
Lockhart, J. and Severini, S.
Combinatorial Entanglement. Preprint.
http://arxiv.org/pdf/1605.03564.pdf
Lockhart, J. [see: Dairyko, M.]
De Loera, J. A.
[see: Aliev, I.]
Long, E. P.
Large unavoidable subtournaments, Combin. Probab. Comput. 26 (2017) 68-77
http://doi.org/10.1017/S0963548316000213
http://arxiv.org/pdf/1502.05187
Long, E. P.
[see; Ferber, A., Karpas, I., Keevash, P.]
Long, J. and Narayanan, B. P.
Diffusion on graphs is eventually periodic. Preprint.
http://arxiv.org/pdf/1704.04295.pdf
Long, J.
[see: Gowers, W. T.]
Lopes, P.
[see: Araújo, J.]
Lotfifar, F.
[see: Brinkmann, A.]
Louveaux, Q.
[see: Aliev, I.]
Lovász, L.
[see: Hubai, T.]
Lovász, L. M. and Zhao, Y.
On derivatives of graphon parameters, J. Comb. Theory Ser A. 145 (2017)
364-368.
http://doi.org/10.1016/j.jcta.2016.08.007
http://arxiv.org/pdf/1505.07448
Lovász, L. M.
[see: Fox, J.]
Lovegrove, G. J.
[see: Grannell, M. J.]
Löwenstein, C.
[see: Henning, M. A.]
Lozin, V. V.
Graph Parameters and Ramsey Theory. Preprint.
http://arxiv.org/pdf/1608.07727.pdf
Lozin, V. V. and Malyshev, D. S.
Vertex coloring of graphs with few obstructions. Discrete Appl. Math. 216 (2017)
273-280.
http://dx.doi.org/10.1016/j.dam.2015.02.015
Lozin, V. V., Razgon, I. and Zamaraev, V.
Well-quasi-ordering does not imply bounded clique-width. Lect. Notes. Comput. Sci.,
9224 (2016) 351-359.
http://dx.doi.org/10.1007/978-3-662-53174-7_25
http://arxiv.org/pdf/1503.00571
Lozin, V. V., Razgon, I. and Zamaraev, V.
Well quasi-ordering versus clique width. J. Comb. Theory Ser. B., to appear.
http://victorzamaraev.com/wp-content/uploads/2017/01/wqo_vs_cw.pdf
Lozin, V. V. and Zamaraev, V.
The structure and the number of 𝑃7-free bipartite graphs. Preprint.
http://arxiv.org/pdf/1607.08782
Lozin, V. V.
[see: AbouEisha, H., Atminas, A., Cardoso, D. M., Collins, A., Dąbrowski, K.K.]
Lu, P.
[see: Guo,.H.]
Lubetzky, E. and Zhao, Y.
On the variational problem for upper tails in sparse random graphs. Random Struct.
Algorithms 50 (2017) 420–436.
http://dx.doi.org/10.1002/rsa.20658
https://arxiv.org/pdf/1402.6011
Lubetzky, E.
[see: Bhattacharya, B. B.]
Lucchini, A.
[see: Cameron, P. J.]
Luczak, M. J.
[see: Barbour. A. D., Brightwell, G. R., van der Hofstad, R., House, T.]
Łuczak, T.
[see: Bednarska-Bzdega, M.]
Lund, B. [see: Bárány, I.,]
Luz, C. J.
[see: Cardoso, D. M.]
Mach, L.
[see: Kardoš, F.]
Maclagan, D. and Rincon, F.
Tropical Ideals. Preprint.
https://arxiv.org/pdf/1609.03838
Macpherson, H. D. [see: Aschenbrenner M., Bodirsky, M.]
Maenhaut, B.
[see: Bryant, D.]
Magos, D.
[see: Cechlárová, K.]
Mahdjoubi, L.
[see: Barki, H. Boguslawski, P]
Mailler, C., Mörters, P. and Ueltschi, D.
Condensation and symmetry-breaking in the zero-range process with weak site
disorder. Stochastic Processes Appl. 126 (2016) 3283-3309
http://doi.org/10.1016/j.spa.2016.04.028
http://arxiv.org/pdf/1509.07672
Mailler, C.
[see: Bettinelli, J., Dereich, S., Genitrini, A.]
Mainardis, M.
[see: Franchi, C.]
Makai, T.
[see: Fountoulakis, N.]
Makarychev, K.,
[see: Dalmau, V.]
Makarychev, Y.
[see: Dalmau, V.]
Makhul, M.
[see: Lin, A.]
Makowsky, J. A.
[see: Ellis-Monaghan, J. A.]
Makowsky, M.
[see: Goodall, A. J.]
Malmann-Trenn, F.
[see: Berenbrink, P., Kanade, V.]
Malyshev, D. S.
[see: Lozin, V. V.]
Mancinska, L. and Roberson, D. E.
Quantum homomorphisms. J. Comb. Theory, Ser. B 118 (2016) 228-267.
http://dx.doi.org/10.1016/j.jctb.2015.12.009
Mancinska, L. and Roberson, D. E.
Oddities of quantum colorings. Baltic Journal of Modern Computing 2016.
http://www.bjmc.lu.lv/fileadmin/user_upload/lu_portal/projekti/bjmc/Contents/4_4_1
6_Mancinska.pdf
Mancinska, L., Roberson, D. E., and Varvitsiotis., A.
Deciding the existence of perfect entangled strategies for nonlocal games
Chicago Journal of Theoretical Computer Science (2016).
http://cjtcs.cs.uchicago.edu/articles/2016/5/contents.html http://arxiv.org/pdf/1506.07429
Mančinska, L.
[see: Atserias, A.]
Manlove, D. F., McBride, I. and Trimble, J.
“Almost-stable" matchings in the Hospitals / Residents problem with Couples: An
Integer Programming approach. Constraints 22 (2016) 50-72.
http://dx.doi.org/10.5525/gla.researchdata.303
http://arxiv.org/pdf/1602.01956
Manlove D. F.
[see: Arulselvan, A., Cechlárová, K , Cseh, A., Dickerson, J. P., Goldberg, P. A. ]
Manners, F. J.
Finding a low-dimensional piece of a set of integers. Int. Math. Res. Not.2016.
https://doi.org/10.1093/imrn/rnw153
http://arxiv.org/pdf/1512.06272
Manners, F. J.
[see: Gutman, Y.]
Marino, G.
[see: Cossidente, A.]
Markiewicz, A.
[see: Bailey, R. A.]
Marmolejo-Cossio, F. J. [see: Goldberg, P. W.]
Martin, B.
Quantified Constraints in Twenty Seventeen. The Constraint Satisfaction Problem
2017 327-346.
http://dx.doi.org/10.4230/DFU.Vol7.15301.12
http://drops.dagstuhl.de/opus/volltexte/2017/6969/pdf/DFU-Vol7-15301-12.pdf
Martin, B.
[see: Bodirsky, M., Carvalho, C., Chen,T.., Golovach, P. A.]
Martin, J.
[see: Chen, T.]
Martin, K. M.
[see: Laing, T. M.]
Martin, R.
[see: Lamprou, I.]
Martin, R., R., Mycroft, R. and Skokan, J.
A multipartite Kühn-Osthus theorem. SIAM J. Discrete Math., to appear.
http://arxiv.org/pdf/1604.03002
Martin, R. R.
[see: Axenovich, M.]
Martinelli, F.
[see: Caputo, P.]
Martins, T.
[see: Cooper, J. W.]
Marynych, A.
[see: Kabluchko, Z.]
Mäsker, M.
[see: Brinkmann, A.]
Mathé, A.
[see: Csóka, E.., Doležal, M , Grabowski, Ŀ.]
Matuschke, J.
[see: Arulselvan, A.]
Mavron, V. C.
[see: Key, J. D.]
Mayhew, D.
[see: Cameron, A., Chun, C., Funk, D.]
Maynard, J.
[see: Ford, K.]
McBride, I.
[see: Cechlárová, K., Manlove, D. F.]
McCourt, T. A. and Schroder, Z.
Self-embeddings of doubled affine Steiner triple systems. Australas. J. Comb.
66 (2016) 23–43.
https://ajc.maths.uq.edu.au/pdf/66/ajc_v66_p023.pdf
McCreesh, C., Ndojh Ndiaye, S., Prosser, P. and Somnon, C.
Clique and Constraint Models for Maximum Common (Connected) Subgraph
Problems. CP 2016: 350-368.
http://dx.doi.org/10.1007/978-3-319-44953-1_23
McCreesh, C. and Prosser, P.
Finding Maximum k-Cliques Faster using Lazy Global Domination. SoCS 2016, 72-
80.
http://arxiv.org/pdf/1408.6485
McCreesh, C., Prosser, P.. and Trimble, J.
Heuristics and Really Hard Instances for Subgraph Isomorphism Problems.
IJCAI 2016: 631-638.
http://www.dcs.gla.ac.uk/~ciaran/papers/ijcai2016-really-hard-sip.pdf
McCreesh, C.
[see: Hoffmann, R., Kotthoff, L]
McDiarmid, C. J. H.
Connectivity for bridge-alterable graph classes. Eur. J. Comb. 56 (2016) 33-39.
http://dx.doi.org/10.1016/j.ejc.2016.02.007
McDiarmid, C. J. H., Mitsche, D. and Prałat, P.
Clique colouring of binomial random graphs. Preprint.
http://arxiv.org/pdf/1611.01782
McDiarmid, C. J. H., Mitsche, D. and Prałat, P.
Clique colourings of geometric graphs. Preprint.
http://arxiv.org/pdf/1701.02693
McDiarmid, C. J. H. and Przykucki, M.
On the purity of minor-closed classes of graphs. Preprint.
http://arxiv.org/pdf/1608.08623
McDiarmid, C. J. H. and Scott, A. D.
Random graphs from a block-stable class. Eur. J. Comb. 58 (2016) 96-106
http://dx.doi.org/10.1016/j.ejc.2016.05.005
McDiarmid, C. J. H., Scott, A. D. and Withers, P.
Uniform multicommodity flow in the hypercube with random edge capacities.
Random Struct. Algorithms 50 (2016) 437-463.
http://doi.org/10.1002/rsa.20672
http://arxiv.org/pdf/1406.4433
McDiarmid, C. J. H. and Skerman, F.
Modularity of tree-like and random regular graphs. Preprint.
http://arxiv.org/pdf/1606.09101
McDiarmid, C. J. H. and Wood, D. R.
Edge-Maximal Graphs on Surfaces. Preprint.
https://arxiv.org/pdf/1608.01496
McDiarmid, C. J. H.
[see: Hillebrand, A., Krivelevich, M.]
McDonough, T. P.
[see: Key, J. D.]
McDowell, A.
[see: Balister, P. N.,Balogh, J., Garbe, F.]
McGuinness, S.
[see: Brewster, R. C.]
McInroy, J. F.
Vahlen groups over commutative rings, Math. Zeit. 284 (2016) 901-917.
http://arxiv.org/pdf/1506.05624
McPhee, J. D., Mitchell, J. D. and Quick, M. R.
Automorphism groups of linearly ordered structures and endomorphisms of the
ordered set of rational numbers. Preprint..
http://arxiv.org/pdf/1607.03655
Medina, L. A.
[see: Castro, F. N.]
Meeks, K.
Randomised enumeration of small witnesses using a decision oracle. IPEC2016.
LIPICS Vol 63 (2017)
http://arxiv.org/pdf/1509.05572
Meeks, K. and Scott, A. D.
The parameterised complexity of list problems on graphs of bounded treewidth, Inf.
Comput. 251 (2016) 91-103.
http://doi.org/10.1016/j.ic.2016.08.001
http://people.maths.ox.ac.uk/scott/Papers/treewidthlist.pdf
Meeks, K. and Treglown, A.
On the complexity of finding and counting solution-free sets of integers. Preprint.
http://web.mat.bham.ac.uk/~treglowa/complexitysumfree27AT.pdf
Meeks, K.
[see: Bonamy, M., Enright, J., Jerrum, M. R.]
Meier, F.
[see: Goldberg, L. A.]
Melisourgos, T. and Spirakis, P. G.
Existence of Evolutionarily Stable Strategies Remains Hard to Decide for a Wide
Range of Payoff Values. Preprint.
http://arxiv.org/pdf/1702.05412
Meloni, S.
[see: Estrada, E.]
Menshikov, M.
[see: Georgiou, N.]
Mercas, R.
[see: Crochemore, M.]
Merker, M.
[see: Bowler, N.]
Méroueh, A. and Thomason, A. G.
List colourings of multipartite hypergraphs. Preprint.
http://arxiv.org/pdf/1704.07907.pdf
Mertzios, G. B.,, Nichterlein, A. and Niedermeier, R.
The Power of Data Reduction for Matching. Preprint.
http://arxiv.org/pdf/1609.08879
Mertzios, G. B.,, Nichterlein, A. and Niedermeier, R.
Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability
Graphs. Preprint.
http://arxiv.org/pdf/1703.05598
Mertzios, G. B., Nikoletseas, S., Raptopoulos, C. and Spirakis, P. G.
Determining majority in networks with local interactions and very small local
memory. Distributed Computing 30 (2017) 1-16.
http://community.dur.ac.uk/george.mertzios/papers/Conf/Conf_Majority-
Small_Memory.pdf
Mertzios, G. B., Shalom, M., Wong, P. W. H. and Zaks, S.
Online regenerator placement. Theory Comput. Sys., to appear.
http://community.dur.ac.uk/george.mertzios/papers/Jour/Jour_Online-Regenerator.pdf
Mertzios, G. B. and Spirakis, P. G.
Algorithms and almost tight results for 3-colorability of small diameter graphs.
Algorithmica 74 (2016) 385-414.
http://dx.doi.org/10.1007/s00453-014-9949-6
http://community.dur.ac.uk/george.mertzios/papers/Jour/Jour_Coloring-Small-
Diameter.pdf
Mertzios, G. B. and Unger, W.
The friendship problem on graphs. Multiple-Valued Logic and Soft Computing, 27
(2016) 275-285.
http://community.dur.ac.uk/george.mertzios/papers/Jour/Jour_Friendship-Problem.pdf
Mertzios, G. B.
[see: Akrida, E. C., van Bevern, R., Deligkas, A., Diaz, J., Felsner, S., Fluschnik, T.,
Foucaud, F., Giannopoulou, A. C.]
Meshulam, R.
[see: Bárány, I. ]
Mesyan, Z. and Mitchell, J. D.
The Structure of a Graph Inverse Semigroup. Semigroup Forum 93 (2016) 111-130.
http://dx.doi.org/10.1007/s00233-016-9793-x
http://arxiv.org/pdf/1409.4380
Mészáros, S.
[see: Girão, A.]
Meyerovitch., T., Perl, I., Tointon, M. and Yadin, A.
Polynomials and harmonic functions on discrete groups. Trans. Am. Math. Soc. 369
(2017) 2205-2229
https://doi.org/10.1090/tran/7050
http://www.ams.org/journals/tran/2017-369-03/S0002-9947-2016-07050-6/S0002-
9947-2016-07050-6.pdf
Michail, O. and Spirakis, P. G.
Simple and Efficient Local Codes for Distributed Stable Network
Construction. Distributed Computing 29 (2016) 207–237
http://dx.doi.org/10.1007/s00446-015-0257-4
http://arxiv.org/pdf/1309.6978
Mignosi, F.
[see: Crochemore, M.]
Mijaatović, A.
[see: Georgiou, N.]
Milanič, M.
[see: Hartinger, T. R.]
Miles, D..
[see: Duffy, K. R.]
Milićević, L.
[see: Leader, I. B.]
Miller, A.
[see: Codish, M.]
Miller, G.
[see: Ene, A.]
Miller, M. [see: Buset, D.]
Mitchell, J. D.
[see: Cameron, P. J., Craik, J., Donoven, C., East, J., Hyde, J. T., McPhee, J. D.,
Mesyan, Z.]
Mitsche, D. and Perarnau, G.
On the treewidth and related parameters of random geometric graphs. Submitted.
Mitsche, D. [see: Diaz, J., McDiarmid, C. J. H.]
Mixer, M.
[see: Cameron, P. J.]
Mnich, M.
[see: Ene, A.]
Moffatt, I. and Mphako-Banda, E.
Handle slides for delta-matroids. Eur. J. Comb. 59 (2017) 23-33
http://doi.org/10.1016/j.ejc.2016.07.002
http://arxiv.org/pdf/1510.07224v2
Moffatt, I. and Smith, B.
Matroidal frameworks for topological Tutte polynomials. Preprint.
Moffatt, I.
[see: Chun, C., Ellis-Monaghan, J. A., Garoufalidis, S.]
Mohajeri, O.
[see: Kharlampovich, O.,]
Moharrad, H. N.
[see: Lin, A.]
Molla, T.
[see: Balogh, J.]
Molter, H.
[see: van Bevern, R.]
Monnot, J.
[see: AbouEisha, H.]
Monod, H.
[see: Bailey, R. A.]
Montgomery, R.
Hamiltonicity in random graphs is born resilient. Preprint.
Montgomery, R.
Spanning trees in random graphs. Preprint.
Montgomery, R.
Fractional Clique Decompositions of Dense Partite Graphs. Combin. Probab.
Comput., to appear.
http://arxiv.org/pdf/1603.01039
Montgomery, R.
[see: Balogh, J., Liu, H.]
Moore, B.
[see: Brewster, R. C.]
Morayne, M.
[see: Balister, P. N.]
Moreno, Y.
[see: Estrada, E.]
Morgan, K.
[see: Cameron, P. J.]
Morris, R. D.
[see: Ahlberg, D., Allen, P., Balister, P. N., Balogh, J., Bollobás, B., Green, B. J.]
Morrison, N., Noel, J. A. and Scott, A. D.
Saturation in the Hypercube and Bootstrap Percolation. Combin. Probab. Comput. 26
(2017) 78--98.
https://doi.org/10.1017/S0963548316000122
http://people.maths.ox.ac.uk/scott/Papers/cubesat.pdf
Morrison, N., and Scott, A. D.
Maximising the number of induced cycles in a graph. J. Comb. Theory, Ser. B, to
appear.
http://people.maths.ox.ac.uk/morrison/induced.pdf
Mörters, P.
[see: Dereich, S., Jacob, E., Mailler, C.]
Moulton, V. , Oldham, J. and Wu, T.
A cubic-time algorithm for computing the trinet distance between level-1 networks.
Inf. Process. Lett 123 (2017) 36-41.
http://doi.org/10.1016/j.ipl.2017.03.002
https://arxiv.org/pdf/1703.05097
Moulton, V.
[see: Bastowski, S., Dress, A., Fischer, M., Francis, A., Huber, K. T., van Iersel, L.]
Mourtos, I.
[see: Cechlárová, K.]
Mphako-Banda, E.
[see: Moffatt, I.]
Mrazović, R.
A random model for the Paley graph. Q. J. Math. 68 (2017) 193-206.
https://doi.org/10.1093/qmath/haw037
http://arxiv.org/pdf/1603.00684
Mrazović, R.
Extractors in Paley graphs: a random model. Eur. J. Comb. 54 (2016) 154-162.
http://doi.org/10.1016/j.ejc.2015.12.009
http://arxiv.org/pdf/1510.05998
Mubayi, D.
[see: Lenz, J.]
Mullen, G. L.
[see: Davis, J. A.]
Müller, H.
[see: Adler, I.]
Müller, T.
[see: Fountoulakis, N.]
Müller, T. W.
[see: Krattenhaler, C.]
Münch, F.
[see: Liu, S.]
Murota, K.
[see: Iwamasa, Y.]
Murphy, B., Petridis, G., Roche-Newton, O.,, Rudnev, M. and Shkredov, I. D.
New results on sum-product type growth over fields. Preprint.
http://arxiv.org/pdf/1702.01003
Murphy, B., Roche-Newton, O. and Shkredov, I. D.
Variations on the sum-product problem II. Preprint.
http://arxiv.org/pdf/1703.09549
Murphy, B..
[see: Aksoy Yazici, E.]
Mütze, T.
[see: Chen, T. Z. Q.]
Mwesige, F. and Truss, J. K.
Finitely coloured ordinals. Annals of Pure and Applied Logic, to appear.
http://www1.maths.leeds.ac.uk/~pmtjkt/feres3.pdf
Mycroft, R. and Naia, T.
Unavoidable trees in tournaments. Preprint.
http://arxiv.org/pdf/1609.03393
Mycroft, R. [see: Allen, P., Balogh, J., Cooley, O., Garbe, F., Lenz, J., Martin, R., R.]
Nagel, L.
[see: Berenbrink, P., Brinkmann, A.]
Naia, T.
[seeL Mycroft, R.]
Nailk, S.
[see: Duffy, K. R.]
Nakashima, Y.
[see: Badkobeh, G.]
Narayanan, B. P.
Connections in randomly oriented graphs. Combin. Probab. Comput., to appear.
https://www.dpmms.cam.ac.uk/~bp338/pdf/connections.pdf
Narayanan, B. P., Sahasrabudhe, J. and Tomon, I.
The multiplication table problem for bipartite graphs. Combinatorica (2016)
http://dx.doi.org/10.1007/s00493-016-3322-0
https://www.dpmms.cam.ac.uk/~bp338/pdf/bipartite_mult.pdf
Narayanan, B. P., Sahasrabudhe, J. and Tomon, I.
Ramsey graphs induce subgraphs of many different size. Preprint.
https://www.dpmms.cam.ac.uk/~bp338/pdf/ramsey_sizes.pdf
Narayanan, B. P. and Tomon, I.
Induced subgraphs with many distinct degrees. Preprint.
https://www.dpmms.cam.ac.uk/~bp338/pdf/distinct_degrees.pdf
Narayanan, B. P.
[see: Aru, J.,. Balister, P. N., Balogh, J., Ellis, D., Long, J.]
Naserasr, R.
[see: Foucaud, F.]
Naszódi, M., Pach, J. and Swanepoel, K.
Arrangements of homothets of a convex body. Preprint.
https://arxiv.org/pdf/1608.04639
Naszódi, M., Pach, J. and Swanepoel, K.
Sphere-of-influence graphs in normed spaces. Preprint.
http://arxiv.org/pdf/1605.01872.pdf
Navaridas, J.
[see: Erickson, A.]
Nazarov, M. and Sklyanin, E.
Cherednik operators and Ruijsenaars-Schneider model at infinity. Preprint.
https://arxiv.org/pdf/1703.02794
Ndojh Ndiaye, S.
[see: McCreesh, C.]
Nenadov, R.
[see: Conlon, D.]
Nevo, E.
[see: Bárány, I.]
Nguyen, H. L.
[see: Barbosa, R.., Ene. A. ]
Nichterlein, A.
[see: Fluschnik, T., Froese, A., Mertzios, G. B.]
Niedermeier, R.
[see: Fischer, F. Fluschnik, T., Froese, A., Mertzios, G. B.]
Nikoletseas, S., Raptopoulos, C. L. and Spirakis, P. G.
On the Chromatic Number of Non-Sparse Random Intersection Graphs. Theory
Comput. Syst. 60 (2017) 112-127.
http://dx.doi.org/10.1007/s00224-016-9733-x
Nikoletseas, S.
[see: Mertzios, G. B.]
Nill, B.
[see: Balletti, G., Kasprzyk, A. M.]
Nilson, T.
[see: Cameron, P. J.]
Nixon, A.
[see: Eftekhari, Y., Jackson, B.]
Noble, S. D.
[see: Chun, C., Funk, D., Goodall, A. J.]
Noel, J. A., Scott, A. D. and Sudakov, B.
Supersaturation in Posets and Applications Involving the Container Method. Preprint.
http://arxiv.org/pdf/1610.01521
Noel, J. A.
[see: Brewster, R. C., Cooper, J. W., Dvořák, Z., Morrison, N.]
Noferini, V.
[see: Arrigo, F.]
Norin, S. and Yepremyan, L.
Turán number of generalized triangles. J. Comb. Theory Ser. A, 146 (2017)
312-343.
http://doi.org/10.1016/j.jcta.2016.09.003
http://arxiv.org/pdf/1501.01913
Norin, S.
[see: Csóka, E., Hladký, J.]
Nugent, P.
[see: Bevan, D.]
Nussbaum, R.
[see: Lemmens, B.]
O,, S.
[see: Jahanbekan, S.]
Ocel’akova, E.
[see: Cechlárová, K.]
O’Dea, R.
[see: Crofts, J. J.]
O’Donovan, W.
[see: Gianelli, E.]
Offner, D.
[see: Axenovich, M.]
Ok, S.
[see: Kim, J.]
Olde Daalhuis, A
[see: Haug, N.]
Oldham, J.
[see: van Iersel, L., Moulton, V.]
Ollis, M. A.
[see: Anderson, I.]
Olver, N.
[see: Amini, O.]
Opršal J.
[see: Dalmau, V.]
Östergård, P. R. J. and Soicher, L. H.
There is No McLaughlin Geometry. Preprint.
http://arxiv.org/pdf/1607.03372.pdf
Osthus, D. [see: Barber, B.,. Csaba, B., Glock, S., Joos, F., Kim, J., Kühn, D.]
Oukanine, J., Pouly, A., Sousa-Pinto, J. and Worrell, J.
Solvability of Matrix-Exponential Equations. LICS '16 798-806.
http://doi.org/10.1145/2933575.2934538
http://arxiv.org/pdf/1601.05002
Oum, S.-I.
[see: Brignall, R.]
Owen, J. C.
[see: Jackson, B.]
Oxley, J. G.
[see: Chun, C.]
Pach, J.
[see: Kupavskii, A., Naszódi, M.]
Pacheco, M. F.
[see: Cardoso, D. M.]
Pachocki, J.
[see: Ene, A.]
Paget, R. E. and Wildon, M. R.
Generalized Foulkes modules and maximal and minimal constituents of plethysms of
Schur functions. Preprint.
http://arxiv.org/pdf/1608.04018
Pajak, D.
[see: Czyzowicz, J., Ivaskovic, A., Klasing, R.]
Palacios, J. L. and Quiroz, D.
Birth and Death chains on finite trees: computing their stationary distribution and
hitting times. Methodology and Computing in Applied Probability 18 (2016) 487-498.
eprints.lse.ac.uk/66937/
Palmowski, K. F.
[see: Hogben, L.]
Pálvölgyi, D.
All or Nothing Caching Games with Bounded Queries. Preprint.
http://arxiv.org/pdf/1702.00635.pdf
Pálvölgyi, D.
Weak embeddings of posets to the Boolean lattice. Preprint.
http://arxiv.org/pdf/1606.08226.pdf
Pálvölgyi, D.
[see: Fulek, R., Gerbner, D., Keszegh, B.]
Panagiotou, K., Stuffer, B. and Weller, K.
Scaling limits of random graphs from subcritical classes. Ann. Probab. 44 (2016)
3291-3334.
http://dx.doi.org/10.1214/15-AOP1048
https://arxiv.org/pdf/1411.1865
Panagiotou, K.
[see: Fountoulakis, N., Goldberg, L. A., Krivelevich, M.]
Pantea, C.
[see: Banaji, M.]
Pantone, J.
[see: Bevan, D.]
Parkes, D. C.
[see: Dütting, P]
Parreau, A.
[see: Foucaud, F.]
Pascual, J. A.
[see: Erickson, A.]
Patel, V.
[see: Johnson, M., Kühn, D.]
Paterson, M. B. and Stinson, D. R.
Combinatorial Characterizations of Algebraic Manipulation Detection Codes
Involving Generalized Difference Families. Discrete Math.339 (2016) 2891-2906.
http://doi.org/10.1016/j.disc.2016.06.004
http://arxiv.org/pdf/1506.02711
Paterson, M. B.
[see: Blackburn, S. R., Huczynska, S., Laing, T.]
Patkós, B. [see: Gerbner, D.]
Pattni, K.
[see: Broom, M.]
Paulusma, D.
Open problems on graph coloring for special graph classes, WG 2015. Lect. Notes
Comput. Sci., to appear.
Paulusma, D., Picoleau, C. and Ries, B.
Reducing the clique and chromatic number via edge contractions and vertex deletions
ISCO 2016. Lect. Notes. Comput. Sci, 9849 (2016) 38-49.
http://dx.doi.org/10.1007/978-3-319-45587-7_4
Paulusma, D., Picoleau, C. and Ries, B.
Blocking Independent Sets for H-Free Graphs via Edge Contractions and Vertex
Deletions. TAMC 2017: 470-483.
http://dx.doi.org/10.1007/978-3-319-55911-7_34
Paulusma, D., Slivovsky, F. and Szeider, S.
Model counting for CNF formulas of bounded modular treewidth. Algorithmica 76
(2016) 168-194.
http://dx.doi.org/10.1007/s00453-015-0030-x
https://community.dur.ac.uk/daniel.paulusma/Papers/Submitted/mtw.pdf
Paulusma, D.
[see: Biró, P., Blanché, A., Bonsma, P., Brandstädt, A , Cochefort, M., Dąbrowski, K.
K., Golovach, P. A., Hartinger, T. R., Johnson, M., Kamiński, M. ]
Pearcy, N.
[see: Chuzhanova, N.]
Pebody, L.
Proof of a Conjecture of Kleinberg-Sawin-Speyer. Preprint.
http://arxiv.org/pdf/1608.05740
Pebody, L.
Set Reconstruction on the Hypercube. Preprint.
http://arxiv.org/pdf/1607.05675
Pebody, L.
[see: Cutler, J.]
Pegden, W.
[see: Cooper, C., Frieze, A. M.]
Peng, P.
[see: Czumaj, A.]
Penrose, M. D.
[see: Daniels, C., Krivelevich, M. ]
Perarnau, G. and Perkins, W.
Counting independent sets in cubic graphs of given girth. Preprint
http://arxiv.org/pdf/1611.01474
Perarnau, G. and Reed, B. A. Existence of spanning F-free subgraphs with large minimum degree. Combin. Probab.
Comput., to appear.
http://arxiv.org/pdf/1404.7764v1.pdf.
Perarnau, G. and Serra, O. Correlation among runners and some results on the Lonely Runner Conjecture.
Electron. J. Comb. 23 (2016) P1.50
http://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i1p50
Perarnau, G.
[see:: Cai, X,-S,, Chapuy, G., Diaz, J., Fountoulakis, N., Joos, F., Mitsche, D.]
Peres, Y., Sauerwald, T., Sousi, P. and Stauffer, A.
Intersection and mixing times for reversible chains. Electron. J. Probab. 22 (2017)
article 12.
http://dx.doi.org/10.1214/16-EJP18
http://arxiv.org/pdf/1412.8458
Péresse, Y. H.
[see: Cameron, P. J., Hyde, J. T.]
Pérez-Rosés, H.
[see; Buset, D.]
Perkins, S.
[see: Jones, S. K.]
Perkins, W.
Birthday Inequalities, Repulsion, and Hard Spheres. Proc. Amer. Math. Soc 144
(2016) 2635-2649
http://dx.doi.org/10.1090/proc/13028
http://willperkins.org/BirthdayRepulsionHardSpheres.pdf
Perkins, W.
[see: Cohen, E.,. Coja-Oghlan, A.. Davies, E.., Florescu, L., Perarnau, G. ]
Perl, I.,
[see: Meyerovitch., T.]
Person, Y.
[see: Allen, P., Fox, J.]
Petridis, G.
[see: Murphy, B.]
Peyerimhoff, N.
[see: Bourne, D., Cushing, D., Liu, S.]
Pfeiffer, M.
[see: Awang, J., Cain, A. J., Jefferson, C.]
Pfender, F.
[see: Balogh, J..]
Pfister, P.
[see: Goldberg, L. A.]
Picoleau, C.
[see: Paulusma, D. ]
Piguet, D.
[see: Hladký, J..]
Pikhurko, O. and Razbarov, A. A.
Asymptotic structure of graphs with the minimum number of triangles. Combin.
Probab. Comput. 26 (2017) 138-160.
https://doi.org/10.1017/S0963548316000110
http://arxiv.org/pdf/1204.2846
Pikhurko, O. . Staden, K. and Zilma, Y.
The Erdos-Rothschild problem on edge-colourings with forbidden monochromatic
cliques. Math. Proc. Camb. Philos. Soc , to appear.
http://arxiv.org/pdf/1605.05074
Pikhurko, O., and Zilma, Y.
Supersaturation Problem for Color-Critical Graphs. J. Comb. Theory. Ser B 123
(2017) 148-185.
http://doi.org/10.1016/j.jctb.2016.12.001
https://homepages.warwick.ac.uk/~maskat/Papers/supersat.pdf
Pikhurko, O.
[see: Balogh, J., Banakh, T., Csóka, E., DeCorte, E., Grabowski, Ŀ.]
Pilipczuk, M.
[see: Ene, A., van den Heuvel, J.]
Pinsker, M.
[see: Bodirsky, M.]
Pinto, T.
[see: Johnson, J. R.]
Pissis S. P.,
[see; Crochemore, M.]
Pitz, M. [see: Bowler, N.]
Plaut,B.
[see: Dickerson, J. P.]
Poettering, B.
[see: Crampton, J.]
Pokrovskiy, A.
Calculating Ramsey numbers by partitioning coloured graphs. J. Graph Theory 94
(2016) 477-500.
http://dx.doi.org/10.1002/jgt.22036
http://arxiv.org/pdf/1309.3952
Pongrácz, A.
[see: Bodirsky, M.]
Popa, I.-L.
[see: Bagdasar, O. D.]
Popielarz, K.
[see: Girão, A.]
Pór, A.
[see: Bárány, I.]
Porter, M. A.
[see: Cucuringu, J., Gleeson, J. P., Howison, S. D., Juul, J. S.]
Postle, L.
[see: Bowler, N.]
Potapov, I. and Semukhin, P.
Decidability of the Membership Problem for 2×2 integer matrices. SODA17 170-
186.
http://dx.doi.org/10.1137/1.9781611974782.12
https://arxiv.org/pdf/1604.02303 .
Potapov, I.
[see: Bell, P. C., Ko, S.-K.]
Pouly, A.
[see: Oukanine, J.]
Powell, R.
[see: Cohen, D. A.]
Power, S. C. The mechanical modes of a 2-periodic triangulated surface. Preprint.
http://arxiv.org/pdf/1609.01275
Power, S. C.
[see: Cruickshank, J.]
Praeger, C. E.
[see: Gill, N., Gillespie, N. I.]
Prałat, P.
[see: Bal, D., McDiarmid, C. J. H.]
Preece, D. A.
[see: Anderson, I.]
Prellberg, T.
[see: Haug, N.,]
Prendiville, S.
Quantitative bounds in the polynomial Szemerédi theorem: the homogeneous case.
Discrete Anal. 2017 (5)
http://dx.doi.org/10.19086/da.1282
Prendiville, S.
[see: Browing, T. D. ]
Prieur-Gaston, E.
[see: Daykin, J. W.]
Prince, T.
[see: Kasprzyk, A. M.]
Prosser, P.
[see: McCreesh, C.]
Protaso, I.
[see: Banakh, T.]
Przykucki, M.
[see: Goldschmidt, C., McDiarmid, C. J. H.]
Psomas, C.
[see: Archdeacon, D. S., Griggs, T. S.]
Pszczola, K.
[see: Banakh, T.]
Pudwell, L
[see: Bevan, D.]
Puglisi, S. J.,
[see: Badkobeh, G.]
Puleo, G. J. [see: Edwards, K.]
Puljiz, M.
[see: Haslegrave, J. ]
Pyatkin, A.
[see: Glen, M.]
Quick, M. R.
[see: McPhee, J. D.]
Quiroz, D.
Colouring exact distance graphs of chordal graph. Preprint.
http://arxiv.org/pdf/1703.07008
Quiroz, D..
[see: van den Heuvel, J.]
Rabinovich, R.
[see: van den Heuvel, J.]
Radoszewski, J.
[see: Crochemore, M.]
Radovanovic, M., Trotignon, N. and Vušković, K.
The (theta, wheel)-free graphs Part II: structure theorem. Preprint.
http://arxiv.org/pdf/1703.08675.pdf
Radovanović, M.,
[see: Adler, I.,. Boncompagni, V.]
Radzik, T.
[see: Cooper, C.]
Rahman, M. S.
[see: Alatabbi, A.]
Rainmondi, F.
[see: Chen, T.]
Rajchgot, J.
[see: Fink, A.]
Rajkumar, R.
[see: Devi, P.]
Ramanathan, R.
[see: Gnaciński, P,]
Ramirez, J.
[see: Barrantes, D.]
Randazzo, L.
[see: Bettinelli, J.]
Rao, M.
[see: Badkobeh, G.]
Ras, C, Swanepoel, K. J. and Thomas, D.
Approximate Euclidean Steiner Trees. Journal of Optimization Theory and
Applications 172 (2017) 845–873.
http://dx.doi.org/10.1007/s10957-016-1036-5
http://arxiv.org/pdf/1605.01172
Rastegari, B. [see: Cechlárová, K., Goldberg, P. W.]
Rautenbach, D. [see: Henning, M. A., Joos, F.]
Rattan, A.
[see: Briand, E., Irving, J.]
Razbarov, A. A.
[see: Pikhurko, O.]
Razgon, I.
[see: Lozin, V. V.]
Reed, B. A.
[see: Cai, X-S., Joos, F., Perarnau, G.]
Rees, S. E.
[see: Holt, D. F.]
Reidl, F.
[see: Gutin, G.]
Reiher, C.
[see: Balogh, J.]
Reilly, C.
[see: Hoffmann, R.]
Reitzner, M.
[see: Bárány, I.]
Remmel, J.
[see: Kitaev, S.]
Richard, A.
[see: Fauchon, A., Gadouleau, M.]
Richerby, D.
[see: Bulatov, A., Diaz, J., Dyer, M. E., Galanis, A., Göbel, A.]
Riehl, M.
[see: Bevan, D.]
Ries, B.
[see: AbouEisha, H., Paulusma, D.]
Rincón, E. F.
[see: Maclagan, D.]
Riordan, O. M.
[see: Ashford, M., Bollobás, B.]
Risteski, A.
[see: Ene, A.]
Rivera, N.
[see: Cooper, C.,]
Roberson, D. E.
Homomorphisms of Strongly Regular Graphs. Electron. Notes Discrete Math. 54
(2016) 271-276.
https://doi.org/10.1016/j.endm.2016.09.047
http://arxiv.org/pdf/1601.00969
Roberson, D. E.
[see: Acin, A., Atserias, A., Dairyko, M. Godsil, C. D., Hogben, L.,. Mancinska, L.]
Roberts, A. and Scott, A. D.
Stability results for graphs with a critical edge. Preprint.
https://people.maths.ox.ac.uk/scott/Papers/stability.pdf
Roberts, B.
Ramsey Numbers of Connected Clique Matchings. Electron. J. Comb. 24 (2017)
P1.36
http://www.combinatorics.org/ojs/index.php/eljc/article/view/v24i1p36/pdf
Roberts, B.
Partite saturation problems. J. Graph Theory 85 (2017) 429-445.
http://dx.doi.org/10.1002/jgt.22071
http://arxiv.org/pdf/1506.02445
Roberts, B.
[see: Allen, P., Davies, E.]
Roberts, K.
[see: Cuypers, H.]
Roberts, M. I.
The probability of unusually large components in the near-critical Erdős-Rényi graph.
Preprint.
http://arxiv.org/pdf/1610.05485.pdf
Roberts, M. I. and Sengul, B.
Exceptional times of the critical dynamical Erdős-Rényi graph. Preprint.
http://arxiv.org/pdf/1610.06000.pdf
Roberts, M. I.
[see: Addario-Berry, L]
Robshaw, M. J. B.
[see: Blackburn, S. R.]
Rochet, P.
[see: Giscard, P.-L,]
Roche-Newton, O.
[see: Murphy, B.]
Rödl, V. [see: Conlon. D.]
Rolinek, M.
[see: Kolmogorov, V.]
Rombach, M. P
[see: Atkins, R.. Cucuringu, J]
Roney-Dougal, C. M.
[see: Cameron, P. J.]
Rooney, B.
[see: Godsil, C. D.]
Rosas, M.
[see: Briand, E.]
Rosicka, M.
[see: Gnaciński, P,]
Ross, G.
[see: Estrada, E.]
Rossi, F.
[see: Giandomenico, M.]
Roughgarden, T.
[see: Collini-Baldeschi, R.]
Röver, C. M.
[see: Holt, D. F.]
Rowlinson, P.
On graphs with just three distinct eigenvalues, Linear Algebra Appl. 507 (2016)
462-473.
http://doi.org/10.1016/j.laa.2016.06.031
http://hdl.handle.net/1893/23940
Rowlinson, P.
More on graphs with just three distinct eigenvalues. Appl. Anal. Discrete Math, to
appear.
http://dx.doi.org/10.2298/AADM161111033R
Royle, G. F.
[see: Araújo, J.]
Rudnev, M.
On the number of incidences between planes and points in three dimensions. Preprint.
http://de.arxiv.org/pdf/1407.0426.pdf
Rudnev, M. and Selig, J. M.
On the use of Klein quadric for geometric incidence problems in two dimensions.
SIAM J. Discrete Math. 30 (2016) 934-954.
http://dx.doi.org/10.1137/16M1059412
http://de.arxiv.org/pdf/1412.2909.pdf
Rudnev, M., Shkredov, I. D. and Stevens, S.
On The Energy Variant of the Sum-Product Conjecture. Preprint.
http://arxiv.org/pdf/1607.05053
Rudnev, M.
[see: Aksoy Yazici, E., Gill, N., Iosevich, A. Lev, V. S., Murphy, B.]
Rueckriemen, R. D.
[see; Chun, C.]
Ruškuc, N.
[see: Awang, J.,.Bourne, T., Craik, J. , Gould, V., Huczynska, S.,]
Rybarczyk, K. and Stark, D. S.
Poisson approximation of counts of subgraphs in random intersection graphs. Discrete
Math., to appear.
http://arxiv.org/pdf/1609.01699
Rytter, W.
[see: Crochemore, M.]
Saad, A. and Wolf, J.
Ramsey multiplicity of linear patterns in certain finite abelian groups. Q. J. Math. 68
(2017) 125-140.
http://dx.doi.org/10.1093/qmath/haw011
http://www.juliawolf.org/research/preprints/burrrostaweb.pdf
Sach, B.
[see: Clifford, R.]
Sahasrabudhe, J.
[see: Narayanan, B. P.]
Sainz, A. B.
[see: Acín, A.]
Salgado, E.
[see: Cohen-Addad, V.,]
Šámal, R.
[see: Atserias, A., Godsil, C. D.]
Samotij, W.
[see: Balogh, J.]
Sanders, T.
[see: Green, B. J.]
Sanhueza-Matamala, N. [see: Han, J.]
Samdholm, T.
[see: Dickerson, J. P.]
Dos Santos Souza, U.
[see: Alves, S. R.]
Sasse, T.
[see: Henning, M. A.]
Sau, I.
[see: Alves, S. R.]
Sauerwald, T.
[see: Bringmann K., Cai, L., Ivaskovic, A., Kanade, V., Klasing, R., Peres, Y. ]
Savani, R.
[see: Aziz, H., Czumaj, A., Deligkas, A. ]
Saxton, D. and Thomason, A. G.
Online containers for hypergrasphs, with applications to linear equations.
J. Comb. Theory Ser. B. 121 (2016) 248-283.
http://dx.doi.org/10.1016/j.jctb.2016.05.011
http://arxiv.org/pdf/1611.01433
Scarlett, J. [see: Aldridge, M.]
Schacht, M.
[see: Balogh, J]
Schaefer, A.
[see: Araújo, J.]
Schaudt, O.
[see: Bruhn, H.]
Schicho. J.
[see: Lin, A.]
Scholz, G. E.
[see: Huber, K. T.]
Schneider, R.
[see: Bárány, I.]
Schroder, Z.
[see: McCourt, T. A.]
Schroll, S.
[see: Green, E. L.]
Schulze, B.
[see: Eftekhari, Y., Fowler, P., Kaszanitzky, V., Kitson, D..]
Scott, A. D. and Seymour, P. D.
Induced subgraphs of graphs with large chromatic number. I. Odd holes, J. Comb.
Theory Ser B. 121 (2016) 68-84.
http://doi.org/10.1016/j.jctb.2015.10.002
https://people.maths.ox.ac.uk/scott/Papers/oddholes.pdf
Scott, A. D. and Seymour, P. D.
Induced subgraphs of graphs with large chromatic number. VI. Banana trees. Preprint.
https://people.maths.ox.ac.uk/scott/Papers/bananatrees.pdf
Scott, A. D. and Seymour, P. D.
Induced subgraphs of graphs with large chromatic number. VII. Gyárfás'
complementation conjecture. Preprint.
https://people.maths.ox.ac.uk/scott/Papers/complementation.pdf
Induced subgraphs of graphs with large chromatic number. IX. Rainbow paths.
Preprint.
https://people.maths.ox.ac.uk/scott/Papers/rainbowpaths.pdf
Scott, A. D. and Seymour, P. D.
Induced subgraphs of graphs with large chromatic number. X. Holes with specific
residue. Preprint.
https://people.maths.ox.ac.uk/scott/Papers/residues.pdf
Scott, A. D.
[see: Aru, J.,. Bollobás, B, Chudnovsky, M., Guggiari, H., Haxell, P. E., Jeavons, P..,
McDiarmid, C. J. H.,. Meeks, K., Morrison, N. Noel, J. A., Roberts, A.]
Selig, J. M.
[see; Rudnev, M.]
Selig, T.
[see: Dukes, W. M. B.]
Sellwood. A.
[see: Crampton, J.,]
Semeraro, J.
[see: Cameron, P. J., Gill, N., Gunderson,, K.]
Semple, C.
[see: Bordewich, M.]
Semukhin, P.
[see: Potapov, I.]
Sengul, B.
[see: Roberts, M. I.]
Sepulveda, L. B.
[see: Castro, F. N.]
Sereni, J.-S. [see: Edwards, K.]
Serna, M. [see: Diaz, J.]
Serra, O.
[see: Foucaud, F., Perarnau, G.]
Severini, S.
[see: Atserias, A., Banchi, L., Dairyko, M., Dawar, A. Duan, R., Gnaciński, P.,
Godsil, C. D., Hogben, L., Lockhart, J.]
Seymour, P. D.
[see: Chudnovsky, M., Scott, A.. D.]
Shaat, A.
[see: Barki, H.]
Shalom, M.
[see: Mertzios, G. B.]
Sharifzadeh, M.
[see: Balogh, J., Kim, J., Liu, H.]
Sheerin, M.
[see: Estrada, E.]
Sheng, B.
[see: Gutin, G.]
Shiraga, T. [see: Cooper, C.]
Shkredov, I. D. [see: Aksoy Yazici, E. Murphy, B., Rudnev, M.]
Shpilrain, V.
[see: Bromberg, L.]
Siantos, Y.
[see: Cooper, C.]
Sidford, A.
[see: Ene, A.]
Siebertz, S.
[see: van den Heuvel, J.]
da Silva, M. G.
[see: Cameron, K.]
Silver, G.
[see: Estrada, E]
Simonovits, M.
[see: Balogh, J.. Hladký, J.]
Simpson, J.
[see: Alatabbi, A.]
Sinclair, A.
[see: Caputo, P.]
Širáň, J.
[see: Conder, M. E.., Erskine, G., Griggs, T. S.]
Sisto, A.
[see: Behrstock, J.]
Siudern, G.
[see: Haug, N.]
Skerman, F.
[see: Atkins, R., McDiarmid, C. J. H.]
Sklyanin, E. K.
[see: Nazarov, M. L.]
Skokan, J.
[see: Allen, P., Jenssen, M., Martin, R. R.]
Škorić, R.
[see: Conlon, D.]
Skubch, K.
[see: Coja-Oghlan, A..]
Sliačan, J. and Stromquist, W.
Improving bounds on packing densities of 4-point permutations. Preprint.
http://arxiv.org/pdf/1704.02959.pdf
Sliačan, J.
[see: Brignall, R.]
Slivovsky, F.
[see: Paulusma, D.]
Smith, B.
[see: Moffatt, I.]
Smith, P.
[see: Bollobás, B.]
Smith, S. G. Z.
[see: Girão, A.]
Smriglio, S.
[see: Giandomenico, M.]
Smyth, W. F.
[see: Alatabbi, A.]
Snyder, R.
[see: Letzter, S.]
Sohler, C.
[see: Czumaj, A.]
Soicher, L .H.
The uniqueness of a distance-regular graph with intersection array
{32,27,8,1;1,4,27,32} and related results, Des. Codes Cryptography., to appear.
http://arxiv.org/pdf/1512.05976
Soicher, L. H.
[see: Greaves, G., Linek, V., Östergård, P. R. J.]
Sokal, A. D.
[see: Fallat, S.]
Solé, P.
[see: Cameron, P. J.]
Solnon, C.
[see: Kotthoff, L]
Solymosi, J. [see: Bárány, I.]
Somnon, C.
[see: McCreesh, C.]
Song, J.
[see: Golovach, P. A.]
Sorge, M.
[see: van Bevern, R.]
Sorkin, G. B.
[see: Frieze, A. M.]
Sousa-Pinto, J.
[see: Oukanine, J.]
Sousi, P.
[see: Peres, Y. ]
Speyer, D. E.
[see: Fink, A.]
Speyer, L.
[see: Fayers, M.]
Spiga, P.
[see: Gill,N.]
Spillner, A.
[see: Bastowski, S., Dress, A.]
Spink, H.
[see: David, S.]
Spirakis, P. G.
[see: Akrida, E. C., Deligkas, A., Lamprou, I., Melisourgos, T., Mertzios, G. B.,
Michail, O.., Nikoletseas, S.]
Spirkl, S.
[see: Chudnovsky, M.]
Stacho, J.
[see: Atminas, A.]
Staden, K. and Treglown, A.
On degree sequences forcing the square of a Hamilton cycle. SIAM J. Discrete Math.
31(2017) 383-437.
http://dx.doi.org/10.1137/15M1033101
http://klstaden.site11.com/docs/squarehamFINAL.pdf
Staden, K.
[see: Hancock, R., Kim, J., Kühn, D., Liu, H., Pikhurko, O.]
Starchenko, S. [see: Aschenbrenner M.]
Starkovskaya, T.
[see: Clifford, R.]
Stark, D. S.
Bin sizes in time-inhomogeneous infinite Polya processes. Stat. Probab. Lett. 113
(2016) 49-53.
http://doi.org/10.1016/j.spl.2016.02.010
Stark, D. S. and Wormald, N. C.
The probability of nonexistence of a subgraph in a moderately sparse random graph.
Preprint.
http://arxiv.org/pdf/1608.05193
Stark, D. S.
[see: Rybarczyk, K. ]
Stauffer, A.
A Lyapunov function for Glauber dynamics on lattice triangulations. Probab. Theory
Relat. Fields (2016) 1-53.
http://dx.doi.org/10.1007/s00440-016-0735-z
http://arxiv.org/pdf/1504.07980
Stauffer, A.
[see: Bringmann, K., Cannon, S., Caputo, P., Gracar, P., Peres, Y.]
Stavropoulos, K.
[see: Bowler, N.]
Steel, M.
[see: Huber, K. T.]
Štefankovič, D.
[see: Bezakova, I., Cai, J.-Y, Galanis, A.]
Stein, M. J.
[see: Allen, P., Hladký, J..]
Steingrímsson, E.
[see: Dugan, W.]
Stevens, B.
[see: Linek, V.]
Stevens, S. and de Zeeuw, F.
An Improved Point-Line Incidence Bound Over Arbitrary Fields. Preprint.
http://arxiv.org/pdf/1609.06284.pdf
Stevens, S.
[see: Rudnev, M.]
Stewart, A.
[see: Cochefort, M., Golovach, P. A., Kamiński, M.,]
Stewart, I. A.
Sufficient conditions for Hamiltonicity in multiswapped networks. Journal of Parallel
and Distributed Computing 101 (2017) 17-26.
http://dx.doi.org/10.1016/j.jpdc.2016.10.015
https://community.dur.ac.uk/i.a.stewart/Papers/HamInMsns.pdf
Stewart, I. A.
On the combinatorial design of data centre network topologies. Preprint.
https://community.dur.ac.uk/i.a.stewart/Papers/CombDesOfDCNTops.pdf
Stewart, I. A.
[see: Erickson, A., Golovach, P. A.]
Stewart, L.
[see: Enright, J.]
Stinson, D. R.
[see: Laing, T., Paterson, M. B.]
Strauss, D.
[see: Hindman, N.]
Strömberg, J.
[see: Moffatt, I.]
Stromquist, W.
[see: Sliačan, J. ]
Stuffer, B.
[see: Panagiotou, K.]
Suchy, O.
[see: van Bevern, R.]
Sudakov, B.
[see: Balla, I., Conlon, D., Ferber, A., Noel, J. A]
Sugimoto, S.
[see: Badkobeh, G.]
Sulzbach, H.
On martingale tail sums for the path length in random trees. Random Struct.
Algorithms 50 (2017) 493-508.
http://dx.doi.org/10.1002/rsa.20674
http://arxiv.org/pdf/1412.3508
Sulzbach, H.
[see: Devroye, L., Kabluchko, Z., Kuba, H.]
Sun, B. Y.
[see: Chen, T. Z. Q.]
Sun, H.,
[see: Bringmann, K.]
Swanepoel, K. J.
Combinatorial distance geometry in normed spaces. Preprint.
http://arxiv.org/pdf/1702.00066
Swanepoel, K. J.
[see: Lin, A., Naszódi, M., Ras, C.]
de Swart, E.
[see: van Iersel, L.]
Szabó, Cs.
[see: Bodor, B.]
Szeider, S.
[see: Paulusma, D.]
Szemerédi, E.
[see: Hladký, J.]
Szrewder, B.
[see: Crochemore,. M.]
Taam, A.
[see: Kharlampovich, O.,]
Talbot, J. M.
[see: Axenovich, M.]
Talgam-Cohen, I.
[see: Englert, M.]
Talmon, N.
[see: Fluschnik, T.]
Talwar, K.
[see: Englert, M.]
Tan, T.-S.
[see: Leader, I. B.]
Tan, W.-E.
Waiter–Client and Client–Waiter colourability games on a k–uniform hypergraph and
the k–SAT game. Preprint.
http://arxiv.org/pdf/1607.02258v1.pdf
Tan, W.-E.
[see: Hefetz, D.]
Tancer, M.
[see: Bárány, I.]
Tanigawa, S. [see: Eftekhari, Y.,Jackson, B., Kaszanitzky, V., Nixon, A., Schulze, B.]
Tao, T. C.
[see: Ford, K..]
Taraz, A.
[see: Allen, P.]
Tardif, C.
[see: Foniok, J.]
Tavaré, S.
[see: Arratia, R.]
Taylor, A.
On the exact decomposition threshold for even cycles. Preprint.
http://arxiv.org/pdf/1607.06315.pdf
Taylor, A.
[see: Barber, B., Kühn, D.]
Tessera, R. and Tointon, M.
Properness of nilprogressions and the persistence of polynomial growth of given
degree. Preprint.
http://arxiv.org/pdf/1612.05152
Tetali, P.
[see: Cohen, E.]
Thapper, J. and Živny, S.
The power of Sherali-Adams relaxations for general-valued CSPs. SIAM J. Comput.
to appear.
http://arxiv.org/pdf/1606.02577
Thilikos, D. M.
[see: Dąbrowski, K. K., Kamiński, M.]
Thomas, D.
[see: Ras, C.]
Thomas, R.
[see: Dvořák, Z.]
Thomas, R. M.
[see: Jones, S. A. M.]
Thomason, A. G.
[see: Méroueh, A., Saxton, D.]
Thomassé, S., Trotignon, N. and Vušković, K.
A Polynomial Turing-Kernel for Weighted Independent Set in Bull-Free Graphs.
Algorithmica 77 (2017) 619-641.
http://dx.doi.org/10.1007/s00453-015-0083-x
http://www.comp.leeds.ac.uk/vuskovi/bullFreeFptFinal.pdf
Thurston, D.
[see: Garoufalidis, S.]
Tiba, M.
[see: David, S.]
Tlachac, M L.
[see: Bevan, D.]
Todd, M.
[see: Baladi, V., Bruin, .H.., Demers, M., Freitas, J., Haydn, N., Holland, M., Iommi,
G.]
Tointon, M.
Characterisations of algebraic properties of groups in terms of harmonic functions.
Groups Geom. Dynamics 10 (2016) 1007-1049.
http://dx.doi.org/10.4171/GGD/375 D/375
http://arxiv.org/pdf/1409.6326
Tointon, M. and Yadin, A.
Horofunctions on graphs of linear growth C. R. Math. Acad. Sci. Paris 354 (2016)
1151-1154
http://doi.org/10.1016/j.crma.2016.10.015
http://arxiv.org/pdf/1608.03727
Tointon, M.
[see: Meyerovitch., T, Tessera, R. ]
Tokac, N.
[see: Bordewich, M. J.]
Tomohiro, I.
[see: Badkobeh, G.]
Tomon, I.
Decompositions of the Boolean lattice into rank-symmetric chains. Electron J. Comb.
23 (2016) P2.53.
http://www.combinatorics.org/ojs/index.php/eljc/article/download/v23i2p53/pdf
Tomon, I.
Turán-Type Results for Complete h-Partite Graphs in Comparability and
Incomparability Graphs. Order (2016) 33 (2016) 537-556.
http://dx.doi.org/10.1007/s11083-015-9384-6
Tomon, I.
Almost tiling of the Boolean lattice with copies of a poset. Preprint.
http://arxiv.org/pdf/1611.06842
Tomon, I.
[see: Gruslys, V., Kupavskii, A., Narayanan, B. P.]
Tong-Viet, H. P.
[see: Burness, T. C.]
Toopsuwan, C.
[see: Badkobeh, G.]
Townsend, T.
[see: Kůhn, D.]
Treglown, A.
A degree sequence Hajnal-Szemerédi theorem. J. Comb. Theory. Ser. B. 118 (2016)
13-43
http://dx.doi.org/10.1016/j.jctb.2016.01.007
http://web.mat.bham.ac.uk/~treglowa/degreeFINAL.pdf
Treglown, A. and Zhao, Y.
A note on prfect mathchings in uniform hypergraphs. Electron J. Comb. 23 (2016)
P1.16
http://web.mat.bham.ac.uk/~treglowa/PMEJCFINAL.pdf
Treglown, A.
[see: Balogh, J., Csaba, B., Han, J., Hancock, R., Meeks, K., Staden, Y. ]
Trimble, J.
[see: Dickerson, J. P.,. Manlove, D. F., McCreesh, C.]
Trotignon, N. and Vušković, K.
On triangle-free graphs that do not contain a subdivision of the complete graph on
four vertices as an induced subgraph. J. Graph Theory 84 (2017) 233-248.
http://dx.doi.org/10.1002/jgt.22023
http://www.comp.leeds.ac.uk/vuskovi/triangleIsk4Free.pdf
Trotignon, N.
[see: Adler, I., Radovanovic, M., Thomassé, S]
Truss, J. K.
[see: Chicot, K. M., Mwesige, F.]
Tsaban, B.
[see: Ben-Zvi, A.]
Turchetta, S.
[see: Collini-Baldeschi, R.]
Tyomkyn, M.
[see: Hefetz, D.]
Tyros, K.
[see: Csóka, E., Georgakopoulos, A.]
Ueltschi, D.
[see; Mailler, C.]
Unger, W.
[see: Mertzios, G. B.]
Vaienti, S.
[see: Freitas, A. C.]
Valicov, P.
[see: Foucaud, F.]
Varjú, P. P.
[see: Gutman, Y.]
Varvitsiotis, A.
[see: Atserias, A., Godsil, C. D., Mancinska, L.]
Vatter, V.
[see: Brignall, R.]
Vdovina, A.
[see: Bromberg, L., Kangaslampi, R., Kharlampovich, O.]
Vegh, L.
[see: Ene, A.]
Venkatesan, R.
[see: Aru, J.]
Vidhøj, H. W.
[see: Clifford, R.]
Vigoda, E.
[see: Cai, J.-Y., Galanis, A.]
Viola, E.
[see: Gowers, W. T.]
Vizer, M. [see: Gerbner, D.]
de Visscher, M.
[see: Bowman, C. D.]
Volec, J.
[see: Balogh, J., Glebov, R., Grzesik, A.]
von Stengel, B.
[see: Savani, R.]
Vušković, K.
[see:Adler, I., Boncompagni, V., Cameron, K., Radovanovic, M., Thomassé, S.,,
Trotignon, N.]
Wade, A. R.
[see: Georgiou, N.]
Wagner, S.
[see: Georgakopoulos, A.]
Wagner, Zs. A.
[see: Balogh, J.]
Wahlström, M.
Kernelization, Matroid Methods. Encyclopedia of Algorithms 2015
http://dx.doi.org/10.1007/978-3-642-27848-8_523-1
Wahlström, M.
[see: Gutin, G.]
Waldecker, R.
[see: Jefferson, C.]
Walen, T.
[see: Crochemore, M.]
Walters, M. J.
[see: Balister, P. N., Erde, J.,. Johnson, J. R.]
Wanless, I. M. and Webb, B. S.
Small Partial Latin Squares that Cannot be Embedded in a Cayley Table. Australas. J.
Comb. 67 (2017) 352-363.
http://arxiv.org/pdf/1504.08101.pdf
Ward, J. and Zivny, S.
Maximizing k-Submodular Functions and Beyond. ACM Trans. Algorithms 12 (2016)
article 47.
https://doi.org/10.1145/2850419
http://arxiv.org/pdf/1409.1399.pdf
Warnke, L.
On the missing log in upper tail estimates. Preprint.
http://arxiv.org/pdf/1612.08561
Warnke, L.
[see: Janson, S.]
Wastell, C.
[see: Berenbrink, P.]
Watrigant, R.
[see: Bergé, P., Crampton, J.]
Webb, B. S.
[see: Bryant, D., Wanless, I. ]
Weber, T. S.
[see: Duffy, K. R.]
Weller, K.
[see: Panagiotou, K.]
West, D. B.
[see: Jahanbekan, S.]
Westbury, B. W.
Invariant Tensors and the Cyclic Sieving Phenomenon. Electron. J. Comb. 23 (2016)
P4.25.
http://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i4p25
Whiteley, W.
[see: Eftekhari, Y.]
Wiener, G. [see: Gerbner, D.]
Wildon, M. R.
A generalised SXP rule proved by bijections and involutions. Preprint.
http://www.ma.rhul.ac.uk/~uvah099/Maths/SXPExt6.pdf
Wildon, M. R.
Permutation groups containing a regular abelian subgroup: the tangled history of two
mistakes of Burnside. Preprint.
http://www.ma.rhul.ac.uk/~uvah099/Maths/BurnsideFix20.pdf
Wildon, M. R.
[see: Britnell, J. R., Gianelli, E., Paget, R. E.]
Willard, R.
[see: Barto, I.]
Wilson, R. C.
[see: Giscard, P.-L]
Wilson, W.
[see: Donoven, C.]
Wilton, H.
[see: Bridson, M. R.]
Windridge, P.
[see: House, T.]
Winter, A.
[see: Acin, A., Duan, R. ]
Withers, P.
[see: McDiarmid, C. J. H.]
Woeginger, G. J.
[see: Cela, E.]
Wojuteczky, P.
[see: Biró, P.]
Wolf, J.
Some applications of relative entropy in additive combinatorics. Preprint.
http://www.juliawolf.org/research/preprints/entropyweb.pdf
Wolf, J.
[see: Saad, A..]
Wollan, P.
[see: Huynh, T.]
Wong, P. W. H
[see: Mertzios, G. B., Shalom, M.]
Woo, A.
[see: Fink, A.]
Wood, D. R.
[see: van den Heuvel, J., McDiarmid, C. J. H.]
Woodall, D. R.
Edge-chromatic 3-critical graphs have more edges, Preprint.
Wormald, N. C.
[see: Stark, D. S.]
Worrell, J.
[see: Oukanine, J.]
Wu, H.
[see: Csóka, E.]
Wu, T.
[see: Bastowski, S., Fischer, M., Francis, A., Huber, K. T., van Iersel, L., Moulton, V.]
Wu, Z. S. [see: Goldberg, P. W.]
Xia, A.
[see: Barbour, A. D.]
Xu, L.
[see: Jeavons, P.]
Yadin, A.
[see: Meyerovitch., T., Tointon, M.]
Yang, K.
[see: Galanis, A.]
Yehudayoff, A.
[see: Ellis, D.]
Yeo, A.
[see: Gutin, G.]
Yepremyan, L.
[see: Norin, S. ]
Young, M.
[see: Axenovich, M., Balogh, J.,. Dairyko, M.]
Zaks, S.
[see: Mertzios, G. B.]
Zamaraev, V.
[see: AbouEisha, H., Collins, A., Dąbrowski, K. K., Lozin, V. V.]
Zapata, O.
[see: Dawar, A.,]
Zdeborova, L.
[see: Coja-Oghlan, A.]
de Zeeuw, F.
[see: Lin, A., Stevens, S.]
Zhang, P.
[see: Gao, A.]
Zhao, Y.
On the lower tail variational problem for random graphs. Combin. Probab. Comput. 26 (2017) 301–320.
http://doi.org/10.1017/S0963548316000262
http://arxiv.org/pdf/1502.00867
Zhao, Y.
Extremal regular graphs: independent sets and graph homomorphisms. Preprint.
http://arxiv.org/pdf/1610.09210
Zhao, Y.
[see: Bhattacharya, B. B., Borgs, C., Conlon, D., Fox, J.,Han, J.. Kůhn, D., Lovász, L.
M., Lubetzky, E. Treglown, A.]
Zhuk, D.
[see: Carvalho, C.]
Ziegler, G. M.
[see: Bárány, I.,]
Zilma, Y.
[see; Pikhurko, O.]
Živný, S.
[see: Bulatov, A., Carbonnel, C., Cohen, D. A., Cooper, M. C., Fulla, P., Iwamasa, Y.,
Krokhin. A., Thapper, J.. Ward, J. ]
Zverovich, V. E.,
[see: Barki, H., Boguslawski, P.]
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.
ALEA, Lat. Am. J. Probab. Math. Stat. – Latin American Journal of Probability and
Statistics.
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
Ann. Stat. – Annals of Statistics
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. Geom, – Computational Geometry
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 Anal. – Discrete Analysis
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. Linear Algebra – The Electronic Journal of Linear Algebra.
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
Forum Math. Sigma – Forum of Mathematics Sigma
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 Commun. Lett. – IEEE Communications Letters.
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. Algebra Appl – Journal of Algebra and its Applications.
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. Funct. Anal. – Journal of Functional Analysis.
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. Optim. Theory. Appl. - Journal of Optimization Theory and Applications
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
Mosc. J. Comb. Number Theory - Moscow Journal of Combinatorics and Number
Theory
Networks – Networks
Notices Am. Math. Soc. – Notices of the American Mathematical Society.
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
Stat Probab Let.t – Statistics and Probability Letters
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
