British Combinatorial Bulletin 2016
British
Combinatorial
Bulletin
2016
BRITISH COMBINATORIAL BULLETIN 2016
This is the 2016 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.
As many of you probably know already, the BCC has a new Wordpress Website
https://britishcombinatorial.wordpress.com/ and the Bulletin will be moving there
when the Editor has some leisure time (laughs hollowly and insanely). The old site
will be (lightly) maintained for a while thereafter to ease the transition. Possible
changes to the format of the bulletin were discussed at the last BCC Business Meeting
and the upshot is that there are no plans to change the format of the Bulletin at present.
The situation will be kept under review.
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
8 May 2016.
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), Vadim Lozin (BCC25 Local Organiser),
David Penman (Bulletin editor), Bridget Webb (Archivist), Jan van den Heuvel and
Sophie Huczynska
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 18. 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 2015.
BRITISH COMBINATORIAL COMMITTEE
Receipts and Payments Account for the period
1 October 2014 to 30 September 2015
Year to Year to
30/9/2015 30/9/2014
Receipts £ £
Interest 62.69 54.63
Royalties from Cambridge University Press 1373.30
Surplus/return of £5507 deposit, 24th
BCC, RHUL, 2013 8775.42
Total receipts 62.69 10203.35
Payments
Grants for one-day conferences (6 events in 2014/15) 2941.94 450.00
Grant for London 2-day conference (QMUL/LSE), May 2014 926.96
Expenses for committee meetings 165.00
Scottish Combinatorics Meeting 2015 413.00
Postgraduate Combinatorics Conference 2013 500.00
(SIGMAP Workshop, Malvern, July 2014) 710.00
Total payments 5046.96 1160.00
Surplus / (deficit) for year (4984.21) 9043.35
All funds are unrestricted
Statement of Balances as at 30 September 2015 2014
£ £
Bank accounts:
Opening balances 23552.82 14509.47
Surplus (deficit) for year (4984.21) 9043.35
Closing balances 18568.61 23552.82 Made up of:
Bank of Scotland Treasurer’s Account 1147.48 10194.38
Scottish Widows Bank Charity Deposit Account 17421.13 13358.44
18568.61 23552.82
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 2014 to 30 September 2015 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
Alderman, James RHUL
Al-Krizi, Athraa Liverpool
Allen, Dr Peter LSE
Allen, Dr Stuart M. Cardiff Al-Kharoosi, Fatma QMUL Alpern, Prof Steve Warwick
Alqahtani, Hasna Leicester
Alshamrani, Sultan Liverpool
Anastasiadis,
Eleftherios
Liverpool
Anderson, Dr Ian Glasgow Anthony, Prof Martin LSE Appa, Prof Gautam LSE Aranda Lopez, Andres Leeds
Arrowsmith, Prof
David K. QMUL
Arikiez, Mohamed Liverpool
Atminas, Aistis Nottingham Trent
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, Ben A. Bristol
Barbina, Dr Silvia Open
Barham, Robert Leeds
Bateman, Dr Michael Cambridge
Batu, Dr Tugkan LSE
Bazlov, Dr Yuri Manchester
Bedford, Dr David Keele
Bello Aguirre, Ricardo Leeds
Bending, Dr Thomas D. Middlesex
Bevan, Dr. David Open
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
Bowler, Dr Andrew Birkbeck
Bowman, Dr
Christopher
City
Bradley-Williams,
David
Leeds
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
Brough, Michael QMUL
Bryant, Prof Roger M. Manchester
Burcea, Mihai Liverpool
Burke, Heather Leeds
Burrows, Prof Brian L. Staffordshire
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
Chapman, Dr Robin J. Exeter Chen, Prof Bo Warwick Chen, Cong Leeds
Chervak, Ostap Warwick
Chetwynd, Prof
Amanda G Lancaster
Chicot, Dr Katie M. Open Christodolou, Dr G. Liverpool
Chuang, Prof Joseph City
Chun, Dr Carolyn Brunel
Chuzhanova, Prof
Nadia
Nottingham Trent
Cid, Prof Carlos RHUL Ciechanowicz, Dr C. RHUL
Claesson, Dr Anders Strathclyde
Clarke, Dr Francis W. Swansea Clifford, Dr Raphael Bristol
Cohen, Prof David E. RHUL Coker, Tom Cambridge
Collins, Andrew Warwick
Conlon, Dr David Oxford
Constable, Robin L. St Andrews Cooley, Jonathan RHUL
Cooper, Dr Colin KCL Cooper, Frances Glasgow
Cormode, Prof Graham Warwick
Cosh, Ben Reading Cox, Dr Anton City
Crampton, Prof Jason RHUL
Crane, Dr Edward Bristol
Crofts, Dr Jonathan J. Nottingham Trent
Crouch, Dr Simon Hewlett-Packard Crowston, Robert RHUL
Cryan, Dr Mary Edinburgh Csornyei, Prof
Marianna UCL
Czumaj, Prof Artur Warwick
D Dąbrowski, Konrad Durham
Daniels, Christopher Bath
Dantchev, Dr Stefan Durham Daud, Rosli RHUL
Davies, Ewan LSE
Davies, Peter Warwick
Dawson, Mr. Laurence Durham
Deineko, Dr Vladimir Warwick Deligkas, Argyrios Liverpool
Devine,. Dr Paul Liverpool
Dietmann, Dr Rainer RHUL
Doan, Dr Xuan Vinh Warwick
Dong, Keren Liverpool
Dowden, Dr Chris RHUL
Drizen, Andrew QMUL Duffield, Drew Leicester
Dugdale, Dr J. Keith Reading Dukes, Dr W. Mark B. Strathclyde
Duncan, Dr Andrew J. Newcastle Dunne, Prof Paul. Liverp ool
Dyer, Prof Martin Leeds Džamonja, Prof Mirna UEA
E Eccles, Tom Cambridge
Edwards, Dr Keith J. Dundee Elagbeili, Ragab Leeds
Eleftheriou, Andria Essex Ellis, Dr David QMUL
Ene, Dr Alina Warwick
Englert, Dr Matthias Warwick Erde, Joshua Cambridge
Erickson, Alejandro Durham
Erskine, Grahame Open
Erlebach, Prof Thomas Leicester Essam, Prof John W. RHUL Evans, Prof David M. Imperial Evans, Dr Edward A. St.Mary's U. C. Everett, Prof M. G. Greenwich
F Faben, John QMUL 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 Fitch, Matthew Warwick
Fleischmann, Prof
Peter. Kent
Folkes, Hannah Sussex
Forbes, Dr Tony D. Open Forster, Dr Thomas. E. Cambridge
Fountoulakis, Dr
Nikolaos
Birmingham
Friedetzky, Dr Tom Durham
G Gadouleau, Dr
Maximilien
Durham
Gagarin , Dr Andrei RHUL
Gairing, Dr Martin Liverpool
Garbe, Frederik Birmingham
Garner, Michelle RHUL
Gąsieniec, Prof Leszek Liverpool Georgakopoulos, Dr
Agelos
Warwick
Georgiou, Dr Nicholas Durham
Gerke, Dr Stefanie RHUL Gibson, Dr J. Keith Birkbeck Gilmour, Prof S. G. QMUL Glass, Prof Celia A. City 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, Lukasz Lancaster
Grannell, Prof Mike J. Open Greaves, Gary RHUL
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
Haight, Dr John A. UCL
Hall, Dr Rhiannon Brunel
Hamed, Zainab Sussex
Hamilton, David Liverpool
Han, Jie Birmingham
Hancock, Robert Birmingham
Handley, Dr Andrew Warwick
Harris, Liam South Wales
Hart, Prof Sarah Birkbeck
Hatton, Prof Les Kingston
Hauser, Dr Raphael Oxford
Hazzari, 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
Hill, Prof Ray Salford
Hillebrand, Anne Oxford
Hilton, Prof A. J. W. Reading
Hirschfeld, Prof James
W. P.
Sussex
Hmaida, Mufida Leeds
Hoare, Nick RHUL
Hoffman de Visme,
Ivan
Charterhouse School
Holroyd, Dr Fred C. Open
Hook, James Manchester
Howard, Dr John LSE
Hu, Ping Warwick
Huber, Dr Anna Derby
Huber, Dr Katrina UEA
Huczynska, Dr Sophie St Andrews
Huggett, Dr Stephen Plymouth
Hughes, Dr Lesley A Ystrad Mynach College
Hunt, Dr Francis South Wales
Hunter, Dr Gordon J.A. Kingston University
Hurley, Steve Cardiff
Hussein, Ahmed Leeds
Hutchinson, Daniel RHUL
Hyde, James St. Andrtews
I Igwe, Tobenna Peter Liverpool
Ioannou, Anastasia Leicester
Irving, Dr Rob Glasgow
J Jabbar, Awss Sussex
Jackson, Prof Bill QMUL Jackson, Dr Penelope
S. Stirling
Jenkinson, Tristan Leeds 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 RHUL
Jones, Dr Mark C. W. Kingston Jones, Dr Sian South Wales
Joos, Dr. Felix Birmingham
Jordan, Dr Jonathan Sheffield
Jurdzinski, Dr Marcin Warwick
K Kamat, Mihir Nottingham Trent
Kambites, Dr Mark Manchester Karaoglu, Fatma Sussex
Kazanidis, Dr Priscila QMUL 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 Kempton, Dr Tom St Andrews
Kessar, Prof Radha City
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. UNL 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, Dr Stephane Kent Lawson, Dr Mark V. Heriot-Watt Laycock, Prof Patrick
J. Manchester
Lazic, Dr Ranko Warwick
Leader, Prof Imre B. Cambridge Lee, Joongkyun Oxford
Leese, Dr Robert Oxford Lemmens, Dr Bas Kent
Lewis, Robert Open
Liebeck, Prof Martin. Imperial College Lignos, Ioannis Durham Lindelmann, Prof
Markus
City
Linton, Prof Steve A. St. Andrews Liu, Hsiang Hsuan Liverpool
Lloyd, Dr E. Keith Southampton Lo, Allan Birmingham
Long, Eoin. P. Oxford
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
Makai, Tamas RHUL
Makroglou, Dr Athena Portsmouth Manlove, Dr David Glasgow Manns, Mr. Tom Portsmouth
Marchant, David Open
Marsh, Prof Robert J. Leeds 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
Mayhill, Colin Warwick
McAlpine, Kenneth M. Abertay McCabe, Dr A Liverpool
McCabe, Dr John H. St Andrews McCourt, Dr Tom Plymouth
McCreesh, Ciaran Glasgow
McDiarmid, Prof
Colin. J.H. Oxford
McDonough, Dr Tom
P. Aberystwyth
McDowell, Dr. Andrew Birmingham
McKee, Prof James RHUL McMullen, Prof Peter UCL Meeks, Dr Kitty Glasgow
Mertzios, Dr George Durham
van der Merwe, Thyla RHUL
Meshkinfamfard, Mr.
Sepher
Durham
Miller, Dr Alice Glasgow
Min, Jie Liverpool
Mitchell, Prof Chris J. RHUL Mitchell, Dr James D. St Andrews Mitchell Dr Jane M.O. Open Moffatt, Dr Iain RHUL
Montanaro, Dr Ashley Cambridge
Montalvo Ballesteros,
Mayra
Leeds
Montecalvo, Federico QMUL Morris, Prof Alun O. Aberystwyth Morrison, Natasha Oxford
Mörters, Prof Peter Bath Muller, Haiko Leeds Müller, Prof Thomas QMUL
W. Murawski, Prof
Andrzej
Warwick
Murphy, Prof Sean P. RHUL Mycroft, Dr Richard Birmingham
N Neale, Dr Vicky Cambridge
Ng, Dr Siaw-Lynn RHUL Nixon, Dr Tony Lancaster
Noble, Dr Steven Brunel Noel, Jonathan Oxford
Novak, Julia RHUL
O O'Connor, Dr John J. St Andrews O’Donovan, Bill RHUL
Ojiaku, Jude-Thaddeus Liverpool
Olsen, Prof Lars St Andrews O’Neill, Alexander QMUL 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
Patel, Dr Viresh QMUL
Paterson, Prof Kenny RHUL
Paterson, Dr Maura Birkbeck Paterson, Prof Mike Warwick Patterson, Derek QMUL Paulusma, Dr Daniel Durham 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 M. St. Andrews
Pichanick, Erin Sussex
Pikhurko, Prof Oleg Warwick
Pilipchuk, Dr Marcin Warwick
Pinch, Dr Richard G.E. GCHQ, Cheltenham Poghosyan,
Anush West of England
Pokrovskiy, Alexey LSE
Potapov, Dr Igor Liverpool
Potts, Prof Chris N. Southampton Powell, Robert Durham
Prellberg, Dr Thomas QMUL Prince, Dr Alan R. Heriot-Watt Proctor, Gordon RHUL
Prosser, Dr Patrick Glasgow
Przykucki, Michal J. Oxford
Pu, Dr Ida Goldsmiths, London
Q Quaglia, Elizabeth RHUL
Quick, Dr Martyn R. St Andrews Quinn, Dr Kathleen
A.S. Open
R Rackham, Tom Oxford Radoja, Matthew Leicester
Rastegari, Dr Baharak Glasgow
Rasul, Aram Leicester
Rattan, Dr Amarpreet Birkbeck Ray, Prof Nigel Manchester Rees, Prof Sarah E. Newcastle Reeves, Andrew Leeds
Reilly, Craig Glasgow
Reinert, Prof Gesine Oxford Richerby, Dr David Oxford
Rino Nesin, Gabriela
Asli
Leicester
Riordan, Prof Oliver Oxford Rivin, Prof Igor St. Andrews
Roberts, Alexander Oxford
Roberts, Bartnaby LSE
Robertshaw, Dr Andy Office for National
Statistics Robertson, Prof
Edmund F. St Andrews
Rochanakul, Penying RHUL 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, Dr Paul A. Cambridge Rutherford, Dr Carrie London South Bank
S Sach, Dr Benjamin Bristol
Saker, Dr Chris J. Essex Salhi, Dr Abdel Essex Sands, Dr Arthur D. Dundee Sanders, Dr Tom Oxford
Sandling, Dr Robert Manchester Sangha, Pavan Liverpool
Sanhueza, Nicolas Birmingham
Santos,Tassio Naia dos Birmingham
Savani, Dr Rahul Liverpool Saxl, Prof Jan Cambridge Schroll, Dr Sibyille Leicester
Schulze, Dr Bernd Lancaster
Scott, Prof Alex D. Oxford Sendova-Franks, Dr A West of England. Sezgin, S. UCL Sgouritsa, Alkmini Liverpool
Shah, Chintan Warwick
Shakhlevich, Natasha Leeds Shang, Tao Liverpool
Shank, Dr R. J. Kent Shareef, Dr Fuad QMUL Shaw, Prof Ron Hull 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 Soicher, Prof Leonard
H. QMUL
Sokal, Prof Alan D UCL Song, Jian Durham
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 Swanepoel, Dr Konrad LSE
Symonds, Adam Durham
T Tamimi, Baha Essex
Tan, Wei En Birmingham
Tang, Bo Liverpool
Talbot, Dr John M. UCL Talbot, Dr Richard F. Staffordshire Tarzi, Dr Sam QMUL Taylor, Amelia Birmingham
Thomas, Dr A. D. Swansea Thomas, Prof Richard
M. Leicester
Thomas, Dan Durham
Thomason, Prof
Andrew G. Cambridge
Tiskin, Dr Alex Warwick Todd, Dr M. St Andrews
Tokac, Nihan Durham
Towers, Matthew Kent
Treglown, Dr Andrew Birmingham
Truman, Paul Keele
Truss, Prof John K. Leeds Tuite, James Open
Twigg, Dr Andy Oxford
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 Vodafone Group/
RHUL/KCL Walters, Dr Mark QMUL Ward, Mr. David Manchester
Warnke, Lutz Cambridge
Wastell, Chris Durham
Waters, Steven Glasgow Caledonian Webb, Dr Bridget S. Open Weber, Prof Richard
R.
Cambridge
Wells, Matthew Essex
Welsh, Prof Dominic Oxford Wensley, Dr Chris D. Bangor Whistler, William Durham
Whitaker, Dr Roger Cardiff White, Dr Lynda V. ICL, London Whitty, Prof Robin W. London South Bank Wildon, Dr Mark RHUL
Williams, Conrad RHUL
Williams, Dr Gerald Essex Williams, Prof H. Paul LSE Williams, Josh Warwick
Wilson, Prof Robert A. QMUL Wilson, Prof Robin J. Open
Willmott, Dr Colin M. Nottingham Trent
Wilson, Samuel Leeds
Wojtczak, Dr D. Liverpool
Wolf, Dr Julia Bristol
Wong, Dr Prudence H Liverpool Wood, Daniel Leeds
Woodage, Joanne RHUL
Woodall, Dr Douglas
R. Nottingham
Woodcock, Dr Chris F. Kent Wright, R. 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 Aberystwyth University, Aberystwyth, SY23
3BZ. Tel: 01970 622802 Fax: 01970 6227777
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
BANGOR UNIVERSITY
School of Computer Science University of Bangor, Dean Street, Bangor, Gwynedd
LL57 1UT. Tel: 01248 382686 Fax: 01248 361429
http://www.maths.bangor.ac.uk
Dr C. D. Wensley* (retired, Honorary Research Fellow: computational discrete
algebra)
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)
Research students
Christopher Daniels (percolation, Prof Penrose)
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 A. Bowler* (symmetric designs, combinatorial matrices, permutation groups)
Dr B. Fairbairn (combinatorial algebra).
Dr S. Hart (permutation groups, sum-free sets)
Dr M. 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 T. I. Fenner (combinatorial algorithms, probabilistic algorithms, random graphs)
Prof G. 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/D.Osthus/bham.html (for combinatorics group).
Dr Nikolaos Fountoulakis (Random Graphs, Randomized Algorithms)
Prof Daniela Kühn (Extremal Combinatorics, Probabilistic Methods)
Dr Allan Lo (Extremal Combinatorics)
Dr Richard Mycroft (Extremal Combinatorics)
Prof Deryk Osthus* (Extremal Combinatorics, Probabilistic Methods)
Dr Will Perkins (Combinatorics, Probablity, Algorithms)
Dr Andrew Treglown (Extremal Combinatorics)
Research Fellows
Dr. Felix Joos (Combinatorics)
Dr Jaehoon Kim (Combinatorics)
Dr. Andrew McDowell (Combinatorics)
Dr. Guillem Pernarua (Combinatorics)
Research Students
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)
Tim Townsend (Prof Kühn)
Lecture courses
Discrete Mathematics (22 lectures, 1st year)
Combinatorial Optimisation (22 lectures, 3rd
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 Andrew Brooke-Taylor (homogeneous structures)
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 (finite geometry)
Dr Jason Semeraro (grouips, representations, combinatorics)
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 Benjamin Sach (algorithms)
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)
Dr Steven Noble* (combinatorics, graph theory)
Research Students
Chris Knapp (Dr Noble).
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
Dr Michael Bateman (additive combinatorics)
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 Paul Russell (Churchill) (Ramsey theory)
Dr Paul Smith (Murray Edwards) (probabilistic combinatorics)
Dr Matthew Tointon (additive combinatorics)
Dr Lutz Warnke (random graphs, probabilistic methods)
Research students
Antonio Girao (Prof. Thomason)
Vytautas Gruslys (Prof Leader)
Omid. Hatami (Prof Gowers)
Nathan Kettle (Prof Bollobás)
Sebastian Koch (Prof Bollobás)
Jonathan Lee (Prof Bollobás)
Shoham Letzler (Prof Bollobás)
Sarah Lilienthal (Prof Kelly)
Ares. Meroueh (Prof Thomason).
B. P. Narayanan (Prof Bollobás)
Ivan 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)
Algebraic Methods in Incidence Theory (Dr Bateman)
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)
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)
Research fellows:
Dr C. Bowman (representation theory)
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
School of Computing University of Dundee, Dundee DD1 4HN. Tel: 01382 384151
Fax: 01382 385509
http://www.computing.dundee.ac.uk
Dr K. J. Edwards* (Graph colourings, graph decompositions, complexity)
Division of Mathematics University of Dundee, Dundee DD1 4HN. Tel. 01382
384471 Fax 01382 385516
http://www.maths.dundee.ac.uk
Dr Arthur D. Sands (retired: Combinatorial problems on finite Abelian groups)
Lecture Courses:
Theory of Computation (Level 3)
Logic and Information Theory (M.Sc.)
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 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 Norbert Peyerimhoff (global analysis, graph theory, Riemannian geometry)
Research Staff (mostly in Computer Science)
Konrad Dąbrowski (graph algorithms, parameterized complexity)
Alejandro Erickson (combinatorial algorithms, interconnection networks,
mathematical art, tilings and coverings)
Dr Nicholas Georgiou (in Mathematical Sciences: Probabilistic combinatorics and
partial orders; modular decomposition and its connection to the Reconstruction
Conjecture)
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)
Prof Peter.M. Higgins (combinatorics of algebraic semigroup theory, cryptography)
Dr David Penman* (random and pseudo-random graphs)
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)
Lecture Courses
Graph Theory (3rd
year, Dr Penman) (30 lectures)
Codes and Cryptography (Dr Williams, 3rd
year) (30 lectures)
Combinatorial optimisation (Dr Salhi, 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)
Dr K. Meeks (Lecturer) –graph theory, algorithms, parameterised complexity,
networks.
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 R.W. Irving (combinatorial and graph algorithms) (Honorary Research Fellow)
Dr D.F. Manlove* (combinatorial and graph algorithms)
Dr A. Miller (combinatorial and graph algorithms)
Dr P. Prosser (combinatorial and graph algorithms)
Research staff
Dr Baharak Rastegari (combinatorial and graph algorithms)
Research students
Frances Cooper (combinatorial and graph algorithms, Dr Manlove)
Ciaran McCreesh (combinatorial and graph algorithms, Dr Prosser)
Craig Reilly (Parallel graph search with isomporphism elimination, Dr Miller)
Lecture courses
Algorithmic Foundations 2 (Computer Science, 2nd
year, 22 lectures, Dr Norman)
Algorithmics I (H) (Computer Science, 3rd year, 20 lectures, Dr Norman)
Algorithmics II (H) (Computer Science, 4th year, 20 lectures, Dr Manlove)
Constraint Programming M (4th year, 20 lectures, Dr Prosser)
Graphs and Networks (Maths, 21 lectures, 2nd year, Dr Meeks)
Topics in Discrete Mathematics (Maths, 21 lectures, 2nd year)
Seminars: Formal Analysis, Theory and Algorithms (Tuesday, 1 pm, during semester
time). (Dr Baharak Rastegari)
http://www.gla.ac.uk/schools/computing/research/researchgroups/formalanalysistheor
yandalgorithms.
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 M.V. Lawson (semigroup theory, combinatorics on words)
Dr A. R. Prince* (finite geometries, finite group theory)
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, Dr Prince)
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
Centre for Mathematics University of Hull, Cottingham Road, Hull HU6 7RX. Tel:
01482 465885 Fax: 01482 466218
http://www.hull.ac.uk/maths/
Prof R. Shaw* (Emeritus, finite geometry)
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).
Dr Mohammed Abdullah (probability, 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 Cornwallis Building,
University of Kent, Canterbury, Kent CT2 7NF. Tel: 01227 827181 Fax: 01227
827932
http://www.kent.ac.uk/smsas/
Prof P. Fleischmann (algebraic combinatorics, root systems, Mobius function)
Dr S. Launois (q-calculus)
Dr B. Lemmens (dynamical systems, combinatorial aspects)
Dr A. F. Loureiro (orthogonal polynomials)
Dr R. E. Paget* (representation theory of symmetric groups, cellular 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
Melanie De Boeck (Dr Paget)
Cesar Lecoutre (Dr Launois)
Andrew Kitchin (Dr Launois)
Lecture courses
Discrete mathematics (36 lectures, 3rd
year, Dr Woodcock)
Symmetries, Groups and Invariants (M.Sc., Prof Fleischmann)
Diagram algebras in mathematics and physics (M.Sc., Dr Paget, Dr Dunning)
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.).
Visiting professor Prof Mike Walker.
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. 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 Computer Science University of Leicester, University Road, Leicester
LE1 7RH. Tel: 0116 252 3887 Fax: 0116 252 3604
http://www2.le.ac.uk/departments/computer-science
Prof T. Erlebach (combinatorial optimization, approximation algorithms, algorithmic
graph theory)
Prof R. M. Thomas* (combinatorial group and semigroup theory, automata theory)
Research Students
Hasna Alqahtani (graph problems in networking, Prof Erlebach)
Anastasia Ioannou (modelling systems via Petri nets, Prof Thomas)
Matthew Radoja (algorithmic game theory, Prof Erlebach)
Aram Rasul (aspects of wireless networks, Prof Erlebach)
Gabriela Asli Rino Nesin (word problems and formal languages, Prof Thomas)
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., Prof Erlebach)
Game Theory in Computer Science (24 lectures, M.Sc., Dr van Stee) .
Seminars There is a regular seminar program, see
http://www2.le.ac.uk/departments/computer-science/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)
Research students
Drew Duffield (Brauer graph algebras, Dr Schroll)
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 matehatmical 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).
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)
Ewen Davies (Dr Skokan)
Steffen Isslieb
Matthew Jensen (Dr Skokan)
Tom Lidbetter (Prof Alpern)
Barnaby Roberts (Dr Skokan)
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)
Dr 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)
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).
Research Students
Amit Kuber (graph theory, lattice theory and combinatorial aspects of category theory,
Dr Prest)
Ronel Tahel (inductive logic, Prof Paris and Dr Alena Vencovska)
David Ward (combinatorial group theory, presheaves defined on simplicial complexes:
Prof Rowley)
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.
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)
Research students
Nicholas Loughlin, (combinatorial/geometric semigroup theory, cellular and diagram
algebras and their K-theory, formal language theory and connections with semigroup
theory, Prof Rees)
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 Aistis Atminas (graph theory, well-quasi ordering)
Dr David Bevan (permutation patterns)
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)
Robert Lewis (analysis and construction of extremal highly symmetric graphs with
given metric properties: Prof Širáň and Dr Webb: 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
Dr 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 Matthias Lenz (matroids)
Dr V. Neale (additive combinatorics)
Dr Mason Porter (applications of networks)
Dr. Sean Prendiville (additive combinatorics)
Dr Michal Przykucki (probabilistic combinatorics)
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)
Department of Statistics 1 South Parks Road, Oxford OX1 3TG. Tel: 01865 272860
Fax: 01865 272595
http://www.stats.ox.ac.uk
Dr 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
Matthew Ashford (Prof Riordan)
Ross Atkins (Prof McDiarmid)
Sean Eberhard (Prof Green)
Annike Heckel (Prof Riordan)
Anne Hillebrand (Profs McDiarmid and Scott)
Joonkyung Lee (Dr Conlon)
Natasha Morrison (Prof Scott)
Rudi Mrazovic (Prof Green)
Jonathan Noel (Prof Scott)
Alexander Roberts (Prof Scott)
Aled Walker (Prof Green)
Paul Withers (Profs McDiarmid and Scott)
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 Mathematics & Statistics University of Plymouth, Drake Circus, Plymouth
PL4 8AA. Tel: +44 (0)1752 586888 Fax: +44 (0)1752 586900
http://www.plymouth.ac.uk/pages/view.asp?page=7889
Prof Stephen Huggett (graph theory, twistor theory).
Dr Tom McCourt* (graph theory, combinatorial design theory, related algebraic
structures)
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)
Dr 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 Emil Vaughan (graph theory and statistics)
Research students
Michael Brough (graph theory: Prof Jackson)
Andrew Drizen (design theory, Markov chains: Prof Cameron)
Derek Patterson (design theory: Prof Soicher)
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 Andrei Gagarin (Combinatorics, optimization, graph theory, networks, algorithms,
enumeration, access control)
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)
Jessica Claridge (network coding, Prof Blackburn)
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 M. Todd (ergodic theory)
Research Students
Mr. D. Bennett
Miss E. Bieniecka
Mr. T. Bourne
Miss R. Carey
Mr. C. Donoven
Mr. J. Jonusas
Miss N. Khalid
Mr. M. McDevitt
Mr. V. Mijovik
Mr A. Schaefer
Mr. M. Torpey
Mr. S. Truscheit
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
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 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 Anders Claesson (algebraic and enumerative combinatorics)
Dr Mark Dukes (combinatorial and discrete mathematics, statistical mechanics,
applied probability)
Dr Sergey Kitaev (combinatorics, discrete analysis, graph theory, formal languages)
Prof Einar Steingrimsson (algebraic and enumerative combinatorics)
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
Salam Alabdullah (finite geometry, Prof Hirschfeld)
Hannah Folkes (finite geometry, Prof Hirschfeld)
Zainab Hamed (finite geometry, Prof Hirschfeld)
Mohammad Hazzari (finite geometry, Prof Hirschfeld)
Awss Jabbar (finite geometry, Prof Hirschfeld)
Fatma Karaoglu (finite geometry, Prof Hirschfeld)
Erin Pichanick (finite geometry, Prof Hirschfeld)
Lecture courses
Ring 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 (convex geometry, geometry of numbers, theory of integer
programming)
Prof M. Csőrnyei (real analysis)
Dr J.A. Haight (combinatorial number theory, measure theory, ramsey theory, logic)
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)
Research students
Louise Jottrand (shadow boundaries of convex bodies, Prof Larman).
Adam Sanitt (combinatorics, Dr Talbot)
Pablo Soberon Bravo (Prof Bárány)
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 (Evolutionary Algorithms, Combinatorics on words, word morphisms)
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 Marcin Jurdziński (algorithmic game theory, logic in computer science, optimization)
Dr Ranko Lazić (computer science and combinatorics)
Dr Anita Liebenau (extremal and probabilistic graph theory, positional games and
Ramsey 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 Endre Csóka (graph theory, algorithms)
Dr Agelos Georgakopoulos (random walks, electrical networks, infinite graphs)
Dr Lukasz Grabowski (graph limits)
Prof Roman Kotecký (Probability; statistical physics; theory of phase transitions)
Prof Daniel Král’ (extremal and probabilistic combinatorics)
Prof Vadim Lozin (algorithmic and structural graph theory)
Prof Oleg Pikhurko* (Extremal combinatorics)
Dr Konstantinos Tyros (Ramsey theory)
Dr Katherine Staden (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)
Tasia 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)
Josh Williams (Ramsey theory, Prof. Pikhurko)
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 2015-April 2016 - 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.
Aalipour, G., Akbari, S., Cameron, P. J., Nikandish, R. and Shaveisi, F.
On the structure of the power graph and the enhanced power graph of a group.
Preprint.
http://arxiv.org/pdf/1603.04337
Aashikur Rahman Azim, M., Iliopoulos, C. S., Samiruzzaman, M. and Sohel
Rahmann, M.
A Filter-Based Approach for Approximate Circular Pattern Matching. ISBRA2015 24-
35
http://dx.doi.org/10.1007/978-3-319-19048-8_3
Abdullah, M., Bode,. M. and Fountoulakis, N.
Typical distances in a geometric model of complex networks. Preprint.
http://www.mohammedabdullah.com/TypDistances.pdf
Abdullah, M., Bode,. M. and Fountoulakis, N.
Local majority dynamics on preferential attachment graphs. WAW 2015.
http://www.mohammedabdullah.com/PAVotingWAW2015-S.pdf
Abdullah, M., Cooper, C. and Draief, M.
Speeding Up Cover Time of Sparse Graphs using Local Knowledge. (IWOCA 2015)
http://www.mohammedabdullah.com/WeightedWalksIWOCA.pdf
Abért, M.. Csikvári, P. and Hubai, T.
Matching Measure, Benjamini–Schramm Convergence and the Monomer–Dimer Free
Energy. J. Stat. Phys. 161 (2015) 16-34.
http://dx.doi.org/10.1007/s10955-015-1309-7
Abért, M.. and Hubai, T.
Benjamini-Schramm convergence and the distribution of chromatic roots for sparse
graphs, Combinatorica 35 (2015) 127-151
http://dx.doi.org/10.1007/s00493-014-3066-7
http://arxiv.org/pdf/1201.3861
Abreu, M., Labbate, D., and Sheehan, J.
Even Orientations and Pfaffian graphs. Preprint.
http://arxiv.org/pdf/1510.07553
Abu Khzam, F. N., Feghali, C., and Müller, H.
Partitioning a Graph into Disjoint Cliques and a Triangle-free Graph. Discrete Appl.
Math. 190 (2015), 1-12
http://arxiv.org/pdf/1403.5961
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., to appear.
http://arxiv.org/pdf/1505.01265
Addario-Berry, L, Balle, B. and Perarnau, G.
Diameter and Stationary Distribution of Random r-out Digraphs. Preprint.
http://arxiv.org/pdf/1504.06840v1.pdf
Affif Chaouche, F., Rutherford, C. G. and Whitty, R. W.
Discuss. Math. Graph Theory 35 (2015) 533–539
http://dx.doi.org/10.7151/dmgt.1818
http://arxiv.org/pdf/1212.3633
Ahlberg, D., Griffiths, S., Morris, R. D. and Tession, V.
Quenched Voronoi percolation. Adv. Math. 286 (2016) 889-911.
http://dx.doi.org/10.1016/j.aim.2015.09.005
http://arxiv.org/pdf/1501.04075
Akbari, M., Gillespie, N. I. and Praeger, C. E.
Increasing the minimum distance of codes by twisting. Preprint.
http://arxiv.org/pdf/1511.07154
Akbari, S.
[see: Aalipour, G.]
Akhtar, M., Coates, T., Corti, A., Heuberger, L., Kasprzyk, A. M., Oneto, A.,
Petracci, A., Prince, T. and Tveiten, K.
Mirror Symmetry and the Classification of Orbifold del Pezzo Surfaces. Proc. Am.
Math. Soc. 144 (2016), 513-527 http://www.ams.org/journals/proc/2016-144-02/S0002-9939-2015-12876-6/S0002-
9939-2015-12876-6.pdf
Akhtar, M. and Kasprzyk, A. M.
Mutations of fake weighted projective planes. Proc. Edinb. Math. Soc., to appear.
http://dx.doi.org/10.1017/S0013091515000115
http://arxiv.org/pdf/1302.1152
Akrida, E. C., Gąsieniec, L., Mertzios, G. B. and Spirakis, P.
On Temporally Connected Graphs of small cost. WAOA 2015 84-96.
http://community.dur.ac.uk/george.mertzios/papers/Conf/Conf_temporally-
connected_small-cost_proceedings.pdf
Akrida, E. C., Gąsieniec, L., Mertzios, G. B. and Spirakis, P.
Ephemeral networks with random availability of links: The case of fast networks.
Journal of Parallel and Distributed Computing 87 (2016) 109-120.
http://community.dur.ac.uk/george.mertzios/papers/Jour/Jour_Ephemeral_networks.p
df
Akrida, E. C., Gąsieniec, L., Mertzios, G. B. and Spirakis, P.
On Temporally Connected Graphs of Small Cost. WAOA 2015 84-96
http://dx.doi.org/10.1007/978-3-319-28684-6_8
Akrida, E. C. and Spirakis, P.
On Verifying and Maintaining Connectivity of Interval Temporal Networks.
ALGOSENSORS 2015 142-154
http://dx.doi.org/10.1007/978-3-319-28472-9_11
Aksoy Yazici, E., Murphy, B.. Rudnev, M. and Shkredov, I.
Growth Estimates in Positive Characteristic via Collisions. Preprint.
http://arxiv.org/pdf/1512.06613
Alatabbi, A., Dakykin, J. W., and Rahman, M. S.
Linear Algorithms for Computing the Lyndon Border Array and the Lyndon Suffix
Array. Preprint.
http://arxiv.org/pdf/1506.06983
Alatabbi, A., Dakykin, J. W., Rahman, M. S. and Smyth, W. F.
Simple Linear Comparison of Strings in V-order. Fund. Inf. 159 (2015) 115-126.
http://dx.doi.org/10.3233/FI-2015-1228
Alatabbi, A., Dakykin, J. W., Rahman, M. S. and Smyth, W. F.
String Comparison in V-Order: New Lexicographic Properties & On-line
Applications. Preprint.
http://arxiv.org/pdf/1507.07038
Alatabbi, A., Sohidull Islam, A. S., Rahman, M. S., Simpson, J. and Smyth, W. F.
Enhanced Covers of Regular & Indeterminate Strings using Prefix Tables. Preprint.
http://arxiv.org/pdf/1506.06793
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
Albert, M. H., Atkinson, M. D. and Claesson, A.
Isomorphisms between pattern classes. J. Comb. 6 (2015) 3-17.
http://dx.doi.org/10.4310/JOC.2015.v6.n1.a1
http://arxiv.org/pdf/1308.3262
Albert, M. H., Brignall, R. Ruškuc, N. and Vatter, V.
Rationality for subclasses of 321-avoiding permutations. Preprint.
http://users.mct.open.ac.uk/rb8599/papers/av321.pdf
Aldridge, M., Baldassini, L. & Gunderson, K.
Almost Separable Matrices. J. Comb. Optim. (2015) 1-22.
http://dx.doi.org/10.1007/s10878-015-9951-1
http://arxiv.org/pdf/1410.1826
Aldridge, M., Johnson, O. and Scarlett, J. Improved group testing rates with constant column weight designs. Preprint.
http://arxiv.org/pdf/1602.03471
Aliev, I.
On the lattice programming gap of the group problems. Oper. Res. Lett 43 (2015)
99-202.
http://dx.doi.org/10.1016/j.orl.2015.01.008
http://arxiv.org/pdf/1404.6967
Aliev, I., Bassett, R., De Loera, J. A. and Louveaux, Q.
A Quantitative Doignon-Bell-Scarf Theorem, Preprint.
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. Preprint.
http://arxiv.org/pdf/1409.5259
Allen, P., Böttcher, J., Hàn, H., Kohayakawa, Y. and Person, Y.
Powers of Hamiltonian cycles in pseudorandom graphs. Combinatorica, to appear.
http://arxiv.org/pdf/1402.0984
Allen, P., Böttcher, J., Hladký, J. and Piguet, D.
A density Corrádi-Hajnal theorem. Canad J. Math. 67 (2015) 721-758.
http://dx.doi.org/10.4153/CJM-2014-030-6
http://arxiv.org/pdf/1403.3837v2
Allen, P., Böttcher, J., Griffiths, S., Kohayakawa, Y. and Morris, R. D.
Chromatic thresholds in sparse random graphs. Preprint.
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. Preprint.
http://arxiv.org/pdf/1508.03870
Allen, P., Böttcher, J., Kohayakawa, Y. and Roberts, B.
Triangle-free subgraphs of random graphs. Preprint.
http://arxiv.org/pdf/1507.05226
Alpers, A. and Larman, D. G.
The smallest sets of points not determined by their X-rays. Bull. Lond. Math. Soc. 47
(2015) 171-176.
http://dc.doi.org/10.1112/blms/bdu111
http://arxiv.org/pdf/1406.0781
Alqahtani, H. M. and Erlebach, T.
Minimum activation cost edge-disjoint paths in graphs with bounded tree-width. Lect.
Notes Comput. Sci. 9538 (2016) 13-24.
http://dx.doi.org/10.1007/978-3-319-29516-9_2
Alstrup,, S., Georgakopoulos, A., Rotenberg, E. and Thomassen, C.
A Hamiltonian Cycle in the Square of a 2-connected Graph in Linear Time. Preprint
https://homepages.warwick.ac.uk/~maslar/LinearTimeFleischner.pdf
Amato, D. and Evans, D. M.
Infinite primitive and distance transitive directed graphs of finite out-valency. J.
Comb. Theory Ser. B. 114 (2015) 33-50.
http://dx.doi.org/10.1016/j.jctb.2015.03.003
http://arxiv.org/pdf/1405.2761
Amini, O., Devroye, L, Griffiths, S. and Olver, N.
Explosion and linear transit times in infinite trees. Probab. Theory. Relat. Fields, to
appear.
http://arxiv.org/pdf/1411.4426
Anabanti, C. S. and Hart, S. B.
On a conjecture of Street and Whitehead on locally maximal product-free sets.
Preprint.
http://arxiv.org/pdf/1506.02430
Anabanti, C. S. and Hart, S. B.
A note on filled groups, Preprint.
http://arxiv.org/pdf/1512.05117
Anderson, I.
Magic polygons and Shoesmith labellings. Bull. Inst. Comb. Appl. 74 (2015) 103-112.
Ando, H., Estrada, E. and Vargas-Estrada. E.
Communicability Angles Reveal Critical Edges for Network Consensus Dynamics.
Physical Review E, 92 (2015) 05809
http://dx.doi.org/10.1103/PhysRevE.92.052809
http://arxiv.org/pdf/1507.05881v1
André, J. Araújo, J. and Cameron, P. J.
The classification of partition homogeneous groups with applications to semigroup
theory. J. Algebra 452 (2016) 288-310
http://dx.doi.org/10.1016/j.jalgebra.2015.12.025 ;
http://arxiv.org/pdf/1304.7391
Andreou, M. I., Fotakis,D. , Lesta, V. P. Nikoletseas, S. E. and ,Spirakis, P. G.
On Radiocoloring Hierarchically Specified Planar Graphs: PSPACE -completeness
and Approximations. Algorithms, Probability, Networks, and Games 2015: 97-132
http://dx.doi.org/10.1007/978-3-319-24024-4_8
Anjum, A., Bagdasar, O. D. and Larcombe, P. J.
On the Structure of Periodic Complex Horadam Orbits, Carpathian J. Mathematics,
32 (2016) .29-36.
Apostolico, A., Crochemore, M., .Farach-Colton,M., Galil, V. and
Muthukrishnan, S.
40 years of suffix trees. Commun. ACM 59 (2016) 66-73.
http://dl.acm.org/citation.cfm?doid=2810036
Aprahamian, M., Higham, D. J. and Higham, N. J. Matching Exponential-Based and Resolvent-Based Centrality Measures. Preprint.
http://eprints.ma.man.ac.uk/2305/01/covered/MIMS_ep2015_3.pdf
Araújo, J., Bentz, W., Mitchelll, J. D. and Schneider, Cs.
The rank of the semigroup of transformations stabilising a partition of a finite set
Math. Proc. Camb. Philos. Soc. 159 (2015) 339 – 353
http://dx.doi.org/10.1017/S0305004115000389
http://arxiv.org/pdf/1404.1598
Araújo, J.. and Cameron, P. J.
Two Generalizations of Homogeneity in Groups with Applications to Regular
Semigroups. Trans. Am. Math. Soc. 368 (2016) 1159-1188.
http://dx.doi.org/10.1090/tran/6368
http://arxiv.org/pdf/1204.2195
Araújo, J.. and Cameron, P. J.
Permutation groups and transformation semigroups: results and problems,
Proceedings of Groups St Andrews 2013, 128-141. Lond. Math. Soc. Lect. Note.
Ser.422, (2015)., CUIP. ISBN 978-1-107-51454-6;
http://arxiv.org/pdf/1308.3585
Araújo, J.. and Cameron, P. J.
Orbits of Primitive k-Homogenous Groups on (n-k)-Partitions with Applications to
Semigroups. Preprint.
http://arxiv.org/pdf/1512.05608
Araújo, J.., Cameron, P. J. and Steinberg, B.
Between primitive and 2-transitive: Synchronization and its friends. Preprint.
http://arxiv.org/pdf/1511.03184
Araújo, J. [see: André, J.]
Archdeacon, D. S., Griggs, T. S. and Psomas, C.
Representing graphs in Steiner triple systems. – II. Australas. J. Combin., to appear.
Ardila, F., Rincón, E. F. and Williams, L. K.
Positroids and non-crossing partitions. Trans. Am. Math. Soc. 368 (2016) 337-363.
http://dx.doi.org/10.1090/tran/6331
http://arxiv.org/pdf/1310.4159
Arulselvan, A., Cseh, A., , Gross, M. Manlove D. F. and Matuschke, J.
Many-to-one matchings with lower quotas: ISAAC 2015. Lect. Notes Comput. Sci.
9472 (2015) 176-187.
http://dx.doi.org/10.1007/978-3-662-48971-0_16
http://arxiv.org/pdf/1412.0325
Aschenbrenner M., Dolich A., Haskell D., Macpherson, H. D. and Starchenko, S. Vapnik-Chervonenkis density in some 5theories with the independence property.
Trans. Am. Math. Soc, to appear.
http://arxiv.org/pdf/1109.5438
Atkins, R. and McDiarmid, C. J. H.
Extremal Distances for Subtree Transfer Operations in Binary Trees. Preprint.
http://arxiv.org/pdf/1509.00669
Atkins, R., Rombach, M. P. and Skerman, F.
Guessing Numbers of Odd C:ycles. Preprint.
http://arxiv.org/pdf/1602.03586
Atkinson, M. D.
[see: Albert, M. H.]
Atminas, A., Brignall, R., Well-quasi-ordering and finite distinguishing number Preprint.
http://users.mct.open.ac.uk/rb8599/papers/wqo-distnumber.pdf
Atminas, A., Collins, A., Foniok, J. and Lozin, V. V.
Deciding the Bell number for hereditary graph properties. SIAM J. Discrete Math., to
appear.
http://arxiv.org/pdf/1405.3118
Atminas, A. and Lozin, V. V.
Labelled induced subgraphs and well-quasi-ordering, Order 32 (2015) 313-328
http://dx.doi.org/10.1007/s11083-014-9333-9
Aval, J.-C., D’Adderio, M., Dukes, W. M. B. and Le Borgne, Y.
Two operators on sandpile configurations, the sandpile model on the complete
bipartite graph, and a Cyclic Lemma. Adv. Appl. Math. 73 (2016) 59-68.
http://dx.doi.org/10.1016/j.aam.2015.09.018
http://arxiv.org/pdf/1307.7740
Avgustinovich, S., Kitaev, S., Potapov, V. and Vajnovszki, V.
Gray coding cubic planar maps. Theor. Comput. Sci. 616 (2016) 59-69
http://dx.doi.org/10.1016/j.tcs.2015.12.013
http://arxiv.org/pdf/1509.05807
Awang, J.,. Pfeiffer, M. and Ruškuc, N.
Finite presentability and isomorphism of Cayley graphs of monoids,. Preprint.
http://arxiv.org/pdf/1602.08502
Azad, A, Britnell, J. R. and Gill, N.
Nilpotent covers and non-nilpotent subsets of finite groups of Lie type. Forum Math.,
27 (2015) 3745-3762.
http://dx.doi.org/10.1515/forum-2013-0176
http://arxiv.org/pdf/1305.3748
Azenhas, O., King, R. C. and Terada, I.
The involutive nature of the Littlewood-Richardson commutativity bijection
http://arxiv.org/pdf/1603.05037
Badkobeh, G., Fiti, G. and Liptak, Zs.
On the Number of Closed Factors in a Word. LATA 2015 381-390
http://dx.doi.org/10.1007/978-3-319-15579-1_29
http://arxiv.org/pdf/1305.6395
Badkobeh, G. and Ochem, P.
Characterization of some binary words with few squares. Theor. Comput. Sci. 588
(2015) 73-80
http://dx.doi.org/10.1016/j.tcs.2015.03.044
Bagdasar, O. D.
[see: Anjum, A.]
Bailey, R. A.
Structures defined by factors. In: Handbook of Design and Analysis of Experiments
(eds. A. Dean, M. Morris, J. Stufken and D. Bingham), Chapman and Hall/ CRC
Handbooks of Modern Statistical Methods, Chapman and Hall/ CRC (2015), Chapter
10, 371–414.
Bailey, R. A., Diaconis, P., Rockmore, D. N. and Rowley, C.
A spectral analysis approach for experimental designs. In Excursions in Harmonic
Analysis, Volume 4 (eds. R. Balan, M. Begué, J. J. Benedetto, W. Czaja and K. A.
Okoudjou), Springer International Publishing (2015), pp. 367–395
http://dx.doi.org/10.1007/978-3-319-20188-7_14
Bailey, R. A.,, Cameron, P. J., Filipiak, K., Kunert, J. and Markiewicz, A.
On optimality and construction of circular repeated-measurements designs. Statistica
Sinica , to appear.
http://arxiv.org/pdf/1410.1661
Bal, D., Bennett, P., Cooper, C., Frieze, A. M. and Prałat, P.
Rainbow arborescence in random digraphs. J. Graph Theory, to appear.
http://www.math.cmu.edu/~af1p/Texfiles/Arborescence.pdf
Baladi, V. and Todd. M.
Linear response for intermittent maps. Comm. Math. Phys., to appear.
http://arxiv.org/pdf/1508.02700
Baldassini, L.
[see: Aldridge, M.[
Balister, P. N., Bollobás, B., Füredi, Z., Leader, I. B. and Walters, M. J.
Subtended Angles. Isr. J. Math.,. to appear.
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., to appear.
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, to appear.
Balister, P. N., Bollobás, B. and Janson, S.
Consistent random vertex-orderings of graphs. Preprint.
http://arxiv.org/pdf/1506.03343
Balister, P. N. , Bollobás, B., Przykucki, M. and Smith, P.
Subcritical U-neighbourhood family percolation models have non-trivial phase
transitions. Trans. Am. Math. Soc. 368 (2016) 7385-7411.
http://www.ams.org/journals/tran/0000-000-00/S0002-9947-2016-06586-1/S0002-
9947-2016-06586-1.pdf
Balister, P. N., Bollobás, B. and Smith, P.
The time of bootstrap percolation in two dimensions. Probab. Theory. Rel. Fields
(2015) 1-44.
http://dx.doi.org/10.1007/s00440-015-0657-1
http://arxiv.org/pdf/1305.5444
Balister, P. N. and Gerke, S.
Controllability and matchings in random bipartite graphs. In: Surveys in
Combinatorics 2015. Lond. Math. Soc. Lect.Note Ser. 424 119-146.
ISBN-13: 9781107462502
Balister, P. N. , Gerke, S. and McDowell, A.
Adversarial resilience of matchings in bipartite random graphs. J. Comb., to appear.
Balle, B.
[see: Addario-Berry., L.]
Balog, A. and Roche-Newton, O.
New sum-product estimates for real and complex numbers. Discrete Comput. Geom.,
53 (2015) 825-846.
http://dx.doi.org/10.1007/s00454-015-9686-x
http://arxiv.org/pdf/1402.5775
Balogh, J., Bollobás, B. and Narayanan, B. P.
Transference for the Erdos–Ko–Rado theorem. Forum Math. Sigma 3 e23.
http://dx.doi.org/10.1017/fms.2015.21
https://www.dpmms.cam.ac.uk/~bp338/pdf/disj_pairs.pdf
Balogh, J., Butterfield, J., Hu, P. and Lenz, J.
Mantel's Theorem for Random Hypergraphs, Random Struct. Algorithms, to appear.
http://arxiv.org/pdf/1310.1501
Balogh, J., Butterfield, J., Hu, P., Lenz, J. and Mubayi, D.
On the Chromatic Thresholds of Hypergraphs. Combin. Probab. Comput. 25 (2016)
172-212.
http://dx.doi.org/10.1017/S0963548315000061
http://arxiv.org/pdf/1103.1416
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., to appear.
http://arxiv.org/pdf/1411.4645
Balogh, J., Hu, P., Lidický, D., Pikhurko, O., Udvari, B. and Volec, J. Minimum number of monotone subsequences of length 4 in permutations. Combin.
Probab. Comput. 24 (2015) 658-679.
http://dx.doi.org/10.1017/S0963548314000820 http://www.math.uiuc.edu/~jobal/cikk/monoSeq-1.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., Sharifzadeh, M. and Treglown, A.
The number of maximal sum-free subsets of integers. Proc. Am. Math. Soc, 143 (2015)
4713-4721.
http://dx.doi.org/10.1090/S0002-9939-2015-12615-9
http://web.mat.bham.ac.uk/~treglowa/sumfreepaper.pdf
Balogh, J., Morris, R. D., Samotij, W. and Warnke, L.
The typical structure of 𝐾𝑟+1 -free graphs. Trans. Am. Math. Soc, 368 (2016)
6439--6485.
http://www.math.uiuc.edu/~jobal/cikk/typstructure.pdf
Balogh, J., Mousset, F. and Skokan, J.
An extension of Dirac's Theorem. Preprint.
http://www.math.uiuc.edu/~jobal/cikk/path_cover_final.pdf
Balogh, J., Treglown, A. and Wagner, Zs. A. Applications of graph containers in the Boolean lattice. Preprint.
http://web.mat.bham.ac.uk/~treglowa/BaTrWaUPDATE.pdf
Bampalas, G., Elwes, R. and Lewis-Pye, A.
Minority population in the one-dimensional Schelling model of segregation. Preprint.
http://arxiv.org/pdf/1508.02497
Banaji, M. and Rutherford, C. G.
Some results on the structure and spectra of matrix products. Linear Algebra
Appl.474 (2015) 192-212.
http://dx.doi.org/10.1016/j.laa.2015.02.008
http://arxiv.org/pdf/1405.7299
Bárány, I., Fabila-Monroy, R. and Vogtenhuber, B.
(n,m)-Fold Covers of Spheres. Proceedings of the Steklov Institute of Mathematics
288 (2015) 203-208.
http://dx.doi.org/10.1134/S0081543815010150
http://arxiv.org/pdf/1410.0056
Bárány, I., Fodor, F., Martinez-Pérez, A., Montejaro, L., Oliveros, D. and Pór, A.
A fractional Helly theorem for boxes. Comput. Geom. 48 (2015) 221-224.
http://dx.doi.org/10.1016/j.comgeo.2014.09.007
http://arxiv.org/pdf/1410.0467
Bárány, I. and Grinberg, V. S.
Block Partitions of Sequences. Isr. J. Math.206 (2015) 155-164.
http://dx.doi.org/10.1007/s11856-014-1137-5
http://arxiv.org/pdf/1308.2452v3
Bárány, I. , Matoušek, J. and Pór, A.
Curves in 𝑅𝑑 intersecting every hyperplane at most 𝑑 + 1 times. In SOCG’14,
565-571.
http://dx.doi.org/10.1145/2582112.2582132
http://arxiv.org/pdf/1309.1147.pdf
Barber, B., Hindman, N., Leader, I. B. and Strauss, D.
Partition regularity without the columns property. Proc. Am. Math. Soc. 143 (2015)
3387-3399.
http://dx.doi.org/10.1090/S0002-9939-2015-12519-1
http://www.bristol.ac.uk/maths/people/ben-a-barber/pub/52103385
Barber, B., Kühn, D., Lo, A., Montgomery, R. and Osthus, D.
Fractional Clique Decompositions of Dense Graphs and Hypergraphs. Preprint.
http://arxiv.org/pdf/1507.04985
Barber, B., Kühn, D., Lo, A. and Osthus, D.
Edge-decompositions of graphs with high minimum degree. Adv. Math. 288 (2015)
337-385.
http://dx.doi.org/10.1016/j.aim.2015.09.032
http://www.bristol.ac.uk/maths/people/ben-a-barber/pub/52103761
Barber, B., Kühn, D., Lo, A., Osthus, D. and Taylor, A.
Clique decompositions of multipartite graphs and completion of Latin squares.
Preprint.
http://web.mat.bham.ac.uk/D.Kuehn/r_decompartite4.pdf
Barbero, F., Gutin, G., Jones, M. and Sheng, B.
Parameterized and Approximation Algorithms for the Load Coloring Problem. IPEC
2015 43-54.
http://dx.doi.org/10.4230/LIPIcs.IPEC.2015.43
http://arxiv.org/pdf/1412.3023
Barbero, F., Gutin, G., Jones, M.., Sheng, B. and Yeo, A.
Linear-Vertex Kernel for the Problem of Packing r-Stars into a Graph without Long
Induced Paths. Inf. Process. Lett. 116 (2016) 433-436.
http://arxiv.org/pdf/1510.03564
Barbosa, R., Ene, A. Nguyen, H. L. and Ward, J.
A New Framework for Distributed Submodular Maximization. Preprint.
http://arxiv.org/pdf/1507.03719v1.pdf
Barbour, A. D., Luczak, M. J. and Xia, A.
Multivariate approximation in total variation. Preprint.
http://arxiv.org/pdf/1512.07400
Barki, H., Boguslawski, P., Fadli, F., Mahdjoubi, L. and Zverovich, V. E.
Emergency response in complex buildings: Automated selection of safest and
balanced routes. Computer-Aided Civil and Infrastructure Engineering, to appear.
http://dx.doi.org/10.1111/mice.12197
Barki, H., Boguslawski, P., Fadli, F., Mahdjoubi, L. and Zverovich, V. E.
Two-graph building interior representation for emergency response applications.
ISPRS conference, to appear.
Barki, H., Boguslawski, P., Fadli, F., Mahdjoubi, L. and Zverovich, V. E.
BIM-GIS modelling in support of emergency response applications. In: Building
Information Modelling (BIM) in Design, Construction and Operations. Mahdjoubi, L.,
Brebbia, C. and Laing, R., eds. (149) WIT Press, 381-392.
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, to appear.
Barrantes, D., Gill, N. and Ramirez, J.
Abelian covers of alternating groups. Preprint.
http://arxiv.org/pdf/1510.05953
Barta, J., Montemanni, R. and Smith, D. H.
Graph Colouring and Branch and Bound Approaches for Permutation Code
Algorithms. WorldCIST 2016: 223-232
http://dx.doi.org/10.1007/978-3-319-31232-3_21
Barton, C., Iliopoulos, C. S., Kundu, R., Pissi, S. P., Retha, A. and Vayani, F.
Accurate and Efficient Methods to Improve Multiple Circular Sequence Alignment.
Lect. Notes. Comput. Sci. 9125 (2015) 247-258.
http://dx.doi.org/10.1007/978-3-319-20086-6_19
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, to appear.
Bastowski, S., Moulton, V., Spillner, A. and Wu, T.
Neighborhoods of trees in circular orderings. Bull. Math. Biol. 77 (2015) 46-70.
http://dx.doi.org/10.1007/s11538-014-0049-1
Bauer, D., Nevo, A., Schmeichel, E., Woodall D. R. and Yatauro, M.
Best monotone degree conditions for binding number and cycle structure, Discrete
Appl. Math. 195 (2015) 8–17
http://dx.doi.org/10.1016/j.dam.2013.12.014
Baur, K. and Martin, P. P.
The fibres of the Scott map on polygon tilings are the flip equivalence classes.
Preprint.
http://arxiv.org/pdf/1601.05080
Bazgan, C, Bredereck, R., Hartung, S., Nichterlein, A. and Woeginger, G. J.
Finding large degree-anonymous subgraphs is hard. Theor. Comput. Sci. 622 (2016)
90–110
http://dx.doi.org/10.1016/j.tcs.2016.02.004
Bazzi, M, Fenn, D. J., Howison, S. D., McDonald, M.,. Porter, M. A. and
Williams, S.
Community Detection in Temporal Multilayer Networks, and its Application to
Correlation Networks. Multiscale Modeling and Simulation: A SIAM
Interdisciplinary Journal.
http://arxiv.org/pdf/1501.00040
Bean, C., Claesson, A. and Ulfarsson, H.
Simultaneous Avoidance of a Vincular and a Covincular Pattern of Length 3. Preprint.
http://arxiv.org/pdf/1512.03226
Bednarska-Bzdega, M., Hefetz, D. and Łuczak, T. Picker-Chooser fixed graph games. J. Comb. Theory. Ser. B 119 (2016) 122-154.
http://dx.doi.org/10.1016/j.jctb.2015.12.008
http://web.mat.bham.ac.uk/D.Hefetz/MyPapers/FixedGraphGamesWCpaper.pdf
Bednarska-Bzdega, M., Hefetz , D., Krivelevich, M. and Łuczak, T.
Manipulative waiters with probabilistic intuition. Combin. Probab. Comput., to
appear.
http://web.mat.bham.ac.uk/D.Hefetz/MyPapers/WCBigPaper.pdf
Beineke, L. W. and Wilson, R. J.
Topics in Chromatic Graph Theory, Cambridge University Press, 2015
ISBN: 9781107033504
http://www.cambridge.org/gb/academic/subjects/mathematics/discrete-mathematics-
information-theory-and-coding/topics-chromatic-graph-theory
Bell, J., Launois, S., Moosa, R. and Sanchez, O. L.
Poisson algebras via model theory and differential-algebraic geometry.J. Eur. Math.
Soc.,. to appear.
http://arxiv.org/pdf/1406.0867v3
Benjamini, I. and Ellis, D. Juntas in the ℓ1-grid and Lipschitz maps between discrete tori
†. Random Struct.
Algorithms, to appear.
http://arxiv.org/pdf/1311.6958.pdf
Bennett, P.
[see; Bal, D.]
Bentz, W.
[see: Araújo, J.]
Benzi, M. and Estrada, E.
Core-satellite Graphs, Clustering, Assortativity and Spectral Properties. Preprint.
http://arxiv.org/pdf/1510.07954
Ben-Zvi, A., Blackburn, S. R. and Tsaban, B.
A Practical Cryptanalysis of the Algebraic Eraser. Preprint.
http://arxiv.org/pdf/1511.03870
Berenbrink, P., Friedt\zky, T., Kling, P., Malmann-Trenn, F., Nagel, L. and
Wastell, C.
Self-stabilizing Balls & Bins in Batches. Preprint.
http://arxiv.org/pdf/1603.02188v1
Berenbrink, P., Friedt\zky, T., Malmann-Trenn, F., Meshkinfamfard, S. and
Wastell, C.
Threshold Load Balancing with Weighted Tasks. IPDPS 2015: 550-558
http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=7161543
Berget., A. and Fink, A.
Equivariant Chow classes of matrix orbit closures. Tranformation Groups, to appear.
http://arxiv.org/pdf/1507.05054v1
Bevan, D. Growth rates of permutation grid classes, tours in graphs, and the spectral radius.
Trans Am. Math. Soc., 367 (2015) 5863–5889
http://dx.doi.org/10.1090/S0002-9947-2015-06280-1
http://arxiv.org/pdf/1302.2037.pdf Bevan, D.
Intervals of permutation class growth rates. Combinatorica, to appear.
http://arxiv.org/pdf/1410.3679
Bevan, D.
The permutation classes Av(1234,2341) and Av(1243,2314). Australas. J. Comb. 64
(2016) 3–20.
http://ajc.maths.uq.edu.au/pdf/64/ajc_v64_p003.pdf
Bevan, D.
Permutations avoiding 1324 and patterns in Łukasiewicz paths. J. Lond. Math. Soc.
92 (2015) 105–122.
http://dx.doi.org/10.112/jlms/jdv020
http://arxiv.org/pdf/1406.2890
Bevan, D.
Permutation patterns: basic definitions and notation. Preprint.
http://arxiv.org/pdf/1506.06673
Bevan, D.
On the growth of permutation classes. Ph.D thesis.
http://arxiv.org/pdf/1506.06688
Bevan, D.
Large "De Bruijn" Cayley graphs and digraphs. Preprint.
http://arxiv.org/pdf/1507.08926
Bevan, D.
The permutation class Av(4213,2143). Preprint.
http://arxiv.org/pdf/1510.06328
Bevan, D., Erskine G. and Lewis, R. R.
Large circulant graphs of fixed diameter and arbitrary degree . Preprint.
http://arxiv.org/pdf/1506.04962
Bevan, D., Levin, D., Nugent, P., Pantone, J., Pudwell, L, Riehl, M. and Tlachac,
M L.
Pattern avoidance in forests of binary shrubs. Preprint.
http://arxiv.org/pdf/1510.08036
Bevan Thompson, H.,. Burrage, K., Burrage, P., Donovan, D. M., McCourt, T. A.
and Sule Yazici, E. Estimates of the coverage of parameter space by Latin Hypercube and Orthogonal
sampling: connections between Populations of Models and Experimental Designs.
Preprint.
http://arxiv.org/pdf/1510.03502
Bezakova, I., Galanis, A,., Goldberg, L. A., Guo, H. and Štefankovič, D.
Approximation via Correlation Decay when Strong Spatial Mixing Fails.Preprint.
http://arxiv.org/pdf/1510.09193
Bhattacharya, B. B., Ganguly, S., Lubetzky, E. and Zhao, Y.
Upper tails and independence polynomials in random graphs. Preprint.
https://arxiv.org/pdf/1507.04074
Bhupatiraju, S., Hanson, J. and Járai, A. A.
Inequalities for critical exponents in d-dimensional sandpiles. Preprint.
http://arxiv.org/pdf/1602.06475
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, to appear.
http://www.cs.bme.hu/~pbiro/BFI13jh_proc.pdf
Biró, P., Kern, W., Paulusma, D. and Wojuteczky, P.
The Stable Fixtures Problem with Payments. WG2015. Lcct. Notes. Comput. Sci., to
appear.
http://arxiv.org/pdf/1508.06420v1.pdf
Blackburn, S. R. Maximum likelihood decoding for multilevel channels with gain and offset mismatch.
IEEE Trans. Inform. Theory, to appear.
http://arxiv.org/pdf/1509.02748
Blackburn, S. R. Probabilistic existence results for separable codes. IEEE Trans. Inform. Theory 61
(2015) 5822-5827.
http://dx.doi.org/10.1109/TIT.2015.2473848
http://arxiv.org/pdf/1505.02597v2
Blackburn, S. R. and Claridge, J.
Finite field matrix channels for network coding. Preprint.
http://arxiv.org/pdf/1601.06037v1
Blackburn, S.R., Konyagin, S. V. and. Shparlinski, I. E.
Counting additive decompositions of quadratic residues in finite fields. Funct.
Approximatio. 52 (2015) 223-227
http://dx.doi.org/10.7169/facm/2015.52.2.3
http://arxiv.org/pdf/1403.2589v1
Blackburn, S. R., Schouhamer Immink, K. A. and Weber, J. H. Pearson codes. IEEE Trans. Inform. Theory, 62 (2016) 131-135
http://dx.doi.org/10.1109/TIT.2015.2490219
http://arxiv.org/pdf/1509.00291
Blackburn, S. R. and Robshaw, M. J. B.
On the security of the Algebraic Eraser tag authentication protocol. Preprint.
http://arxiv.org/pdf/1602.00860.pdf
Blackburn, S. R.
[see: Ben-Zvi, A.]
Bleak, C. and Quick, M.
The infinite simple group V of Richard J. Thompson: presentations by permutations.
Preprint.
http://arxiv.org/pdf/1511.02123
Bloom, T. and Liebenau, A.
Ramsey equivalence of 𝐾𝑛 and 𝐾𝑛 + 𝐾𝑛−1. Preprint.
http://arxiv.org/pdf/1508.03866
Bocus, M. Z., Coon, J. P., Dettmann, C. P., Georgiou, O. and Rahman, M. R.
Network connectivity in non-convex domains with reflections. IEEE Commun. Lett.
19 427-430 (2015).
http://dx.doi.org/10.1109/LCOMM.2014.2385089
http://arxiv.org/pdf/1412.4957
Bocus, M. Z., Coon, J. P., Dettmann, C. P., Georgiou, O. and Wang, S.
Location, location, location: Border effects in interference limited ad hoc networks.
Wiopt 2015 568-575 (2015
http://www.maths.bris.ac.uk/~macpd/toshiba/Location.pdf
Bocus, M. Z., Coon, J. P., Dettmann, C. P., Georgiou, O. and Wang, S.
Directional antennas improve the link-connectivity of interference limited ad hoc
networks. PIMRC2015.
http://www.maths.bris.ac.uk/~macpd/toshiba/noisybeams.pdf
Boczkowski, L. Peres, Y. and Sousi, P.
Sensitivity of mixing times in Eulerian digraphs. Prperint.
http://www.statslab.cam.ac.uk/~ps422/rw-directed-graphs.pdf
Bode, M., Fountoulakis, N. and Müller, T.
On the largest component of a hyperbolic model of complex networks. Electron J.
Comb. 22 (2015) P3,24
http://www.combinatorics.org/ojs/index.php/eljc/article/download/v22i3p24/pdf
Bode, M., Fountoulakis, N. and Müller, T.
The probability that the hyperbolic random graph is connected, Random Struct.
Algorithms, to appear.
http://web.mat.bham.ac.uk/N.Fountoulakis/BFM.pdf
Bode,. M.
[see: Abdullah, M.,]
Bodirsky, M. Dalmau, V. Martin, B. and Pinsker, M.
Distance constraint satisfaction problems. Inf. Comput. 247 (2016) 87-105 .
http://dx.doi.org/10.1016/j.ic.2015.11.010
http://arxiv.org/pdf/1004.3842v2
Bodirsky, M. and Macpherson, H. D.
Reducts of structures and maximal-closed permutation groups. J. Symb. Log., to
appear.
http://arxiv.org/pdf/1310.6393v2
Bodirsky, M., Martin, B. and Mottet, A.
Constraint Satisfaction Problems over the Integers with Successor. Lect. Notes
Comput. Scu, 9134 (2015) 256-267
http://dx.doi.org10.1007/978-3-662-47672-7_21
http://arxiv.org/pdf/1503.08572
Bodirsky, M., Martin, B., Pinsker, M. and Pongrácz, A.
Constraint satisfaction problems for reducts of homogeneous graphs. Preprint.
http://arxiv.org/pdf/1602.05819
Boguslawski, P.
[see: Barki, H.]
Bollobás, B., Duminil-Copin, H., Morris, R. D. and Smith, P.
The sharp threshold for the Duarte model. Preprint.
http://arxiv.org/pdf/1603.05237
Bollobás, B., and Eccles, T.
Partial Shadows of Set Systems. Comb..Probab. Comput. 24 (2015) 825-828.
http://dx.doi.org/10.1017/S0963548314000790
Bollobás, B., Griffiths, S., Morris, R. D., Rolla, L. and Smith, P.
Nucleation and growth in two dimensions. Preprint.
http://arxiv.org/pdf/1508.06267
Bollobás, B., Janson, S. and Scott, A. D.
Packing random graphs and hypergraphs. Random Sruct. Algorithms, to appear. .
http://arxiv.org/pdf/1408.6354
Bollobás, B., Kittipassorn, T., Narayaman, B. and Scott, A. D.
Disjoint induced subgraphs of the same order and size. Eur J. Comb. 49 (2015)
153-166.
http://dx.doi.org/10.1016/j.ejc.2015.03.005
http://people.maths.ox.ac.uk/scott/Papers/disjoint.pdf
Bollobás, B., Narayanan, B. P. and Raigordskii, A. M. On the stability of the Erdős-Ko-Rado theorem. J. Comb. Theory, Ser. A 137 (2016) 64-78
http://dx.doi.org/10.1016/j.jcta.2015.08.002
https://www.dpmms.cam.ac.uk/~bp338/pdf/ekr_stability.pdf
Bollobás, B., Przykucki, M. J., Riordan, O. M. and Sahasrabudhe, J.
On the maximum running time in graph bootstrap percolation. Preprint.
http://arxiv.org/pdf/1510.07096
Bollobás, B. and Riordan, O. M. Counting Connected Hypergraphs via the Probabilistic Method. Combin. Probab.
Comput. 25 (2016) 21-75
http://dx.doi.org/10.1017/S0963548315000309
http://arxiv.org/pdf/1404.5887
Bollobás, B. and Riordan, O. M. Counting dense connected hypergraphs via the probabilistic method. Preprint.
http://arxiv.org/pdf/1511.04739v1
Bollobás, B. and Scott, A. D.
On a problem of Erdős and Moser. Abhandlungen des Mathematischen Seminars der
Universität Hamburg, to appear.
http://people.maths.ox.ac.uk/scott/Papers/erdosmoser.pdf
Bollobás, B., Smith, P. and Uzzell, A. J.
Monotone Cellular Automata in a Random Environment. Combin. Probab. Comput.,
24 (2015) 687–722
http://dx.doi.org/10.1017/S0963548315000012
http://arxiv.org/pdf/1204.3980.pdf
Bollobás, B.
[see: Balister, P. N., Balogh, J.]
Bonamy, M., Bousquet, N., Feghali, C. and Johnson, M.
On a conjecture of Mohar concerning Kempe equivalence of regular graphs. Preprint.
http://arxiv.org/pdf/1510.06964v2
Bordewich, M., Greenhil, C. S. and Patel, V.
Mixing of the Glauber dynamics for the ferromagnetic Potts model. Random Struct.
Algorithms 48 (2016) 21-52.
http://dx.doi.org/10.1002/rsa.20569
http://arxiv.org/pdf/1305.0776v2
Bordewich, M. J. and Semple, C.
Defining a Phylogenetic Tree with the Minimum Number of r-State Characters. SIAM
J. Discrete Math. 29 (2016) 835-853.
http://dx.doi.org/10.1137/130924469
Bordewich, M. J. and Semple, C.
Determining phylogenetic networks from inter-taxa distances. J. Math. Biol, to appear.
http://dx.doi.org/10.1137/130924469
Bordewich, M. J. and Semple, C.
Reticulation-Visible Networks. Preprint.
http://arxiv.org/pdf/1508.05424.pdf
Böttcher, J., Hladký, J., Piguet, D. and Taraz, A.
An approximate version of the Tree Packing Conjecture. Isr J. Math., 211 (2016)
391-446.
http://dx.doi.org/10.1007/s11856-015-1277-2
http://arxiv.org/pdf/1404.0697v3
Böttcher, J., Kohayakawa, Y., Taraz, A. and Würfl, A.
An Extension of the Blow-up Lemma to arrangeable graphs. SIAM J. Discrete Math.,
29 (2015) 962-1001.
http://dx.doi.org/10.1137/13093827X
http://arxiv.org/pdf/1305.2059.pdf
Böttcher, J., Kohayakawa, Y., Taraz, A. and Würfl, A.
Spanning embeddings of arrangeable graphs with sublinear bandwidth. Random
Struct. Algorithms 48 (2015) 270-289
http://dx.doi.org/10.1002/rsa.20593
http://arxiv.org/pdf/1305.2078v1
Böttcher, J.
[see: Allen, P.]
Bougeret, N., Girodeau, R., and Watrigant, R.
Approximating the Sparsest k-Subgraph in Chordal Graphs. Theor. Comput. Syst.,58
(2016) 111-132
http://dx.doi.org/10.1007/s00224-014-9568-2
Bousquet, N. and Perarnau, G.
Fast Recoloring of Sparse Graphs. Eur. .J. Comb. 52 (2016) 1-11
http://dx.doi.org/10.1016/j.ejc.2015.08.001
http://arxiv.org/pdf/1411.6997
Bousquet, N.
[see: Bonamy, M.]
Bradley-Williams, D.
[see: Bodirsky, M.]
Brandstädt, A., Dąbrowski, K. K., Huang, S. and Paulusma, D..
Bounding the Clique-Width of H-free Chordal Graphs. MFCS 2015. Lect. Notes
Comput. Sci. 9235 (2015) 139-150. 1
http://dx.doi.org/10.1007/978-3-662-48054-0_12
http://arxiv.org/pdf/1502.06948
Brandstädt, A., Brandstädt, A., Dąbrowski, K. K., Huang, S. and Paulusma, D.
Bounding the Clique-Width of H-free split raphs. Discrete Appl. Math., to appear. 2
http://arxiv.org/pdf/1509.04273v1
Brankovic, L, Iliopoulos, C. S., Kundu, R. , Mohamed, M., Pissis, S. P. and
Vayani, F.
Linear-Time Superbubble Identification Algorithm for Genome Assembly.Theor.
Comput. Sci. 609 (2016) 374-383.
http://dx.doi.org/10.1016/j.tcs.2015.10.021
http://arxiv.org/pdf/1505.04019
Bredereck, R..
[see: Bazgan, C]
Breuillard, E. and Tointon, M.
Nilprogressions and groups with moderate growth. Adv. Math. 289 (2016), 1008-1055.
http://dx.doi.org/10.1016/j.aim.2015.11.025
http://arxiv.org/pdf/1506.00886
Brewster, R. C., McGuinness, S., Moore, B. and Noel, J. A.
A Dichotomy Theorem for Circular Colouring Reconfiguration. Theor. Comput. Sci.,
to appear.
http://arxiv.org/pdf/1508.05573
Brewster, R. C. and Noel, J. A.
Mixing Homomorphisms, Recolorings, and Extending Circular Precolorings. J.
Graph Theory 80 (2015) 173-198.
http://dx.doi.org/10.1002/jgt.21846
http://people.maths.ox.ac.uk/noel/Mixing%20Paper.pdf
1 A conference version of this paper appeared in MFCS2015, Lect. Notes. Comput. Sci. 9235
(2015) 139-150. 2 A summary of this paper appared in Electon. Notes. Dsicrete Math. 49 (20115) 497-50.
Bridson, M. R. and Wilton, H.
Undecidability and the developability of permutoids and rigid pseudogroups. Sigma,
to appear.
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. Preprint.
http://arxiv.org/pdf/1510.05560
Brightwell, G. R. and Luczak, M. J.
The mathematics of causal sets. Recent trens in combinatorics, IMA Volume in
Mathematics and its Applications 159 (2016)
http://arxiv.org/pdf/1510.05612v1
Brignall, R., Korpelainen, N., and Vatter, V.
Linear clique-width for hereditary classes of cographs. J. Graph Theory, to appear.
http://users.mct.open.ac.uk/rb8599/papers/lcw-cographs.pdf
Brignall, R., Lozin, V. V. and Stacho, J.
Bichain graphs: geometric model and universal graphs. Discrete Appl. Math. 199
(2016) 16-29.
http://dx.doi.org/10.1016/j.dam.2014.08.031
http://users.mct.open.ac.uk/rb8599/papers/bichain.pdf
Brignall, R.
[see: Albert, M. H., Atminas, A.]
Britnell, J. R. and Wildon, M. R.
Computing derangement probabilities of the symmetric group acting on k-sets.
Preprint.
http://arxiv.org/pdf/1511.04106
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. Preprint.
http://arxiv.org/pdf/1507.04803
Britnell, J. R.
[see: Azad, A.]
Broersma, H. J., Fiala, J., Golovach, P. A., Kaiser, T. Paulusma, D. and
Proskurowski, A.
Linear-time algorithms for scattering number and hamilton-connectivity of interval
graphs. J. Graph Theory 79 (2015) 282-299.
http://dx.doi.org/10.1002/jgt.21832
http://arxiv.org/pdf/1301.5953
Bromberg, L., Shpilrain, V. and Vdovina, A.
Navigating in the Cayley graph of 𝑆𝐿2(𝐹𝑝) and applications to hashing. Semigroup
Forum, to appear.
http://eprint.iacr.org/2014/814.pdf
Broom, M., Pattni, K.,. Rychtář, J. and Silver, L J.
Evolutionary graph theory revisited: when is an evolutionary process equivalent to the
Moran process? Proc. R. Soc. Lond., Ser. A, Math. Phys. Eng. Sci., to appear.
http://dx.doi.org/10.1098/rspa.2015.0334
Brough T. and Cain, A. J.
Automaton semigroup constructions. Semigroup Forum 90 (2015) 763-774
http://dx.doi.org/10.1007/s00233-014-9632-x
http://arxiv.org/abs/1310.4852
Brough, T., Ciobanu, L, Elder, M. and Zetsche, G.
Permutations of context-free, ETOL and indexed languages. Preprint.
http://arxiv.org/pdf/1604.05431v1
Broutin, N. and Mailler, C.
And/or trees: A local limit point of view. Preprint.
http://arxiv.org/pdf/1510.06691
Browing, T. D. and Prendiville, S.
A transference approach to a Roth-type theorem in the squares. Preprint.
http://arxiv.org/pdf/1510.00136
Bruhn, H. and Joos, F.
A stronger bound for the strong chromatic index. Preprint.
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. Preprint.
http://arxiv.org/pdf/1412.2894
Bruin., H. and Todd, M.
Wild attractors and thermodynamic formalism. Monatsh. Math, 178 (2015) 39-83
http://dx.doi.org/10.1007/s00605-015-0747-2
http://arxiv.org/pdf/1202.1770
Bukh, B. and Conlon, D.
Rational exponents in extremal graph theory. Preprint.
http://people.maths.ox.ac.uk/~conlond/Rationalexponents.pdf
Buratti, M., Lovegrove, G. J. and Traetta, T.
On the full automorphism group of a Hamiltonian cycle system of odd order. Graphs
Comb. 31 (2015) 1855-1865.
http://dx.doi.org/10.1007/s00373-015-1584-8
http://arxiv.org/pdf/1501.06997
Buratti, M.
[see: Bailey, R. A.]
Burness, T. C. and Giudici, M.
Classical groups, derangements and primes . Australian Mathematical Society Lecture
Series. 25 Cambridge University Press, 2016, xviii+346. ISBN: 978-1-1076-2944-8
Burness, T. C. and Giudici, M.
Permutation groups and derangements of odd prime order. Preprint.
http://arxiv.org/pdf/1602.07617
Burness, T. C. and Tong-Viet, H. P.
Derangements in primitive permutation groups, with an application to character
theory. Quart J. Math. 66 (2015) 63-96.
http://dx.doi.org/10.1093/qmath/hau020
http://seis.bristol.ac.uk/~tb13602/docs/BTV_v8.pdf
Burness, T. C. and Tong-Viet, H. P.
Primitive permutation groups and derangements of prime power order. Manuscripta
Math., to appear.
http://arxiv.org/pdf/1410.5799
Burrage, K. [see: Bevan Thompson,H.,]
Burrage, P. [see: Bevan Thompson,H.,]
Buset, D., El Amiri, M., Erskine, G., Miller, M. and Pérez-Rosés, H.
A revised Moore bound for partially directed graphs.Discrete Math., to appear.
http://arxiv.org/pdf/1508.02596
Bushaw, N., Collares Neto, M., Morris, R. D. and Smith, P.
The Sharp Threshold for Maximum-Size Sum-Free Subsets in Even-Order Abelian
Groups. Combin. Probab. Comput., 24 (2015) 609-640.
http://dx.doi.org/10.1017/S0963548314000595
http://arxiv.org/pdf/1310.3236v2
Bushaw, N., Gunderson, K. and Kalikow, S.
Random-step Markov processes. Isr. J. Math., to appear. .
http://research-information.bristol.ac.uk/files/33916591/1410.1457v1
Butkovič, P.
On tropical supereigenvectors. Linear Algebra Appl., to appear.
http://web.mat.bham.ac.uk/P.Butkovic/My%20papers/Supereigs.pdf
Butkovič, P. and MacCaig, M.
A strongly polynomial method for solving integer max-linear programs in a generic
case. J. Optim. Theory. Appl. 165 (2015) 941-963.
http://dx.doi.org/10.1007/s10957-014-0596-5
http://web.mat.bham.ac.uk/P.Butkovic/My%20papers/IMLP.JOTA.secondrevision.pd
f
Butterfield, J.,
[see: Balogh, J.]
Buzzard, K. M. and Ciere, M.
Playing simple loony dots and boxes endgames optimally. Integers, 14 (2014) G08.
http://www.emis.de/journals/INTEGERS/papers/og8/og8.pdf 3
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., to appear.
http://arxiv.org/pdf/1311.4451
Cain, A. J., Gray, R. D. and Malheiro, A.
Rewriting systems and biautomatic structures for Chinese, hypoplactic, and sylvester
monoids. Int. J. Algebra Comput 25 (2015)
http://dx.doi.org/10.1142/S0218196715400044
http://arxiv.org/pdf/1310.6572
Cain, A. J.
[see: Brough, T.]
Camarena, O. A, Csóka, E., Hubai, T., Lippner, G. and Lovász, L.
Positive graphs. Eur. J. Comb.,52 (2016) 290-301.
http://dx.doi.org/10.1016/j.ejc.2015.07.007
http://arxiv.org/pdf/1205.6510
Cameron, P. J.
Asymmetric Latin squares, Steiner triple systems, and edge-parallelisms. Preprint.
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, ISBN 978-1-78634-029-0
Cameron, P. J. and Cioaba, S.
A graph partition problem, Amer. Math. Monthly; 122 (2015), 972-983
http://arxiv.org/pdf/1408.0371v1
Cameron, P. J., Castillo-Ramirez, A., Gadouleau. M. and Mitchell, J. D.
3 This was accidentally omitted from last year’s Bulletin – apologies.
Lengths of words in transformation semigroups generated by digraphs. Preprint.
http://arxiv.org/pdf/1602.00935
Cameron, P. J., Dang, A, N. and Riis, S.
Guessing Games on Triangle-free Graphs. Electron J. Combin 23 (2016) P1`.48.
http://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i1p48
Cameron, P. J., Fernandes, M. E., Leemans D. and Mixer, M.
String C-groups as transitive subgroups of Sym(n), J. Algebra 447 (2016) 468-478
http://dx.doi.org/10.1016/j.jalgebra.2015.09.040
http://arxiv.org/pdf/1410.5863v1
Cameron, P. J. and Kusuma, J.
𝑍4 codes and their Gray map images as orthogonal arrays. Preprint.
http://arxiv.org/pdf/1510.01509v1
Cameron, P. J. and Praeger, C. E.
Constructing flag-transitive, point-imprimitive designs, J. Algebr. Comb., 1-15.
http://dx.doi.org/10.1007/s10801-015-0591-4
http://arxiv.org/pdf/1408.6598
Cameron, P. J. and Spiga, P.
Most switching classes with primitive automorphism groups contain graphs with
trivial groups, Australas. J. Comb. 62 (2015) 76-90
http://arxiv.org/pdf/1407.5288
Cameron, P. J.
[see: Aalipour, G.,.Andre, J., Araújo, J., Bailey, R. A.]
Candellero, E. and Fountoulakis, N.
Bootstrap percolation and the geometry of complex networks. Stochastic Processes
Appl. 126 (2016)
http://dx.doi.org/10.1016/j.spa.2015.08.005
http://arxiv.org/pdf/1412.1301
Candellero, E. and Fountoulakis, N.
Clustering and the hyperbolic geometry of complex networks. Internet Math., to
appear.
http://arxiv.org/pdf/1309.0459
Candellero, E. and Roberts, M. I.
The number of ends of critical branching random walks. ALEA, Lat. Am. J. Probab.
Math. Stat., 12 (2015) 55–67.
http://arxiv.org/pdf/1401.0429
Candellero, E. andTeixero, A.
Percolation and isoperimetry on roughly transitive graphs. Preprint.
http://arxiv.org/pdf/1507.07765
Caputo, P., Martinelli, F., Sinclair, A. and Stauffer, A.
Random lattice triangulations: structure and algorithms. Ann. Appl. Probab., 25
(2015) 1650-1685.
http://dx.doi.org/10.1214/14-AAP1033 .
http://arxiv.org/pdf/1211.1784.pdf
Caputo, P., Martinelli, F., Sinclair, A. and Stauffer, A.
Dynamics of Lattice Triangulations on Thin Rectangles. Electro. J. Probab. , to
appear.
Carmesin, J., Federici, B. and Georgakopoulos, A.
A Liouville hyperbolic souvlaki. Preprint.
http://arxiv.org/pdf/1603.06712v1
Carvalho, C., Madelaine, F.R. and Martin, B.
From complexity to algebra and back: digraph classes, collapsibility and the PGP.
LICS2015. 462-474.
http://dx.doi.org/10.1109/LICS.2015.50
http://arxiv.org/pdf/1501.04558v1
Castillo-Ramirez, A. and Gadouleau, M.
Universal Simulation of Automata Networks. Preprint.
http://arxiv.org/pdf/1504.00169
Castillo-Ramirez, A. and Gadouleau, M.
Ranks of finite semigroups of one-dimensional cellular automata. Semigroup Forum,
to appear.
http://arxiv.org/pdf/1510.00197
Castillo-Ramirez, A. and Gadouleau, M.
On Finite Monoids of Cellular Automata. Proc. International workshop on cellular
automata and discrete complex systems, to appear.
http://arxiv.org/pdf/1601.05694
Castillo-Ramirez, A.
[see: Cameron, P. J.]
Cavenagh, N. J. and Griggs, T. S.
Subcubic trades in Steiner triple systems. Preprint.
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, to appear in Theory
of Computing Systems Theory Comput. Syst., to appear. 4
http://arxiv.org/pdf/1507.02866
Cechlárová, K., Fleiner, T., Manlove, D. F., McBride, I. and Potpinkova, E.
Modelling practical placement of trainnee teachers to schools. Central European
Journal of Operational Research, 23 (2015) 547-562
http://dx.doi.org/10.1007/s10100-014-0356-5
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.
Preprint
http://arxiv.org/pdf/1603.00858
Chaplick, S., Fiala, J., van 't Hof, P., Paulusma, D. and Tesar, M.
Locally constrained homomorphisms on graphs of bounded treewidth and bounded
degree. Theor. Comput. Sci., 590 (2015) 86-95.
http://dx.doi.org/10.1016/j.tcs.2015.01.028
http://arxiv.org/pdf/1408.6676
Chapuy, G. and Perarnau, G.
Connectivity in bridge-addable graph classes: the McDiarmid-Steger-Welsh
conjecture. Preprint.
http://arxiv.org/pdf/1504.06344v1.pdf
Chauvin, B., Gardy, C. and Mailler, C.
A sprouting tree model for random boolean functions. Random Struct. Algorithms
47 (2015) 635-652.
http://dx.doi.org/10.1002/rsa.20567
4 A conference version appeared in SAGT 2015, Lect. Notes. Comput. Sci. 9347 (2015) 27-
39, http://dx.doi.org/10.1007/978-3-662-48433-3_3
Chen, G. and Estrada, E.
Synchronizability of random rectangular graphs. Chaos 25 (2015) 083107
http://dx.doi.org/10.1063/1.4928333
Chen, T., Martin, B., Martin, J. and Rainmondi, F.
The packing chromatic number of the infinite square lattice is less than or equal to 16.
Preprint.
http://arxiv.org/pdf/1510.02374
Chen, T. Z. Q., Kitaev, S. and Sun, B. Y.
Word-representability of face subdivisions of triangular grid graphs. Graphs Comb.,
to appear.
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. Preprint.
http://arxiv.org/pdf/1507.06749
Chen, T. Z. Q., Kitaev, S. and Sun, B. Y.
On universal partial words over binary alphabets. Preperint.
http://arxiv.org/pdf/1601.06456
Chen, X., , Dyer, M. E.,.Goldberg, L. A., Jerrum, M. R. , Lu, P., McQuillan, C.
and Richerby, D.
The complexity of approximating conservative counting CSPs. J. Comput. Syst. Sci.
81 (2015) 311-329
http://dx.doi.org/10.1016/j.jcss.2014.06.006
Choi, I., Kim, J. and O,, S.
The Difference and Ratio of the Fractional Matching number and the Matching
number of Graphs. Discrete Math. 339 (2016) 1382-1386.
http://dx.doi.org/10.1016/j.disc.2015.12.005
http://web.mat.bham.ac.uk/~kimjs/papers/fractionalmatching/differratiofracmat.pdf
Choromanski, K., Falik, D., Liebenau, A., Patel, V. and Pilipczuk, M.
Excluding hooks and their complements. Preprint.
http://arxiv.org/pdf/1508.00634
Chow, S.
Roth--Waring—Goldbach. Preprint.
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
Chow, S.
Equidistribution of values of linear forms on a cubic hypersurface. Algebra & Number
Theory 10 (2016), 421–450
http://arxiv.org/pdf/1504.07837
Chow, S.
Mathematika 62 (2015) 13-46
Christofides, D. and Král’, D.
First order convergence and roots. Combin. Probab. Comput., 25 (2016) 213-221
http://dx.doi.org/10.1017/S0963548315000048
http://arxiv.org/pdf/1403.3049
Chudnovsky, M., Dvořak, Z., Klimošová, T. and Seymour, P. D.
Immersion in four-edge-connected graphs. J. Comb. Theory. Ser. B. 116 (2016)
208-218.
http://dx.doi.org/10.1016/j.jctb.2015.07.006
http://arxiv.org/pdf/1308.0827
Chudnovsky, M., Lo, I. Maffray, F.,. Trotignon, N. and Vusković, K.
Coloring Square-free Berge Graphs. Preprint.
http://arxiv.org/pdf/1509.09195
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., to appear.
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. III. Long holes
Combinatorica., to appear.
http://arxiv.org/pdf/1506.02232
Chudnovsky, M., Scott, A. D. and Seymour, P. D.
Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings.
Preprint.
https://people.maths.ox.ac.uk/scott/Papers/chandeliers.pdf
Chudnovsky, M., Scott, A. D. and Seymour, P. D.
Disjoint paths in unions of tournaments. Preprint.
https://people.maths.ox.ac.uk/scott/Papers/disjointpaths2.pdf
Chudnovsky, M., Trotignon, N., Trunck, T. and Vusković, K.
Coloring perfect graphs with no balanced skew-partitions. J. Comb. Theory. Ser B.
115 (2015) 26-65.
http://dx.doi.org/10.1016/j.jctb.2015.07.006
http://arxiv.org/pdf/1308.6444
Chun, C., Chun. D., Mayhew, D. and van Zwam, S. Fan-extensions in fragile matroids. Electron. J. Comb.,22 (2015) P2.30.
http://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i2p30/pdf
Chun, C., Ding, G., Mayhew, D. and Oxley, J. G.
Unavoidable connected matroids retaining a specified minor. Submitted.
http://www.math.lsu.edu/~oxley/cdmosplitter10.pdf
Chun, C., Mayhew, D. and Oxley, J. G.
Towards a Splitter Theorem for internally 4-connected binary matroids IX: The
theorem. Preprint.
http://www.math.lsu.edu/~oxley/chapter8_19.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 5
Chun, C. and Oxley, J. G.
Towards a Splitter Theorem for internally 4-connected binary matroids VII. Preprint.
http://www.math.lsu.edu/~oxley/chapter7_23.pdf
Chun, D.
[see: Chun, C.]
Ciere, M.
[see: Buzzard, K. M.]
Cioaba, S.
5 These two papers by Chun//Moffatt.Noble/Rueckrienen are an (expansion of and) spilltitng
of an earlier paper.
[see: Cameron, P. J.]
Ciobanu, L., Hermüller, S., Holt, D. F., and Rees, S. E.
Conjugacy languages in groups. Isr. J. Math. 211 (2016) 311-347.
http://www.mas.ncl.ac.uk/~nser/abstracts/cgarxiv.html
Ciobanu, L., Holt, D. F., and Rees, S. E. Rapid decay and Baum-Connes for large type Artin groups. Trans. Am. Math. Soc,
368 (2016) 6103-6129 http://dx.doi.org/10.1090/tran/6532
http://www.ams.org/journals/tran/2016-368-09/S0002-9947-2015-06532-5/S0002-
9947-2015-06532-5.pdf
Ciobanu, L., Holt, D. F., and Rees, S. E. The generalised word problem in hyperbolic and relatively hyperbolic groups.
Preprint.
http://arxiv.org/pdf/1511.00548
Ciobanu, L.
[see: Brough, T.]
Claesson, A., Tenner, B. E. and Úlfarsson, H.
Coincidence among families of mesh patterns.Australas. J. Comb. 63 (2015) 88-106.
http://arxiv.org/pdf/1412.0703
Claesson, A.
[see: Albert, M. H., Bean, C.]
Claridge, J.
[see: Blackburn, S. R.]
Clemens, D., Gebauer, H. and Liebenau, A.
The random graph intuition for the tournament game. Combin. Probab. Comput., 25
(2016) 76-88.
http://dx.doi.org/10.1017/S096354831500019X
http://www.dcs.warwick.ac.uk/~liebenau/tournamentGame.pdf
Clemens, D., Ferber, A., Glebov, R., Hefetz, D. and Liebenau, A.
Building Spanning Trees Quickly in Maker-Breaker Games SIAM J. Discrete Math.
29 (2015) 1683-1705.
http://dx.doi.org/10.1137/140976054
http://arxiv.org/pdf/1304.4108
Clifford, R., Fontaine, A., Porta, E., Sach, B. and Starkovskaya, T.
The k-mismatch problem revisited. SODA2016, 2039-2052. .
http://arxiv.org/pdf/1508.00731
Clifford, R., Fontaine, A., Porta, E., Sach, B. and Starkovskaya, T.
Dictionary Matching in a Stream. ESE 2015. Lect. Notes. Comput. Sci. 9294 (2015)
361-372.
http://dx.doi.org/10.1007/978-3-662-48350-3_31
http://arxiv.org/pdf/1504.06242
Clifford, R. and Starkovskaya, T.
Approximate Hamming distance in a stream. Preprint.
http://arxiv.org/pdf/1602.07241
Coates, T.
[see: Akhtar, M.]
Cochefort, M., Couturier, J.-F., Golovach, P. A., Kratsch, D. and Paulusma, D.
Parameterized algorithms for finding square roots. Algorithmica 74 (2016) 602-629.
http://dx.doi.org/10.1007/s00453-014-9967-4
http://arxiv.org/pdf/1310.5469
Codish, M., Frank, M., Itzhakov, A. and Miller, A.
Solving Graph Coloring Problems with Abstraction and Symmetry. Fifth International
Workshop on the Cross-Fertilization Between CSP and SAT, Cork, Aug 2015,
http://arxiv.org/pdf/1409.5189
Codish, M., Frank, M., Itzhakov, A. and Miller, A.
Computing the Ramsey number R(4,3,3) using abstraction and symmetry breaking,
Constraints, to appear.
http://arxiv.org/pdf/1510.08266
Cohen, D. A., Cooper, M. C., Escamocher, G. and Živeny, S.
Variable and value elimination in binary constraint satisfaction via forbidden patterns.
J. Comput. Syst. Sci. 81 (2015) 1127-1143.
http://dx.doi.org/10.1016/j.jcss.2015.02.001
http://arxiv.org/pdf/1502.03796
Cohen, D. A., Cooper, M. C., Jeavons, P. G. and Živny, S.
Binarisation via Dualisation for Valued Constraints. AAAI 2015, 3731-3737
http://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/view/9328/9699
Cohen, D. A., Cooper, M. C., Jeavons, P. G. and Živny, S.
Tractable Classes of Binary CSPs Defined by Excluded Topological Minors. IJCAI
2015, 1945-1951.
http://www.cs.ox.ac.uk/Stanislav.Zivny/homepage/publications/ccjz15ijcai-
preprint.pdf
Cohen, E., Perkins, W. and Tetali, P.
On the Widom-Rowlinson Occupancy Fraction in Regular Graphs. Preprint.
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. Preprint.
http://de.arxiv.org/pdf/1604.05108.pdf
Coja-Oghlan, A. and Perkins, W.
Belief propagation on replica symmetric random factor graph models . Preprint.
http://arxiv.org/pdf/1603.08191
Coja-Oghlan, A.. Perkins, W. and Skubch, K.
Limits of discrete distributions and Gibbs measures on random graphs. Preprint.
http://arxiv.org/pdf/1512.06798
Collares Neto, M.
[see: Bushaw, N.]
Collins, A.
[see: Atminas, A.]
Conder, M. E., Hucikova, V., Nedela, R. and Širáň, J.
Chiral maps of given hyperbolic type. Bull. Lond. Math. Soc. 48 (2016) 38-52.
http://dx.doi.org/10.1112/blms/bdv086
Conder, M. E., Hucikova, V., Nedela, R. and Širáň, J.
Orientably-regular maps with given exponent group, submitted.
Conlon, D.
A sequence of triangle-free pseudorandom graphs. Submitted.
http://people.maths.ox.ac.uk/~conlond/Triangle-free.pdf
Conlon, D.
Graphs with few paths of prescribed length between any two vertices. Bull. Lond.
Math. Soc., to appear.
http://people.maths.ox.ac.uk/~conlond/Theta-free.pdf
Conlon, D., Dellamonica D., La Fleur, S., Rödl V. and Schacht, M.
A note on induced Ramsey numbers. Preprint.
http://people.maths.ox.ac.uk/~conlond/induced_ramsey.pdf
Conlon, D., Ferber, A., Nenadov, R. and Škorić, R.
Almost-spanning universality in random graphs. Random Struct. Algorithms, to
appear.
http://arxiv.org/pdf/1503.05612
Conlon, D., Fox, J., Gasarch, W., Harris, D., Ulrich, D. and Zbarsky, S.
Distinct volume subsets. SIAM J. Discrete Math. 29 (2015) 472-480.
http://dx.doi.org/10.1137/140954519
http://people.maths.ox.ac.uk/~conlond/distinctvol.pdf
Conlon, D., Fox, J., Lee, C. and Sudakov, B.
Ramsey numbers of cubes versus cliques. Combinatorica, to appear.
http://people.maths.ox.ac.uk/~conlond/cubes-vs-cliques.pdf
Conlon, D., Fox, J., Lee, C. and Sudakov, B.
On the grid Ramsey problem and related questions. Int Math. Res. Not., 17 (2015),
8052-8084.
http://people.maths.ox.ac.uk/~conlond/gridramsey.pdf
Conlon, D., Fox, J., Lee C. and Sudakov, B.
Ordered Ramsey numbers. J. Comb. Theory Ser. B., to appear.
http://people.maths.ox.ac.uk/~conlond/OrderedRamsey.pdf
Conlon, D., Fox, J. and Rödl V.
Hedgehogs are not colour blind, Preprint.
http://people.maths.ox.ac.uk/~conlond/Hedgehogs.pdf
Conlon, D., Fox, J. and Sudakov, B.
Recent developments in graph Ramsey theory. In: Surveys in Combinatorics 2015,
49-118.
http://people.maths.ox.ac.uk/~conlond/GraphRamsey.pdf
Conlon, D., Fox, J. and Sudakov, B.
Short proofs of some extremal results II. J. Comb. Theory Ser. B., to appear.
http://people.maths.ox.ac.uk/~conlond/essays2.pdf
Conlon, D., Fox, J. and Zhao, Y.
A relative Szemerédi theorem. Geom. Funct. Anal., 25 (2015) 733-762.
http://people.maths.ox.ac.uk/~conlond/relative-szemeredi.pdf
Conlon, D. and Gowers, W. T.
Freiman homomorphisms on sparse random sets, Preprint.
http://people.maths.ox.ac.uk/~conlond/homomorphisms.pdf
Conlon, D., Kim, J. H., Lee, C. and Lee, J.
Some advances on Sidorenko’s conjectdure. Preprint.
http://people.maths.ox.ac.uk/~conlond/Sidorenko2.pdf
Conlon, D. and Stein, M. J.
Monochromatic cycle partitions in local edge colourings. J. Graph Theory 81 (2016)
134-145.
http://dx.doi.org/10.1002/jgt.21867
http://arxiv.org/pdf/1403.5975.pdf
Conlon, D. and Zhao, Y.
Quasirandom Cayley graphs. Submitted.
http://people.maths.ox.ac.uk/~conlond/quasirandom_cayley.pdf
Conlon, D.
[see: Bukh, B.]
Coon, J. P.. Dettmann, C. P. and Georgiou, O.
More is less: Connectivity in fractal regions. In ISWCS 2015.
http://arxiv.org/pdf/1409.7520
Coon, J. P.
[see: Bocus, M. Z.]
Cooper, C.,. Dyer M. E., Frieae, A. M. and Rivera, N.
Discordant voting processes on finite graphs. Preprint.
http://www.math.cmu.edu/~af1p/Texfiles/Vote.pdf
Cooper, C. and Frieze, A. M.
A note on the vacant set of random walks on the hypercube and other regular graphs
of high degree. Mosc. J. Comb. Number Theory 4 (2015) 21-44.
http://www.math.cmu.edu/~af1p/Texfiles/General.pdf
Cooper, C. and Frieze, A. M.
Long Paths in Random Apollonian Networks. Internet Math. 11 (2015) 308-318.
http://dx.doi.org/10.1080/15427951.2014.925524
http://www.math.cmu.edu/~af1p/Texfiles/Longpath.pdf
Cooper, C. and Frieze, A. M.
Vacant sets and vacant nets: Component structures induced by a random walk. SIAM
J. Discrete Math. 30 (2016) 166-205.
http://dx.doi.org/10.1017/S0963548315000024
http://www.math.cmu.edu/~af1p/Texfiles/vacantsetsandnets.pdf
Cooper, C., Frieze, A. M., Ince, N., Janson, S. and Spencer, J. H.
On the length of a random minimum spanning tree. Combin. Probab. Comput., 25
(2016) 85-107.
http://dx.doi.org/10.1017/S0963548315000024
http://www2.math.uu.se/~svante/papers/sj277.pdf
Cooper, C. Radzik, T. and Rivera, N.
The coalescing-branching random walk on expanders and the dual epidemic process.
Preprint.
http://arxiv.org/pdf/1602.05768
Cooper, C.
[see: Abdullah, M., Bal, D., Berenbrink, P.]
Cooper, J. W., Grzesik, A. and Král’, D.
Optimal-size clique transversals in chordal graphs. Preprint.
http://arxiv.org/pdf/1601.05305
Cooper, J. W., Kaiser, T., Král’, D. and Noel, J. A.
Weak regularity and finitely forcible graph limits. Preprint.
http://arxiv.org/pdf/1507.00067
Cooper, M. C.
[see: Cohen, D. A.]
Corti, A.
[see: Akhtar, M.]
Cossidente, A. King, O.H., and Marino, G.
Hyperovals arising from a Singer group action on H(3,𝑞2), q even. Adv. Geom, to
appear.
https://www.staff.ncl.ac.uk/o.h.king/CossidenteKingMarinoAG16.pdf
Couturier, J.-F.
[see; Cochefort, M.]
Crampton, J., Farley, N., Gutin, G. and Jones, M.
Optimal Constructions for Chain-based Cryptographic Enforcement of Information
Flow Policies. Lect. Notes. Comput. Sci. 9149 (2015) 330-345
http://dx.doi.org/10.1007/978-3-319-20810-7_23
http://arxiv.org/pdf/1503.01382v1.pdf
Crampton, J., Farley, N., Gutin, G., Jones, M. and Poettering, B.
Cryptographic Enforcement of Information Flow Policies without Public Information.
Lect. Notes. Comput. Sci. 9092 (2016) 389-408.
http://dx.doi.org/10.1007/978-3-319-28166-7_19
http://arxiv.org/pdf/1410.5567.pdf
Crampton, J., Gagarin, A., Gutin, G. and Jones, M. On the Workflow Satisfiability Problem with Class-Independent Constraints,. IPEC
2015 66-77
http://dx.doi.org/10.4230/LIPIcs.IPEC.2015.66
http://arxiv.org/pdf/1504.03561
Crampton, J., Gutin, G. and Karapetyan, D.
Valued Workflow Satisfiability Problem. SACMAT15, 3-13.
http://arxiv.org/pdf/1501.07814
Crampton, J., Gutin, G., Karapetyan, D. and Watrigant, R.
The Bi-Objective Workflow Satisfiability Problem and Workflow Resiliency. Preprint.
http://arxiv.org/pdf/1512.07019
Crampton, J., Gutin, G.,, and Watrigant, R.
A Multivariate Approach for Checking Resiliency in Access Control. Preprint.
http://arxiv.org/pdf/1604.01550
Crampton, J. and Sellwood, J.
Relationships, Paths and Principal Matching: A New Approach to Access Control.
Preprint.
http://arxiv.org/pdf/1505.07945
Crampton, J.
[see: Cohen, D. A.]
Crane, E. T., Freeman, N. P. and Tóth, B. Cluster growth in the dynamical Erdös-Rényi process with forest fires. Electron |J.
Probab. 20 (2015) 1-33 (Article 101).
http://dx.doi.org/10.1214/EJP.v20-4035
http://arxiv.org/pdf/1405.5044
Crochemore, M., Fici, G., Mercase, R. and Pissis, S. P.
Linear-Time Sequence Comparison Using Minimal Absent Words & Applications.
LATIN2015 334-346.
http://arxiv.org/abs/1506.04917
Crochemore, M, , Grossi, R., Kärkkäinen, J. and Landau, G. M.
Computing the Burrows-Wheeler transform in place and in small space. J. Discrete
Algorithms 32 (2015) 44-52
http://dx.doi.org/10.1016/j.jda.2015.01.004
Crochemore, M, Iliopoulos, C. S., Kociumaka, T., Kubica, M., Langiu, A.,
Radoszewski, J., Rytter, W., Szrewder, B. and Walen, T.
A note on the longest common compatible prefix problem for partial words. J.
Discrete Algorithms 32 (2015) 44-52
http://dx.doi.org/10.1016/j.jda.2015.05.003
Crochemore, M, Iliopoulos, C. S., Kundu, R., Mohammed, M. and Vayani, F.
Linear Algorithm for Conservative Degenerate Pattern Matching. Eng. Appl. of AI 51
(2016) `109-114.
http://dx.doi.org/10.1016/j.engappai.2016.01.009
http://arxiv.org/pdf/1506.04559
Crochemore, M., Kolpakov, R. and Kucherov, G.
Optimal Bounds for Computing α gapped Repeats. LATA2016. Lect. Notes. Comput.
Sci. 9618 (2016) 245-255.
http://dx.doi.org/10.1007/978-3-319-30000-9_19
Crochemore, M.
[see: Apostolico, A. Badkobeh, G..]
Crowston, R., Gutin, G., Jones, M., Muciaccia, G. and Yeo, A.
Parameterizations of Test Cover with Bounded Test Sizes. Algorithmica 74 (2016)
367-384.
http://dx.doi.org/10.1007/s00453-014-9948-7
http://arxiv.org/pdf/1209.6528
Cruickshank, J., Kitson, D. and Power, S. C.
The generic rigidity of triangulated spheres with blocks and holes. J. Comb. Theory
Ser B., to appear.
http://arxiv.org/pdf/1507.02499
Cruickshank, J., Kitson, D. and Power, S. C.
The generic minimal rigidity of a partially triangulated torus. Preprint.
http://arxiv.org/pdf/1509.00711
Cseh, A. and Manlove, D. F.
Stable marriage and roommates problems with restricted edges: complexity and
approximability. Lect. Notes. Comput. Sci. 9347 (2015) 15-26.
http://dx.doi.org/10.1007/978-3-662-48433-3_2
http://arxiv.org/pdf/1412.0271.pdf
Cseh, A.
[see: Arulselvan, A.]
Csikvári, P. Frenkel, P. E.,. Hladky, J. and Hubai, T.
Chromatic roots and limits of dense graphs. Preprint.
http://arxiv.org/pdf/1511.09429
Csikvári, P.
[see: Abért, M..]
Csóka, E. On the graph limit question of Vera T. Sós. J. Comb. Theory. Ser. B. 116 (2016)
306-311.
http://dx.doi.org/10.1016/j.jctb.2015.09.003
http://arxiv.org/pdf/1504.02755
Csóka, E. Limits of some combinatorial problems. Electron. Notes Discrete Math. 49 (2015)
577-581.
http://dx.doi.org/10.1016/j.endm.2015.06.078
http://arxiv.org/pdf/1505.06984.pdf
Csóka, E., Gerencsér, B., Harangi, V. and Virág, B.
Invariant Gaussian processes and independent sets on regular graphs of large girth.
Random Struct. Algorithms 47 (2015) 284-303.
http://dx.doi.org/10.1002/rsa.20547
http://arxiv.org/pdf/1305.3977
Csóka, E., and Lidbetter,T.
The Solution to an Open Problem for a Caching Game. Naval Research Logistics 63
(2016) 23-31.
http://dx.doi.org/10.1002/nav.21674
Csóka, E., Lo, I., Norin, S., Wu, H. and Yepremyan, L.
The extremal function for disconnected minors. Preprint.
http://arxiv.org/pdf/1509.01185
Csóka, E. and Mészáros, S,
Generalized solution for the Herman Protocol Conjecture. Preprint.
http://arxiv.org/pdf/1504.06963
Csóka, E.
[see: Camarena, O. A,]
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, to appear.
http://arxiv.org/pdf/1410.6572
Cuypers, H., Roberts, K. and Shpectorov, S.
Recovering the Lie Algebra from its extremal geometry.J. Algebra 441 (2015)
196-215.
http://dx.doi.org/10.1016/j.jalgebra.2015.06.037
http://arxiv.org/pdf/1410.5937
Cvetković, D. M.. Rowlinson, P. and Simić, S.
Graphs with least eigenvalue -2: ten years on, Linear Algebra Appl. 484 (2015), 504-
539.
Czumaj, A.
Random permutations using switching networks. STOC 2015 703-712.
http://www.dcs.warwick.ac.uk/~czumaj/PUBLICATIONS/CONFERENCES/Czumaj-
STOC-2015-703-712.pdf
Czumaj, A. and Davies, P.
Faster Deterministic Communication in Radio Networks. Preprint.
http://arxiv.org/pdf/1506.00853
Czumaj, A. and Davies, P.
Optimal leader election in multi-hop radio networks. Preprint.
http://arxiv.org/pdf/1505.06149
Czumaj, A., Georgakopoulos, A., Král’, D., Lozin, V. V., and Pikhurko, O. (eds).
Surveys in Combinatorics 2015. Lond Math. Soc. Lect. Note Ser. 422 (2015)
ISBN: 9781107462502
Czumaj, A., Peng, P. and Sohler, C.
Relating Two Property Testing Models for Bounded Degree Directed Graphs. STOC
2016, to appear.
http://acm-stoc.org/stoc2016/
Czumaj, A., Peng, P. and Sohler, C.
Testing Cluster Structure of Graphs STOC15 723 - 732,
http://arxiv.org/pdf/1504.03294
Czygrinow, A., DeBiasio, L, Molla, T. and Treglown, A.
Tiling directed graphs with tournaments. Preprint.
http://web.mat.bham.ac.uk/~treglowa/CDMTaltogether8.pdf
Dąbrowski, K. K., Dross, F.. Johnson, M. and Paulusma, D.
Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs.
Lect. Notes Comput. Sci. 9538 (2016) 100-111 (Proceedings of IWOCA 2015)
http://dx.doi.org/10.1007/978-3-319-29516-9_9
http://arxiv.org/pdf/1506.06564
Dąbrowski, K. K., Dross, F.. and Paulusma, D.
Colouring Diamond-free Graphs. SWAT2016, to appear.
http://arxiv.org/pdf/1512.07849v1
Dąbrowski, K. K., de Werra, D., Lozin, V. V. and Zamaraev, V.
Combinatorics and algorithms for augmenting graphs. Graphs. Comb., to appear.
http://arxiv.org/pdf/1410.8774
Dąbrowski, K. K., Golovach, P. A., van ‘t Hof, P. and Paulusma, D.
Editing to Eulerian Graphs. J. Comput. Syst. Sci. 82 (2016) 213-228.
http://arxiv.org/pdf/1410.6863
Dąbrowski, K. K., Golovach, P. A., van ‘t Hot, P., Paulusma, D. and Thillikos, D.
M.
Editing to a planar graph of given degree. CSR2015. Lect. Notes Comput. Sci, 9139:
(2015) 143-156
http://dx.doi.org/10.1007/978-3-319-20297-6_10
http://arxiv.org/pdf/1508.02773
Dąbrowski, K. K., and Paulusma, D.
Clique-width of Graph Classes Defined by Two Forbidden Induced Subgraphs. The
Computer Journal, to appear.6
http://arxiv.org/pdf/1405.7092
Dąbrowski, K. K., and Paulusma, D.
Classifying the Clique-Width of H-Free Bipartite Graphs Discrete Appl. Math. 200
(2016) 43-51.
http://dx.doi.org/10.1016/j.dam.2015.06.030
http://arxiv.org/pdf/1402.7060
Dąbrowski, K. K.
[see: Brandstädt, A.]
D’Adderio, M.
[see: Aval, J.-C.]
Dalmau, V.
[see: Bodirsky, M]
Dang, A. N..
[see: Cameron, P. J.]
Davies, E., Jenssen, M. Perkins, W. and Roberts, B.
Independent Sets, Matchings, and Occupancy Fractions. Preperint.
http://arxiv.org/pdf/1508.04675
Davies, P.
[see: Czumaj, A.]
Dawar, A., Severini, S. and Zapata, O.
Descriptive complexity of graph spectra. Preprint.
http://arxiv.org/pdf/1603.07030
Day, A. N. and Johnson, J. R.
Multicolour Ramsey Numbers of Odd Cycles. Preprint.
http://arxiv.org/pdf/1602.07607
Daykin, J. W.
[see: Alatabbi, A.,]
DeBiasio, L., Kühn, D., Molla, T., Osthus, D. and Taylor, A.
Arbitrary orientations of Hamilton cycles in digraphs. SIAM J. Discrete Math. 29
(2015) 1553-1584
http://dx.doi.org/10.1137/140974675
http://web.mat.bham.ac.uk/D.Kuehn/orientham_270614.pdf
DeBiasio, L.
6 A conference version appeared in CIAC 2015, Lect Notes Comput. Sci. (2015) 167-181
[see: Czygrinow, A.]
DeCorte, E. and Pikhurko, O.
Spherical sets avoiding a prescribed set of angles. Int. Math. Res. Noti, , to appear.
http://dx.doi.org/10.1093/imrn/rnv319
http://imrn.oxfordjournals.org/content/early/2015/11/29/imrn.rnv319.full.pdf+html
Deligkas, A., Mertzios, G. B. and Spirakis, P. G.
On the Complexity of Weighted Greedy Matchings. Preprint.
http://arxiv.org/pdf/1602.05909
Dellamonica, D., Kohayakawa, Y., Lee, S., Rödl, V. and Samotij, W.
The number of B3-sets of a given cardinality. J. Comb. Theory Ser. A. 142 (2016)
44-76.
http://dx.doi.org/10.1016/j.jcta.2016.03.004
https://www.dpmms.cam.ac.uk/~ws299/papers/B_3-sets.pdf
Dellamonica, D., Kohayakawa, Y., Lee, S., Rödl, V. and Samotij, W.
The number of Bh sets. Combin. Probab. Comput., 25 (2016), 108–129 .
http://dx.doi.org/10.1017/S0963548315000206
https://www.dpmms.cam.ac.uk/~ws299/papers/B_h-sets.pdf
Dellamonica D..
[see: Conlon, D.]
Demers, M. and Todd, M.
Slow and fast escape for open intermittent maps. Preprint.
http://arxiv.org/pdf/1603.05706
Dénes, J and Keedwell A. D.
Latin Squares and their Applications. 2nd
Edition, North Holland(Elsevier),
ISBN: 978-0-444-63555-6
Dereich, S. and Mörters, P.
Cycle length distributions in random permutations with diverging cycle weights.
Random Struct. Algorithms 46 (2015) 635-650.
http://dx.doi.org/10.1002/rsa.20520
http://people.bath.ac.uk/maspm/Perm_Cond.pdf
Dereich, S., Mönch, C. and Mörters, P.
Distances in scale free networks at criticality. Preprint.
http://arxiv.org/pdf/1604.00779
Dettmann, C. P. and Georgiou, O.
Random geometric graphs with general connection functions. Phys. Rev. E 93 (2016)
032313
http://arxiv.org/pdf/1411.3617
Dettmann, C. P., Georgiou, O. and Giles, A. P.
Connectivity of Soft Random Geometric Graphs Over Annuli. , J. Stat. Phys. 162
(2016) 1068-1083.
http://dx.doi.org/10.1007/s10955-015-1436-1
http://arxiv.org/pdf/1502.05440
Dettmann, C. P., Georgiou, O. and Giles, A. P.
Betweenness Centrality in Dense Random Geometric Networks. In: Proceedings of
IEEE ICC (2015) 6450-6455.
http://arxiv.org/pdf/1410.8521
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://www.maths.bris.ac.uk/~macpd/toshiba/pratt1.pdf
Dettmann, C. P.
[see: Bocus, M. Z.,, Coon, J.-P.]
Devi, P., Gagarin, A. and Rajkumar, R.
Classification of finite groups with toroidal or projective-planar permutability graphs.
Commun. Algebra., to appear.
Devroye, L,
[see: Amini, O.]
de Werra, D.
[see: Dąbrowski, K. K.,]
Diaconis, P.
[see: Bailey, R. A.]
Diaz, J., Goldberg, L. A., Richerby, D. and Serna, M.
Absorption Time of the Moran Process. Random Struct. Algorithms, to appear.
http://www.cs.ox.ac.uk/people/leslieann.goldberg/publications.html#MoranDir
Diaz, J., Mitsche, D., Perarnau, G. and Pérez-Giménez, X. .
On the relation between graph distance and Euclidean distance in random geometric
graphs. Adv. Appl. Probab. 48 (2016) no 3.
http://arxiv.org/pdf/1404.4757.pdf
Diner, O, Paulusma,. D., Picoleau, C. and Ries, B.
Contraction blockers for graphs with forbidden induced paths. CIAC 2015. Lect.
Notes. Comput. Sci. 9079 (2015) 194-207.
http://dx.doi.org/10.1007/978-3-319-18173-8_14
Ding, G.
[see: Chun, C.]
Diot, E. Radovanovic, M., Trotignon, N. and Vuśković, K.
On graphs that do not contain a theta nor a wheel Part I: two subclasses. Preprint.
http://arxiv.org/pdf/1504.01862.pdf
Dodos, P., Kanellopoulos, V. and Tyros, K.
A concentration inequality for product spaces. J. Funct. Anal. 270 (2016) 609-620.
http://dx.doi.org/10.1016/j.jfa.2015.11.003
http://arxiv.org/pdf/1410.5965
Doležal, M., Hladký, J. and Máthé, A.
Cliques in dense inhomogeneous random graphs. Preprint. http://arxiv.org/pdf/1510.02335
Dolich A. [see: Aschenbrenner M.]
Dolinka, I., East, J., Evangelou, A., FixzGerald, D., Ham, N. Hyde, J. and
Loughlin, N.
Idempotent Statistics of the Motzkin and Jones Monoids. Preprint.
http://arxiv.org/pdf/1507.04838
Dolinka, I., East, J. and Gray, R. D.
Motzkin moniods and partial Brauer monoids. Preprint.
http://arxiv.org/pdf/1512.02279
Dolinka, I., Gray, R., D., McPhee, J. D., Mitchell, J. D. and Quick, M. R.
Automorphism groups of countable algebraically closed graphs and endomorphisms
of the random graph. Math. Proc. Camb. Philos. Soc. 160 (2016) 437-462
http://dx.doi.org/10.1017/S030500411500078X
http://arxiv.org/pdf/1408.4107
Donovan, D. M., Griggs, T. S., McCourt, T. A., Opršal J. and Stanovský, D.
Distributive and anti-distributive Mendelsohn triple systems. Canad. Math. Bull. 59
(2016), 36-49.
http://dx.doi.org/10.4153/CMB-2015-053-2
http://arxiv.org/pdf/1411.5194
Donovan, D. M.
[see: Bevan Thaompson, H.]
Drápal, A. and Griggs, T. S.
On cosets in Steiner loops. Bull. Acad. Stiiinte a Rep. Moldova Matematica, to appear.
Drápal, A., Griggs, T. S. and Kozlik, A.
Basics of DTS-quasigroups; Algebra, Geometry and Enumeration. J. Algebra Appl.,
14 (2015) 1550089
http://dx.doi.org/10.1142/S0219498815500899
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, to appear. .
http://arxiv.org/pdf/1502.02987
Duan, R.
[see: Acín, A.]
Duarte, M. A., Joos, F., Penso, L. D., Rautenbach, D. and Souza, U. Maximum Induced Matchings close to Maximum Matchings . Theor.. Comput. Sci.
588 (2015) 131–137.
http://dx.doi.org/10.1016/j.tcs.2015.04.001
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.
Preprint.
http://arxiv.org/pdf/1602.02190
Dukes, W. M. B.
Generalized ballot sequences are ascent sequences. Australas. J. Comb. 64 (2016)
61-63.
https://personal.cis.strath.ac.uk/mark.dukes/ballot.pdf
Dukes, W. M. B. and Selig, T.
Decomposing recurrent stateds of th Abelian Sandpile Model Preprint.
Dukes, W. M. B. and White, C. D.
Web matrices: structural properties and generating combinatorial identities.
Electron J. Comb. 23 (2016) P`1.45.
http://arxiv.org/pdf/1603.01589
Dukes, W. M. B.
[see: Aval, J.-C., Duffy, K. R.]
Duminil-Copin, H. Glazman, A., Hammond, A. and Manolescu, I.
On the probability that self-avoiding random walk ends at a given point. Ann. Probab.,
44 (2016) 955-983
http://dx.doi.org/10.1214/14-AOP993
http://www.stats.ox.ac.uk/~hammond/papers/sawendpoint.pdf
Duminil-Copin, H.
[see: Bollobás, B.]
Dvořák, Z., Hebdige, M., Hlásek, F. Král’,. D. and Noel, J. A.
Cyclic Coloring of Plane Graphs with Maximum Face Size 16 and 17. Preprint.
http://arxiv.org/pdf/1603.06722
Dvořák, Z., Kawarabayashi, K. and Král’,. D.
Packing six T-joins in plane graphs, J. Comb. Theory Ser. B 116 (2016), 287-305
http://dx.doi.org/10.1016/j.jctb.2015.09.002
http://arxiv.org/pdf/1009.5912
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 disck with
one tirangle. J. Comb. Theory Ser. B., to appear.
http://arxiv.org/pdf/1010.2472
Dvořak, Z.
[see: Chudnovsky, M.]
Dyer, M. E., Frieze, A. M. and Greenhill, C.
On the chromatic number of a random hypergraph. J. Comb. Theory Ser B. 113
(2015) 68-122.
http://dx.doi.org/10.1016/j.jctb.2015.01.002
http://arxiv.org/pdf/1208.0812
Dyer, M. E., Jerrum, M. R. and Müller, H.
On the switch Markov chain for perfect matchings. SODA 2016, 1972-1983.
http://dx.doi.org/10.1137/1.9781611974331.ch138
http://arxiv.org/pdf/1501.07725
Dyer M. E.
[see: Cooper, C.,]
East J. [see: Dolinka I.,]
Eberhard, S.
Commuting probabilities of finite groups. Bull. Lond Math Soc 47 (2015) 796-808
http://dx.doi.org/10.1112/blms/bdv050
http://arxiv.org/pdf/1411.0848
Eberhard, S.
Product mxiing in the alternating group. Discrete Anal. 2 (2016)
http://dx.doi.org/10.19086/da.610
http://arxiv.org/pdf/1512.03517
Eberhard, S.
A note on non-abelian Freiman-Ruzsa. Preprint.
http://arxiv.org/pdf/1511.06758
Eberhard, S., Ford, K. and Green, B. J.
Invariable generation of the symmetric group. Submitted.
http://arxiv.org/pdf/1508.01870
Eberhard, S., Ford, K. and Green, B. J.
Permutations fixing a k-set. Int. Math. Res. Not. 2015.
http://dx.doi.org/10.1093/imrn/rnv371
http://arxiv.org/pdf/1507.04465
Eberhard, S., Manners, F. J. and Mrazović, R.
Additive tiples of bijections, or the toroidal semiqueens problem. Preprint.
http://arxiv.org/pdf/1510.05987
Eccles, T.
Graphs of large linear size are antimagic. J. Graph Theory 81 (2016) 236-261.
http://dx.doi.org/10.1002/jgt.21872
http://de.arxiv.org/pdf/1409.3659.pdf
Eccles, T.
[see: Bollobás, B.]
Eckert, J. Joos, F. and Rautenbach, D.
The Cycle Spectrum of Claw-free Hamiltonian Graphs. Graphs. Comb. 32 (2016)
93-101.
http://dx.doi.org/10.1007/s00373-015-1530-9
http://arxiv.org/pdf/1312.1106
Edwards, K., Kang, D. Y, Kim, J. Oum, S.-I. and Seymour, P.
A Relative of Hadwiger’s Conjecture. SIAM J. Discrete Math. 29 (2015) 2385-2388.
http://dx.doi.org/10.1137/141002177
http://web.mat.bham.ac.uk/~kimjs/papers/Hadwiger/2014hadwiger.pdf
Edwards, K. J.
A faster polynomial-space algorithm for Max 2-CSP. J. Comput. Syst. Sci.82 (2016)
536-550.
http://dx.doi.org/10.1016/j.jcss.2015.11.013
Edwards, K. J. and McDermid, E.
A General Reduction Theorem with Applications to Pathwidth and the Complexity of
MAX 2-CSP. Algorithmica 72 (2015) 940-968.
http://dx.doi.org/10.1007/s00453-014-9883-7
Ehard, S. and Joos, F.
Long paths and cycles in random subgraphs of graphs with large minimum degree.
http://arxiv.org/pdf/1510.09166
Eirinakis, P.
[see: Cechlárová, K.]
El Amiri, M.
[see; Buset, D.]
Elder, M.
[see: Brough, T.]
Ellis, D., Filmus Y. and Friedgut, E.
A quasi-stability result for low-degree Boolean functions on Sn. Combinatorica 35
(2015) 573-618.
http://dx.doi.org/10.1007/s00493-014-3027-1
http://www.maths.qmul.ac.uk/~dellis/EFF3_webpage.pdf .
Ellis, D., Friedgut, E., Kindler, G. and Yehudayoff, A.
Geometric stability via information theory. Preprint.
http://arxiv.org/pdf/1510.00258
Ellis, D.
[see: Benjamini, I.]
Ellis-Monaghan, J. A., McDowell, A., Moffatt, I and Pangborn, G.
DNA origami and the complexity of Eulerian circuits with turning costs. Natural
Computing 14 (2015) 491-503
http://dx.doi.org/10.1007/s11047-014-9457-2
http://www.personal.rhul.ac.uk/uxah/001/papers/NCEulerTurn.pdf
Ellis-Monaghan, J. A. and Moffatt, I.
The Las Vergnas Polynomial for embedded graphs. Eur. J. Comb., 50 (2015) 97-114.
http://dx.doi.org/10.1016/j.ejc.2015.03.009
http://www.personal.rhul.ac.uk/uxah/001/papers/LV_eulerian.pdf
Elwes, R.
A Linear referential Attachment Processes Approaching The Rado Multigraph.
Preprint
http://arxiv.org/pdf/1603.08806.pdf
Elwes, R.
[see: Bampalas, G.]
Ene, A., Miller, G., Pachocki, J. and Sidford, A.
Routing under Balance. Preprint.
http://arxiv.org/pdf/1603.09009
Ene, A., Mnich, M., Pilipczuk, M. and Risteski, A.
On Routing Disjoint Paths in Bounded Treewidth Graphs. Preprint.
http://arxiv.org/pdf/1512.01829
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, to appear.
http://arxiv.org/pdf/1602.00477
Enright, J. and Meeks, K.
Deleting edges to restrict the size of an epidemic: a new application for trewidth.
COCOA2015. Lect. Notes. Comput. Sci. 9486 (2015) 574-585.
http://dx.doi.org/10.1007/978-3-319-26626-8_42
http://arxiv.org/pdf/1504.05773
Enright, J. and Stewart, L.
Equivalence of the filament and overlap graphs of subtrees of limited trees. Preprint.
http://arxiv.org/pdf/1508.01441
Ercolani, N. M., Jansen, S. and Ueltschi, D.
Singularity analysis for heavy-tailed random variables. Preprint.
http://arxiv.org/pdf/1509.05199
Ergün, F. and Jowhari, H.
On the monotonicity of a data stream. Combinatorica 35 (2015) 641-653
http://dx.doi.org/10.1007/s00493-014-3035-1
Erickson, A., Fan, J., Jia, X. and Wang, X.
Hamiltonian Properites of DCell Networks. The Computer Journal 58 (2015)
2944-2955.
http://dx.doi.org/10.1093/comjnl/bxv019
http://arxiv.org/pdf/1510.02689
Erickson, A., Kiasari, A., Navaridas, J. and Stewart, I. A.
The stellar transformation: from interconnection networks to datacenter networks.
Preprint.
http://arxiv.org/pdf/1510.02181
Erickson, A., Kiasari, A., Navaridas, J. and Stewart, I. A.
Routing Algorithms for Recursively-Defined Data Centre Networks.
TrustCom/BigDataSE/ISPA (2015 84-91 .
http://dx.doi.org/10.1109/Trustcom.2015.616
http://arxiv.org/pdf/1509.01747
Erickson, A., Kiasari, A., Navaridas, J. and Stewart, I. A.
An Optimal Single-Path Routing Algorithm in the Datacenter Network DPillar.
COCOA 2015 209-220.
http://dx.doi.org/10.1007/978-3-319-26626-8_16
http://arxiv.org/pdf/1509.01746
Erlebach, T., Hoffmann M. and Kammer, F.
On temporal graph exploration. Lect. Notes. Comput. Sci. 9134 (2015) 444-455.
http://dx.doi.org/10.1007/978-3-662-47672-7_36
Erlebach, T., Hoffmann M. and Kammer, F.
Query-Competitive Algorithms for Cheapest Set Problems under Uncertainty Theor.
Comput. Sci. 613 (2016) 1-64,.
http://dx.doi.org/10.1016/j.tcs.2015.11.025
Erlebach, T. and Radoja, M.
Further Results on Capacitated Network Design Games. Lect. Notes. Comput. Sci.
9347 (2015) 57-68.
http://dx.doi.org/10.1007/978-3-662-48433-3_5
Erlebach, T.
[see: Alqahatani, H. M. ]
Erskine, G.
[see: Bevan, D., Buset, D.]
Escamocher, G.
[see: Cohen, D. A.]
Estrada,. E.
When local and global clustering of networks diverge. Linear Algebra Appl. 488
(2016) 249-263.
http://dx.doi.org/10.1016/j.laa.2015.09.048
Estrada, E. and Hatamo. N.
Communicability Angle and the Spatial Efficiency of Networks. SIAM Review, to
appear.
http://arxiv.org/pdf/1412.7388
Estrada, E., Meloni, S., Moreno, Y. and Sheerin, M.
Epidemic spreading in Random Rectangular Networks. Preprint.
http://arxiv.org/pdf/1507.06002
Estrada, E. and Sheerin, M.
Consensus Dynamics on Random Rectangular Graphs. Physica D, to appear.
http://www.estradalab.org/wp-content/uploads/2015/10/Paper_Physica-D1.pdf
Estrada, E. and Sheerin, M.
Random Rectangular Graphs. Phys Rev. E. 91 (2015)
http://arxiv.org/pdf/1502.02577.pdf
Estrada, E.
[see: Ando, H., Benzi, M., Chen, G.]
Evangelou A., [see: Dolinka I.,]
Evans, D. M.
[see: Amato, D.]
Fabila-Monroy, R.
[see: Bárány, I.]
Fadli, F.
[see: Barki, H.]
Falconer, K. J.
A Holder-type inequality on a regular rooted tree. Journal of Mathematical Analysis
and Applications, 423 (2015) 913-923.
http://www-maths.mcs.st-andrews.ac.uk/~kenneth/HolderTree.pdf
Falgas-Ravry, V., Marchant E., Pikhurko, O.. and Vaughan, E. R.
The codegree threshold for 3-graphs with independent neighbourhoods. SIAM J Discr
Math, 23 (2015) 1504-1539,
http://dx.doi.org/10.1137/130926997
http://arxiv.org/pdf/1307.0075
Falik, D.
[see: Choromanski, K.]
Fan, J.
[see: Erickson, A.]
Farley, N..
[see: Crampton, J.]
Fanchon, A., Gadouleau, M. and Richard, A.
Reduction and Fixed Points of Boolean Networks and Linear Network Coding
Solvability. IEEE Trans. Inf. Theory, to appear.
http://arxiv.org/pdf/1412.5310
Fauvel,. J. amd Wilson, R. J. The Lull before the storm: combinatorics in the Renaissance. Mathematicians and their
Gods (ed. S. Lawrence and M. McCartney), Oxford University Press. (2015) 89-103.
ISBN: 9780198703051.
Fayers, M. and Speyer, L.
Generalised column removal for graded homomorphisms between Specht modules. J.
Algebr. Comb. , to appear.
http://arxiv.org/pdf/1404.4415
Farach-Colton,M.
[see: Apostolico, A.]
Fearnley, J. and Savani, R.
The Complexity of the Simplex Method. STOC 2015
http://arxiv.org/pdf/1404.0605
Federici, B. and Georgakopoulos, A.
Hyperbolicity vs. Amenability for planar graphs. Preprint.
http://arxiv.org/pdf/1509.02028
Federici, B.
[see: Carmesin, J.]
Feghali, C., Johnson, M. and Paulusma, D.
Kempe Equivalence of Colourings of Cubic Graphs. Electron Notes Disceree Math.
49 (2015) 245-249.
http://arxiv.org/pdf/1503.03430
Feghali, C., Johnson, M. and Paulusma, D.
A reconfigurations analogue of Brooks' theorem and its consequences. J. Graph
Theory, to appear.
http://dx.doi.org/10.1016/j.endm.2015.06.034
http://arxiv.org/pdf/1501.05800
Feghali, C., Johnson, M. and Thomas, D.
Erdős-Ko-Rado Theorems for a Family of Trees. Preprint.
http://arxiv.org/pdf/1506.07741
Feghali, C.
[see: Abu Khzam, F. N, Bonamy, M..]
Feldman, V., Perkins, W. and Vempala, S.
Subsampled Power Iteration: a Unified Algorithm for Block Models and Planted
CSP's. NIPS2015..
http://arxiv.org/abs/1407.2774
Feldman, V., Perkins, W. and Vempala, S.
On the Complexity of Random Satisfiability Problems with Planted Solutions.
STOC’15, 77-86.
http://dx.doi.org/10.1145/2746539.2746577
http://arxiv.org/pdf/1311.4821
Felsner, S., Kanuer, K. Mertzios, G. B. and Ueckerdt T.
Intersection graphs of L-shapes and segments in the plane. Discrete Appl. Math., to
appear.
http://community.dur.ac.uk/george.mertzios/papers/Jour/Jour_Intersection-Graphs-L-
shapes.pdf
Fenn, D. J.
[see: Bazzi, M.]
Fennessey, E. J. and Larcombe, P. J.
On the Phenomenon of Masked Periodic Horadam Sequences. Util. Math. 96 (2015)
111-123.
Fennessey, E. J. and Larcombe, P. J.
A Polynomial Based Construction of Periodic Horadam Sequences, Utili. Math. 99
(2016) 231-239.
Fennessey, E. J. and Larcombe, P. J.
On a Scaled Balanced-Power Product Recurrence. Fibonacci Quarterly, to appear.
Fennessey, E. J. and Larcombe, P. J.
A Scaled Power Product Recurrence Examined Using Matrix Methods, Bull. Inst.
Comb. Appl., to appear.
Ferber, A.
[see: Clemens, D., Conlon, D.]
Fernandes, M. E.
[see: Cameron, P. J.]
Fiala, J.
[see: Broersma, H. J., Chaplick, S.]
Fici, G.
[see: Crochemore, M.]
Filipiak, K.
[see: Bailey, R. A.]
Filmus, Y.
[see: Ellis, D.]
Fink. A. and Moci, L.
Matroids over a ring. J. Eur. Math. Soc. 18 (2016) 681-731.
http://dx.doi.org/10.1471/JEMS/600
http://arxiv.org/pdf/1209.6571
Fink, A. Rajchgot, J. and Sullivant, S.
Matrix Schubert varieties and Gaussian conditional independence models. Preprint.
http://arxiv.org/pdf/1510.04124
Fink, A. and Rincon, F.
Stiefel tropical linear spaces. J. Comb. Theory. Ser. A. 135 (2015) 291-331.
http://dx.doi.org/10.1016/j.jcta.2015.06.001
http://arxiv.org/pdf/1305.6329
Fink, A.
[see: Berget, A.]
Fiti, G.
[see: Badkobeh, G.,]
Fiz Pontiveros, G., Griffiths, S., Morris, R. D., Saxton, D. and Skokan, J.
On the Ramsey number of the triangle and the cube. Combinatorica 36 (2016):71-89
http://dx.doi.org/10.1007/s00493-015-3089-8
http://arxiv.org/pdf/1302.3840
Fleiner, T.
[see: Biró, P., Cechlárová, K.]
Florescu, L. and Perkins, W.
Spectral Thresholds in the Bipartite Stochastic Block Model. Preprint.
http://arxiv.org/pdf/1506.06737
Fodor, F.,
[see: Bárány, I.]
Foniok, J.
[see: Atminas, A.]
Fontaine, A.
[see: Clifford, R.]
Forbes, A. D.
Snark designs. Util. Math., to appear.
Forbes, A. D. and Forbes, T. J.
Hanoi revisited. Math. Gaz., to appear.
Forbes, T. J.
[see: Forbes, A. D.]
Ford, K., Green, B. J., Konyagin, S., Maynard, J. and Tao, T.
Large gaps between primes. Ann. Math.. to appear.
http://www.math.uiuc.edu/~ford/wwwpapers/primegaps.pdf
Ford, K., Green, B. J., Konyagin, S., and Tao, T.
Long gaps between primes. Prerpint.
http://www.math.uiuc.edu/~ford/wwwpapers/primegaps2.pdf
Ford. K. Maynard, J. and Tao, T.
Chains of large gaps between primes. Preprint.
http://arxiv.org/pdf/1511.04468.pdf
Ford, K.
[see: Eberhard, S.]
Fotakis,D.
[see: Andreou, M. I.]
Foucaud, F., Krivelevich, M. and Perarnau, G.
Large subgraphs without short cycles. SIAM J. Discrete Math. 29 (2015) 65-78.
http://dx.doi.org/10.1137/140954416
http://arxiv.org/pdf/1401.4928.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, to appear.
http://arxiv.org/pdf/1405.2424
Fountoulakis, N.
On a geometrization of the Chung-Lu model for complex networks.
J. Complex Networks 3 (2015)_ 361-387.
http://web.mat.bham.ac.uk/N.Fountoulakis/JCN_revised.pdf
Fountoulakis, N., Khosla, M. and Panagiotou, K.
The Multiple-Orientability Thresholds for Random Hypergraphs. Combin. Probab.
Comput., to appear.
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, to appear. .
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., to appear.
http://math.mit.edu/~fox/paper-Ramseymultiplecolors.pdf
Fox, J. Loh, P. and Zhao, Y.
The critical window for the classical Ramsey-Turan problem. Combinatorica 35
(2015) 435-476.
http://dx.doi.org/10.1007/s00493-014-3025-3
http://math.mit.edu/~fox/paper-ramsey-turan-2.pdf
Fox, J., Lovász, L. M. and Zhao, Y.
On regularity lemmas and their algorithmic applications. Preprint.
http://arxiv.org/pdf/1604.00733
Fox, J. and Zhao, Y.
A short proof of the multidimensional Szemerédi theorem in the primes. Amer. J.
Math. 137 (2015)
http://dx.doi.org/10.1353/ajm.2015.0028
http://math.mit.edu/~fox/paper-mult-sz-primes.pdf
Fox, J.
[see: Conlon, D.]
Franchi, C., Ivanov, A. A. and Mainardis, M.
Standard Majorana representations of the symmetric groups. J. Algebr. Combin., to
appear.
http://dx.doi.org/10.1007/s10801-016-0668-8
Frank, M.
[see: Codish, M.]
Fraser, J. and Todd. M.
Quantifying inhomogeneity in fractal sets. Preprint.
http://arxiv.org/pdf/1511.02081
Freeman, N. P.
[see; Crane, E. T.]
Frenkel, P. E.
[see: Csikvári, P. ]
Friedetzky, T.
[see: Berenbrink, P.]
Friedgut, E.
[see: Ellis, D.]
Froese, A., Nichterlein, A. and Niedermeier, R.
Win-Win Kernelization for Degree Sequence Completion Problems. J. Comput. Syst.
Sci., to appear.
http://arxiv.org/pdf/1404.5432
Frieze, A. M.
[see: Bal, D., Cooper, C., Dyer, M. E.]
Fulla, P. and Zivny, S.
On Planar Valued CSPs. Preprint.
http://arxiv.org/pdf/1602.06323
Fulla, P. and Zivny, S.
A Galois Connection for Valued Constraint Languages of Infinite Size. Lect. Notes.
Comput. Sci. 9134 (2015) 517-528
http://dx.doi.org/10.1007/978-3-662-47672-7_42
http://arxiv.org/pdf/1502.05086
Füredi, Z.
[see: Balister, P. N.]
Gadouleau, M.
Finite dynamical systems, hat games and coding theory. Preprint.
http://arxiv.org/pdf/1510.05824
Gadouleau, M.
On the possible values of the entropy of undirected graphs. Preprint.
http://arxiv.org/pdf/1512.01348
Gadouleau, M.
Maximum Rank and Asymptotic Rank of Finite Dynamical Systems. Preprint.
http://arxiv.org/pdf/1512.01448
Gadouleau, M. and Georgiou, N.
New constructions and bounds for Winkler's hat game. SIAM J. Discrete Math. 29
(2015) 823-834.
http://dx.doi.org/10.1137/130944680
http://arxiv.org/pdf/1311.2022
Gadouleau, M. and Richard, A.
Simple dynamics on graphs. Theor. Comput. Sci.,. to appear.
http://arxiv.org/pdf/1503.04688
Gadouleau, M., Richard, A. and Riis, S.
Fixed points of Boolean networks, guessing graphs, and coding theory SIAM J.
Discrete Math. 29 (2015) 2312-2335.
http://dx.doi.org/10.1137/140988358
http://arxiv.org/pdf/1409.6144
Gadouleau, M.
[see: Cameron, P. J., Castillo-Ramirez, A.]
Gagarin, A., Gutin, G. and Karapetyan, D.
Pattern Backtracking Algorithm for the Workflow Satisfiability Problem. Lect. Notes
Comput. Sci. 9130 (2015) 136-149.
http://dx.doi.org/10.1007/978-3-319-19647-3_13
http://arxiv.org/pdf/1412.7834
Gagarin, A., Gutin, G., Karapetyan, D. and Parkes, A. J.
Pattern-Based Approach to the Workow Satisfiability Problem with User-Independent
Constraints. Preprint.
http://arxiv.org/pdf/1604.05636.pdf
Gagarin, A. and Zverovich, V. E.
The probabilistic approach to limited packings in graphs. Discrete Appl. Math., 184
(2015)146-153.
http://dx.doi.org/10.1016/j.dam.2014.11.017
http://arxiv.org/pdf/1311.1707
Gagarin, A. and Zverovich, V. E.
Bounds and algorithms for limited packings in graphs. Preprint,
http://arxiv.org/pdf/1407.1637.pdf
Gagarin, A.
[see: Crampton, J., Devi, P.]
Gajarský, J., Hliněny, P., Kaiser, T., Král’, D., Kupec, M., Obdržálek, J.
Ordyniak, S,. and Tuma, V.
First order limits of sparse graphs: Plane trees and path-width. Random Struct.
Algorithms, to appear.
http://arxiv.org/pdf/1504.08122
Galanis, A., Göbel, A., Goldberg, L. A., Lapinskas, J. and Richerby, D.
Amplifiers for the Moran Process.Preprint. 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. SODA 2016.
http://arxiv.org/pdf/1505.06146
Galanis, A., Goldberg, L. A. and Jerrum, M. R.
Approximately Counting H-Colourings is #BIS-Hard. SIAM J. Comp., to appear. 7
http://arxiv.org/pdf/1502.01335
Galanis, A., Goldberg, L. A. and Jerrum, M. R.
A complexity trichotomy for approximately counting list H-colourings. Preprint.
http://arxiv.org/pdf/1602.03985
Galanis, A., Štefankovič, D. and Vigoda, E.
Inapproximability for Antiferromagnetic Spin Systems in the Tree Nonuniqueness
Region. J. ACM. 62 (2015) article 50.
http://dx.doi.org/10.1145/2785964
http://arxiv.org/pdf/1305.2902
Galanis, A., Štefankovič, D. and Vigoda, E.
Swendsen-Wang Algorithm on the Mean-Field Potts Model. APPROX-RANDOM
2015: 815-828.
http://dx.doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.815
http://arxiv.org/pdf/1502.06593
Galanis, A.
[see: Bezakova, I., Cai, J.-Y.]
Galvin, D., Kahn, J., Randall, D. and Sorkin, G. B.
Phase coexistence and torpid mixing in the 3-coloring model on 𝑍𝑑 . SIAM J.
Discrete Math. 29 (2015) 1223–1244.
http://dx.doi.org/10.1137/12089538X
Gambette, P., Huber, K. T. and Schols, G. E.
Bridging the gap between rooted and unrooted phylogenetic networks. Preprint.
http://arxiv.org/pdf/1511.08387
Ganguly, S.
[see: Bhattacharya, B. B.]
Ganian, R., Hliněny, P., Král’, D., Obdržálek, J. , Schwartz, J., and Teska, J.
FO model checking of interval graphs. Logical Methods in Computer Science
7 An earlier conference version appeared in Lect. Notes. Comput. Sci. 9134 (2015)
529-541. http://dx.doi.org/10.1007/978-3-662-47672-7_43
http://dx.doi.org/10.2168/LMCS-11(4:11)2015
http://arxiv.org/pdf/1302.6043
Gao, A., Kitaev, S. and Zhang, P.
Avoiding vincular patterns on alternating words, Discrete Math. to appear
http://arxiv.org/pdf/1507.06154
Gao, A., Kitaev, S. and Zhang, P.
Pattern-avoiding alternating words, Discrete Appl. Math. , to appear.
http://arxiv.org/pdf/1505.04078
Gao, A., Kitaev, S. and Zhang, P.
132-representable graphs. Preprint.
http://arxiv.org/pdf/1602.08965
Garbe, F. and Mycroft, R.
The complexity of the Hamilton cycle problem in hypergraphs of high minimum
codegree. STACS2016 1-13.
http://web.mat.bham.ac.uk/~mycroftr/2016STACS
Garcia, D., Macpherson, H. D. and Steinhorn, C.
Pseudofinite structures and simplicity. J. Math. Logic., 15 (2015) 1550002
http://dx.doi.org/10.1142/S0219061315500026
http://arxiv.org/pdf/1409.8635
Garcia-Colin, N. and Larman, D. G.
Projective Equivalences of k-neighbourly Polytopes. Graphs Comb., to appear.
http://arxiv.org/pdf/1303.3675
Gardy, C.
[see: Chauvin, B ]
Gasarch, W.
[see: Conlon, D.]
Gąsieniec, L., Hamilton, D. D. , Martin, R. and Spirakis, P. G.
The Match-Maker: Constant-Space Distributed Majority via Random Walks.
SSS2015: 67-80.
http://dx.doi.org/10.1007/978-3-319-21741-3_5
Gąsieniec, L.
[see: Akrida, E. C.]
Gaspers, S. and Sorkin, G. B.
Separate, Measure and Conquer: Faster Algorithms for Max 2-CSP and Counting
Dominating Sets. ICALP 2015. Lect. Notes Comput. Sci., 9134 (2015) 567-579.
http://dx.doi.org/10.1007/978-3-662-47672-7_46
http://arxiv.org/pdf/1404.0753
Gawrychowski, P., Kucherov, G., Sach, B. and Starikovskaya, T.
Computing the Longest Unbordered Substring. SPIRE 2015.
https://starikovskaya.files.wordpress.com/2015/06/main.pdf
Gebauer, H.
[see: Clemens, D.]
Genitrini, A., Gittenberger, B., Kraus, V. and Mailler, C.
Associative and commutative tree representations for Boolean functions. Theor.
Comput. Sci. 570 (2015) 70-101
http://dx.doi.org/10.1016/j.tcs.2014.12.025
Genitrini, A. and Mailler, C.
Generalised and Quotient Models for Random And/Or Trees and Application to
Satisfiability. Preprint.
http://arxiv.org/pdf/1507.08448
Gent, I. P., Kitaev, S., Konovalov, A. B., Linton, S. A. and Nightingale, P.
S-crucial and bicrucial permutations with respect to squares. J. Integer. Seq., 18 (2015)
Article 15.6.5.
http://www.emis.de/journals/JIS/VOL18/Kitaev/kitaev10.pdf
Georgakopoulos, A.
On graph-like continua of finite length. Topology and its Applications 173 (2014)
188–208
http://dx.doi.org/10.1016/j.topol.2014.05.017
http://arxiv.org/pdf/1401.5946
Georgakopoulos, A.
Group-Walk Random Graphs. To appear in Groups, Graphs, and Random Walks, T.
Ceccherini-Silberstein, M. Salvatori, and E. Sava-Huss Eds., LMS Lecture Note
Series, 2016.
http://arxiv.org/pdf/1506.02697
Georgakopoulos, A.
The Boundary of a Square Tiling of a Graph coincides with the Poisson Boundary.
Invent. Math., 203 (2016), 773-821.
http://dx.doi.org/10.1007/s00222-015-0601-0
http://arxiv.org/pdf/1301.1506
Georgakopoulos, A.
The planar cubic Cayley graphs. Mem. Am. Math. Soc.., to appear.
http://arxiv.org/pdf/1102.2087
Georgakopoulos, A., Haeseler, S., Keller, M. Lenz, D. and Wojchiekowski, R.
Graphs of Finte Measure. Journal de Mathematiques Pures et Appliquees 103 (2015)
1093–1131
http://dx.doi.org/10.1016/j.matpur.2014.10.006
http://arxiv.org/pdf/1309.3501
Georgakopoulos, A. and Hamann, M.
The planar Cayley graphs are effectively enumerable. Preprint.
http://arxiv.org/pdf/1506.03361
Georgakopoulos, A. and Wagner, S.
Limits of subcritical random graphs and random graphs with excluded minors
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, to
appear.
http://arxiv.org/pdf/1302.3212
Georgakopoulos, A.
[see: Alstrup,, S.,, Carmesin, J., Czumaj, A., Federici, B.]
Georgiou, N., Menshikov, M., Mijaatović, A. and Wade, A. R.
Anomalous recurrence properties of many-dimensional zero-drift random walks. Adv.
Appl. Probab., to appear.
http://arxiv.org/pdf/1506.08541
Georgiou, N.
[see: Gadouleau, M. R.]
Georgiou, O.
[see: Bocus, M. Z., Coon, J.-P., Dettmann, C. P.]
Gerencsér, B.
[see: Csóka, E.]
Gerke, S.
[see: Balister, P. N.]
Giandomenico, M.,. Letchford, A. N., Rossi, F. and Smriglio, S.
Ellipsoidal Relaxations of the Stable Set Problem: Theory and Algorithms SIAM J.
Optim., to appear.
http://www.lancaster.ac.uk/staff/letchfoa/articles/ellipsoids.pdf
Gianelli, E., Lim, K. J. and Wildon, M. R.
Sylow subgroups of symmetric and alternating groups and the vertex of
𝑆(𝑘𝑝−𝑝,1𝑝) in characteristic p. J. Algebra 455 (2016) 358-385
http://dx.doi.org/10.1016/j.jalgebra.2016.01.034
http://arxiv.org/pdf/1411.3502
Gianelli, E., Lim, K. J. and Wildon, M. R.
On signed p-Kostka numbers and the indecomposable Young permutation modules,
Preprint.
http://arxiv.org/pdf/1505.01073
Gianelli, E. and Wildon, M. R.
Indecomposable summands of Foulkes modules. J. Pure Appl. Algebra (2016), no. 8,
2969–2984
http://dx.doi.org/10.1016/j.jpaa.2016.01.013
http://arxiv.org/pdf/1508.05498
Giannopoulou, A. C. , Mertzios, G. B. and Niedermeier, R.
Polynomial fixed-parameter algorithms: A case study for longest path on interval
graphs. IPEC 2015.
http://community.dur.ac.uk/george.mertzios/papers/Conf/Conf_FPT-in-P-
proceedings.pdf
Giles, A. P.
[see: Dettmann, C. P.]
Gill, N.
On a conjecture of Degos. Cahiers de topologie et geometrie differentielle
categoriques., to appear.
http://arxiv.org/pdf/1502.03341
Gill, N.,, Gillespie, N. I., Nixon, A. and Semeraro, J.
Generating groups using hypergraphs.. Quart J. Math. 67 (2015) 29-52
http://dx.doi.org/10.1093/qmath/haw001
Gill, N. , Gillespie, N. I., Praeger, C. E. and Semeraro, J.
Conway groupoids, regular two-graphs and supersimple designs. Preprint.
http://arxiv.org/pdf/1510.06680
Gill, N. , Gillespie, N. I., Praeger, C. E. and Semeraro, J.
Conway’s groupoid and its relatives. Preprint.
http://arxiv.org/pdf/1604.04429
Gill, N. , Gillespie, N. I. and Semeraro, J.
Conway groupoids and completely transitive codes. Combinatorica., to appear.
http://arxiv.org/pdf/1410.4785
Gill, N. , Helfgott, H. A. and Rudnev, M.
On growth in an abstract plane. Proc. Amer. Math. Soc. 143 (2015) 3593-3602.
http://dx.doi.org/10.1090/proc/12309
http://arxiv.org/pdf/1212.5056
Gill, N.
[see: Azad, A., Barrantes, D., Britnell, J. R.]
Gillespie, N. I., Giudici, M., Hawtin, D. R. and Praeger, C. E.
Entry-Faithful 2-Neighbour Transitive Codes. Des. Codes Cryptography 79 (2016)
549-564.
http://dx.doi.org/10.1007/s10623-015-0069-3
http://arxiv.org/pdf/1412.7290
Gillespie, N. I.
[see: Akbari, M., Gill, N.]
Girodeau, R.,
[see: Bougeret, N.]
Gittenberger, B.
[see: Genitrini, A.]
Giudici, M.
[see: Burness, T. C.,. Gillespie, N. I.]
Glaser, S.
[see: Duffy, K. R.]
Glazman, A.
[see: Duminil-Copin, H.]
Glebov, R., Král’, D. and Volec, J.
A problem of Erdős and Sós on 3-graphs. Isr. J. Math., 211 (2015) 349-366.
http://dx.doi.org/10.1007/s11856-015-1267-4
http://arxiv.org/pdf/1303.7372
Glebov, R., Liebenau, A. and Szábo, T.
On the Concentration of the Domination Number of the Random Graph. SIAM J.
Discrete Math., 29 (2015) 1186-1206.
http://dx.doi.org/10.1137/12090054X
http://arxiv.org/pdf/1209.3115.pdf
Glebov, R.
[see: Clemens, D.]
Glen, M. and Kitaev, S.
Word-representability of triangulations of rectangular polyomino with a single
domino tile. J. Comb. Math. Comb. Comput., to appear.
http://arxiv.org/pdf/1503.05076.pdf
Glock, S.
On the f-matching polytope and the fractional f-chromatic index. International Journal
of Computer Mathematics 92 (2015) 1135-1142
http://web.mat.bham.ac.uk/S.Glock/f-matching%20polytope.pdf
Glock, S., Kühn, D., Lo, A., Montgomery, R. and Osthus, D.
On the decomposition threshold of a given graph. Preprint.
http://web.mat.bham.ac.uk/S.Glock/dec%20threshold.pdf
Glock, S., Kühn, D. and Osthus, D.
Optimal path and cycle decompositions of dense quasi-random graphs. J. Comb.
Theory Ser. B 118 )2016) 88-108.
http://dx.doi.org/10.1016/j.jctb.2016.01.004
http://web.mat.bham.ac.uk/D.Kuehn/cycledec%20final.pdf
Göbel, A., Goldberg, L. A., McQuillan, C., Richerby, D. and Yamakami, T.
Counting list matrix partitions of graphs. SIAM J. Comput. 44(2015) 1089-1118
http://dx.doi.org/10.1137/140963029
http://arxiv.org/pdf/1306.5176
Göbel, A., Goldberg, L. A. and Richerby, D.
Counting Homomorphisms to Square-Free Graphs, Modulo 2. ACM Trans. Comput.
Theory., to appear. 8
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.
Universal completability, least eigenvalue frameworks, and vector colorings. Preprint.
http://arxiv.org/pdf/1512.04972
Godsil, C. D., Roberson, D. E. , Rooney, B., Šámal, R. and Varvitsiotis, A.
Graph Cores via Universal Completability. Electron. Notes Discrete Math. 49
337–344
http://dx.doi.org/10.1016/j.endm.2015.06.046
Goldberg, L. A., Gysel, R. and Lapinskas, J.
Approximately counting locally-optimal structures. J. Comput. Syst. Sci.. to appear. 9
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, to appear.
http://dx.doi.org/10.1016/j.tcs.2016.04.008
http://arxiv.org/pdf/1509.03543
Goldberg, L. A. and Jerrum, M. R.
A complexity classification of spin systems with an external field. Proceedings of the
National Academy of Sciences 112 (2015) 13181-13186.
http://dx.doi.org/10.1073/pnas.1505664112
http://www.pnas.org/cgi/doi/10.1073/pnas.1505664112
Goldberg, L. A.
[see: Bezakova, I.,. Cai, J-Y., Diaz, J., Galanis, A., Göbel, A.]
Goldberg, P., A., Manlove, D. F. and Rastegari, B. Preference elicitation in matching markets via interviews: A study of offline
benchmarks (extended abstract). AAMAS 2016, to appear.
Goldwasser, J. L., Lidický. B., Martin, R. R., Offner, D. Talbot, J. M. and Young,
M.
Polychromatic Colorings on the Hypercube. Preprint.
http://arxiv.org/pdf/1603.05865
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, to appear.
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, to
appear.
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., to appear.
8 An earlier version appeared in ICALP 2015: 642-653,
http://dx.doi.org/10.1007/978-3-662-47672-7_52 9 An earlier version appeared in Lect. Notes. Comput. Sci. 9134 (2015) 654-665.
http://dx.doi.org/10.1007/978-3-662-47672-7_53
Golovach, P. A. and Mertzios, G. B.
Graph Editing to a Given Degree Sequence. CSR 2016, to appear.
http://arxiv.org/pdf/1601.03174
Golovach, P. A., Paulusma, D. and Stewart, I. A.
Graph editing to a fixed target. Discrete Appl. Math., to appear.
http://dx.doi.org/10.1016/j.dam.2014.07.008
Golovach, P. A. [see: Broersma, H. J., Cochefert , M., Dąbrowski, K. K.]
Gould, V., Hartmann, M. and Ruškuc, N.
Free monoids are coherent. Proc. Edinb. Math. Soc., to appear.
http://arxiv.org/pdf/1412.7340
Gowers, W. T.
Erdős and Arithmetic Progressions. In: Erdős Centennial, Bolyai Society
Mathematical Studies, 25, L. Lovász, I. Z. Ruzsa, V. T. Sós eds., Springer 2013. 265-
287
http://arxiv.org/pdf/1509.03421
Gowers, W. T and Viola, E.
The communication complexity of interleaved group products. Electron ic Coloquim
on Computational Complexity (2016). 10
http://eccc.hpi-web.de/report/2015/044/revision/1/download
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, J. Graded cluster algebras, J Algebr. Combin. 42 (2015) 1111-1134.
http://dx.doi.org/10.1007/s10801-015-0619-9
http://arxiv.org/pdf/1309.6170
Grabowski, Ŀ., Mathé, A. and Pikhurko, O.
Measurable equidecompositions for group actions with an expansion property
http://arxiv.org/pdf/1601.02958
Graham, B.
A binary deletion channel with a fixed number of deletions. Combin. Probab.
Comput, 24 (2015) 486-489.
http://dx.doi.org/10.1017/S0963548314000522
http://arxiv.org/pdf/1309.1410
Grannell, M. J. and Knor, M.
Pasch trades on the projective triple system of order 31. J. Comb. Math. Comb.
Comput., to appear.
http://users.mct.open.ac.uk/mjg47/papers/proj31.pdf
Grannell, M. J. and Schroeder, J. Z.
Biembeddings of 2-rotational Steiner triple systems. Elctron J. Comb. 22 (2015)
P2.23
http://users.mct.open.ac.uk/mjg47/papers/2rotv2.pdf
Granovsky, B. and Stark, D. S.
Developments in the Khintchine-Meinardus Probabilistic Method for Asymptotic
10
An earlier version appeared in STOC 2015: 351-360,
http://dx.doi.org/10.1145/2746539.2746560
Enumeration. Electr. J. Comb. 22 (2015) P4.32
http://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i4p32
Gratz, S. [see: Grabowski, J.]
Gray, R. D.
[see: Cain, A. J., Dolinka, I.]
Green, B. J. and Sanders, T.
Fourier uniformity on subspaces. Preprint.
http://arxiv.org/pdf/1510.08739
Green, B. J. and Sanders, T.
Monochromatic sums and products Discrete Anal., to appear. .
http://arxiv.org/pdf/1510.08733
Green, B. J.
[see: Eberhard, S., Ford, K.]
Green E. L., Schroll, S., Snashall, N. and Taillefer, R.
The Ext algebra of a Brauer graph algebra. Journal of Non-Commutative Geometry, to
appear.
http://arxiv.org/pdf/1302.6413
Greenhill, C. S.
[see: Dyer, M. E.]
Griffiths, S.
[see: Ahlberg, D., Allen, P,. Amini, O., Bollobás, B., Fiz Pontiveros, G.]
Griggs T.S.
Combinatorics of the sonnet. J. Humanistic Math., to appear.
Griggs, T. S. and McCourt, T. A.
Biemebeddings of symmetric n-cycle systems. Graphs Comb., 32 (2015) 147-160
http://dx.doi.org/10.1007/s00373-015-1538-1
Griggs T.S. and Stokes K. On pentagonal geometries with block size 3, 4 or 5. In: Symmetries in Graphs, Maps,
and Polytopes, Volume 159 of the series Springer Proceedings in Mathematics &
Statistics, 147-157
Griggs, T. S.
[see: Archdeacon, D. S.. Cavenagh, N. J.. Donovan, D. M., Drápal, A..]
Grimmett, G. R., Janson, S. and Norris, J. R.
Influence in product spaces. Adv. Appl. Probab., to appear.
http://www.statslab.cam.ac.uk/~grg/papers/gjn5.pdf
Grimmett, G. R. and Li, Z.
Self-avoiding walks and amenability. Preprint.
http://arxiv.org/pdf/1510.08659
Grimmett, G. R. and Li, Z.
Critical surface of the hexagonal polygon model. J. Stat. Phys., to appear.
http://arxiv.org/pdf/1508.07492
Grimmett, G. R. and Li, Z.
The 1-2 model. Proceedings of the 6th
Ahlfors-Bers symposium.
http://arxiv.org/pdf/1507.04109
Grimmett, G. R. and Li, Z.
Critical surface of the 1-2 model. Preprint.
http://arxiv.org/pdf/1506.08406
Grinberg, V. S.
[see: Bárány, I.]
Grinshpun, A.
[see: Fox, J.]
Gross, M.
[see: Arulselvan, A.]
Grossi, R.
[see: Crochemore, M. ]
Gruslys, V. , Leader, I. B. and Tan, T. S.
Tilings with arbitrary tiles. Preprint.
http://arxiv.org/pdf/1505.03697
Grzesik, A.
[see: Cooper, J. W.]
Gu, J., Hua, B. and Liu, S.
Spectral distances on graphs. Discrete Appli. Math. 190/191 (2015), 56-74
http://dx.doi.org/10.1016/j.dam.2015.04.011
Gu, J., Jost, J., Liu, S. and Stadler, P. F.
Spectral classes of regular, random, and empirical graphs. Linear Algebra Appl. 489
(2016) 30-49.
http://dx.doi.org/10.1016/j.laa.2015.08.038
http://arxiv.org/pdf/1406.6454
Guest, S.
[see: Fowler, P.]
Gunderson, K, Koch, S. and Przykucki, M. J.
The time of graph bootstrap percolation. Random Struct. Algorithms, to appear.
http://www.bristol.ac.uk/maths/people/karen-r-gunderson/pub/34874130
Gunderson, K., Morrison, N. and Semeraro, J.
Bounding the Number of Hyperedges in Friendship r-Hypergraphs. Eur J. Comb. 51
(2016) 125-134.
http://dx.doi.org/10.1016/j.ejc.2015.05.002
http://arxiv.org/pdf/1412.5822
Gunderson, K. and Semeraro, J.
Tournaments, 4-uniform hypergraphs, and an exact extremal result. Preprint.
http://arxiv.org/pdf/1509.03268
Gunderson, K.
[see: Aldridge, M.,. Balister, P. N., Bushaw, N.]
Guo, H.
[see: Bezakova, I., Cai, J.-Y., Goldberg, L. A.]
Gupta, A.
[see; Englert, M.]
Gutin, G. Jones, M., Sheng, B., Wahlstrom, M. and Yeo, A.
Acyclicity in Edge-Colored Graphs. Preprint.
http://arxiv.org/pdf/1601.01824
Gutin, G. Jones, M., Sheng, B., Wahlstrom, M. and Yeo, A.
Chinese Postman Problem on Edge-Colored Multigraphs. Preprint.
http://arxiv.org/pdf/1512.06283
Gutin, G., Jones. M. and Wahlström, M.
Structural Parameterizations of the Mixed Chinese Postman Problem. ESA2015, 668-
679.
http://dx.doi.org/10.1007/978-3-662-48350-3_56 .
http://arxiv.org/pdf/1410.5191
Gutin, G. and Patel, V.
Parameterized Travelling Salesman Problem: Beating the Average. SIAM J. Discrete
Math. 30 (2016) 220-238.
http://dx.doi.org/10.1137/140980946
http://arxiv.org/pdf/1408.0531
Gutin, G., and Wahlström, M. Tight Lower Bounds for the Workflow Satisfiability Problem Based on the Strong
Exponential Time Hypothesis. Inf. Process. Lett. 116 (2016) 223-226..
http://dx.doi.org/10.1016/j.ipl.2015.11.008
http://arxiv.org/pdf/1508.06829
Gutin, G. and Yeo, A.
Note on Perfect Forests in Digraphs. Preprint.
http://arxiv.org/pdf/1511.01661
Gutin, G. and Yeo, A.
Parameterized Constraint Satisfaction Problems: A Survey. Submitted.
http://www.cs.rhul.ac.uk/home/anders/PAPERS/Anders_Yeo_papers_detailed.html#2
016A
Gutin, G.
[see: Barbero, F., Crampton, J., Gagarin, A.]
Gysel, R.
[see: Goldberg, L. A.]
Haeneggi, M.
[see: Balister, P. N.]
Haeseler, S.
[see: Georgakopoulos, A.]
Hallldórsson, M. M., Kitaev, S. and Pyatkin, A.
Semi-Transitive Orientations and Word-Representable Graphs. Discrete Appl. Math.
201 (2016) 164-171.
http://dx.doi.org/10.1016/j.dam.2015.07.033
http://arxiv.org/pdf/1501.07108
Ham N. [see: Dolinka I.,]
Hamann, M.
[see: Georgakopoulos, A.]
Hamel, A. M. and King, R. C.
Tokuyama's Identity for Factorial Schur P and Q Functions. Electon J. Comb. 22
(2015) P21.42.
http://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i2p42
Hamel, A. M. and King, R. C.
A note on corollaries to Tokuyama's Identity for symplectic Schur $Q$-Functions.
Preprint.
http://arxiv.org/pdf/1509.09251
Hammond, A.
[see: Duminil-Copin, H.]
Hàn, H.
[see: Allen, P.]
Han, J.
Decision problem for Perfect Matchings in Dense k-uniform Hypergraphs. Preprint.
http://arxiv.org/pdf/1409.5931
Han, J.
Near Perfect Matchings in k-Uniform Hypergraphs. Combin. Probab. Comput.
24 (2015) 723-732
http://dx.doi.org/10.1017/S0963548314000613
http://arxiv.org/pdf/1404.1136
Han, J. and Kohayakawa, Y.
Maximum size of a non-trivial intersecting uniform family that is not a subfamily of
the Hilton-Milner family. Trans. Am. Math. Soc.,. to appear.
http://arxiv.org/pdf/1509.05464
Han, J., Lo, A., Treglown, A. and Zhao, Y.
Exact minimum codegree threshold for 𝐾4− factors. Preprint.
http://arxiv.org/pdf/1509.02577
Han, J. and Zhao, Y.
Forbidding Hamilton cycles in uniform hypergraphs. Preprint.
http://arxiv.org/pdf/1508.05623
Han, J. and Zhao, Y.
Minimum codegree threshold for Hamilton ℓ-cycles in k-uniform hypergraphs. J.
Comb. Theory Ser B. 132(2015) 194-223.
http://dx.doi.org/10.1016/j.jcta.2015.01.004
http://arxiv.org/pdf/1406.2225
Hancock, R. and Treglown, A.
On solution-free sets of integers. Preprint.
Hanson, J.
[see: Bhupatiraju, S.]
Harangi, V.
[see: Csóka, E.]
Hart, S. B., Hedtke, I., Müller-Hannemann, M. and Murthy, S.
A Fast Search Algorithm for <m,m,m> Triple Product Property Triples and an
Application for 5x5 Matrix Multiplication. Groups Complex. Cryptol. 7 (2015)
31-46
http://dx.doi.org/10.1515/gcc-2015-0001
http://arxiv.org/pdf/1305.0448
Hart, S. B.
[see: Anabanti, C. S.]
Hartinger, T. R., Johnson, M., Milanič, M. and Paulusma, D.
The price of connectivity for cycle transversals. MFCS2015. Lect. Notes Comput. Sci.
9235 (2015) 395-406.
http://dx.doi.org/10.1007/978-3-662-48054-0_33
Hartmann, M.
[see: Gould, V.]
Hartung, S. and Nichterlein, A. NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with
Directed Acyclic Graphs. SIAM J. Discrete Math. 29 (2015) 1931-1960
http://dx.doi.org/10.1137/130935756
http://fpt.akt.tu-berlin.de/publications/dag_realization_sidma.pdf
Hartung, S., Nichterlein, A., Neidermeier, R. and Suchy, O.
A refined complexity analysis of degree anonymization in graphs. Inf. Comput. 243
(2015) 249-262.
http://dx.doi.org/10.1016/j.ic.2014.12.017
Hartung, S., Konusiewicz, S., Nichterlein, A. and Suchy, O.
On structural parameterizations for the 2-club problem. Discrete Appl. Math. 185
(2015) 79–92
http://dx.doi.org/10.1016/j.dam.2014.11.026
Hartung, S.
[see: Bazgan, C]
Haskell D. [see: Aschenbrenner M.]
Haslegrave, J., Johnson, R. A. B. and Koch, S. The Robber Locating game. Discrete Math. 339 (2016) 109-117.
http://dx.doi.org/10.1016/j.disc.2015.07.018
http://arxiv.org/pdf/1311.3867
Haslegrave, J., Johnson, R. A. B. and Koch, S.
Subdivisions in the Robber Locating Game. Preprint.
http://arxiv.org/pdf/1509.04701
Haslegrave, J. and Jordan, J.
Preferemtial attachment with choice. Random Struct. Algorithms, to appear.
http://arxiv.org/pdf/1407.8421.pdf
Haslegrave, J. and Puljiz, M.
Reaching consensus on a connected graph. Preprint.
http://arxiv.org/pdf/1511.05435
Hatamo. N.
[see: Estrada. E]
Haug, N. and Prellberg. T.
Uniform asymptotics of area-weighted Dyck paths.
Journal of Mathematical Physics 56 (2015) 043301
http://dx.doi.org/10.1063/1.4917052
http://www.maths.qmul.ac.uk/~tp/papers/pub100pre.pdf
Hawtin, D. R.
[see: Gillespie, N. I.]
Haydn, N. and Todd, M.
Return times at periodic points in random dynamics. Preprint.
http://arxiv.org/pdf/1511.01657
Hebdige, M. and Král’, D.
Third case of the Cyclic Coloring Conjecture. SIAM J. Discrete Math. 30 (2016),
525–548 11
http://arxiv.org/pdf/1501.06624
Hebdige, M.
[see: Cohen-Addad, V., Dvořák, Z.]
Heckel, A.
The chromatic number of dense random graphs. Preprint.
http://arxiv.org/pdf/1603.04836
Heckel, A. and Riordan, O. M.
On the threshold for rainbow connection number r in random graphs Graphs Comb.,
32 (2016) 161-174.
http://dx.doi.org/10.1007/s00373-015-1534-5
http://arxiv.org/pdf/1307.7747
Hedtke, I.
[see: Hart, S. B.]
11
A summary appeared in Electron. Notes. Discrete Math. 49 (2015) 11-15.
http://dx.doi.org/10.1016/j.endm.2015.06.003
Hefetz, D., Krivelevich, M.,Naor, A. and Stojakovic, M.
On saturation games. Eur J. Comb. 51 (2016) 315-335.
http://dx.doi.org/10.1016/j.ejc.2015.05.017
http://web.mat.bham.ac.uk/D.Hefetz/MyPapers/saturationGames35.pdf
Hefetz, D., Krivelevich, M. and Tan, W.-E.
Waiter-Client and Client-Waiter planarity, colorability and minor games. Discrete
Math. 339 (2016) 1525-1536
http://dx.doi.org/10.1016/j.disc.2015.12.020
http://arxiv.org/pdf/1412.1346
Hefetz, D., Krivelevich, M. and Tan, W.-E.
Waiter-Client and Client-Waiter Hamiltonicity games on random graphs. Preprint.
http://arxiv.org/pdf/1509.05356.pdf
Hefetz, D.
[see: Bednarska-Bzdega, M., Clemens, D.]
Helfgott, H. A.
[see: Gill, N.]
Hertz, A., Lozin, V. V., Ries, B., de Werra, D. and Zamaraev, V.
Dominating induced matchings in graphs containing no long claw. Preprint.
http://arxiv.org/pdf/1505.02558
Heuberger, L.
[see: Akhtar, M.]
van den Heuvel, J., Ossona de Mendez, P.,. Quiroz, D., Rabinovich, R. and
Siebertz, S.
On the Generalised Colouring Numbers of Graphs that Exclude a Fixed Minor .
Preprint. 12
http://arxiv.org/pdf/1602.09052
Higham, D. J.
[see: Aprahmian, M.]
Higham, N. J.
[see: Aprahmian, M.]
Hindman, N., Leader, I. B. and Strauss, D.
Pairwise sums in colourings of the reals. Preprint.
http://arxiv.org/pdf/1505.02500
Hindman, N., Leader, I. B. and Strauss, D.
Extensions of Infinite Partition Regular Systems. Electron. J. Comb. 22 (2015) P2.29
http://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i2p29
Hindman, N.
[see: Barber, B.]
Hirschfeld, J. W. P. and Pichanick, E. V. D.
Bounds in finite Desarguesian planes. J. Comb. Des., 24 (2016) 184-196.
http://dx.doi.org/10.1002/jcd.21426
http://onlinelibrary.wiley.com/doi/10.1002/jcd.21426/pdf
Hladký, J., Komlós, J., Piguet, D., Simonovits, M., Stein, M. J. and Szemerédi,
E.
The approximate Loebl-Komlós-Sós Conjecture I: The sparse decomposition. SIAM J.
Discrete Math., to appear.
http://arxiv.org/pdf/1408.3858.pdf
12
An extended abstract appeared in Electron. Notes Discrete Math. 49 (2015) 523-530 http://dx.doi.org/10.1016/j.endm.2015.06.072
Hladký, J., Komlós, J., Piguet, D., Simonovits, M., Stein, M. J. and Szemerédi,
E.
The approximate Loebl-Komlós-Sós Conjecture II: The rough structure of LKS
graphs. SIAM J. Discrete Math., to appear. .
http://arxiv.org/pdf/1408.3871.pdf
Hladký, J., Komlós, J., Piguet, D., Simonovits, M., Stein, M. J. and Szemerédi,
E.
The approximate Loebl-Komlos-Sos conjecture and embedding trees in sparse graphs.
Electron. Res. Announc. Math. Sci. 22 (2015) 1-11.
http://dx.doi.org/10.3934/era.2015.22.1
http://arxiv.org/pdf/1406.3935.pdf
Hladký, J., Král’, D. and Norin, S.
Counting flags in triangle-free digraphs. Combinatorica, to appear.
http://arxiv.org/pdf/0908.2791
Hladký, J., and Piguet, D.
Loebl-Komlos-Sos Conjecture: dense case. J. Comb. Theory.Ser B. 116 (2016)
123-190
http://dx.doi.org/10.1016/j.jctb.2015.07.004
http://arxiv.org/pdf/0805.4834
Hladký, J.
[see: Allen, P., Böttcher, J.,. Csikvári, P. Doležal, M.]
Hlásek, F.
[see: Dvořák, Z.]
Hliněny, P.
[see: Gajarský, J.,. Ganian, R.]
van 't Hof, P.
[see: Chaplick, S., Dąbrowski, K. K.]
Hoffmann, M.
[see: Erlebach, T.]
Hogben, L., Palmowski, K. F., Roberson, D. E. and Severini,, S.
Fractional Zero Forcing via Three-color Forcing Games. Preprint.
http://arxiv.org/pdf/1509.02883
Holt, D.F. and Rees, S. E. Conjugacy in Artin groups of extra-large type. J. Altgebra, 434 (2015) 12-26.
http://dx.doi.org/10.1016/j.jalgebra.2015.03.013
http://arxiv.org/pdf/1309.4341
Holt, D. F. [see: Ciobanu, L.]
House, T., Janson, S., Luczak, M. and Windridge, P.
Critical SIR epidemic on a random graph with given degrees. Preprint.
http://arxiv.org/pdf/1501.05798
Howison, S. D.,
[see: Bazzi, M.]
Hu, K., Jones, G. A., Nedela, R. and Wang, N.E.
Non-abelian almost totally branched coverings over the platonic maps. Eur. J. Comb.
51 (2016)
http://dx.doi.org/10.1016/j.ejc.2015.04.008 10.1016/j.ejc.2015.04.008
Hu, P.
[see; Balogh, J.]
Hua, B.
[see: Gu, J.]
Huang, S., Johnson, M. and Paulusma, D.
Narrowing the Complexity Gap for Colouring (𝐶𝑠,𝑃𝑡)−Free Graphs. The Computer
Journal 58 (2015) 3074-3088.
http://dx.doi.org/10.1093/comjnl/bxv039
Huang, S..
[see: Brandstädt, A.]
Hubai, T.
[see: Abért, M., Camarena, O. A,, Csikvári, P.]
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, to appear.
http://arxiv.org/pdf/1411.6804.pdf
Huber, K. T. and Kettleborough. G.
Distinguished minimal topological lassos. SIAM J. Discrete Math., 29 (2015)
940–961.
http://dx.doi.org/10.1137/130927644
http://arxiv.org/pdf/1308.2537
Huber, K. T., Linz, S., Moulton, V. and Wu, T. Spaces of phylogenetic networks from generalized nearest-neighbor interchange
operations. J. Math.Biol, 72 (2016) 699-725.
http://dx.doi.org/10.1007/s00285-015-0899-7
Huber, K. T., Moulton, V., Steel, M. and Wu, T.
Folding and unfolding phylogenetic trees and networks.. J. Math,. Biol., to appear.
http://arxiv.org/pdf/1506.04438.pdf
Huber, K. T., Moulton, V., and Wu, T.
Transforming phylogenetic networks: Moving beyond tree space. Preprint.
http://arxiv.org/pdf/1601.01788
Huber, K. T.
[see : Gambette, P.]
Hucikova, V.
[see : Conder, M. E.]
Huczynska, S. and Ruškuc, N.
Homomorphic image orders on combinatorial structures. Order 32 (2015) 205-226. ,
http://dx.doi.org/10.1007/s11083-014-9326-8
Huczynska, S. and Ruškuc, N.
Well quasi-order in combinatorics: embeddings and homomorphisms, in Surveys in
Combinatorics 2015 (A. Czumaj et al., eds.), LMS Lecture Note Series 424, CUP,
Cambridge, 2015, pp. 261-293.
Hunt, F. H., Perkins, S. and Smith, D. H.
Channel models and error correction codes for DNA information storage.
International Journal of Information and Coding Theory 3 (2015) 120-136.
http://dx.doi.org/10.1504/IJICOT.2015.072619
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., to appear.
http://arxiv.org/pdf/1401.7823
Hyde, J. T.
[see: Dolinka I.,]
Iliopoulos, C. S.
[see: Aashikur Rahman Azim, M., Barton, C.., Brankovic, L., Crochemore, M.]
Iliopoulos, V.,. McDiarmid, C. J. H. and Penman, D. B.
Linear Extensions and Comparable pairs in Partial Orders. Prepeint.
http://arxiv.org/pdf/1603.02901
Iliopoulou, M.
Incidence bounds on multijoints and generic joints. Discrete Comput. Geom. 54
(2015), 481-512
http://dx.doi.org/10.1007/s00454-015-9703-0
http://arxiv.org/pdf/1408.5867
Iliopoulou, M.
Counting multijoints. J. Comb. Theory Ser. A. 136 (2015) 143-163
http://dx.doi.org/10.1016/j.jcta.2015.06.009
http://arxiv.org/pdf/1401.6392
Iommi, G., Jordan, T. and Todd, M.
Recurrence and transience for suspension flows Isr. J. Math. 209 (2015) 547–592.
http://www.mcs.st-and.ac.uk/~miket/Papers/flows-parabolic.pdf
Iommi, G., Jordan, T. and Todd. M.
Transience and multifractal analysis. Ann. Inst. H. Poincare Anal. Non Lineaire, to
appear.
http://www.mcs.st-and.ac.uk/~miket/Papers/mfa_trans.pdf
Iosevich, A. , Roche-Newton, O. and Rudnev, M.
On discrete values of bilinear forms. Preperint.
http://arxiv.org/pdf/1512.02670
Iosevich, A. , Rudnev, M. and Zhai, Y.
Areas of triangles and Beck’s theorem in planes over finite fields. Combinatorica 35
(2015) 295-305.
http://dx.doi.org/10.1007/s00493-014-2977-7
http://arxiv.org/pdf/1205.0107
Irving, R. W., Kwanashie, A., Manlove, D. F. and Sing, C. T. S.
Profile-based optimal matchings in the Student/Project Allocation problem. Lect.
Notes Comput. Sci. 8986 (2015) 213-225.
http://dx.doi.org/10.1007/978-3-319-19315-1_19
http://arxiv.org/pdf/1403.0751
Irving, R. W.
[see: Biró, P.]
Itzhakov, A.
[see: Codish, M.]
Ivanov, A. A.
[see: Franchi, C.]
Jackson, B.
Chromatic polynomials. In: Topics in Chromatic Graph Theory L Beineke
and R J Wilson eds., CUP (2015) 56-72.
Jackson, B., Jordán, T., Servatius, B. and Servatius, H. Henneberg moves on mechanisms. Beiträge zur Algebra und Geometrie, 56 (2015) 587-591.
http://dx.doi.org/10.1007/s13366-014-0217-3
Jackson, B., Jordán, T. and Tanigawa, S.
Unique Low Rank Completability of Partially Filleed Matrices. Preprint. https://www.cs.elte.hu/egres/tr/egres-15-08.pdf Jackson, B., McCourt, T. A. and Nixon, A.
Necessary Conditions for the Generic Global Rigidity of Frameworks on Surfaces. Discrete
Comput. Geom., to appear.
Jackson, B. and Nixon, A.
Stress matrices and global rigidity of frameworks on surfaces. Discrete Comput.
Geom. 54 (2015) 586-609.
http://dx.doi.org/10.1007/s00454-015-9724-8
http://arxiv.org/pdf/1406.5996
Jackson, B. and Owen, J. C.
A characterisation of the generic rigidity of 2-dimensional point-line frameworks. J.
Comb. Theory Ser B., to appear.
http://arxiv.org/pdf/1407.4675
Jacob, E. and Mörters, P.
Robustness of scale-free spatial networks. Ann Probab. , to appear.
http://people.bath.ac.uk/maspm/sparob_submit.pdf
Jacob, E. and Mörters, P.
Robustness of spatial preferential attachment networks. WAW2015. Lect. Notes.
Comput. Sci. 9479 (2015) 3-14.
http://dx.doi.org/10.1007/978-3-319-26784-5_1
http://people.bath.ac.uk/maspm/LNCS_Robust.pdf
Jacob, E. and Mörters, P.
The spread of infections on evolving scale-free networks. Preprint.
http://arxiv.org/pdf/1512.00832
Jahanbekan, S., Kim, J., O, S. and West, D. B.
On r-Dynamic Coloring of Graphs. Discrete Appl. Math., to appear.
http://web.mat.bham.ac.uk/~kimjs/papers/dynamic/rdynam5.pdf
Jajcay, R. and Jones, G. A.
Cayley properties of merged Johnson graphs. Preprint.
http://arxiv.org/pdf/1509.03125
Jansen, S.
[see: Ercolani, N. M.]
Janson, S. and Warnke, L.
The lower tail: Poisson approximation revisited. Random Struct. Algorithms, 48 (2016)
219-246
http://dx.doi.org/10.1002/rsa.20590
http://www2.math.uu.se/~svante/papers/sj295.pdf
Janson, S.
[see: Addario-Berry, L., Balister, P. N.., Bollobás, B., Brightwell, G. R., Grimmett, G.
R., House, T.]
Járai, A. A.
[see: Bhupatiraju, S.]
Jeavons, P., and Xu, L.
Patterns from nature: Distributed greedy colouring with simple messages and minimal
graph knowledge. Information Sciences 316 (2015) 550-566.
http://dx.doi.org/10.1016/j.ins.2014.06.035
Jeavons, P., Scott, A. D. and Xu, L.
Feedback from nature: simple randomised distributed algorithms for maximal
independent set selection and greedy colouring. Preprint.
https://people.maths.ox.ac.uk/scott/Papers/feedback.pdf
Jeavons, P.
[see: Cohen, D. A.]
Jenssen, M.
[see: Davies. E.]
Jerrum, M. R. and Meeks, K.
Some hard classes of parameterised counting problems. ACM Trans. Comput. Theory,
7 (2015), Article 11.
http://dx.doi.org/10.1145/2786017
http://arxiv.org/pdf/1310.6524
Jerrum, M. R. and Meeks, K.
The parameterised complexity of counting even and odd induced subgraphs.
Combinatorica, to appear.
http://arxiv.org/pdf/1410.3375.pdf
Jerrum, M. R.
[see: Cai, J-Y., Chen, X., Dyer, M. E., Galanis, A., Goldberg, L. A.]
Jia, X.
[see: Erickson, A.]
Johnson, J. R. and Walters, M. J.
Optimal resistor networks. Preprint.
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 (2015).
http://dx.doi.org/10.1007/s00453-015-0009-7
Johnson, M. , van Leeuwen, E. J. and Paulusma, D.
What Graphs are 2-Dot Product Graphs? Preprint. 13
http://arxiv.org/pdf/1511.05009v1
Johnson, M. and Lotfifar, F.
A multi-level hypergraph partitioning algorithm using rough set clustering. In Euro-
Par 2015: Parallel Processing: 21st International Conference on Parallel and
Distributed Computing, Vienna, Austria, August 24-28, 2015, Proceedings. Träff,
Jesper, Hunold, Sascha & Versaci, Francesco Heidelberg: Springer. 9233: 159-170.
Johnson, M. Paulusma, D. and Stewart, A.
Knocking out 𝑃𝑘 −free graphs. Discrete Appl. Math. 190-191 (2015). 100-108.
http://dx.doi.org/10.1016/j.dam.2015.04.010
Johnson, M. [see: Bonamy, M.., Dąbrowski, K. K., Feghali, C., Golovach, P. A., Hartinger, T. R.,
Huang, S. ]
Johnson, M. E. and Kambites, M.
Face monoid actions and tropical hyperplane arrangements. Preprint.
http://arxiv.org/pdf/1604.03016v1
Johnson, M. E. and Kambites, M.
Convexity of tropical polytopes. Linear. Algebra Appl.485 (2015) 531-544.
http://dx.doi.org/10.1016/j.laa.2015.08.006
http://arxiv.org/pdf/1411.1630
Johnson, O.
Strong converses for group testing in the finite blocklength regime. Preprint.
http://arxiv.org/pdf/1509.06188
Johnson, O. [see: Aldridge, M.]
13
A conference version of this appeared in
Johnson, P.
Double Hurwitz numbers via the infinite wedge. Trans. Am. Math. Soc., 367 (2015))
6415–6440
http://www.ams.org/journals/tran/0000-000-00/S0002-9947-2015-06238-2/S0002-
9947-2015-06238-2.pdf
Johnson, R. A. B.
[see: Haslegrave, J.]
Jones, G. A. Bipartite graph embeddings, Riemann surfaces and Galois groups Discrete Math. 338
(2015) 1801-1813.
http://dx.doi.org/10.1016/j.disc.2015.03.002
Jones, G. A. and Ziv-Av, M.
Petrie Duality and the Anstee–Robertson Graph. Symmetry 7 (2015) 2206-2223.
http://dx.doi.org/10.3390/sym7042206
Jones, G. A.
[see: Hu, K., Jajcay, R.]
Jones, M., Kitaev, S., Pyatkin, A. and Remmel, J.
Representing Graphs via Pattern Avoiding Words. Electron J. Comb. 22 (2015) 2.53.
http://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i2p53
Jones, M.
[see: Barbero, F., Crampton, J., Crowston, R., Gutin, G.]
Jones, S. A. M. and Thomas, R. M.
Formal languages and group theory. Proceedings of Groups St Andrews 2013.
Lond. Math. Soc. Lect. Note Ser. 422 (October 2015). 306-323.
ISBN: 9781107514546
Jones, S. K., Perkins, S. and Thomas, C. R.
Can a Tromino be Tiled with Unit Trominoes? Math. Spectrum 48 (2016) 78-81
Jones, T. G. F.
An improved incidence bound for fields of prime order. Eur. J. Comb. 52:(2016)
136-145.
http://dx.doi.org/10.1016/j.ejc.2015.09.004
http://arxiv.org/pdf/1110.4752
Jones, T. G. F.
New Results for the Growth of Sets of Real Numbers. Discrete Comput. Geom., 54
(2015) 759-770.
http://dx.doi.org/10.1007/s00454-015-9731-9
http://arxiv.org/pdf/1202.4972
Jonusas, J.
[see: Hyde J. T.]
Joos, F.
Random Subgraphs in Sparse Graphs. SIAM J. Discrete Math. 29 (2015) 2350-2360
http://dx.doi.org/10.1137/140976340
http://arxiv.org/pdf/1312.0732
Joos, F.
Longest Paths in Circular Arc Graphs. Discuss. Math. Graph Theory. 35 (2015)
419-426.
http://arxiv.org/pdf/1312.3075
Joos, F.
A Characterization of Mixed Unit Interval Graphs. J. Graph Theory 79 (2015),
267–281.
http://dx.doi.org/10.1002/jgt.21831
http://arxiv.org/pdf/1312.0729
Joos, F. and Nguyen, V. H.
Induced Matchings in Graphs of Maximum Degree 4 SIAM J. Discrete Math. 30
(2016) 154-165.
http://dx.doi.org/10.1137/140986980
http://arxiv.org/pdf/1407.8336
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. Preprint.
http://arxiv.org/pdf/1601.03714
Joos, F. and Rautenbach, D.
Equality of distance packing numbers. Discrete Math. 338 (2015) 2374-2377.
http://dx.doi.org/10.1016/j.disc.2015.06.003
http://arxiv.org/pdf/1402.6129
Joos, F.
[see: Bruhn, H., Duarte, M. A., Eckert, J., Ehard, S.] Jordan, J. and Wade, A. R.
Phase transitions for random geometric preferential attachment graphs. Adv. Appl.
Probab., 47 (2015). 565-588
http://dx.doi.org/10.1239/aap/1435236988
http://arxiv.org/pdf/1311.3776
Jordan, J.
[see: Haslegrave, J.]
Jordan, T.
[see: Iommi, G.]
Jordán, T.
[see: Jackson, B.]
Jost, J.
[see: Gu, J.]
Jowhari, H.
[see: Ergün, F.]
Kahn, J.
[see: Galvin, D.]
Kaiser, T.
[see: Broersma, H. J., Cooper, J. W, Gajarský, J..]
Kalikow, S.
[see: Bushaw, N.]
Kambites, M.
[see: Johnson, M. E.]
Kamiński, M., Paulusma, D., Stewart, A. and Thilikos, D. M.
Minimal disconnected cuts in planar graphs. FCT2015. Lect. Notes. Comput. Sci.
9210 (2015) 243-254.
http://dx.doi.org/10.1007/978-3-319-22177-9_19
https://community.dur.ac.uk/daniel.paulusma/Papers/Submitted/minimaldisconnected
cut.pdf
Kanellopoulos, V.
[see: Dodos, P.]
Kang, D. Y., Kim, J., Kim, Y.
On the Erdős-Ko-Rado theorem and Bollobás theorem for t-intersecting families. Eur.
J. Comb. 47 (2015) 68-74
http://dx.doi.org/10.1016/j.ejc.2015.01.009
http://arxiv.org/pdf/1408.3292
Kang, D. Y., Kim, J., Kim, Y. and Suh, G.
Sparse spanning k-connected subgraphs in tournaments . Preprint.
http://arxiv.org/pdf/1603.02474
Kang, R. J., Patel, V. and Regts, G.
On a Ramsey-type problem of Erdős and Pach. Electron. Notes Discrete Math. 49
(2015) 821-827
http://dx.doi.org/10.1016/j.endm.2015.06.049
http://arxiv.org/pdf/1411.4459
Kangaslampi, R. and Vdovina, A.
Hyperbolic triangular buildings without periodic planes of genus two .Exoerimental
Mathematics, to appear.
http://arxiv.org/pdf/1409.1401
Karapetyan, D.
[see: Crampton, J., Gagarin, A.]
Kärkkäinen, J.
[see: Crochemore, M. ]
Kasprzyk, A.
[see: Akhtar, M.]
Kaszanitzky, V. and Schulze, B.
Lifting symmetric pictures to polyhedral scenes. Preprint.
https://www.cs.elte.hu/egres/tr/egres-15-07.pdf
Kaszanitzky, V. and Schulze, B.
Characterizing minimally flat symmetric hypergraphs. Preprint.
http://www.cs.elte.hu/egres/tr/egres-15-17.pdf
Kawarabayashi, K.
[see: Dvořák, Z.]
Keedwell A. D.
[see; Dénes, J.]
Keevash, P. and Long, E. P.
On the normalized Shannon capacity of a union. Preprint.
http://arxiv.org/pdf/1603.03616
Keevash, P., and Mycroft, R.
A multipartite Hajnal-Szemeredi theorem. J. Combin. Theory Ser. B 114 (2015)
187--236.
http://dx.doi.org/10.1016/j.jctb.2015.04.003
http://people.maths.ox.ac.uk/keevash/papers/MultipartiteHS.pdf
Keevash, P. and Sudakov, B.
Bounds for spherical codes. Preprint.
http://arxiv.org/pdf/1602.07645
Keller, M.
[see: Georgakopoulos, A.]
Kendall, M. and Martin, K. M.
Graph-theoretic design and analysis of key predistribution schemes. Des. Codes
Cryptography (2015) 1-24.
http://dx.doi.org/10.1007/s10623-015-0124-0
http://eprint.iacr.org/2014/355.pdf
Kenyon, R., Král’, D., Radin, C. and Winkler, P.
Permutations with fixed pattern densities. Preprint.
http://arxiv.org/pdf/1506.02340
Kern, W.
[see: Biró, P.]
Kettleborough. G.
[see: Huber, K. T.]
Key, J..D., McDonough, T. P. and Mavron, V. C.
Codes from Hall planes of odd order. Advances in Mathematics of Communications,
to appear.
Khosla, M.
[see: Fountoulakis, N.]
Kiasari, A. , Navaridas, J. and Stewart, I. A.
Routing packets on DPillar data centre networks. ICA3PP'15, Lect. Notes Comput. Sci.
9531 (2015) 329-343
http://dx.doi.org/10.1007/978-3-319-27140-8_23
Kiasari, A.
[see: Erickson, A.]
Kim, J.
Regular Subgraphs of Uniform Hypergraphs. J. Comb. Theory Ser. B., to appear.
http://web.mat.bham.ac.uk/~kimjs/papers/regularhypergraphs/regular_submitted.pdf
Kim, J. Kostochka, A. V. and Zhu, X.
Improper Coloring of Sparse Graphs with a given girth, II: Constructions. J. Graph
Theory 81 (2016) 403-413.
http://dx.doi.org/10.1002/jgt.21886
http://web.mat.bham.ac.uk/~kimjs/papers/Defective/improperlargegirth14.pdf
Kim, J., Kühn, D. and Osthus, D.
Bipartitions of Highly Connected Tournaments. SIAM J. Discrete Math., to appear.
http://web.mat.bham.ac.uk/~kimjs/papers/tournamentconnectivity/TournamentBipartit
ionConnectivity8.pdf
Kim, J., Kühn, D. , Osthus, D. and Townsend, T.
Forbidding induced even cycles in a graph: typical structure and counting . Preprint.
http://arxiv.org/pdf/1507.04944
Kim, J., Kühn, D. , Osthus, D. and Tyomkyn, M.
A blow-up lemma for approximate decompositions . Preprint.
http://arxiv.org/pdf/1604.07282
Kim, J.
[see: Choi, I., Jahanbekan, S.,, Kang, D. Y.]
Kim, J. H.
[see: Conlon, D.]
Kim, Y.
[see: Kang, D. Y.]
Kindler, G.
[see: Ellis, D.]
King, R. C.
[see: Azenhas, O., Hamel, A. M.]
King, O.H.
[see: Cossidente, A.]
Kitaev, S.
On graphs with representation number 3. J. Autom. Lang. Comb , 18 (2013) 2, 97-112
http://arxiv.org/pdf/1403.1616
Kitaev, S. and Lozin, V. V.
Words and Graphs. In: Monographs in Theoretical Computer Science
ISBN: 978-3-319-25857-7
http://www.springer.com/us/book/9783319258577
Kitaev, S. and Remmel, J.
(a,b)-rectangle patterns in permutations and words, Discrete Appl. Math. 186 (2015)
128-146
http://dx.doi.org/10.1016/j.dam.2014.12.024
http://arxiv.org/pdf/1304.4286
Kitaev, S. and Remmel, J.
A note on p-ascent sequences. J. Comb., to appear.
http://arxiv.org/pdf/1503.00914
Kitaev, S., Remmel, J. and Tiefenbruck, M.
Quadrant mariked mesh patterns in 132-avoiding permutations II. Integers 15 (2015)
A16.
http://www.emis.de/journals/INTEGERS/papers/p16/p16.pdf
Kitaev, S., Remmel, J. and Tiefenbruck, M.
Quadrant mariked mesh patterns in 132-avoiding permutations III. Integers 15 (2015)
A39
http://www.emis.de/journals/INTEGERS/papers/p39/p39.pdf
Kitaev, S. and Vajnovski, V.
Mahonian STAT on words. Inf. Process Lett. 116 (2016) 157-162
http://dx.doi.org/10.1016/j.ipl.2015.09.006
http://arxiv.org/pdf/1408.4290
Kitaev, S.
[see: Avgustinovich, S., Chen, T. Z. Q.,. Chen, Z., Ehrenborg, R., Gao, A., Gent, I. P.,
Glen, M., Halldórsson, M. M., Jones, M.]
Kitson, D. and Schulze, B.
Maxwell-Laman counts for bar-joint frameworks in normed spaces.Lin. Algebra. Appl.
481 (2015) 313-329
http://dx.doi.org/10.1016/j.laa.2015.05.007
http://arxiv.org/pdf/1406.0998
Kitson, D. and Schulze, B.
Motions of grid-like reflection frameworks. J. Symb. Comput. , to appear.
Kitson, D.
[see: Cruickshank, J.,]
Kittipassorn, T. and Narayanan, B.
Approximations to exactly m-coloured complete infinite subgraphs. J. Graph Theory,
80 (2015) 313-322.
http://dx.doi.org/10.1002/jgt.21853
https://www.dpmms.cam.ac.uk/~bp338/pdf/approx_col.pdf
Kittipassorn, T.
[see: Bollobás, B.]
Kivelä, M. and Porter, M. A.
Isomorphisms in Multilayer Networks. Preprint.
http://arxiv.org/pdf/1506.00508
Klaus, B., Manlove D. F. and Rossi, F.
Matching Under Preferences. Handbook of Computational Social Choice (Felix
Brandt, Vincent Conitzer, Ulle Endriss, Jérôme Lang, and Ariel Procaccia, eds),
Cambridge University Press, Aprial 2016, 333-355.
http://www.cambridge.org/qa/academic/subjects/computer-science/artificial-
intelligence-and-natural-language-processing/handbook-computational-social-
choice?format=HB
Klimošová, T.
[see: Chudnovsky, M..]
Kling, P.
[see: Berenbrink, P.]
Knor, M.
[see: Grannell, M. J.]
Koch, S.
[see: Gunderson, K., Haslegrave, J.]
Kociumaka, T.
[see: Crochemore, M.]
Kohayakawa, Y.
[see: Allen, P., Böttcher, J.. Dellamonica, D., Han, J.]
Kolmogorov,V., Krokhin, A. and Rolinek, M.
The complexity of general-valued CSPs. FOCS2015, 1246-1258.
http://dx.doi.org/10.1109/FOCS.2015.80
http://arxiv.org/pdf/1502.07327
Kolpakov, R.
[see: Crochemore, M.]
Komlós, J.
[see: Hladký, J.]
Kontor, J. and Vdovina, A.
Classifying polygonal algebras by their K0-group. Proc. Edinb. Math. Soc.
58 (2015) 485-497
http://dx.doi.org/10.1017/S0013091514000194
https://www.staff.ncl.ac.uk/alina.vdovina/papers/12140.pdf
Konovalov, A. B.
[see: Gent, I. P.]
Konusiewicz, S.
[see: Hartung, S.]
Konyagin, S. V.
[see: Blackburn, S. R., Ford, K.]
Korpelainen, N.
[see: Brignall, R.]
Kostochka, A. V.
[see: Kim, J.]
Kotecký, R., Miloś, P. and Ueltschi, D.
The random interchange process on the hypercube. Electron. Commun. Probab. 21
(2016)
http://dx.doi.org/10.1214/16-ECP4540 .
http://arxiv.org/pdf/1509.02067
Kotthoff, L, McCreesh, C. and Solnon, C.
Portfolios of Subgraph Isomorphism Algorithms. LION2016, to appars.
Kozlik, A.
[see: Drápal, A.]
Krajewski, T., Moffatt, I. and Tanasa, A.
Combinatorial Hopf algebras and topological Tutte polynomials. Preprint.
http://arxiv.org/pdf/1508.00814
Král’, D.
[see: Christofides, D., Cohen-Addad, V ,, Cooper, J. W.. Czumaj, A.,. Dvořák, Z.,
Gajarský, J.,. Ganian, R.,. Glebov, R., Hebdige, M., Hladký, J., Kenyon, R..]
Kratsch, D.
[see: Cochefert , M., Golovach, P. A., Johnson, M.]
Kratsch, S.
[see: Johnson, M.,]
Krattenthaler, C. and Müller, T. W.
Truncated versions of Dwork's lemma for exponentials of power series and $p$-
divisibility of arithmetic functiens. Adv. Math. 283 (2015) 489-529.
http://dx.doi.org/10.1016/j.aim.2015.05.018
http://arxiv.org/pdf/1412.7014
Krattenthaler, C. and Müller, T. W.
Periodicity of free subgroup numbers of virtually free groups modulo prime powers. J.
Algebra 452 (2016) 372-389.
Krattenthaler, C. and Müller, T. W.
Free subgroup numbers modulo prime powers: the non-periodic case. Preprint.
http://arxiv.org/pdf/1602.08723
Krattenthaler, C. and Müller, T. W.
A method for determining the mod 𝑝𝑘 behaviour of recursive sequences. Preprint.
http://arxiv.org/pdf/1508.02580
Kraus, V.
[see: Genitrini, A.]
Krauthgamer, R..
[see: Englert, M.]
Krivelevich, M.
[see: Bednarska-Bzdega, M., Foucaud, F., Hefetx, D.]
Krokhin, A.
[see: Kolmogorov, V.]
Kubica, M.
[see: Crochemore, M.]
Kucherov, G.
[see: Crochemore, M., Gawrychowski, P.,]
Kühn, D., Osthus, D. and Patel, V.
A domination algorithm for {0,1}-instances of the travelling salesman problem.
Random Struct. Algorithms, to appear.
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., to appear.
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., to appear.
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, to appear.
http://web.mat.bham.ac.uk/D.Kuehn/TournamentConnectivity6.pdf
Kühn, D., Osthus, D. . Townsend, T. and Zhao, Y.
On the structure of oriented graphs and digraphs with forbidden tournaments or cycles.
Preprint.
http://web.mat.bham.ac.uk/D.Kuehn/OrientedHFreeGraphs6.pdf _ Kühn, D.
[see: Barber, B., Csaba, B., DeBiasio, L, Glock, S., Hefetz, D., Kim, J., Knox, F.]
Kundu, R.
[see; Barton, C., Brankovic, L,, Crochemore,. M.]
Kuo, C.-N. and Stewart, I. A.
Edge-pancyclicity and edge-bipancyclicity of faulty folded hypercubes. Theor.
Comput. Sci. 627 (2016) 102-106.
http://dx.doi.org/10.1016/j.tcs.2016.02.029
http://community.dur.ac.uk/i.a.stewart/Papers/EdgePanAndEdgeBiipancyclicityOfFau
ltyFoldedHypercubes.pdf
Kupec, M.
[see: Gajarský, J ..]
Kusuma, J.
[see: Cameron, P. J. ]
Kwanashie, A.
[see: Irving, R. W.]
Labbate, D.
[see: Abreu, M.]
La Fleur, S.,
[see: Conlon, D.]
Laing, T. M., Martin, K. M., Paterson, M. B. and Stinson, D. R.
Localised Multisecret Sharing. Preprint.
http://eprint.iacr.org/2015/922.pdf
Landau, G. M.
[see: Crochemore, M. ]
Lange, C., Liu,, S., Peyerimhoff, N. and Post, O.
Frustration index and Cheeger inequalities for discrete and continuous magnetic
Laplacians. Calculus of variations and partial differential equations 54 (2015.
4165-4196.
http://dx.doi.org/10.1007/s00526-015-0935-x
http://arxiv.org/pdf/1502.06299
Langiu, A.
[see: Crochemore,. M.]
Lapinskas, J.
[see: Galanis, A.,. Goldberg, L. A.]
Larcombe, P. J.
Closed Form Evaluations of Some Series Comprising Sums of Exponentiated
Multiples of Two-Term and Three-Term Catalan Number Linear Combinations.
Fibonacci Quarterly 53 (2015) 253-260.
Larcombe, P. J.
A New Formulation of a Result by McLaughlin for an Arbitrary Dimension 2 Matrix
Power, Bull. Inst. Comb. Appl. 76 (2016) 45-53.
Larcombe, P. J.
Horadam Sequences: A Survey Update and Extension, Bull. Inst. Comb. Appl., to
appear.
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. and Rabago, F. T. J.
On the Jacobsthal, Horadam and Geometric Mean Sequences. Bull. Inst. Comb. Appl.
76 (2016) 117-126.
Larcombe, P. J.
[see: Anjum, A.., Fennessey, E. J. ]
Larman, D. G.
[see: Alpers, A., Garcia-Colin, N.]
Launois, S. and Lecoutre, C.
Poisson Deleting Derivations Algorithm and Poisson Spectrum. Commun. Algebra.,
to appear.
http://arxiv.org/pdf/1409.4604.pdf
Launois, S. and Lecoutre, C.
A quadratic Poisson Gel'fand-Kirillov problem in prime characteristic. Trans. Am.
Math. Soc., 368 (2016),755-785 .
http://dx.doi.org/10.1090/tran/6352#sthash.05chMEjN.dpuf
http://arxiv.org/pdf/1302.2046
Launois, S.
{see: Bell, J.]
Leader, I. B. and Tan, T. S.
Cycles in Oriented 3-graphs. Discrete Comput. Geom. 54 (2015) 480-485.
http://dx.doi.org/10.1007/s00454-015-9702-1
http://arxiv.org/pdf/1409.0972
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., Barber, B., Bollobás, B., Gruslys, V., Hindman, N..]
Le Borgne, Y.
[see: Aval, J.-C.]
Lecoutre, C.
[see: Launois, S.]
Lee, C.
[see: Conlon, D.]
Lee, J.
[see: Conlon, D.]
Lee, S.
[see: Dellamonica, D.]
Lee, S. H.
[see: Cucuringu, J. ]
Leemans, D. and Liebeck, M. W.
Chiral polyhedra and finite simple groups. Preprint.
http://arxiv.org/pdf/1603.07713
Leemans D.
[see: Cameron, P. J.]
van Leeuwen, E. J.
[see: Johnson, M.]
Lenz, D.
[see: Georgakopoulos, A.]
Lenz, J.,. Mycroft, R. and Mubayi, D.
Hamilton cycles in quasi4random hypergraphs. Random Struct. Algorithms, to appear.
Lenz, J.
[see: Balogh, J..]
Lenz, M.
Splines, lattice points, and arithmetic matroids. J. Algebr. Combin. 43 (2016) 277-324.
http://dx.doi.org/10.1007/s10801-015-0621-2
http://arxiv.org/pdf/1408.4041 14
Lenz, M.
Lattice points in polytopes, box splines, and Todd operators. Int. Math. Res. Not.
2015 (2015) 5289–5310
http://dx.doi.org/10.1093/imrn/rnu095
http://arxiv.org/pdf/1305.2784
Lesta, V. P.
[see: Andreou, M. I.]
Letchford, A. N.
[see: Giandomenico, M.]
Letzter, S.
Large Monochromatic Triple Stars in Edge Colourings. J. Graph Theory 80 (2015)
323-328.
http://dx.doi.org/10.1002/jgt.21854
http://arxiv.org/pdf/1310.4666
Levin, D.
[see: Bevan, D.]
Lewis, R.R.
Distance partitions of extremal and largest known circulant graphs of degree 2 to 9.
Preprint.
http://arxiv.org/pdf/1408.0988
Lewis, R.R.
Improved upper bounds for the order of some classes of Abelian Cayley and circulant
graphs of diameter two. Preprint.
https://arxiv.org/pdf/1506.02844
Lewis, R. R.
[see: Bevan, D.]
Lewis-Pye, A.
[see: Bampalas, G.]
Li, Z.
[see: Cohen-Addad, V.. Grimmett, G. R.,]
Lidbetter, T.
[see: Csóka, E.]
Lidický, B.
[see; Goldwasser, J.]
Lidický, D.
14
A prelinary version of this appeared in FPSAC 2014 – see http://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAT0105/4438
[see; Balogh, J.]
Liebeck, M. W. [see: Leemans, D.]
Liebenau, A.
[see: Bloom, T., Choromanski, K., Clemens, D., Fox, J., Glebov, R.]
Lim, K. J.
[see: Gianelli, E.]
Linton, S. A.
[see: Gent, I. P.]
Linz, S.
[see: Huber, K. T.]
Lippner, G.
[see: Camarena, O. A.]
Liptak, Zs.
[see: Badkobeh, G.,]
Liu, H., Pikhurko, O. and Sousa, T.
Monochromatic Clique Decompositions of Graphs. J. Graph Theory 80 (2015)
287-298.
http://dx.doi.org/10.1002/jgt.21851
http://homepages.warwick.ac.uk/staff/O.Pikhurko/Papers/general-mono-clique.pdf
Liu, H.,
[see: Balogh, J.]
Liu, S.
Multi-way dual Cheeger constants and spectral bounds of graphs. Adv. Math. 268
(2015) 306-338.
http://dx.doi.org/10.1016/j.aim.2014.09.023
http://arxiv.org/pdf/1401.3147
Liu, S. , Münch, F. and Peyerimhoff, N.
Curvature and higher order Buser inequalities for the graph connection Laplacian.
Preprint.
http://arxiv.org/pdf/1512.08134
Liu, S.
[see: Gu, J., Hua, B.., Jost, J., Lange, C.] Lo, A.
Existence of rainbow matchings and rainbow matching covers. Discrete Math. 338
(2015) 2119-2124.
http://dx.doi.org/10.1016/j.disc.2015.05.015
Lo, A.
Properly coloured Hamiltonian cycles in edge-coloured complete graphs.
Combinatorica (2015) 1-22.
http://dx.doi.orgh/10.1007/s00493-015-3067-1
http://arxiv.org/pdf/1212.6736
Lo, A. and Markström, K.
F-factors in hypergraphs via absorption, Graphs Comb. 31 (2015) 679-712.
http://dx.doi.org/10.1007/s00373-014-1410-8
http://arxiv.org/pdf/1105.3411
Lo, A. and Patel, V.
Hamilton cycles in sparse robustly expanding digraphs. Preprint.
http://web.mat.bham.ac.uk/S.A.Lo/pub/ExpandingDigraphsHCs16.pdf
Lo, A.
[see: Barber, B.,, Glock, S. Han, J.. Kühn, D.]
Lo, I.
[see: Csóka, E.]
De Loera, J. A.
[see: Aliev, I.]
Loh, P.
[see; Fox, J.}
Long, E. P.
Forbidding intersection patterns between layers of the cube. J. Comb. Theory Ser.
A,134 (2015) 103-120.
http://dx.doi.org/10.1016/j.jcta.2014.08.008
http://arxiv.org/pdf/1311.5713
Long, E. P.
[see; Keevash, P.]
Lotfifar, F.
[see: Johnson, M.]
Loughlin N. [see: Dolinka I.,]
Louveaux, Q.
[see: Aliev, I.]
Lovász, L.
[see: Camerena, O. A.]
Lovász, L. M. and Zhao, Y.
On derivatives of graphon parameters, Preprint.
http://arxiv.org/pdf/1505.07448
Lovász, L. M.
[see: Fox, J.]
Lovegrove, G. J.
[see: Buratti, M.]
Lozin, V. V.
From matchings to independcent sets. Discrete Appl. Math., to appear.
Lozin, V. V. and Malyshev, D. S.
Vertex coloring of graphs with few obstructions. Discrete Appl. Math., to appear.
Lozin, V. V., Monnot, J. and Ries, B.
On the maximum independent set problem in subclasses of subcubic graphs.
J. Discrete Algorithms 31 (2015) 104-112.
http://dx.doi.org/10.1016/j.jda.2014.08.005
Lozin, V. V., Mosca, R. and Zamaraev, V.
Independent Domination versus Weighted Independent Domination. Preprint.
http://arxiv.org/pdf/1602.09124
Lozin, V. V., Razgon, I. and Zamaraev, V.
Well-quasi-ordering does not imply bounded clique-width. Lect. Notes. Comput. Sci.,
to appear.
http://arxiv.org/pdf/1503.00571
Lozin, V. V.
[see: Atminas, A., Brignall, R., Czumaj, A.,. Dąbrowski, K.K.,, Hertz, A., Kitaev, S.]
Lubetsky, E. and Zhao, Y.
On replica symmetry of large deviations in random graphs. Random Struct.
Algorithms 47 (2015) 109-146
http://dx.doi.org/10.1002/rsa.20658
http://arxiv.org/pdf/1210.7013
Lubetzky, E.
[see: Bhattacharya, B. B., Cooper, C.]
Luczak, M. J. and McDiarmid, C. J. H.
Balanced routing of random calls. Ann. Appl. Probab. 25 (2015) 1279-1324.
http://arxiv.org/pdf/0801.1260
Luczak, M. J.
[see: Barbour. A. D., Brightwell, G. R., House, T.]
Łuczak, T.
[see: Bednarska-Bzdega, M.]
MacCaig, M.
[see: Butkovič, P. ]
Macdonald, C., McCreesh, C., Miller, A. And Prosser, P.
Constructing sailing match race schedules: Round-robin pairing lists. CP 2015: Lect.
Notes Comput. Sci. 9255 (2015) 671-686
http://dx.doi.org/10.1007/978-3-319-23219-5_46
http://www.dcs.gla.ac.uk/~pat/cpM/papers/cp2015a.pdf
Maclagan, D. and Sturmfels, B.
Introduction to tropical geometry. AMS Graduate Studies in Mathematics, 161 (2015)
Macpherson, H. D. [see: Aschenbrenner M., Bodirsky, M., Garcia, D.]
Madelaine, F.R., Martin, B. and Stacho, J.
Constraint Satisfaction with Counting Quantifiers. SIAM J. Discrete Math., 29 (2015),
1065–1113.
http://dx.doi.org/10.1137/140981332
Magos, D.
[see: Cechlárová, K.]
Mahdjoubi, L.
[see: Barki, H.]
Mainardis, M.
[see: Franchi, C.]
Mailler, C.
[see: Broutin, N., Chauvin, B., Genitrini, A.]
Malheiro, A.
[see: Cain, A. J.]
Malmann-Trenn, F.
[see: Berenbrink, P.]
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
http://arxiv.org/pdf/1212.1724
Mancinska, L., Roberson, D. E., and Varvitsiotis., A.
Deciding the existence of perfect entangled strategies for nonlocal games
Chicago Journal of Theoretical Computer Science, to appear.
http://arxiv.org/pdf/1506.07429
Manlove, D. F.
The Hospitals/Residents problem. In: Encyclopedia of Algorithms (Ming Yang Kao,
ed.) 1-6. Springer 2015. ISBN 978-3-642-27848-8
Manlove, D. F., McBride, I. and Trimble, J.
Almost-stable" matchings in the Hospitals / Residents problem with Couples: An
Integer Programming approach. Preprint,
http://arxiv.org/pdf/1602.01956
Manlove D. F.
[see: Arulselvan, A., Biró, P., Cechlárová, K , Cseh, A., Goldberg, P. A., Irving, R.
W., Klaus, B. ]
Manners, F. J.
A solution to the pyjama problem. Invent. Math. 202 (2015) 239-270.
http://dx.doi.org/10.1007/s00222-014-0571-7
http://arxiv.org/pdf/1305.1514
Manners, F. J.
Finding a low-dimensional piece of a set of integers. Preprint.
http://arxiv.org/pdf/1512.06272
Manners, F. J.
[see: Eberhard, S.]
Manolescu, I.
[see: Duminil-Copin, H.]
Marchant, E.
[see: Falgas-Ravry, V.]
Marino, G.
[see: Cossidente, A.]
Markiewicz, A.
[see: Bailey, R. A.]
Markström, K.
[see: Lo, A.]
Marsh. R. J. and Scott, J. S.
Twists of Plücker Coordinates as Dimer Partition Functions. Communications in
Mathematical Physics 341 (2016) 821-864.
http://dx.doi.org/10.1007/s00220-015-2493-7
http://arxiv.org/pdf/1309.6630
Martin, B.
[see: Bodirsky, M., Carvalho, C., Chen,T.., Madeleine, F.]
Martin, J.
[see: Chen, T.]
Martin, K. M., Ng, S.-L. and Nyirenda, M.
A Combinatorial Model of Interference in Frequency Hopping Multiple Access.
Preprint.
http://arxiv.org/pdf/1508.02570
Martin, K. M.
[see: Laing, T. M.]
Martin, P. P.
[see: Baur, K..]
Martin, R. R.
[see: Goldwasser. J.]
Martin, R., R., Mycroft, R. and Skokan, J.
A multipartite Kühn-Osthus theorem. Preprint.
http://arxiv.org/pdf/1604.03002
Martinelli, F.
[see: Caputo, P.]
Martinez-Pérez, A.
[see: Bárány, I.]
Mathé, A.
[see: Doležal, M , Grabowski, Ŀ.]
Matoušek, J.
[see: Bárány, I.]
Matuschke, J.
[see: Arulselvan, A.]
Mavron, V. C.
[see: Key, J. D.]
Mayhew, D.
[see: Chun, C.]
Maynard, J.
[see: Ford, K.]
McBride, I.
[see: Cechlárová, K., Manlove, D. F.]
McCourt, T. A.
Growth rates of groups associated with face 2-coloured triangulations and directed
Eulerian digraphs on the sphere. Electron. J. Comb. 23 (2016) 1.51
http://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i1p51/pdf
McCourt, T. A. and Schroder, Z.
Self-embeddings of doubled affine Steiner triple systems. Preprint.
http://jzschroeder.com/assets/docs/DoubledAffine.pdf
McCourt, T. A. [see: Bevan Thompson,H.,, Donovan, D. M., Griggs, T. S., Jackson, B.]
McCreesh, C. and Prosser, P.
The Shape of the Search Tree for the Maximum Clique Problem, and the Implications
for Parallel Branch and Bound. ACM Transactions on Parallel Computing 2 (2015)
article 8.
http://dx.doi.org/10.1145/2742359
http://arxiv.org/pdf/1401.5921
McCreesh, C. and Prosser, P.
Finding Maximum k-Cliques Faster using Lazy Global Domination. Preprint.
http://arxiv.org/pdf/1408.6485
McCreesh, C. and Prosser, P.
A Parallel Branch and Bound Algorithm for the Maximum Labelled Clique Problem.
Optimisation Letters 9 (2015) 949-960.
http://dx.doi.org/10.1007/s11590-014-0837-4
http://arxiv.org/pdf/1407.7061
McCreesh, C. and Prosser, P.
A Parallel, Backjumping Subgraph Isomorphism Algorithm using Supplemental
Graphs. CP 2015.. Lect. Notes. Comput. Sci. 9255 (2015) 295-312
http://dx.doi.org/10.1007/978-3-319-23219-5_21
http://www.dcs.gla.ac.uk/~ciaran/papers/cp2015-subgraph-isomorphism.pdf
McCreesh, C., Prosser, P. and Trimble, J.
Heuristics and Really Hard Instances for Subgraph Isomorphism Problems.
IJCAI 2016, to appear.
http://www.dcs.gla.ac.uk/~ciaran/papers/ijcai2016-really-hard-sip.pdf
McCreesh, C.
[see: Kotthoff, L, MacDonald, C.]
McDermid, E.
[see: Edwards, K. J.]
McDiarmid, C. J. H., Scott, A. D. and Withers, P.
Uniform multicommodity flow in the hypercube with random edge capacities.
Random Struct. Algorithms, to appear.
http://arxiv.org/pdf/1406.4433
McDiarmid, C. J. H. and Yolov, N.
Recognition of Unipolar and Generalised Split Graphs. Algorithms 8 (2015) 46-59
http://dx.doi.org/10.3390/a8010046
http://www.mdpi.com/1999-4893/8/1/46/pdf
McDiarmid, C. J. H. and Yolov, N.
Hamilton cycles, minimum degree and bipartite holes. Preprint.
http://arxiv.org/pdf/1604.00888
McDiarmid, C. J. H. and Yolov, N.
Random Perfect Graphs. Preprint.
http://arxiv.org/pdf/1604.00890
McDiarmid, C. J. H.
[see: Addario-Berry, L., Atkins, R.. Iliopoulos, V.. Luczak, M. J.]
McDonald, M.,
[see: Bazzi, M.]
McDonough, T. P. and Pallikaros, C.
On double cosets with the trivial intersection property and Kazhdan-Lusztig cells in
𝑆𝑛., International Journal of Group Theory 4 (2015), 25–48.
http://www.theoryofgroups.ir/article_9795_1270.html
McDonough, T. P.
[see: Key, J. D.]
McDowell, A.
[see: Balister, P. N., Ellis-Monaghan, J. A.]
McGuinness, S.
[see: Brewster, R. C.]
McInroy, J. F. Vahlen groups over commutative rings, Math. Zeit, to appear.
http://arxiv.org/pdf/1506.05624
McInroy, J. F. and Shpectorov, S.
On Sidki's presentation for orthogonal groups, J. Algebra 434 (2015) 227-248.
http://dx.doi.org/10.1016/j.jalgebra.2015.02.031
http://arxiv.org/pdf/1410.1354
McKay, B. D. and Skerman, F.
Degree sequences of random digraphs and bipartite graph. J. Comb. 7 (2016). 21-49.
http://dx.doi.org/10.4310/JOC.2016.v7.n1.a2
McPhee, J. D.
[see: Dolinka, I.]
McQuillan, C.
[see: Chen, X.,. Göbel, A.]
Meeks, K.
Randomised enumeration of small witnesses using a decision oracle. Preprint.
http://arxiv.org/pdf/1509.05572
Meeks, K.
The challenges of unbounded treewidth in parameterised subgraph counting problems,
Discrete Appl. Math. 198 (2016) 170-194,
http://dx.doi.org/10.1016/j.dam.2015.06.019
http://arxiv.org/pdf/1402.5857
Meeks, K.
[see: Enright, J., Jerrum, M. R.]
Melekoğlu, A. and Singerman, D.
The structure of mirrors on regular maps on Platonic surfaces. Geom. Dedicata 161
(2016) 239-256.
http://dx.doi.org/10.1007/s10711-015-0122-4
http://arxiv.org/pdf/1501.04744
Meloni, S.
[see: Estrada, E.]
Menshikov, M.
[see: Georgiou, N.]
Mercas, R.
[see: Crochemore, M.]
Méroueh, A.
Lubell mass and induced partially ordered sets. Preprint.
http://arxiv.org/pdf/1506.07056
Méroueh, A
On forbidden submatrices. J. Comb. Theory Ser. A. 132 (2015) 1-3.
http://dx.doi.org/10.1016/j.jcta.2014.11.007
http://arxiv.org/pdf/1401.2102
Méroueh, A.
[see: Gruslys, V.]
Mertzios, G. B.
The recognition of simple-triangle graphs and of linear-interval orders is polynomial.
SIAM J. Discrete Math 29 (2015) 1150-1185
http://dx.doi.org/10.1137/140963108
http://arxiv.org/pdf/1210.4352
Mertzios, G. B., Michail, O. and Spirakis, P. G.
Temporal Network Optimization Subject to Connectivity Constraints . Preprint.
http://arxiv.org/pdf/1502.04382
Mertzios, G. B., Nikoletseas, S., Raptopoulos, C. and Spirakis, P. G.
Determining majority in networks with local interactions and very small local
memory. ICA:LP 2014.
http://community.dur.ac.uk/george.mertzios/papers/Conf/Conf_Majority-
Small_Memory.pdf
Mertzios, G. B., Shalom, M., Voloshin, A., Wong, P. W. H. and Zaks, S.
Optimizing Busy Time on Parallel Machines. Theor. Comput. Sci. 562, (2015)
524-541.
http://dx.doi.org/10.1016/j.tcs.2014.10.033
http://community.dur.ac.uk/george.mertzios/papers/Jour/Jour_Optimizing-Busy-
Time-Parallel-Machines.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 Zaks, S.
On the intersection of tolerance and cocomparability graphs. Discrete Appl. Math.,
199 (2016) 46-88
http://dx.doi.org/10.1016/j.dam.2014.10.025
http://community.dur.ac.uk/george.mertzios/papers/Jour/Jour_Intersection-
Conjecture.pdf
Mertzios, G. B.
[see: Akrida, E. C., Deligkas, A., Felsner, S., Foucaud, F., Giannopoulou, A. C.]
Meshkinfamfard, S.
[see: Berenbrink, P.]
Mesyan, Z. and Mitchell, J. D.
The Structure of a Graph Inverse Semigroup. Semigroup Forum, to appear. .
http://arxiv.org/pdf/1409.4380
Mészáros, S.
[see: Csóka, E.]
Meyerovitch., T., Perl, I., Tointon, M. and Yadin, A.
Polynomials and harmonic functions on discrete groups. Preprint.
http://arxiv.org/pdf/1505.01175
Michail, O. and Spirakis, P. G.
Simple and Efficient Local Codes for Distributed Stable Network
Construction. Distributed Computing, to appear.
http://arxiv.org/pdf/1309.6978
Michail, O.
[see: Mertzios, G. B.]
Mijaatović, A.
[see: Georgiou, N.]
Milanič, M.
[see: Hartinger, T. R.]
Miles, D..
[see: Duffy, K. R.]
Miller, A.
[see: Codish, M., Macdonald, C.]
Miller, G.
[see: Ene, A.]
Miller, M. [see: Buset, D., Daykin, J. W.]
Miloś, P.
[see: Kotecký, R.]
Minder, L, Sauerwald, T. and Wegner, S.-A.
Asymptotic bounds on the equilateral dimension of hypercubes. Graphs Comb. 31
(2015) 1629-1636.
http://dx.doi.org/10.1007/s00373-014-1473-6
http://arxiv.org/pdf/1408.5027
Mitchell, J. D.
[see: Araújo, J., Cameron, P. J., Dolinka, I., Hyde, J. T. Mesyan, Z.]
Mitsche, D. [see: Diaz, J.]
Mixer, M.
[see: Cameron, P. J.]
Mnich, M.
[see: Ene, A.]
Moci, L.
[see: Fink, A.]
Moffatt, I.
Ribbon graph minors and low-genus partial duals. Ann. Comb., 2016, 11 pages.
http://dx.doi.org/10.1007/s00026-016-0301-5
http://arxiv.org/pdf/1502.00269.pdf
Moffatt, I.
Exxcluded minors and the ribbon graphs of knots. J. Graph Theory 81 (2015)
329-341.
http://dx.doi.org/10.1002/jgt.21878
http://www.personal.rhul.ac.uk/uxah/001/papers/knotmi.pdf
Moffatt, I. and Mphako-Banda, E.
Handle slides for delta-matroids. Preprint.
http://arxiv.org/pdf/1510.07224v2
Moffatt, I. and Strömberg, J.
On the ribbon graphs of links in real projective space, Involve 9 (2016) 133-153.
http://dx.doi.org/10.2140/involve.2016.9.133
http://arxiv.org/pdf/1502.02025.pdf
Moffatt, I.
[see: Chun, C., Ellis-Monaghan, J. A., Krajewski, T.]
Mohammed, M.
[see: Brankovic, L., Crochemore, M.]
Molla, T.
[see: DeBiasio, L. ]
Mönch, C.
[see: Dereich, S.]
Monnot, J.
[see: Lozin, V. V.]
Montejano, I.
[see: Bárány, I.]
Montemanni, R.
[see: Barta, J.]
Montgomery, R.
Fractional Clique Decompositions of Dense Partite Graphs. Preprint.
http://arxiv.org/pdf/1603.01039
Montgomery, R.
[see: Barber, B., Glock. S.]
Moore, B.
[see: Brewster, R. C.]
Moosa, R.
[see: Bell, J.]
Moreno, Y.
[see: Estrada, E.]
Morgan, L. and Roney-Dougal, C. M.
A note on the probability of generating alternating or symmetric groups. Arch. Math.
105 (2015) 201-204.
http://dx.doi.org/10.1007/s00013-015-0796-8
http://arxiv.org/pdf/1507.00854
Morris, R. D.
[see: Ahlberg, D., Allen, P., Balogh, J., Bollobás, B., Bushaw, N., Fiz Pontiveros, G.]
Morrison, N. and Noel, J. A.
Extremal bounds for bootstrap percolation in the hypercube. Preprint.
http://people.maths.ox.ac.uk/morrison/bootstrap.pdf
Morrison, N., Noel, J. A. and Scott, A. D.
Saturation in the Hypercube and Bootstrap Percolation. Combin. Probab. Comput.,. to
appear.
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. Preprint.
http://people.maths.ox.ac.uk/morrison/induced.pdf
Morrison, N.
[see: Gunderson, K.]
Mörters, P.
[see: Dereich, S., Jacob, E.]
Mosca, R.
[see: Lozin, V. V.] Mottet, A.
[see: Bodirsky, M.]
Moulton, V.
[see: Bastowski, S., Huber, K. T.]
Mourtos, I.
[see: Cechlárová, K.]
Mousset, F.
[see: Balogh, J.]
Mphako-Banda, E.
[see: Moffatt, I.]
Mrazović, R.
[see: Eberhard, S.]
Mubayi, D.
[see: Balogh, J.. Lenz, J.]
Muciaccia, G.
[see: Crowston, R.]
Müller, H.
[see: Abu Khzam, F. N., Dyer, M. E.]
Müller, T. W.
[see: Krattenhaler, C.]
Müller-Hannemann, M.
[see: Hart, S. B.]
Münch, F.
[see: Liu, S.]
Murphy, B..
[see: Aksoy Yazici, E.,]
Murthy, S.
[see: Hart, S. B.]
Muthukrishnan, S.
[see: Apostolico, A.]
Mycroft, R.
Packing k-partite k-uniform hypergraphs. J. Comb. Theory Ser. A, 138 (2016)
60-132
http://dx.doi.org/10.1016/j.jcta.2015.09.007
http://arxiv.org/pdf/1402.5643
Mycroft, R. [see: Garbe, F., Keevash, P., Lenz, J., Martin, R., R.]
Nagel, L.
[see: Berenbrink, P.]
Nailk, S.
[see: Duffy, K. R.]
Naor, A.
[see: Hefetz, D.]
Narayanan, B. P., Sahasrabudhe, J. and Tomon, I.
The multiplication table problem for bipartite graphs. Combinatorica, to appear.
https://www.dpmms.cam.ac.uk/~bp338/pdf/bipartite_mult.pdf
Narayanan, B. P.
[see: Balogh, J., Bollobás, B., Kittipasorn, T.]
Naserasr, R.
[see: Foucaud, F.]
Navaridas, J.
[see: Erickson, A., Kiasari, A.]
Nazarov, M. and Sklyanin, E.
Lax operator for Macdonald symmetric functions. Letters in Mathematical Physics
105 (2015) 901-916
http://dx.doi.org/10.1007/s11005-015-0770-1
http://arxiv.org/pdf/1411.1315.pdf
Nedela, R.
[see: Conder, M. E, Jones, G. A.]
Niedermeier, R.
[see: Giannopoulou, A. C., Hartung, S.]
Nenadov, R.
[see: Conlon, D.]
Nevo, A.
[see: Bauer, D.]
Ng, S.-L. and Owen, S.
A note on an upper bound of traceability codes. Australas. J. Comb. 62 (2015)
140-146.
http://ajc.maths.uq.edu.au/pdf/62/ajc_v62_p140.pdf
Ng, S.-L. and Paterson, M. B.
Disjoint difference families and their applications. Des. Codes Cryptography 78 (2016)
103-127.
http://arxiv.org/pdf/1509.05255
Ng, S.-L.
[see: Martin, K. M.]
Nguyen, V. H.
[see: Joos, F.]
Nichterlein, A.
[see: Bazgan, C.., Froese, A., Hartung, S.]
Nickson, T. and Potapov, I.
Broadcasting Automata and Patterns on 𝑍2 In: Volume 12 of the series Emergence,
Complexity and Computation. 297-340.
http://dx.doi.org/10.1007/978-3-319-09039-9_14
http://arxiv.org/pdf/1411.4796
Niedermeier, R.
[see: Froese, A.]
Nightingale, P.
[see: Gent, I. P.]
Nikandish, R.
[see: Aalipour, G.]
Nikoletseas, S., Panagopoulou, P., Raptopoulos, C., Spirakis, P. G.
On the Structure of Equilibria in Basic Network Formation. Theor, Comput. Sci. 590
(2015) 96-105.
http://dx.doi.org/10.1016/j.tcs/2015.03.029
http://arxiv.org/pdf/1306.1677
Nikoletseas, S.
[see: Andreou, M. I., Mertzios, G. B.]
Nixon, A., Schulze, B., Tanigawa, S.-I. and Whiteley, W.
Rigidity of frameworks on expanding spheres. Geom. Dedicata., to appear.
http://arxiv.org/pdf/1501.01391
Nixon, A., Ross, E., Sadjadji, M., Servatius, B., Theran, L and Thorpe, M. F.
Anchored boundary conditions for locally isostatic networks, Physical Review E 92
(2015) 053306
http://dx.doi.org/10.1103/PhysRevE.92.053306
http://arxiv.org/pdf/1508.00666
Nixon, A.
[see: Gill, N., Jackson, B.]
Noble, S. D.
[see: Chun, C.]
Noel, J. A, Reed, B. A. and Wu, H.
A Proof of a Conjecture of Ohba.. J. Graph Theory 79 (2) (2015) 86--102.
http://dx.doi.org/10.1002/jgt.21819
http://people.maths.ox.ac.uk/noel/Ohba%20Paper.pdf
Noel, J. A.
[see: Brewster, R. C., Cooper, J. W., Dvořák, Z., Morrison, N.]
Norin, S.
[see: Csóka, E., Hladký, J.]
Norris, J. R., Peres, Y. and Zhai, A.
Surprise probabilities in Markov chains. SODA 2015: 1759-1773
http://dx.doi.org/10.1137/1.9781611973730.118
http://arxiv.org/pdf/1408.0822
Norris, J. R.
[see: Grimmett, G. R.]
Nugent, P.
[see: Bevan, D.]
Nyirenda, M.
[see: Martin, K. M.]
O,, S.
[see: Choi, I., Jahanbekan, S.]
Obdržálek, J.
[see: Gajarský, J., Ganian, R.]
Ocel’akova, E.
[see: Cechlárová, K.]
Ochem, P.
[see: Badkobeh, G.]
O’Connell, N. and Ortmann, J.
Tracy-Widom asymptotics for a random polymer model with gamma-distributed
weights. Electron J. Probab. 20 (2015) 1-18.
http://dx.doi.org/10.1214/EJP.v20-3787
http://ejp.ejpecp.org/article/view/3787
Offner, D.
[see: Goldwasser. J.]
Oliveros, D.
[see: Bárány, I.]
Olver, N.
[see: Amini, O.]
Oneto, A.
[see: Akhtar, M.]
Opršal J.
[see: Donovan, D. M.]
Ossona de Mendez, P.
[see: van den Heuvel, J.]
Osthus, D. [see: Barber, B.,. Csaba, B., DeBiasio, L., Glock, S., Kim, J., Kühn, D.]
Ordyniak, S.
[see: Gajarský, J.]
Ortmann, J.
[see: O’Connell, N.]
Oukanine, J., Pouly, A., Sousa-Pinto, J. and Worrell, J.
Solvability of Matrix-Exponential Equations. Preprint.
http://arxiv.org/pdf/1601.05002
Owen, J. C.
[see: Jackson, B.]
Owen, S.
[see: Ng, S.-L.}
Oxley, J. G.
[see: Chun, C.]
Özkan, S.
[see: Goldwasser, J. L,]
Pach, J. and Swanepoel, K. J.
Double-normal pairs in the plane and on the sphere. Beiträge zur Algebra und
Geometrie,56 (2015) 423-438
http://dx.doi.org/10.1007/s13366-014-0211-9
http://arxiv.org/pdf/1404.2624
Pachocki, J.
[see: Ene, A.]
Paget, R. E. and Wildon, M. R.
Minimal and maximal constituents of twisted Foulkes characters. J. Lond. Math. Soc.
93 (2016) 301-318.
http://doi.org/10.1112/jlms/jdv070
http://arxiv.org/pdf/1409.6879.pdf
Pallikaros, C.
[see: McDonough, T. P. }
Palmowski, K. F.,
[see: Hogben, L.]
Panagiotou, K.
[see: Fountoulakis, N.]
Pangborn, G.
[see: Ellis-Monaghan, J. A.]
Pantone, J.
[see: Bevan, D.]
Parreau, A.
[see: Foucaud, F.]
Patel, V.
[see: Bordewich, M., Choromanski, K., Gutin, G.,. Hladký, J., Johnson, M., Kang, R.
J., Kühn, D., Lo, A.]
Paterson, M. B. and Stinson, D. R.
Optimal constructions for ID-based one-way-function key predistribution schemes
realizing specified communication graphs. J. Math. Cryptol. 9 (2015) 215-225.
http://dx.doi.org/10.1515/jmc-2014-0031
http://arxiv.org/pdf/1403.1468
Paterson, M. B. and Stinson, D. R.
Combinatorial Characterizations of Algebraic Manipulation Detection Codes
Involving Generalized Difference Families. Preprint.
http://arxiv.org/pdf/1506.02711
Paterson, M. B., Stinson, D. R. and Wang, Y.
On encoding symbol degrees of array BP-XOR codes. Cryptography and
Communications - Discrete Structures, Boolean Functions and Sequences, 8 (2016):
19-32.
http://dx.doi.org/10.1007/s12095-015-0134-9
http://www.bbk.ac.uk/ems/faculty/paterson/publications/bpxorpreprint.pdf
Paterson, M. B.
[see: Laing, T.]
Pattni, K.
[see: Broom, M.]
Paulsen, V. I., Severini, S., Stahlke, D., Todorov, I. G. and Winter, A.
Estimating quantum chromatic numbers. J. Funct. Anal. 270 (2016) 2188-2222.
http://dx.doi.org/10.1016/j.jfa.2016.01.010
http://arxiv.org/pdf/1407.6918
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, to appear.
Paulusma, D., Slivovsky, F. and Szeider, S.
Model counting for CNF formulas of bounded modular treewidth. Algorithmica, to
appear.
https://community.dur.ac.uk/daniel.paulusma/Papers/Submitted/mtw.pdf
Paulusma, D.
[see: Biró, P., Brandstädt, A , Broersma, H. J., Chaplick, S., Cochefort, M.,
Dąbrowski, K. K., Diner, O., Golovach, P. A., Hartinger, T. R., Huang, S., Johnson,
M., Kamiński, M. ]
Peng, P.
[see: Czumaj, A.]
Penman, D. B.
[see: Iliopoulos, V.]
Penrose, M. D.
Inhomogeneous random graphs, isolated vertices, and Poisson approximation.
Preprint.
http://arxiv.org/pdf/1507.07132
Penrose, M. D.
Connectivity of soft random geometric graphs. Ann Appl;. Probab 26 (2016)
986-1028
http://dx.doi.org/10.1214/15-AAP1110
http://arxiv.org/pdf/1311.3897
Penrose, M. D.
The strong giant in a random digraph. J. Appl. Probab. 53 (2016) 67-70.
http://dx.doi.org/10.1017/jpr2015.8
http://arxiv.org/pdf/1409.4371
Penso, L. D. [see: Duarte, M. A.]
Perarnau, G.
[see: Addario-Berry., L., Bousquet, N., Chapuy, G., Diaz, J., Foucaud, F., Joos, F.]
Peres, Y. and Sousi, P.
Total variation cutoff in a tree. Annales de la Faculte des Sciences de Toulouse., to
appear.
http://www.statslab.cam.ac.uk/~ps422/tree-cutoff.pdf
Peres, Y.
[see: Boczkowski, L. Norris, J. R.]
Péresse, Y. H.
[see: Hyde, J. T.]
Pérez-Gimenez, X.
[see: Diaz, J.,. Panagiotou, K.]
Pérez-Rosés, H.
[see; Buset, D.]
Perkins, S.
[see: Hunt, F. H., Jones, S. K.]
Perkins, W.
Birthday Inequalities, Repulsion, and Hard Spheres. Proc. Amer. Math. Soc., to
appear.
http://willperkins.org/BirthdayRepulsionHardSpheres.pdf
Perkins, W.
[see: Cohen, E.,. Coja-Oghlan, A.. Davies, E.., Feldman, V., Florescu, L. ]
Perl, I.,
[see: Meyerovitch., T.]
Person, Y.
[see: Allen, P., Fox, J.]
Petracci, A.
[see: Akhtar, M.]
Peyerimhoff, N.
[see: Lange, C.. Liu, S.]
Pfeiffer, M.
[see: Awang, J.]
Pfender, F.
[see: Balogh, J..]
Pichanick, E. V. D.
[see: Hirschfeld, J. W. P. ]
Picoleau, C.
[see: Diner, O., Paulusma, D. ]
Piguet, D.
[see: Allen, P., Böttcher, J., Hladký, J..]
Pikhurko, O. and Razbarov, A. A.
Asymptotic structure of graphs with the minimum number of triangles. Combin.
Probab. Comput., to appear.
http://arxiv.org/pdf/1204.2846
Pikhurko, O.
The maximal length of a gap between r-graph Turán densities.Electron J. Comb. 22
(2015) P4.15
http://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i4p15/pdf
Pikhurko, O.
[see: Czumaj. A.. DeCorte, E., Falgas-Ravry, V., Grabowski, Ŀ., Liu, H..]
Pilipczuk, M.
[see: Choromanski, K., Ene, A.]
Pinsker, M.
[see: Bodirsky, M.]
Pinto, T. A.
The proofs of two directed paths conjectures of Bollobás and Leader. Preprint.
http://arxiv.org/pdf/1504.07079.pdf
Pissis S. P.,
[see; Barton, C., Brankovic, L,, Crochemore, M.]
Pittel, B. and Sorkin, G. B.
The satisfiability threshold for 𝑘-XORSAT. Combin. Probab. Comput., 25 (2015)
236-268.
http://dx.doi.org/10.1017/S0963548315000097
http://arxiv.org/pdf/1212.1905
Poettering, B.
[see: Crampton, J.]
Pokrovskiy, A.
A linear bound on the Manickam, Miklós and Singhi Conjecture. J. Comb. Theory
Ser. A. 133 (2015) 280-306.
http://dx.doi.org/10.1016/j.jcta.2015.01.007
http://arxiv.org/pdf/1308.2176
Pokrovskiy, A.
Calculating Ramsey numbers by partitioning coloured graphs. J. Graph Theory, to
appear. .
http://arxiv.org/pdf/1309.3952v1
Pongrácz, A.
[see: Bodirsky, M.]
Pór, A.
[see: Bárány, I.]
Porta, E.
[see: Clifford, R.]
Porter, M. A.
[see: Bazzi, M.., Cucuringu, J., Kivelä, M. ]
Post, O.
[see: Lange, C.]
Potapov, I.
[see: Avgustinovich, S.. Halava, V. C., Nickson, T.]
Potpinkova, E.
[see: Cechlárová, K.]
Pouly, A.
[see: Oukanine, J.]
Power, S. C. and Schulze, B.
String-node nets and meshes. Preprint.
http://arxiv.org/pdf/1601.04539
Power, S. C. and Schulze, B.
Elementary proofs of Kempe universality. Preprint.
http://arxiv.org/pdf/1511.09002
Power, S. C.
[see: Cruickshank, J.,. Kitson, D., Nixon, A.]
Praeger, C. E.
[see: Akbari, M., Cameron, P. J., Gill, N., Gillespie, N. I.]
Prałat, P.
[see: Bal, D.]
Prellberg, T.
[see: Haug, N.,]
Prendiville, S.
Four variations of the Fourier-analytic transference principle. Preprint.
http://arxiv.org/pdf/1509.09200v1
Prendiville, S.
[see: Browing, T. D. ]
Prince, T.
[see: Akhtar, M.]
Proskurowski, A.
[see: Broersma, H. J.]
Prosser, P. and Unsworth, C.
An n-ary Constraint for the Stable Marriage Problem, In IJCAI 2015.
http://arxiv.org/pdf/1308.0183
Prosser, P.
[see: Macdonald, C.. McCreesh, C.,]
Przykucki, M.
[see: Balister, P. N., Bollobás, B. , Gunderson, K.]
Psomas, C.
[see: Archdeacon, D. S.]
Pudwell, L
[see: Bevan, D.]
Puljiz, M.
[see: Haslegrave, J. ]
Purcell, C. and Rombach, M. P.
On the complexity of role colouring planar graphs, trees and cograph. J. Discrete
Algorithms 35 (2015) 1-8.
http://dx.doi.org/10.1016/j.jda.2015.08.001
http://arxiv.org/pdf/1408.5412
Pyatkin, A.
[see: Halldórsson, M. M., Jones, M.]
Quick, M. R.
[see: Bleak, C., Dolinka, I.]
Quiroz, D..
[see: van den Heuvel, J.]
Rabago, F. T. J.
[see: Larcombe, P. J.]
Rabinovich, R.
[see: van den Heuvel, J.]
Radin, C.
[see: Kenyon, R.]
Radoja, M.
[see: Erlebach, T.]
Radoszewski, J.
[see: Crochemore, M.]
Radovanovic, M.
[see: Diot, E.]
Radzik, T.
[see: Cooper, C.]
Rahman, M. R.
[see: Bocus, M. Z.]
Rahman, M. S.
[see: Alatabbi, A.]
Rainmondi, F.
[see: Chen, T.]
Rajchgot, J.
[see: Fink, A.]
Rajkumar, R.
[see: Devi, P.]
Ramirez, J.
[see: Barrantes, D.]
Randall, D.
[see: Galvin, D.]
Rao, M.
[see: Badkobeh, G.]
Rastegari, B. [see: Cechlárová, K., Goldberg, P. A..]
Rautenbach, D. [see: Duarte, M. A., Eckert, J., Joos, F.]
Razbarov, A. A.
[see: Pikhurko, O.]
Razgon, I.
[see: Lozin, V. V.]
Reed, B. A.
[see: Joos, F., Noel, J. A,.]
Rees, S. E.
[see: Ciobanu, L., Holt, D. F.]
Regts, G.
[see: Kang, R. J.]
Remmel, J.
[see: Jones, M., Kitaev, S.]
Retha, A.
[see; Barton, C.]
Richard, A.
[see: Fauchon, A., Gadouleau, M.]
Richerby, D.
[see: Chen, X., Diaz, J., Galanis, A., Göbel, A.,]
Riehl, M.
[see: Bevan, D.]
Ries, B.
[see: Diner, O., Hertz, A. Lozin, V. V., Paulusma, D.]
Riis, S.
[see: Cameron, P. J., Gadouleau, M.]
Rincón, E. F.
[see: Ardila, F.]
Rino Nesin, G. A. and Thomas, R. M.
Groups whose word problem is a Petri net language, Descriptive Complexity of
Formal Systems, Lect. Notes Comput. Sci., 9118 (2015) 243-255.
http://dx.doi.org/10.1007/978-3-319-19225-3_21
Riordan, O. M. and Warnke, L.
Convergence of Achlioptas Processes via Differential Equations with Unique
Solutions. Combin. Probab. Comput. 25 (2015) 154-171
http://dx.doi.org/10.1017/S0963548315000218
http://arxiv.org/pdf/1111.6179
Riordan, O. M. and Warnke, L.
The evolution of subcritical Achlioptas processes. Random Struct. Algorithms 47
(2015) 174-203.
http://dx.doi.org/10.1002/rsa.20530
http://arxiv.org/pdf/1204.5068
Riordan, O. M.
[see: Bollobás, B., Heckel, A.]
Risteski, A.
[see: Ene, A.]
Rivera, N.
[see: Cooper, C.,]
Roberson, D. E.
Homomorphisms of Strongly Regular Graphs. Submitted.
http://arxiv.org/pdf/1601.00969
Roberson, D. E.
Conic Formulations of Graph Homomorphisms. . J. Algebr.Comb. 43 (2016)
877-913.
http://dx.doi.org/10.1007/s10801-016-0665-y Roberson, D. E.
[see: Acin, A., Godsil, C. D., Hogben, L.,. Mancinska, L.]
Roberts, B.
[see: Allen, P., Davies, E.]
Roberts, K.
[see: Cuypers, H.]
Roberts, M. I.
[see: Candellero, E.]
Robshaw, M. J. B.
[see: Blackburn, S. R.]
Roche-Newton, O., Rudnev, M. and Shkredov, I.
New sum-product type estimates over finite fields. Adv. Math. 286 (2016)
http://arxiv.org/pdf/1408.0542
Roche-Newton, O.
[see: Balog, A., Iosevich, A.]
Rockmore, D. N.
[see: Bailey, R. A.]
Rödl, V. [see: Conlon. D.,. Dellamonica, D.]
Rolinek, M.
[see: Kolmogorov, V.]
Rolla, L.
[see: Bollobás, B.,]
Rombach, M. P
[see: Atkins, R.. Cucuringu, J., Purcell, C.]
Roney-Dougal, C. M.
[see: Morgan, L.]
Rooney, B.
[see: Godsil, C. D.]
Ross, E.
[see: Nixon, A.]
Rossi, F.
[see: Giandomenico, M., Klaus, B.]
Rotenberg, E.
[see: Alstrup,, S.,]
Rousseau, J. and Todd, M.
Hitting times and periodicity in random dynamics. J. Stat. Phys. 161 (2015) 131–150.
http://dx.doi.org/10.1007/s10955-015-1325-7
http://arxiv.org/pdf/1503.06867
Rowley, C.
[see: Bailey, R. A.]
Rowley, P. J.
[see: Hart, S. B.]
Rowlinson, P.
Eigenvalue multiplicity in triangle-free graphs, Linear Algebra Appl. 493 (2016)
184-193.
http://dx.doi.org/10.1016/j.laa.2015.12.012
Rowlinson, P.
[see: Cvetković, D. M.]
Royle, G. F. and Sokal, A. D.
Linear Bound in Terms of Maxmaxflow for the Chromatic Roots of Series-Parallel
Graphs. SIAM J. Discrete Math. 29 (2015), 2117–2159
http://dx.doi.org/10.1137/130930133
http://arxiv.org/pdf/1307.1721
Rubey, M. and Westbury, B. W.
Combinatorics of symplectic invariant tensors. FPSAC2015, to appear.
http://fpsac2015.sciencesconf.org/70994/document .
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.
Preprint.
http://de.arxiv.org/pdf/1412.2909.pdf
Rudnev, M.
[see: Aksoy Yazici, E., Gill, N., Iosevich, A. Roche-Newton, O.]
Rueckriemen, R. D.
[see; Chun, C.]
Ruškuc, N.
[see: Albert, M. H., Awang, J.,. Gould, V., Huczynska, S.,]
Rutherford, C. G.
[see: Affif Chauouche, F., Banaji, M.]
Rychtář, J.
[see: Broom, M.]
Rytter, W.
[see: Crochemore, M.]
Saad, A. and Wolf, J.
Ramsey multiplicity of linear patterns in certain finite abelian groups. Q. J. Math., to
appear.
http://www.juliawolf.org/research/preprints/burrrostaweb.pdf
Sach, B.
[see: Clifford, R., Gawrychowski, P.,]
Sadjadji, M.
[see: Nixon, A.]
Sahasrabudhe, J.
[see: Bollobás, B., Narayanan, B. P.]
Sainz, A. B.
[see: Acín, A.]
Salgado, E.
[see: Cohen-Addad, V.,]
Šámal, R.
[see: Godsil, C. D.]
Samiruzzaman, M. [see: Aashikur Rahman Azim, M..]
Samotij, W. and Sudakov, B.
On the number of monotone sequences. J. Comb. Theory Ser. B. 115 (2015) 132-163.
http://dx.doi.org/10.1016/j.jctb.2015.05.008
http://www.math.tau.ac.il/~samotij/papers/monotone-sequences.pdf
Samotij, W.
[see: Balogh, J., Dellamonica, D.]
Sanchez, O. L.
[see: Bell, J.]
Sanders, T.
[see: Green, B. J.]
Sanitt, A. and Talbot, J. M.
An exact Turán result for tripartite 3-graphs. Electron J. Comb. 22 (2-16) P4.3
http://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i4p3/pdf
Sauerwald, T.
[see: Minder, L.]
Savani, R. and von Stengel, B.
Unit vector games. International Journal of Economic Theory 12,(2016) 7-27.
http://dx.doi.org/10.1111/ijet.12077
http://arxiv.org/pdf/1501.02243
Savani, R.
[see: Fearnley, J. ]
Saxl, J.
[see: Liebeck, M. W.]
Saxton, D. and Thomason, A. G.
Simple containers for simple hypergraphs Combin. Probab. Comput. 25 (2016)
448-459.
http://dx.doi.org/10.1017/S096354831500022X
http://arxiv.org/pdf/1402.5400
Saxton, D.
[see: Fiz Pontiveros, G.]
Scarlett, J. [see: Aldridge, M.]
Schacht, M.
[see: Conlon, D.]
Schaefer, A.
[see; Araújo, J.]
Schaudt, O.
[see: Bruhn, H.]
Schillewaert, J. and Struyve, K. A characterization of d-uple Veronese varieties. Comptes Reuds. Math.,353 (2015)
333-338.
http://dx.doi.org/10.1016/j.crma.2015.01.002
http://www.jeroenschillewaert.com/incs/SchilStruy-CRmathNovember.pdf
Schmeichel, E.
[see: Bauer, D.]
Schols, G. E.
[see: Gambette, P.]
Schouhamer Immink, K. A. [see: Blackburn, S. R.]
Schroeder, J. Z.
[see: Grannell, M. J.]
Schroder, Z.
[see: McCourt, T. A.]
Schroll, S.
Trivial extensions of gentle algebras and Brauer graph algebras, J. Algebra 444 (2015)
183-200.
http://dx.doi.org/10.1016/j.jalgebra.2015.07.037
Schroll, S.
[see: Green, E. L.]
Schulze, B. and Tamigawa, S.
Infinitesimal rigidity of symmetric bar-joint frameworks, SIAM J. Discrete Math. 29
(2015) 1259-1286.
http://dx.doi.org/10.1137/130947192
http://arxiv.org/pdf/1308.6380
Schulze, B.
[see: Fowler, P., Kaszanitzky, V., Kitson, D., Nixon, A., Power, S. C.]
Schwartz, J. [see: Ganian, R.]
Scott, A. D. and Seymour, P. D.
Induced subgraphs of graphs with large chromatic number. I. Odd holes, J. Comb.
Theory Ser B.,to appear
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. IV. Consecutive holes.
Preprint.
https://people.maths.ox.ac.uk/scott/Papers/consecutive.pdf
Scott, A. D.
[see: Bollobás, B, Chudnovsky, M., Jeavons, P.., McDiarmid, C. J. H.,. Meeks, K.,
Morrison, N.]
Scott, J. S.
[see: Marsh, R. J.]
Scott, S.
[see: Blackburn, S. R.]
Selig, J. M.
[see; Rudnev, M.]
Selig, T.
[see: Dukes, W. M. B.]
Sellwood. A.
[see: Crampton, J.,]
Semeraro, J.
[see: Gill, N., Gunderson,, K.]
Semple, C.
[see: Bordewich, M.]
Serna, M. [see: Diaz, J.]
Servatius, B.
[see: Jackson, B., Nixon, A. ]
Servatius, H.
[see: Jackson, B.]
Severini, S.
[see: Dawar, A. Duan, R., Hogben, L., Paulsen, V. I.,]
Seymour, P. D.
[see: Chudnovsky, M., Edwards, K.. Scott, A.. D.]
Shalom, M. , Wong, P. W. H. and Zaks, S.
On-line maximum matching in complete multi-partite graphs with an application to
optical networks. Discrete Appl. Math. 199 (2016) 123-136
http://dx.doi.org/10.1016/j.dam.2014.10.040
Shalom, M.
[see: Mertzios, G. B.]
Sharifzadeh, M.
[see: Balogh, J.]
Shaveisi, F.
[see: Aalipour, G.]
Sheehan, J.
[see: Abreu, M.]
Sheerin, M.
[see: Estrada, E.]
Sheng, B.
[see: Barbero, F., Gutin, G.]
Shkredov, I. D. [see: Aksoy Yazici, E. Roche-Newton, O]
Shparlinski, I. E.
[see: Blackburn, S. R.,Roche-Newton, O.]
Shpectorov, S.
[see: McInroy, J. F., Cuypers, H.]
Shpilrain, V.
[see: Bromberg, L.]
Sidford, A.
[see: Ene, A.]
Siebertz, S.
[see: van den Heuvel, J.]
Silver, L J.
[see: Broom, M.]
Simić, S.
[see: Cvetković, D. M.]
Simonovits, M.
[see: Balogh, J.. Hladký, J.]
Simpson, J.
[see: Alatabbi, A.]
Sinclair, A.
[see: Caputo, P.]
Sing, C. T. S.
[see: Irving, R. W.]
Singerman, D.
[see: Melekoğlu, A.]
Širáň, J.
[see: Conder, M. E..]
Skerman, F.
[see: Atkins, R., McKay,B. D.]
Sklyanin, E. K.
[see: Nazarov, M. L.]
Skokan, J.
[see: Balogh, J.. Fiz Pontiveros, G., Martin, R. R.]
Škorić, R.
[see: Conlon, D.]
Skubch, K.
[see: Coja-Oghlan, A..]
Slivovsky, F.
[see: Paulusma, D.]
Sly, A.
[see: Berestycki, N.]
Smith, D. H.
[see: Barta, J., Hunt, F. H.]
Smith, P.
[see: Balister, P. N., Bollobás, B., Bushaw, N.]
Smriglio, S.
[see: Giandomenico, M.]
Smyth, W. F.
[see: Alatabbi, A.]
Snashall, N.
[see; Green, E. L.]
Sohel Rahmanm, M. [see: Aashikur Rahman Azim, M..]
Sohidull Islam, A. S.
[see: Alatabbi, A.]
Sohler, C.
[see: Czumaj, A.]
Sokal, A. D.
[see: Scott, A. D.]
Solnon, C.
[see: Kotthoff, L]
Song, J.
[see: Golovach, P. A.]
Sorkin, G. B.
[see: Galvin, D., Gaspers, S., Pittel, B..]
Sousa, T.
[see: Liu, H.]
Sousa-Pinto, J.
[see: Oukanine, J.]
Sousi, P.
[see: Boczkowski, L. Peres, Y. ]
Souza, U. [see: Duarte, M. A.]
Speyer, L.
[see: Fayers, M.]
Spiga, P.
[see; Cameron, P. J.]
Spillner, A.
[see: Bastowski, S.]
Spirakis, P. G.
[see: Akrida, E. C., Andreou, M. I.. Deligkas, A., Mertzios, G. B., Michail, O..]
Stacho, J.
[see: Brignall, R., Madeleine, F. R.]
Staden, K. and Treglown, A.
On a degree sequence analogue of Pósa's conjecture. Electron Notes Discrete Math.49
(2015) 233-241.
http://dx.doi.org/10.1016/j.endm.2015.06.033
Staden, K.
[see: Kühn, D., Osthus, D.]
Stadler, P. F.
[see: Gu, J.]
Stahlke, D.
[see: Paulsen, V. L.]
Stanovkský, D.
[see: Donovan, D. M.]
Starchenko, S. [see: Aschenbrenner M.]
Starikovskaya, T.
[see: Clifford, R., Gawrychowski, P.]
Stark, D. S.
[see: Granovsky, B.]
Stauffer, A. and Taggi, L.
Critical density of activated random walks on 𝑍𝑑and general graphs. Preprint.
http://arxiv.org/pdf/1512.02397
Stauffer, A. [see: Caputo, P.]
Steel, M.
[see: Huber, K. T.]
Štefankovič, D.
[see: Bezakova, I., Cai, J.-Y, Galanis, A.]
Steger, A.
[see: Gerke, S..]
Stein, M. J.
[see: Conlon, D., Hladký, J..]
Steinberg, B.
[see: Araújo, J..]
Steinhorn, C.
[see: Garcia, D.]
Stewart, A.
[see: Golovach, P. A., Johnson, M., Kamiński, M.,]
Stewart, I. A.
On the mathematics of data centre network topologies. Preprint.15
https://community.dur.ac.uk/i.a.stewart/Papers/MathsOfDCNTops
Stewart, I. A.
[see: Erickson, A., Golovach, P. A., Kiasari, A., Kuo, C-N.]
Stewart, L.
[see: Enright, J.]
Stinson, D. R.
[see: Laing, T., Paterson, M. B.]
Stojakovic, M.
[see: Hefetz, D.]
Stokes K. [see: Griggs, T. S.]
Strauss, D.
[see: Barber, B., Hindman, N.]
Strömberg, J.
[see: Moffatt, I.]
Struyve, K.
[see: Schillewaert, J.]
Sturmfels, B.
15
An extended abstract appeared in FCT'15, Lect. Notes Comput. Sci. 9210 (2015) 283-295.
http://dx.doi.org/10.1007/978-3-319-22177-9_22
[see: Maclagan, D.]
Suchy, O.
[see: Hartung, S.]
Sudakov, B.
[see: Conlon, D., Keevash, P.,. Samotj, W.]
Suh, G.
[see; Kang, D. Y.]
Sule Yazici, E. [see: Bevan Thompson,H.,]
Sullivant, S.
[see: Fink, A.]
Sun, B. Y.
[see: Chen, T. Z. Q.]
Swanepoel, K. J.
Sets of unit vectors with small subset sums. Trans Am. Math. Soc., 368 (2016)
7153–7188
http://dx.doi.org/10.1090/tran/6601
http://arxiv.org/pdf/1210.0366
Swanepoel, K. J.
[see: Pach, J.]
Szabó, T.
[see: Glebov, R.]
Szeider, S.
[see: Paulusma, D.]
Szemerédi, E.
[see: Hladký, J.]
Szrewder, B.
[see: Crochemore,. M.]
Taggi, L.
[see: Stauffer, A.]
Taillefer, R.
[see; Green, E. L.]
Talbot, J. M.
[see: Goldwasser, J.,. Samitt, A.]
Talgam-Cohen, I.
[see: Englert, M.]
Talwar, K.
[see: Englert, M.]
Tamigawa, S.
[see: Schulze, B.]
Tan, T.-S.
[see: Leader, I. B.]
Tan, W.-E.
[see: Hefetz, D.]
Tanasa, S.
[see: Krajewski, T.]
Tanigawa, S. [see: Jackson, B., Nixon, A.]
Tao, T. C.
[see: Ford, K..]
Taraz, A.
[see: Böttcher, J..]
Taylor, A.
[see: Barber, B.,. DeBiasio, L., Kühn, D.]
Teixero, A.
[see: Candellero, E.]
Tenner, B. E.
[see: Claesson, A.]
Terada, I.
[see: Azenhas, O.]
Tesar, M.
[see: Chaplick, S.]
Teska, J.
[see: Ganian, R.]
Tession, V.
[see: Ahlberg, D.]
Tetali, P.
[see: Cohen, E.]
Thapper, J. and Živny, S.
Sherali-Adams Relaxations for Valued CSPs. Lect. Notes. Comput. Sci. 9134 (2015)
1058-1069.
http://dx.doi.org/10.1007/978-3-662-47672-7_86
Thapper, J. [see: Kolmogorov, V.]
Theran, L.
[see: Nixon, A.]
Thilikos, D. M.
[see: Dąbrowski, K. K.,. Kamiński, M.]
Thomas, C. R.
[see: Jones, S. K.]
Thomas, D.
[see: Feghali,. C.]
Thomas, R.
[see: Dvořák, Z.]
Thomas, R. M.
[see: Jones, S. A. M., Rino Nesin, G. A.]
Thomason, A. G.
A Paley-like graph in characteristic 2. Preprint.
http://arxiv.org/pdf/1509.05198
Thomason, A. G.
[see: Saxton, D.]
Thomassen, C.
[see: Alstrup,, S.]
Thorpe, M. F.
[see: Nixon, A.]
Tiefenbruck, M.
[see: Kitaev, S.]
Tlachac, M L.
[see: Bevan, D.]
Todd, M.
[see: Baladi, V., Bruin, .H.., Demers, M., Fraser, J..Haydn, N., Iommi, G., Rousseau,
J.]
Todorcevic, S. and Tyros, K.
A disjoint union theorem for trees. Adv. Math. 285 (2015) 1487–1510
http://dx.doi.org/10.1016/j.aim.2015.08.021
http://arxiv.org/pdf/1407.7292
Todorov, I. G.
[see: Paulsen, V. I.]
Tointon, M.
Approximate subgroups of residually nilpotent groups. Preprint.
http://arxiv.org/pdf/1509.03876
Tointon, M.
Characterisations of algebraic properties of groups in terms of harmonic functions.
Groups Geom. Dynamics, to appear.
http://arxiv.org/pdf/1409.6326
Tointon, M.
[see: Breuillard, E., Meyerovitch., T]
Tomon, I.
[see: Narayanan, B. P.]
Tong-Viet, H. P.
[see: Burness, T. C.]
Tóth, B.
[see; Crane, E. T.]
Townsend, T.
[see: Kim, J., Kůhn, D.]
Traetta, T.
[see: Buratti, M.]
Treglown, A.
On directed versions of the Hajnal-Szemerédi theorem. Combin. Probab. Comput.,24
(2015) 873-928.
http://dx.doi.org/10.1017/S0963548315000036
http://web.mat.bham.ac.uk/~treglowa/directedfinal.pdf
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., Czygrinow,A,. Han, J., Hancock, R., Staden, Y. ]
Trimble, J.
[see: 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., to appear.
http://www.comp.leeds.ac.uk/vuskovi/triangleIsk4Free.pdf
Trotignon, N.
[see: Chudnovsky, M.. Diot, E.]
Trunck, T.
[see: Chudnovsky, M.]
Tsaban, B.
[see: Ben-Zvi, A.]
Tuma, V.
[see: Gajarský, J.]
Tveiten, K.
[see: Akhtar, M.]
Tyomkyn, M. and Uzzell, A.
Strong Turán stability. Electron J. Comb. 22 (2015) P3.9
http://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i3p9 16
Tyomkyn, M.
[see: Kim, J.]
Tyros, K.
Combinatorial Structures on van der Waerden sets. Combin. Probab. Comput. 24
((2015) 929-953
http://dx.doi.org/10.1017/S0963548314000868
Tyros, K.
Primitive recursive bounds for the finite version of Gowers' 𝑐0 theorem Mathematika
61 (2015) 501-522.
http://dx.doi.org/10.1112/S0025579314000345
http://arxiv.org/pdf/1401.8073
Tyros, K.
On colorings of variable words. Discrete Math. 338 (2015) 1025-1028
http://dx.doi.org/10.1016/j.disc.2015.01.031
http://arxiv.org/pdf/1409.1471
Tyros, K.
[see: Dodos, P., Todoerevic, S.]
Ueltschi, D.
[see; Ercolani, N. M., Kotecký, R.]
Úlfarsson, H.
[see: Bean, C. , Claesson, A..]
Ulrich, D.
[see: Conlon, D.]
Unsworth, C.
[see: Prosser, P.]
Uzzell, A. J.
[see: Bollobás, B., Tyomkyn, M.]
Vajnovski, V.
[see: Avgustinovich,. S., Kitaev, S.]
Valicov, P.
[see: Foucaud, F.]
Vargas-Estrada. E.
[see: Ando, H.]
Varju, P. P.
16
A summary appeared in Electron. Notes. Discrete Math. 49 (2015) 433–440
http://dx.doi.org/10.1016/j.endm.2015.06.061
Absolute continuity of Bernoulli convolutions for algebraic parameters. Preprint.
http://arxiv.org/pdf/1602.00261
Varvitsiotis, A.
[see: Godsil, C. D., Mancinska, L.]
Vatter, V.
[see: Albert, M. H., Brignall, R.]
Vaughan, E. R.
[see: Falgas-Ravry, V.]
Vayani, F.
[see; Barton, C. Brankovic, L, Crochemore, M.]
Vdovina, A.
[see: Bromberg, L., Kangaslampi, R., Kontor, J.]
Vempala, S.
[see: Feldman, V.]
Vigoda, E.
[see: Galanis, A.]
Viola, E.
[see: Gowers, W. T.]
Virág, B.
[see: Csóka, E.]
Vogtenhuber, B.
[see: Bárány, I.]
Volec, J.
[see: Balogh, J., Glebov, R.]
Voloshin, A.
[see: Mertzios, G. B.]
von Stengel, B.
[see: Savani, R.]
Vušković, K.
[see: Chudnovsky, M.. Diot, E. Trotignon, N.]
Wade, A. R.
[see: Georgiou, N., Jordan, J.]
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.,.]
Walen, T.
[see: Crochemore, M.]
Walters, M. J.
[see: Balister, P. N., Johson, J. R.]
Wang, N.E.
[see: Hu, K.]
Wang, S.
[see: Bocus. M. Z.]
Wang, X.
[see: Erickson, A.]
Wang, Y.
[see: Paterson, M. B,]
Wanless, I. M. and Webb, B. S.
Small Partial Latin Squares that Cannot be Embedded in a Cayley Table. Australas. J.
Comb., to appear.
http://arxiv.org/pdf/1504.08101.pdf
Ward, J. and Zivny, S.
Maximizing k-Submodular Functions and Beyond. ACM Trans. Algorithms, to
appear.
http://arxiv.org/pdf/1409.1399.pdf
Warnke, L.
Upper tails for arithmetic progressions in random subsets. Isr. J. Math., to appear.
https://www.dpmms.cam.ac.uk/~lw468/aput.pdf
Warnke, L.
On the missing log in upper tail estimates. Submitted.
Warnke, L.
On the method of typical bounded differences. Combin. Probab. Comput. 25 (2016),
269-299.
http://dx.doi.org/10.1017/S0963548315000103
http://arxiv.org/pdf/1212.5796.pdf
Warnke, L.
[see: Balogh, J., Janson, S.,. Riordan, O. M.]
Wastell, C.
[see: Berenbrink, P.]
Watkins, J. J. and Wilson R. J. (editors)
Combinatorics: Ancient & Modern, Oxford University Press, paperback edition.
July 2015, c.380 pp.
Watrigant, R.
[see: Bougeret, N., Crampton, J.]
Weber, J. H. [see: Blackburn, S. R.,]
Weber, T. S.
[see: Duffy, K. R.]
Webb, B. S.
[see: Wanless, I. M.]
Wegner, S.-A.
[see: Minder, L.]
de Werra, D.
[see: Hertz, A.]
West, D. B.
[see: Jahanbekan, S.]
Westbury, B. W.
[see: Rubey, M.]
White, C. D.
[see: Dukes, W. M. B.]
Whiteley, W.
[see: Nixon, A.]
Whitty, R. W.
[see: Affif Chaouche, F]
Wildon, M. R.
[see: Britnell, J. R., Gianelli, E., Paget, R. E.]
Williams, L. K.
[see: Ardila, F.]
Williams, S.
[see: Bazzi, M.]
Wilson, R.J.
‘Map-coloring problems’, in A Century of Advancing Mathematics (MAA Centennial
Volume), Mathematical Association of America, (2015) 35-49.
Wilson, R.J.
Combinatorics: A Very Short Introducation. OUP, April 2016.
ISBN 978-0-19-872349-3.
Wilson, R. J. [see: Beineke, L. W., Fauvel, R., Watkins, J. J.]
Wilton, H.
[see: Bridson, M. R.]
Windridge, P.
[see: House, T.]
Winkler, P. M.
[see: Kenyon, R. ]
Winter, A.
[see: Acin, A., Duan, R., Paulsen, V. I. ]
Withers, P.
[see: McDiarmid, C. J. H.]
Woeginger, G. J.
[see: Bazgan, C]
Wojchiekowski, R.
[see: Georgakopoulos, A.]
Wojuteczky, P.
[see: Biró, P.]
Wolf, J.
[see: Saad, A..]
Wong, P. W. H
[see: Mertzios, G. B., Shalom, M.]
Woodall, D. R.
Towards size reconstruction from fewer cards, Discrete Math. 338 (2015)
2514–2522.
http://dx.doi.org/10.1016/j.disc.2015.06.015
Woodall, D. R.
[see: Bauer, D.]
Worrell, J.
[see: Oukanine, J.]
Wu, H.
[see: Csóka, E., Noel, J. A.]
Wu, T.
[see: Bastowski, S., Huber, K. T.]
Würfl, A.
[see: Böttcher, J.]
Xia, A.
[see: Barbour, A. D.]
Xu, L.
[see: Jeavons, P.]
Yadin, A.
[see: Meyerovitch., T.]
Yamakami, T.
[see: Göbel, A.]
Yehudayoff, A.
[see: Ellis, D.]
Yeo, A.
[see: Barbero, R., Crowston, R., Gutin, G.]
Yepremyan, L.
[see: Csóka, E.]
Yolov, N.
Polarity and Monopolarity of $3$-colourable comparability graphs. Preprint.
http://arxiv.org/pdf/1604.00905
Yolov, N.
[see: McDiarmid, C. J. H.]
Young, M.
[see: Goldwasser, J.]
Zaks, S.
[see: Mertzios, G. B., Shalom, M.]
Zamaraev, V.
[see: Dąbrowski, K. K., Hertz, A., Lozin, V. V.]
Zapata, O.
[see: Dawar, A.,]
Zbarsky, S.
[see: Conlon, D.]
Zetsche, G.
[see: Brough, T.]
Zhai, A.
[see: Norris, J. R.]
Zhai, Y.
[see: Iosevich, A.]
Zhang, P.
[see: Gao, A.]
Zhao, Y.
Hypergraph limits: A regularity approach. Random Struct. Algorithms 47 (2015)
205-226.
http://dx.doi.org/10.1002/rsa.20537
http://arxiv.org/pdf/1302.1634
Zhao, Y.
On the lower tail variational problem for random graphs. Combin. Probab. Comput. ,
to appear.
http://arxiv.org/pdf/1502.00867
Zhao, Y.
[see: Bhattacharya, B. B., Conlon, D., Fox, J.,Han, J.. Kůhn, D., Lovász, L. M.,
Lubetsky, E. Treglown, A.]
Zhu, X.
[see: Kim, J.]
Ziv-Av, M.
[see: Jones, G. A.]
Živny, S.
[see: Cohen, D. A., Fulla, P., Jeavons, P., Kolmogorov, V , Thapper, J.. Ward, J. ]
van Zwam, S.
[see: Chun. C.]
Zverovich, V.
On general frameworks and threshold functions for multiple domination. Discrete
Math. 338 (2015) 2095-2104.
http://dx.doi.org/10.1016/j.disc.2015.05.003
http://arxiv.org/pdf/1410.1669
Zverovich, V.
[see: Barki, H.,. Gagarin, A.]
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
Online J. Anal. Comb. - Online Journal of Analytic Combinatorics
Open J. Discrete Math. – Open Journal of Discrete Mathematics
Oper. Res. - Operations Research
Oper. Res. Lett. - Operations Research Letters
Order – Order
Period. Math. Hung. - Periodica Mathematica Hungarica.
Philos. Trans. R. Soc. Lond., A - Philosophical Transactions of the Royal Society of
London A
Phys. Rev. E – Physical Review E.
Probab. Theory Relat. Fields - Probability Theory and Related Fields
Proc. Am. Math. Soc. - Proceedings of the American Mathematical Society.
Proc. Edinb. Math. Soc. - Proceedings of the Edinburgh Mathematical Society
Proc. Lond. Math. Soc. – Proceedings of the London Mathematical Society
Proc. R. Soc. Lond., Ser. A, Math. Phys. Eng. Sci. - Proceedings of the Royal Society:
Mathematical, Physical and Engineering Sciences
Publ. Math., Inst. Hautes Étud. Sci. - Publications Mathématiques. Institut des Hautes
Études Scientifiques.
Pure Math. Appl. - Pure Mathematics and Applications
Q. J. Math. Quarterly Journal of Mathematics
Quasigroups Relat. Syst. - Quasigroups and Related Systems
RAIRO, Theor. Inform. Appl. - RAIRO. Theoretical Informatics and Applications
Ramanujan J. – Ramanujan Journal.
Random Struct. Algorithms – Random Structures and Algorithms
Rend. Mat. Appl., VII. Ser. - Rendiconti di Matematica e delle Sue Applicazioni. Serie
VII.
Semigroup Forum – Semigroup Forum
Sémin. Lothar. Comb. - Séminaire Lotharingien de Combinatoire
Siam J. Comput. – Society for Industrial and Applied Mathematics Journal on
Computing
SIAM J. Control Optim. – Society for Industrial and Applied Mathematics Journal on
Control and Optimisation
SIAM J. Discrete Math. - Society for Industrial and Applied Mathematics Journal on
Discrete Mathematics
Stochastic Processes Appl. – Stochastic Processes and their Applications
Theor. Comput. Sci. – Theoretical Computer Science
Theory Comput. Syst. – Theory of Computing Systems
Topolog. Appl. – Topology and its Applications
Trans. Am. Math. Soc. – Transactions of the American Mathematical Society
Turk. J. Math. - Turkish Journal of Mathematics
Util. Math. – Utilitas Mathematica
4OR: A Quarterly Journal of Operations Research