Embed Size (px)
Citation preview
British
Combinatorial
Bulletin
2019
BRITISH COMBINATORIAL BULLETIN 2019
This is the 2019 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 old Bulletin website
http://privatewww.essex.ac.uk/~dbpenman/BCB/index.htm has been closed down
when the University of Essex removed all private websites in Summer 2018. Our
mew website is
I apologise for the slightly late going to press this year: this is due to the accounts
being received late. 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
6 May 2019.
Email should be addressed to: [email protected]
The British Combinatorial Committee is a charity registered in Scotland, No:
SC019723.
Committee Membership.
The Committee currently consists of: Peter Cameron (Chairman), James Hirschfeld
(Secretary), Keith Edwards (Treasurer), Simon Blackburn, Julia Böttcher, David
Conlon, Robert Johnson, Kitty Meeks, David Penman (Bulletin Editor) and Andrew
Treglown (BCC27 Organiser).
Support for Conferences
Please contact the British Combinatorial Committee if you are thinking of organizing
a meeting on combinatorial topics in the UK: in most cases, the Committee can offer
financial support. Institutions requesting support are normally expected to make a
contribution from their own funds or elsewhere. Proposals for consideration by the
Committee, including outline plans and an outline budget, should be sent by email to
the Secretary, James Hirschfeld ([email protected])
Archive
Bridget Webb now holds the archive at the Open University. If you have any items for
inclusion or would like to see any items please contact her: [email protected]
News of forthcoming meetings.
As noted in the Introduction, we have moved the news of forthcoming meetings to the
Newsletter so as to avoid overlap. Remember that (all) British Combinatorial
Newsletters are available at http://www.essex.ac.uk/maths/BCB/newsletters.htm
and the most recent one, produced at (essentially) the same time as this Bulletin, is
number 22. The Newsletter also includes details of e.g. visitors, recent Ph.D theses
and some other items.
Accounts
Please note that the statement about accounts on the next page has still to be
approved by the Committee at its meeting in mid-May 2018.
BRITISH COMBINATORIAL COMMITTEE
Receipts and Payments Account for the period
1 October 2017 to 30 September 2018
Year to Year to
30/9/2018 30/9/2017
Receipts £ £
Interest 10.29 32.42
Royalties from Cambridge University Press 283569
Return of unused part of grant for PCC2018 335.30
(Donation) 10000.00
(Book sale at BCC, U. Stratyhclyde, July 2017) 405.00
Total receipts 3181.28 10437.42
Payments
Grants for one-day conferences (2 events) 1242.42 424.67
Scottish Combinatorics Meeting 508.88 386.24
Grant for London 2-day conferences 2017 1362.08
Grant for London 2-day conferences 2017 1143.39
Postrgraduate Combinatorics Conference 2018 500.00
(Finite Geometry Summer School, U. Sussex, June 2017) 500.00
(“Interactions with Combinatorics”, June 2017) 300.00
Total payments 4756,77 1610.91
Surplus / (deficit) for year (1575.49) 8826.51
All funds are unrestricted
Statement of Balances as at 30 September 2018 2017
£ £
Bank accounts:
Opening balances 26744.71 17918.20
Surplus (deficit) for year (1575.49) 8826.51
Closing balances 25169.22 26744.71 Made up of:
Bank of Scotland Treasurer’s Account 8637.07 10222.85
Scottish Widows Bank Charity Deposit Account 16532.15 16521.86
25169.22 26744.71
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 2017 to 30 September 2018 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 Aaronson, James Oxford
Abdi, Ahmad LSE
Adler, Dr. Isolde Leeds
Akrida, Eleni Liverpool
Alecu, Bogdan Warwick
Aliev, Dr. Iskander Cardiff
Al-Krizi, Athraa Liverpool
Allen, Dr Peter LSE
Allen, Dr Stuart M. Cardiff Alpern, Prof Steve Warwick
Anastasiadis,
Eleftherios
Imperial
Anderson, Dr Ian Glasgow Anthony, Prof Martin LSE Appa, Prof Gautam LSE Archibald, Blair Glasgow
Arrowsmith, Prof
David K. QMUL
Arikiez, Mohamed Liverpool
Asciak, Kirstie Open
Ayad, Dr. Lorraine KCL
B
Babbage, Prof Steve Vodafone Group
Baber, Rahil UCL
Backens, Dr. Miriam Oxford
Badkobeh, Dr. Golnaz Goldsmiths
Bagdasar, Dr Ovidiu D. Derby
Bailey, Prof R.A. St Andrews/QMUL
Balagovic, Dr. Martina Newcastle
Ball, Prof Keith M. Warwick
Banaji, Dr. Murad Middlesex
Bárány, Prof Imre UCL
Barbina, Dr Silvia Open
Batu, Dr Tugkan LSE
Bazlov, Dr Yuri Manchester
Bedford, Dr David Keele
Behrend, Dr. Roger Cardiff
Bending, Dr Thomas D. Middlesex
Bevan, Dr. David Strathclyde
Bhattacharya, Dr. Sayan Warwick
Biggs, Prof Norman L. LSE
Biktasheva, Dr I Liverpool
Blackburn, Prof Simon RHUL
Bleak, Dr Collin St Andrews
Bogacka, Dr Barbara QMUL
Bollobás, Prof Béla Cambridge
Bone, Dr Nicholas Vodafone Group
Bordewich, Dr Magnus Durham
Borovik, Prof
Alexendre V.
Manchester
Böttcher, Dr Julia LSE
Bourne, Mr. T St Andrews
Bowler, Dr Andrew Birkbeck
Bowman, Dr
Christopher
Kent
Bowtell, Candida Oxford
Branke, Prof Jurgen Warwick
Bray, Dr John QMUL
Briggs, Dr Keith BT Martlesham Labs
Brignall, Dr Robert Open
Brightwell, Prof
Graham. R.
LSE
Britnell, Dr John R. Imperial
Broomhead, Prof David
S.
Manchester
Bryant, Prof Roger M. Manchester
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 Carey, Dr. Rachael . Dundee
Carlotti, Andrew Cambridge
Carmesin, Dr. Johannes Birmingham
Chapman, James Manchester
Chapman, Dr Robin J. Exeter Charalampopoulos,
Panagiotis
KCL
Chen, Prof Bo Warwick Chetwynd, Prof
Amanda G Lancaster
Chicot, Dr Katie M. Open Christodolou, Dr G. Liverpool
Chuang, Prof Joseph City
Chuzhanova, Prof
Nadia
Nottingham Trent
Cid, Prof Carlos RHUL Ciechanowicz, Dr C. RHUL
Claridge, Dr. Jessica Essex
Clarke, Dr Francis W. Swansea Clayton, Mr. Ashley St Andrews
Clifford, Dr Raphael Bristol
Cohen, Prof David E. RHUL Coleman, Dr. Thomas St Andrews
Condon, Padraig Birmingham
Conlon, Prof David Oxford
Constable, Robin L. St Andrews Cooper, Prof. Colin KCL Cooper, Frances Glasgow
Cormode, Prof Graham Warwick
Corsten, Jan LSE
Cosh, Ben Reading Coulson, Matthew Birmingham
Cox, Dr Anton City
Crampton, Prof Jason RHUL Crane, Dr Edward Bristol
Crofts, Dr Jonathan J. Nottingham Trent
Crouch, Dr Simon York Cryan, Dr Mary Edinburgh Csornyei, Prof
Marianna UCL
Czumaj, Prof Artur Warwick
D Dąbrowski, Konrad Durham
Dankovics, Attila LSE
Dantchev, Dr Stefan Durham David, Stefan Cambridge
Davies, Peter Warwick
Dawson, Mr. Laurence Durham
Deineko, Dr Vladimir Warwick Deligkas, Argyrios Liverpool
Dettmann, Prof. Carl Bristol
Dewar, Sean Lancaster
Diaz, Alberto Espuny Birmingham
Diaz, Yadira
Valdivieso
Leicester
Dietmann, Dr Rainer RHUL
Doan, Dr Xuan Vinh Warwick
Dong, Keren Liverpool
Dugdale, Dr J. Keith Reading Dukes, Dr W. Mark B. Strathclyde
Duncan, Dr Andrew J. Newcastle Dunlop, Fraser St Andrews
Dunne, Prof Paul Liverpool
Dyer, Prof Martin Leeds Džamonja, Prof Mirna UEA
E Edwards, Dr Keith J. Dundee Efthymiou, Dr.
Charilaos
Warwick
Eleftheriou, Andria Essex Ellis, Dr David QMUL
Englert, Dr Matthias Warwick Enright, Dr. Jessica Edinburgh
Erickson, Alejandro Durham
Erskine, Dr. Grahame Open
Erlebach, Prof Thomas Leicester Essam, Prof John W. RHUL Evans, Prof David M. Imperial Everett, Prof M. G. Manchester
F Fairbairn, Dr Ben Birkbeck Falconer, Prof Kenneth
J. St Andrews
Fearnley, Dr John Liverpool
Fenner, Prof Trevor I. Birkbeck Fischer, Dr. Felix QMUL
Fitch, Matthew Warwick
Fleischmann, Prof
Peter Kent
Flores Brito, Mr. F. St Andews
Foniok, Dr. Jan Manchester
Metropolitan
Forbes, Dr Tony D. Open Forster, Dr Thomas. E. Cambridge
Fountoulakis, Dr
Nikolaos
Birmingham
Frankl, Nora LSE
Fraser, James Open
Fraser, Dr. Jonathan St Andrews
Friedetzky, Dr Tom Durham
G Gadouleau, Dr
Maximilien
Durham
Gagarin, Dr Andrei Cardiff
Gairing, Dr Martin Liverpool
Garbe, Frederik Birmingham
Gąsieniec, Prof Leszek Liverpool Georgakopoulos, Dr
Agelos
Warwick
Georgiou, Dr Nicholas Durham
Gerke, Prof Stefanie RHUL Gilmour, Prof S. G. KCL Gill, Dr. Nick South Wales
Girao, Dr. Antonio Birmingham
Glass, Prof Celia A. City Glen, Dr. Marc Strathclyde
Glock, Dr. Stefan Birmingham
Goldberg, Prof Leslie
A. Oxford
Goldberg, Prof Paul W Oxford Goldschmidt, Prof
Christina
Oxford
Gordon, Dr Neil A. Hull Gowers, Prof W. Tim Cambridge Grabowski, Jan Lancaster
Grabowski, Lukasz Lancaster
Grace, Dr. Kevin Bristol
Grannell, Prof Mike J. Open Green, Prof Ben J. Oxford Griggs, Prof Terry S. Open Grimm, Uwe Open Grimmett, Prof
Geoffrey R.
Cambridge
Grindrod, Prof Peter Oxford
Groenland, Carla Oxford
Guggiari, Hannah Oxford
Gulpinar, Dr Nalan Warwick
Guo, Dr. Heng Edinburgh
Gur, Dr. Tom Warwick
Gutin, Prof Gregory RHUL Gwynllyw, Dr Rhys West of England
H
Hagen, Dr. Mark Bristol
Hall, Bethany Nottingham Trent
Hall, Dr Rhiannon Brunel
Hamilton, David Liverpool
Handley, Dr Andrew Warwick
Harper, Dr. Adam Warwick
Harris, Dr. Liam South Wales
Hart, Prof Sarah Birkbeck
Haslegrave, Dr. John Warwick
Hatton, Prof Les Kingston
Hauser, Dr Raphael Oxford
Hebbes, Dr Luke Kingston
Heckel, Annika Oxford
Hetherington, Dr
Timothy J.
Nottingham Trent
van den Heuvel, Prof J. LSE
Higgins, Prof Peter M. Essex
Higham, Prof.
Desmond
Strathclyde
Hill, Prof Ray Salford
Hilton, Prof Anthony J.
W.
Reading
van Hintum, Peter Cambridge
Hirschfeld, Prof James
W. P.
Sussex
Hng, Eng Keat LSE
Hoffmann, Dr. Ruth St Andrews
Holroyd, Dr Fred C. Open
Hook, James Bath
Howard, Dr John LSE
Huber, Dr Anna Teesside
Huber, Dr Katharina UEA
Huczynska, Dr Sophie St Andrews
Huggett, Dr Stephen Plymouth
Hunt, Dr Francis South Wales
Hunter, Dr Gordon J.A. Kingston University
Hutchinson, Daniel RHUL
Hyde, James St. Andrtews
I Illingworth, Freddie Cambridge
Ioannou, Anastasia Leicester
Irving, Dr Rob Glasgow Ivrissimtzis, Ioannis Durham
J Jabbar, Awss Sussex
Jackson, Prof Bill QMUL Jackson, Dr Penelope
S. Stirling
Jeans, Olivia Open
Jefferson, Dr. Chris St Andrews
Jennings, Dr Sylvia London South Bank Jenssen, Matthew Oxford
Jerrum, Prof Mark QMUL Jha, Dr Vikram
Johnson, Dr Marianne Manchester
Johnson, Dr Matthew Durham Johnson, Dr J. Robert QMUL Johnstone, Dr W. Roy Reading Jones, Prof Gareth A. Southampton Jones, Dr Mark C. W. Kingston Jones, Dr Sian South Wales
Joos, Dr. Felix Birmingham
Jordan, Dr Jonathan Sheffield
Jowhari, Dr. Hossein Warwick
Jurdzinski, Dr Marcin Warwick
K Kambites, Prof. Mark Manchester Keedwell, Dr A. D. Surrey Keevash, Prof Peter Oxford
Kelly, Prof F. P. Cambridge
Kemp, Dr A. W.
(Freda) St Andrews
Kemp, Prof David St Andrews Kessar, Prof Radha City
Key, Professor Jennifer
D.
Aberystwyth
Khalid, Nayab St Andrews
Khudaverdian, Dr
Hovannes Manchester
Kim, Dr. Jaehoon Warwick
King, Dr Oliver H. Newcastle King, Prof Ron C. Southampton Kisil, Dr V.V. Leeds Kitaev, Dr Sergey Strathclyde
Kitson, Dr Derek Lancaster
Koch, Christoph Oxford
Koh, Cedric LSE
Konovalov, Dr
Alexander B.
St. Andrews
Kolb, Dr. Stefan Newcastle
Korpelainen, Nicholas Derby
Kovalenko, Dr Igor N. London Metropolitan Kowalski, Prof Darius Liverpool
Král’, Prof Dan Warwick
Krasikov, Dr Ilia Brunel Krokhin, Prof Andrei Durham Krysta, Prof Piotr Liverpool Kučera, Stanislas LSE
Kühn, Prof Daniela Birmingham Kupavskii, Dr. Andrey Oxford
L Laczkovich, Prof
Miklos UCL
Laing, Thalia RHUL
Lamb, Dr John D. Aberdeen Lammers, Piet Cambridge
Lang, Dr. Richard Birmingham
Lapinskas, John Oxford
Larcombe, Prof Peter J. Derby Larman, Prof David G. UCL Larsson, Dr. Joel Warwick
Launois, Prof.
Stephane Kent
Lawson, Dr Mark V. Heriot-Watt Laycock, Prof Patrick
J. Manchester
Lazic, Dr Ranko Warwick
Leader, Prof Imre B. Cambridge Leese, Dr Robert Oxford Lemmens, Dr Bas Kent
Lewis, Robert Open
Liebeck, Prof Martin Imperial College Lindelmann, Prof
Markus
City
Linton, Prof Steve A. St. Andrews Liu, Hong Warwick
Liu, Hsiang Hsuan Liverpool
Lloyd, Dr E. Keith Southampton Lo, Dr. Allan Birmingham
Long, Jason Cambridge
Loureiro, Dr Ana F. Kent
Lozin, Prof Vadim V. Warwick Lyle, Dr Sinead UEA
M Macpherson, Prof
H. Dugald Leeds
Mailler, Dr. Cecile Bath
Makroglou, Dr Athena Portsmouth Manlove, Prof. David Glasgow Marchant, David Open
Marsh, Prof Robert J. Leeds Martin, Dr. Barnaby Durham
Martin, Dr James Oxford Martin, Prof Keith. RHUL Martin, Prof Paul P. Leeds
Martin, Dr Russell Liverpool Mavron, Prof Vassili
C. Aberystwyth
McAlpine, Kenneth M. Abertay McCabe, Dr Antony. Liverpool
McCabe, Dr John H. St Andrews McCreesh, Dr. Ciaran Glasgow
McDevitt, Matt St Andrews
McDiarmid, Prof
Colin. J.H. Oxford
McDonough, Dr Tom
P. Aberystwyth
McKee, Prof James RHUL McMullen, Prof Peter UCL Meeks, Dr Kitty Glasgow
Meroueh, Ares Cambridge
Mertzios, Dr George B. Durham
van der Merwe, Thyla RHUL
Milecevic, Luka Cambridge
Millar, Colin St Andrews
Miller, Dr Alice Glasgow
Min, Jie Liverpool
Mitchell, Prof Chris J. RHUL Mitchell, Dr James D. St Andrews Moffatt, Dr Iain RHUL
Mohammadi, Dr.
Fatemeh
Bristol
Montanaro, Dr Ashley Bristol
Montgomery, Dr.
Richard
Birmingham
Morris, Prof Alun O. Aberystwyth Morrison, Natasha Cambridge
Müller, Haiko Leeds Müller, Prof Thomas
W. QMUL
Murphy, Prof Sean P. RHUL Mycroft, Dr Richard Birmingham
N
Neale, Dr Vicky Oxford
Ng, Dr Siaw-Lynn RHUL Nixon, Dr Tony Lancaster
Noble, Dr Steven Birkbeck Noel, Dr. Jonathan Warwick
O O'Connor, Dr John J. St Andrews O’Donovan, Bill RHUL
Olaosebikan, Sofiat Glasgow
Olsen, Prof Lars St Andrews Osthus, Prof Deryk Birmingham O’ Reilly, Mr. G. St Andrews
O'Toole, Lawrence RHUL
P
Paget, Dr Rowena E Kent Papadopoulos, Kleitos Leicester
Paris, Prof Jeff Manchester Parker, Dr Alison Leeds
Paterson, Prof Kenny RHUL Paterson, Dr Maura Birkbeck Paterson, Prof Mike Warwick Patterson, Derek QMUL Paulusma, Prof Daniel Durham Pech, Dr. Clelia M. A. Kent
Penman, Dr David Essex Penrose, Prof Mathew Bath Peresse, Dr Yann Hertfordshire
Perarnau, Dr. Guillem Birmingham
Perkins, Dr Stephanie South Wales Pettersson, Dr. William Glasgow
Peyerimhoff, Dr
Norbert
Durham
Pflügel, Dr Eckhard Kingston Pfeiffer, Dr Markus St. Andrews
Pikhurko, Prof Oleg Warwick
Polanco, Ricardo
Villaneuva
RHUL
Potapov, Prof. Igor Liverpool
Potts, Prof Chris N. Southampton Powell, Robert Durham
Prellberg, Dr Thomas QMUL Prendiville, Dr. Sean Manchester
Prosser, Dr Patrick Glasgow
Przykucki, Michal J. Birmingham
Pu, Dr Ida Goldsmiths, London
Q Quick, Dr Martyn R. St Andrews Quinn, Dr Kathleen
A.S. Open
R Radomirović, Dr. Saša Dundee
Radzik, Prof. Tomasz KCL
Randelovic, Zarko Cambridge
Rattan, Dr Amarpreet Birkbeck Raty, Eero Cambridge
Ray, Prof Nigel Manchester Rees, Prof Sarah E. Newcastle Reilly, Craig Glasgow
Reinert, Prof Gesine Oxford Richerby, Dr David Oxford
Riordan, Prof Oliver Oxford Roberts, Alexander Oxford
Roberts, Bartnaby LSE
Robertson, Prof
Edmund F. St Andrews
Roney-Dougal, Dr
Colva M. St Andrews
Rowley, Prof Peter J. Manchester Rowlinson, Prof Peter Stirling Rudnev, Dr Misha Bristol Ruškuc, Prof Nik St Andrews Russell, Mr. Chris St Andrews
Russell, Dr Paul A. Cambridge Rutherford, Dr Carrie London South Bank
S Saker, Prof. Chris J. Essex Salhi, Prof. Abdel Essex Sands, Dr Arthur D. Dundee Sanders, Dr Tom Oxford Sangha, Dr. Pavan Liverpool
Sanhueza-Matamala,
Nicolas
Birmingham
Savani, Dr Rahul Liverpool Saxl, Prof Jan Cambridge Schroll, Dr Sibylle Leicester
Schulze, Dr Bernd Lancaster
Scott, Prof Alex D. Oxford Semeraro, Dr. Jason Leicester
Sendova-Franks, Dr A West of England. Severini, Prof Simone UCL
Sgouritsa, Alkmini Liverpool
Shakhlevich, Natasha Leeds Shang, Tao Liverpool
Shank, Dr R. J. Kent Shawe-Taylor, Prof
John S. UCL
Sheikh, Aleen RHUL
Sheng, Bin RHUL
Short, Ian Open
Shreeve, Richard I. Royal Grammar School,
High Wycombe Siemons, Dr I.
Johannes UEA
Singerman, Prof David Southampton Singmaster, Prof D. B. London South Bank Širáň, Prof Jozef Open
Skelt, Anna South Wales
Skokan, Dr Jozef LSE Smith, Prof Derek H. South Wales Smith, Dr. Jason Aberdeen
Soicher, Prof Leonard
H. QMUL
Sokal, Prof Alan D UCL Spirakis, Prof Paul G. Liverpool
Spooner, Jakob Leicester
Sridharan, Dr.
Ramanujan
Warwick
Staden, Dr. Katherine Oxford
Stauffer, Dr. Alexandre Bath
Stark, Dr Dudley S. QMUL Steingrimsson, Prof
Einar
Strathclyde
von Stengel, Prof
Bernhard LSE
Steinberg, Prof Richard LSE Stevens, Sophie Bristol
Stewart, Anthony Durham
Stewart, Prof Iain A Durham Stirling, Dr David S.G. Reading Stöhr, Prof Ralph Manchester
Strauss, Dr Arne Warwick
Strusevich, Dr V. A. Greenwich Sulzbach, Dr. Henning Birmingham
Swanepoel, Dr Konrad LSE
T Tamimi, Baha Essex
Talbot, Dr John M. UCL Talbot, Dr Richard F. Staffordshire Tavare. Prof. Simon Cambridge
Theran, Dr. Louis St. Andrews
Thomas, Dr A. D. Swansea Thomas, Prof Richard
M. Leicester
Thomason, Prof Cambridge
Andrew G. Tiskin, Dr Alex Warwick Todd, Dr Mike St Andrews
Tointon, Dr. Matthew Cambridge
Tokac, Nihan Durham
Torpey, Mr. Michael St Andrews
Treffinger, Hipolito Leicester
Treglown, Dr Andrew Birmingham
Trimble, James Glasgow
Truman, Paul Keele
Truss, Prof John K. Leeds Tuite, James Open
V Varjú, Dr Peter Pal Cambridge
Vdovina, Dr Alina Newcastle Vernitski, Dr Alexei Essex De Visscher, Dr Maud City
Vušković, Dr Kristina Leeds
W Wahlström, Dr
Magnus
RHUL
Wales, Matthew Cambridge
Walters, Dr Mark QMUL Walters, Steven Glasgow Caledonian
Ward, Dr. Justin QMUL
Warnke, Lutz Cambridge
Wastell, Chris Durham
Webb, Dr Bridget S. Open Weber, Prof Richard
R.
Cambridge
Wells, Matthew Essex
Welsh, Prof Dominic Oxford Whistler, William Durham
Whitaker, Dr Roger Cardiff
White, Dr Lynda V. Imperial Whitty, Prof Robin W. QMUL Wildon, Prof. Mark RHUL
Williams, Conrad RHUL
Williams, Prof Gerald Essex Williams, Prof H. Paul LSE Williams, Nick Leicester
Willmott, Dr Colin M. Nottingham Trent
Wilson, Prof Robert A. QMUL Wilson, Prof Robin J. Open Wilson, Samuel Leeds
Wilson, Mr. Wilf St Andrews
Wojtczak, Dr D. Liverpool
Wolf, Dr Julia Cambridge
Wong, Dr Prudence H Liverpool Woodage, Joanne RHUL
Woodcock, Dr Chris F. Kent Wright, Rob. Vodafone Group Wu, Dr Taoyang UEA
X
Y
Yepremyan, Dr. Liana. Oxford
Z Zalesskii, Prof A.E. UEA Zamaraev, Victor Durtham
Zamaraeva, Elena Warwick
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)
Institute of Mathematics University of Aberdeen, Fraser Noble Building.Aberdeen
AB24 3UE Scotland, UK. Tel. 01224 272605
http://www.abdn.ac.uk/ncs/departments/mathematics
Dr. Jason P. Smith (permutation patterns, combinatorics, topology).
Lecture Courses: There are a number of general discrete mathematics courses.
Current Periodicals; A, B, E, F, H, I, J, L, M, N, P, Q, R, T, V, W, Z, d, g (some electronic
access only).
ABERYSTWYTH UNIVERSITY
Institute of Mathematics, Physics & Computer Science, Aberystwyth University,
Aberystwyth, SY23 3BZ. Tel: 01970 622802 Fax: 01970 622826 email:
http://www.aber.ac.uk/maps/en/
Prof J. D. Key (Honorary Professor: combinatorics, codes)
Prof V.C. Mavron* (Emeritus: designs, codes)
Dr T. P. McDonough (retired, Honorary Lecturer: designs, permutation groups, codes)
Prof A.O. Morris (Emeritus: representation theory and algebraic combinatorics)
Lecture courses None currently.
Current periodicals: P, U, h
UNIVERSITY OF BATH Department of Mathematical Sciences University of Bath, Bath, BA2 7AY Tel:
01225 386989 Fax: 01225 386492
http://www.bath.ac.uk/math-sci
Dr Antal Jarai (probability including spanning forests/trees and sandpiles)
Dr. Ceclie Mailler (probability enumerative combinatorics))
Dr. Marcel Ortgiese (probability, including random graphs)
Prof Mathew Penrose (probability theory, geometric random graphs)
Dr Alexandre Stauffer* (probability including random walks,, random graphs,
percolation and Markov chain mixing times)
Forthcoming visitors to Bath in probability (often interacting with combinatorics) are
listed at http://www.bath.ac.uk/research/centres/probability-laboratory/seminars/
( scroll down the page).
Seminar Probability Seminar (Monday, 12.15):
http://www.bath.ac.uk/research/centres/probability-laboratory/seminars/
Current Periodicals: A, B, D, E, F, H, J, L, M, N, P, Q, R, S, T, U,V, X, Y, Z, a, b, c,
d, e, f, g, h. Most of these are electronic access only (sometimes only after a fixed date)
but E and F are paper access.
BIRKBECK COLLEGE
School of Economics, Mathematics and Statistics Birkbeck College, Malet Street,
London WC1E 7HX. Tel: 0207 631 6428 Fax: 0207 631 6416
http://www.ems.bbk.ac.uk/
Dr Andrew Bowler* (symmetric designs, combinatorial matrices, permutation groups)
Dr Ben Fairbairn (combinatorial algebra).
Prof. Sarah Hart (permutation groups, sum-free sets)
Dr. Steven Noble (graph polynomials and matroids)
Dr Maura B. Paterson (frameproof codes, key distribution schemes, multivariate
equation solving techniques).
Dr Amarpreet Rattan (factorizations of permutations, combinatorial representation
theory, lattice path combinatorics).
School of Computer Science and Information Systems Birkbeck College, Malet
Street, London WC1E 7HX. Tel: 0207 631 6700 Fax: 0207 631 6727
http://www.dcs.bbk.ac.uk/
Prof Trevor I. Fenner (combinatorial algorithms, probabilistic algorithms, random
graphs)
Prof George Loizou (combinatorial algorithms)
Dr Oded Lachish (combinatorial algorithms).
UNIVERSITY OF BIRMINGHAM
School of Mathematics University of Birmingham, Edgbaston, Birmingham B15 2TT.
Tel: 0121 414 6587 Fax: 0121 414 3389
http://www.mat.bham.ac.uk
http://web.mat.bham.ac.uk/combinatorics/main.html (for combinatorics group).
Dr. Johannes Carmesin (infinite graph theory)
Dr Nikolaos Fountoulakis (Random Graphs, percolation, Randomized Algorithms)
Prof Daniela Kühn (Extremal and Probabilistic Combinatorics)
Dr. Allan Lo (Extremal Combinatorics)
Dr. Richard Montgomery (Extremal and Probabilistic Combinatorics).
Dr Richard Mycroft (Extremal Combinatorics)
Prof Deryk Osthus* (Extremal and Probabilistic Combinatorics)
Dr. Guillem Perarnau (Probabilistic Combinatorics)
Dr. Henning Sulzbach (Probability theory and applications to random discrete
structures)
Dr Andrew Treglown (Extremal Combinatorics)
Research Fellows
Dr. Stefan Glock (Combinatorics)
Dr. Antonio Girao (Combinatorics\0
Dr. Felix Joos (Combinatorics)
Dr.Michal Przykucki (Combinatorics)
Research Students
Padraig Condon (Prof. Osthus)
Matthew Coulson (Dr. Perarnau)
Alberto Espuny Diaz (Prof. Kühn)
Stephen Gould (Prof. Osthus)
Bertille Granet (Prof. Kühn)
Joseph Hyde (Dr. Treglown)
Tejas Iyer (Dr. Fountoulakis)
Amartha Kathapurkar (Dr. Mycroft)
Nicolas Sanhueza-Matamala
Lecture courses
Combinatorial Optimisation (22 lectures, 3rd
year)
Discrete Mathematics (22 lectures, 1st year)
Combinatorics (22 lectures, 3rd
and 4th
year)
Communication Theory (22 lectures, 3rd
and 4th
year)
Computability (22 lectures, 3rd
and 4th
years)
Advanced Topics in Combinatorics (22, 4th
year)
Graph Theory (44, 3rd
and 4th
year)
Seminar Combinatorics Research Seminar (usually Thursdays 2 p.m)
http://web.mat.bham.ac.uk/combinatorics/
UNIVERSITY OF BRISTOL
Department of Mathematics University of Bristol, University Walk, Bristol, BS8
1TW, Tel: 0117 928 7978, Fax: 0117 928 7999.
http://www.maths.bris.ac.uk
Prof Carl Dettmann (random geometric graphs, wireless networks, dynamical
systems, statistical physics)
Dr Oliver Johnson (group testing, entropy, log-concavity)
Dr Ashley Montanaro (quantum computation, including combinatorial aspects)
Dr Misha Rudnev (harmonic analysis, geometric combinatorics, hard Erdős problems)
Prof Trevor Wooley (number theory)
Research Fellows
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. Kevin Grace (matroid theory)
Dr Justin McInroy (groups, algebras, finite geometry, codes)
Dr. Fatemeh Mohammadi (combinatorics and algebraic geometry/commutative
algebra)
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 He Sun (spectral graph theory, randomised algorithms)
Research Fellows
Research Students
Sophie Stevens (Prof. Rudnev)
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 Rhiannon Hall* (matroid theory, graph theory)
Dr Ilia Krasikov (graph theory, combinatorics, coding theory, number theory,
orthogonal polynomials)
Lecture courses
Encryption and Data Compression (48 lectures, 3rd
year, Dr Krasikov)
Elements of Combinatorics (24 lectures, 2nd
year, Dr Krasikov)
Fundamentals (24 lectures, 1st year, Dr Winter)
Probability (36 lectures, 1st year, Dr Kaloghiros)
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
Centre for Mathematical Sciences Wilberforce Rd, Cambridge CB3 0WB. Tel:
01223 337999 Fax: 01223 337920
http://www.dpmms.cam.ac.uk/
Prof. E. Breuillard (additive combinatorics)
Prof W. T. Gowers (analysis, combinatorics)
Prof G. R. Grimmett (probability theory, combinatorial theory)
Prof F. P. Kelly (random processes, networks, optimization)
Prof I. B. Leader* (extremal combinatorics, Ramsey theory)
Prof J. Saxl ( (group theory)
Dr. P. Sousi (probability, including combinatorial aspects)
Prof. S. Tavare (probability, combinatorics, biological applications) Wales
Prof A. G. Thomason (combinatorics, graph theory, algorithms)
Prof R. R. Weber (mathematical operational research, stochastic networks)
Dr. J. Wolf (additive combinatorics)
Fellows and Research Fellows
Dr. Thomas Bloom (additive combinatorics)
Prof Béla. Bollobás (combinatorics, graph theory)
Dr Thomas E. Forster ( (logic, set theory, combinatorics)
Dr. Vytautas Gruslys (combninatorics)
Dr. Jonathan Hermon (probability, including combinatorial aspects)
Dr. Tom Hutchcroft (probability, including combinatorial aspects)
Dr. Natasha Morrison (combinatorics)
Dr Paul Russell ( (Ramsey theory)
Dt. Julian Sahasrabudhe (combinatorics)
Dr. Matthew Tointon (additive combinatorics)
Dr. Peter Varjú (dynamical systems, probability, combinatorics)
Dr. Aled Walker (combinatorics, analytic number theory)
Research students
Andrew Carlotti (Prof. Bollobás)
Stefan David (Prof. Bollobás)
Peter van Hintum (Prof. Bollobás)
Freddie Illingworth (Prof. Thomason).
Piet Lammers (Prof. Bollobás)
Jason Long (Prof. Gowers)
Ares Meroueh (Prof Thomason)
Zarko Randelovic (Prof. Leader)
Eero Raty (Prof. Leader)
Marius Tiba (Prof. Bollobás)
Matthew Wales (Prof Thomason)
Lecture courses
Numbers and Sets (24 lectures, 1st year, Prof Thomason)
Graph Theory (24 lectures, 3rd
year, Dr. Russell)
Coding and Cryptography (24 lectures, 3rd
year, Dr Rachel Camina)
Combinatorics (16 lectures, Part III, Prof. Leader)
Introduction to Approximate Groups (Dr. Tointon)
Introduction to Discrete Analysis (Prof. Gowers)
Mixing time of Markov chains (Dr. Hermon)
Percolation and Random Walks on Graphs (16 lectures, Part III, Dr. Sousi)
Topics in Ergodic Theory (Dr. Varju).
Seminars
Combinatorics (Thursdays at 2.30 p.m.)
UNIVERSITY OF CARDIFF
School of Computer Science and Informatics 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/
Prof. Stuart M. Allen (mobile communications, frequency assignment, combinatorial
optimisation, latin squares)
Dr. Padraig Corcoran (ombinatorics, algorithms)
Prof Stephen Hurley (mobile communications, frequency assignment, combinatorial
optimisation)
Prof. Roger M. Whitaker (mobile communications, frequency assignment,
combinatorial optimisation, latin squares)
School of Mathematics. Maths and Education Building , Senghennydd Road,
Cardiff, CF24 4AG
Dr. Iskander Aliev (discrete mathematics)
Dr. Roger Behrend (Combinatorics, including alternating sign matrices, graphs,
lattice paths, plane partitions, polytopes) Dr. Andrei Gagarin* (combinatorics, algorithms)
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
Prof. M. Broom (mathematical biology, links with graph theory)
Dr A. Cox (representation theory)
Prof J. Chuang (representation theory of finite groups)
Dr M. De Visscher (representation theory)
Prof R. Kessar (representation theory of finite groups)
Prof M. Lindelmann (representation theory of finite groups)
UNIVERSITY OF DERBY School of Computing and Mathematics Faculty of Business, Computing and Law,
University of Derby, Kedleston Road, Derby DE22 1GB. Tel: 01332 591896
Fax: +44 (0)1332 597741.
http://www.derby.ac.uk/computing
Dr Ovidiu D. Bagdasar (Discrete Mathematics, Optimization, Mathematical
Modelling, Geometry, Complex Analysis)
Prof Peter J. Larcombe* (hypergeometric function theory, generating functions,
binomial coefficient sums)
Dr Nicholas Korpelainen (structural and algorithmic graph theory, permutation
patterns)
Research students: None
Lecture courses: Graph Theory and its Applications (3rd
year)
Current periodicals: None
UNIVERSITY OF DUNDEE
Computing Computing, University of Dundee, Dundee DD1 4HN. Tel: 01382
388035
http://www.computing.dundee.ac.uk
Dr K. J. Edwards* (Graph colourings, graph decompositions, complexity)
Dr. Saša Radomirović (Combinatorics on words, cryptographic protocols, information
security)
Division of Mathematics University of Dundee, Dundee DD1 4HN. Tel. 01382
386986
http://www.maths.dundee.ac.uk
Dr Arthur D. Sands (retired: Combinatorial problems on finite Abelian groups)
Lecture Courses:
Graph Theory (level 3()
Theory of Computation (Level 3)
Current Periodicals: T, V, b, d
DURHAM UNIVERSITY
Department of Computer Science Science Laboratories, South Road, Durham DH1
3LE Tel: 0191 33 41700 Fax: 0191 33 41701
http://community.dur.ac.uk/algorithms.complexity/
Dr M. Bordewich (computational complexity; randomised algorithms; phylogenetics)
Dr S. Dantchev (proof complexity)
Dr T. Friedetzky (randomised algorithms; probabilistic analysis; sub-linear time
algorithms; communication networks)
Dr M. Gadouleau (coding, network coding, information theory and their links to
combinatorics and matroid theory)
Dr I. Ivrissimtzis (geometric modelling)
Dr M. Johnson* (graph theory, combinatorial optimization, combinatorial designs)
Prof A. Krokhin (algebra; logic; discrete mathematics; constraint satisfaction;
computational complexity; temporal reasoning)
Dr. B. Martin (computation complexity)
Dr G. Mertzios (Algorithms, Complexity, Networks, Combinatorial Optimization,
Algorithmic Game Theory)
Dr D. Paulusma (graph theory; algorithms; combinatorial optimization; cooperative
game theory)
Prof I. A. Stewart (computational complexity; finite model theory; descriptive
complexity; graph theory; interconnection networks; group theory)
Department of Mathematical Sciences Department of Mathematical Sciences,
Durham University, Science Laboratories, South Rd, Durham DH1 3LE. Tel: 0191-
334-3050
Fax: 0191-334-3051
Dr Nicholas Georgiou (Probabilistic combinatorics and partial orders; modular
decomposition and its connection to the Reconstruction Conjecture)
Dr Norbert Peyerimhoff (global analysis, graph theory, Riemannian geometry)
Research Staff (in Computer Science)
Dr. Konrad Dąbrowski (graph algorithms, parameterized complexity)
Dr. Jakub Opršal (combinatorics)
Dr. Viktor Zamaraev (structural graph theory)
Research Students
Abdul Ghani (Dr. Dantchev and Dr. Martin)
Giacomo Paesani (Prof. Paulusma)
Siani Smith (Dr. Martin and Prof. Paulusma)
Dan Thomas (Dr Johnson)
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)
Dr. Taoyang Wu (phylogenetic combinatorics)
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)
Dr. Heng Guo (algorithms and complexity)
Research students
Lecture Courses
Algorithms and Data Structures (3rd
year)
Computability and Intractability (3rd
year, MSc)
Computational Complexity (4th
year)
Current Periodicals: E, H, M, T, X, Y
UNIVERSITY OF ESSEX
Department of Mathematical Sciences University of Essex, Wivenhoe Park,
Colchester CO4 3SQ. Tel: 01206 873040 Fax: 01206 873043
http://www.essex.ac.uk/maths
Dr David Branson (retired: applied probability, combinatorics of Stirling numbers)
Dr. Jessica Claridge (part-time: cryptography)
Prof Peter.M. Higgins (combinatorics of algebraic semigroup theory, cryptography)
Dr David Penman* (random and pseudo-random graphs, aspects of poset theory and
additive combinatorics)
Dr Chris Saker (part-time: combinatorics on words, semigroup theory, cryptography)
Dr Abdellah Salhi (combinatorial optimisation)
Dr Alexei Vernitski (algebra, combinatorics, computer security)
Dr Gerald Williams (computational group theory)
Research students
Andria Eleftheriou (reliability of graphs: Dr Penman: part-time)
Baha Tamimi (critical groups of graphs, Dr Penman and Dr Williams, part-time)
Lecture Courses
Graph Theory (3rd
year, Dr Martin Griffiths) (30 lectures)
Codes and Cryptography (Dr Williams, 3rd
year) (30 lectures)
Combinatorial optimisation (Dr Xinan Yang, 3rd
year) (30 lectures)
Current periodicals: H, P, h.
UNIVERSITY OF EXETER
School of Engineering, Computing and Mathematics Harrison Building, University
of Exeter, North Park Road, Exeter EX4 4QF.
Tel: 01392 263650 Fax: 01392 264067
http://www.secam.ex.ac.uk/mat
Dr R. J. Chapman* (finite fields,coding theory, enumerative combinatorics)
Lecture courses
Discrete Mathematics and Probability (1st year)
Coding theory (3rd
year)
Combinatorics (3rd
year)
Graphs, Networks and Algorithms (3rd
year)
Current periodicals: C, D, W
(For “Glamorgan”, see now “University of South Wales”).
UNIVERSITY OF GLASGOW
School of Mathematics and Statistics University of Glasgow, University Gardens,
Glasgow G12 8QW. Tel: 0141 330 5176 Fax: 0141 330 4111
www.gla.ac.uk/schools/mathematicsstatistics
Dr I. Anderson (Honorary research fellow: designs, whist tournaments)
School of Computing Science Sir Alwyn Williams Building, Lilybank Gardens,
Glasgow G12 8QQ Tel: 0141 330 4256 Fax: 0141 330 4913
http://www.gla.ac.uk/schools/computing/
Dr R.W. Irving (combinatorial and graph algorithms) (Honorary Research Fellow)
Dr D.F. Manlove (combinatorial and graph algorithms)
Dr K. Meeks* (graph theory, algorithms, parameterised complexity, networks.
Dr A. Miller (combinatorial and graph algorithms)
Dr P. Prosser (combinatorial and graph algorithms)
Research Associates
Dr. Blair Archibald (algorithms)
Ciaran McCreesh (combinatorial and graph algorithms)
William Pettersson (graph theory, algorithms, combinatorial optimisation
Research students
Benjamin Bumpus (combinatorial and graph algorithms, parameterised complexity,
Dr. Meeks)
Frances Cooper (combinatorial and graph algorithms, Dr Manlove)
Sofiat Olaosebikan (combinatorial and graph algorithms, Dr Manlove)
Craig Reilly (Parallel graph search with isomporphism elimination, Dr Miller)
Jessica Ryan (combinatorial and graph algorithms, graph theory, Dr. Meeks)
James Trimble (combinatorial and graph algorithms, Dr Manlove and Dr Prosser)
Lecture courses
Algorithmic Foundations 2 (Computing Science, 2nd
year, 22 lectures)
Algorithms and Data Structures 2 (Computing Science, 2nd
year, 22 lectures)
Algorithmics I (H) (Computing Science, 3rd year, 20 lectures)
Algorithmics II (H) (Computing Science, 4th year, 20 lectures)
Constraint Programming M (Computing Science, 4th year, 20 lectures)
Graphs and Networks (Maths, 22 lectures, 2nd year)
Topics in Discrete Mathematics (Maths, 21 lectures, 2nd year)
Seminars: Formal Analysis, Theory and Algorithms (Tuesday, 1 pm, during semester
time). (Dr Michele Sevegnani)
http://www.gla.ac.uk/schools/computing/research/researchoverview/fata-section
Current periodicals: C, O, i (paper only)
M, N, Q, R, V, X, Y, b, c, h (paper and electronic)
A, B, F, H, I, L, P, S, T, U, Z, a, d, e, f, g (electronic only).
GOLDSMITHS COLLEGE
Department of Computing Goldsmiths College, University of London, New Cross,
London SE14 6NW. Tel: 0207 919 7850 Fax: 0207 919 7853
http://www.goldsmiths.ac.uk/computing/
Dr. G. Badkobeh (combinatorics on words).
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
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 Vitaly A. Strusevich (combinatorial optimization, scheduling theory)
Current Periodicals: T
HERIOT-WATT UNIVERSITY
Department of Mathematics Heriot-Watt University, Riccarton, Edinburgh EH14
4AS. Tel: 0131 451 3221 Fax: 0131 451 3249
http://www.ma.hw.ac.uk/maths.html
Dr. Laura Ciobanu (group theory, combinatorics, formal languages)
Dr Mark V. Lawson (semigroup theory, combinatorics on words)
Department of Actuarial Mathematics and Statistics Heriot-Watt University,
Riccarton, Edinburgh EH14 4AS. Tel: 0131 451 3202 Fax: 0131 451 3249
http://www.ma.hw.ac.uk/ams
Dr Jennie Hansen (probabilistic combinatorics)
Lecture course Discrete mathematics (45 lectures, 3rd year honours degree)
Current periodicals: E, F, I, c, g, h
UNIVERSITY OF HERTFORDSHIRE
School of Physics, Astronony and Mathematics. University of Hertforshire, College
Lane, Hatfield, Hertfordshire, AL10 9AB
Tel. +44 (0)1707 284394
http://www.herts.ac.uk/apply/schools-of-study/physics-astronomy-and-mathematics
Dr Catarina Carvalho (algebra, combinatorics, theoretical computer science)
Dr Yann Péresse (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
Computer Science School of Engineering and Computer Science, Faculty of Science
and Engineering, University of Hull, Cottingham Road, Hull, HU6 7RX
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 (retired: combinatorics)
Department of Electrical Engineering Imperial College
Dr Moez Draeif (applied probability including random graphs).
KEELE UNIVERSITY
School of Computing and Mathematics Keele University, Keele, Staffordshire ST5
5BG. Tel: 01782 733258 Fax: 01782 734268
http://www.keele.ac.uk/scm/
Dr D. Bedford* (latin squares; designs)
Dr J. Preater (applied probability, random graphs)
Dr. P. Truman (Algebraic number theory and combinatorics)
Lecture courses
Advanced Combinatorics (40 lectures, 4th
year, Dr Bedford)
Codes and Cryptography (30 lectures, 3rd
year, Dr Truman)
UNIVERSITY OF KENT
School of Mathematics, Statistics and Actuarial Science Sibson Building, University
of Kent, Canterbury, Kent CT2 7FS. Tel: 01227 827181 Fax: 01227 827932
http://www.kent.ac.uk/smsas/
Dr. C. D. Bowman (combinatorics and representation theories of diagrammatic
algebras)
Prof P. Fleischmann (algebraic combinatorics, root systems, Mobius function)
Prof. S. Launois (q-calculus)
Dr B. Lemmens (applications of discrete geometry in dynamics and analysis)
Dr. A. F. Loureiro (orthogonal polynomials)
Dr R. E. Paget* (representation theory of symmetric groups and related algebras,
plethysm)
Dr. C. M. A. Pech (cluster algebras)
Dr R. J. Shank (modular invariant theory)
Dr C. F. Woodcock (orthogonal Latin squares)
Research students
Reuben Green (Dr Paget)
Brendan Nolan (Prof Launois)
Alexandra Rogers (Prof Launois)
Lecture courses
Discrete mathematics (36 lectures, 3rd year, Dr Woodcock) Graphs and combinatorics (36 lectures, 3rd year / M.Sc., Dr Lemmens) Symmetries, Groups and Invariants (3rd year / M.Sc., Prof Fleischmann)
Current periodicals: electronic access to A, B, E, F, H, J, L, M, N, O, P, Q, R, S, U, V,
X, Y, Z, a, b, c, d, e, f, g.
KING'S COLLEGE LONDON
Department of Computer Science King's College, Strand, London, WC2R 2LS Tel
020 7848 2588 Fax: 020 7848 2851
http://www.dcs.kcl.ac.uk
Dr. Lorraine Ayad (combinatorics on words)
Prof. Maxime Crochemore (combinatorics on words)
Prof. Colin Cooper (random graphs, random algorithms)
Prof Tomasz Radzik (algorithms, combinatorial algorithms etc.).
Research Students
Panagiotis Charalampopoulos (combinatorics on words)
KINGSTON UNIVERSITY
Faculty of Science, Engineering and Computing Kingston University,
Penrhyn Road, Kingston-upon-Thames, KT1 2EE
http://sec.kingston.ac.uk/
School of Mathematics
Dr Gordon J. A. Hunter* (Applications of graph theory to Natural Language
Modelling, Statistical Physics and Computational Networks)
Dr Mark Jones (Number Theory and Cryptography)
School of Computing and Information Systems
Prof Les Hatton (forensic software engineering).
Dr Luke Hebbes (software, turbocodes)
Dr Eckhard Pflügel (Cryptography and Information Security)
Lecture courses
Mathematical Programming (final year BSc, Dr Jones)
Internet security (final year BSc, Dr Pflügel);
Cryptography (MSc, Dr Pflügel)
The Department runs MSc Programmes in Network & Information Security,
Networking & Data Communications.
Current periodicals: E, F, N, P, X, Y
UNIVERSITY OF LANCASTER
Department of Mathematics and Statistics Fylde College, University of Lancaster,
Lancaster LA1 4YF. Tel: 01524 593960 Fax: 01524 592681
http://www.maths.lancs.ac.uk
Dr. Natasha Blitvic (algebraic combinatorics, q-series and combinatorics of
mathematical physics)
Prof A.G. Chetwynd (combinatorial applications in statistics)
Dr. Jan Grabowski (cluster algebras, quantum spaces and the combinatorics of their
torus-invariant prime ideal spectrum)
Dr Lukasz Grabowski (graph limits)
Dr. Derek Kitson (geometric and combinatorial rigidity, operator theory, analysis)
Dr. Nadia Mazza (representation theory)
Dr Tony Nixon* (combinatorial rigidity, discrete geometry, graph theory, matroid
theory)
Dr Bernd Schulze (discrete geometry, rigidity and flexibility of geometric constraint
systems, graph theory, matroid theory)
Prof. Stephen Power (combinatorial rigidity, geometric constraint systems, rigidity
operators).
Research Students:
Thomas Booker Price (Dr Grabowski)
Hattie Serocold (Dr Schulze)
Lecture courses:
Discrete Mathematics (1st year, 20 lectures, Dr. Jan Grabowski)
Combinatorics (3rd
year, 20 lectures, Dr. Schulze)
Graph Theory (3rd
year, 20 lectures, Dr. Nixon)
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
Dr. Isolde Adler (graph algorithms, logic in computer science)
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
George Attesis (Prof MacPherson)
Samuel Wilson (Dr Müller)
Daniel Wood (Prof MacPherson)
Lecture courses
Introduction to Discrete Mathematics (22 lectures, 2nd
year, Dr Penazzi)
Graph theory (33 lectures, 3rd
year, Prof MacPherson)
Advanced Graph Theory (44 lectures, 4th
year/M.Sc., Prof MacPherson)
Coding Theory (22 lectures, 3rd
year, Prof Read)
Combinatorics (22 lectures, 3rd
year, Dr Parker)
Mathematics for Computing (22 lectures, 1st year, Prof Vušković)
Current periodicals: (all online only): E, F, M, N, P, Q, T, V, X, Y, b,c,d,e,g,h.
UNIVERSITY OF LEICESTER
Department of Informatics University of Leicester, University Road, Leicester LE1
7RH. Tel: 0116 252 3887 Fax: 0116 252 3604
http://www2.le.ac.uk/departments/informatics
Prof T. Erlebach* (combinatorial optimization, approximation algorithms,
algorithmic graph theory)
Prof R. M. Thomas (combinatorial group and semigroup theory, automata theory)
Research Students
Anastasia Ioannou (modelling systems via Petri nets, Prof Mousavi and Prof Thomas)
Kleitos Papadopoulos (efficient graph algorithms, Prof Erlebach)
Jakob Spooner (temporal graphs, Prof Erlebach)
Lecture courses
Foundations of Computation (22 lectures, 1st year, Dr Ulidowski and Prof Moussavi)
Analysis and Design of Algorithms (30 lectures, 3rd year, Dr Fung and Dr.
Dimitrova)
Cryptography and Information Security (30 lectures, 3rd year, Dr Fung and Dr
Dimitrova)
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 de Vries).
Seminars There is a regular seminar program, see
http://www2.le.ac.uk/departments/informatics/news/researchevents
Department of Mathematics, University of Leicester, University Road, Leicester LE1
7RH. Tel: 0116 252 3917 Fax: 0116 252 3915
http://www2.le.ac.uk/departments/mathematics
Dr S. Schroll (representation theory of algebras, homological algebra, matroids and
hypergraphs)
Dr. J. Semeraro (combinatorics, group theory, representations).
Dr Salvatore Stella (cluster algebras, representations of Kac-Moody groups, root
systems, reflection groups, polytopal geometry)
Post-docs
Dr Hipolito Treffinger (representation theory of algebras, (tau)-tilting theory,
homological algebra, stability conditions)
Dr Yadira Valdivieso Diaz (mirror symmetry and geometric models in algebra)
Research Students
Aran Tattar (classification of quasi-hereditary structures, Prof Schroll)
Nick Williams (categorification of the combinatorics of Grassmannians, Prof Schroll)
Seminars There is a regular seminar program, see
http://www2.le.ac.uk/departments/mathematics/research/pure/colloquium
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. Eleni Akrida (algorithms, graph theory, random graphs)
Dr John Fearnley (Algorithmic Game Theory. Logic and Computation)
David Hamilton (visualisation and animation mechnisms for large networks)
Dr. Pavel Semukhrin (reachability problems, automatic structures, computational
learning theory, computability theory)
Dr Jinshan Zhang (Algorithmic game theory, Algorithmic mechanism design)
Research Students
Sultan Alshamrani (cloud computing, network patrolling)
Thomas Carroll (String algorithms, Combinatorics, Bioinformatics, GPU Computing)
Jie Min (recognition of structural properties in complex networks)
Pavan Sangha (Random graphs)
Alkmini Sgouritsa (Algorithmic Mechanism Design, Algorithmic Game Theory,
Algorithms, Complexity)
Tao Shang (migration mechanisms in social networks)
Bo Tang (Algorithmic game theory)
Lecture courses:
Comp108: Algorithmic Foundations (1st year)
Comp109: Foundations of Computer Science (1st year)
Comp202: Complexity of Algorithms (2nd
year)
Comp218: Decision, Computation and Language (2nd
year)
Comp309: Efficient Sequential Algorithms (3rd
year)
Comp323: Introduction to Computational Game Theory (3rd
year)
Comp324: Complex Information and Social Networks (3rd
year)
Comp523: Advanced Algorithmic Techniques (Master’s)
Comp526: Applied Algorithmics (Master’s)
Comp557: Optimisation (Master’s)
Comp559: Computational Auctions and Mechanism Design (Master’s)
Seminar:
Each research group holds regular seminars.
With strong mathematical interests is also the NeST initiative:
http://www.liv.ac.uk/network-science-technologies
LONDON SCHOOL OF ECONOMICS
Department of Mathematics London School of Economics, Houghton Street, London
WC2A 2AE. Tel: 0207 955 7732 Fax: 0207 955 6877
http://www2.lse.ac.uk/maths
Dr. Ahmad Abdi (combinatorics and optimisation).
Dr Peter Allen (extremal graph theory)
Prof Martin Anthony (computational learning theory, neural networks, theory of
computing)
Dr Tugkan Batu (randomized computation, algorithms on massive data sets, property
testing, statistical testing, streaming algorithms)
Prof Norman Biggs (algebraic graph theory, history of combinatorics, applications in
physics and finance)
Dr Julia Böttcher (extremal graph theory)
Prof Graham Brightwell* (partially ordered sets, random structures)
Prof Jan van den Heuvel (graph theory, discrete mathematics, applications)
Prof Jozef Skokan (quasi-randomness, applications of the regularity lemma, Ramsey
theory, extremal set theory, probabilistic combinatorics)
Prof Bernhard von Stengel (game theory and complexity)
Dr Konrad Swanepoel (combinatorial and discrete geometry, finite geometries,
extremal combinatorics)
Dr Laszlo Vegh (approximation algorithms, combinatorics)
Dr Giacomo Zambelli (combinatorics, combinatorial optimization)
Operational Research Group, Department of Management. London School of
Economics, Houghton Street, London WC2A 2AE Tel: 0207 955 7653 Fax: 0207 955
6885
http://www.lse.ac.uk/collections/operationalResearch/
Prof Gautam Appa (Emeritus: orthogonal latin squares, mixed integer programming,
robust regression)
Prof Gregory Sorkin (combinatorial optimisation).
Prof Richard Steinberg (operations management, combinatorial auctions,
transportation networks)
Prof Paul Williams (Emeritus: linear and integer programming)
Research students
Attila Dankowics (Dr. Böttcher and Prof. Skokan)
Nóra Frankl (Dr. Skokan and Dr. Swanepoel)
Eng Keat Hng (Dr. Allen and Dr. Böttcher)
Cedric Koh (Dr. Vegh and Dr. Zambelli)
Stanislas Kučera (Prof. van den Heuval and Prof. Sorkin)
Aaron Lin (Dr. Swanepoel and Prof. von Stengel)
Amadeo Squeglia (Dr. Böttcher and Prof. Skokan)
Xinyi Xu (Prof. Brightwell and Prof. van den Heuvel)
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 M. Johnson* (tropical algebra and geometry, free Lie algebras and Young tableaux)
Prof. M. Kambites (tropical algebra and geometry, combinatorial group and
semigroup theory, automata, computational complexity and cryptography)
Dr H. Khudaverdian (Lie groups and algebras; symmetric functions; Schur
functions; Young tableaux; combinatorics in geometry)
Prof P. J. Laycock (Emeritus: experimental design)
Prof J. Paris (logic, including interactions with combinatorics)
Dr. S. Prendiville (additive combinatorics)
Prof N. Ray (combinatorial Hopf algebras, geometry and combinatorics of polytopes)
Prof P. J. Rowley (group theory)
Dr R. Sandling (Steenrod algebra: lattices)
Prof R. Stöhr (Group theory and Lie algebras, including combinatorial aspects and
methods).
Research students
Jonathan Chapman (Dr. Prendiville)
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 Murad Banaji (graph theory and applications to chemical reactions).
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 Martina Balagovic* (representation theory, in particular of quantum groups,
DAHA and their degenerations, and Lie superalgebras; links to combinatorics through
type A representation theory, finite characteristic, and diagram algebras)
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)
Dr Stefan Kolb (representation theory of Lie algebras and quantum groups,
connections to combinatorics)
Prof S. Rees (algorithms in group theory and geometry, automatic groups and related
classes of groups, connections between group theory and formal language theory)
Dr Alina Vdovina (geometric group theory, noncommutative geometry, knot theory,
Riemannian geometry)
Lecture courses
Enumeration and Combinatorics (24 lectures, 2nd
year, Dr Vdovina)
Geometries and Designs (24 lectures, 3rd
year, Dr Vdovina)
Coding Theory (24 lectures, 3rd
year, Prof Rees) .
Current periodicals: A, B, F, H, I, J, L, M, N, P, Q, R, S, T, U, V, X, Y, Z, a, b, c, d,
e, f, g. Almost all current issues are electronic access only.
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. Wilmott (Algebra, combinatorics, geometry, quantum coding, quantum
cryptography and entanglement theory)
Research students:
Bethany Hall (computational biology, applications of complex networks: Prof.
Chuzhanova).
Lecture courses:
Topics in Pure Mathematics: Graph Theory and Combinatorics (24 lectures, 3rd
year,
Dr. Hetherington and Dr. Giannakidis).
Coding Theory and Cryptography (24 lectures, 3rd
and 4th
year, Dr. Wilmott and Dr.
Hetherington).
Current periodicals: several (electronic access only).
THE OPEN UNIVERSITY
Department of Mathematics and Statistics The Open University, Walton Hall,
Milton Keynes MK7 6AA. Tel: 01908 653479 Fax: 01908 653744
http://www.mathematics.open.ac.uk/
Dr Silvia Barbina (permutation groups, automorphism groups of countable structures)
Dr Robert Brignall (permutation classes, relational structures, graph theory, well quasi
order)
Dr Katie Chicot (infinite combinatorics)
Prof Mike Grannell (Emeritus: combinatorial design theory, combinatorial computing,
Steiner systems, topological design theory)
Prof Terry Griggs (Emeritus: combinatorial design theory, combinatorial computing,
Steiner Systems, topological design theory)
Prof Uwe Grimm (enumerative combinatorics, words, tilings, applications to physics)
Dr Fred Holroyd (retired: fractional graph colourings, graceful and related tree
labellings, Erdős-Ko-Rado properties of graphs)
Dr Kathleen Quinn* (designs and their applications)
Prof Jozef Širáň (topological graph theory, Cayley graphs)
Dr Bridget Webb (automorphisms of designs, Latin squares, infinite designs)
Prof Robin Wilson (Emeritus: history of graph theory and combinatorics, graph
colourings)
Visiting research fellows
Dr Tony Forbes (Mathematics: combinatorial designs)
Dr Grahame Erskine (vertex-transitive and Cayley graphs in the degree-diameter and
the degree-girth problem
Research students
Kirstie Asciak (Prof Širáň: part-time)
James Fraser (extremal metric and topological properties of vertex transitive and
Cayley graphs, Prof Širáň)
Olivia Jeans (Prof Širáň)
Robert Lewis (analysis and construction of extremal highly symmetric graphs with
given metric properties: Prof Širáň and Dr Webb: part-time)
David Marchant (permutation patterns: Dr Brignall, part time)
James Tuite (vertex-transitive and Cayley graphs and embeddings: Prof Širáň)
Courses
MT365: Graphs, networks and design (3rd
year)
M836: Coding Theory (M.Sc.).
M840: Dissertation in mathematics (algebraic graph theory option) (M.Sc.).
Current periodicals: A, B, C, D, E, F, H, I, J, L, M, N, P, Q, R, S, T, U, V, W, X, Y,
Z, a, b, c, d, e, f, g, h, i (some electronic access only).
UNIVERSITY OF OXFORD
The Mathematical Institute 24-29 St. Giles, Oxford OX1 3LB. Tel: 01865 273525
Fax: 01865 273583
http://www.maths.ox.ac.uk
Prof David Conlon (graph theory and combinatorics)
Prof Ben Green (additive combinatorics)
Dr Raphael Hauser (continuous optimization, applied probability)
Prof Peter Keevash* (extremal and probabilistic Combinatorics)
Dr Robert Leese (channel assignment problems)
Dr Mason Porter (applications of networks)
Dr Tom Sanders (additive combinarorics)
Prof Alex Scott (combinatorics, graph theory)
Prof Dominic J. A. Welsh (retired: combinatorics, applied probability, complexity)
Research fellows/assistants
Dr. Sam Chow (number theory/combinatorics)
Dr. Annika Heckel (combinatorics)
Dr. Matthew Jenssen (extremal and probabilistic combinatorics)
Dr. Christoph Koch (Phase transitions, percolation processes, real-world networks,
structural and extremal graph theory)
Dr, Andrey Kupavskii (combinatorics, set systems)
Dr. Eoin Long (combinatorics)
Dr. Alexander Roberts (extremal and probabilistic combinatorics)
Dr. Katherine Staden (extremal and probabilistic combinatorics)
Dr. Liana Yepremyan (combinatorics)
Department of Statistics 1 South Parks Road, Oxford OX1 3TG. Tel: 01865 272860
Fax: 01865 272595
http://www.stats.ox.ac.uk
Prof Christina Goldschmidt (probability theory and combinatorics)
Prof Colin J. H. McDiarmid (probability and algorithms, probabilistic methods in
combinatorics, colouring problems)
Dr James Martin (probability theory, links to statistical physics and theoretical
computer science)
Prof Gesine Reinert (network statistics (including small world graphs), applied
probability).
Department of Computer Science Wolfson Building, Parks Road, Oxford OX1 3QD
Tel: 01865 73838 Fax: 01856 73839
http://www.cs.ox.ac.uk
Dr. Miriam Backens (algorithms and complexity)
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. John Lapinskas (combinatorics, complexity).
Dr Stanislav Živný (discrete optimisation, constraint satisfaction, generalisations of submodularity)
Research students
James Aaronson (Prof. Green)
Candida Bowtell
Carla Groenland (Prof. Scott)
Hannah Guggiari (Prof. Scott)
Jakub Konieczny (Prof. Green)
Sofia Lindqvist (Prof. Green)
Przemyslaw Mazur (Prof. Green)
Lecture courses
Communication theory (16 lectures, 3rd
year, Dr D. Stirzaker)
Integer programming (16 lectures, 3rd
year, Dr Hauser)
Graph Theory (8 lectures, 2nd
year, Prof McDiarmid)
Graph Theory (16 lectures, 4th
year, Prof Riordan)
Probabilistic Combinatorics (16 lectures, 4th
year, Prof McDiarmid)
Seminar Combinatorial theory (Tuesdays at 2.30 p.m.)
Current periodicals: D, E, J, K, L, N, P, Q, T, Y
UNIVERSITY OF PLYMOUTH School of Computing, Electronics and Mathematics University of Plymouth, Drake
Circus, Plymouth. PL4 8AA. Tel: +44 (0)1752 586888.
http://math-sciences.org/research-groups/research-pure-mathematics
Prof Stephen Huggett* (graph theory, twistor theory).
Research students
Mary Griffiths (Prof. Huggett).
Lecture courses
Optimisation, Networks and Graphs (3rd year, 12 weeks, 6 hours per week of which 3
are on discrete topics).
Seminars
Pure Mathematics Seminar (weekly).
UNIVERSITY OF PORTSMOUTH Department of Mathematics Buckingham Building, Lion Terrace, Portsmouth,
Hampshire PO1 3HE Tel: 023 9284 6367 Fax: 023 9284 6364
http://www.port.ac.uk/departments/academic/maths
Dr A. Makroglou*
Current periodicals: X, Y, b
QUEEN MARY, UNIVERSITY OF LONDON
School of Mathematical Sciences Queen Mary, University of London, Mile End
Road, London E1 4NS. Tel: 0207 975 5440 Fax: 0208 980 9587
https://www.qmul.ac.uk/maths/
Prof David. K. Arrowsmith (graph colourings, percolation theory, interaction models
and knot invariants)
Prof Rosemary A. Bailey (Emerita Professor: 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 (Emeritus Professor: groups and their operands, graphs, codes,
designs, models, orbits and enumeration)
Dr David Ellis (combinatorics, and its interaction with other areas of mathematics -
especially group theory, analysis, geometry and probability theory)
Dr Matt Fayers (representation theory and combinatorics)
Dr Alex Fink (Combinatorics, tropical geometry and matroid theory)
Dr Felix Fischer (mechanism design, optimization, algorithms)
Prof Anthony Hilton (Emeritus Professor: graph theory, design theory, finite set
systems)
Prof Bill Jackson (graph theory, discrete geometry, matroid theory)
Prof Mark Jerrum (computational complexity, probabilistic computation, the
complexity of combinatorial enumeration)
Dr J. Robert Johnson* (graph theory and combinatorics)
Prof Thomas Müller (group theory, combinatorics, analysis)
Prof Thomas Prellberg (lattice statistical mechanics, enumerative and asymptotic
combinatorics)
Prof Leonard H. Soicher (Emeritus professor: algebraic and computational
combinatorics)
Dr Dudley S. Stark (probability and combinatorics)
Dr Mark Walters (probabilistic combinatorics, percolation, extremal problems)
Dr Justin Ward (optimisation, operational research, algorithms)
Prof Robin Whitty (Honorary Research Associate: combinatorics)
Prof Robert A. Wilson (Emeritus Professor: group theory and representation theory,
especially computational aspects)
Researchers
Research students
Natalie Behague (Dr Johnson/Dr Walters)
Rhys Evans (Prof. Soicher)
Scott Kemp (Dr Fink)
Anum Khalid (Prof. Prellberg)
Teerasak Khoploykang (Prof. Jackson)
Anitha Rajkumar (Prof. Jackson)
William Raynaud (Dr Ellis)
Ben Smith (Dr Fink)
Lecture courses
Linear Programming and Games (36 lectures, 2nd year)
Combinatorics (36 lectures, 3rd year)
Coding Theory (36 lectures, 3rd year)
Cryptography (36 lectures, 3rd year)
Random Processes (26 lectures, 3rd year) Advanced combinatorics (24 lectures, M.Sc)
Graphs and Networks (24 lectures, M.Sc)
Seminars Combinatorics study group (Fridays 4:00pm, Dr Ellis and Dr Ward)
https://www.qmul.ac.uk/maths/research/seminars/combinatorics-study-group/
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 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)
Prof 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, algebraic graph 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)
Prof. Mark Wildon (representation theory, group theory, combinatorics)
Visiting Professors Prof Steve Babbage, 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)
Research students
Elizabeth Berners-Lee (cryptography, Prof. Cid)
Alex Davidson (cryptography, Prof. Cid)
Naomi Farley (access control, Prof Crampton and Prof Gutin)
Thyla van der Merwe (cryptography, Prof Paterson)
Bill O’Donovan (representation theory, Dr Wildon)
Laurence O'Toole (DES, MARS, feistel networks)
Sam Scott (cryptography,Prof. Paterson)
Dale Sibborn (cryptography, Prof Paterson)
Joanne Woodage (cryptography, Prof. Paterson)
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)
Dr. T. Coleman (Ramey theory, logic)
R. L. Constable (combinatorics)
Prof K. J. Falconer (combinatorial geometry)
Dr. J. Fraser (analysis and combinatorics)
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 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 E. F. Robertson (combinatorial group theory, combinatorics of semigroup
presentations)
Dr C. M. Roney-Dougal* (finite permutation and matrix groups, computational group
theory, geometric group theory)
Prof N. Ruškuc (combinatorics of words, mappings, permutations: combinatorial
semigroup theory)
Dr. L. Theran (combinatorics, geometry, algorithms)
Dr M. Todd (ergodic theory)
Research Students
Mr. A. Clayton
Miss N. Khalid
Mr. M. McDevitt
Mr. C. Miller
Mr. A. Mordcovich
Mr. G O’Reilly
Mr. C. Russell
Mr. M. Torpey
Mr. W. Wilson
Lecture courses
Combinatorics and Probability (24 lectures, 2nd
year)
Finite mathematics (24 lectures, 3rd
/4th
year, alternate years)
Graph Theory (24 lectures, 3rd
/4th
year, alternate years)
Advanced combinatorics (24 lectdure, 4th
/5th
year, alternate years)
Various courses involving algorithms and complexity at 3rd
/4th
year level.
Seminars Pure Mathematics Colloquium 4pm Thursdays
Algebra and Combinatorics Seminar 4pm Wednesdays
CIRCA Seminar 1pm Thursdays
School of Computer Science North Haugh, St Andrews, Fife KY16 9SX.
Tel: 01334 463253 Fax: 01334 463278
http://www.cs.st-andrews.ac.uk/
Prof Steve A. Linton (computational algebra: systems, algorithms and applications)
Dr. Ruth Hoffmann (graph algorithms)
Dr Alexaander B. Konovalov
Dr Markus 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
Dr Paul Johnson (algebraic geometry, combinatorics)
Dr Jonathan Jordan (probability, random graphs)
Research students
Mark Yarrow (preferential attachment graphs, Dr. Jordan).
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. N. Gill* (permutation groups, homogeneous relational structures, finite
geometries)
Dr. Liam Harris (combinatorial problems)
Dr S. Perkins (coding theory, synchronization, combinatorial puzzles)
Prof D. H. Smith (emeritus professor: coding theory, permutation codes, DNA codes,
frequency assignment)
Research students
Lecture courses
Codes and Information (3rd year, Dr Perkins, Dr Hunt)
Combinatorics and Networks (2nd year, Dr Perkins and Dr Jones)
Knots (4th
year, Dr Jones and Dr Gill)
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)
Lecture courses
Discrete structures (44 lectures, 1st year)
Combinatorics (32 lectures, 3rd
/4th
year, alternate years)
Algebra and codes (32 lectures, 3rd
/4th
year, alternate years)
Current periodicals: F, H, J, M, N, P, R, S, U, V, X, Y, b, d (all electronic).
STRATHCLYDE UNIVERSITY
Department of Computer and Information Sciences Livingstone Tower, 26
Richmond Street, Glasgow G1 1XH. Tel: 0141 548 2934 Fax: 0141 548 4523
http://www.strath.ac.uk/cis/
Dr. David Bevan* (enumerative combinatorics, permutation patterns)
Dr Sergey Kitaev (combinatorics, discrete analysis, graph theory, formal languages)
Prof Einar Steingrimsson (algebraic and enumerative combinatorics)
Honorary Senior Lecturer
Dr. Mark Dukes (combinatorial and discrete mathematics, statistical mechanics,
applied probability)
Research students
Marc Glen (graph theory, formal languages)
Lecture Courses
Combinatorics for Computer Science 1 (1st year)
Combinatorics for Computer Science 2 (2nd
year)
Department of Mathematics and Statistics Livingstone Tower, 26 Richmond Street,
Glasgow G1 1XH. Tel: 0141 548 3804 Fax: 0141 548 3345
http://www.mathstat.strath.ac.uk/
Prof Des Higham (small-world graphs, applications, links to numerical analysis)
UNIVERSITY OF SUSSEX
Department of Mathematics University of Sussex, Brighton, East Sussex BN1 9QH.
Tel: 01273 877345 Fax: 01273 678097
http://www.sussex.ac.uk/maths
Prof J. W. P. Hirschfeld* (finite geometry, algebraic geometry, coding theory)
Research students
Awss Jabbar (finite geometry, Prof. Hirschfeld)
Lecture courses
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)
TEESSIDE UNIVERSITY.
School of Science, Engineering & Design Teesside University, Middlesbrough
TS1 3BX, United Kingdom
Dr. Anna Huber (combinatorics)
Dr. Sven-Ake Wegner (analysis on graphs).
UNIVERSITY COLLEGE LONDON
Department of Mathematics University College London, Gower Street, London
WC1E 6BT. Tel: 020 7679 2839 Fax: 020 7383 5519
http://www.ucl.ac.uk/Mathematics
Prof I. Bárány (Visiting professor: convex geometry, geometry of numbers, theory of
integer programming)
Prof. A. Granville (number theory, combinatorics)
Dr. J. A. Haight (Combinatorics)
Prof M. Laczkovich (real analysis)
Prof D.G. Larman (geometric analysis, combinatorics)
Prof P. McMullen (Emeritus: convexity, regular polytopes)
Prof A. Sokal (combinatorial aspects of mathematical physics)
Dr J. Talbot* (combinatorics, complexity theory)
Department of Economics University College London, Gower Street, London WC1E
6BT Tel: 020 7679 5888 Fax: 020 7916 2775
http://www.ucl.ac.uk/economics/
Prof K. Binmore (Emeritus: game theory)
Department of Computer Science University College London Gower Street 66-72,
WC1E 6EA London, UK
http://www.cs.ucl.ac.uk/home/
Prof. S. Severini (physics of information, combinatorial links)
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
Prof. S. Babbage*
Dr N. Bone
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/
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 Matthias Englert (analysis and design of algorithms and data structures,
approximation algorithms)
Dr. Tom Gur (combinatorics, foundations of computer science)
Dr Ping Hu (extrenal and probabilistic graph theory)
Dr Tamas Hubai (graph limjits and extremal combinatorics)
Dr Marcin Jurdziński (algorithmic game theory, logic in computer science, optimization)
Dr Ranko Lazić (computer science and combinatorics)
Dr. Filip Mazowecki (automata, FO2 and bidon theory)
Prof Mike Paterson (computational complexity, analysis and design of algorithms)
Dr Marcin Pilipczuk (graph algorithms, fixed parameter tractability and exact
computations of NP-hard problems, approximation algorithms)
Dr Alex Tiskin (discrete mathematics, parallel computation, combinatorial optimization)
Warwick Business School Tel. 024 7652 8220 Fax: 024 7652 4539
http://www.wbs.ac.uk
Prof Steve Alpern (game theory, search games)
Prof Jurgen Branke (combinatorial optimisation)
Prof Bo Chen (combinatorial optimisation: game theory)
Dr Vladimir Deineko (combinatorial optimisation, polynomially solvable cases of
NP-hard problems)
Dr Xuan Vinh Doan (combinatorial optimisation)
Dr Nalan Gulpinar (combinatorial optimisation)
Dr Arne Strauss (combinatorial optimisation)
Warwick Mathematics Institute Tel. 024 7652 4661 Fax: 024 7652 4182.
http://www.maths.warwick.ac.uk
Dr Agelos Georgakopoulos (random walks, electrical networks, infinite graphs)
Dr. John Haslegrave (random and extremal graphs)
Dr. Joel Larsson (combinatorics, probability)
Dr Jaehoon Kim (Combinatorics)
Prof Roman Kotecký (Probability; statistical physics; theory of phase transitions)
Prof Daniel Král’ (extremal and probabilistic combinatorics)
Dr. Florian Lehner (Infinite, locally finite graphs; connections between groups and
graphs; games on graphs; random structures and probabilistic methods)
Dr. Hong Liu (extremal combinatorics, Ramsey theory and random graphs)
Prof Vadim Lozin (algorithmic and structural graph theory)
Dr Jonathan Noel (extremal and probabilistic combinatorics)
Prof Oleg Pikhurko* (Extremal combinatorics)
Maryam Sharifzadeh (Extremal combinatorics)
Dr Katherine Staden (extremal combinatorics)
Department of Statistics Tel. 024 7657 4812 Fax: 024 7652 4532
Research Students
Ostap Chervak (extremal combinatorics, graph limits, Prof Pikhurko)
Andrew Collins (Prof Lozin)
Peter Davies (algorithms, Prof Czumaj).
Matthew Fitch (extremal combinatorics, Prof Pikhurko)
Mahdi Noorizadegan (facility location and vehicle routing, Prof Chen & Dr Gulpinar)
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 2017-April 2018 - 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 not aware
of any objection by the author) 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 may well 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.
Aaronson, J.
A counterexample to a strong variant of the Polynomial Freiman-Ruzsa conjecture.
https://arxiv.org/pdf/1902.00353
Aaronson, J.
Functions with large additive energy supported on a Hamming Sphere. Preprint.
https://arxiv.org/pdf/1805.05295
Aaronson, J., Groenland, C. and Johnston, T.
Cyclically covering subspaces in 𝐹2𝑛 . Preprint.
https://arxiv.org/pdf/1903.10613
Abdi, A, Cornejuols, G. and Pashkovich, K.
Ideal Clutters That Do Not Pack. Math. Oper. Res. 43 (2018) 533-553
https://doi.org/10.1287/moor.2017.0871
Abdi, A, Fukusawa, R. and Sanita, L.
Opposite Elements in Clutters. Math. Oper. Res. 43 (2018) 428-459
https://doi.org/10.1287/moor.2017.0864
Abdi, A and Guenin, B.
Packing odd T‐joins with at most two terminals. J. Graph Theory 87 (2018)
587-652.
https://doi.org/10.1002/jgt.22178
https://arxiv.org/pdf/1410.7423
Abdi, A. and Pashkovich, K. Delta Minors, Delta Free Clutters, and Entanglement. SIAM J. Discrete Math. 32
(2018) 1750-1774.
https://doi.org/10.1137/17M1126758
Abdullah, M., Bode, M. and Fountoulakis, N.
Typical distances in a geometric model for complex networks. Internet Math. 1
(2017).
http://dx.doi.org/10.24166/im.13.2017
http://www.internetmathematicsjournal.com/article/2017-typical-distances-in-a-
geometric-model-for-complex-networks
Abdullah, M. and Fountoulakis, N.
A phase transition on the evolution of bootstrap percolation processes on preferential
attachment graphs. Random Struct. Algorithms 52 (2018) 379-418.
https://doi.org/10.1002/rsa.20744
http://web.mat.bham.ac.uk/N.Fountoulakis/PrefPercC72.pdf
AbouEisha, H,. Hussain, S., Lozin, V. V., Monnot, J., Ries, B. and Zamaraev, V.
Upper Domination: Towards a Dichotomy Through Boundary Properties.
Algorithmica 80 (2018) 2799-2917.
http://dx.doi.org/10.1007/s11083-017-9430-7
Abu-Khazneh, A., Barát, J., Pokrovskiy, A. and Szabó, T.
A family of extremal hypergraphs for Ryser's conjecture. J.. Comb. Theory. Ser. A.
161 (2019) 164-177.
https://doi.org/10.1016/j.jcta.2018.07.011
https://arxiv.org/pdf/1605.06361
Acan, H., Burnette, C., Eberhard, S., Schmutz, E. and Thomas, J.
Permutations With Equal Orders. Preprint.
https://arxiv.org/pdf/1809.10912
Adamaszek, A., Czumaj, A., Englert, M. and Räcke, H.
An O(log k)-Competitive Algorithm for Generalized Caching. ACM Trans.
Algorithms 15 (2019) article 6.
https://doi.org/10.1145/3280826
Adamczyk, M., Alzamel, M. Charalampopoulos, P. and Radoszewski, J.
Palindromic Decompositions with Gaps and Errors. Int. J. Found. Comput. Sci. 29
(2018)
https://doi.org/10.1142/S0129054118430050
Addario-Berry, L., Angel, O., Chapuy, G., Fusy, E. and Goldschmidt, C.
Voronoi tessellations in the CRT and continuum random maps of finite excess.
Proceedings of 29th
ACM-SIAM Symposium on Discrete Algorithms.
https://doi.org/10.1137/1.9781611975031.60
http://www.problab.ca/louigi/papers/voronoimaps.pdf
Addario-Berry, L., Dieuleveut, D. and Goldschmidt, C.
Inverting the cut-tree transform. Annales de l'Institut Henri Poincaré (Probabilités et
Statistiques,. to appear
https://arxiv.org/pdf/1606.04825
Addario-Berry, L. Reed, B. A., Scott, A. D. and Wood, D. R. A logarithmic bound for the chromatic number of the associahedron. Preprint.
http://problab.ca/louigi/papers/associahedron.pdf
Addario-Berry, L. and Roberts, M. I.
Robustness of mixing under rough isometry, via bottleneck sequences. J. Stat. Phys,
173 (2018) 845-871.
https://doi.org/10.1007/s10955-017-1917-5
http://arxiv.org/pdf/1610.07874.pdf
Adiprasito, K. A., Bárány, I. and Mustafa, N. H.
Theorems of Carathéodory, Helly, and Tverberg without dimension. SODA 2019
2350-2360.
https://doi.org/10.1137/1.9781611975482.143
https://arxiv.org/pdf/1806.08725
Adler I. and Krause, P, K.
A lower bound on the tree-width of graphs with irrelevant vertices. J. Comb. Theory
Ser. B., to appear.
https://arxiv.org/pdf/1901.04325
Ahlberg, D., Griffiths, S., Janson, S. and Morris, R. D.
Competition in growth and urns. Random Struct. Algorithms 54 (2019) 211-227.
https://doi.org/10.1002/rsa.20779
http://www2.math.uu.se/~svante/papers/sj312.pdf
Ahmad, W., Beguerisse-Diaz, M. and Porter, M. A.
Tie-decay temporal networks in continuous time and eigenvector-based centralities.
Preprint.
https://arxiv.org/pdf/1805.00193
Ai, J., Gutin, G. and Sun, Y.
Arc-disjoint strong spanning subdigraphs in compositions and products of digraphs.
Preprint.
https://arxiv.org/pdf/1812.08809
Aigner-Horev, E., Carmesin, J. and Fröhlich, J.-O.
On the intersection of infinite matroids. Discrete Math. 341 (2018) 1582-1596.
https://doi.org/10.1016/j.disc.2018.02.018
http://web.mat.bham.ac.uk/J.Carmesin/intersection.pdf
Aigner-Horev, E., Conlon, D., Hàn, H., Person, Y. and Schacht, M.
Quasirandomness in hypergraphs. Electron. J. Comb. 25 (2018), P3.34.
http://old.combinatorics.org/ojs/index.php/eljc/article/view/v25i3p34/pdf
Akgün, O,, Gent, I. P., Kitaev, S. and Zantema, H.
Solving computational problems in the theory of word-representable graphs. J.
Integer Seq. 22 (2019) 19.2.5.
https://arxiv.org/pdf/1808.01215
Akrida, E. C., Czyzowicz, J., Gąsieniec, L., Kuszner, L. and Spirakis, P. G.
Temporal flows in Temporal networks. J. Comput. Syst. Sci. 103 (2019) 46-60.
https://doi.org/10.1016/j.jcss.2019.02.003
https://arxiv.org/pdf/1606.01091
Akrida, E. C., Mertzios, G. B., Nikoletseas, S., Raptopoulos, C., Spirakis, P. G.
and Zamaraev, V.
How fast can we reach a target vertex in stochastic temporal graphs?. Preprint.
http://arxiv.org/pdf/1903.03636
Akrida, E. C., Mertzios, G. B. and Spirakis, P. G.
The temporal explorer who returns to the base. CIAC2019, to appear.
https://arxiv.org/pdf/1805.04713
Akrida, E. C., Mertzios, G. B., Spirakis, P. G. and Zamaraev, V.
Temporal Vertex Cover with a Sliding Time Window. ICALP2018.
https://doi.org/10.4230/LIPIcs.ICALP.2018.148
https://arxiv.org/pdf/1802.07103
Alabdullah, A. and Hirschfeld, J. W. P.
A new lower bound for the smallest complete (k, n)-arc in PG(2,q). Des. Codes
Cryptography 87 (2019) 679-683
https://doi.org/10.1007/s10623-018-00592-8
Alabdullah, A. and Hirschfeld, J. W. P.
A new upper bound for the largest complete (k,n)-arc in PG(2,q). Preprint.
Alamro, H, Ayad, L. A. K., Charalampopoulos, P., Iliopoulos, C. S. and Pissis, S.
P.
Longest Common Prefixes with k-Mismatches and Applications. SOFSEM 2018.
Lect. Notes. Comput. Sci. 10706 636-649
https://doi.org/10.1007/978-3-319-73117-9_45
Alatabbi, A., Daykin, J. W., Neerja, M., Smyth, W. F. and Sohel Rahman, M. A
Faster V-order String Comparison Algorithm. Prague Stringology conference
proceedings.
http://www.stringology.org/event/2018/p05.html
Alatabbi, A., Daykin, J. W., Neerja, M., Smyth, W. F. and Sohel Rahman, M.
Applications of V-Order: Suffix Arrays, the Burrows-Wheeler Transform & the FM-
index. WALCOM2019. Lect. Notes. Comput. Sci. 11355 (2019)
https://doi.org/10.1007/978-3-030-10564-8_26
Albert, M.H., Brignall, R., Ruškuc, N. and Vatter, V.
Rationality for subclasses of 321-avoiding permutations. Eur. J, Comb. 78 (2019)
44-72.
https://doi.org/10.1016/j.ejc.2019.01.001
http://users.mct.open.ac.uk/rb8599/papers/av321.pdf
Aldridge, M.
Individual testing is optimal for nonadaptive group testing in the linear regime. IEEE
Trans. Inf. Theory, to appear.
https://arxiv.org/pdf/1801.08590.pdf
Aldridge, M.
Rates of adaptive group testing in the linear regime. Preprint.
https://arxiv.org/pdf/1901.09687
Aldridge, M., Johnson, O, and Scarlett, J.
Performance of Group Testing Algorithms With Near-Constant Tests-per-Item. IEEE
Trans. Inf. Theory 65 (2019), 707-723
https://doi.org/10.1109/TIT.2018.2861772
https://arxiv.org/pdf/1612.07122
Aldridge, M., Johnson, O, and Scarlett, J.
Group testing: an information theory perspective. Preprint.
https://arxiv.org/pdf/1902.06002
Alecu, B., Atminas, A. and Lozin, V. V.
Graph functionality. Preprint.
https://arxiv.org/pdf/1807.01749
Alecu, B., Lozin, V. V., de Werra, D. and Zamaraev, V.
Letter graphs and geometric grid classes of permutations: characterization and
recognition. IWOCA 2017. Lect. Notes. Comput. Sci. 10765 (2018) 195-205.
https://doi.org/10.1007/978-3-319-78825-8_16
https://arxiv.org/pdf/1804.11217
Alecu, B., Lozin, V. V. and Zamaraev, V.
Linear Clique-Width of Bi-complement Reducible Graphs. IWOCA2018. Lect. Notes
Comput. Sci. 10979 (2018) 14-25.
https://doi.org/10.1007/978-3-319-94667-2_2
Aliev, I., Henk, M. and Oertel, T.
Distances to Lattice Points in Knapsack Polyhedra. Preprint.
https://arxiv.org/pdf/1805.04592
Aliev, I., De Loera, J. A., Eisenbrand, F., Oertel, T. and Weismantel, R.
The Support of Integer Optimal Solutions. SIAM J. Optim.28 (2018) 2152-2157.
http://dx.doi.org/10.1137/17M1162792
https://arxiv.org/pdf/1712.08923.pdf
Alikhani, S., Klavžar, S., Lehner, F. and Soltani, S.
Trees with distinguishing index equal distinguishing number plus one. Discuss Math.
Graph Theory., to appear.
http://www.florian-lehner.net/pdf/trees-distinguishing-index.pdf
Allen, P., Böttcher, J., Hladký, J. and Piguet, D.
Packing degenerate graphs greedily1 Electron. Notes Discrete Math. 61 (2017) 45-51.
http://doi.org/10.1016/j.endm.2017.06.019
Allen, P., Böttcher, J., Skokan, J. and Stein, M. J.
Regularity inheritance in pseudorandom graphs. Random Struct. Algorithms, to appear.
https://arxiv.org/pdf/1606.01168
Allen, P., Davies, E. S. and Skokan, J.
Regularity inheritance in hypergraphs. Preprint.
https://arxiv.org/pdf/1901.05955
Allen, P., Koch, C., Parczyk, O. and Person, Y.
Finding tight Hamilton cycles in random hypergraphs faster. LATIN 2018. Lect.
Notes Comput. Sci. 10607 (2018) 28-36.
https://doi.org/10.1007/978-3-319-77404-6_3
http://de.arxiv.org/pdf/1710.08988.pdf
1 A fuller version is under review - https://arxiv.org/pdf/1711.04869
Almirantis, Y., Charalampopoulos, P.,, Gao, J., Iliopoulos, C. S.,, Mohamed, M.,
Pissis, S. P, and Polychronopoulos, D.
On overabundant words and their application to biological sequence analysis,
Theor. Comput. Sci., to appear.
https://doi.org/10.1016/j.tcs.2018.09.011
Alon, N., Hefetz, D., Krivelevich, M. and Tyomkyn, M.
Edge-statistics on large graphs. Preprint.
https://arxiv.org/pdf/1805.06848
Alpern, S. and Lidbetter, T.
Approximate solutions for expanding search games on general networks. Ann. Oper.
Res. 275 (2019) 259-279.
https://doi.org/10.1007/s10479-018-2966-0
Alves, S. R., Dąbrowski, K. K., Faria, L., Klein, S., dos Santos Sousa, U. and
Sau, I.
On the (parameterized) complexity of recognizing well-covered (r,l)-graphs, Theor.
Comput. Sci. 746 (2018) 36-48 https://doi.org/10.1016/j.tcs.2018.06.024
https://arxiv.org/pdf/1705.09177
Alzamel, M., Ayad, L. A. K., Bernardini, G., Grossi, R., Iliopoulos, C. S., Pisanti,
N., Pissis, S. P. and Rosone, G.
Degenerate String Comparison and Applications. WABI2018.
http://dx.doi.org/10.4230/LIPIcs.WABI.2018.21
http://drops.dagstuhl.de/opus/volltexte/2018/9323/pdf/LIPIcs-WABI-2018-21.pdf
Alzamel, M., Charalampopoulos, P., Iliopoulos, C. S. and Pissis, S. P.
How to answer a small batch of RMQs or LCA queries in practice. IWOCA2017. Lect.
Notes Comput. Sci. 10765 (2018)
https://doi.org/10.1007/978-3-319-78825-8_28
https://arxiv.org/pdf/1705.04589
Alzamel, M., Crochemore, M., Iliopoulos, C. S., Kociumaka, T., Kundu, R.,
Radoszewski, J., Rytter, W. and Waleń, T.
How Much Different Are Two Words with Different Shortest Periods. AIAI2018.
IFIP Advances in Information and Communication Technology book series 520
https://doi.org/10.1007/978-3-319-92016-0_16
Alzamel, M., Charalampopoulos, P., Iliopoulos, C. S., Kociumaka, T., Pissis, S.
P., Radoszewski, J. and Straszyński, J.,
Efficient Computation of Sequence Mappability. SPIRE2018, 12-26. Lect. Notes
Comput. Sci. 11147 (2018)
https://doi.org/10.1007/978-3-030-00479-8_2
https://arxiv.org/pdf/1807.11702
Alzamel, M., Crochemore, M., Iliopoulos, C. S., Pissis, S. P., Radoszewski, J.
and Sung, W.-K.
Faster algorithms for 1-mappability of a sequence. COCOA2017. Lect. Notes Comput.
Sci. 10628 (2018) 109-121.
https://doi.org/10.1007/978-3-319-71147-8_8
https://arxiv.org/pdf/1705.04022
Alzamel, M., Charalampopoulos, P., Iliopoulos, C. S., Kociumaka, T.,
Radoszewski, J., Rytter, W., Straszyński, J., Waleń, T. and Zuba, W.
Quasi-Linear-Time Algorithm for Longest Common Circular Factor. Preprint.
https://arxiv.org/pdf/1901.11305
Alzamel, M. Gai, J., Iliopoulos, C. S. and Liu, C.
Efficient Computation of Palindromes in Sequences with Uncertainties. Fundam.
Inform. 163 (2018) 253-266.
http://dx.doi.org/10.3233/FI-2018-1742
Alzamel, M.
[see: Adamczyk, M.]
Amanatidis,G., Christodoulou, G., Fearnley, J., Markakis, E, Psomas, C.-A. and
Vakaliou, E.
An Improved Envy-Free Cake Cutting Protocol for Four Agents. Preprint.
https://arxiv.org/pdf/1807.00317
Amir, A., Shapira, A. and Tyomkyn, M.
Two Erdős--Hajnal-type Theorems in Hypergraphs. Preprint.
https://arxiv.org/pdf/1805.07781
Anabanti, C. S.
Three questions of Bertram on locally maximal sum-free sets. Applicable Algebra in
Engineering, Communication and Computing 30 (2019) 127-134
http://www.bbk.ac.uk/ems/research/pure/copy_of_Preprint29Anabanti.pdf
Anabanti, C. S., Erskine, G. and Hart, S. B.
Groups whose locally maximal product-free sets are complete. Australas. J. Comb. 71
(2018) 544—563.
http://arxiv.org/pdf/1609.09662
Andrade, F. and Severini, S.
Unitary equivalence between the Green's function and Schrödinger approaches for
quantum graphs. Preprint.
https://arxiv.org/pdf/1808.01154
Andrica, D. and Bagdasar, O. D.
Some remarks on a general family of complex polynomials, Appl. Anal. Discrete
Math., to appear.
Andrica, D. and Bagdasar, O. D.
On some results concerning the polygonal polynomials, Carpathian J. Math, to
appear.
Andrica, D. and Bagdasar, O. D.
On cyclotomic polynomial coefficients, Malaysian Journal of Mathematics, to appear.
Andrica, D. and Bagdasar, O. D.
Some remarks on 3-partitions of multisets. Proc. of 2nd IMA TCDM’18, Electron,
Notes Discrete Math. 70 (2018) 1-8.
https://doi.org/10.1016/j.endm.2018.11.001
Angel, O. and Hutchcroft, T. Counterexamples for percolation on unimodular random graphs. Unimodularity in
randomly generated graphs. 11–28, Contemp. Math. 719 11-28, Amer. Math. Soc.,
Providence, RI, 2018.
https://arxiv.org/pdf/1710.03003
Angel, O.
[see: Addario-Berry, L.]
Anitha, T., Gagarin, A. and Rajkumar, R.
The complement of proper power graphs of finite groups. Palestine Journal of
Mathematics 7 (2018) 579-597.
https://arxiv.org/pdf/1601.03683
Araújo, J., Bentz, W. and Cameron, P. J.
Orbits of primitive k-homogenous groups on (n−k)-partitions with applications to
semigroups, Trans. Amer. Math. Soc. 371 (2019) 105-136.
https://doi.org/10.1090/tran/7274
http://www.ams.org/journals/tran/2019-371-01/S0002-9947-2018-07274-9/S0002-
9947-2018-07274-9.pdf
Araújo, J., Bentz, W. and Cameron, P. J.
The existential transversal property: a generalization of homogeneity and its impact
on semigroups. Preprint.
https://arxiv.org/pdf/1808.06085
Araújo, J., Cameron, P. J., Casalo, C. and Matucci, F. Intgrals of Groups. Isr. J. Math., to appear.
https://arxiv.org/pdf/1803.10179
Archibald, B., Dunlop, F., Hoffmann, R.,McCreesh, C., Prosser, P. and Trimble,
J.
Sequential and Parallel Solution-Biased Search for Subgraph Algorithms. CPAIOR
2019, to appear.
http://www.dcs.gla.ac.uk/~ciaran/papers/cpaior2019-sbs-for-subgraphs.pdf
Arratia, R., Barbour, A. D., Ewens, W. J. and Tavare, S.
Simulating the component counts of combinatorial structures. Theoretical Population
Biology 122 (2018) 5-11.
https://doi.org/10.1016/j.tpb.2018.02.002
http://www.damtp.cam.ac.uk/user/st321/CV_&_Publications_files/STpapers-
pdf/ABET2018.pdf
Aru, J., Groenland, C., Johnston, T., Narayanan, B ., Roberts, A. and Scott, A. D.
Exceptional graphs for the random walk. Preprint.
https://arxiv.org/pdf/1805.06277
Asselah, A., Schapira, B. and Sousi, P.
Capacity of the range of random walk on 𝑍𝑑 . Trans. Amer. Math. Soc. 370 (2018)
7627-7645.
https://doi.org/10.1090/tran/7247
http://www.statslab.cam.ac.uk/~ps422/capacity-new.pdf
Atminas, A., Lozin, V. V. and Razgon, I. Graphs without large bicliques and well-quasi-orderability by the induced subgraph
relation. J. Comb. 10 (2019) 327-337.
http://dx.doi.org/10.4310/JOC.2019.v10.n2.a8
Atminas, A., Lozin, V. V. and Zamaraev, V.
Linear Ramsey Numbers. IWOCA 2018, Lect. Notes. Comput. Sci. 10979 (2018) 26-
38,
https://doi.org/10.1007/978-3-319-94667-2_3
Atminas, A. and Zamaraev, V.
On forbidden induced subgraphs for unit disk graphs. Discrete Comput. Geom. 60
(2018) 57-97.
https://doi.org/10.1007/s00454-018-9968-1
https://arxiv.org/pdf/1602.08148v1.pdf
Atminas, A.
[see: Alecu, B.]
Axenovich, M., Goldwasser, J. L., Hansen, R., Lidický, B., Martin, R. R., Offner,
D, Talbot, J. M. and Young, M.
Polychromatic colorings of complete graphs with respect to 1-,2-factors and
Hamiltonian cycles. J. Graph Theory 87 (2018) 660-671.
https://doi.org/10.1002/jgt.22180
http://arxiv.org/pdf/1612.03298
Ayad, L. A. K., Badkobeh, G., Fici, G., Heliou, A. and Pissis, S. P.
Constructing Antidictionaries in Output-Sensitive Space. Preprint.
https://arxiv.org/pdf/1902.04785
Ayad, L. A. K., Charalampopoulos, P., Iliopoulos, C. S., and Pissis, S. P.
Longest Common Prefixes with k-Errors and Applications. SPIRE2018. Lect. Notes
Comput. Sci. 11147 27-41.
https://doi.org/10.1007/978-3-030-00479-8_3
https://arxiv.org/pdf/1801.04425
Ayad, L. A. K., Bernardini, G., Grossi, R. Iliopoulos, C. S., Pisanti, N., Pissis, S.
P. and Rosone, G.
Longest Property-Preserved Common Factor. Preprint.
https://arxiv.org/pdf/1810.02099
Ayad, L. A. K.
[see: Alamro, H, Alzamel, M]
Ayyer, A. and Behrend, R. E.
Factorization theorems for classical group characters, with applications to alternating
sign matrices and plane partitions. J. Comb. Theory Ser. B 165 (2019) 78-105.
https://doi.org/10.1016/j.jcta.2019.01.001
https://arxiv.org/pdf/1804.04514
Bachratý. M., Šiagiová. J. and Širáň, J.
Asymptotically approaching the Moore bound for diameter three by Cayley graphs. J.
Comb. Theory. Ser. B. 134 (2019) 203-217.
https://doi.org/10.1016/j.jctb.2018.06.003
http://de.arxiv.org/pdf/1709.09760.pdf
Backens, M.
A complete dichotomy for complex-valued Holantc. ICALP2018.
http://dx.doi.org/10.4230/LIPIcs.ICALP.2018.12
http://drops.dagstuhl.de/opus/volltexte/2018/9016/pdf/LIPIcs-ICALP-2018-12.pdf
Backens. M. and Goldberg, L. A. Holant clones and the approximability of conservative holant problems. Preprint.
https://arxiv.org/pdf/1811.00817
Badkobeh, G., Fici, G. and Puglisi, S. J.
Algorithms for anti-powers in strings. Inf. Process Lett. 137 (2018) 57-60.
https://doi.org/10.1016/j.ipl.2018.05.003
https://arxiv.org/pdf/1805.10042
Badkobeh, G., Kärkkäinen, J., Puglisi, S. J. and Zhukova, B.
On Suffix Tree Breadth. SPIRE2017. Lect. Notes Comput. Sci. 10508 (2017) 68-73.
https://doi.org/10.1007/978-3-319-67428-5_6
http://research.gold.ac.uk/21677/1/suffix-tree-breadth.pdf
Badkobeh, G. and Ochem, P.
Avoiding conjugacy classes on the 5-letter alphabet. Preprint.
https://arxiv.org/pdf/1811.08231
Badkobeh, G.
[see: Ayad, L. A. K.]
Bagdasar, O. D. and Tatt, R. J.
On some new arithmetic functions involving prime divisors and perfect powers, Proc.
of 2nd IMA TCDM’18, Electron. Notes in Discrete Math, 70 (2018) 9-15.
https://doi.org/10.1016/j.endm.2018.11.002
Bagdasar, O. D. and Bagdasaryan, G.
On an arithmetic triangle of numbers arising from inverses of analytic functions, Proc.
of 2nd IMA TCDM’18, Electron Notes in Discrete Math. 70 (2018) 17-24.
https://doi.org/10.1016/j.endm.2018.11.003
Bagdasar, O. D.
[see: Andrica, D., Bagdasaryan, G.]
Bailey, R. A. Hasse diagrams as a visual aid for linear models and analysis of variance. Preprint.
Bailey, R. A. and Cameron, P. J.
Multi-part balanced incomplete-block designs. Preprint2.
http://arxiv.org/pdf/1803.00006.pdf
Bailey, R. A. and Cameron, P. J.
Multi-part balanced incomplete-block designs. Statistical Papers 60 (2019) 55-76.
http://dx.doi.org/10.1007/s00362-018-01071-x
https://arxiv.org/pdf/1803.00006
Bailey, R. A. and Cameron, P. J.
Substitutes for the non-existent square lattice designs for 36 varieties. Biuletyn Oceny
Odmian 35 (2018), 11–13.
Bailey, R. A., Cameron, P. J., Gavrilyuk, A. L. and Goryainov, S. V.
Equitable partitions of Latin-square graphs. J. Comb. Des. 27 (2019) 142–160.
https://doi.org/10.1002/jcd.21634
https://arxiv.org/pdf/1802.01001.pdf
Bailey, R. A., Cameron, P. J. and Nilsson, H.
Sesqui-arrays, a generalisation of triple arrays. Australas. J. Comb. 71 (2018)
427–451
https://ajc.maths.uq.edu.au/pdf/71/ajc_v71_p427.pdf
Bailey, R. A., Fernandes, C. and Ramos, P.
Sparse designs for estimating variance components of nested random factors. Preprint.
Bailey, R. A. and Uto, N. Balanced semi-Latin rectangles: Properties, existence and constructions for block size
two. Preprint.
Balister, P. N., Balogh, J., Bertuzzo, E., Bollobas, B., Caldarelli, G., Maritan, A.,
Mastrandrea, R., Morris, R. D. and Rinaldo, A.
River landscapes and optimal channel networks. Proceedimgs of the National
Academy of Sciences U.S.A., 115 (2018) 6548—6553.
https://faculty.math.illinois.edu/~jobal/cikk/Balister_PNAS_2018_MS.pdf
Balister, P. N., Barabasi, A.-L., Bollobás, B., Riordan, O. M. and Song, C.
Topological Phase Transitions in Spatial Networks. Preprint.
https://arxiv.org/pdf/1806.10114
Balister, P. N., Bollobás, B.,Gunderson, K., Leader, I. B. and Walters, M. J.
Random geometric graphs and isometries of normed spaces. Trans. Amer. Math. Soc.
370 (2018), 7361-7389
https://doi.org/10.1090/tran/7420
http://www.ams.org/journals/tran/2018-370-10/S0002-9947-2018-07420-7/S0002-
9947-2018-07420-7.pdf
Balister, P. N., Bollobás, B., Lee, J. D., Morris, R. D. and Riordan, O. M.
A note on Linnik's Theorem on quadratic non-residues Arch. Math., to appear.
https://arxiv.org/pdf/1712.07179
Balister, P. N., Bollobás, B., Lee, J. D., and Narayanan, B. P.
2 Non-trivial revision of a paper included last year.
Coalescence on the real line. Trans. Am. Math. Soc. 371 (2019) 1583-1619.
https://doi.org/10.1090/tran/7391
http://www.ams.org/journals/tran/2019-371-03/S0002-9947-2018-07391-3/S0002-
9947-2018-07391-3.pdf
Balister, P. N., Bollobás, B., Lee, J. D., and Narayanan, B. P.
Line percolation. Random Struct. Algorithms 52 (2018) 597-616.
https://doi.org/10.1002/rsa.20755
https://arxiv.org/pdf/1403.6851
Balister, P. N., Bollobás, B., Morris, R. D., Sahasrabudhe, J. and Tiba, M.
The Erdős-Selfridge problem with square-free moduli. Preprint.
https://arxiv.org/pdf/1901.11465
Balister, P. N., Bollobás, B., Morris, R. D., Sahasrabudhe, J. and Tiba, M.
On the Erdős Covering Problem: the density of the uncovered set. Preprint.
https://arxiv.org/pdf/1811.03547
Balister, P. N., Bollobás, B., Morris, R. D., Sahasrabudhe, J. and Tiba, M.
The structure and number of Erdős covering systems. Preprint.
http://arxiv.org/pdf/1904.04806.pdf
Balister, P. N., Bollobás, B. and Narayanan, B. P.
Reconstructing random jigsaws. Multiplex and Multilayer Networks, Oxford
University Press (2018), Chapter 2.
http://dx.doi.org/10.1093/oso/9780198809456.003.0002
https://sites.math.rutgers.edu/~narayanan/pdf/jigsaw_recon.pdf
Balister, P. N., Bollobás, B., Sahasrabudhe, J. and Veremyev, A.
Dense Subgraphs in Random Graphs. Discrete Appl. Math. 260 (2019) 66-74.
https://doi.org/10.1016/j.dam.2019.01.032
https://arxiv.org/pdf/1803.10349
Balister, P. N. and Gerke, S.
The asymptotic number of prefix normal words. Preprint.
https://www.memphis.edu/msci/people/pbalistr/prefixnormal.pdf
Balko, M., Pór, A., Scheucher, M.., Swanepoel, K. J. and Valtr, P.
Almost-equidistant sets. Extended abstract in EuroCG2018.
https://arxiv.org/pdf/1706.06375
Ball, K. M., Ortega-Moreno, O. and Prodromou, M.
Hadamard Matrices and 1-Factorisation of Complete Graphs. Mathematika 65 (2019)
488-499.
https://doi.org/10.1112/S0025579318000566
https://warwick.ac.uk/fac/sci/maths/people/staff/keith_ball/hadamard.pdf
Balla, I., Pokrovskiy, A. and Sudakov, B.
Ramsey Goodness of Bounded Degree Trees. Combin. Probab. Comput. 27 (2018)
289-309.
https://doi.org/10.1017/S0963548317000554
https://arxiv.org/pdf/1611.02688
Balogh, J., Clemen, F. C., Skokan, J. and Wagner, A. Zs.
The Ramsey Number of Fano Plane Versus Tight Path. Preprint.
https://arxiv.org/pdf/1901.07097
Balogh, J., Liu, H. and Montgomery, R. Rainbow spanning trees in properly coloured complete graphs. Discrete Appl. Math.
247 (2018), 97--101.
https://doi.org/10.1016/j.dam.2018.03.066
http://arxiv.org/pdf/1704.07200.pdf
Balogh, J., Liu, H. Sharifzadeh, M. and Treglown, A.
Sharp bound on the number of maximal sum-free subsets of integers. J. Eur. Math.
Soc. 20 (2018) 1885--1911.
http://dx.doi.org/10.4171/JEMS/802.
https://faculty.math.illinois.edu/~jobal/cikk/sharp_max_sumfree.pdf
Balogh, J., McDowell, A., Molla, T. and Mycroft, R.
Triangle-tilings in graphs without large independent sets. Combin. Probab. Comput.
27 (2018) 449--474.
https://doi.org/10.1017/S0963548318000196
http://arxiv.org/pdf/1607.07789
Balogh, J., Narayanan, B. P. and Skokan, J.
The number of hypergraphs without linear cycles. J. Comb. Theory Ser. B 134 (2019)
309-321.
https://doi.org/10.1016/j.jctb.2018.07.003
http://arxiv.org/pdf/1706.01207.pdf
Balogh, J., Treglown, A. and Wagner, A. Zs. Tilings in random perturbed dense graphs. Combin. Probab. Comput. 28 (2019)
159-176
https://doi.org/10.1017/S0963548318000366
https://arxiv.org/pdf/1708.09243
Balogh, J.
[see: Balister, P. N.]
Banaji, M.
Inheritance of oscillation in chemical reaction networks. Applied Mathematics and
Computation 325 (2018) 191-209.
https://doi.org/10.1016/j.amc.2017.12.012
https://arxiv.org/pdf/1706.00684
Banaji, M.
The determinant of the second additive compound of a square matrix: a formula and
applications. Preprint.
https://arxiv.org/pdf/1806.07162
Bang-Jensen, J., Baswaraju, M., Klinkaby, K. Z., Pranabendu, M., Ramanujan,
M. S., Saurabh, S.and Zehavi, M.
Parameterized Algorithms for Survivable Network Design with Uniform Demands.
SODA18 pp 1-18.
https://doi.org/10.1137/1.9781611975031.180
https://epubs.siam.org/doi/pdf/10.1137/1.9781611975031.180
Bang-Jensen, J. and Gutin, G.
Classes of Directed Graphs. Springer Monographs in Mathematics, Springer 2018,
ISBN 978-3-319-71839-2
Bang-Jensen, J. and Gutin, G.
Basic Terminology, Notation and Results. In: Classes of Directed Graphs, Springer
Monographs in Mathematics (2018) 1-34.
Bang-Jensen, J., Gutin, G. and Yeo, A.
Arc-disjoint Strong Spanning Subdigraphs of Semicomplete Compositions. Preprint.
http://de.arxiv.org/pdf/1903.12225.pdf
Barabasi, A.-L.
[see: Balister, P. N.]
Bárány, I., Csóka, E., Károlyi, Gy. and Tóth, G.
Block partitions: an extended view. Acta Math. Hung. 155 (2018) 36–46.
https://doi.org/10.1007/s10474-018-0802-2
https://arxiv.org/pdf/1706.06095
Bárány, I., Fradelizi, M., Goaoc, X., Hubard, A. and Rote, G.
Random polytopes and the wet part for arbitrary probability distributions. Preprint.
https://arxiv.org/pdf/1902.06519.pdf
Bárány, I. and Füredi, Z.
Almost similar configurations. Preprint.
https://arxiv.org/pdf/1805.02072
Bárány, I. , Meshulam, R., Nevo, E. and Tancer, M.
Pach’s selection theorem does not admit a topological Extension. Discrete Comput.
Geom. 60 (2018) 420-429
https://doi.org/10.1007/s00454-018-9998-8
http://arxiv.org/pdf/1610.05053.pdf
Bárány, I., and Sóberon, P.
Tverberg's theorem is 50 years old: a survey. Preprint.
https://arxiv.org/pdf/1712.06119
Bárány, I., and Sóberon, P.
Tverberg plus minus. Discrete Comput. Geom. 60 (2018) 588-598.
https://doi.org/10.1007/s00454-017-9960-1
https://arxiv.org/pdf/1612.05630
Bárány, I.
[see: Adiprasito, K. A.]
Barát, J.
[see: Abu-Khazneh, A.]
Barber, B.
The Namer-Claimer game. Preprint.
https://arxiv.org/pdf/1808.10800
Barber, B., Glock., S., Kühn, D., Lo, A., Montgomery, R. and Osthus, D.
Minimalist designs. Preprint.
https://arxiv.org/pdf/1808.06956
Barbina, S. and Casanovas, E.
Model theory of Steiner triple systems. Preprint.
https://arxiv.org/pdf/1805.06767v2
Barbour, A. D., Luczak, M. J. and Xia, A.
Multivariate approximation in total variation I; equilibrium distributions of Markov
jump processes. Ann. Probab. 46 (2018) 1351-1404
http://dx.doi.org/10.1214/17-AOP1204
https://projecteuclid.org/download/pdfview_1/euclid.aop/1523520019
Barbour, A. D., Luczak, M. J. and Xia, A.
Multivariate approximation in total variation II: discrete normal approximation. Ann.
Probab. 46 (2018) 1405-1440.
http://dx.doi.org/10.1214/17-AOP1205
https://projecteuclid.org/download/pdfview_1/euclid.aop/1523520020
Barbour, A.D., Brightwell, G. R. and Luczak, M. J.
Long-term concentration of measure and cut-off. Preprint.
https://arxiv.org/pdf/1902.00822
Barbour, A. D.
[see: Arratia, R.]
Barhoumi-Andreani, Y., Koch, C. and Liu, H.
Bivariate fluctuations for the number of arithmetic progressions in random sets .
Preprint.
https://arxiv.org/pdf/1902.04176
Barlow, M. T. and Járai, A. A.
Geometry of uniform spanning forest components in high dimensions. Canad. J. Math.
(2018)
https://doi.org/10.4153/CJM-2017-054-x
https://arxiv.org/pdf/1602.01505
Barnetson, K. D,, Burgess, A. C., Enright, J., Howell, J. . Pike, D. A. and Ryan, B.
The Firebreak Problem. Preprint.
https://arxiv.org/pdf/1901.07842
Baswaraju, M.
[see: Bang-Jensen, J.]
Baudier, F. P., Motakis, P., Schlumprecht, T. and Zsák, A.
On the bi-Lipschitz geometry of lamplighter graphs. Preprint.
https://arxiv.org/pdf/1902.07098.pdf
Baur, K. and Martin, P. P.
A generalised Euler-Poincaré formula for associahedra. Bull. Lond. Math. Soc. 51
(2019) 181-192.
https://doi.org/10.1112/blms.12221
https://arxiv.org/pdf/1711.04986
Bause, F., Giscard, P.-L., Kriege, N. M. and Wilson, R. C.
Computing Optimal Assignments in Linear Time for Graph Matching. Preprint.
https://arxiv.org/pdf/1901.10356.pdf
Bays, M. and Breuillard, E.
Projective geometries arising from Elekes-Szabó problems. Preprint.
https://arxiv.org/pdf/1806.03422
Beguerisse-Diaz, M.
[see: Ahmad, W.]
Behague, N. C.
Hypergraph Saturation Irregularities. Electron J. Comb. 25 (2018) P2,11
https://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i2p11/pdf
Behague, N. C.
Semi-perfect 1-Factorizations of the Hypercube. Preprint.
https://arxiv.org/pdf/1811.06389
Behrend, R. E.
[see: Ayyer, A.]
Behrstock, J., Falgas-Ravry, V., Hagen, M. and Susse, T.
Global Structural Properties of Random Graphs. Int. Math. Res. Not. (2018)
1411-1441.
https://doi.org/10.1093/imrn/rnw287
http://umu.diva-portal.org/smash/get/diva2:1176923/FULLTEXT01.pdf
Bell, P.C, Potapov, I. and Semukhin, P.
Decidabllity of the Mortality Problem: from multiplicative matrix equations to linear
recurrence sequences and beyond. Preprint.
http://arxiv.org/pdf/1902.10188.pdf
Benassi, C. and Ueltschi, D.
Loop correlations in random wire models, Preprint.
https://arxiv.org/pdf/1807.06564
Bennett, P, Dudek, A., Lidicky, B. and Pikhurko, O.
Minimizing the number of 5-cycles in graphs with given edge-density. Preprint.
https://arxiv.org/abs/1803.00165
Bentz, W.
[see: Araújo, J.]
Berenbrink, P., Elsässer, R., Friedetzky, T., Kaaser, D., Kling, P. and Radzik, T.
A population protocol for exact majority with O(log (𝑛)5/3)stabilization time and
asymptotically optimal number of states. DISC2018.
https://doi.org/10.4230/LIPIcs.DISC.2018.10
https://arxiv.org/pdf/1805.05157
Berenbrink, P., Elsässer, R., Friedetzky, T., Kaaser, D., Kling, P. and Radzik, T.
Majority & Stabilization in Population Protocols. Preprint.
https://arxiv.org/pdf/1805.04586
Berenbrink, P., Friedetzky, T., Kaaser, D. and Kling, P.
Simple Load Balancing. Preprint.
https://arxiv.org/pdf/1808.05389
Berenbrink, P., Friedetzky, T., Kling, P., Malmann-Trenn, F., Nagel, L. and
Wastell, C.
Self-Stabilizing Balls and Bins in Batches: The Power of Leaky Bins. Algorithmica
80 (2018) 3673–3703
https://doi.org/10.1007/s00453-018-0411-z
Berestycki, N., Lubetzky, E.., Peres, Y. and Sly, A.
Random walks on the random graph. Ann. Probab. 46 (2018), 456-490.
http://dx.doi.org/10.1214/17-AOP1189
https://arxiv.org/pdf/1504.01999
Berestycki, N. and Sengul, B.
Cutoff for conjugacy-invariant random walks on the permutation group. Probab.
Theory. Relat. Fields, to appear.
https://doi.org/10.1007/s00440-018-0844-y
https://arxiv.org/pdf/1410.4800
Bergé, P., Crampton, J., Gutin, G. and Watrigant, R.
The authorization policy existence problem. IEEE Transactions on Dependable and
Secure Computing.
https://arxiv.org/pdf/1612.06191
Berget, A. and Fink, A.
Equivariant K-theory classes of matrix orbit closures. Preprint.
http://arxiv.org/pdf/1904.10047.pdf
Bernardini, G.
[see: Alzamel, M., Ayad, L. A. K.]
Bernshteyn, A., Delcourt, M., Towsner, H. and Tserunyan, A.
A Nonalgorithmic Short Proof of the Containers Theorems for Hypergraphs. Proc.
Am. Math. Soc. 147 (2019) 1739-1749.
https://doi.org/10.1090/proc/14368
http://www.ams.org/journals/proc/2019-147-04/S0002-9939-2019-14368-9/S0002-
9939-2019-14368-9.pdf
Bertuzzo, E.
[see: Balister, P. N.]
Bessenrodt, C., Bowman, C. and Sutton, L.
Kronecker positivity and 2-modular representation theory. Preprint.
http://arxiv.org/pdf/1903.07717.pdf
Bessenrodt, C., Giannelli, E. and Olsson, J. B.
Hook removal operators on the odd Young graph. Algebraic Combinatorics, to appear.
https://arxiv.org/pdf/1711.08908
Betken, C., Döring, H. and Ortgiese, M.
Fluctuations in a general preferential attachment model via Stein's method. Random
Struct. Algorithms, to appear.
https://arxiv.org/pdf/1805.01341
Beullens, W. and Blackburn, S. R.
Practical attacks against the Walnut digital signature scheme, ASIACRYPT 2018, T.
Peyrin and S. Galbraith (Eds). Lect. Notes Comput. Sci. 11272 (2018) 35-61
https://doi.org/10.1007/978-3-030-03326-2_2
https://eprint.iacr.org/2018/318.pdf
Bevan, D.
Intervals of permutation class growth rates. Combinatorica 38 (2018) 279-303
https://doi.org/10.1007/s00493-016-3349-2
https://arxiv.org/pdf/1410.3679
Bevan, D., Brignall, R., Elvey Price, A. and Pantone, J.
A structural characterisation of Av(1324) and new bounds on its growth rate. Eur. J.
Comb., to appear.
https://arxiv.org/pdf/1711.10325
van Bevern, R., Fluschnik, T., Mertzios, G. B., Molter, H., Sorge, M. and Suchy,
O. The parameterized complexity of finding secluded solutions to some classical
optimization problems on graphs. Discr. Opt. 30 (2018) 20-50
https://doi.org/10.1016/j.disopt.2018.05.002
https://arxiv.org/pdf/1606.09000
Bezakova, I., Galanis, A., Goldberg, L. A., Guo, H. and Stefankovic, D.
Approximation via Correlation Decay when Strong Spatial Mixing Fails. SICOMP
2019, to appear.
http://arxiv.org/pdf/1510.09193
Bezakova, I., Galanis, A., Goldberg, L. A. and Stefankovic, D.
Inapproximability of the independent set polynomial in the complex plane.
STOC2018.
https://doi.org/10.1145/3188745.3188788
https://arxiv.org/pdf/1711.00282
Bezakova, I., Galanis, A., Goldberg, L. A. and Stefankovic, D.
The complexity of approximating the matching polynomial in the complex plane.
Preprint.
https://arxiv.org/pdf/1807.04930
Bhattacharya, B. B., Ganguly, S., Lubetzky, E. and Zhao, Y.
Upper tails for arithmetic progressions in a random set. Int. Math. Res. Not. my022.
https://doi.org/10.1093/imrn/rny022
http://arxiv.org/pdf/1605.02994
Bhattacharya, S., Chakrabarty, D., Henzinger, M. and Nanongkai, D. Dynamic Algorithms for Graph Coloring. SODA2018.
https://arxiv.org/pdf/1711.04355
Bhattacharya, S. and Kulkarni, J. An Improved Algorithm for Incremental Cycle Detection and Topological Ordering in
Sparse Graphs. Preprint.
https://arxiv.org/pdf/1810.03491
Bhattacharya, S. and Kulkarni, J.
Deterministically Maintaining a (2+ε)-Approximate Minimum Vertex Cover in O(1/ε2)
Amortized Update Time. SODA19, to appear.
https://arxiv.org/pdf/1805.03498
Biró, P., Kern, W/, Paulusma D. and Wojuteczky, P.
The stable fixtures problem with payments, Games and Economic Behavior 108
(2018) 245-268.
https://doi.org/10.1016/j.geb.2017.02.002
https://arxiv.org/pdf/1508.06420
Bjorkman, B., Cochran, G., Gao, W., Keough, L.,Kirsch, R., Phillipson, M.,
Rorabaugh, D., Smith, H. and Wise, J. k-Foldability of words. Discrete Appl, Math. 259 (2019) 19-30.
https://doi.org/10.1016/j.dam.2018.12.028
https://arxiv.org/pdf/1710.10616
Björnberg, J. Frőhlich, J. and Ueltschi, D.
Quantum spins and random loops on the complete graph. Preprint.
https://arxiv.org/pdf/1811.12834
Björnberg, J. and Ueltschi, D.
Critical temperature of Heisenberg models on regular trees, via random loops. J. Stat.
Phys. 173 (2018) 1369-1385
https://doi.org/10.1007/s10955-018-2154-2
https://arxiv.org/pdf/1803.11430v1
Björnberg, J. and Ueltschi, D.
Critical parameter of random loop model on trees. Ann. Appl. Probab.28 (2018)
2063-2082.
http://dx.doi.org/doi:10.1214/17-AAP1315
https://arxiv.org/pdf/1608.08473
Blackburn, S.R.
Inglenook Shunting Puzzles. Preprint.
https://arxiv.org/pdf/1810.07970
Blackburn, S.R. and Claridge, J.
Finite Field Matrix Channels for Network Coding. IEEE Trans. Inf. Theory.
https://doi.org/10.1109/TIT.2018.2875763
https://arxiv.org/pdf/1601.06037
Blackburn, S.R., Homberger, C. and Winkler, P. M.
The minimum Manhattan distance and minimum jump of permutations. J. Comb.
Theory Ser. A, 161 (2019) 364-386
https://doi.org/10.1016/j.jcta.2018.09.002
https://arxiv.org/pdf/1706.01557
Blackburn, S. R.
[see: Beullens, W.]
Blais, E., Cannone, C. and Gur, T.
Distribution Testing Lower Bounds via Reductions from Communication Complexity.
ACM Trans. Comput. Theory, to appear.
https://www.dcs.warwick.ac.uk/~tomgur/pdf/K-functional.pdf
Blanca, A., Galanis, A., Goldberg, L. A., Stefanković, D.,. Vigoda, E. and Yang,
K.
Sampling in Uniqueness from the Potts and Random-Cluster Models on Random
Regular Graphs. APPROX-RANDOM 2018: 33:1-33:15.
https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.33
https://arxiv.org/pdf/1804.08111
Blanchard, E., Fischer, E., Lachish, O. and Reidl, F.
Longest paths in 2-edge-connected cubic graphs. Preprint.
https://arxiv.org/pdf/1903.02508
Blanché A, Dąbrowski, K. K., Johnson, M. and Paulusma, D.
Hereditary Graph Classes: When the Complexities of Coloring and Clique Cover
Coincide, J. Graph Theory, to appear.
https://arxiv.org/pdf/1607.06757
Bläsius, T., Friedrich, T., Lischeid, J., Meeks, K. and Schirneck, M.
Efficiently Enumerating Hitting Sets of Hypergraphs Arising in Data Profiling.
2019 Proceedings of the Twenty-First Workshop on Algorithm Engineering
and Experiments.
https://doi.org/10.1137/1.9781611975499.11
https://epubs.siam.org/doi/pdf/10.1137/1.9781611975499.11
Bläsius, T., Friedrich, T., Meeks, K. and Schirneck, M.
On the Enumeration of Minimal Hitting Sets in Lexicographical Order. Preprint.
https://arxiv.org/pdf/1805.01310
Blitvić, N. and Fernandez, V.
A Combinatorial Model for Heterogeneous Microbial Growth. Preprint.
https://arxiv.org/pdf/1901.04080.pdf
Bloom, T. F., Chow, S., Gafni, A. and Walker, A.
Additive energy and the metric Poissonian property. Mathematika 64 (2018) 679-700.
https://doi.org/10.1112/S0025579318000207
https://arxiv.org/pdf/1709.02634
Bloom, T. F. and Sisask, O.
Logarithmic bounds for Roth's theorem via almost-periodicity. Preprint.
https://arxiv.org/pdf/1810.12791
Bloom, T. F. and Walker, A.
GCD sums and sum-product estimates. Preprint.
https://arxiv.org/pdf/1806.07849
Boczkowski, L., Peres, Y. and Sousi, P.
Sensitivity of Mixing Times in Eulerian Digraphs. SIAM J. Discrete Math. 32 (2018)
624-655.
https://doi.org/10.1137/16M1073376
Bode, M.
[see: Abdullah, M.]
Bodirsky, M., Bradley-Williams, D., Pinsker, M. and Pongrácz, M.
The Universal Homogenous Binary Tree. Journal of Logic and Computation 28
(2018) 133-163.
https://doi.org/10.1093/logcom/exx043
https://arxiv.org/pdf/1409.2170.pdf
Bodirsky, M., Martin, B., Jonsson, P. and Mottet, A.
Classification transfer for qualitative reasoning problems. Preprint.
https://arxiv.org/pdf/1805.02038
Bodirsky, M., Martin, B. and Mottet, A.
Discrete Temporal Constraint Satisfaction Problems. J. ACM 65 (2018)
https://doi.org/10.1145/3154832
https://arxiv.org/pdf/1503.08572
Bodirsky, M., Martin, B., Mamino, M. and Mottet, A.
The complexity of disjunctive linear Diophantine constraints. Preprint.
https://arxiv.org/pdf/1807.00985
Bodirsky, M., Mottet, M., Olšak, M., Opršal, J., Pinsker, M. and Willard, R.
Topology is relevant (in the infinite-domain dichotomy conjecture for constraint
satisfaction problems). Preprint.
https://arxiv.org/abs/1901.04237
Bodor, B., Cameron, P. J. and Szabó, Cs.
Infinitely many reducts of homogeneous structures. Algebra Univers 79 (2018) 43
https://doi.org/10.1007/s00012-018-0526-8
http://arxiv.org/pdf/1609.07694
de Boeck, M., Paget, R. E. and Wildon, M. R.
Plethysms of symmetric functions and highest weight representations. Preprint.
https://arxiv.org/pdf/1810.03448
Bollobás, B., Jayawardene, C. J. and Rousseau, C. C.
How Ramsey theory can be used to solve Harary's problem for 𝐾2,𝑘. Preprint.
https://arxiv.org/pdf/1901.01552
Bollobás, B. and Riordan, O. M.
Counting dense connected hypergraphs via the probabilistic method. Random Struct.
Algorithms 53 (2018) 185-220
https://doi.org/10.1002/rsa.20762
https://arxiv.org/pdf/1511.04739
Bollobás, B.
[see: Balister, P. N.]
Bonamy, M., Bousquet, N., Feghali, C. and Johnson, M.
On a conjecture of Mohar concerning Kempe equivalence of regular graphs. J. Comb.
Theory Ser. B. 135 (2019) 179-199.
https://doi.org/10.1016/j.jctb.2018.08.002
https://arxiv.org/pdf/1510.06964
Bonamy, M., Bousquet, N. and Perarnau, G.
Frozen (𝛥 + 1)-colourings of bounded degree graphs. Preprint.
https://arxiv.org/pdf/1811.12650
Bonamy, M., Dąbrowski, K. K., Feghali, C., Johnson, M. and Paulusma, D.
Independent Feedback Vertex Set for P5-free Graphs. Algorithmica, to appear.
https://arxiv.org/pdf/1707.09402
Bonamy, M., Dąbrowski, K. K., Johnson, M. and Paulusma, D.
Graph Isomorphism for (𝐻1, 𝐻2)-free Graphs: An Almost Complete Dichotomy.
https://arxiv.org/pdf/1811.12252
Bonamy, M., Dąbrowski, K. K., Johnson, M. and Paulusma, D.
Independent Feedback Vertex Sets for Graphs of Bounded Diameter. Inf. Process.
Lett. 131 (2018) 26-32.
http://www.sciencedirect.com/science/article/pii/S0020019017301989
https://arxiv.org/pdf/1707.09383
Boncompagni, V., Radovanović, M. and Vušković, K.
The structure of (theta, pyramid, 1-wheel, 3-wheel)-free graphs. Journal of Graph
Theory 90 (2019) 591-628
https://doi.org/10.1002/jgt.22415
Bonin, J., Chun, C. and Noble, S. D.
Delta-matroids as subsystems of sequences of Higgs lifts. Preprint.
https://arxiv.org/pdf/1807.01375
Bonin, J., Chun, C. and Noble, S. D.
Excluded 3-minor characterization for vf-safe delta-matroids and ribbon-graphic
delta-matroids. Preprint.
https://arxiv.org/pdf/1807.01376
Bordewich, M. J., Deutschmann, I. M., Fischer, M., Kasbohm, E., Semple, C.,
and Steel, M.
On the information content of discrete phylogenetic characters. J. Math. Biol.77 (2018)
527-544.
https://doi.org/10.1007/s00285-017-1198-2
https://arxiv.org/pdf/1703.04734
Bordewich, M. J., Huber, K. T., Moulton, V. and Semple, C.
Recovering normal networks from shortest inter-taxa distance information. J. Math.
Biol. 77 (2018) 571-594.
https://doi.org/10.1007/s00285-018-1218-x
https://arxiv.org/pdf/1711.08866
Bordewich, M. J. and Semple, C.
A universal tree-based network with the minimum number of reticulations. Discrete
Appl, Math. 250 (2018) 357-362
https://doi.org/10.1016/j.dam.2018.05.010
https://arxiv.org/pdf/1707.08274
Böttcher, J., Han, J., Kohayakawa, Y., Montgomery, R., Parczyk, O. and Person,
Y.
Universality for bounded degree spanning trees in randomly perturbed graphs.
Random Struct. Algorithms, to appear.
https://arxiv.org/pdf/1802.04707
Böttcher, J.
[see: Allen, P.]
Bousquet, N.
[see: Bonamy, M.]
Bourne, D., Cushing, D., Liu, S. , Münch, F. and Peyerimhoff, N.
Ollivier-Ricci idleness functions of graphs. SIAM J. Discrete Math. 32 (2018) 1408–
1424.
https://doi.org/10.1137/17M1134469
http://arxiv.org/pdf/1704.04398
Bowler, N., Carmesin, J. and Christian, R.
Infinite Graphic Matroids Part 1.. Combinatorica 38 (2018) 305-339
https://doi.org/10.1007/s00493-016-3178-3
https://arxiv.org/pdf/1309.3735
Bowler, N., Carmesin, J., Komjáth, P. and Reiher, C. The colouring number of infinite graphs. Combinatorica, to appear.
https://www.dpmms.cam.ac.uk/~jc964/ColouringNumber160903.pdf
Bowler, N., Erde, J.., Heinig, P., Lehner, F. and Pitz, M.
Non-reconstructible locally finite graphs. J. Comb. Theory Ser. B. 133 (2018) 122-152.
https://doi.org/10.1016/j.jctb.2018.04.007
https://arxiv.org/pdf/1611.04370
Bowman, C. D., Enyang, J. and de Visscher, M.
Simple Modules for the Partition Algebra and Monotone Convergence of Kronecker
Coefficients. Int. Math. Res. Not. 2019 . 1059–1097.
https://dx.doi.org/10.1093/imrn/rnx095
https://arxiv.org/pdf/1607.08495
Bowman, C. D., Enyang, J. and de Visscher, M.
The lattice permutation condition for Kronecker tableaux (Extended Abstract).
Preprint.
https://arxiv.org/pdf/1812.09175
Bowman, C. D. and Paget,R. E.
The partition algebra and the plethysm coefficients. Preprint.
https://arxiv.org/pdf/1809.08128
Bowman, C. D. and Paget,R. E.
The uniqueness of plethystic factorisation. Preprint.
http://de.arxiv.org/pdf/1903.11133.pdf
Bowman, C. D.
[see: Bessenrodt, C.]
Bowtell, C. and Mycroft, R.
Classification of maximum hittings by large families. Preprint.
http://arxiv.org/pdf/1810.01707
Boyer, K., Brimkov, B., English, S., Ferrero, D., Keller, A.,Kirsch, R., Phillips, M.
and Reinhart, C.
The zero forcing polynomial of a graph. Discrete Appl. Math. 258 (2019) 35-48.
https://doi.org/10.1016/j.dam.2018.11.033
https://arxiv.org/pdf/1801.08910
Bradley-Williams, D.
[see: Bodirsky, M.]
Bray, J. N., Cai, Q., Cameron, P. J., Spiga, P. and Zhang, H.
The Hall–Paige conjecture, and synchronization for affine and diagonal groups, J.
Algebra, to appear.
https://arxiv.org/pdf/1811.12671
Breda d’Azevedo, A., Catalano, D. and Širáň, J.
Bi-rotary Maps of Negative Prime Characteristic.. Ann. Comb. 23 (2019) 27–50.
https://doi.org/10.1007/s00026-019-00421-2
Brettell, N., Campbell, R., Chun, D., Grace, K. and Whittle, G.
On a Generalization of Spikes. SIAM J. Discrete Math. 33 (2019) 358-372.
https://doi.org/10.1137/18M1182255
https://arxiv.org/pdf/1804.06959
Breuillard, E. and Varjú, P. P.
On the Lehmer conjecture and counting in finite fields. Preprint.
https://arxiv.org/pdf/1810.13363
Breuillard, E.
[see: Bays, M.]
Bridoux, F., Gadouleau, M. and Theyssier, G.
Expansive Automata Networks. Preprint.
https://arxiv.org/pdf/1902.08007
Briggs, K. M., Dawes, J., Járai, A. A. and Middleton, A.
How close is the nearest node in a wireless network? Preprint.
Brightwell, G. R., Fairthorne, M. and Luczak, M. J.
The Supermarket Model with Bounded Queue Lengths in Equilibrium. J. Stat. Phys.
173 (2018) 1149-1194.
http://doi.org/10.1007/s10955-018-2044-7
Brightwell, G. R., House, T. and Luczak, M. J.
Extinction times in the subcritical stochastic SIS logistic epidemic. J. Math. Biol.
77 (2018) 455-493.
https://doi.org/10.1007/s00285-018-1210-5
https://arxiv.org/pdf/1312.7449
Brightwell, G. R.
[see: Barbour, A. D.]
Brignall, R., Choi, H., Jeong, J., and Oum, S.-I.
Deciding whether there are infinitely many prime graphs with forbidden induced
subgraphs. Discrete Appl. Math. 257 (2019), 60-66.
https://doi.org/10.1016/j.dam.2018.10.030
http://users.mct.open.ac.uk/rb8599/papers/2016prime.pdf
Brignall, R., Engen, M. and Vatter, V.
A counterexample regarding labelled-well-quasi-ordering. Graphs. Comb. 34 (2018)
1395-1409.
https://doi.org/10.1007/s00373-018-1962-0
http://users.mct.open.ac.uk/rb8599/papers/lwqo.pdf
Brignall, R., Jelínek, V., Kynčl, J. and Marchant, D.
Zeros of the Möbius function of permutations. Preprint.
https://arxiv.org/pdf/1810.05449
Brignall, R., and Marchant, D.
Intervals of permutations and the principal Möbius function, Preprint.
https://arxiv.org/pdf/1806.10362
Brignall, R., and Sliačan, J.
Combinatorial specifications for juxtapositions of permutation classes. Preprint.
https://arxiv.org/pdf/1902.02705
Brignall, R.
[see: Albert, M. H., Bevan, D.]
Brimkov, B.
[see: Boyer, K.]
Britz, T. and Cameron, P. J.
Codes, chapter in Handbook of the Tutte Polynomial (ed. J. Ellis-Monaghan).
Broutin, N. and Mailler, C.
And/or trees: a local limit point of view. Random Struct. Algorithms 53 (2018) 15-58.
https://doi.org/10.1002/rsa.20758
https://arxiv.org/pdf/1510.06691
Broutin, N. and Sulzbach, H.
A limit field for orthogonal range searches in two-dimensional random point search
trees. Stoch. Proc. Appl, to appear.
https://arxiv.org/pdf/1711.11354
Brown, S., Johnson, O. and Tassi, A.
Reliability of Broadcast Communications Under Sparse Random Linear Network
Coding. IEEE Transactions on Vehicular Technology 67 (2018) 4677-4682
https://doi.org/10.1109/TVT.2018.2790436
https://arxiv.org/pdf/1705.09473.pdf
Bruhn, H., Gellert, L. and Lang, R.
Chromatic index, treewidth and maximum degree. Electron J. Comb. 25 (2018) 2.23
https://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i2p23/pdf
Bruhn, H., Heinlein, M. and Joos, F.
The edge-Erdős-Pósa property. Preprint.
http://arxiv.org/pdf/1809.11038
Bruhn, H., Heinlein, M. and Joos, F.
Long cycles have the edge-Erdős-Pósa property. Combinatorica 39 (2019) 1-36.
https://doi.org/10.1007/s00493-017-3669-x
http://arxiv.org/abs/1607.01903
Bruhn, H., Heinlein, M. and Joos, F.
Frames, A-paths and the Erdős-Pósa property SIAM J. Discrete Math. 32 (2018) 1246-1260.
https://doi.org/10.1137/17M1148542
https://arxiv.org/pdf/1707.02918
Bruhn, H., Joos, F. and Schaudt, O.
Erdos-Posa property for labelled minors: 2-connected minors. Preprint.
https://arxiv.org/pdf/1805.00426
Bruin, H., Terhesiu, D. and Todd, M.
The pressure function for infinite equilibrium measures. Isr. J. Math., to appear.
https://arxiv.org/pdf/1711.05069
Bruin, H., Terhesiu, D. and Todd, M.
Pressure function and limit theorems for almost Anosov flows. Preprint
https://arxiv.org/pdf/1811.08293.pdf
Bryant, D., Herke, S., Maenhaut, B. and Webb, B. S.
On Hamilton Decompositions of Infinite Circulant Graphs. J. Graph Theory, 88 (2018)
434–448.
https://doi.org/10.1002/jgt.22223
http://arxiv.org/pdf/1701.08506
Bucic, M., Kwan, M., Pokrovskiy, A. and Sudakov, B.
On Kahn’s basis conjecture. Preprint.
https://arxiv.org/pdf/1810.07464
Bucic, M., Kwan, M., Pokrovskiy, A. and Sudakov, B.
Halfway to Rota's basis conjecture. Preprint.
https://arxiv.org/pdf/1810.07462
Bucic, M., Kwan, M., Pokrovskiy, A.. Sudakov, B., Tran, T. and Wagner, A. Zs.
Nearly-linear monotone paths in edge-ordered graphs. Preprint.
https://arxiv.org/pdf/1809.01468
Bucic, M., Lidicky, B., Long, J. and Wagner, A. Zs.
Partition problems in high dimensional boxes. J. Comb. Theory. Ser. A. 166 (2019)
315-336.
https://doi.org/10.1016/j.jcta.2019.02.011
https://arxiv.org/pdf/1805.11278
Bukh, B. and Conlon, D.
Rational exponents in extremal graph theory. J. Eur. Math. Soc. 20 (2018)
1747-1757.
http://dx.doi.org/10.1471/JEMS/798
https://arxiv.org/pdf/1506.06406
Bulín, J., Krokhin, A. and Opršal, J.
Algebraic approach to promise constraint satisfaction. Preprint.
http://arxiv.org/pdf/1811.00970
Bulteau, L., Dąbrowski, K. K.,, Fertin, G., Johnson, M., Paulusma, D. and
Vialette, S.
Finding a Small Number of Colourful Components. Preprint.
https://arxiv.org/pdf/1808.03561
Burgess, A. C.
[see: Barnetson, K. D]
Bürger, C., DeBiasio, L., Guggiari, H. and Pitz, M.
Partitioning edge-coloured complete symmetric digraphs into monochromatic
complete subgraphs. Discrete Math, 341(2018) 3134-3140
https://doi.org/10.1016/j.disc.2018.07.025
https://arxiv.org/pdf/1805.01699
Burness, T. C. and Giudici, M.
On the Saxl graph of a permutation group. Math. Proc. Camb. Philos. Soc., to appear.
https://arxiv.org/pdf/1712.03688
Burnette, C.
[see: Acan, H.]
Bustamante, S., Corsten, J., Frankl, N.,Pokrovskiy, A. and Skokan, J.
Partitioning edge-coloured hypergraphs into few monochromatic tight cycles.
Preprint.
https://arxiv.org/pdf/1903.04471
Butkovič, P.
On integer images of max-plus linear mappings. Discrete Appl. Math. 239 (2018)
62-74.
https://doi.org/10.1016/j.dam.2018.01.001
http://web.mat.bham.ac.uk/P.Butkovic/My%20papers/On%20integer%20images%20i
n%20print.pdf
Butti, S. and Živný, S.
Sparsification of Binary CSPs. STACS19, to appear.
https://arxiv.org/pdf/1901.00754
Byszewski, J. and Konieczny, J.
Automatic sequences and generalised polynomials. Canad J. Math., to appear.
https://arxiv.org/pdf/1705.08979
Byszewski, J. and Konieczny, J.
Factors of generalised polynomials and automatic sequences. Indag. Math. 29 (2018)
981-985.
https://doi.org/10.1016/j.indag.2018.03.003
https://arxiv.org/pdf/1802.02533
Cai, J-Y., Guo, H. and Williams, T.
Holographic algorithms beyond matchgates. Inf. Comput. 259 (2018) 102-129.
https://doi.org/10.1016/j.ic.2018.01.002
https://arxiv.org/pdf/1307.7430
Cai, J-Y., Guo, H. and Williams, T.
Clifford gates in the Holant framework. Theor. Comput. Sci. 745 (2018)
163-171.
https://doi.org/10.1016/j.tcs.2018.06.010
https://arxiv.org/pdf/1705.00942
Cai, Q.
[see: Bray, J.N.]
Cai, X. S., Holmgren, C., Janson, S., Johansson, T. and Skerman, F.
Inversions in split trees and conditional Galton-Watson trees. Combin. Probab.
Comput., to appear.
https://arxiv.org/pdf/1709.00216
Cain, A. J., Gray, R. D. and Malheiro, A.
Crystal monoids & crystal bases: rewriting systems and biautomatic structures for
plactic monoids of types An, Bn, Cn, Dn, and G2. J. Comb. Theory Ser. A. 162 (2018)
406-466.
https://doi.org/10.1016/j.jcta.2018.11.010
https://arxiv.org/pdf/1412.7040
Cakiroglu, S. A. and Cameron , P. J.
Optimal BIBD-extended designs. Preprint.
https://arxiv.org/pdf/1902.04496
Caldarelli, G.
[see: Balister, P. N.]
Cambie, S., Girão, A. and Kang, R. J.
VC dimension and a union theorem for set systems. Electron J. Comb., to appear.
https://arxiv.org/pdf/1808.02352
Cameron, P. J., Ellis, D. and Raynaud, W.
Smallest cyclically covering subspaces of 𝔽qn and lower bounds in Isbell’s conjecture.
Preprint.
https://arxiv.org/pdf/1810.03485
Cameron, P. J., Guera, H. and Jurina, Š.
The power graph of a torsion-free group. J. Algebr. Comb. 49 (2019)
83-98.
http://dx.doi.org/10.1007/s10801-018-0819-1
https://arxiv.org/pdf/1705.01586
Cameron, P. J., Lucchini, A. and Roney-Dougal, C. M.
Generating sets of finite groups. Trans. Am. Math. Soc. 370 (2018) 6751-6770.
https://doi.org/10.1090/tran/7248
http://www.ams.org/journals/tran/2018-370-09/S0002-9947-2018-07248-8/S0002-
9947-2018-07248-8.pdf
Cameron, P. J.
[see: Araújo, J., Bailey, R. A., Bodor, B., Bray, J. N., Britz, T., Cakiroglu, S. A.]
Campbell, R., Grace, K., Oxley, J. G. and Whittle, G.
On Density-Critical Matroids. Preprint
https://arxiv.org/pdf/1903.05877
Campbell, R.
[see: Brettell, N.]
Campos, M., Matros, L., Morris, R. D. and Morrison, N.
On the singularity of random symmetric matrices.
http://arxiv.org/pdf/1904.11478.pdf
Canakci, I. and Schroll, S.
Lattice bijections for string modules, snake graphs and the weak Bruhat order.
Preprint.
https://arxiv.org/pdf/1811.06064
Candellero, E. and Teixeira, A. Percolation and isoperimetry on roughly transitive graphs. Annales de l’Institut Henri
Poincaré - Probabilites et Statistiques 54 (2018) 1819-1847.
http://dx.doi.org/10.1214/17-AIHP857
https://arxiv.org/pdf/1507.07765
Candellero, E. and Stauffer, A. Coexistence of competing first passage percolation on hyperbolic graphs. Preprint.
https://arxiv.org/pdf/1810.04593
Candellero, E., Stauffer, A. and Taggi, L.
Abelian oil and water dynamics does not have an absorbing-state phase transition.
Preprint.
https://arxiv.org/pdf/1901.08425
Cannon, S., Levin, D. A. and Stauffer, A.
Polynomial mixing of the edge-flip Markov chain for unbiased dyadic tilings. Combin.
Probab. Comput., to appear.
https://arxiv.org/pdf/1611.03636
Cannone, C. and Gur, T.
An Adaptivity Hierarchy Theorem for Property Testing. Comput. Complexity, to
appear.
https://www.dcs.warwick.ac.uk/~tomgur/pdf/adaptivity_hierarchy.pdf
Cannone, C.
[see: Blais, E.]
Caraceni, A.and Stauffer, A.
Polynomial mixing time of edge flips on quadrangulations. Preprint.
https://arxiv.org/pdf/1809.05092
Carbonnel, C., Cohen, D. A., Cooper, M. C. and Živný, S.
On Singleton Arc Consistency for Natural CSPs Defined by Forbidden Patterns.
Algorithmica 81 (2019) 1699-1727
http://arxiv.org/pdf/1704.06215
Carbonnel, C., Romero, M. and Živný, S.
The complexity of general-valued CSPs seen from the other side. FOCS18.
http://dx.doi.org/10.1109/FOCS.2018.00031
https://arxiv.org/pdf/1710.03148v1
Carlotti, A. and Herman, R.
Uniform Bounds for Non-negativity of the Diffusion Game. Preprint.
https://arxiv.org/pdf/1805.05932
Carmesin, J.
All graphs have tree-decompositions displaying their topological ends. Combinatorica,
to appear.
https://arxiv.org/pdf/1409.6640
Carmesin, J.
Topological Infinite Gammoids, and a New Menger-Type Theorem for Infinite
Graphs. Electron. J. Comb. 25 (2018) P3.38
https://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i3p38/pdf
Carmesin, J., Lehner, F. and Möller, R.
On tree-decompositions of one-ended graphs. Math. Nachr., to appear.
https://arxiv.org/pdf/1706.08330.pdf
Carmesin, J.
[see: Aigner-Horev, E., Bowler, N.]
Carriço, J. A., Crochemore, M., Francisco, A. P, Pissis, S. P., Ribeiro-Gonçalves,
B. and Vaz, C.
Fast phylogenetic inference from typing data. Algorithms for Molecular Biology 13
(2018) 4:1-4:14
https://doi.org/10.1186/s13015-017-0119-7
Casalo, C [see: Araújo, J.]
Casanovas, E.
[see: Barbina, S.]
Castillo-Ramirez, A. and Gadouleau, M.
Cellular Automata and Finite Groups. Natural Computing (2017) 3
https://doi.org/10.1007/s11047-017-9640-3
3 This was accidentally not updated in last year’s Bulletin, apologies.
http://arxiv.org/pdf/1610.00532
Castillo-Ramirez, A. and Gadouleau, M.
Elementary, Finite and Linear vN-Regular Cellular Automata. Inf. Comput., to appear.
https://arxiv.org/pdf/1804.00511
Castillo-Ramirez, A., McInroy, J. and Rehren, F.
Code algebras, axial algebras and VOAs. J. Algebra 518 (2019) 146-176.
https://doi.org/10.1016/j.jalgebra.2018.09.038
https://arxiv.org/pdf/1707.07992
Catalano, D.
[see: Breda d’Azevedo, A.]
Cathain, P., Gillespie, N. I. and Praeger, C. E.
Construction of the Outer Automorphism of S6 via a Complex Hadamard Matrix.
Mathematics in Computer Science 12 (2018) 453-458.
https://arxiv.org/pdf/1805.01273
Cechlárová, K., Klaus, B. and Manlove, D. F.
Pareto optimal matchings of students to courses in the presence of prerequisites. Discr.
Opt. 29 (2018) 174-195
https://doi.org/10.1016/j.disopt.2018.04.004
Cela, E., Deineko, V. and Woeginger, G. J.
New special cases of the Quadratic Assignment Problem with diagonally structured
coefficient matrices. Eur. J. Oper. Res. 267 (2018) 818-834.
https://doi.org/10.1016/j.ejor.2017.12.024
http://arxiv.org/pdf/1609.09796.pdf
Cela, E., Deineko, V. and Woeginger, G. J.
The multi-stripe travelling salesman problem. Annals of Operations Research
259 (2017) 21-34.
https://doi.org/10.1007/s10479-017-2513-4
http://arxiv.org/pdf/1609.09796.pdf
Chakrabarty, D. [see: Bhattacharya, S.]
Chan, L., Grimm, U. and Short, I.
Substitution-based structures with absolutely continuous spectrum. Indag. Math. 29
(2018) 1072-1086.
https://doi.org/10.1016/j.indag.2018.05.009
https://arxiv.org/pdf/1706.05289
Chan, T. F. N., Grzesik, A., Král’, D. and Noel, J. A.
Cycles of length three and four in tournaments. Preprint.
https://arxiv.org/pdf/1902.00572
Chaparro, C., Schroll, S. and Solotar, A.
On the Lie algebra structure of the first Hochschild cohomology of gentle algebras
and Brauer graph algebras. Preprint.
https://arxiv.org/pdf/1811.02211
Chapman, J.
Partition regularity and multiplicatively syndetic sets. Preprint.
https://arxiv.org/pdf/1902.01149
Chapman, J. and Prendiville, S.
On the Ramsey number of the Brauer configuration. Preprint.
http://arxiv.org/pdf/1904.07567.pdf
Chapman R, J., GCHQ PSGroup and Stong, R.
A Functional Equation Composite solution. Amer. Math. Monthly. 125 (2018)
761-762.
Chapman R, J., GCHQ PSGroup, Stong, R. and Tauraso R,
Disappearing Power Series Solution, Amer. Math. Monthly. 125 (2018) 563-565
http://emps.exeter.ac.uk/mathematics/staff/rjchapma/publications#ZI4YTC238fWIK3
r5.99
Chapuy, G. and Perarnau, G.
On the number of coloured triangulations of d-manifolds. Preprint.
https://arxiv.org/pdf/1807.01022
Chapuy, G. and Perarnau, G.
Local convergence and stability of tight bridge-addable graph classes. Can. J. Math.,
(2018) 1-39.
https://doi.org/10.4153/s0008414x18000020
https://arxiv.org/pdf/1609.03974
Chapuy, G. and Perarnau, G.
Connectivity in bridge-addable graph classes: The McDiarmid–Steger–Welsh
conjecture. J. Comb. Theory. Ser. B. 136 (2019) 44-71.
https://doi.org/10.1016/j.jctb.2018.09.004
http://arxiv.org/pdf/1504.06344v1.pdf
Chapuy, G.
[see: Addario-Berry, L.]
Charalampopoulos, P., Crochemore, M, Fici, G., Mercas, R. and Pissis, S. P.
Alignment-Free Sequence Comparison Using Absent Words. Inf. Comput. 262 (2018)
57-68.
https://doi.org/10.1016/j.ic.2018.06.002
https://arxiv.org/pdf/1806.02718
Charalampopoulos, P., Crochemore, M, Iliopoulos, C. S., Kociumaka, T., Pissis,
S. P., Radoszewski, J., Rytter, W., and Walen, T.
Efficient Enumeration of Non-Equivalent Squares in Partial Words with Few Holes.
J. Comb. Optim. 37 (2019) 501-522.
https://doi.org/10.1007/s10878-018-0300-z
Charalampopoulos, P., Crochemore, M, Iliopoulos, C. S., Kociumaka, T., Pissis,
S. P., Radoszewski, J., Rytter, W., and Walen, T.
Linear-Time Algorithm for Long LCF with k Mismatches. CPM2018.
http://drops.dagstuhl.de/opus/volltexte/2018/8686/ .
https://arxiv.org/abs/1802.06369
Charalampopoulos, P., Crochemore, M, and Pissis, S. P.
On Extended Special Factors of a Word. SPIRE2018. Lect. Notes Comput. Sci. 11147
(2018) 131-138.
https://doi.org/10.1007/978-3-030-00479-8_11
Charalampopoulos, P., Gawrychowski, P., Mozes, S. and Weizmann, O. Almost Optimal Distance Oracles for Planar Graphs, STOC2019, to appear.
https://arxiv.org/pdf/1811.01551
Charalampopoulos, P., Iliopoulos, C. S., Liu, C. and Pissis, S. P.
Property Suffix Array with Applications. LATIN 2018. Lect. Notes Comput.
Sci.10807 (2018) 290-302.
https://doi.org/10.1007/978-3-319-77404-6_22
Charalampopouloss, P., Iliopoulos, C. S., Pissis, S. P. and Radoszewski, J.
On-Line Weighted Pattern Matching. Inf. Comput., to appear.
Charalampopoulos, P., Mozes, S. and Tebeka, B.
Exact Distance Oracles for Planar Graphs with Failing Vertices. SODA 2019 2110-
2123
https://doi.org/10.1137/1.9781611975482.127
https://arxiv.org/pdf/1807.05968
Charalampopoulos, P.
[see: Adamczyk, M., Alamro, H., Almirantis, Y., Alzamel, M., Ayad, L. A. K.]
Chen, S., Delcourt, M. Moitra, A.,Perarnau, G. and Postle, L.
Improved Bounds for Randomly Sampling Colorings via Linear Programming.
Preprint.
https://arxiv.org/pdf/1810.12980
Chen, Z., Galanis, A., Goldberg, L .A., Perkins, W., Stewart, J. and Vigoda, E.
Markov chains for the hard-core model via polymer models. Preprint.
https://arxiv.org/pdf/1901.06653
Cheon, G.-S., Jung, J.-H., Kitaev, S. and Mojallal, S. A.
Riordan graphs II: Spectral properties. Linear Algebra Appl.575 (2019) 174-215.
https://doi.org/10.1016/j.laa.2019.04.011
https://arxiv.org/pdf/1801.07021
Cheon, G.-S., Kim, J., Kim, M. and Kitaev, S. On k-1 1-representable graphs. J. Comb., to appear.
https://arxiv.org/pdf/1803.01055
Chervak, O., Pikhurko, O. and Staden, K.
Minimum number of additive tuples in groups of prime order. Electron J. Comb. 26
(2019) P1.30.
https://www.combinatorics.org/ojs/index.php/eljc/article/view/v26i1p30/7790
Chetlur, V. V., Dettmann, C. P. and Dhillon, H. S.
Characterizing shortest paths in road systems modeled as Manhattan Poisson line
processes. Preprint.
https://arxiv.org/pdf/1811.11332
Chiesa, A., Forbes, M. A., Gur, T. and Spooner, N.
Spatial Isolation Implies Zero Knowledge Even in a Quantum World. FOCS2018.
https://www.dcs.warwick.ac.uk/~tomgur/pdf/zk-star.pdf
Chin, W. H., Dettmann, C. P. and Pratt, P.
Temporal connectivity in finite networks with non-uniform measures, Phys. Rev. E
98 (2018) 052310
https://doi.org/10.1103/PhysRevE.98.052310
https://arxiv.org/pdf/1807.10617
Choromanski, K., Falik, D., Liebenau, A., Patel, V. and Pilipczuk, M.
Excluding hooks and their complements. Electron. J. Comb. 25 (2018) P3.27.
https://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i3p27/pdf
Choi, H.
[see: Brignall, R.]
Chow, S.
Bohr sets and multiplicative diophantine approximation. Duke Math. J. 167 (2018)
1623-1642.
http://dx.doi.org/10.1215/00127094-2018-0001
https://arxiv.org/pdf/1703.07016
Chow, S., Lindqvist, S. and Prendiville, S.
Rado's criterion over squares and higher powers. Preprint.
https://arxiv.org/pdf/1806.05002
Chow, S. and Rimanic, L.
Lonely runners in function fields. Mathematika, to appear.
https://arxiv.org/pdf/1711.01207
Chow, S.
[see: Bloom, T. F.]
Christodoulou, G.
[see: Amanatidis, G.]
Chrobak, M., Costello, K. P., Gąsieniec, L. and Kowalski, D. R.
Information gathering in ad-hoc radio networks with tree topology. Inf. Comput. 258
(2018) 1-27
https://doi.org/10.1016/j.ic.2017.11.003
Chudnovsky, M., Fox, J., Scott, A. D.. Seymour, P. D. and Spirkl, S.
Towards Erdős-Hajnal for graphs with no 5-hole. Combinatorica., to appear.
https://people.maths.ox.ac.uk/scott/Papers/c5free.pdf
Chudnovsky, M., Liu, C.-H., Schaudt, O, Spirkl, S., Trotignon, N. and Vušković.
K.
Triangle-free graphs that do not contain an induced subdivision of 𝐾4 are 3-colorable.
J. Graph Theory, to appear.
https://arxiv.org/pdf/1704.08104
Chudnovsky, M., Lo, I., Maffray, F., Trotignon, N. and Vušković. K.
Coloring square-free Berge graphs. J. Comb. Theory, Ser. B 135 (2019) 96-128
https://doi.org/10.1016/j.jctb.2018.07.010
Chudnovsky, M., Scott, A. D. and Seymour, P. D.
Induced subgraphs of graphs with large chromatic number. XII. Distant stars. J.
Graph Theory. to appear
https://people.maths.ox.ac.uk/scott/Papers/caterpillars.pdf
Chudnovsky, M., Scott, A. D. and Seymour, P. D.
Induced subgraphs of graphs with large chromatic number. XI. Orientations, Eur. J.
Comb. 76 (2019) 53-61.
https://doi.org/10.1016/j.ejc.2018.09.003
https://people.maths.ox.ac.uk/scott/Papers/orientations.pdf
Chudnovsky, M., Scott, A. D. and Seymour, P. D.
Disjoint paths in unions of tournaments. J. Combinatorial Theory, Series B 135
(2019), 238-255
https://doi.org/10.1016/j.jctb.2018.08.007
https://people.maths.ox.ac.uk/scott/Papers/disjointpaths2.pdf
Chudnovsky, M., Scott, A. D. and Seymour, P. D.
Detecting a long hole. Preprint.
https://web.math.princeton.edu/~pds/papers/longoddholetest/paper.pdf
Chudnovsky, M., Scott, A. D.. Seymour, P. D. and Spirkl, S.
Detecting an odd hole. Preprint.
https://people.maths.ox.ac.uk/scott/Papers/detectingodd.pdf
Chudnovsky, M., Scott, A. D.. Seymour, P. D. and Spirkl, S.
Concatenating bipartite graphs. Preprint.
https://people.maths.ox.ac.uk/scott/Papers/concatenating.pdf
Chudnovsky, M., Scott, A. D.. Seymour, P. D. and Spirkl, S.
Proof of the Kalai-Meshulam Conjecture. Preprint.
https://people.maths.ox.ac.uk/scott/Papers/kalaimeshulam.pdf
Chudnovsky, M., Scott, A. D.. Seymour, P. D. and Spirkl, S.
Trees and linear anticomplete pairs. Preprint.
Chudnovsky, M., Scott, A. D.. Seymour, P. D. and Spirkl, S.
Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes., J.
Comb. Theory Ser. B, to appear
https://people.maths.ox.ac.uk/scott/Papers/longer.pdf
Chun, C., Chun, D., Moss, T. and Noble, S. D.
The e-exchange basis graph and matroid connectedness. Discrete Math. 342 (2019)
723-725.
https://doi.org/10.1016/j.disc.2018.10.045
Chun, C., Moffatt, I., Noble, S. D. and Rueckriemen, R.
Matroids, delta-matroids and embedded graphs. J. Comb. Theory Ser. A., to appear.
https://arxiv.org/pdf/1403.0920
Chun, C., Moffatt, I., Noble, S. D. and Rueckriemen, R.
On the interplay between embedded graphs and delta-matroids. Proc. Lond. Math.
Soc., to appear.
https://pure.royalholloway.ac.uk/portal/files/31069593/interplay_final_v1.pdf
Chun, C..
[see: Bonin, J.]
Chun, D.
[see: Brettell, N., Chun, C.]
Ciobanu, L., Elder, M. and Ferov, M.
Applications of L systems to group theory. Int. J. Algebra Comput. 28 (2018)
306-329.
https://doi.org/10.1142/S0218196718500145
https://arxiv.org/pdf/1705.02809
Ciobanu, L. and Kolpakov, I.
Free subgroups of free products and combinatorial hypermaps. Discrete Math. 342
(2019) 1415-1433.
https://doi.org/10.1016/j.disc.2019.01.014
https://arxiv.org/pdf/1708.03842
Clare, A. and Daykin, J. W.
Enhanced string factoring from alphabet orderings. Inf. Process Lett. 143 (2019) 4-7.
https://doi.org/10.1016/j.ipl.2018.10.011
https://arxiv.org/pdf/1806.05942
Claridge, J.
[see: Blackburn, S. R.]
Clark, B., Grace, K., Oxley, J. G. and van Zwam, S. H. M.
On the Highly Connected Dyadic, Near-Regular, and Sixth-Root-of-Unity Matroids.
Preprint.
https://arxiv.org/pdf/1903.04910
Clayton, A. and Ruškuc, N.
On the number of subsemigroups of direct products involving the free monogenic
semigroup. J. Aust. Math. Soc., to appear.
https://arxiv.org/pdf/1709.08916
Clemen, F. C.
[see; Balogh, J.]
Clemens, D., Jenssen, M., Kohayakawa, Y., Morrison, N., Mota, G. O., Reding,
D. and Roberts, B.
The size-Ramsey number of powers of paths, J. Graph Theory, to appear.
https://arxiv.org/pdf/1707.04297
Clifford, R., Kociumaka, T. and Porat, E.
The streaming k-mismatch problem. SODA2019 1106-1125.
https://doi.org/10.1137/1.9781611975482.68
https://arxiv.org/pdf/1708.05223
Clifford, R., Green Larsen, K., Grønlund, A., and Starikovskaya, T.
Upper and lower bounds for dynamic data structures on strings. STACS2018
22:1-22:14.
https://doi.org/10.4230/LIPIcs.STACS.2018.22
https://arxiv.org/pdf/1802.06545
Clinch, K. and Kitson, D.
Constructing isostatic frameworks for the 𝑙∞ plane. Preprint.
https://arxiv.org/pdf/1807.01050
Cochefert, M., Couturier, J.-F., Golovach, P. A., Kratsch, D., Paulusma, D. and
Stewart, A.
Computing square roots of graphs with low maximum degree. Discrete Appl.
Math.248 (2018) 93-101.
https://doi.org/10.1016/j.dam.2017.04.041
http://arxiv.org/pdf/1608.06142
Cochran, G. [see: Bjorkman, B.]
Codish, M., Miller, A., Prosser, P. and Stuckey, P. J.
Constraints for symmetry breaking in graph representation. Constraints 24 (2019)
1-24.
https://doi.org/10.1007/s10601-018-9294-5
Cohen, D. A., Cooper, M. C., Jeavons, P. G. and Živný, S.
Binary Constraint Satisfaction Problems Defined by Excluded Topological Minors.
Inf. Comput. 264 (2019) 12-31.
https://doi.org/10.1016/j.ic.2018.09.013
http://arxiv.org/pdf/1608.05358
Cohen, D. A.
[see: Carbonnel, C.]
Cohen-Addad, V., Kanade, V. and Mallmann-Trenn, F.
Clustering Redemption--Beyond the Impossibility of Kleinberg's Axioms. NIPS2018.
http://www.cs.ox.ac.uk/people/varun.kanade/docs/axiomatic-nips2018.pdf
Cohen-Addad, V., Kanade, V., Mallmann-Trenn, F. and Mathieu, C.
Hierarchical Clustering: Objective Functions and Algorithms. SOD|A2018
https://doi.org/10.1137/1.9781611975031.26
https://arxiv.org/pdf/1704.02147.pdf
Coja-Oghlan, A., Efthymiou, C. and Jaafari, N.
Local Convergence of Random Graph Colorings. Combinatorica 38 (2018) 341-380
https://doi.org/10.1007/s00493-016-3394-x
https://arxiv.org/pdf/1501.06301
Coja-Oghlan, A. and Perkins, W.
Bethe states of random factor graphs. Commun, Math. Phys. 366 (2019) 173-201.
https://doi.org/10.1007/s00220-019-03387-7
https://arxiv.org/pdf/1709.03827
Coleman, T., Evans, D. M. and Gray, R. D.
Permutation monoids and MB-homogeneous structures. Eur. J. Comb., to appear.
https://arxiv.org/pdf/1802.04166.pdf
Coleman, T. Two Fraïssé-style theorems for homomorphism-homogeneous relational structures.
Preprint.
https://arxiv.org/pdf/1812.01934
Collins, A., Foniok, J., Korpelainen, N., Lozin, V. V. and Zamaraev, V.
Infinitely many minimal classes of graphs of unbounded clique-width. Discrete Appl.
Math. 248 (2018) 145-152.
https://doi.org/10.1016/j.dam.2017.02.012
Condon, P., Diaz, A. E., Kim, J., Kühn, D. and Osthus, D.
Resilient degree sequences with respect to Hamilton cycles and matchings in random
graphs. Preprint.
https://arxiv.org/pdf/1810.12433.pdf
Condon, P., Diaz, A. E., Girão, A., Kühn, D. and Osthus, D.
Dirac’s theorem for random regular graphs. Preprint.
http://web.mat.bham.ac.uk/~axe673/regular_resilience_arxiv.pdf
Condon, P., Kim, J., Kühn, D. and Osthus, D.
A bandwidth theorem for approximate decompositions. Proc. Lond. Math. Soc., to
appear.
https://arxiv.org/abs/1712.04562
Conlon, D.
Monochromatic combinatorial lines of length three. Preprint.
http://people.maths.ox.ac.uk/~conlond/Hales-Jewett.pdf
Conlon, D.
The Ramsey number of books. Preprint.
http://people.maths.ox.ac.uk/~conlond/Books.pdf
Conlon, D.
Hypergraph expanders from Cayley graphs. Isr. J. Math., to appear.
https://arxiv.org/pdf/1709.10006
Conlon, D. and Fox, J.
Lines in Euclidean Ramsey theory. Discrete Comput. Geom, (2018)
https://doi.org/10.1007/s00454-018-9980-5
http://people.maths.ox.ac.uk/~conlond/euclideanramsey.pdf
Conlon, D., Fox, J., Grinshpun, A. and He, X. Online Ramsey numbers and the Subgraph Query Problem. To appear in Lovász 70
volume.
http://people.maths.ox.ac.uk/~conlond/OnlineRamsey.pdf
Conlon, D., Fox, J., Kwan, M. and Sudakov, B.
Hypergraph cuts above the average. Isr. J. Math., to appear.
https://arxiv.org/pdf/1803.08462
Conlon, D., Fox, J. and Sudakov, B.
Tower-type bounds for unavoidable patterns in words, Trans. Amer. Math. Soc., to
appear.
https://arxiv.org/pdf/1704.03479
Conlon, D., Fox, J. and Sudakov, B.
Independent arithmetic progressions. Preprint.
https://arxiv.org/pdf/1901.05084
Conlon, D., Janzer, O. and Lee, J.
More on the extremal number of subdivisions. Preprint.
https://arxiv.org/pdf/1903.10631
Conlon, D. and Kamčev, N.
Intervals in the Hales-Jewett theorem. Eur. J. Comb., to appear.
http://people.maths.ox.ac.uk/~conlond/Intervals.pdf
Conlon, D., Kim, J. H.. Lee, C. and Lee, J.
Some advances on Sidorenko's conjecture J. Lond Math. Soc. 98 (2018) 593-608.
https://doi.org/10.1112/jlms.12142
http://people.maths.ox.ac.uk/~conlond/Sidorenko2.pdf
Conlon, D. and Lee, J.
Sidorenko's conjecture for blow-ups. Preprint.
http://people.maths.ox.ac.uk/~conlond/Holder.pdf
Conlon, D. and Lee, J.
On the extremal number of subdivisions. Int. Math. Res. Not., to appear.
http://people.maths.ox.ac.uk/~conlond/Subdivisions.pdf
Conlon, D., Tidor, J. and Zhao, Y.
Hypergraph expanders of all uniformities from Cayley graphs. Preprint.
http://people.maths.ox.ac.uk/~conlond/hypergraphexpanders2.pdf
Conlon, D.
[see: Aigner-Horev, E., Bukh, B.]
Connelly, R., Gortler, S. and Theran, L Rigidity for sticky disks. Preprint.
https://arxiv.org/pdf/1809.02006
Connelly, R., Gortler, S. and Theran, L Generically globally rigid graphs have generic universally rigid frameworks.
Combinatorica, to appear.
https://arxiv.org/pdf/1604.07475
Connelly, R. and Nixon, A.
Tensegrity. In: Handbook of Geometric Constraint Systems Principles, 2018, CRC
Press.
Cooley, O., Kang, M. and Koch, C.
The size of the giant high-order component in random hypergraphs. Random Struct.
Algorithms 53 (2018) 238-288.
https://doi.org/10.1002/rsa.20761
https://arxiv.org/pdf/1803.02809
Cooley, O., Kapetanopoulos, T. and Makai, T.
The sharp threshold for jigsaw percolation in random graphs. Preprint.
https://arxiv.org/pdf/1809.01907
Coon, J. P,, Dettmann, C. P. and Georgiou, O.
Entropy of Spatial Network Ensembles. Phys. Rev. E 97 (2018) 042319.
http://dx.doi.org/10.1103/PhysRevE.97.042319
https://arxiv.org/pdf/1707.01901.pdf
Cooper, C., Dyer, M. E., Frieze, A. M. and Rivera, N.
Discordant voting processes on finite graphs. SIAM J. Discrete Math. 32 (2018)
2398-2420.
https://doi.org/10.1137/16M1105979
https://arxiv.org/pdf/1604.06884
Cooper, C., Frieze, A. M., and Pegden, W.
On the cover time of dense graphs. Preprint.
https://arxiv.org/pdf/1810.04772
Cooper, C., Frieze, A. M., and Pegden, W.
On the rank of a random binary matrix. SODA 2019 946-955
https://doi.org/10.1137/1.9781611975482.58
https://arxiv.org/pdf/1806.04988
Cooper, C., McDowell, A., Radzik, T., Rivera, N. and Shiraga, T.
Dispersion processes. Random Struct. Algorithms 53 (2018) 561-585
https://doi.org/10.1002/rsa.20822
https://arxiv.org/pdf/1712.03389
Cooper, C. and Rivera, N.
Threshold behaviour of discordant voting on the complete graph. J. Discrete
Algorithms 50 (2018) 10-22.
https://doi.org/10.1016/j.jda.2018.07.001
Cooper, J. W., Grzesik, A. and Král’, D.
Optimal-size clique transversals in chordal graphs, J. Graph Theory 89 (2018)
479-493.
https://doi.org/10.1002/jgt.22362
https://arxiv.org/pdf/1601.05305
Cooper, J. W., Král’, D. and Martins, T.
Finitely forcible graph limits are universal. Adv. Math. 340 (2018), 819-854.
https://doi.org/10.1016/j.aim.2018.10.019
https://arxiv.org/pdf/1506.02340
Cooper, M. C.
[see: Carbonnel, C., Cohen, D. A.]
Corcoran, P. and Gagarin, A.
Multiple domination models for placement of electric vehicle charging stations
in road networks. Comput. Oper. Res. 96 (2018) 69-79. http://dx.doi.org/10.1016/j.cor.2018.03.014
https://arxiv.org/pdf/1710.01294
Cornejuols, G.
[see: Abdi, A.]
Corsten, J.
A note on the grid Ramsey problem. Preprint,
https://arxiv.org/pdf/1709.09658
Corsten, J., DeBiasio, L., Lamaison, A. and Lang, R.
Upper density of monochromatic infinite paths. Preprint.
https://arxiv.org/pdf/1808.03006
Corsten, J.
[see: Bustamante, S.]
Costello, K. P.
[see: Chrobak, M.]
Coulson, M., Gaunt, R. and Reinert, G.
Compound Poisson approximation of subgraph counts in stochastic block models
with multiple edges. Adv. Appl. Probab. 50 (2018) 759-782.
https://doi.org/10.1017/apr.2018.35
https://arxiv.org/pdf/1710.06341
Coulson, M. and Perarnau, G.
Rainbow matchings in Dirac bipartite graphs.Random Struct. Algorithms, to appear.
https://arxiv.org/pdf/1711.02916
Coulson, M. and Perarnau, G.
A Rainbow Dirac's Theorem. Preprint.
https://arxiv.org/pdf/1809.06392
Couturier, J.-F.
[see: Cochefert, M.]
Crampton, J.
[see: Bergé, P.]
Crane, E.
Steady state clusters and the Rath-Toth mean field forest fire model. Preprint.
https://arxiv.org/pdf/1809.03462
Crane, E., Rath, B. and Yeo, D.
Age evolution in the mean field forest fire model via multitype branching processes.
Preprint.
https://arxiv.org/pdf/1811.07981
Crochemore, M. and Rosso, L. M. S.
Cartesian trees and Lyndon trees. Theor. Comput. Sci. , to appear.
https://arxiv.org/pdf/1712.08749
Crochemore, M. [see: Alzamel, M. Carriço, J. A., Charalampopoulos, P.]
Cruickshank, J., Guler, H., Jackson, B. and Nixon, A.
Rigidity of linearly-constrained frameworks. Int. Math. Res. Not. (2018) rmy170.
https://doi.org/10.1093/imrn/rny170
https://arxiv.org/pdf/1804.00411
Cruickshank, J., Nixon, A. and Power, S. C.
The rigidity of a partially triangulated torus. Proc. Lond. Math. Soc., to appear.
https://arxiv.org/pdf/1509.00711
Cryan, M. E., Guo, H. and Mousa, H.
Modified log-Sobolev inequalities for strongly log-concave distributions. Preprint.
http://de.arxiv.org/pdf/1903.06081.pdf
Cseh, A., Irving, R. W. and Manlove, D. F.
The Stable Roommates problem with short lists. Theory Comput. Sys. 63 (2019)
128–149
https://doi.org/10.1007/s00224-017-9810-9
https://arxiv.org/pdf/1605.04609
Csikos, M., Kupavskii, A. and Mustafa, N. H.
Optimal Bounds on the VC-dimension. Preprint.
https://arxiv.org/pdf/1807.07924
Csóka, E.
[see: Bárány, I.]
Cushing, D., Kangaslampi, R., Lipiäinen, V., Lin, S., Lu, L and Stagg, G. W.
The Graph Curvature Calculator and the curvatures of cubic graphs. Communications
in Analysis and Geometry, to appear.
https://arxiv.org/pdf/1712.03033
Cushing, D., Kamtue, S., Koolen, J., Liu, S., Münch, F. and Peyerimhoff, N.
Rigidity of the Bonnet-Myers inequality for graphs with respect to Ollivier Ricci
curvature. Preprint.
https://arxiv.org/pdf/1807.02384
Cushing, D., Liu, S., Münch, F. and Peyerimhoff, N.
Curvature calculations for antitrees. To appear in: Analysis and geometry on graphs
and manifolds (M. Keller, D. Lenz, and R. Wojciechowski (Eds.)). Lond Math. Soc.
Lect. Note Series, CUP.
https://arxiv.org/pdf/1801.09400
Cushing, D., Liu, S. and Peyerimhoff, N.
Bakry-Émery curvature functions of graphs. Can. J. Math. (2018)
https://doi.org/10.4153/CJM-2018-015-4
http://arxiv.org/pdf/1606.01496
Cushing, D.
[see: Bourne, D.]
Cvetković, D. M. and Rowlinson, P.
Slobodan Simic: an appreciation, Discuss. Math. Graph. Theory, to appear.
Cygan, M., Czumaj, A., Mucha, M. and Sankowski, P. Online Facility Location with Deletions. ESA 2018: 21:1-21:15
https://doi.org/10.4230/LIPIcs.ESA.2018.21
https://arxiv.org/pdf/1807.03839
Czerwiński, W, Daviaud, L. Fijalkow, N., Jurdziński, M. Lazić, R. and Parys, P.
Universal trees grow inside separating automata: Quasi-polynomial lower bounds for
parity games. SODA 2019: 2333-2349
https://doi.org/10.1137/1.9781611975482.142
https://arxiv.org/pdf/1807.10546
Czumaj, A. and Davies, P.
Deterministic Communication in Radio Networks. SIAM J. Comput. 47 (2018)
218-240
https://doi.org/10.1137/17M1111322
Czumaj, A. and Davies, P.
Determinstic Blind Radio Networks. DISC2018.
http://dx.doi.org/10.4230/LIPIcs.DISC.2018.15
https://arxiv.org/pdf/1805.04838
Czumaj, A. and Davies, P.
Randomized Communication Without Network Knowledge. Preprint.
https://arxiv.org/pdf/1805.04842
Czumaj, A., Deligkas, A., Fasoulakis, M., Fearnley, J., Jurdziński, M. and
Savani, R.
Distributed Methods for Computing Approximate Equilibria. Algorithmica 81 (2019)
1205-1231
https://doi.org/10.1007/s00453-018-0465-y
Czumaj, A. and Konrad, C.
Detecting Cliques in CONGEST Networks. DISC2018 1-15.
http://dx.doi.org/10.4230/LIPIcs.DISC.2018.16
http://drops.dagstuhl.de/opus/volltexte/2018/9805/pdf/LIPIcs-DISC-2018-16.pdf
Czumaj, A., Łącki, J., Mądry, A., Mitrović, S., Onak,K. and Sankowski, P.
Round Compression for Parallel Matching Algorithms. STOC18 471-528.
https://doi.org/10.1145/3188745.3188764
https://arxiv.org/pdf/1707.03478
Czumaj, A., Mansour, Y. and Vardi, S.
Sublinear Graph Augmentation for Fast Query Implementation. WAOA 2018. Lect.
Notes Comput. Sci. 11312 (2018) 181-203.
https://doi.org/10.1145/3188745.3188764
Czumaj, A.
[see; Adamaszek, A., Cygan, J.]
Czyzowicz, J.
[see: Akrida, E. C.]
Dąbrowski, K. K.,, Johnson, M., and Paulusma, D.
On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle
Transversal, MFCS2018.
http://dx.doi.org/10.4230/LIPIcs.MFCS.2018.63
http://drops.dagstuhl.de/opus/volltexte/2018/9645/pdf/LIPIcs-MFCS-2018-63.pdf
Dąbrowski, K. K.,, Johnson, M., and Paulusma, D.
Clique-Width for Hereditary Graph Classes. Preprint.
https://arxiv.org/pdf/1901.00335
Dąbrowski, K. K., Dross, F., Jeong, J., Kanté, M., Kwon, S-i. Oum and Paulusma,
D.
Computing Small Pivot Minors, WG2018. Lect. Notes Comput. Sci. 11159 (2018)
125—138.
https://doi.org/10.1007/978-3-030-00256-5_11
Dąbrowski, K. K., Johnson, M., Paesani, G., Paulusma, D. and Zamaraev, V.
On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle
Transversal. MFCS 2018: 63:1-63:15
http://dx.doi.org/10.4230/LIPIcs.MFCS.2018.63
http://drops.dagstuhl.de/opus/volltexte/2018/9645/pdf/LIPIcs-MFCS-2018-63.pdf
Dąbrowski, K. K.,, Lozin, V. V. and Paulusma, D.
Well-quasi-ordering versus clique-width: new results on bigenic classes. Order 35
(2018) 253-274.
https://link.springer.com/article/10.1007/s11083-017-9430-7
https://arxiv.org/pdf/1611.03671
Dąbrowski, K. K.
[see: Blanché, A., Bonamy, M., Bulteau, L.]
Dadush, D., Végh, L. A. and Zambelli, G.
Geometric Rescaling Algorithms for Submodular Function Minimization. SODA2018
832-848.
http://doi.org/10.1137/1.9781611975031.54
https://arxiv.org/pdf/1707.05065
Dalfo, C., Fiol, M. A., Miller, M., Ryan, J. and Širáň, J.
An algebraic approach to lifts of digraphs. Discrete Appl. Math., to appear. https://arxiv.org/pdf/1612.08855
Dalfo, C., Fiol, M. A., Pavlikova, S. and Širáň, J.
Spectra and eigenspaces of arbitrary lifts of graphs. Preprint.
https://arxiv.org/pdf/1903.10776
Dalfo, C., Fiol, M. A. and Širáň, J.
The spectra of lifted digraphs. J. Algebr. Comb., to appear.
http://de.arxiv.org/pdf/1707.04463.pdf
Dalmau, V., Krokhin, A. and Manokaran, R.
Towards a Characterization of Constant-Factor Approximable Finite-Valued CSPs. J.
Comput. Syst. Sci. 97 (2018) 14-27.
https://doi.org/10.1016/j.jcss.2018.03.003
http://arxiv.org/pdf/1610.01019
Daly, F. and Johnson, O.
Relaxation of monotone coupling conditions: Poisson approximation and beyond. J.
Appl. Probab. 55 (2018) 742-759
https://doi.org/10.1017/jpr.2018.48
https://arxiv.org/pdf/1706.04064
Dankovics, A.
Low independence number and Hamiltonicity implies pancyclicity. Preprint.
https://arxiv.org/pdf/1809.07736
Dantchev, S., Galesi, N. and Martin, B.
Resolution and the binary encoding of combinatorial principles. Preprint.
https://arxiv.org/pdf/1809.02843.pdf
Das, S., Gąsieniec, L. and di Luna, G. A.
Patrolling on Dynamic Ring Networks. SOFSEM2018. Lect. Notes. Comput. Sci.
11736 (2019) 150-163.
https://doi.org/10.1007/978-3-030-10801-4_13
https://arxiv.org/pdf/1808.04349
Das, S. and Treglown, A.
Ramsey properties of randomly perturbed graphs: cliques and cycles. Preprint.
http://web.mat.bham.ac.uk/~tregloac/pert_ram_finalAT2.pdf
Daviaud, L., Jurdziński, M. and Lazic, R.
A pseudo-quasi-polynomial algorithm for solving mean-payoff parity games. LICS18
325-334.
https://doi.org/10.1145/3209108.3209162
https://arxiv.org/pdf/1803.04756
Daviaud, L., Jurdziński, M., Lazic, R., Mazowiecki, F., Pérez, G. A. and Worrell,
J.
When is Containment Decidable for Probabilistic Automata?. ICALP 2018
121:1-121:14
https://doi.org/10.4230/LIPIcs.ICALP.2018.121
http://drops.dagstuhl.de/opus/volltexte/2018/9125/pdf/LIPIcs-ICALP-2018-121.pdf
Daviaud, L.
[see: Czerwiński, W]
David, S., Spink, H. and Tiba, M.
Symmetric Chain Decompositions of Products of Posets with Long Chains. Electron J.
Comb. 25 (2018) P1.69.
https://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i1p69/pdf
Davies, E., Jenssen, M., Perkins, W. and Roberts, B.
Extremes of the internal energy of the Potts model on cubic graphs. Random Struct.
Algorithms 53 (2018) 59-75.
https://doi.org/10.1002/rsa.20767
http://arxiv.org/pdf/1610.08496
Davies, E., Jenssen, M., Perkins, W. and Roberts, B.
Tight bounds on the coefficients of partition functions via stability. J. Comb. Theory
Ser. A 160 (2018) 1-30.
https://doi.org/10.1016/j.jcta.2018.06.005
https://arxiv.org/pdf/1704.07784
Davies, E.
[see: Allen, P.]
Davies, P.
[see: Czumaj, A.]
Dawes, J.
[see: Briggs, K. M.]
Daykin, J. W., Groult, R., Guesnet, Y., Lecroq, T., Lefebvre, A., Léonard, M.,
Mouchard, L., Prieur-Gaston, E. and Watson, B.
Efficient pattern matching in degenerate strings with the Burrows-Wheeler transform.
Inf. Process Lett, to appear. .
https://arxiv.org/pdf/1708.01130
Daykin, J. W., Groult, R., Guesnet, Y., Lecroq, T., Lefebvre, A., Léonard, M.
and Prieur-Gaston, E.
Three Strategies for the Dead-Zone String Matching Algorithm. Proceedings of
Prague Stringology Conference.
http://www.stringology.org/cgi-bin/getfile.cgi?t=pdf&c=-&y=2018&n=11
Daykin, J. W.
[see: Alatabbi, A., Clare, A.]
Deane, C M., Ospina-Forero, L and Reinert, G.
Assessment of model fit via network comparison methods based on subgraph counts.
J. Complex Networks (2018) cny017
https://doi.org/10.1093/comnet/cny017
Deane, C M., Gaunt, R. M., Ospina-Forero, L., Reinert, G. and Wegner, A. E.
Identifying networks with common organizational principles. Preprint.
https://arxiv.org/pdf/1704.00387
DeBiasio, L.
[see: Bürger, C., Corsten, J.]
Deineko, V.
[see: Cela, E.]
Delabie, T. and Tointon, M.
The asymptotic dimension of box spaces of virtually nilpotent groups Discrete Math.
341 (2018) 1036-1040.
https://doi.org/10.1016/j.disc.2017.12.009
https://arxiv.org/pdf/1706.03730
Delcourt, M., Heinrich, M. and Perarnau, G.
The Glauber dynamics for edges colourings of trees. Preprint.
https://arxiv.org/pdf/1812.05577.pdf
Delcourt, M.
[see: Bernshteyn, A., Chen, S.]
Deligkas, A., Fearnley, J. Melissourgos, T. and Spirakis, P. G.
Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem.
Preprint.
https://arxiv.org/pdf/1903.03101
Deligkas, A., Fearnley, J. Melissourgos, T. and Spirakis, P. G.
Approximating the Existential Theory of the Reals. WINE2018.
https://arxiv.org/pdf/1810.01393
Deligkas, A., Mertzios, G. B. and Spirakis, P. G.
Binary search in graphs revisited. Algorithmica (2018)
https://doi.org/10.1007/s00453-018-0478-6
https://arxiv.org/pdf/1702.08899
Deligkas, A.
[see: Czumaj, A.]
Dell, H. and Lapinskas, J.
Fine-grained reductions from approximate counting to decision. STOC 2018 281-288
https://doi.org/10.1145/3188745.3188920
https://arxiv.org/pdf/1707.04609
Della Volta, F., Gill, N. and Spiga, P.
Cherlin's conjecture for sporadic simple groups. Pacific. J. Math. 297 (2018) 47-66
https://doi.org/10.2140/pjm.2018.297.47
https://arxiv.org/pdf/1705.05150
Delorme, M., Garcia, S., Gondzio, J., Kalcsics, J., Manlove, D. F. and Pettersson,
W.
Mathematical models for stable matching problems with ties and incomplete lists. Eur.
J. Oper. Res., to appear.
https://doi.org/10.1016/j.ejor.2019.03.017
Del Pia, A., Musitelli, A. and Zambelli, G.
On matrices with the Edmonds–Johnson property arising from bidirected graphs. J.
Comb. Theory. Ser. B. 130 (2018) 49-91.
https://doi.org/10.1016/j.jctb.2017.09.013
Delvenne, J.-C., Estrada, E., Hatamo, N. Mateos, J. I., Metzler, R., Riascos, A. P.
and Schaub, M. T.
Random multi-hopper model: super-fast random walks on graphs. J. Complex
Networks 6 (2018) 382–403.
https://doi.org/10.1093/comnet/cnx043
https://arxiv.org/pdf/1612.08631
Demirkale, F., Donovan, D. M. and Grannell, M. J.
Anti-Pasch optimal packings with triples. J. Comb. Des., to appear.
Dereich, S. and Ortgiese, M.
Local neighbourhoods for first passage percolation on the configuration model J. Stat.
Phys. 137 (2018) 485-501
https://dx.doi.org/10.1007/s10955-018-2028-7
https://arxiv.org/pdf/1711.06479
Dereudre, D. and Penrose, M. D.
On the critical threshold for continuum AB percolation. J. Appl. Probab. 2018 1228-
1237.
https://doi.org/10.1017/jpr.2018.81
https://arxiv.org/pdf/1712.04737
Dettmann, C. P. Isolation and connectivity in random geometric graphs with self-similar intensity
measures. J. Stat. Phys. 172 (2018) 679-700.
https://doi.org/10.1007/s10955-018-2059-0
https://arxiv.org/pdf/1710.11043
Dettmann, C. P., Georgiou, O. and Pratt, P. Confined spatial networks with wireless applications, Comptes Rendus Physique 19
(2018) 187-204.
https://doi.org/10.1016/j.crhy.2018.10.001
https://arxiv.org/pdf/1803.04166
Dettmann, C. P.
[see: Chetlur, V.V., Chin, W. H. , Coon, J. P.]
Deutschmann, I. M.
[see: Bordewich, M. J.]
Devroye, L, Holmgren, C. and Sulzbach, H.
The heavy path approach to Galton-Watson trees with an application to Apollonian
networks. Electron. J. Probab. 24 (2019) 44 pp
http://dx.doi.org/10.1214/19-EJP263
https://projecteuclid.org/download/pdfview_1/euclid.ejp/1549357219
Dhillon, H. S.
[see: Chetlur, V. V.]
Diaz, A. E. and Serra, O.
Entropy versions of additive inequalities. Preprint.
https://arxiv.org/pdf/1809.10421
Diaz, A. E.
[see: Condon, P.]
Diaz, J., McDiarmid, C. J. H. and Mitsche, D.
Learning random points from geometric graphs or vertex orderings, Preprint.
https://arxiv.org/pdf/1809.09879
Dieuleveut, D.
[see: Addario-Berry, L.]
Diner, O. Y., Paulusma, D., Picoleau, C. and Ries, B.
Contraction and Deletion Blockers for Perfect Graphs and H-free Graphs. Theor.
Comput. Sci. 746 (2018) 49-72.
https://doi.org/10.1016/j.tcs.2018.06.023
https://arxiv.org/pdf/1706.09052
Dinur, I., Goldreich, O. and Gur, T.
Every set in P is strongly testable under a suitable encoding. ITCS2019.
https://www.dcs.warwick.ac.uk/~tomgur/pdf/canonic.pdf
Donovan, D. M., Grannell, M. J. and Şule Yazici, E.
Embedding partial Latin squares in Latin squares with many mutually orthogonal
mates. Preprint.
https://arxiv.org/pdf/1811.04625
Donovan, D. M., Griggs, T. S., Kozlik, A. and McCourt, T. A.
Types of directed triple systems. Australas. J. Combin. 71` (2018) 485-500.
https://ajc.maths.uq.edu.au/pdf/71/ajc_v71_p485.pdf
Donovan, D. M.
[see: Demirkale, F.]
Donoven, C., Mitchell, J.. D. and Wilson, W.
Computing maximal subsemigroups of a finite semigroup. J. Algebra 505 (2018)
559-596.
https://doi.org/10.1016/j.jalgebra.2018.01.044
http://arxiv.org/pdf/1606.05583
Döring, H.
[see: Betken, C.]
Draisma, J. and Rincón, E. F.
Tropical ideals do not realise all Bergman fans . Preprint.
https://arxiv.org/pdf/1903.00356
Dross, F. [see: Dąbrowski, K. K.]
Dudek, A.
[see: Bennett, P.]
Duffus, D.,Howard, D. and Leader, I. B.
The Width of Downsets. Eur. J. Comb. 79 (2019) 46-59.
https://doi.org/10.1016/j.ejc.2018.11.005
https://arxiv.org/pdf/1710.05714
Dugan, W., Glennon, S., Gunnells, P. E. and Steingrímsson, E.
Tiered trees, weights, and q-Eulerian numbers. J. Comb. Theory. Ser. A.
164 (2019) 24-49
https://doi.org/10.1016/j.jcta.2018.12.002
https://arxiv.org/pdf/1702.02446
Dukes, W. M. B. , Selig, T. Smith, J. P. and Steingrínsson, E.
Permutation graphs and the Abelian sandpile model, tiered trees and non-ambiguous
binary trees. Preprint.
https://arxiv.org/pdf/1810.02437
Dukes, W. M. B. , Selig, T. Smith, J. P. and Steingrínsson, E.
The Abelian sandpile model on Ferrers graphs – A classification of recurrent
configurations. Preprint.
https://arxiv.org/pdf/1809.07728
Dunlop, F.
[see; Archibald, B.]
Dupont, C.. Fink, A. and Moci, L.
Universal Tutte characters via combinatorial coalgebras, Algebr. Comb. 1 (2018)
603-651.
https://doi.org/10.5802/alco.35
https://arxiv.org/pdf/1711.09028
Dvořák, Z., Král’,. D. and Thomas, R. Three-coloring triangle-free graphs on surfaces II. 4-critical graphs in a disk, J. Comb.
Theory Ser. B. 132 (2018) 1-46.
https://doi.org/10.1016/j.jctb.2018.03.001
https://arxiv.org/pdf/1302.2158
Dyer, M. E., Greenhill, C. S. and Müller, H.
Counting independent sets in graphs with bounded bipartite pathwidth. Preprint.
https://arxiv.org/pdf/1812.03195
Dyer, M. E. and Müller, H.
Quasimonotone graphs. WG2018 Lect. Notes Comput. Sci. 11159 190-202.
https://doi.org/10.1007/978-3-030-00256-5_16
https://arxiv.org/pdf/1801.06494
Dyer, M. E. and Müller, H.
Counting independent sets in cocomparability graphs. Inf. Process. Lett. 144 (2019)
31-36.
https://doi.org/10.1016/j.ipl.2018.12.005
https://arxiv.org/pdf/1808.09853
East J., Gadouleau, M. and Mitchell, J. D.
Structural aspects of transformation semigroups based on digraphs. Algebr. Comb., ,
to appear.
http://arxiv.org/pdf/1704.00937
East J., Mitchell, J. D., Ruškuc, N. and Torpey, M.
Congruence lattices of finite diagram monoids. Adv. Math. 333 (2018) 931-1003.
https://doi.org/10.1016/j.aim.2018.05.016
https://arxiv.org/pdf/1709.00142
East J., and Ruškuc, N. Congruences on infinite partition and partial Brauer monoids. Preprint.
https://arxiv.org/pdf/1809.07427
Eberhard, S.
Random generation under the Ewens distribution. Preprint.
https://arxiv.org/pdf/1808.08892
Eberhard, S. and Garzoni, D.
Random generation with cycle type restrictions. Preprint.
http://arxiv.org/pdf/1904.12180.pdf
Eberhard, S., Manners, F. and Mrazovic, R.
Additive triples of bijections, or the toroidal semiqueens problem. J. Eur. Math. Soc.
21 (2018) 441-463.
http://dx.doi.org/10.4171/JEMS/841. 10.4171/JEMS/841
https://arxiv.org/pdf/1510.05987
Eberhard, S. and Virchow, S.-C.
The Probability of Generating the Symmetric Group. Combinatorica, to appear.
https://arxiv.org/pdf/1611.02501
Eberhard, S.
[see: Acan, H.]
Eckhoff, M., Mörters, P. and Ortgiese, M.
Near critical preferential attachment networks have small giant components. J. Stat.
Phys. 173 (2018) 663-703.
https://doi.org/10.1007/s10955-018-2054-5
https://arxiv.org/pdf/1712.00400
Edwards, K., Girão, A., van dea Heuvel, J., Kang, R. J., Puleo, G. J. and
Sereni, J.-S.
Extension from precoloured sets of edges. Electron J. Comb. 25 (2018) P3.1. http://arxiv.org/pdf/1407.4339.pdf
Edwards, K. J. and Noble, S. D.
The complexity of solution-free sets of integers. Preprint.
https://arxiv.org/pdf/1812.09259
Eftekhari, Y, Jackson, B., Nixon, A., Schulze, B., Tanigawa, S. and Whiteley, W.
Point-hyperplane frameworks, slider joints, and rigidity preserving transformations. J.
Comb. Theory Ser. B. 135 (2019) 44-74.
https://doi.org/10.1016/j.jctb.2018.07.008
https://arxiv.org/pdf/1703.06844
Efthymiou, C.
[see: Coja-Oghlan, A.]
Ehard, S. and Joos, F.
Long paths and cycles in random subgraphs of graphs with large minimum degree.
Electron J. Comb. 25 (2018) Paper 2.31.
https://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i2p31/pdf
Eickmeyer, K., van den Heuvel, J., Kawarabayashi, K., Kreutzer, S., Ossona de
Mendez, P.,Pilipczuk, M., Quiroz, D., Rabinovich, R. and Siebertz, S.
Model-Checking on Ordered Structures. Preprint.
http://arxiv.org/pdf/1812.08003
Eisenbrand, F.
[see: Aliev, I.]
Elder, M.
[see: Ciobanu, L. ]
Elek, G.
Qualitative graph limit theory. Cantor Dynamical Systems and Constant-Time
Distributed Algorithms. Preprint.
https://arxiv.org/pdf/1812.07511
Ellis,. D., Keller, N. and Lifshitz, N.
On the structure of subsets of the discrete cube with small edge boundary. Discrete
Anal. 2018:9, 29 pp.
https://doi.org/10.19086/da.3668
https://discreteanalysisjournal.com/article/3668-on-the-structure-of-subsets-of-the-
discrete-cube-with-small-edge-boundary
Ellis,. D., Keller, N. and Lifshitz, N.
On a biased edge isoperimetric inequality for the discrete cube. J. Comb. Theory Ser.
A. 163 (2019) 118-162.
https://doi.org/10.1016/j.jcta.2018.12.001
https://arxiv.org/pdf/1702.01675
Ellis,. D., Keller, N. and Lifshitz, N.
Stability versions of Erdős-Ko-Rado type theorems, via isoperimetry. J. Eur. Math.
Soc., to appear.
http://arxiv.org/pdf/1604.02160
Ellis,. D.. and Lifshitz, N.
On the union of intersecting families. Combin. Probab. Comput., to appear.
https://arxiv.org/abs/1610.03027
Ellis, D.
[see: Cameron, P. J.]
Ellis-Monaghan, J. A., Kauffman, L. H. and Moffatt, I.
Edge colourings and topological graph polynomials. Ausralas. J. Comb. 72 (2018)
290-305.
https://ajc.maths.uq.edu.au/pdf/72/ajc_v72_p290.pdf
El-Mabrouk, N., Huber, K. T., Lafond, M. and Moulton, V.
The complexity of comparing multiply-labelled trees by extending phylogenetic-tree
metrics. Theor. Comput. Sci. 760 (2019) 15-34.
https://doi.org/10.1016/j.tcs.2018.08.006
https://arxiv.org/pdf/1803.05866
Elsässer, R. and Radzik, T.
Recent Results in Population Protocols for Exact Majority and Leader Election.
Bulletin of the EATCS 126 (2018)
http://bulletin.eatcs.org/index.php/beatcs/article/view/549/546
Elsässer, R.
[see: Berenbrink, P.]
Elvey Price, A.
[see: Bevan, D.]
Engen, M.
[see: Brignall, R.]
Englert, M., Mezlaf, D. and Westermann, M.
Online Makespan Scheduling with Job Migration on Uniform Machines. ESA18
26:1-26:14.
http://www.dcs.warwick.ac.uk/~englert/publications/buffer_esa18.pdf
Englert, M.
[see; Adamaszek, A.]
English, S.
[see: Boyer, K.]
Enright, J. and Kao, R. R. Epidemics on dynamic networks. Epidemics 24 (2018) 88-97
https://doi.org/10.1016/j.epidem.2018.04.003
https://www.sciencedirect.com/science/article/pii/S1755436518300173/pdfft?md5=19
badc2a467c7f9dc1690e924cd92097&pid=1-s2.0-S1755436518300173-main.pdf
Enright, J. and Kitaev, S.
Polygon-circle graphs and word-representable graphs. 2nd
IMA conference on
theoretical and computational discrete mathematics. Electron. Notes. Discrete Math.
71 (2019) 3-8.
https://doi.org/10.1016/j.endm.2019.02.001
Enright, J., Meeks, K., Mertzios, G. B. and Zamaraev, V.
Deleting edges to restrict the size of an epidemic in temporal networks.
https://arxiv.org/pdf/1805.06836
Enright, J.
[see: Barnetson, K. D]
Enyang, J.
[see: Bowman, C. D.]
Erde, J. [see: Barber, B., Bowler, N.]
Erickson, A., Navaridas, J. and Stewart, I. A.
Relating the Bisection Width of Dual-Port, Server-Centric Datacenter Networks and
the Solution of Edge Isoperimetric Problems in Graphs. Preprint.
http://community.dur.ac.uk/i.a.stewart/Papers/bisectionwidth.pdf
Erickson, A., Navaridas, J., Pascual, J. and Stewart, I. A.
Routing algorithms for recursively-defined datacenter networks. Preprint.
http://community.dur.ac.uk/i.a.stewart/Papers/SearchRouting.pdf
Erickson, A. and Stewart, I. A.
The influence of data center usage on symmetry in data center network design. The
Journal of Supercomputing (2018) 1-38.
http://dx.doi.org/10.1007/s11227-017-2217-1
https://community.dur.ac.uk/i.a.stewart/Papers/Symmetry.pdf
Erlebach, T., Ficker, A., Mihalak, M. and Spieksma, F.
Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based
Algorithm. ISAAC2018. 45:1-45:12.
https://doi.org/10.4230/LIPIcs.ISAAC.2018.45
http://drops.dagstuhl.de/opus/volltexte/2018/9993/pdf/LIPIcs-ISAAC-2018-45.pdf
Erlebach, T., Luo, K. and Xu, Y.
Car-Sharing Between Two Locations: Online Scheduling with Flexible Advance
Bookings. COCOON2018. Lect. Notes Comput. Sci. 10976 (2018) 242-254.
https://doi.org/10.1007/978-3-319-94776-1_21
Erlebach, T., Luo, K. and Xu, Y.
Car-Sharing between Two Locations: Online Scheduling with Two Servers.
MFCS2018 50:1-50:14.
https://doi.org/10.4230/LIPIcs.MFCS.2018.50
http://drops.dagstuhl.de/opus/volltexte/2018/9632/pdf/LIPIcs-MFCS-2018-50.pdf
Erlebach, T., Luo, K. and Xu, Y.
Online Scheduling of Car-Sharing Requests between Two Locations with Many Cars
and Flexible Advance Bookings. ISAAC2018
http://dx.doi.org/10.4230/LIPIcs.ISAAC.2018.64
http://drops.dagstuhl.de/opus/volltexte/2018/10012/pdf/LIPIcs-ISAAC-2018-64.pdf
Erlebach, T., Luo, K. and Xu, Y.
Car-Sharing on a Star Network: On-line Scheduling with k Servers STACS2019, to
appear.
https://doi.org/10.4230/LIPIcs.STACS.2019.51
http://drops.dagstuhl.de/opus/volltexte/2019/10290/pdf/LIPIcs-STACS-2019-51.pdf
Erlebach, T. and Spooner, J.
Faster Exploration of Degree-Bounded Temporal Graphs. MFCS2018 50:1-50:14.
https://doi.org/10.4230/LIPIcs.MFCS.2018.36
http://drops.dagstuhl.de/opus/volltexte/2018/9618/pdf/LIPIcs-MFCS-2018-36.pdf
Erskine, G. Fratric, P. and Širáň, J.
Graphs derived from perfect difference sets. Preprint.
https://arxiv.org/pdf/1903.02425.pdf
Erskine, G., Griggs, T. S. and Širáň, J.
On the upper embedding of symmetric configurations with block size 3. Preprint.
http://arxiv.org/pdf/1904.02919.pdf
Erskine, G., Griggs, T. S. and Širáň, J.
Clique-partitioned graphs. Preprint.
https://arxiv.org/pdf/1809.00527
Erskine, G., Hriňáková, K. and Jeans, O.
Self-dual, self-Petrie-dual and Möbius regular maps on linear fractional groups.
Preprint.
https://arxiv.org/pdf/1807.11307
Erskine, G. and Tuite, J.
Large Cayley graphs of small diameter. Discrete Appl. Math. 250 (2018) 202-214.
https://doi.org/10.1016/j.dam.2018.04.025
https://arxiv.org/pdf/1708.02425
Erskine, G. and Tuite, J.
On total regularity of mixed graphs with order close to the Moore bound. Preprint.
https://arxiv.org/pdf/1811.00650
Erskine, G.
[see: Anabanti, C. S..]
Estrada, E., Hoffman, R., Movassagh, R., and Tsuji, Y.
Quantum Interference, Graphs, Walks, and Polynomials. Chem. Rev. 118 (2018)
4887-4911.
https://pubs.acs.org/action/showCitFormats?doi=10.1021%2Facs.chemrev.7b00733
Estrada, E., Frasca, M. and Gambuzza, L. V.
Second-order consensus protocols based on transformed d-path Laplacians. Applied
Mathematics and Computation 343 (2019) 183-194.
https://doi.org/10.1016/j.amc.2018.09.038
Estrada, E., Frasca, M. and Gambuzza, L. V.
Long-Range Interactions and Network Synchronization. SIAM J. Appl. Dyn. Syst. 17
(2018) 672–693.
https://doi.org/10.1137/17M1124310
Estrada, E., Frasca, M. and Gambuzza, L. V.
Synchronization in networks of Rössler oscillators with long-range interactions.
ISCAS2018.
https://doi.org/10.1109/ISCAS.2018.8351626
Estrada, E.
[see: Delvenne, J.-C.]
Evans, D. M., Hubička, J., Konečný. M. and Nešetřil, J.
EPPA for two-graphs and antipodal metric spaces. Preprint.
https://arxiv.org/pdf/1812.11157
Evans, D. M., Hubička, J. and Nešetřil, J.
Automorphism groups and Ramsey properties of sparse graphs. Proc. Lond. Math.
Soc., to appear. .
https://arxiv.org/pdf/1801.01165
Evans, D. M.
[see: Coleman, T.]
Everitt, B. and Turner, P.
Deletion-restriction for sheaf homology of geometric lattices. Preprint.
http://arxiv.org/pdf/1902.00399.pdf
Ewens, W. J.
[see: Arratia, R.]
Exoo, G., Jajcay, R., Mačaj, M. and Širáň, J.
On the defect of vertex-transitive graphs of given degree and diameter. J. Comb.
Theory Ser. B. 134 (2019) 322-340.
https://doi.org/10.1016/j.jctb.2018.07.002
Fairthorne, M.
[see: Brightwell, G. R.]
Falgas-Ravry, V. and Lo, A.
Subgraphs with large minimum \ell-degree in hypergraphs where almost all \ell-
degrees are large. Electron J. Comb. 25 (2018) P2.18
https://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i2p18/pdf
Falgas-Ravry, V.
[see: Behrstock, J.]
Falik, D.
[see: Choromanski, K.]
Faria, L.
[see: Alves, S. R.]
Fasoulakis, M. [see: Czumaj, A.]
Fayers, M.
An interesting class of posets. Preprint.
http://www.maths.qmul.ac.uk/~mf/papers/posets.pdf
Fayers, M.
Simultaneous core multipartitions. Eur. J. Comb. 76 (2019) 138-158
https://doi.org/10.1016/j.ejc.2018.09.012
https://arxiv.org/pdf/1709.00079
Fayers, M.
Irreducible projective representations of the symmetric group which remain
irreducible in characteristic 2. Proc. Lond. Math. Soc. 116 (2018) 878-928.
http://dx.doi.org/10.1112/plms.12087
http://www.maths.qmul.ac.uk/~mf/papers/spin2.pdf
Fayers, M.
A note on Kostka numbers. Preprint.
http://arxiv.org/pdf/1903.12499.pdf
Fearnley, J.
Efficient Parallel Strategy Improvement for Parity Games. Preprint.
https://arxiv.org/pdf/1705.02313
Fearnley, J., Gordon, S., Mehta, R. and Savani, R.
Unique End of Potential Line. Preprint.
https://arxiv.org/pdf/1811.03841
Fearnley, J.
[see: Amanatidis, G., Czumaj, A., Deligkas, A.]
Federici, B.
[see: Carmesin, J.]
Federico, L, van der Hofstad, R., den Hollander, F. and Hulshof, T.
Expansion of percolation critical points for Hamming graphs. To appear.
https://arxiv.org/pdf/1701.02099
Feghali, C. and Johnson, M.
Enclosings of Decompositions of Complete Multigraphs in 2-Factorizations. J. Comb.
Des 26 (2018) 205-218.
https://doi.org/10.1002/jcd.21601
http://arxiv.org/pdf/1608.06961
Feghali, C.
[see: Bonamy, M.]
Fenner, P., Johnson, M. E. and Kambites, M.
NP-completeness in the gossip monoid. Int. J. Algebra Comput. 28 (2018)
653-672.
https://doi.org/10.1142/S0218196718500297
http://arxiv.org/pdf/1606.01026
Ferber, A and Long, E. P.
Packing and counting arbitrary Hamilton cycles in random digraphs. Random Struct.
Algorithms, to appear.
https://arxiv.org/pdf/1603.03614
Fernandes, C.
[see: Bailey, R. A.]
Ferov, M.
[see: Ciobanu, L.]
Ferrero, D.
[see: Boyer, K.]
Fertin, G.
[see: Bulteau, L.]
Fici, G.
[see: Ayad, L. A. K., Badkobeh, G., Charalampopoulos, P.]
Ficker, A.
[see: Erlebach, T.]
Fijalkow, N.
[see: Czerwiński, W]
Filos-Ratsikos, A. and Goldberg, P. W.
The Complexity of Splitting Necklaces and Bisecting Ham Sandwiches. Preprint.
https://arxiv.org/pdf/1805.12559
Fink, A., Mészáros, K. and St. Dizier, A. Schubert polynomials as integer point transforms of generalized permutahedra. Adv.
Math., to appear.
https://arxiv.org/pdf/1706.04935
Fink, A., Mészáros, K. and St. Dizier, A. Zero-one Schubert polynomials. Preprint.
http://de.arxiv.org/pdf/1903.10332.pdf
Fink, A. and Moci, L.
Polytopes and parameter spaces for matroids over valuation rings. Adv. Math. 343
(2019) 449–494
http://dx.doi/10.1016/j.aim.2018.11.009
https://arxiv.org/pdf/1707.01026
Fink, A. and Olarte, J.
Presentations of Transversal Valuated Matroids, Preprint.
http://de.arxiv.org/pdf/1903.08288.pdf
Fink, A.
[see: Dupont, C..]
Fiol, M. A.
[see: Dalfo, C.]
Fischer, E.
[see: Blanchard, E.]
Fischer, M.
[see: Bordewich, M.]
Fish, W., Key, J. D. and Mwambene, E.
Codes from adjacency matrices of uniform subset graphs. Graphs Comb. 34 (2018)
163-192.
https://doi.org/10.1007/s00373-017-1862-8
Fitch, M.
Implicit representation conjecture for semi-algebraic graphs. Discrete Appl. Math., to
appear.
http://arxiv.org/pdf/1803.01882.pdf
Fitch, M.
Kruskal-Katona type Problem. Preprint.
https://arxiv.org/pdf/1805.00340
Fluschnik, T., Komusiewicz, C., Mertzios, G. B.,. Nichterlein, A., Niedermeier, R.
and Talmon, N.
When can graph hyperbolicity be computed in linear time? Algorithmica (2018)
https://doi.org/10.1007/s00453-018-0522-6
https://arxiv.org/pdf/1702.06503
Fluschnik, T., Mertzios, G. B., and Nichterlein, A.
Kernelization Lower Bounds for Finding Constant Size Subgraphs. CIE2018.
Lect. Notes. Comput. Sci. 10936 183-193.
https://doi.org/10.1007/978-3-319-94418-0_19
http://de.arxiv.org/pdf/1710.07601.pdf
Fluschnik, T. [see: van Bevern, R.]
Focke, J.,. Goldberg, L. A. and Živný, S.
The Complexity of Counting Surjective Homomorphisms and Compactions. SIAM J.
Discrete Math., to appear. 4
https://arxiv.org/pdf/1706.08786
Focke, J.,. Goldberg, L. A. and Živný, S.
The Complexity of Approximately Counting Retractions . SODA 2019, to appear.
https://arxiv.org/pdf/1807.00590
Fomin, F., Panolan, F. Ramanujan, M. S. and Saurabh, S.
On the Optimality of Pseudo-polynomial Algorithms for Integer Programming.
ESA2018.
Forbes, A. D.
Group divisible designs with block size four and type g^u m^1 – II. J. Comb. Des. 27
(2019) 311-349.
https://doi.org/10.1002/jcd.21650
https://arxiv.org/pdf/1806.07491
Forbes, A. D.
Group divisible designs with block size four and type g^u m^1 – III.
https://arxiv.org/pdf/1903.07064
Forbes, A. D. and Forbes, K. A.
Group divisible designs with block size 4 and type 𝑔𝑢𝑚𝑙. J. Comb. Des. 26 (2018)
519–539
https://doi.org/10.1002/jcd.21607
Forbes, K. A.
[see: Forbes, A. D.]
Forbes, M. A.
4 A conference version appeared in SODA2018 -
https://doi.org/10.1137/1.9781611975031.116
[see : Chiesa, M.]
Ford. K., Harper, A. J. and Lamzouri, Y.
Extreme biases in prime number races with many contestants. Math. Ann., to appear.
https://faculty.math.illinois.edu/~ford/wwwpapers/ExtremeBiases.pdf
Ford, K., Maynard, J. and Tao, T. C.
Chains of large gaps between primes. In: "Irregularities in the distribution of prime
numbers", (J. Pintz, M. Th. Rassias, eds.), Springer, 2018, p. 1-21
https://faculty.math.illinois.edu/~ford/wwwpapers/primegaps_chains.pdf
Fountoulakis, N., Mitsche, D., Müller, T. and Schepers, M.
Hamilton cycles and perfect matchings in the KPKVB model. Preprint.
https://arxiv.org/pdf/1901.09175
Fountoulakis, N. and Müller, T.
Law of large numbers for the largest component in a hyperbolic model of complex
networks. Ann. Appl. Probab. 28 (2018) 607-650.
http://dx.doi.org/10.1214/17-AAP1314
http://arxiv.org/pdf/1604.02118
Fountoulakis, N. and Yukich, J. E. Limit theory for the number of isolated and extreme points in hyperbolic random
geometric graphs. Preprint.
https://arxiv.org/pdf/1902.03998
Fountoulakis, N.
[see: Abdullah, M.]
Fowler, P., Guest, S. and Schulze, B.
Mobility of symmetric block-and-hole polyhedral.International Journal of Solids and
Structures 150 (2018) 40-51.
https://doi.org/10.1016/j.ijsolstr.2018.05.029
Fox, J.
[see: Chudnovsky, M., Conlon, D.]
Foxall, E., Hutchcroft, T. and Junge, M.
Coalescing random walk on unimodular graphs. Electron Commun, Probab. 23
(2018) no 62.
http://dx.doi.org/10.1214/18-ECP136
https://projecteuclid.org/download/pdfview_1/euclid.ecp/1536804170
Fradelizi, M.
[see: Bárány, I.]
Franchi, C., Ivanov, A. A. and Mainardis, M.
Radicals of Sn-invariant positive semidefinite hermitian forms. Algebr. Comb. 1
(2018) 425-440.
https://alco.centre-mersenne.org/article/ALCO_2018__1_4_425_0.pdf
Francisco, A. P,
[see: Carriço, J. A.]
Frankl, N.
[see: Bustamante, S.]
Frankl, P. and Kupavskii, A.
Beyond the Erdős Matching Conjecture. Preprint.
https://arxiv.org/pdf/1901.09278
Frankl, P. and Kupavskii, A.
Simple juntas for shifted families. Preprint.
https://arxiv.org/pdf/1901.03816
Frankl, P. and Kupavskii, A.
Diversity. Preprint.
https://arxiv.org/pdf/1811.01111
Frankl, P. and Kupavskii, A.
Incompatible intersection properties. Preprint.
https://arxiv.org/pdf/1808.01229
Frankl, P. and Kupavskii, A.
The Erdős Matching Conjecture and concentration inequalities. Preprint.
https://arxiv.org/pdf/1806.08855
Frankl, P. and Kupavskii, A.
Partition-free families of sets. Proc. Lond. Math. Soc., to appear.
https://arxiv.org/pdf/1706.00215
Frankl, P. and Kupavskii, A.
Families of vectors without antipodal pairs. Studia Sci. Math. Humgar. 55 (2018)
231-237
https://arxiv.org/pdf/1705.07216
Frankl, P. and Kupavskii, A.
Counting intersecting and pairs of cross-intersecting families. Combin. Probab.
Comput. 27 (2018) 60-68,
https://doi.org/10.1017/S0963548317000529
https://arxiv.org/pdf/1701.04110
Frankl, P. and Kupavskii, A.
Families of sets with no matchings of sizes 3 and 4. Eur. J. Comb. 75 (2019) 123-135.
https://arxiv.org/pdf/1701.04107
Frankl, P. and Kupavskii, A.
Two problems on matchings in set families – In the footsteps of Erdős and Kleitman.
J. Comb. Theory Ser B., to appear.
https://doi.org/10.1016/j.jctb.2019.02.004
https://arxiv.org/pdf/1607.06126
Frasca, M.
[see: Estrada, E.]
Fraser, J.
On Word and Gómez Graphs and Their Automorphism Groups in the Degree
Diameter Problem. Preprint.
https://arxiv.org/pdf/1811.04298
Fraser, J., Jeans, O. and Širáň, J.
Regular self-dual and self-Petrie-dual maps of arbitrary valency. Ars. Math. Contemp.,
to appear. https://arxiv.org/pdf/1807.11692.pdf
Fratric, P.
[see: Erskine, G.]
Freeman, N. and Jordan, J.
Extensive Condensation in a model of Preferential Attachment with Fitnesses.
Preprint.
https://arxiv.org/pdf/1812.06946
Friedetzky, T.
[see: Berenbrink, P.]
Friedrich, T.
[see: Bläsius, T.]
Frieze, A. M., Pegden, W. and Sorkin, G. B .
The distribution of minimum-weight cliques and other subgraphs in graphs with
random edge weights. SIAM J. Discrete Math., 32 (2018). 2115-2133.
http://doi.org/10.1137/17M1138303
https://arxiv.org/pdf/1606.04925
Frieze, A. M.
[see: Cooper, C.]
Frőhlich, J.
[see: Björnberg, J.]
Fröhlich, J.-O.
[see: Aigner-Horev, E.]
Fukusawa, R.
[see: Abdi, A.]
Fulek, R., Gärtner, B., Kupavskii, A., Valtr, P. and Wagner, U.
The Crossing Tverberg Theorem. SOCG2019.
https://arxiv.org/pdf/1812.04911
Fulla, P., Uppman, H. and Živný, S.
The complexity of Boolean surjective general-valued CSPs. ACM Trans. Comput.
Theory 11 (2019) no 4.
https://doi.org/10.1145/3282429
http://arxiv.org/pdf/1702.04679 Füredi, Z.
[see: Bárány, I.]
Fusy, E.
[see: Addario-Berry, L.]
Gadouleau, M.
On the possible values of the entropy of undirected graphs. J. Graph Theory 88 (2018)
302-311.
https://doi.org/10.1002/jgt.22213
https://arxiv.org/pdf/1512.01348
Gadouleau, M.
On the influence of the interaction graph on a finite dynamical system. Natural
Computing, to appear.
https://arxiv.org/pdf/1805.12247
Gadouleau, M.
Finite dynamical systems, hat games, and coding theory. SIAM J. Discrete Math. 32
(2018) 1922-1945.
https://doi.org/10.1137/15M1044758
https://arxiv.org/pdf/1510.05824
Gadouleau, M.
Maximum Rank and Asymptotic Rank of Finite Dynamical Systems. Electron. J.
Comb. 25 (2018) 1-16.
https://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i3p48/pdf
Gadouleau, M. and Richard, A.
On fixable families of Boolean networks. Proc. Workshop on Asychronous Cellular
Automata, Como,. September 2018.
https://arxiv.org/pdf/1804.01931 r
Gadouleau, M. and Riis, S. Max-Flow Min-Cut Theorems for Multi-User Communication Networks. Inf.
Comput., to appear.
https://arxiv.org/pdf/1012.5224 Max-Flow Min-Cut Theorems for Multi-User
Gadouleau, M.
[see: Bridoux, F., Castillo-Ramirez, A., East, J.]
Gafni, A.
[see: Bloom, T. F.]
Gagarin, A.
[see: Anitha, T., Corcoran, P.]
Gai, J.
[see: Alzamel, M.]
Galanis, A., Goldberg, L. A. and Yang, K.
Uniqueness for the 3-State Antiferromagnetic Potts Model on the Tree. Electron. J.
Probab. 23 (2018) 1-43.
https://doi.org/10.1214/18-EJP211
https://arxiv.org/pdf/1804.03514
Galanis, A., Štefankovič, D. and Vigoda, E.
Swendsen-Wang Algorithm on the Mean-Field Potts Model. Random Struct.
Algorithms 54 (2019)
https://arxiv.org/pdf/1502.06593
Galanis, A.
[see: Bezakova, I., Blanca, A., Chen, Z.]
Galby, E., Lima, P. T., Paulusma, D. and Ries, B.
On the Parameterized Complexity of k-Edge Colouring. Preprint.
https://arxiv.org/pdf/1901.01861
Galby, E., Lima, P. T., Paulusma, D. and Ries, B.
Classifying k-Edge Colouring for H-free Graphs. Preprint.
https://arxiv.org/pdf/1810.04379
Galesi, N.
[see: Dantchev, S.]
Galli, L. and Letchford, A. N.
A binarisation heuristic for non-convex quadratic programming with box constraints.
Oper Res. Lett. 46 (2018) 529-533.
https://doi.org/10.1016/j.orl.2018.08.005
https://www.lancaster.ac.uk/staff/letchfoa/articles/qpb-binarise.pdf
Galli, L., Letchford, A. N. and Miller, S. J.
New valid inequalities and facets for the simple plant location problem. Eur. J. Oper.
Res. 269 (2018) 824-822.
https://doi.org/10.1016/j.ejor.2018.03.009
https://www.lancaster.ac.uk/staff/letchfoa/articles/splp-facets.pdf
Gambuzza, L. V.
[see: Estrada, E.]
Ganguly, S.
[see: Bhattacharya, B. B.]
Gao, A. and Kitaev, S.
On partially ordered patterns of length 4 and 5 in permutations. Preprint.
http://arxiv.org/pdf/1903.08946
Gao, A., Kitaev, S., Steiner, W. and Zhang, P.
On a Greedy Algorithm to Construct Universal Cycles for Permutations. Int. J.
Found. Comput. Sci. 30 (2019) 61-72.
https://doi.org/10.1142/S0129054119400033
https://arxiv.org/pdf/1711.10820
Gao, J.
[see: Almirantis, Y.]
Gao, W.
[see: Bjorkman, B.]
Garbe, F., Hancock, R., Hladký, J. and Sharifzadeh, M.
Theory of limits of sequences of Latin squares (extended abstract).
http://users.math.cas.cz/~hladky/EurocombLatin.pdf
Garbe, F., McDowell, A. and Mycroft, R.
Contagious sets in a degree-proportional bootstrap percolation process. Random
Struct. Algorithms 53 (2018) 638-651.
https://doi.org/10.1002/rsa.20818
https://arxiv.org/pdf/1610.06144v1.pdf
Garbe, F. and Mycroft, R.
Hamilton cycles in hypergraphs below the Dirac threshold. J. Comb. Theory. Ser B.
133 (2018) 153-210.
https://doi.org/10.1016/j.jctb.2018.04.010
https://arxiv.org/pdf/1609.03101.pdf
Garcia, S.
[see: Delorme, M.]
Gärtner, B.
[see: Fulek, R.]
Garzoni, D.
[see: Eberhard, S.]
Gąsieniec, L. and Stachowiak, G,
Fast Space Optimal Leader Election in Population Protocols. SODA2018.
https://doi.org/10.1137/1.9781611975031.169
Gąsieniec, L.
[see: Akrida, E. C., Chrobak, M., Das, S.]
Gaspers, S., Huang, S. and Paulusma, D.
Colouring Square-Free Graphs without Long Induced Paths, STACS2018.
http://dx.doi.org/10.4230/LIPIcs.STACS.2018.35
http://drops.dagstuhl.de/opus/volltexte/2018/8492/pdf/LIPIcs-STACS-2018-35.pdf
Gaunt, R.
[see: Coulson, M., Deane, C. M.]
Gavrilyuk, A. L.
[see: Bailey, R. A.]
Gawrychowski, P. [see: Charalampopoulos, P.]
GCHQ PSGroup
[see: Chapman, R. J.]
Gellert, L.
[see: Bruhn, H.]
Gent, I. P.
[see: Akgün, O.]
Georgakopoulos, A.
Planar Cayley graphs and Kleinian groups. Preprint.
https://homepages.warwick.ac.uk/~maslar/Kleinian.pdf
Georgakopoulos, A. and Hamann, M.
The planar Cayley graphs are effectively enumerable I: consistently planar graphs.
Combinatorica, to appear.
https://arxiv.org/pdf/1506.03361
Georgakopoulos, A. and Hamann, M.
The planar Cayley graphs are effectively enumerable II. Preprint
http://arxiv.org/pdf/1901.00347
Georgakopoulos, A., Haslegrave, J. and Montgomery, R.
Forcing large tight components in 3-graphs. Eur. J. Comb. 77 (2019) 57-67.
https://doi.org/10.1016/j.ejc.2018.11.001
https://arxiv.org/pdf/1801.01074
Georgakopoulos, A., Haslegrave, J., Montgomery, R. and Narayanan, B. P.
Spanning surfaces in 3-graphs. Preprint.
https://arxiv.org/pdf/1808.06864
Georgakopoulos, A. and Lehner, F.
Invariant spanning double rays in amenable groups. Preprint.
https://arxiv.org/pdf/1810.08116
Georgakopoulos, A. and Panagiotis, C.
Analyticity results in Bernoulli percolation. Preprint
https://arxiv.org/pdf/1811.07404
Georgakopoulos, A. and Wagner, S.
Subcritical graph classes containing all planar graphs. Combin. Probab. Comput 27
(2018) 763-773
https://doi.org/10.1017/S0963548318000056
http://arxiv.org/pdf/1701.00973
Georgakopoulos, A. and Wagner, S.
Limits of subcritical random graphs and random graphs with excluded minors.
Preprint.
http://arxiv.org/pdf/1512.03572
Georgiou, O.
[see: Coon, J. P.]
Gerke, S.
[see: Balister, P. N.]
Giannelli, E. and Law, S.
On permutation characters and Sylow p-subgroups of 𝑆𝑛. J. Algebra 506 (2018)
409-428.
https://doi.org/10.1016/j.jalgebra.2018.04.001
https://arxiv.org/pdf/1712.02642
Giannelli, E., Law, S. and Martin, S.
On the 𝑝′-subgraph of the Young graph. Algebras and Representtion Theory (2018)
1-24.
https://doi.org/10.1007/s10468-018-9791-7
https://arxiv.org/pdf/1707.00366
Giannelli, E.
[see: Bessenrodt, C.]
Gill, N. , Gillespie, N. I., Praeger, C. E. and Semeraro, J.
Conway groupoids, regular two-graphs and supersimple designs Sémin. Lothar.
Comb., to appear.
https://arxiv.org/pdf/1510.06680
Gill, N., Hunt, F. and Spiga, P.
Cherlin's conjecture for almost simple groups of Lie rank 1. Math. Proc. Camb.
Philos. Soc., to appear.
https://arxiv.org/pdf/1705.01344
Gill, N.
[see: Della Volta, F.]
Gillespie, N. I.
Equiangular lines, Incoherent sets and Quasi-symmetric designs . Preprint.
https://arxiv.org/pdf/1809.05739
Gillespie, N. I., Hawtin, D. R. and Praeger, C. E.
2-Neighbour-Transitive Codes with Small Blocks of Imprimitivity. Preprint.
https://arxiv.org/pdf/1806.10514
Gillespie, N. I.
[see: Cathain, P., Gill, N.]
Girão, A. A large number of m -coloured complete infinite subgraphs. Preprint.
https://arxiv.org/pdf/1806.03320
Girão, A. and Kang, R. J. Precolouring extension of Vizing's theorem. J. Graph Theory, to appear.
http://arxiv.org/pdf/1611.09002
Girão, A., Kittipassorn. T. and Narayanan, B. P.
Long cycles in Hamiltonian graphs. Isr. J. Math. 229 (2019) 269-285.
https://doi.org/10.1007/s11856-018-1798-6
https://arxiv.org/pdf/1709.04895
Girão, A., Letzter, S. and Sahasrabudhe, J.
Partitioning a graph into monochromatic connected subgraphs. J. Graph Theory, to
appear.
https://arxiv.org/pdf/1708.01284
Girão, A. and Mészáros, G.
An improved upper bound on the maximum degree of terminal-pairable complete
graphs. Discrete Math. 341 (2018) 2606-2607.
https://doi.org/10.1016/j.disc.2018.06.005
https://arxiv.org/pdf/1708.06837.pdf
Girão, A., Mészáros, G., Popielarz, K. and Synder, R.
On the maximum degree of path-pairable planar graphs. Electron. J. Comb., to appear.
https://arxiv.org/pdf/1705.06068
Girão, A., Mészáros, G. and Smith, S. G. Z.
On a conjecture of Gentner and Rautenbach. Discrete Math. 341 (2018)
1094-1097.
https://doi.org/10.1016/j.disc.2017.10.029
https://arxiv.org/pdf/1611.07513
Girão, A. and Popielarz, K.
Large induced subgraphs with k vertices of almost maximum degree. SIAM J.
Discrete Math. 32 (2018) 450-454.
https://doi.org/10.1137/17M1133907
https://arxiv.org/pdf/1705.08998
Girão, A. and Snyder, R.
Highly linked tournaments with large minimum out-degree. J. Comb. Theory Ser. B.,
to appear.
https://arxiv.org/pdf/1801.08249
Girão, A. [see: Cambie, S., Condon, P., Edwards, K.]
Giscard, P.-L and Rochet, P.
Enumerating Simple Paths from Connected Induced Subgraphs. Graphs. Comb. 34
(2018) 1197-1202.
https://doi.org/10.1007/s00373-018-1966-9
Giscard, P.-L, and Wilson, R. C.
A Centrality Measure for Cycles and Subgraphs II. Applied Network Science (2018)
3-9.
https://doi.org/10.1007/s41109-018-0064-5
https://arxiv.org/pdf/1802.06065
Giscard, P.-L.
[see: Bause, F.]
Giudici, M.
[see: Burness, T. C..]
Glebov, R., Klimošová, T. and Král’, D.
Infinite dimensional finitely forcible graphon. Proc. Lond. Math. Soc., to appear.
https://arxiv.org/pdf/1404.2743
Glen, M.. Kitaev, S. and Pyatkin, A.
On the representation number of a crown graph. Discrete Appl. Math. 244 (2018)
89-93.
https://doi.org/10.1016/j.dam.2018.03.013
http://arxiv.org/pdf/1609.00674
Glennon, S.
[see: Dugan, W.]
Glock, S. Triple systems with no three triples spanning at most five points. Bull. Lond. Math.
Soc., to appear.
http://web.mat.bham.ac.uk/S.Glock/53thm.pdf
Glock, S., Joos, F., Kühn, D. and Osthus, D.
Euler tours in hypergraphs. Preprint.
https://arxiv.org/pdf/1808.07720
Glock, S., Joos, F., Kim, J., Kühn, D. and Osthus, D.
Resolution of the Oberwolfach problem. Preprint.
https://arxiv.org/pdf/1806.04644
Glock, S., Kühn, D., Lo, A., Montgomery, R. and Osthus, D.
On the decomposition threshold of a given graph. J. Comb. Theory Ser. B ., to appear.
https://arxiv.org/pdf/1603.04724
Glock, S., Kühn, D., Montgomery, R. and Osthus, D.
Decompositions into isomorphic rainbow spanning trees. Preprint.
https://arxiv.org/pdf/1903.04262
Glock, S.
[see: Barber, B.]
Goaoc, X.
[see: Bárány, I.]
Goldberg, L. A. and Jerrum, M. R.
Approximating Pairwise Correlations in the Ising Model. Preprint.
https://arxiv.org/abs/1810.05830
Goldberg, L. A., Lapinskas, J., Lengler, J., Meier, F., Panagiotou, K. and Pfister,
P.
Asymptotically Optimal Amplifiers for the Moran Process. Theor. Comput. Sci. 758
(2019) 73-93
https://doi.org/10.1016/j.tcs.2018.08.005
https://arxiv.org/pdf/1611.04209
Goldberg, L. A.
[see: Bezakova, I.,. Blanca, A., Chen, Z., Focke, J., Galanis, A.]
Goldberg, P. W.
[see: Filos-Ratsikos, A.]
Goldreich, O. and Gur, T.
Universal Locally Testable Codes. Chic. J. Theor. Comput. Sci.2018 article 3 pp 1-21.
https://www.dcs.warwick.ac.uk/~tomgur/pdf/ULTC.pdf
Goldreich, O.
[see: Dinur, I. ]
Goldschmidt, C.
Scaling limits of random trees and random graphs. To appear in: Random Graphs,
Phase Transitions, and the Gaussian Free Field: Proceedings of the 2017 PIMS-CRM
Summer School in Probability (Barlow and Slade, eds.).
http://www.stats.ox.ac.uk/~goldschm/PIMSminicoursev2.pdf
Goldschmidt, C., Griffiths, S. and Scott, A. D. Moderate deviations of subgraph counts in the Erdős-Rényi random graphs G(n,m)
and G(n,p). Preprint.
https://arxiv.org/pdf/1902.06830
Goldschmidt, C., Haas, B. and Sénizergues, D.
Stable graphs: distributions and line-breaking construction. Preprint.
https://arxiv.org/pdf/1811.06940
Goldschmidt, C. and Kreačić, E. The spread of fire on a random multigraph. Adv. Appl. Probab., to appear.
http://www.stats.ox.ac.uk/~goldschm/Fires.pdf
Goldschmidt, C. and Przykucki, M. J.
Parking on a random tree. Combin, Probab. Comput. 28 (2019).23-45.
https://doi.org/10.1017/S0963548318000457
https://arxiv.org/pdf/1610.08786
Goldschmidt, C.
[see: Addario-Berry, L.]
Goldwasser, J. L.
[see: Axenovich, M.]
Golovach, P. A., Johnson, M., Martin, B., Paulusma, D. and Stewart, A.
Surjective H-Colouring: New Hardness Results. Computability 8 (2019) 27-42.
https://doi.org/10.3233/COM-180084
http://arxiv.org/pdf/1701.02188
Golovach, P. A., Kratsch, D., Paulusma, D. and Stewart, A.
Finding cactus roots in polynomial time. Theor. Comput. Sys.62 (2018) 11409-1426.
https://doi.org/10.1007/s00224-017-9825-2
Golovach, P. A. [see: Cochefert , M.]
Gondzio, J.
[see: Delorme, M.]
Gordon, S.
[see: Fearnley, J.]
Gortler, S., Theran, L. and Thurston, D.
Generic Unlabeled Global Rigidity. Preprint.
https://arxiv.org/pdf/1806.08688
Gortler, S. J.
[see: Connelly, R.] Goryainov, S. V.
[see: Bailey, R. A.]
Goulden, I. P., Granville, A., Richmond, L. B. and Shallit, J. O.
Natural exact covering systems and the reversion of the Möbius series. The
Ramanujan Journal (2018)
https://doi.org/10.1007/s11139-018-0030-y
http://de.arxiv.org/pdf/1711.04109.pdf
Gowers, W. T. and Janzer, O.
Subsets of Cayley graphs that induce many edges. Preprint.
https://arxiv.org/pdf/1809.10938
Gowers, W. T. and Long, J.
The length of an s-increasing sequence of r-tuples. Combin. Probab. Comput., to appear.
https://arxiv.org/pdf/1609.08688
Gowers, W. T. and Long, J.
Partial associativity and rough approximate groups. Preprint.
http://arxiv.org/pdf/1904.08732.pdf
Grabowski, J. and Gratz, S. Graded quantum cluster algebras of infinite rank as colimits. J. Pure. Appl. Algebra
222 (2018) 3395-3413.
https://doi.org/10.1016/j.jpaa.2017.12.014
http://arxiv.org/pdf/1510.04109
Gracar, A. and Stauffer, A.
Percolation of Lipschitz surface and tight bounds on the spread of information among
mobile agents. APPROX-RANDOM 2018.
http://dx.doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.39
http://drops.dagstuhl.de/opus/volltexte/2018/9443/pdf/LIPIcs-APPROX-RANDOM-
2018-39.pdf
Grace, K.
The Templates for Some Classes of Quaternary Matroids. Preprint.
https://arxiv.org/pdf/1902.07136
Grace, K. and van Zwam, S. H. M.
The Highly Connected Even-Cycle and Even-Cut Matroids. SIAM J. Discrete Math.
33 (2019) 26-67.
https://doi.org/10.1137/16M1097377
https://arxiv.org/pdf/1610.01106
Grace, K. and van Zwam, S. H. M.
On Perturbations of Highly Connected Dyadic Matroids . Ann. Comb. 22 (2018)
513-542.
https://doi.org/10.1007/s00026-018-0396-y
https://arxiv.org/pdf/1712.07702
Grace, K.
[see: Brettell, N., Campbell, R., Clark, B.]
Grannell, M. J.
[see: Demirkale, F., Donovan, D. M.]
Granville, A.
[see: Goulden, I. P.]
Gratz, S. [see: Grabowski, J.]
Gray, R. D. and Kambites, M.
On cogrowth, amenability and the spectral radius of a random walk on a semigroup.
Int Math. Res. Not. (2018) rny125.
https://doi.org/10.1093/imrn/rny125
https://arxiv.org/pdf/1706.01313
Gray, R. D.
[see: Cain, A. J., Coleman. T.]
Greaves, G. R, W, and Soicher, L. H.
On the clique number of a strongly regular graph. Electron. J. Combin. 25 (2018),
#P4.15.
http://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i4p15
Green, B. J. and Lindqvist, S.
Monochromatic solutions to 𝑥 + 𝑦 = 𝑧2 . Canad. J. Math.
https://doi.org/10.4153/CJM-2017-036-1
http://arxiv.org/pdf/1608.08374
Green, B. J. and Ruzsa, I. |Z.
On the arithmetic Kakeya conjecture of Katz and Tao. Period. Math. Hung. (2018).
https://doi.org/10.1007/s10998-018-0270-z
https://arxiv.org/pdf/1712.02108
Green, E. L. and Schroll, S.
Special multiserial algebras, Brauer configuration algebras and more: A survey,
Representations of algebras, Contemp. Math. 705 (2018)
Greenhill, C. S.
[see: Dyer, M. E.]
Green Larsen, K.
[see: Clifford, R.]
Griffiths, S.
[see: Ahlberg, D., Goldschmidt, C.]
Griggs, T. S., McCourt, T. A. and Širáň, J.
On the upper embedding of Steiner triple systems and Latin squares. Preprint.
Griggs, T. S.
[see: Donovan, D. M., Erskine, G.]
Grimm, U.
[see: Chan, L.]
Grimmett, G. R.
Probability on graphs. 2nd
edition. CUP, 2018.
http://www.statslab.cam.ac.uk/~grg/books/pgs.html
Grimmett, G. R. and Li, Z.
Critical surface of the 1-2 model. Int. Math. Res. Not. (2018) 6617–6672
https://doi.org/10.1093/imrn/rnx066
http://arxiv.org/pdf/1506.08406
Grimmett, G. R. and Li, Z.
Locality of connective constants. with Zhongyang Li. Discrete Math. 341 (2018)
3483–3497.
https://doi.org/10.1016/j.disc.2018.08.013
http://arxiv.org/pdf/1412.0150
Grindrod, P, Higham, D. J. and Noferini, V.
The deformed graph Laplacian and its applications to network centrality analysis.
SIAM Journal on Matrix Analysis and Applications 39 (2018) 310–341.
https://doi.org/10.1137/17M1112297
http://repository.essex.ac.uk/18919/1/Jan17.pdf
Grinshpun, A. [see: Conlon, D.]
Groenland, C., Okrasa, P., Rzążewski, P., Scott, A. D., Seymour, P. and Spirkl, S.
H-colouring Pt-free graphs in subexponential time. Discrete Appl. Math., to appear.
https://people.maths.ox.ac.uk/scott/Papers/ptfree.pdf
Groenland, C., Guggiari, H. and Scott, A. D.
Size reconstructibility of graphs. Preprint.
https://arxiv.org/pdf/1807.11733
Groenland, C. and Johnston, T.
Intersection sizes of linear subspaces with the hypercube. Preprint.
https://arxiv.org/pdf/1810.02729
Groenland, C. and Schaefer, G. The Curse of Ties in Congestion Games with Limited Lookahead. AAMAS2018.
https://arxiv.org/pdf/1804.07107.pdf
Groenland, C.
[see; Aaronson, J., Aru, J.]
Grønlund, A.,
[see: Clifford, R.]
Grossi, R.
[see: Alzamel, M., Ayad, L. A. K.]
Groult, R..
[see: Daykin, J. W.]
Gruenwald, S., Huber, K. T., Moulton, V. and Steel, M.
Combinatorial properties of triplet covers for binary trees. Adv. Appl. Math. 98 (2018)
59-82.
https://doi.org/10.1016/j.aam.2018.04.002
https://arxiv.org/pdf/1707.07908
Gruslys, V., Leader, I. B. and Tomon, I.
Partitioning the Boolean lattice into copies of a poset. J. Comb. Theory, Ser. A 161
(2018) 81-98
https://doi.org/10.1016/j.jcta.2018.07.003
https://arxiv.org/pdf/1609.02520
Gruslys, V. and Letzter, S. B.
Minimising the number of triangular edges. Combin. Probab. Comput. 27 (2018)
580-622.
https://doi.org/10.1017/S0963548317000189
http://arxiv.org/pdf/1605.00528
Gruslys, V. and Letzter, S. B.
Cycle partitions of regular graphs. Preprint.
https://arxiv.org/pdf/1808.00851
Gruslys, V. Letzter, S. B. and Morrison, N.
Hypergraph Lagrangians: Resolving the Frankl-Füredi conjecture. Preprint.
https://arxiv.org/pdf/1807.00793
Grzesik, A., Janzer. O. and Nagy, Z. L.
The Turán number of blow-ups of trees. Preprint.
http://arxiv.org/pdf/1904.07219.pdf
Grzesik, A., Král’, D. and Lovász, L. M.
Elusive extremal graphs. Preprint.
https://arxiv.org/pdf/1807.01141
Grzesik, A.
[see: Chan, T. F. N., Cooper, J. W.]
Guenin, B.
[see: Abdi, A.]
Guera, H. [see: Cameron, P. J.]
Guesnet, Y.
[see: Daykin, J. W.]
Guest, S.
[see: Fowler, P.]
Guggiari, H. and Scott, A. D.
Maximising H-colourings of graphs. J. Graph Theory, to appear.
https://arxiv.org/pdf/1611.02911
Guggiari, H., Roberts, A. and Scott, A. D.
Approximating the position of a hidden agent in a graph, Preprint.
https://arxiv.org/pdf/1805.04386
Guggiari, H.
[see: Bürger, C., Groenland, C.]
Gühne, O., Lockhart, J. and Severini, S.
Entanglement properties of quantum grid states. Phys. Rev. A 97 (2018) 062340.
https://doi.org/10.1103/PhysRevA.97.062340
https://arxiv.org/pdf/1705.09261
Guler, H.
[see: Cruickshank, J.]
Gunderson, K.
[see: Balister, P. N.]
Gunnells, P. E.
[see: Dugan, W.]
Guo, H, and He, K.
Tight bounds for popping algorithms. Preprint.
https://arxiv.org/pdf/1807.01680
Guo, H. and Jerrum, M. R.
A polynomial-time approximation algorithm for all-terminal network reliability.
SIAM J. Comput., to appear.
https://arxiv.org/pdf/1709.08561
Guo, H. and Jerrum, M. R.
Perfect simulation of the Hard Disks Model by Partial Rejection Sampling.
ICALP2018.
https://arxiv.org/pdf/1801.07342
Guo, H. and Jerrum, M. R.
Random cluster dynamics for the Ising model is rapidly mixing. Ann. Appl. Probab.
28 (2018) 1292-1313.
http://dx.doi.org/10.1214/17-AAP1335
https://arxiv.org/pdf/1605.00139
Guo, H. and Jerrum, M. R.
Approximately counting bases of bicircular matroids. Preprint.
https://arxiv.org/pdf/1808.09548
Guo, H., Jerrum, M. R. and Liu, J.
Uniform sampling through the Lovász Local Lemma. J. ACM, to appear.
http://arxiv.org/pdf/1611.01647
Guo, H,, Liao, C., Lu, P. and Zhang, C.
Counting hypergraph colorings in the local lemma regime. STOC18 926-939.
https://doi.org/10.1145/3188745.3188934
https://homepages.inf.ed.ac.uk/hguo/papers/hypercoloring.pdf
Guo, H,, Liao, C., Lu, P. and Zhang, C.
Zeros of Holant problems: locations and algorithms. SODA2019, to appear. https://arxiv.org/pdf/1807.09129
Guo, H. and Lu, P.
Spatial Mixing, and Approximation for Ferromagnetic 2-Spin Systems. ACM
Trans. Comput. Theory 10 (2018) no 17.
https://doi.org/10.1145/3265025
http://arxiv.org/abs/1511.00493
Guo, H.
[see: Bezakova, I., Cai, J.-Y., Cryan, M. E.]
Gur, T. and Lachish, O.
A Lower Bound for Relaxed Locally Decodable Codes. Preprint.
http://arxiv.org/pdf/1904.08112.pdf
Gur, T., Liu, Y. P. and Rothblum, R. P.
An Exponential Separation between MA and AM Proofs of Proximity. ICALP2018.
https://www.dcs.warwick.ac.uk/~tomgur/pdf/map_amp.pdf
Gur, T.
[see: Blais, E., Cannone, C., Chiesa, M., Dinur, I., Goldreich, O.]
Gutin, G.
Acyclic Digraphs. In:. Classes of Directed Graphs (J. Bang-Jensen and G. Gutin, eds).
125-172
Gutin, G., Mertzios, G. B. and Reidl, F.
Lower and Upper Bound for Computing the Size of All Second Neighbourhoods.
Preprint.
https://arxiv.org/pdf/1805.01687
Gutin, G., Ramanujan, M. S., Reidl, F. and Wahlstrom, M.
Path-contractions, edge deletions and connectivity preservation. J. Comput. Syst. Sci.
101 (2019) 1-20.
https://doi.org/10.1016/j.jcss.2018.10.001
https://arxiv.org/pdf/1704.06622
Gutin, G., Ramanujan, M. S., Reidl, F. and Wahlstrom, M.
Alternative parameterizations of Metric Dimension. Preprint.
https://arxiv.org/pdf/1804.10670
Gutin, G. Reidl, F. and Wahlstrom, M.
k-Distinct In-and Out-Branchings in Digraphs. J. Comput. Syst. Sci. 95 (2018) 86-97
https://doi.org/10.1016/j.jcss.2018.01.003
https://arxiv.org/pdf/1612.03607
Gutin, G. Reidl, F., Wahlstrom, M. and Zehavi, F.
Designing Deterministic Polynomial-Space Algorithms by Color-Coding Multivariate
Polynomials. J. Comput. Syst. Sci. 95 (2018) 69-85.
https://doi.org/10.1016/j.jcss.2018.01.004
https://arxiv.org/pdf/1706.03698.pdf
Gutin, G. and Sun, Y.
Strong Subgraph Connectivity of Digraphs: A Survey. Preprint.
https://arxiv.org/pdf/1808.02740
Gutin, G. and Sun, Y.
Strong subgraph k -arc-connectivity. Preprint.
https://arxiv.org/pdf/1805.01687
Gutin, G., Sun, Y, Yeo, A. and Zhang, X.
Strong Subgraph k-connectivity. J. Graph Theory, to appear.
https://arxiv.org/pdf/1803.00284
Gutin, G. Wahlstrom, M. and Zehavi, F.
On r –Simple k-Path and Related Problems Parameterized by k/r. SODA2019
1750-1769.
https://doi.org/10.1137/1.9781611975482.105
https://arxiv.org/pdf/1806.09108
Gutin, G.
[see: Ai, J., Bang-Jensen, J., Bergé, P.]
Gutman, Y. Manners, F. J. and Varjú, P. P.
The structure theory of Nilspaces I. J. Anal. Math., to appear.
https://arxiv.org/pdf/1605.08945
Gutman, Y. Manners, F. J. and Varjú, P. P.
The structure theory of Nilspaces II: Representation as nilmanifolds. Trans. Am. Math.
Soc. 371 (2019) 4951-4992.
https://doi.org/10.1090/tran/7503
http://arxiv.org/pdf/1605.08948
Guzman, R.
[see: Bi, R.]
Haas, B.
[see: Goldschmidt, C.]
Hagen, M.
[see: Behrstock, J.]
Hamann, M., Lehner, F., Miraftab, B. and Rühmann, T.
A Stallings' type theorem for quasi-transitive graphs. Preprint.
https://arxiv.org/pdf/1812.06312
Hamann, M.
[see: Georgakopoulos, A.]
Hamel, A. M5. and King, R. C.
Factorial characters of classical Lie groups and their combinatorial realisations. Eur.
J. Comb. 70 (2018) 325-353.
http://dx.doi.org/10.1016/j.ejc.2018.01.011
https://arxiv.org/pdf/1710.00638
Hamel, A. M. and King, R. C.
Factorial Q-functions and Tokuyama identities for classical Lie groups. Eur. J. Comb.
70 (2018) 89-113.
https://doi.org/10.1016/j.ejc.2018.05.009
Hàn, H.
[see: Aigner-Horev, E.]
Han, J., Jenssen, M., Kohayakawa, Y., Mota, G. O. and Roberts, B.
The multicolour size-Ramsey number of powers of paths. Preprint.
https://arxiv.org/pdf/1811.00844
Han, J., Morris, P. and Treglown, A.
Tilings in randomly perturbed graphs: bridging the gap between Hajnal-Szemerédi
and Johansson-Kahn-Vu. Preprint.
http://arxiv.org/pdf/1904.09930.pdf
Han, J.
[see: Böttcher, J.]
Hancock, R.
5 Now Foley – change will be made in subsequent bulletins.
The Maker-Breaker Rado game on a random set of integers. SIAM J. Discrete Math.
33 (2019) 68-94.
https://doi.org/10.1137/18M117488X
https://arxiv.org/pdf/1803.03793
Hancock, R., Staden, K. and Treglown, A.
Independent sets in hypergraphs and Ramsey properties of graphs and the integers.
SIAM J. Discrete Math. 33 (2019) 153-188
https://doi.org/10.1137/18M119642X
https://arxiv.org/pdf/1701.04754
Hancock, R.
[see: Garbe, F.]
Hansen, R.,
[see: Axenovich, M.]
Harper, A. J.
[see: Ford, K.]
Hart, S. B.
[see: Anabanti, C. S.]
Haslegrave, J.
Proof of a local antimagic conjecture. Discrete Math. Theor. Comput. Sci.20 (2018)
no 1.
http://dx.doi.org/10.23638/DMTCS-20-1-18
https://arxiv.org/pdf/1705.09957
Haslegrave, J. and Jordan, J.
Non-convergence of proportions of types in a preferential attachment graph with three
co-existing types. Electron. Commun. Probab. 23 (2018), paper no. 54, 12 pp
http://dx.doi.org/10.1214/18-ECP157
https://arxiv.org/pdf/1805.10071
Haslegrave, J., Jordan, J. and Yarrow, M.
Condensation in preferential attachment models with location-based choice. Preprint.
https://arxiv.org/pdf/1806.10959
Haslegrave, J.
[see: Georgakopoulos, A.]
Hatamo, N.,
[see: Delvenne, J.-C.]
Hawtin, D. R.
[see: Gillespie, N. I.]
He, K.
[see: Guo. H.]
He, X. [see: Conlon, D.]
Heckel, A.
Sharp concentration of the equitable chromatic number of dense random graphs.
Combin. Probab. Comput., to appear. .
https://arxiv.org/pdf/1712.07407
Heckel, A.
The chromatic number of dense random graphs. Random Struct. Algorithms 53 (2018)
140-182
https://doi.org/10.1002/rsa.20757
https://arxiv.org/pdf/1603.04836
Hefetz, D.
[see: Alon, N.]
Heinig, P. [see: Bowler, N.]
Heinlein, M.
[see: Bruhn, H.]
Heinrich, M.
[see: Delcourt, M.]
Heliou, A.
[see: Ayad, L. A. K.]
Hellmuth,M., Huber, K.T. and Moulton, V.
Reconciling Event-Labeled Gene Trees with MUL-trees and Species Networks.
Preprint.
https://arxiv.org/pdf/1812.09002
Henk, M.
[see: Aliev, I.]
Henzinger, M. [see: Bhattacharya, S.]
Herke, S.
[see: Bryant, D.]
Herman, R.
[see: Carlotti, A.]
Hermon, J.
A spectral characterization for concentration of the cover time. Preprint.
https://arxiv.org/pdf/1809.00145
Hermon, J. and Hutchcroft, T.
No percolation at criticality on certain groups of intermediate growth , Preprint.
https://arxiv.org/pdf/1809.11112
Hermon, J. and Peres, Y.
On sensitivity of mixing times and cutoff. Electron J. Probab. 23 (2018) no 25.
http://dx.doi.org/10.1214/18-EJP154
https://projecteuclid.org/download/pdfview_1/euclid.ejp/1521079338
Hermon, J. and Pymar, R. The exclusion process mixes (almost) faster than independent particles. Preprint.
https://arxiv.org/pdf/1808.10846
Hermon, J. and Salez, J. Modified log-Sobolev inequalities for strong-Rayleigh measures. Preprint.
https://arxiv.org/pdf/1902.02775
Hermon, J. and Salez, J. A version of Aldous’ spectral-gap conjecture for the zero range process. Ann. Appl.
Probab., to appear.
https://arxiv.org/pdf/1808.00325
Hermon, J, Sly, A.and Zhang,Y.
Rapid mixing of hypergraph independent sets. Random Struct. Algorithms, to appear.
https://arxiv.org/pdf/1610.07999
Hermon, J. and Sousi, P.
Random walk on dynamical percolation. Preprint.
https://arxiv.org/pdf/1902.02770
Hermon, J. and Thomas, S.
Cutoff for Mixing Times on Random Abelian Cayley Graphs. Preprint.
https://arxiv.org/pdf/1902.02770
van den Heuvel, J., Kierstead, H. J. and Quiroz, D.
Chromatic Numbers of Exact Distance and Weak Distance Graphs. J. Comb. Theory
Ser. B. 134 (2019) 143-163.
https://doi.org/10.1016/j.jctb.2018.05.007
http://arxiv.org/pdf/1612.02160
van den Heuvel, J. and Wood, D. R.
Improper Colourings inspired by Hadwiger's Conjecture. J. Lond. Math. Soc. 98
(2018) 129-148.
https://doi.org/10.1112/jlms.12127
http://arxiv.org/pdf/1704.06536.pdf
van den Heuvel, J. [see: Edwards, K., Eickmeyer, K.]
Higgins, P. M.
Involution matchings, the semigroup of orientation-preserving and orientation-
reversing mappings, and inverse covers of the full transformation semigroup.
Semigroup Forum, to appear.
https://arxiv.org/pdf/1811.04472
Higgins, P. M.
[see: Alwan, S.]
Higham, D. J.
Centrality-Friendship Paradoxes: When Our Friends Are More Important Than Us.
Preprint.
http://arxiv.org/pdf/1807.01496.pdf
Hilton, A. J. W. and Rajkumar, A.
The simple graph threshold number 𝜎(𝑟, 𝑠, 𝑎, 𝑡). Preprint.
https://arxiv.org/pdf/1902.05381
Hindman, N., Strauss, D. and Zamboni, L. Q.
Combining extensions of the Hales-Jewett\\ Theorem with Ramsey Theory\\ in other
structures. Preprint.
https://arxiv.org/pdf/1807.01485
van Hintum, P.
Biased partitions of 𝑍𝑛. Preprint.
https://arxiv.org/pdf/1805.05283
van Hintum, P. and Lammers, P.
The bunkbed conjecture on the complete graph. Eur. J. Comb. 76 (2019) 175-177.
https://doi.org/10.1016/j.ejc.2018.10.002
https://arxiv.org/pdf/1803.07647
Hirai, H., Iwamasa, Y., Murota, K. and Živný, S. Beyond JWP: A tractable class of binary VCSPs via M-convex intersection.
STACS2018.
http://dx.doi.org/10.4230/LIPIcs.STACS.2018.39
https://arxiv.org/pdf/1801.02199
Hirschfeld, J. W. P.
William Leonard Edge. Eur. J. Math. 4 (2018) 1293-1295.
Hirschfeld, J. W. P.
[see: Alabdullah, A.]
Hladký, J., Hu, P. and Piguet, D.
Komlós's tiling theorem via graphon covers. J. Graph Theory 90 (2019) 24-45.
https://doi.org/10.1002/jgt.22365
https://arxiv.org/pdf/1607.08415
Hladký, J.
[see: Allen, P., Garbe, F.]
Howell, J.
[see: Barnetson, K. D]
Hof, F., Kern, W., Kurz, S. and Paulusma, D.
Simple Games Versus Weighted Voting Games. SAGT 2018 69-81. Lect. Notes
Comput. Sci. 11059 (2018) 69-81.
https://doi.org/10.1007/978-3-319-99660-8_7
https://arxiv.org/pdf/1805.02192
Hof, F., Kern, W., Kurz, S., Pashkovich, K. and Paulusma, D.
Simple Games versus Weighted Voting Games: Bounding the Critical Threshold
Value, Preprint.
https://arxiv.org/pdf/1810.08841
Hofer-Temmel, C. and Lehner, F.
Clique Trees of Infinite Locally Finite Chordal Graphs. Electron. J. Comb. 25 (2018)
P2.9
http://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i2p9
Hoffmann, R., McCreesh, C., Ndojh Ndiaye, S., Prosser, P., Reilly, C., Solnon, C.
and Trimble, J.
Observations from Parallelising Three Maximum Common (Connected) Subgraph
Algorithms. CPAIOR 2018 298-315.
https://doi.org/10.1007/978-3-319-93031-2_22
http://www.dcs.gla.ac.uk/~ciaran/papers/cpaior2018-parallel-mcs.pdf
Hoffmann, R.
[see: Archibald, B., Estrada, E. ]
van der Hofstad, R.
[see: Federico, L.]
Holland, M. and Todd, M.
Weak convergence to extremal processes and record events for non-uniformly
hyperbolic dynamical systems. Ergodic Theory and Dynamical Systems 39 (2019)
980-1001
https://doi.org/10.1017/etds.2017.56
http://arxiv.org/pdf/1608.05620
den Hollander, F.
[see: Federico, L.]
Holmgren, C.
[see: Devroye, L.]
Holroyd, A. E., Hutchcroft, T. and Levy, A.
Finitely Dependent Cycle Coloring, Electron. Commun. Probab. 23 (2018) paper 64.
http://dx.doi.org/10.1214/18-ECP118
https://arxiv.org/pdf/1707.09374
Holroyd, A. E., Hutchcroft, T. and Levy, A.
Mallows Permutations and Finite Dependence. Ann. Probab., to appear.
https://arxiv.org/pdf/1706.09526
Holroyd, A. E., Martin, J. B. and Peres, Y. Stable matchings in high dimensions via the Poisson-weighted infinite tree. Annales
de l'Institut Henri Poincaré - Probabilités et Statistiques, to appear.
https://arxiv.org/pdf/1708.04519
Holt, D. F. and Royle, G. F.
A Census of Small Transitive Groups and Vertex-Transitive Graphs. Preprint.
http://arxiv.org/pdf/1811.09015.pdf
Homberger, C.
[see: Blackburn, S. R.]
House, T.
[see: Brightwell, G. R.]
Howard, D.
[see: Duffus, D.]
Hriňáková, K.
[see: Erskine, G.]
Hu, P.
[see; Hladký, J.]
Huang, S.
[see: Gaspers, S.]
Hubard, A.
[see: Bárány, I.]
Huber, F. and Severini, S.
Some Ulam's reconstruction problems for quantum states. J. Phys. A. 51 (2018) no. 43
https://doi.org/10.1088/1751-8121/aadd1e
https://arxiv.org/pdf/1802.00783
Huber, K. T,, Koolen, J. and Moulton, V.
The polytopal structure of the tight-span of a totally split-decomposable metric.
Discrete Math. 342 (2018) 868-878.
https://doi.org/10.1016/j.disc.2018.10.042
http://de.arxiv.org/pdf/1804.01821.pdf
Huber, K. T, Moulton, V., Sagot, M,-F. and Sinaimeri, B.
Geometric medians in reconciliation spaces of phylogenetic trees. Inf. Proc. Lett. 136
96-101.
http://dx.doi.org/10.1016/j.ipl.2018.04.001
https://arxiv.org/pdf/1707.00472
Huber, K. T, Moulton, V. and Scholz, G. E.
Three-way symbolic tree-maps and ultrametrics. Journal of Classification (2018)
https://doi.org/10.1007/s00357-018-9274-x
https://arxiv.org/pdf/1707.08010
Huber, K. T., Moulton, V., Semple, C. and Wu, T.
Quarnet inference rules for level-1 networks. Bull. Math. Biol.80 (2018) 2137-2153.
https://doi.org/10.1007/s11538-018-0450-2
https://arxiv.org/pdf/1711.06720
Huber, K. T., Moulton, V. and Steel, M.
Phylogenetic flexibility via Hall-type inequalities and submodularity. Bull. Math.
Biol.81 (2019) 598-617.
https://doi.org/10.1007/s11538-018-0419-1
https://arxiv.org/pdf/1710.08946
Huber, K. T., Moulton, V., and Wu, T.
Hierarchies from least stable ancestors in nonbinary phylogenetic networks. Journal
of Classification (2018)
https://doi.org/10.1007/s00357-018-9279-5
Huber, K. T.
[see : Bordewich, M. J., El-Mabrouk, N., Gruenwald, S.. Hellmuth, M.]
Hubička, J.
[see: Evans, D. M.]
Huczynska, S. and Paterson, M. B.
Weighted external difference families and R-optimal AMD codes. Discrete Math.
342 (2019) 855-867.
https://doi.org/10.1016/j.disc.2018.11.009
https://arxiv.org/pdf/1805.01330
Huczynska, S. and Paterson, M. B.
Characterising bimodal collections of sets in finite groups. Preprint.
https://arxiv.org/pdf/1903.11620
Hulshof, T.
[see: Federico, L.]
Hume, D. and Mackay, J. M.
Poorly connected groups. Preprint.
http://arxiv.org/pdf/1904.04639.pdf
Hunt, F.
[see: Gill, N.]
Hussain, S.
[see: AbouEisha, H.]
Hutchcroft, T.
New critical exponent inequalities for percolation and the random cluster model.
Preprint.
https://arxiv.org/pdf/1901.10363
Hutchcroft, T.
Indistinguishability of collections of trees in the uniform spanning forest. Preprint.
https://arxiv.org/pdf/1810.06382
Hutchcroft, T.
Locality of the critical probability for transitive graphs of exponential growth.
Preprint.
https://arxiv.org/pdf/1808.08940
Hutchcroft, T.
Percolation on hyperbolic graphs. Geom. Funct. Anal., to appear.
https://arxiv.org/pdf/1804.10191
Hutchcroft, T.
Universality of high-dimensional spanning forests and sandpiles. Preprint.
https://arxiv.org/pdf/1804.04120
Hutchcroft, T.
Self-avoiding walk on nonunimodular transitive graphs. Ann. Probab., to appear.
https://arxiv.org/pdf/1709.10515
Hutchcroft, T. Harmonic Dirichlet Functions on Planar Graphs. Discrete. Comput. Geom., to appear.
https://arxiv.org/pdf/1707.07751
Hutchcroft, T. and Peres, Y.
The component graph of the uniform spanning forest: transitions in dimensions
9,10,11,… Probab. Theory Relat. Fields (2018)
https://doi.org/10.1007/s00440-018-0884-3
https://arxiv.org/pdf/1702.05780
Hutchcroft, T.
[see: Angel, O., Foxall, E., Hermon, J., Holroyd, A. E.]
Huynh, T., Joos, F. and Wollan, P.
A unified Erdős-Posa theorem for constrained cycles. Combinatorica (2018)
https://doi.org/10.1007/s00493-017-3683-z
http://arxiv.org/pdf/1605.07082
Hyde, J., Liu, H. and Treglown, A.
A degree sequence Komlós theorem. Preprint.
https://arxiv.org/pdf/1807.10203
van Iersel, L., Janssen, R., Jones, M., Moulton, V. and Murakami, Y.
Reconstructing Tree-Child Networks from Reticulate-Edge-Deleted Subnetworks.
Preprint.
https://arxiv.org/pdf/1811.06777.pdf
van Iersel, L. and Moulton, V.
Leaf-reconstructibility of phylogenetic networks. SIAM J. Discrete Math. 32 (2018)
2047-2066.
https://doi.org/10.1137/17M1111930
https://arxiv.org/pdf/1701.08982
Iliopoulos, C. S.
[see: Alamro, H., Almirantis, Y., Alzamel, M., Ayad, L. A. K., Charalampopoulos, P.]
Iommi, G., Todd, M. and Velozo, A.
Upper semi-continuity of entropy in non-compact settings. Math. Res. Lett., to appear.
https://arxiv.org/pdf/1809.10022.pdf
Iwamasa, Y., Murota, K. and Živný, S.
Discrete Convexity in Joint Winner Property. Disc. Opt. 28 (2018) 78-88.
https://doi.org/10.1016/j.disopt.2018.01.001
https://arxiv.org/pdf/1701.07645
Iwamasa, Y. [see: Hirai, H.]
Ivanov, A. A.
[see: Franchi, C.]
Ivrissimtzis, I., Peyerimhoff, N. and Vdovina, A.
Trivalent expanders, (∆ − 𝑌)transformation, and hyperbolic surfaces. Preprint.
https://arxiv.org/pdf/1810.05532
Jaafari, N.
[see: Coja-Oghlan, A.]
Jackson, B., Kaszanitzky, V. and Nixon, A.
Rigid cylindrical frameworks with two coincident points, Graphs Comb. 35 (2019)
141-168.
https://doi.org/10.1007/s00373-018-1983-8
http://arxiv.org/pdf/1607.02039
Jackson, B. and Nixon, A.
Global rigidity of generic frameworks on the cylinder. J. Comb. Theory Ser B. , to
appear.
https://arxiv.org/pdf/1610.07755
Jackson, B. and Owen, J. C.
Equivalent realisations of a rigid graph. Discrete Appl. Math. 236 (2019) 42-58.
https://doi.org/10.1016/j.dam.2017.12.009
Jackson, B. and Owen, J. C.
Radically solvable graphs. J. Comb. Theory Ser. B. 136 (2019) 135-153.
https://doi.org/10.1016/j.jctb.2018.10.002
https://arxiv.org/pdf/1207.1580
Jackson, B.
[see: Cruichshank, J., Eftekhari, Y.]
Jajcay, R.
[see: Exoo, G.]
Janson, S., Riordan, O. M. and Warnke, L.
Sesqui-type branching processes. Stoch. Proc. Appl. 128 (2018) 3628-3655.
https://doi.org/10.1016/j.spa.2017.12.007
https://arxiv.org/pdf/1706.00283
Janson, S.
[see: Ahlberg, D., Cai, X. S.]
Janssen, R., Jones, M., Kelk, S., Stamoulis, G. and Wu, T.
Treewidth of display graphs: bounds, brambles and applications. Preprint.
https://arxiv.org/pdf/1809.00907
Janssen, R.
[see: van Iersel, L.]
Janzer, O.
Polynomial bound for the partition rank vs the analytic rank of tensors. Preprint.
https://arxiv.org/pdf/1902.11207
Janzer, O.
Low analytic rank implies low partition rank for tensors. Preprint.
https://arxiv.org/pdf/1809.10931
Janzer, O.
Improved bounds for the extremal number of subdivisions. Preprint.
https://arxiv.org/pdf/1809.00468
Janzer, O. [see: Conlon, D., Gowers, W. T., Grzesik, A.]
Járai, A. A.
[see: Barlow, M. T., Briggs, K. M.]
Jayawardene, C. J.
[see: Bollobás, B.]
Jeans, O.
[see: Erskine, G., Fraser, J.]
Jeavons, P.
[see: Cohen, D. A.]
Jefferson, C., Jonauskyte, E., Pfeiffer, M. and Waldecker, R.
Minimal and Canonical Images. J. Algebra 521 (2019) 481-506.
https://doi.org/10.1016/j.jalgebra.2018.11.009
http://arxiv.org/pdf/1703.00197
Jefferson, C., Pfeiffer, M. and Waldecker, R.
New refiners for permutation group search. J. Symb. Comput. 92 (2019) 70-92.
https://doi.org/10.1016/j.jsc.2017.12.003
http://arxiv.org/pdf/1608.08489
Jelínek, V. and Kučera, S.
On the structure of matrices avoiding interval-minor patterns. Adv. Appl. Math. 101
(2018) 70-99.
https://doi.org/10.1016/j.aam.2018.07.005
https://arxiv.org/pdf/1803.09003
Jelínek, V.
[see: Brignall, R.]
Jenssen, M., Joos, F. and Perkins, W.
On the hard sphere model and sphere packings in high dimensions. Forum. Math.
Sigma 7 (2019)
http://dx.doi.org/10.1017/fms.2018.25
https://arxiv.org/pdf/1707.00476
Jenssen, M., Joos, F. and Perkins, W.
On kissing numbers and spherical codes in high dimensions. Adv. Math. 335 (2018)
307-321.
http://dx.doi.org/10.1016/j.aim.2018.07.001
https://arxiv.org/pdf/1803.02702
Jenssen, M., Keevash, P. and Perkins, W.
Algorithms for #BIS-hard problems on expander graphs. SODA 2019: 2235-2247
https://doi.org/10.1137/1.9781611975482.135
http://arxiv.org/pdf/1807.04804
Jenssen, M.
[see: Clemens, D., Davies. E., Han, J.]
Jeong, J.
[see: Brignall, R., Dąbrowski, K. K.]
Jerrum, M. R.
[see: Goldberg, L. A., Guo, H.]
Jiang, T., Ma, J. and Yepremyan, L.
On Turán exponents of bipartite graphs. Preprint.
https://arxiv.org/pdf/1806.02838
Johansson, T.
[see: Cai, X. S.]
Johnson, M., Paesani, G. and Paulusma, D.
Connected Vertex Cover for (𝑠𝑃1 + 𝑃5) -Free Graphs. WG 2018. Lect. Notes Comput.
Sci. 11159 (2019) 279-291.
https://doi.org/10.1007/978-3-030-00256-5_23
Johnson, M. [see: Blanché, A., Bonamy, M., Bulteau, L, Feghali, C., Golovach, P. A.]
Johnson, M. E. and Tran, N. M.
Geometry and algorithms for upper triangular tropical matrix identities. Preprint.
https://arxiv.org/pdf/1806.01835
Johnson, M. E.
[see: Fenner, P.]
Johnson, O.
[see: Aldridge, M., Brown, S., Daly, F.]
Johnston, T. and Scott, A. D.
Lipschitz bijections between boolean functions. Preprint.
https://people.maths.ox.ac.uk/scott/Papers/lipschitz.pdf
Johnston, T.
[see; Aaronson, J., Aru, J., Groenland, C.]
Jonauskyte, E.
[see: Jefferson, C.]
Jones, G. A.
Unstable maps. Preprint.
https://arxiv.org/pdf/1810.02143
Jones, G. A.
Realisation of groups as automorphism groups in categories. Preprint.
https://arxiv.org/pdf/1807.00547
Jones, G. A.
Automorphism groups of maps, hypermaps and dessins. Preprint.
https://arxiv.org/pdf/1805.09764
Jones, M.
[see: Barbero, F., van Iersel, L., Janssen, R.]
Jones, S. A. M. and Thomas, R. M.
Word problems of groups: Formal languages, characterizations and decidability.
Theor. Comput. Sci. 750 (2018) 2-23.
https://doi.org/10.1016/j.tcs.2018.05.007
Jonsson, P.
[see: Bodirsky, M.]
Joos, F. and Perarnau, G.
Critical percolation on random regular graphs. Proc. Am. Math. Soc. 146 (2018)
3321-3332.
https://doi.org/10.1090/proc/14021
http://arxiv.org/pdf/1703.03639
Joos, F.
[see: Bruhn, H., Ehard, S., Glock, S., Huynh, T.. Jenssen, M. ] Jordan, J.
Preferential attachment graphs with co-existing types of different fitnesses J. Appl.
Probab. 55 (2018) 1211-1227.
https://doi.org/10.1017/jpr.2018.80
https://arxiv.org/pdf/1803.08728
Jordan, J.
The connected component of the partial duplication graph. ALEA, 15 (2018)
1431-1445.
https://arxiv.org/pdf/1712.06411
Jordan, J.
[see: Freeman, N., Haslegrave, J.]
Joswig, M. and Smith, B.
Polyhedral Tropical Geometry of Higher Rank. Preprint.
https://arxiv.org/pdf/1809.01457
Jung, J.-H.
[see: Cheon, G.-S.]
Junge, M.
[see: Foxall, E.]
Jurdziński, M. [see: Czerwiński, W ., Czumaj, A., Daviaud, L.]
Jurina, Š.
[see: Cameron, P. J.]
Juul, J. S. and Porter, M. A.
Hipsters on Networks: How a Small Group of Individuals Can Lead to an Anti-
Establishment Majority. Phys. Rev. E 99 (2019) 022313
https://doi.org/10.1103/PhysRevE.99.022313
https://arxiv.org/pdf/1707.07187
Kaaser, D.
[see: Berenbrink, P.]
Kalcsics, J.
[see: Delorme, M.]
Kambites, M.
[see: Fenner, P., Gray, R. D.]
Kamčev, N.
[see: Conlon, D.]
Kanade, V., Malmann-Trenn, F. and Sauerwald, T.
On coalescence time in graphs--when is coalescing as fast as mixing? SODA2019, to
appear.
https://doi.org/10.1137/1.9781611975482.59
https://arxiv.org/pdf/1611.02460
Kanade, V.
[see: Cohen-Addad, V.]
Kang, D. Y., Kim, J. and Liu, H.
On the rational Turán exponents conjecture. Preprint.
https://arxiv.org/pdf/1811.06916
Kang, M.
[see: Cooley, O.]
Kang, N. and Rivera, N.
Best-of-Three Voting on Dense Graphs. Preprint.
https://arxiv.org/pdf/1903.09524
Kang, R. J. [see: Cambie, S., Edwards, K., Girão, A.]
Kangaslampi, R.
[see: Cushing, D.]
Kanté M. [see: Dąbrowski, K. K.]
Kao, R. R. [see: Enright, J.]
Kapetanopoulos, T.
[see: Cooley, O.]
Kärkkäinen, J.
[see: Badkobeh, G.]
Károlyi, Gy.
[see: Bárány, I.]
Kasbohm, E.
[see: Bordewich, M. J.]
Kasprzyk, A. M., Nill, B. and Prince, T.
Quasi-period collapse for duals to Fano polygons: an explanation arising from
algebraic geometry. Preprint.
https://arxiv.org/pdf/1810.12472
Kaszanitzky, V.
[see: Jackson, B.]
Kauffman, L. H.
[see: Ellis-Monaghan, J. A.]
Kawarabayashi, K.
[see: Eickmeyer, K.,]
Kayaturian, G. C. and Vernitski, A.
Encoding shortest paths in graphs assuming the code is queried using bit-wise
comparison, Preprint.
https://arxiv.org/pdf/1806.09442
Keevash, P.
Coloured and directed designs. Preprint.
https://arxiv.org/pdf/1807.05770
Keevash, P.
Hypergraph matchings and designs. To appear in the Proceedings of the 2018
International Congress of Mathematicians.
http://people.maths.ox.ac.uk/keevash/papers/icm-survey-arxiv.pdf
Keevash, P.
Counting designs. J. Eur. Math. Soc. 20 (2018) 903--927.
http://dx.doi.org/10.1471/JEMS/779 rg
Keevash, P., Long, E. P. and Skokan, J.
Cycle-complete Ramsey numbers. Preprint.
https://arxiv.org/pdf/1807.06376
Keevash, P. and Yepremyan, L.
Rainbow matchings in properly-coloured multigraphs. SIAM J. Discrete Math. 32
(2018) 1577-1584
http://dx.doi.org/10.1137/17M1151742
https://arxiv.org/pdf/1710.03041
Keevash, P. and Yepremyan, L.
On the number of symbols that forces a transversal. Preprint.
https://arxiv.org/pdf/1805.10911
Keevash P.
[see: Jenssen, M.]
Kelk, S., Stamoulis, G. and Wu, T. Treewidth distance on phylogenetic trees. Theor. Comput. Sci. 731 (2018)
99-117.
https://doi.org/10.1016/j.tcs.2018.04.004
https://arxiv.org/pdf/1703.10840
Kelk, S.,
[see: Janssen, R.]
Keller, A.
[see: Boyer, K.]
Keller, N.
[see: Ellis, D.]
Kenyon, R., Král’, D., Radin, C. and Winkler, P. M.
Permutations with fixed pattern densities. Random Struct. Algorithms, to appear.
https://arxiv.org/pdf/1506.02340
Keough, L. [see: Bjorkman, B.]
Kern, W. and Paulusma, D.
Contracting to a Longest Path in H-Free Graphs. Preprint.
https://arxiv.org/pdf/1810.01542
Kern, W.
[see: Biró, P., Hof, F.]
Kessar, R., Linckelmann, M., Lynd, J. and Semeraro, J.
Weight conjectures for fusion systems. Preprint.
https://arxiv.org/pdf/1810.01453
Key, J. D.
[see: Fish, W.]
Kharlampovich, O. and Vdovina, A.
Low complexity algorithms in knot theory. Int. J. Algebr. Comput., to appear.
https://arxiv.org/pdf/1803.04908
Kierstead, H. J.
[see: van den Heuvel, J.]
Kim, J., Kim, Y, and Liu, H.
Two conjectures in Ramsey-Turán theory. SIAM J. Discrete Math., to appear.
https://arxiv.org/pdf/1803.04721
Kim, J., Kim, Y, and Liu, H.
Tree decompositions of graphs without large bipartite holes. Preprint.
https://arxiv.org/pdf/1807.08423
Kim, J., Kühn, D., Kupavskii, A. and Osthus, D. Rainbow structures in locally bounded colourings of graphs. Preprint.
http://web.mat.bham.ac.uk/D.Osthus/Stein-multicolor22MayV2.pdf
Kim, J., Kühn, D., Osthus, D. and Townsend, T.
Forbidding induced even cycles in a graph: Typical structure and counting, J. Comb.
Theory Ser. B 131 (2018), 170-219.
https://doi.org/10.1016/j.jctb.2018.02.002
https://arxiv.org/pdf/1507.04944
Kim, J., Kühn, D., Osthus, D. and Tyomkyn, M.
A blow-up lemma for approximate decompositions. Trans. Am. Math. Soc. 371 (2019)
4655-4742
https://doi.org/10.1090/tran/7411
https://www.ams.org/journals/tran/2019-371-07/S0002-9947-2018-07411-6/S0002-
9947-2018-07411-6.pdf
Kim, J.
[see: Cheon, G.-S., Condon, P., Glock, S., Han, J., Kang, D. Y.]
Kim, J. H..
[see: Conlon, D.]
Kim, M. [see: Cheon, G.-S.]
Kim, Y.
[see: Kang, D. Y., Kim, J.]
King, R. C.
[see: Hamel, A. M.]
Kirsch, R. and Radcliffe, A. J.
Many triangles with few edges. Electron. J. Comb. to appear.
https://arxiv.org/pdf/1709.06163
Kirsch, R. [see: Bjorkman, B., Boyer, K.]
Kiselev, S. and Kupavskii, A,
Sharp bounds for the chromatic number of random Kneser graphs and hypergraphs.
Preprint.
https://arxiv.org/pdf/1810.01161
Kitaev, S., Potapov, V. N. and Vajnovszki, V.
On shortening u-cycles and u-words for permutations. Dis crete Appl. Math., to
appear.
https://arxiv.org/pdf/1707.06110
Kitaev, S. and Pyatkin, A.
Graphs representable by words: a survey of results. Diskretny Analiz i Issledovanie
Operacii 25 (2018) 10-53. 6
https://doi.org/10.17377/daio.2018.25.588
6 In Russian. There is an English translation in: Journal of Applied and Industrial Mathematics
12 (2018) 2, 278-296.
https://pure.strath.ac.uk/ws/portalfiles/portal/70830262/Kitaev_Pyatkin_DAIO2017_
Word_representative_graphs_a_survey.pdf
Kitaev, S. and Saito, A.
On semi-transitive orientability of Kneser graphs and their complements. Preprint.
https://arxiv.org/pdf/1903.02777
Kitaev, S. and Zhang, P. B Distributions of mesh patterns of short lengths. Preprint.
Kitaev, S., Zhang, P. B. and Zhang, X.
Distributions of several infinite families of mesh patterns. Preprint.
https://arxiv.org/pdf/1903.00672
Kitaev, S.
[see: Akgün, O., Cheon, G.-S., Enright, J., Gao, A., Glen, M.]
Kitson, D., Nixon, A. and Schulze, B.
Rigidity of symmetric frameworks in normed spaces. Preprint.
https://arxiv.org/pdf/1808.04484
Kitson, D. and Power, S. C.
The rigidity of infinite graphs. Discrete Comput. Geom. 60 (2018) 531–557
https://doi.org/10.1007/s00454-018-9993-0
https://arxiv.org/pdf/1310.1860
Kitson, D. and Schulze, B.
Motions of grid-like reflection frameworks. J. Symb. Comput. 88 (2018) 47-66.
https://doi.org/10.1016/j.jsc.2018.02.004
https://arxiv.org/pdf/1709.09026
Kitson, D.
[see: Clinch, K.]
Kittipassorn, T.
[see: Girão, A.]
Klaus, B.
[see: Cechlárová, K.]
Klavžar, S.
[see: Alikhani, S.]
Klein, S.
[see: Alves, S. R.]
Klimosová, T., Malik, J., Masarik, T., Novotná, J., Paulusma, D. and Slívová, V.
Colouring (𝑃𝑟 + 𝑃𝑠)-Free Graphs. ISAAC2018.
http://dx.doi.org/10.4230/LIPIcs.ISAAC.2018.5
http://drops.dagstuhl.de/opus/volltexte/2018/9953/pdf/LIPIcs-ISAAC-2018-5.pdf
Klimošová, T.
[see: Glebov, R.]
Kling, P.
[see: Berenbrink, P.]
Klinkaby, K. Z.
[see: Bang-Jensen, J.]
Ko, S.-K. and Potapov, I.
Vector Ambiguity and Freeness Problems in SL(2, ℤ). Fund. Inf. 162 (2018)
161-182.
http://dx.doi.org/10.3233/FI-2018-1719
Ko, S.-K., Niskanen, R. and Potapov, I.
On the Identity Problem for the Special Linear Group and the Heisenberg Group
ICALP2018.
http://dx.doi.org/10.4230/LIPIcs.ICALP.2018.132
http://drops.dagstuhl.de/opus/volltexte/2018/9136/pdf/LIPIcs-ICALP-2018-132.pdf
Koch, C.
[see: Allen, P., Barhoumi-Andreani, Y., Cooley, O.]
Kochhar, J. and Wildon, M.R.
A combinatorial proof of the Murnaghan--Nakayama rule, Preprint.
https://arxiv.org/pdf/1805.00255
Kociumaka, T.
[see: Almazel, M., Charalampopoulos, P., Clifford, R.]
Koh, C. and Sanita, L.
Stabilizing Weighted Graphs, ICALP2018.
http://dx.doi.org/10.4230/LIPIcs.ICALP.2018.83
http://drops.dagstuhl.de/opus/volltexte/2018/9087/pdf/LIPIcs-ICALP-2018-83.pdf
Koh, C. and Sanita, L.
An Efficient Characterization of Submodular Spanning Tree Games. IPCO2019, to
appear.
Kohayakawa, Y.
[see: Böttcher, J., Clemens, D., Han, J.]
Kolpakov, I.
[see: Ciobanu, L.]
Komjáth, P., Leader, I. B., Russell, P. A., Shelah, S., Soukup, D. T. and
Vidnyánszky, Z.
Infinite monochromatic sumsets for colourings of the reals. Proc. Am. Math. Soc., to
appear.
https://arxiv.org/pdf/1710.07500
Komjáth, P. [see: Bowler, N.]
Komusiewicz, C [see: Fluschnik, T.]
Konrad, C. and Zamaraev, V.
Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal
Graphs. Preprint.
https://arxiv.org/pdf/1805.04544.pdf
Konrad, C.
[see: Czumaj, A.]
Konyagin, S. V.
[see: Ford, K.]
Koolen, J.
[see:Cushing, D., Huber, K. T.]
Korándi, D., Lang, R., Letzter, S. and Pokrovskiy, A.
Minimum degree conditions for monochromatic cycle partitioning. Preprint.
https://arxiv.org/pdf/1902.05882
Kostochka, A. V.
[see: Choi, I.]
Kowalski, D. R.
[see: Chrobak, M.]
Kozlik, A.
[see: Donovan, D. M.]
Král’, D., Lidický, B., Martins, T. and Pehova, Y.
Decomposing graphs into edges and triangles. Combin. Probab. Comput., to appear.
https://arxiv.org/pdf/1710.08486
Král’, D., Lovász, L. M., Noel, J. A. and Sosnovec, J.
Finitely forcible graphons with an almost arbitrary structure. Preprint.
https://arxiv.org/pdf/1809.05973
Král’, D., Martins, T., Pach, P. P. and Wrochna, M.
The step Sidorenko property and non-norming edge-transitive graphs. J. Comb.
Theory Ser. A 162 (2019) 34-54.
https://doi.org/10.1016/j.jcta.2018.09.012
https://arxiv.org/pdf/1802.05007
Král’, D., Norin, S. and Volec, J.
A bound on the inducibility of cycles. J. Comb. Theory. Ser. A 161 (2019) 359-363.
https://doi.org/10.1016/j.jcta.2018.08.003
https://arxiv.org/pdf/1801.01556
Král’, D.
[see: Chan, T. F. N., Cooper, J. W.. Dvořák, Z., Glebov, R., Kenyon, R.]
Kratsch, D.
[see: Cochefert , M., Golovach, P. A.]
Kratsch, S., Li, S., Marx, D., Pilipczuk, M. and Wahlström, M. Multi-budgeted directed cuts. Preprint.
https://arxiv.org/pdf/1810.06848
Krattenthaler, C. and Müller, T. W.
Motzkin numbers and related sequences modulo powers of 2. Eur. J. Comb. 73 (2018)
114-137.
https://doi.org/10.1016/j.ejc.2018.05.004
https://arxiv.org/pdf/1608.05657
Krause, P. K.
[see: Adler, I.]
Kreačić, E. [see: Goldschmidt, C.]
Kreutzer, S.
[see: Eickmeyer, K.]
Kriege, N. M.
[see: Bause, F.]
Krivelevich, M.
[see: Alon, N.]
Krokhin, A. and Opršal, J.
The complexity of 3-colouring H-colourable graphs. Preprint.
https://arxiv.org/pdf/1904.03214
Krokhin, A.
[see: Bulin, J., Cohen, D. A., Dalmau, V., Kolmogorov, V.]
Kučera, S.
[see: Jelínek, V.]
Kucherov, G.
[see: Crochemore, M.]
Kühn, D.
[see: Barber, B., Condon, P., Glock, S., Kim, J.]
Kulkarni, J. [see: Bhattacharya, S.]
Kundu, R.
[see: Alzamel, M.]
Kupavskii, A.
Degree versions of theorems on intersecting families via stability. Preprint.
https://arxiv.org/pdf/1810.00915
Kupavskii, A.
Structure and properties of large intersecting families. Preprint.
https://arxiv.org/pdf/1810.00920
Kupavskii, A.
Random Kneser graphs and hypergraphs. Electron. J. Comb. 25 (2018) P4.52
https://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i4p52/pdf
Kupavskii, A.
Diversity of uniform intersecting families. Eur. J. Comb. 74 (2018) 39-47.
https://doi.org/10.1016/j.ejc.2018.07.005
https://arxiv.org/pdf/1709.02829
Kupavskii, A., Mustafa, N. H. and Swanepoel, K. J.
Bounding the size of an almost-equidistant set in Euclidean space. Combin. Probab.
Comput., to appear.
https://arxiv.org/pdf/1708.01590
Kupavskii, A., Pach, J. and Tardos, G. Tilings with noncongruent triangles. Eur. J. Comb. 73 (2018) 72-80.
https://doi.org/10.1016/j.ejc.2018.05.005
https://arxiv.org/pdf/1711.04504
Kupavskii, A., Pach, J. and Tardos, G. Controlling Lipschitz functions. Mathematika 64 (2018) N3, 898--910.
https://doi.org/10.1112/S0025579318000311
https://arxiv.org/pdf/1704.03062
Kupavskii, A., Pach, J. and Tardos, G. Tilings of the plane with unit area triangles of bounded diameter. Acta. Math. Hung.,
155 (2018) N1, 175-183
https://doi.org/10.1007/s10474-018-0808-9
https://arxiv.org/pdf/1712.03118
Kupavskii, A., Pach, J. and Tomon, I.
On the size of k -cross-free families. Combinatorica (2018)
https://doi.org/10.1007/s00493-017-3792-8
http://arxiv.org/pdf/1704.02175
Kupavskii, A. and Welzl, E. Lower Bounds for Searching Robots, some Faulty. PODC2018.
https://doi.org/10.1145/3212734.3212745
https://arxiv.org/pdf/1707.05077
Kupavskii, A. and Zhukovskii, M. Short monadic second-order sentences about sparse random graphs. SIAM J. Discrete
Math. 32 (2018) N4, 2916–2940
https://doi.org/10.1137/16M1103105
https://arxiv.org/pdf/1611.07260
Kupavskii, A.
[see: Csikos, M., Frankl, P., Fulek, R., Kim, J. Kiselev, S.]
Kurz, S.
[see: Hof, F.]
Kusuma, J.
[see: Cameron, P. J. ]
Kuszner, L.
[see: Akrida, E. C.]
Kwan, M.
[see: Bucic, M., Conlon, D.]
Kwon, S-i. Oum
[see: Dąbrowski, K. K.]
Kynčl, J.
[see: Brignall, R.]
Lachish, O.
[see: Blanchard, E., Gur, T.]
Łącki, J.
[see: Czumaj, A.]
Lamaison, A.
[see: Corsten, J.]
Lammers, P.
[see: van Hintum, P.]
Lamprou, I., Martin, R. and Schewe, S.
Eternally dominating large grids. Theor. Comput. Sci., to appear.
Lamprou, I., Martin, R., Schewe, S., Siqalas, I. and Zissimopoulos, V.
Maximum Rooted Connected Expansion, MFCS2019.
http://dx.doi.org/10.4230/LIPIcs.MFCS.2018.25
http://drops.dagstuhl.de/opus/volltexte/2018/9607/pdf/LIPIcs-MFCS-2018-25.pdf
Lamprou, I., Martin, R. and Spirakis, P. G.
Cover Time in Edge-Uniform Stochastically-Evolving Graphs. Algorithms 2018, 11 ,
149
https://doi.org/10.3390/a11100149
Lamzouri, Y.
[see: Ford, K.]
Lang, R. and Lo, A.
Monochromatic cycle partitions in random graphs. Preprint.
https://arxiv.org/pdf/1807.06607
Lang, R.
[see: Bruhn, H., Corsten, J., Korándi, D.]
Lapinskas, J.
[see: Dell, H., Goldberg, L. A.]
Larcombe, P. J. and O’Neill, S. T.
A Generating Function Approach to the Automated Evaluation of Sums of
Exponentiated Multiples of Generalized Catalan Number Linear Combinations.
Fibonacci Quarterly 56 (2018) 121–125.
Larose, B., Martin, B . and Paulusma, D.
Surjective H-Colouring over Reflexive Digraphs. ACM Trans., Comput. Theory. 11
(2019) article 3.
https://doi.org/10.1145/3282431
https://arxiv.org/pdf/1709.09486
Larsson, J. and Markström, K.
Polarized random k-SAT. Preprint.
Law, S.
[see: Giannelli, E.]
Lazic, R.
[see: Czerwiński, W., Daviaud, L. ]
Leader, I. B., Letzter, S., Narayanan, B. P. and Walters, M. J.
Product-free sets in the free semigroup. Preprint.
https://arxiv.org/pdf/1812.04749
Leader, I. B. and Raty, E.
A Note on Intervals in the Hales-Jewett Theorem. Electron. J. Comb. 25 (2018) P3.25.
https://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i3p15/pdf
Leader, I. B. and Russell, P. A. Inhomogeneous Partition Regularity. Preprint.
https://arxiv.org/pdf/1806.11374
Leader, I. B.
[see: Balister, P. N., Duffus, D., Gruslys, V., Komjáth, P.]
Lecroq, T.
[see: Daykin, J. W.]
Lee, C.
[see: Conlon, D.]
Lee, J.
[see: Balister, P. N., Conlon, D.]
Lee, J.-B ., Noel, J. A. and Siggers, M.
Reconfiguring Graph Homomorphisms on the Sphere, Preprint.
https://arxiv.org/abs/1810.01111
van Leeuwen, E. J., Martin, B. and Paulusma, D.
Disconnected Cuts in Claw-free Graphs. ESA2018.
http://dx.doi.org/10.4230/LIPIcs.ESA.2018.61
https://arxiv.org/pdf/1803.03663
Lefebvre, A.
[see: Daykin, J. W.]
Lehner, F. On the cop number of toroidal graphs. Preprint.
http://arxiv.org/pdf/1904.07946.pdf
Lehner, F. , Pilśniak, M. and Stawiski, M.
Distinguishing infinite graphs with bounded degrees. Preprint.
https://arxiv.org/pdf/1810.03932
Lehner, F. and Smith, S. M.
On symmetries of edge and vertex colourings of graphs. Preprint.
https://arxiv.org/pdf/1807.01116
Lehner, F. and Verret, G. Distinguishing numbers of finite 4-valent vertex-transitive graphs. Preprint.
https://arxiv.org/pdf/1810.01522
Lehner, F. [see:Alikhani, S., Bowler, N., Carmesin, J., Georgakopoulos, A., Hamann, M., Hofer-
Temmel, C.]
Lejeune, M., Lozin, V. V., Lozina, I., Ragab. A. and Yacout, S.
Recent advances in the theory and practice of Logical Analysis of Data. Eur. J. Oper.
Res. 275 (2019) 1-15.
https://doi.org/10.1016/j.ejor.2018.06.011
Lengler, J.
[see: Goldberg, L. A.]
Léonard, M.
[see: Daykin, J. W.]
Letchford, A. N.
[see: Galli, L.]
Letzter, S. and Sahasrabudhe, J.
On Existentially Complete Triangle-free Graphs, Isr. J. Math., to appear.
https://arxiv.org/pdf/1708.08817
Letzter, S.
[see: Girão, A., Gruslys, V., Korándi, D., Leader, I. B.]
Lev, V. F. and Rudnev, M.
Minimizing the sum of projections of a finite set. Discrete Compu. Geom. 60 (2018)
493-511.
https://doi.org/10.1007/s00454-018-9975-2
http://arxiv.org/pdf/1610.02504
Levin, D. A.
[see: Cannon, S.]
Levy, A.
[see: Holroyd, A. E.]
Lewis, R. R.
The degree-diameter problem for circulant graphs of degrees 10 and 11. Discrete
Math. 341 (2018) 2553–2566.
https://doi.org/10.1016/j.disc.2018.05.024
https://arxiv.org/pdf/1803.07071
Li, S. [see: Kratsch, S.]
Li, Z.
[see: Grimmett, G. R.]
Liao, C.
[see: Guo, H.]
Lidbetter, T.
[see: Alpern, S.]
Lidický, B.
[see: Axenovich, M., Bennett, P., Bucic, M., Král’, D.]
Liebeck, M. W. and Shalev, A.
Girth, words and diameter. Preprint.
https://arxiv.org/pdf/1903.00748
Liebenau, A.
[see: Choromanski, K.]
Lifshitz, N.
[see: Ellis, D.]
Lima, P. T.
[see: Galby, E.]
Lin, A. and Swanepoel, K. J.
On sets defining few ordinary hyperplanes . Preprint.
https://arxiv.org/pdf/1808.10849
Lin, A. and Swanepoel, K. J.
Ordinary planes, coplanar quadruples, and space quartics. J. Lond. Math. Soc., to
appear.
https://arxiv.org/pdf/1808.10847
Lin, M. C., Lozin, V. V., Moyano, V. A. and Szwarcfiter, J. L.
Perfect Edge Domination: Hard and Solvable Cases. Ann. Oper. Res 264.(2018)
287-305.
https://doi.org/10.1007/s10479-017-2664-3
https://arxiv.org/pdf/1705.08379
Linckelmann, M.
[see: Kessar, R.]
Lindqvist, S.
[see: Chow, S., Green, B. J.]
Lipiäinen, V.
[see: Cushing, D.]
Lischeid, J.
[see: Bläsius, T.]
Liu, C.
[see: Alzamel, M., Charalampopoulos, P.]
Liu, C.-H.
[see; Chudnovsky, M.]
Liu, F., Siemons, I. J. and Wang, W.
New families of graphs determined by their generalized spectrum. Discrete Math. 342
(2018) 1108-1112
https://doi.org/10.1016/j.disc.2018.12.020
https://arxiv.org/pdf/1803.11275
Liu, H. and Sharifzadeh, M.
Groups with few maximal sum-free sets, Preprint.
https://arxiv.org/pdf/1811.05811
Liu, H. and Pach, P. P. The number of multiplicative Sidon sets of integers. J. Comb. Theory. Ser. A. 165
(2019) 152-175.
https://doi.org/10.1016/j.jcta.2019.02.002
https://arxiv.org/pdf/1808.06182
Liu, H., Pach, P. P. and Palincza, R. The number of maximum primitive sets of integers. Preprint.
https://arxiv.org/pdf/1805.06341
Liu, H., Pach, P. P. and Sándor, Cs.
Polynomial Schur's theorem, Preprint.
https://arxiv.org/pdf/1811.05200
Liu, H., Pikhurko, O. and Sharifzadeh, M. Edges not in any monochromatic copy of a fixed graph, J. Comb. Theory. Ser. B 135
(2019) 16-43.
https://doi.org/10.1016/j.jctb.2018.07.007
http://homepages.warwick.ac.uk/staff/H.Liu.9/NIM-Sep13.pdf
Liu, H.
[see: Balogh, J., Barhoumi-Andreani, Y, Hyde, J., Kim, J.]
Liu, S. , Münch, F. and Peyerimhoff, N.
Curvature and higher order Buser inequalities for the graph connection Laplacian.
SIAM J. Discrete Math. 33 (2019) 257-305
https://doi.org/10.1137/16M1056353
https://arxiv.org/pdf/1512.08134
Liu, S. , Münch, F. and Peyerimhoff, N.
Rigidity properties of the hypercube via Bakry-Émery curvature. Preprint.
https://arxiv.org/pdf/1705.06789.pdf
Liu, S. , Münch, F., Peyerimhoff, N. and Rose, C.
Distance bounds for graphs with some negative Bakry-Émery curvature. Analysis and
Geometry in Metric Spaces 7 (2019) 1-14
https://doi.org/10.1515/agms-2019-0001
https://arxiv.org/pdf/1705.08119
Liu, S. and Peyerimhoff, N.
Eigenvalue ratios of nonnegatively curved graphs. Combin. Probab. Comput. 27
(2018) 829-850
https://doi.org/10.1017/S0963548318000214
https://arxiv.org/pdf/1406.6617
Liu, S.
[see: Bourne, D., Cushing, D.] Liu, Y. P.
[see: Gur, T.]
Liu, Z.
[see: Kanade, V.]
Lo, A.
Long properly coloured cycles in edge-coloured graphs. J. Graph Theory 90 (2019)
416-442
https://doi.org/10.1002/jgt.22405
https://arxiv.org/pdf/1808.04086
Lo, A. and Patel, V.
Hamilton cycles in sparse robustly expanding digraphs. Electron J. Comb. 25 (2018)
P3.44
https://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i3p44/pdf
Lo, A., Patel, V., Skokan, J. and Talbot, J. M.
Decomposing tournaments into paths. Preprint.
http://arxiv.org/pdf/1902.10775
Lo, A. and Sanhueza-Matamala, N.
An asymptotic bound for the strong chromatic number. Combin. Probab. Comput., to
appear.
https://arxiv.org/pdf/1711.08214
Lo, A.. Sanhueza-Matamala, N. and Wang, G.
Density of monochromatic infinite paths, Electron. J. Comb. 25 (2018) P4.29
https://arxiv.org/pdf/1808.00389
Lo, A. and Zhao, Y.
Codegree Turán density of complete r-uniform hypergraphs. SIAM J. Discrete Math. 32 (2018) 1154-1158
https://doi.org/10.1137/18M1163956
https://arxiv.org/pdf/1801.01393
Lo, A.
[see: Barber, B.,, Falgas-Ravry, V., Glock, S. Han, J., Lang, R.]
Lo, I.
[see: Chudnovsky, M.]
Lockhart, J., Severini, S., Wong, T. G. and Wünscher, K.
Quantum Walk Search on Kronecker Graphs. Phys Rev. A. 98 (2018) 012338.
https://doi.org/10.1103/PhysRevA.98.012338
https://arxiv.org/pdf/1804.10560
Lockhart, J. [see: Gühne, O.]
De Loera, J. A.
[see: Aliev, I.]
Lokshtanov, D., Misra, D., Ramanujan, M. S. and Saurabh, S.
Linear Representation of Transversal Matroids and Gammoids parameterized by rank .
Theor. Comput. Sci. , to appear.
https://doi.org/10.1016/j.tcs.2018.02.029
Lokshtanov, D., Mouawad, A., Panolan, F., Ramanujan, M. S. and Saurabh, S.
Reconfiguration on Sparse Graph Classes. J. Comput. Syst. Sci. 95 (2018) 122–131
https://doi.org/10.1016/j.jcss.2018.02.004
https://arxiv.org/pdf/1502.04803
Lokshtanov, D., Ramanujan, M. S., Saurabh, S. and Zehavi, M.
Reducing CMSO Model Checking to Highly Connected Graphs. ICALP 2018.
https://arxiv.org/pdf/1802.01453
Long, E. P.
[see; Ferber, A., Keevash, P.]
Long, J. and Narayanan, B. P.
Diffusion on graphs is eventually periodic. J. Comb., to appear.
https://arxiv.org/pdf/1704.04295
Long, J. and Wagner, A. Zs.
The largest projective cube-free subsets of 𝑍2𝑛 . Preprint.
https://arxiv.org/pdf/1810.01225
Long, J.
[see: Bucic, M., Gowers, W. T.]
Long, Y.
[see: Kitaev, S.]
Lovász, L. M.
[see: Grzesik, A., Král’, D.]
Lozin, V. V., Razgon, I., Zamaraev, V., Zamaraeva, E. and Zolotykh, N. Y.
Linear read-once and related Boolean functions. Discrete Appl. Math. 250 (2018)
16-27.
http://dx.doi.org/10.1016/j.dam.2018.05.001
https://arxiv.org/pdf/1805.10159.pdf
Lozin, V. V.
[see: AbouEisha, H., Alecu, B., Atminas, A., Collins, A., Dąbrowski, K.K., Hertz, A.,
Lejeune, M., Lin, M. C.]
Lozina, I.
[see: Lejeune, M.]
Lu, L
[see: Cushing, D.]
Lu, P. [see: Guo, H.]
Lucchini, A.
[see: Cameron, P. J.]
Luczak, M. J.
[see: Barbour. A. D.]
di Luna, G. A.
[see: Das, S.]
Lynd, J.
[see: Kessar, R.]
Ma, J.
[see: Jiang,T.]
Mačaj, M.
[see: Exoo, G.]
Mackay, J. M.
[see: Hume, D.]
Mądry, A.
[see: Czumaj, A.]
Maenhaut, B.
[see: Bryant, D.]
Maffray, F.
[see: Chudnovksy, M.]
Mahler, B . I., Porter, M. A. and Tillmann, U.
Analysis of contagion maps on a class of networks that are spatially embedded in a
torus. Preprint.
https://arxiv.org/pdf/1812.09806
Mailler, C. and Uribe Bravo, G.
Random walks with preferential relocations and fading memory: a study through
random recursive trees
https://arxiv.org/pdf/1810.02735
Mailler, C.
[see: Broutin, N.]
Mainardis, M.
[see: Franchi, C.]
Makai, T.
[see: Cooley, O.]
Malheiro, A.
[see; Cain, A. J.]
Malic, G. and Schroll, S.
Dessins d'enfants, Brauer graph algebras and Galois invariants. Preprint.
https://arxiv.org/pdf/1902.09876
Malik, J. [see: Klimosová, T.]
Malmann-Trenn, F.
[see: Berenbrink, P., Kanade, V.]
Mamino, M.
[see: Bodirsky, M.]
Mančinska, L., Roberson, D. E., Samal, R., Severini, S. and Varvitsiotis, A.
Quantum and Non-Signalling Graph Isomorphisms. J. Comb. Theory. Ser. B. 136
(2019) 289-328.
https://doi.org/10.1016/j.jctb.2018.11.002
https://arxiv.org/pdf/1611.09837
Manjunath, M. and Smith, B.
Commutative algebra of generalised Frobenius numbers. Algebr. Comb. 2 (2019)
149-171.
https://doi.org/10.5802/alco.31
https://arxiv.org/pdf/1703.10884
Manlove D. F. , Milne, D. and Olaosebkian, S.
An Integer Programming Approach to the Student-Project Allocation Problem with
Preferences over Projects. ISCO2018. Lect. Notes. Comput. Sci. 10856 (2018)
313-325.
https://doi.org/10.1007/978-3-319-96151-4_27
Manlove D. F. , Milne, D. and Olaosebkian, S.
Student-Project Allocation with Preferences over Projects: Algorithmic and
Experimental Results. Preprint.
Manlove D. F. and Olaosebkian, S.
Super-stability in the Student-Project Allocation Problem with Ties. COCOA2018.
Lect. Notes Comput. Sci. 11346 357-371.
http://dx.doi.org/10.1007/978-3-030-04651-4_24
https://arxiv.org/pdf/1805.09887
Manlove D. F. and Olaosebkian, S.
An algorithm for Strong Stability in the Student-Project Allocation Problem with Ties.
MATCH-UP19, to appear.
Manlove D. F.
[see: Cechlárová, K., Cseh, A., Delorme, M.]
Manners, F. J.
[see: Eberhard, S., Gutman, Y.]
Mansour, Y.
[see: Czumaj, A.]
Marchant, D.
2413-balloon permutations and the growth of the Möbius function. Preprint.
https://arxiv.org/pdf/1812.05064
Marchant, D.
[see: Brignall, R.]
Maritan, A.
[see: Balister, P. N.]
Markakis, E,
[see: Amanatidis, G.]
Markström, K.
[see: Larsson, J. ]
Maroti, A.
[see: Lucchini, A.]
Martin, B.
[see: Bodirsky, M., Dantchev, S., Golovach, P. A., Larose, B., van Leeuwen, E. J.]
Martin, J. B. and Stasinski, R.
Minimax functions on Galton-Watson trees. Preprint.
https://arxiv.org/pdf/1806.07838
Martin, J. B. and Yeo, D.
Critical random forests. ALEA Latin American Journal of Probability and
Mathematical Statistics 15 (2018) 913-960
http://dx.doi.org/10.30757/ALEA.v15-35
http://alea.impa.br/articles/v15/15-35.pdf
Martin, J. B. [see: Holroyd, A. E.]
Martin, P. P.
[see: Baur, K.]
Martin, R.
[see: Lamprou, I.]
Martin, R. R.
[see: Axenovich, M.]
Martin, S.
[see: Giannelli, E.]
Martino, A., Tointon, M., Valiunas, M. and Ventura, E.
Probabilistic nilpotence in infinite groups. Preprint.
https://arxiv.org/pdf/1805.11520
Martins, M. M. and Pfeiffer, M.
Francy - An Interactive Discrete Mathematics Framework for GAP. ICMS2018. Lect.
Notes. Comput. Sci. 10931 (2018) 352-358
https://doi.org/10.1007/978-3-319-96418-8_42
Martins, T.
[see: Cooper, J. W., Král’, D.]
Marx, D.
[see: Kratsch, S.]
Masarik, T. [see: Klimosová, T.]
Mastrandrea, R.
[see: Balister, P. N.]
Mateos, J. I.
[see: Delvenne, J.-C.]
Mathieu, C.
[see: Cohen-Addad, V.]
Matl, G. and Živný, S.
Beyond Boolean Surjective VCSPs. Preprint.
https://arxiv.org/pdf/1901.07107
Matros, L.
[see: Campos, M.]
Matucci, F. [see: Araújo, J.]
Maxwell, A. and Swanepoel, K. J.
Shortest directed networks in the plane. Preprint.
https://arxiv.org/pdf/1903.07172
Maynard, J.
[see: Ford, K.]
Mayr, P. and Ruškuc, N.
Generating subdirect products. J. Lond. Math. Soc., to appear.
https://arxiv.org/pdf/1802.09325
Mazowiecki, F.
[see: Daviaud, L.]
McCourt, T. A. and Nixon, A.
A constructive characterisation of circuits in the simple (2,1)‐sparse matroid. J. Graph
Theory 89 (2018) 150-175.
https://doi.org/10.1002/jgt.22245
https://arxiv.org/pdf/1604.05226
McCourt, T. A.
[see: Donovan, D. M., Griggs, T. S.]
McCreesh, C.
[see: Archibald, B., Hoffmann, R.]
McDiarmid, C. J. H. and Przykucki, M. J.
On the critical densities of minor-closed classes. Eur. J. Comb. 75 (2019) 66-91.
https://doi.org/10.1016/j.ejc.2018.08.002
https://arxiv.org/pdf/1711.06052
McDiarmid, C. J. H. and Przykucki, M. J.
On the purity of minor-closed classes of graphs. J. Comb. Theory Ser. B. 135 (2019)
295-318.
https://doi.org/10.1016/j.jctb.2018.08.010
https://arxiv.org/pdf/1608.08623
McDiarmid, C. J. H., Scott, A. D. and Withers, P.
The component structure of dense random subgraphs of the hypercube. Preprint.
https://arxiv.org/pdf/1806.06433
McDiarmid, C. J. H. and Skerman, F.
Modularity of Erdős-Rényi random graphs. AoA2018 31.1-31.13.
https://doi.org/10.4230/LIPIcs.AofA.2018.31
https://arxiv.org/pdf/1808.02243
McDiarmid, C. J. H. and Wood, D. R.
Edge-Maximal Graphs on Surfaces. Can. J. Math. 70 (2018) 925–942.
http://dx.doi.org/10.4153/CJM-2017-028-0
https://arxiv.org/pdf/1608.01496
McDiarmid, C. J. H. and Yolov, N.
Random perfect graphs. Random Struct. Algorithms 54 (2019) 148-186
https://doi.org/10.1002/rsa.20770
https://arxiv.org/pdf/1604.00890
McDiarmid, C. J. H.
[see: Diaz, J.]
McDonough, T. P. and Pillikaros, C. A.
On embedding certain Kazhdan--Lusztig cells of 𝑆𝑛 into cells of 𝑆𝑛+1 Beiträge zur
Algebra und Geometrie 59 (2018) 523–547
https://arxiv.org/pdf/1707.06761
McDowell, A. and Mycroft, R.
Hamilton ℓ-cycles in randomly-perturbed hypergraphs.Electron J. Comb. 25 (2018)
P4.36.
https://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i4p36/pdf
McDowell, A.
[see: Balogh, J., Cooper, C., Garbe, F.]
McInroy, J.
[see: Castillo-Ramirez, A.]
McKee, J. F.
A contraction theorem for the largest eigenvalue of a multigraph. Linear Algebra Appl.
557 (2018) 339-349.
https://doi.org/10.1016/j.laa.2018.07.032
McPhee, J. D., Mitchell, J. D. and Quick, M.
Automorphism groups of linearly ordered structures and endomorphisms of the
ordered set (Q,≤) of rational numbers. Q. J. Math. 70 (2019) 171-194.
https://doi.org/10.1093/qmath/hay043
https://arxiv.org/pdf/1607.03655
Meeks, K.
Randomised enumeration of small witnesses using a decision oracle. Algorithmica, 81
(2019) 519-540
https://doi.org/10.1007/s00453-018-0404-y
http://arxiv.org/pdf/1509.05572
Meeks, K. and Rastegari, B.
Stable marriage with groups of similar agents. WINE2018. Lect. Notes Comput. Sci.
11316 (2018) 312-326
http://dx.doi.org/10.1007/978-3-030-04612-5_21
https://arxiv.org/pdf/1708.04109
Meeks, K. and Skerman, F.
The parameterised complexity of computing the maximum modularity of a graph.
IPEC2018.
https://arxiv.org/pdf/1807.06965
Meeks, K. and Treglown, A.
On the complexity of finding and counting solution-free sets of integers. Discrete
Appl. Math. 243 (2018), pp.219-238
http://dx.doi.org/10.1016/j.dam.2018.02.008
http://web.mat.bham.ac.uk/~treglowa/complexitysumfree27AT.pdf
Meeks, K.
[see: Bläsius, T., Enright, J.]
Mehta, R.
[see: Fearnley, J.]
Meier, F.
[see: Goldberg, L. A.]
Melissourgos, T.
[see: Deligkas, A.]
Mercas, R.
[see: Charalampopoulos, P.]
Mertzios, G. B., Michail, O. and Spirakis, P. G.
Temporal Network Optimization Subject to Connectivity Constraiuts. Algorithmica
(2018)
https://doi.org/10.1007/s00453-018-0478-6
https://arxiv.org/pdf/1502.04382
Mertzios, G. B.,, Molter, H. and Zamaraev, V.
Sliding window temporal graph coloring. AAAI 2019, to appear.
http://community.dur.ac.uk/george.mertzios/papers/Conf/Conf_Sliding-Coloring.pdf
Mertzios, G. B.,, Nichterlein, A. and Niedermeier, R. A linear-time algorithm for maximum-cardinality matching on cocomparability
graphs. SIAM J. Discrete Math. 32 (2019) 2820–2835.
https://doi.org/10.1137/17M1120920
https://arxiv.org/pdf/1703.05598
Mertzios, G. B. and Spirakis, P. G.
Strong bounds for evolution in networks. J. Comput. Sys. Sci. 97 (2018) 60-82.
https://doi.org/10.1016/j.jcss.2018.04.004
Mertzios, G. B.
[see: Akrida, E. C., van Bevern, R., Deligkas, A., Diaz, J., Enright, J., Fluschnik, T.,
Gutin, G.]
Meshulam, R.
[see: Bárány, I. ]
Mészáros, K.
[see: Fink, A.]
Metz, F., Neri, I. and Rogers, T.
Spectra of Sparse Non-Hermitian Random Matrices. Preprint.
https://arxiv.org/pdf/1811.10416
Metzler, R.
[see: Delvenne, J.-C.]
Mezlaf, D.
[see: Englert, M.]
Michail, O. and Spirakis, P. G.
Elements of the Theory of Dynamic Networks. Comm. ACM. 61 (2018), 72-81.
https://doi.org/10.1145/3156693
Michail, O., Spirakis, P. G. and Theofilatos, N.
Fault Tolerant Network Constructors. Preprint.
http://arxiv.org/pdf/1903.05992v1
Michail, O.
[see: Mertzios, G. B.]
Middleton, A.
[see: Briggs, K. M.]
Mihalak, M.
[see: Erlebach, T.]
Miller, A.
[see: Codish, M.]
Miller, C. and Ruškuc, N.
An introduction to presentations of monoid acts: quotients and subacts. Commun.
Algebr.,to appear.
https://arxiv.org/pdf/1709.08916
Miller, M.
[see: Dalfo, C.]
Milne, D.
[see: Manlove, D. F.]
Miraftab, B.
[see: Hamann, M.]
Misra, P.
[see: Lokshtanov, D.]
Mitchell, J. D.
[see: Donoven, C., East, J., McPhee, J. D.]
Mitrović, S.
[see: Czumaj, A.]
Mitsche, D. [see: Diaz, J., Fountoulakis, N.]
Moci, L.
[see: Dupont, C.., Fink, A.]
Moffatt, I. and Smith, B.
Matroidal frameworks for topological Tutte polynomials. J. Comb. Theory Ser. B. 133
(2018) 1-31.
https://doi.org/10.1016/j.jctb.2017.09.009
http://www.personal.rhul.ac.uk/uxah/001/papers/KR_final_cr.pdf
Moffatt, I.
[see: Chun, C., Ellis-Monaghan, J. A.]
Mohamed, M.
[see: Almirantis, Y.]
Moitra, A.
[see: Chen, S.]
Mojallal, S. A.
[see: Cheon, G.-S.]
Molla, T.
[see: Balogh, J.
Möller, R.
[see: Carmesin, J.]
Molter, H. [see: van Bevern, R., Mertzios, G. B.]
Monical, C.
[see: Bi, R.]
Monnot, J.
[see: AbouEisha, H.]
Montemanni, R., Perkins, S. and Smith, D. H.
Solving the maximum clique problem with a hybrid algorithm, Int. J. Metaheuristics,
7 (2019) 152-175.
https://doi.org/10.1504/IJMHEUR.2019.098270
Montgomery, R.
Hamiltonicity in random directed graphs is born resilient. Preprint.
https://arxiv.org/pdf/1901.09605
Montgomery, R.
Fractional clique decompositions of dense graphs. Random Struct.Algorithms, to
appear.
https://arxiv.org/pdf/1711.03382
Montgomery, R., Pokrovskiy, A. and Sudakov, B.
Embedding rainbow trees with applications to graph labelling and decomposition.
Preprint.
https://www.dpmms.cam.ac.uk/~rhm34/papers/14rainbowtreesanddecomposition.pdf
Montgomery, R., Pokrovskiy, A. and Sudakov, B.
Decompositions into spanning rainbow structures. Proc. Lond. Math. Soc., to appear.
https://arxiv.org/pdf/1805.07564
Montgomery, R.
[see: Balogh, J., Barber, B., Böttcher, J., Georgakopoulos, A., Glock, S.]
Moore, S., Mörters, P. and Rogers, T.
A re-entrant phase transition in the survival of secondary infections on networks. J.
Stat. Phys. 171 (2018) 1122-1135.
https://doi.org/10.1007/s10955-018-2050-9
https://arxiv.org/pdf/1804.03570
Morris, P.
[see: Han, J.]
Morris, R. D., Samotij, W. and Saxton, D.
An asymmetric container lemma and the structure of graphs with no induced 4-cycle.
Preprint.
https://arxiv.org/pdf/1806.03706
Morris, R. D.
[see: Ahlberg, D., Balister, P. N., Balogh, J., Campos, M.]
Morrison, N. and Noel, J. A.
A Sharp Threshold for Bootstrap Percolation in a Random Hypergraph. Preprint.
https://arxiv.org/pdf/1806.02903
Morrison, N., Roberts, A. and Scott, A. D.
Maximising the Number of Cycles in Graphs with Forbidden Subgraphs. Preprint.
https://arxiv.org/pdf/1902.08133
Morrison, N.
[see: Campos, M., Clemens, D., Gruslys, V.]
Mörters, P.
[see: Eckhoff, M., Moore, S.]
Moshchevitin, N. Murphy, B. and Shkredov, I. D.
Popular Products and Continued Fractions. Preprint.
https://arxiv.org/pdf/1808.05845
Moss, T.
[see; Chun, C.]
Mota, G.-O.
[see: Clemens, D., Han, J.]
Motakis, P.
[see: Baudier, F. P.]
Mottet, A.
[see: Bodirsky, M.]
Mouawad, A.
[see: Lokshtanov, D.]
Mouchard, L.
[see: Daykin, J .W. ]
Moulton, V. [see: Bordewich, M. J., El-Mabrouk, N., Gruenwald, S., Hellmuth, M., Huber, K. T.,
van Iersel, L.]
Mousa, H.
[see : Cryan, M. E.]
Movassagh, R.
[see: Estrada, E.]
Moyano, V. A.
[see: Lin, M. C.]
Mozes, S. [see: Charalampopoulos, P.]
Mrazovic, R.
[see: Eberhard, S.]
Mucha, M. [see: Cygan, M.]
Müller, H.
[see: Dyer, M. E.]
Müller, T. and Penrose, M. D.
Optimal Cheeger cuts and bisections of random geometric graphs. Preprint.
https://arxiv.org/pdf/1805.08669
Müller, T.
[see: Fountoulakis, N.]
Müller, T. W.
[see: Krattenhaler, C.]
Münch, F.
[see: Bourne, D., Cushing, D., Liu, S.]
Murakami, Y.
[see: van Iersel, L.]
Murota, K.
[see: Hirai, H., Iwamasa, Y.]
Murphy, B.
[see: Moshchevitin, N.]
Murphy, B. and Petridis, G.
Products of Differences over Arbitrary Finite Fields. Discrete Anal. 2018:18, 42 pp.
https://doi.org/10.19086/da.5098
https://arxiv.org/pdf/1705.06581
Murphy, B., Petridis, G., Roche-Newton, O., Rudnev, M. and Shkredov, I. D.
New results on sum-product type growth over fields. Mathematika 65 (2019)
588-642.
https://doi.org/10.1112/S0025579319000044
https://arxiv.org/pdf/1702.01003
Musitelli, A.
[see: Del Pia, M.]
Mustafa, N. H.
[see: Adiprasito, K. A., Csikos, M., Kupavskii, A.]
Mwambene, E.
[see: Fish, W.]
Mwesigye, F. and Truss, J. K.
Ehrenfeucht-Fraissé games on ordinals. Annals of Pure and Applied Logic 169 (2018)
616-636.
https://doi.org/10.1016/j.apal.2018.03.001
http://www1.maths.leeds.ac.uk/~pmtjkt/feres3.pdf
Mwesigye, F. and Truss, J. K.
On optimal representatives of finite coloured linear orders. Order 36 (2019) 107-117.
https://doi.org/10.1007/s11083-018-9458-3
http://www1.maths.leeds.ac.uk/~pmtjkt/feres4.pdf
Mycroft, R. and Naia, T.
Unavoidable trees in tournaments. Random Struct. Algorithms 53 (2018) 352-385.
https://doi.org/10.1002/rsa.20765
http://arxiv.org/pdf/1609.03393
Mycroft, R. [see: Balogh, J., Bowtell, C., Garbe, F., McDowell, A.]
Nagel, L.
[see: Berenbrink, P.]
Nagy, Z. L.
[see: Grzesik, A.]
Naia, T.
[see: Mycroft, R.]
Nanongkai, D. [see: Bhattacharya, S.]
Narayanan, B. P., Sahasrabudhe, J. and Tomon, I.
Ramsey graphs induce subgraphs of many different sizes. Combinatorica (2018)
https://doi.org/10.1007/s00493-017-3755-0
https://arxiv.org/pdf/1609.01705
Narayanan, B. P.
[see: Aru, J.,. Balister, P. N., Balogh, J., Georgakopoulos, A., Girão, A., Leader, I. B.]
Naszódi, M., Pach, J. and Swanepoel, K.
Sphere-of-influence graphs in normed spaces. In: : Discrete Geometry and Symmetry:
In Honor of Károly Bezdek’s and Egon Schulte’s 60th Birthdays, pp. 293-296. ISBN
978-3-319-78433-5.
http://arxiv.org/pdf/1605.01872.pdf
Naszódi, M. and Swanepoel, K.
Arrangements of homothets of a convex body II. Contrib. Discrete Math. 13 (2018)
https://cdm.ucalgary.ca/cdm/index.php/cdm/article/view/796
Navaridas, J.
[see: Erickson, A.]
Naves, H., Pikhurko, O. and Scott, A. D.
How unproportional must a graph be? Eur. J. Comb. 73 (2018) 138-152.
https://doi.org/10.1016/j.ejc.2018.05.007
http://arxiv.org/pdf/1404.1206
Ndojh Ndiaye, S.
[see: Hoffmann, R.]
Neerja, M.
[see: Alatabbi, A.]
Nenadov, R., Sudakov, B. and Tyomkyn, M.
Proof of the Brown-Erdős-Sós conjecture in groups. Preprint.
https://arxiv.org/pdf/1902.07614
Nešetřil, J.
[see: Evans, D. M.]
Neri, I.
[see : Metz, F.]
Nevo, E.
[see: Bárány, I.]
Ng, S.-L. and Paterson, M. B.
Functional repair codes: a view from projective geometry. Preprint.
https://arxiv.org/pdf/1809.08138
Nichterlein, A.
[see: Fluschnik, T., Mertzios, G. B.]
Niedermeier, R.
[see: Fluschnik, T., Mertzios, G. B.]
Nikoletseas, S.
[see: Akrida, E. C.]
Nill, B.
[see: Kasprzyk, A. M.]
Niskanen, R.
[see: Ko, S.-K.]
Nixon, A.
Inductive constructions for combinatorial local and global rigidity. In: Handbook of
Geometric Constraint Systems Principles, to appear.
Nixon, A. and Ross, E.
Inductive constructions for combinatorial local and global rigidity. In: Handbook of
Geometric Constraint Systems Principles, CRC Press, 2018
Nixon, A., Schulze, B., Tanigawa, S. and Whiteley, W.
Rigidity of Frameworks on Expanding Spheres. SIAM J. Discrete Math. 32 (2018)
2591–2611.
https://doi.org/10.1137/17M1116088
https://arxiv.org/pdf/1501.01391
Nixon, A. and Whiteley, W.
Change of metrics in rigidity theory. Chapter in: Handbook of Geometric Constraint
Systems Principles, CRC Press, 2018.
Nixon, A.
[see: Connelly, R., Cruickshank, J., Eftekhari, Y., Jackson, B., Kitson, D. McCourt, T.
A.]
Noble, S. D.
[see: Bonin, J., Chun, C., Edwards, K. J.]
Noel, J. A., Scott, A. D. and Sudakov, B.
Supersaturation in Posets and Applications Involving the Container Method. J.
Comb. Theory Ser. A, 154 (2018), 247-284.
https://doi.org/10.1016/j.jcta.2017.08.019
http://arxiv.org/pdf/1610.01521
Noel, J. A.
[see: Chan, T. F. N., Král’, D., Lee, J.-B., Morrison, N.]
Norin, S., Scott, A. D., Seymour, P. D. and Wood, D. R.
Clustered Colouring in Minor-Closed Classes. Combinatorica, to appear.
https://arxiv.org/pdf/1708.02370
Norin, S.
[see: Csóka, E., Král’, D.]
Novotná, J. [see: Klimosová, T.]
Ochem, P.
[see: Badkobeh, G.]
Oertel, T.
[see: Aliev, I.]
Offner, D.
[see: Axenovich, M.]
Okrasa, P.
[see: Groenland, C.]
Olaosebkian, S.
[see: Manlove, D. F.]
Olarte, J.
[see: Fink, A.]
Olšak, M.
[see: Bodirsky, M.]
Olsson, J. B.
[see: Bessenrodt, C.]
Onak,K.
[see: Czumaj, A.]
O’Neill, S. T.
[see: Larcombe, P. J. ]
Opper, S., Plamondon, P.-G. and Schroll, S.
A geometric model of the derived category of a gentle algebra. Preprint.
https://arxiv.org/pdf/1801.09659
Opršal, J.
[see: Bodirsky, M., Bulin, J., Krokhin, A.]
Ortega-Moreno, O.
[see: Ball, K. M.]
Ortgiese, M.
[see: Betken, C., Dereich, S., Eckhoff, M.]
Ospina-Forero, L
[see: Deane, C. M.]
Ossona de Mendez, P.
[see: Eickmeyer, K.]
Östergård, P. R. J. and Soicher, L. H.
There is no McLaughlin geometry, J. Comb. Theory, Ser. A 155 (2018) 27-41
https://doi.org/10.1016/j.jcta.2017.10.004
https://arxiv.org/pdf/1607.03372
Osthus, D. [see: Barber, B.,. Condon, P., Glock, S., Kim, J.]
Oum, S.-I.
[see: Brignall, R.]
Owen, J. C.
[see: Jackson, B.]
Oxley, J. G.
[see: Campbell, R., Clark, B.]
Pach, J.
[see: Kupavskii, A., Naszódi, M.]
Pach, P. P.
An improved upper bound for the size of the multiplicative 3-Sidon sets. Int J.
Number Theory, to appear.
https://arxiv.org/pdf/1801.08733
Pach, P. P.
Monochromatic solutions to 𝑥 + 𝑦 = 𝑧2 in the interval [𝑁, 𝑐𝑁4]. Bull. Lond. Math.
Soc. 50 (2018) 1113-1116.
https://doi.org/10.1112/blms.12207
https://arxiv.org/pdf/1805.06279
Pach, P. P. and Sandor, Cs.
On infinite multiplicative Sidon sets. Eur. J. Comb. 76 (2019) 37-52.
https://arxiv.org/pdf/1709.03550.pdf
Pach, P. P.
[see: Král’, D.,Liu, H.]
Paesani, G.
[see: Dąbrowski, K. K., Johnson, M.]
Paget, R. E. and Wildon, M. R.
Generalized Foulkes modules and maximal and minimal constituents of plethysms of
Schur functions. Proc. Lond. Math. Soc. , to appear.
https://arxiv.org/pdf/1608.04018
Paget, R. E.
[see; de Boeck, M., Bowman, C. D.]
Pagourtzis, A. and Radzik, T.
Tight Bounds for Deterministic h-Shot Broadcast in Ad-Hoc Directed Radio
Networks. MFCS2018.
http://dx.doi.org/10.4230/LIPIcs.MFCS.2018.80
http://drops.dagstuhl.de/opus/volltexte/2018/9662/pdf/LIPIcs-MFCS-2018-80.pdf
Palincza, R. [see; Liu, H.]
Pálvölgyi, D.
Weak embeddings of posets to the Boolean lattice. Disrete Math. Theor. Comput. Sci.
20 (2018)
http://dx.doi.org/10.23638/DMTCS-20-1-7
http://arxiv.org/pdf/1606.08226.pdf
Pálvölgyi, D.
[see: Fulek, R.]
Panagiotis, C.
[see: Georgakopoulos, A.]
Panagiotou, K.
[see: Goldberg, L. A.]
Panolan, F.
[see: Fomin, F., Lokshtanov, D.]
Pantone, J.
[see: Bevan, D.]
Parczyk, O.
[see: Allen, P., Böttcher, J.]
Parker, C. and Semeraro, J.
Fusion systems on maximal class 3-groups of rank two revisited. Proc. Am. Math.
Soc., to appear.
https://arxiv.org/pdf/1809.01957
Parys, P.
[see: Czerwiński, W.]
Pascual, J. A.
[see: Erickson, A.]
Pashkovich, K.
[see; Abdi, A., Hof, F.]
Patel, V.
[see: Choromanski, K., Lo. A.]
Paterson, M. B.
[see: Huczynska, S., Ng. S.-L.]
Paulusma, D., Picoleau, C. and Ries, B.
Critical Vertices and Edges in $H$-free Graphs. Discrete Appl, Math. 257 (2019)
361-367.
https://doi.org/10.1016/j.dam.2018.08.016 https://arxiv.org/pdf/1706.09043
Paulusma, D. and Szeider, S.
On the parameterized complexity of (k, s)-SAT. Inf. Process. Lett. 143 (2019)
34-36.
https://doi.org/10.1016/j.ipl.2018.11.005
https://www.ac.tuwien.ac.at/files/tr/ac-tr-18-008.pdf
Paulusma, D.
[see: Biró, P., Blanché, A., Bonamy, M., Bulteau, L, Cochefert, M., Dąbrowski, K. K.,
Diner, O. Y., Galby, E., Gaspers, S., Golovach, P. A., Hof, F., Johnson, M., Kern, W.,
Klimosová, T., Larose, B., van Leeuwen, E. J., Szeider, S.]
Pavlikova, S.
[see: Dalfo, C.]
Pebody, L.
Proof of a conjecture of Kleinberg-Sawin-Sayer. Discrete Anal. 2018:13.
https://doi.org/10.19086/da.3733
https://arxiv.org/pdf/1608.05740
Pegden, W.
[see: Cooper, C., Frieze, A. M.]
Pehova, Y.
[see: Král’, D.]
Peluse, S. and Prendiville, S.
Quantitative bounds in the non-linear Roth theorem. Preprint.
https://arxiv.org/pdf/1903.02592
Penev, I.
[see: Boncompagni, V.]
Penrose, M. D.
Non-triviality of the vacancy phase transition for the Boolean model. Preprint.
https://arxiv.org/pdf/1706.02197
Penrose, M. D.
Inhomogeneous random graphs, isolated vertices, and Poisson approximation. J. Appl.
Probab. 55 (2018) 112-136
https://doi.org/10.1017/jpr.2018.9
https://arxiv.org/pdf/1507.07132
Penrose, M. D.
[see: Dereudre, D., Müller, T.]
Perarnau, G. and Perkins, W.
Counting independent sets in cubic graphs of given girth. J. Comb. Theory. Ser. B.
133 (2018) 211-242,
https://doi.org/10.1016/j.jctb.2018.04.009
https://arxiv.org/pdf/1611.01474
Perarnau, G.
[see:: Cai, X,-S,, Chapuy, G., Chen, S., Coulson, M., Delcourt, M., Foucaud, F., Joos,
F., Mitsche, D.]
Peres, Y., Sousi, P. and Steif, J.
Quenched exit times for random walk on dynamical percolation. Markov Processes
and Related Fields 24 (2018) 715-731.
https://arxiv.org/pdf/1707.07619
Peres, Y.
[see: Berestycki, N., Boczkowski, L, Hermon, J., Holroyd, A. E., Hutchcroft, T.]
Pérez, G. A.
[see: Daviaud, L.]
Perkins, S.
[see: Montemanni, R. ]
Perkins, W.
[see: Chen, Z., Coja-Oghlan, A.. Davies, E., Jenssen, M., Perarnau, G.]
Person, Y.
[see: Aigner-Horev, E., Allen, P., Böttcher, J.]
Pétréolle, M., Sokal, A. D. and Zhu, B.-X.
Lattice paths and branched continued fractions: An infinite sequence of
generalizations of the Stieltjes--Rogers and Thron--Rogers polynomials, with
coefficientwise Hankel-total positivity. Preprint.
https://arxiv.org/pdf/1807.03271
Petridis, G.
[see: Murphy, B.]
Pettersson, W.
[see: Delorme, M.]
Peyerimhoff, N.
[see: Bourne, D., Cushing, D., Ivrissimtzis, I., Liu, S.]
Pfeiffer, M.
[see: Jefferson, C., Martins, M. M.]
Pfister, P.
[see: Goldberg, L. A.]
Phillips, M.
[see: Boyer, K.]
Phillipson, M. [see: Bjorkman, B.]
Picoleau, C.
[see: Diner, O. Y., Paulusma, D. ]
Piguet, D.
[see: Allen, P., Hladký, J..]
Pike, D. A
[see: Barnetson, K. D]
Pikhurko, O., Sliačan, J. and Tyros, K.
Strong Forms of Stability from Flag Algebra Calculations. J Comb Theory Ser. B 135
(2019) 129-178
https://doi.org/10.1016/j.jctb.2018.08.001
https://arxiv.org/pdf/1706.02612
Pikhurko, O.
[see: Bennett, P., Chervak, O., Liu, H., Naves, H. ]
Pilipczuk, M.
[see: Choromanski, K., Eickmeyer, K., Kratsch, S.]
Pillikaros, C. A.
[see: McDonough, T. P.]
Pilśniak, M.
[see: Lehner, F.]
Pinsker, M.
[see: Bodirsky, M.]
Pisanti, N.
[see: Alzamel, M., Ayad, L. A. K.]
Pissis S. P.
[see: Alamro, H., Almirantis, Y., Alzamel, M., Ayad, L. A. K., Carriço, J. A.,
Charalampopoulos, P.]
Pitz, M. [see: Bowler, N., Bürger, C.]
Plamondon, P.-G.
[see: Opper, S.]
Pokrovskiy, A. and Sudakov, B.
Ramsey goodness of cycles. Preprint.
https://arxiv.org/pdf/1807.02313
Pokrovskiy, A. and Sudakov, B.
Linearly many rainbow trees in properly edge-coloured complete graphs. J. Comb.
Theory Ser. B. 132 (2018) 134-156.
https://doi.org/10.1016/j.jctb.2018.03.005
https://arxiv.org/pdf/1703.07301
Pokrovskiy, A.
[see: Abu-Khazneh, A., Balla, I., Bucic, M., Bustamante, S., Korándi, D.]
Polychronopoulos, D.
[see: Almirantis, Y.]
Pongrácz, A.
[see: Bodirsky, M.]
Popielarz, K.,Sahasrabudhe, J. and Snyder, R.
A stability theorem for maximal Kr+1-free graphs. J. Comb. Theory, Ser. B 132 (2018)
236-257.
https://doi.org/10.1016/j.jctb.2018.04.001
https://arxiv.org/pdf/1608.04675
Popielarz, K.
[see: Girão, A.]
Pór, A.
[see: Balko, M.]
Porat, E.
[see: Clifford, R.]
Porter, M. A.
[see: Ahmad, W., Juul, J. S. Mahler, B. I.]
Postle, L.
[see: Chen, S.]
Potapov, I. and Semukhin, P.
Vector and scalar reachability problems in SL(2,Z). J. Comput. Syst. Sci. 100 (2019)
30-43.
https://doi.org/10.1016/j.jcss.2018.09.003
Potapov, I.
[see: Bell, P. C., Ko, S.-K.]
Potapov, V. N.
[see: Kitaev, S.]
Power, S. C.
[see: Kitson, D.]
Praeger, C. E.
[see: Cathain, P., Gill, N., Gillespie, N. I.]
Pranabendu, M.
[see: Bang-Jensen, J.]
Pratt, P.
[see: Chin, W. H., Dettmann, C. P.]
Prellberg, T.
[see: Haug, N.]
Prendiville, S.
Four variants of the Fourier-analytic transference principle. Online J. Anal. Comb 12
(2017) no 5.
https://web.math.rochester.edu/misc/ojac/vol12/136.pdf
Prendiville, S.
[see: Chapman, J., Chow, S., Peluse, S.]
Prieur-Gaston, E.
[see: Daykin, J. W.]
Prince, T.
[see: Kasprzyk, A. M.]
Prodromou, M.
[see: Ball, K. M.]
Prosser, P.
[see: Archibald, B., Codish, M., Hoffmann, R.]
Przykucki, M. J. and Roberts, A.
Vertex-isoperimetric stability in the hypercube. Preprint.
http://web.mat.bham.ac.uk/M.Przykucki/Papers/stability18.pdf
Przykucki, M. J.
[see: Goldschmidt, C., McDiarmid, C. J. H.]
Psomas, C.-A.
[see: Amanatidis, G.]
Puglisi, S. J.,
[see: Badkobeh, G.]
Puleo, G. J. [see: Edwards, K.]
Pyatkin, A.
[see: Glen, M., Kitaev, S.]
Pymar, R.
[see: Hermon, J.]
Quick, M. R.
Permutation-based presentations for Brin’s higher-dimensional Thompson group nV.
Preprint.
https://arxiv.org/pdf/1901.04409
Quiroz, D.
[see: Eickmeyer, K., van den Heuvel, J.]
Rabinovich, R.
[see: Eickmeyer, K.]
Räcke, H.
[see: Adamaszek, A.
Radcliffe, A. J.
[see: Kirsch, R.]
Radin, C.
[see: Kenyon, R.]
Radoszewski, J.
[see: Adamczyk, M., Alzamel, M., Charalampopoulos, P.]
Radovanović, M.,
[see: Boncompagni, V.]
Radzik, T.
[see: Berenbrink, P., Cooper, C., Elsässer, R., Pagourtzis, A.]
Ragab, A.
[see: Lejeune, M.]
Rajkumar, A.
[see: Hilton, A. J. W.]
Rajkumar, R.
[see: Anitha, T.]
Ramanujan, M. S.
[see: Bang-Jensen, J., Fomin, F., Gutin, G., Loshtanov, D.]
Ramos, P.
[see: Bailey, R. A.]
Raptopoulos, C.
[see: Akrida, E. C.]
Rastegari, B. [see: Meeks, K.]
Rath, B.
[see: Crane, E.]
Raty, E.
Coordinate deletion of zeroes. Preprint.
https://arxiv.org/pdf/1901.09814
Raty, E.
Induced Saturation of 𝑃6. Preprint.
https://arxiv.org/pdf/1901.09801
Raty, E.
Uniqueness in Harper's vertex-isoperimetric theorem. Preprint.
https://arxiv.org/pdf/1806.11061
Raty, E.
[see: Leader, I. B.]
Rautenbach, D. [see: Joos, F.]
Raynaud, W.
[see: Cameron, P. J.]
Razgon, I.
[see: Atminas, A., Lozin, V. V.]
Reding, D.
[see: Clemens, D.]
Reed, B. A., Scott, A. D. and Seymour, P. D.
Near-domination in graphs. J. Comb. Theory. Ser. A., to appear.
https://arxiv.org/pdf/1710.06680
Reed, B. A.
[see: Addario-Berry, L.]
Rehren, F.
[see: Castillo-Ramirez, A.]
Reidl, F. and Wahlstrőm, M.
Parameterized Algorithms for Zero Extension and Metric Labelling Problems.
ICALP2018.
https://doi.org/10.4230/LIPIcs.ICALP.2018.94
https://arxiv.org/pdf/1802.06026
Reidl, F.
[see: Blanchard, E.. Gutin, G.]
Reiher, C.
[see: Bowler, N.]
Reilly, C.
[see: Hoffmann, R.]
Reinert, G. and Ross, N.
Approximating stationary distributions of fast mixing Glauber dynamics, with
applications to exponential random graphs. Ann. Appl. Probab., to appear.
https://arxiv.org/pdf/1712.05736
Reinert, G.
[see: Coulson, M., Deane, C. M.]
Reinhart, C.
[see: Boyer, K.]
Riascos, A. P.
[see: Delvenne, J.-C.]
Ribeiro-Gonçalves, B.
[see: Carriço, J. A.]
Richard, A.
[see: Gadouleau, M.]
Richmond, L. B.
[see: Goulden, I. P.]
Ries, B.
[see: AbouEisha, H., Diner, O. Y., Galby, E., Paulusma, D.]
Riis, S.
[see: Gadouleau, M.]
Rimanić, L. and Wolf, J.
Szemerédi's theorem in the primes. Proc. Edinb. Math. Soc. 62 (2018)
443-457.
https://doi.org/10.1017/S0013091518000561
https://arxiv.org/pdf/1709.04719
Rimanic, L.
[see: Chow, S.]
Rinaldo, A.
[see: Balister, P. N.]
Rincón, E. F.
[see: Draisma, J.]
Riordan, O. M.
[see: Balister, P. N., Bollobás, B., Janson, S.]
Rivera, N. , Sauerwald, T., Stauffer, A. and Sylvester, J.
The dispersion time of random walks on finite graphs . SPAA2019, to appear.
https://arxiv.org/pdf/1808.09219
Rivera, N.
[see: Cooper, C., Kang, N.]
Roberson, D. E.
Homomorphisms of Strongly Regular Graphs. Algebr. Combin., to appear.
https://arxiv.org/pdf/1601.00969
Roberson, D. E.
[see: Mančinska, L.]
Roberts,. A.
Tree matchings. Preprint.
http://people.maths.ox.ac.uk/robertsa/treematch.pdf
Roberts, A. and Scott, A. D.
Stability results for graphs with a critical edge. Eur. J. Comb. 94 (2018) 27-38
https://doi.org/10.1016/j.ejc.2018.07.004
Roberts, A.
[see: Aru, J., Guggiari, H., Morrison, N.. Przykucki, M. J. ]
Roberts, B.
[see: Clemens, D., Davies, E., Han, J.]
Roberts, M. I.
The probability of unusually large components in the near-critical Erdős-Rényi graph.
Adv. Appl. Probab. 50 (2018) 245-271.
https://doi.org/10.1017/apr.2018.12
http://arxiv.org/pdf/1610.05485.pdf
Roberts, M. I. and Sengul, B.
Exceptional times of the critical dynamical Erdős-Rényi graph. Ann. Appl. Probab.,28
(2018) 2275-2308.
http://dx.doi.org/10.1214/17-AAP1357
http://arxiv.org/pdf/1610.06000.pdf
Roberts, M. I.
[see: Addario-Berry, L]
Roche-Newton, O.
[see: Murphy, B.]
Rochet, P.
[see: Giscard, P.-L,]
Rogers, T.
[see: Metz, F., Moore, S.]
Roney-Dougal, C. M.
[see: Cameron, P. J.]
Rorabaugh, D. [see: Bjorkman, B.]
Rose, C.
[see: Liu, S.]
Rosen, Z, Sidman, J. and Theran, L.
Algebraic matroids in action. Amer Math. Monthly, to appear.
https://arxiv.org/pdf/1809.00865
Rosone, G.
[see: Ayad, L. A. K.]
Ross, E.
[see: Nixon, A.]
Ross, N.
[see: Reinert, G.]
Rosso, L. M. S.
[see: Crochemore, M.]
Rote, G.
[see: Bárány, I.]
Rothblum, R. P.
[see: Gur, T.]
Rousseau, C. C.
[see: Bollobás, B.]
Rowlinson, P.
On trees as star complements in regular graphs. Preprint.
Rowlinson, P.
Eigenvalue multiplicity in regular graphs. Discrete Appl. Math., to appear.
https://doi.org/10.1016/j.dam.2018.07.023
Rowlinson, P.
An extension of the star complement technique for regular graphs. Linear Algebra
Appl.557 (2018) 496-507.
https://doi.org/10.1016/j.laa.2018.08.018
Royle, G. F.
[see: Holt, D. F.]
Rudnev, M.
On the number of hinges defined by a point set in 𝑅2. Preprint.
https://arxiv.org/pdf/1902.05791
Rudnev, M.
Point-plane incidences and some applications in positive characteristic. To appear in
procedings of Workshop on Pseudorandomness and Finite Fields in at RICAM in
Linz, October 2018, 24pp
https://arxiv.org/pdf/1806.03534
Rudnev, M.
On distinct cross-ratios and related growth problems. Mosc. J. Comb. Number Theory.
7 (2017). 7
https://arxiv.org/pdf/1705.01830
7 This should have been updated in last year’s Bulletin, apologies.
Rudnev, M.
On the number of incidences between planes and points in three dimensions.
Combinatorica 38 (2018) 219-254.
https://doi.org/10.1007/s00493-016-3329-6
http://de.arxiv.org/pdf/1407.0426.pdf
Rudnev, M., Shakan, G. and Shkredov, I. D.
Stronger sum-product inequalities for small sets. Preprint.
https://arxiv.org/pdf/1808.08465
Rudnev, M. and Shkredov, I. D.
On the restriction problem for discrete paraboloid in lower dimension. Adv. Math, 339,
(2018) 657-671
https://doi.org/10.1016/j.aim.2018.10.002
https://arxiv.org/pdf/1803.11035
Rudnev, M. and Shkredov, I. D.
On growth rate in 𝑆𝐿2(𝐹𝑝), the affine group and sum-product type implications.
Preprint.
https://arxiv.org/pdf/1812.01671
Rudnev, M.
[see: Lev, V. S., Murphy, B.]
Rueckriemen, R.
[see: Chun, C.]
Rühmann, T.
[see: Hamann, M.]
Ruškuc, N.
[see: Albert, M., Clayton, A., East, J., Mayr, P., Miller, C.]
Russell, P. A.
[see: Komjáth, P., Leader, I. B.]
Ruzsa, I. |Z.
[see: Green, B. J.]
Ryan, B.
[see: Barnetson, K. D.]
Ryan, J.
[see: Dalfo, C.]
Rytter, W.
[see: Alzamel, M., Charalampopoulos, P.]
Sagot, M,-F.
[see: Huber, K. T.]
Sahasrabudhe, J.
Monochromatic solutions to systems of exponential equations. J. Comb. Theory, Ser.
A 158 (2018) 548-559.
https://doi.org/10.1016/j.jcta.2018.04.002
https://arxiv.org/pdf/1608.00109
Sahasrabudhe, J.
[see: Balister, P. N., Girão, A., Letzter, S., Narayanan, B. P., Popielarz, K.]
Saito, A.
[see: Kitaev, S.]
Salez, J.
[see: Hermon, J.]
Samal, R.
[see: Mančinska, L.]
Samotij, W.
[see: Morris, R. D.]
Sanchez, J. A.
[see: Bi, R.]
Sanders, T.
Schur's colouring theorem for non-commuting pairs. Preprint.
https://arxiv.org/pdf/1901.01738
Sanders, T.
The stability of finite sets in dyadic groups,. Preprint.
https://arxiv.org/pdf/1811.00468.pdf
Sanders, T.
The coset and stability rings. Preprint.
https://arxiv.org/pdf/1810.10461
Sanders, T.
Coset decision trees and the Fourier algebra. Preprint.
https://arxiv.org/pdf/1805.02168
Sanders, T.
Boolean functions with small spectral norm, revisited. Math. Proc. Camb. Philos. Soc.,
to appear.
https://arxiv.org/pdf/1804.04050
Sanders, T.
Almost homomorphisms between the Boolean cube and groups of prime order. Online
J. Anal. Comb. 13 (2018) .
http://web.math.rochester.edu/misc/ojac/vol13/170.pdf
Sanders, T.
Bootstrapping partition regularity of linear systems. Preprint.
http://arxiv.org/pdf/1904.07581.pdf
Sandor, Cs.
[see: Pach, P. P.]
Sangha, P., Wong, P. W. H. and Zito, M.
Dynamic Programming Optimization in Line of Sight Networks. Preprint.
https://arxiv.org/pdf/1806.01581
Sanhueza-Matamala, N. [see: Han, J., Lo, A.]
Sanita, L.
[see: Abdi, A., Koh, C.]
Sankowski, P. [see: Cygan, M., Czumaj, A. ]
dos Santos Sousa, U.
[see: Alves, S. R.]
Sau, I.
[see: Alves, S. R.]
Sauerwald, T. and Zanetti, L.
Random Walks on Dynamic Graphs: Mixing Times, Hitting Times, and Return
Probabilities. Preprint.
https://arxiv.org/pdf/1903.01342
Sauerwald, T.
[see: Kanade, V., Rivera, N.]
Saurabh, S.
[see: Bang-Jensen, J., Fomin, F., Loshtanov, D.]
Savani, R.
[see: Czumaj, A., Fearnley, J.]
Saxton, D.
[see: Morris, R. D.]
Scarlett, J.
[see: Aldridge, M.]
Schacht, M.
[see: Aigner-Horev, E.]
Schaefer, G. [see: Groenland, C.]
Schapira, B.
[see: Asselah, A.]
Schaub, M. T.
[see: Delvenne, J.-C.]
Schaudt, O.
[see: Bruhn, H., Chudnovsky, M.]
Schepers, M.
[see: Fountoulakis, N.]
Scheucher, M.
[see: Balko, M.]
Schewe, S. [see: Lamprou, I.]
Schirneck, M.
[see: Bläsius, T.,]
Schlumprecht, T.
[see: Baudier, F. P.]
Schmutz, E.
[see: Acan, H.]
Scholz, G. E.
[see: Huber, K. T.]
Schroll, S.
Brauer graph algebras, Homological Methods, Representation Theory and Cluster
Algebras, CRM Short Courses, Springer, 2018, pp. 177-223.
https://doi.org/10.1007/978-3-319-74585-5_6
Schroll, S.
[see: Canakci, I.,Chaparro, C., Green, E. L., Malic, G., Opper, S.]
Schulze, B., Serocold, H. and Theran, L.
Frameworks with coordinated edge motions, Preprint.
https://arxiv.org/pdf/1807.05376
Schulze, B.
[see: Eftekhari, Y., Fowler, P., Kitson, D., Nixon, A.]
Scott, A. D. and Seymour, P. D.
A survey of chi-boundedness. Preprint.
https://arxiv.org/pdf/1812.07500
Scott, A. D. and Seymour, P. D.
Induced subgraphs of graphs with large chromatic number. IV. Consecutive holes. J.
Comb. Theory Ser. B. 90 (2018) 180-235
https://doi.org/10.1016/j.jctb.2018.03.006
https://people.maths.ox.ac.uk/scott/Papers/consecutive.pdf
Scott, A. D. and Seymour, P. D.
Induced subgraphs of graphs with large chromatic number. X. Holes with specific
residue. Combinatorica, to appear
https://people.maths.ox.ac.uk/scott/Papers/residues.pdf
Scott, A. D. and Seymour, P. D.
Induced subgraphs of graphs with large chromatic number. XIII. New brooms.
Preprint.
https://people.maths.ox.ac.uk/scott/Papers/newbrooms.pdf
Scott, A. D., Seymour, P. D. and Wood, D. R.
Bad news for chordal partitions. J. Graph Theory 90 (2019) 5-12
https://doi.org/10.1002/jgt.22363
https://people.maths.ox.ac.uk/scott/Papers/chordal.pdf
Scott, A. D. and Wood, D. R.
Separation dimension and degree. Preprint.
https://people.maths.ox.ac.uk/scott/Papers/sepdimension.pdf
Scott, A. D.
[see: Addario-Berry, L., Aru, J.,. Chudnovsky, M., Goldschmidt, C., Groenland, C.,
Guggiari, H., Johnston, T., McDiarmid, C. J.H., Morrison, N. Naves, H., Noel, J. A.,
Norin, S., Reed, B. A., Roberts, A.]
Selig, T., Smith, J. P. and Steingrímsson, E.
EW-tableaux, Le-tableaux, tree-like tableaux and the Abelian sandpile model.
Electron J. Comb. 25 (2018) P3.14
https://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i3p14/pdf
Selig, T.
[see: Dukes, W. M. B.]
Semeraro, J.
[see: Gill, N., Kessar, R., Parker, C.]
Semple, C.
[see: Bordewich, M., Huber, K. T.]
Semukhin, P.
[see: Bell, P. C., Potapov, I.]
Sengul, B.
[see: Berestycki, N., Roberts, M. I.]
Sénizergues, D.
[see: Goldschmidt, C.]
Sereni, J.-S. [see: Edwards, K.]
Serocold, H.
[see:Schulze, B.]
Serra, O.
[see: Diaz, A. E.]
Severini, S.
[see: Andrade, F., Gühne, O., Huber, F., Lockhart, J., Mančinska, L.]
Seymour, P. D.
[see: Chudnovsky, M., Groenland, C., Norin, S., Reed, B. A., Scott, A.. D.]
Shakan, G.
[see: Rudnev, M.]
Shalev, A.
[see: Liebeck, M. W.]
Shallit, J. O.
[see: Goulden, I. P.]
Shapira, A.
[see; Amir, A.]
Sharifzadeh, M.
[see: Balogh, J., Garbe, F., Liu, H.]
Shelah, S.
[see: Komjáth, P.]
Shiraga, T. [see: Cooper, C.]
Shkredov, I. D. [see: Moshchevitin, N., Murphy, B., Rudnev, M.]
Short, I.
Classifying 𝑆𝐿2-tilings. Preprint.
http://arxiv.org/pdf/1904.11900.pdf
Short, I.
[see: Chan, L.]
Šiagiová. J.
[see: Bachratý. M.]
Sidman, J.
[see: Rosen, Z.]
Siebertz, S.
[see: Eickmeyer, K.]
Siemons, I. J. and Zaleskii, A.
Remarks on singular Cayley graphs and vanishing elements of simple groups. J.
Algebr. Comb. (2018)
http://dx.doi.org/10.1007/s10801-018-0860-0
https://arxiv.org/pdf/1804.01204
Siemons, I. J.
[see: Liu, F.]
Siggers, M.
[see: Lee, J.-B.]
Siqalas, I.
[see: Lamprou, I.]
Širáň, J.
[see: Bachratý. M., Breda d’Azevedo, A.. Dalfo, C. Erskine, G., Exoo, G., Fraser, J.,
Griggs, T. S.]
Sisask, O.
[see: Bloom, T. F.]
Sinaimeri, B.
[see: Huber, K. T.]
Skerman, F.
[see: Cai, X. S., McDiarmid, C. J. H., Meeks, K.]
Skokan, J.
[see: Allen, P., Balogh, J., Bustamante, S., Keevash, P., Lo, A.]
Sliačan, J.
[see: Brignall, R., Pikhurko, O.]
Slívová, V. [see: Klimosová, T.]
Sly, A.
[see: Berestycki, N., Hermon, J.]
Smith, B.
[see: Joswig, M., Manjunath, M.. Moffatt, I.]
Smith, D. H.
[see: Montemanni, R.]
Smith, H. [see: Bjorkman, B.]
Smith, J. P.
On the Möbius Function and Topology of General Pattern Posets. Preprint.
https://arxiv.org/pdf/1705.08676
Smith, J. P.
The poset of graphs ordered by induced containment. Preprint.
https://arxiv.org/pdf/1806.01821
Smith, J. P. and Zahedi, E.
Modular Decomposition of Graphs and the Distance Preserving Property. Preprint.
https://arxiv.org/pdf/1805.09853
Smith, J. P.
[see: Dukes, W. M. B., Selig, T.]
Smith, S. M.
[see: Lehner, F.]
Smith, S. G. Z.
[see: Girão, A.]
Smyth, W. F.
[see: Alatabbi, A.]
Snyder, R.
[see: Girão, A., Popielarz, K.]
Sóberon, P.
[see: Bárány, I.]
Sohel Rahman, M.
[see: Alatabbi, A.]
Soicher, L. H.
[see: Greaves,. G.. Östergård, P. R. J.,]
Sokal, A. D.
The Euler and Springer numbers as moment sequences. Expositiones Mathematicae,
to appear.
https://arxiv.org/pdf/1804.04498
Sokal, A. D.
How to generalize (and not to generalize) the Chu--Vandermonde identity. Amer.
Math. Monthly, to appear.
https://arxiv.org/pdf/1804.08919
Sokal, A. D.
Wall's continued-fraction characterization of Hausdorff moment sequences: A
conceptual proof. Preprint.
https://arxiv.org/pdf/1903.12455
Sokal, A. D.
[see: Pétréolle, M.]
Solé, P.
[see: Cameron, P. J.]
Solnon, C.
[see: Hoffmann, R.]
Solotar, A.
[see: Chaparro, C.]
Soltani, S.
[see: Alikhani, S.]
Song, C.
[see: Balister, P. N.]
Sorge, M. [see: van Bevern, R.]
Sorkin, G. B.
[see: Frieze, A. M.]
Sosnovec, J.
[see: Král’, D.]
Soukup, D. T.
[see: Komjáth, P.]
Sousi, P. and Thomas, S.
Cutoff for Random Walk on Dynamical Erdős-Rényi Graph. Preprint.
https://arxiv.org/pdf/1807.04719
Sousi, P.
[see: Asselah, A., Boczkowski, L.,Hermon, J., Peres, Y. ]
Spieksma, F.
[see: Erlebach, T.]
Spiga, P.
[see: Bray, J. N., Della Volta, F., Gill,N.]
Spink, H. and Tiba, M.
Judiciously 3-partitioning 3-uniform hypergraphs. Preprint.
https://arxiv.org/pdf/1810.01731
Spink, H. and Tiba, M.
Multicolour chain avoidance in the boolean lattice. Preprint.
http://arxiv.org/pdf/1904.04080.pdf
Spink, H.
[see: David, S.]
Spirakis, P. G.
[see: Akrida, E. C., Deligkas, A., Lamprou, I., Mertzios, G. B., Michail, O.]
Spirkl, S.
[see: Chudnovsky, M., Groenland, C.]
Spooner, J.
[see: Erlebach, T.]
Spooner, N.
[see : Chiesa, M.]
Staden, K. and Treglown, A.
The bandwidth theorem for locally dense graphs. Preprint.
https://arxiv.org/pdf/1807.09668
Staden, K.
[see: Chervak, O., Hancock, R.]
Stagg, G. W.
[see: Cushing, D.]
Stamoulis, G.
[see: Janssen, R.]
Starikovskaya, T.
[see: Clifford, R.]
Stark, D. S. and Wormald, N. C.
The probability of nonexistence of a subgraph in a moderately sparse random graph.
Combin. Probab. Comput. 27 (2018) 672-715
https://doi.org/10.1017/S0963548318000202
http://arxiv.org/pdf/1608.05193
Stark, D. S. and Wormald, N. C.
The distribution of small subgraph counts in a moderately sparse random graph.
Preprint.
Stasinski, R.
[see: Martin, J. B.]
Stauffer, A. and Taggi, L.
Critical density of activated random walks on transitive graphs. Ann. Probab. 46
(2018) 2190-2220.
https://doi.org/10.1214/17-AOP1224
https://arxiv.org/pdf/1512.02397
Stauffer, A.
[see: Candellero, E., Cannon, S., Caraceni, A., Gracar, A., Rivera, N. ]
Stawiski, M.
[see: Lehner, F.]
St. Dizier, A.
[see: Fink, A.]
Steel, M.
[see: Bordewich, M. J., Gruenwald, S., Huber, K. T.]
Štefankovič, D.
[see: Bezakova, I., Blanca, A., Galanis, A.]
Steif, J.
[see: Peres, Y.]
Stein, M. J.
[see: Allen, P.]
Steinberg, B.
[see: Araújo, J.]
Steiner, W.
[see: Gao, A.]
Steingrímsson, E.
[see: Dugan, W., Dukes, W. M. B ., Selig, T.]
Stewart, A.
[see: Cochefert, M.]
Stewart, I. A.
[see: Erickson, A.]
Stewart, J.
[see: Chen, Z.]
Stong, R.
[see: Chapman, R. J.]
Straszyński, J.,
[see: Alzamel, M.]
Strauss, D.
[see: Hindman, N.]
Stuckey, P. J.
[see: Codish, M.]
Suchy, O.
[see: van Bevern, R.]
Sudakov, B.
[see: Balla, I., Bucic, M., Conlon, D., Montgomery, R., Nenadov, R., Noel, J. A,
Pokrovskiy, A.]
Şule Yazici, E.
[see: Donovan, D. M.]
Sulzbach, H.
[see: Broutin, N., Devroye, L.]
Sun, Y,
[see: Ai, J., Gutin, G.]
Sung, W.-K.
[see: Alzamel, M.]
Susse, T.
[see: Behrstock, J.]
Sutton, L. [see: Bessenrodt, C.]
Svensson, O., Tarnawski, J. and Végh, L. A.
A Constant-Factor Approximation Algorithm for the Asymmetric Traveling Salesman
Problem. STOC2018, 204-213.
https://doi.org/10.1145/3188745.3188824
https://arxiv.org/pdf/1708.04215
Svensson, O., Tarnawski, J. and Végh, L. A.
Constant factor approximation for ATSP with two edge weights. Math. Prog. 172
(2018) 371-397.
http://doi.org/10.1007/s10107-017-1195-7
https://arxiv.org/pdf/1511.07038
Swanepoel, K. J.
Combinatorial distance geometry in normed spaces. In: New Trends in Intuitive
Geometry (Ambrus G., Bárány I., Böröczky K., Fejes Tóth G., Pach J. (eds) ). Bolyai
Society Mathematical Studies, vol 27. Springer, Berlin, Heidelberg
https://doi.org/10.1007/978-3-662-57413-3_17
http://arxiv.org/pdf/1702.00066
Swanepoel, K. J.
[see: Balko, M. Kupavskii, A., Lin, A., Maxwell, A., Naszódi, M.]
Sylvester, J.
[see: Rivera, N.]
Szabó, Cs.
[see: Bodor, B.]
Szabó, T.
[see: Abu-Khazneh, A.]
Szwarcfiter, J. L.
[see: Lin, M. C.]
Taggi, L.
[see: Candellero, E., Stauffer, A.]
Talbot, J. M.
[see: Axenovich, M., Lo, A.]
Talmon, N.
[see: Fluschnik, T.]
Tancer, M.
[see: Bárány, I.]
Tanigawa, S.
[see : Efthekari, Y., Nixon, A.]
Tao, T. C.
[see: Ford, K.]
Tardos, G. [see: Kupavskii, A.]
Tarnawski, J.
[see: Svensson, O.]
Tassi, A.
[see: Brown, S.]
Tatt, R. J.
[see: Bagdasar, O. D.]
Tauraso R,
[see: Chapman, R. J.]
Tavaré, S.
[see: Arratia, R.]
Tebeka, B.
[see: Charalampopoulos, P.]
Teixeira, A. [see: Candellero, E.]
Terhesiu, D.
[see: Bruin, H.]
Terry, C. and Wolf, J.
Stable arithmetic regularity in the finite-field model. Bull. Lond. Math. Soc. 51 (2019)
70-88.
https://doi.org/10.1112/blms.12211
https://arxiv.org/pdf/1710.02021
Terry, C. and Wolf, J.
Quantitative structure of stable sets in finite abelian groups. Preprint.
https://arxiv.org/pdf/1805.06847
Tessera, R. and Tointon, M.
Properness of nilprogressions and the persistence of polynomial growth of given
degree. Discrete Anal. 2018:17 38pp
https://doi.org/10.19086/da.5056
https://arxiv.org/pdf/1612.05152v5
Thapper, J. and Živný, S.
The limits of SDP relaxations for general-valued CSPs. ACM Trans. Comput. Theory.
10 (2018), Article No. 12
https://doi.org/10.1145/3201777
Theofilatos, N.
[see: Michail, O.]
Theran, L.
[see: Connelly, R., Gortler, S., Rosen, Z.,Schulze, B.]
Theyssier, G.
[see: Bridoux, F.]
Thomas, J.
[see: Acan, H.]
Thomas, R.
[see: Dvořák, Z.]
Thomas, R. M.
[see: Jones, S. A. M.]
Thomas, S.
[see: Hermon, J., Sousi, P.]
Thurston, D.
[see: Gortler, S.]
Tiba, M.
[see: Balister, P. N., David, S., Spink, H.]
Tidor, J.
[see: Conlon, D.]
Tillmann, U.
[see: Mahler, B. I.]
Todd, M.
[see: Bruin, .H., Holland, M, Iommi, G.]
Tointon, M.
Polylogarithmic bounds in the nilpotent Freiman theorem. Preprint.
https://arxiv.org/pdf/1812.06735
Tointon, M.
The Mahler conjecture in two dimensions via the probabilistic method. Amer. Math.
Monthly 125 (2018) 820-828
https://doi.org/10.1080/00029890.2018.1503511
https://arxiv.org/pdf/1707.07502
Tointon, M.
Approximate subgroups of residually nilpotent groups. Math. Ann., to appear.
https://arxiv.org/pdf/1509.03876
Tointon, M.
Raconte-moi... les groupes approximatifs. Gaz. Math. 160 (2019) 53-59
http://arxiv.org/pdf/1904.10357.pdf
Tointon, M.
[see: Delabie, T., Martino, A., Tessera, R. ]
Tokac, N.
[see: Bordewich, M. J.]
Tomon, I.
Almost tiling of the Boolean lattice with copies of a poset. Electron J. Comb. 25
(2018) P1.38.
http://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i1p38/pdf
Tomon, I.
[see: Gruslys, V., Kupavskii, A., Narayanan, B. P.]
Torpey, M.
[see: East, J.]
Townsend, T.
[see: Kim, J.]
Towsner, H.
[see: Bernshteyn, A.]
Tran, N. M.
[see: Johnson, M. E.]
Tran, T.
[see: Bucic, M.]
Treglown, A.
[see: Balogh, J., Das, S., Han, J., Hancock, R., Hyde, J., Meeks, K., Staden, K.] Trimble, J.
[see: Archibald, B., Hoffmann, R.]
Trotignon, N.
[see: Chudnovsky, M., Thomassé, S]
Truss, J. K.
[see: Mwesige, F.]
Tserunyan, A.
[see: Bernshteyn, A.]
Tsuji, Y.
[see: Estrada, E.]
Tuite, J.
Digraphs with degree two and excess two are diregular, Discrete Math. 342 (2018)
1233-1244.
https://doi.org/10.1016/j.disc.2019.01.010
https://arxiv.org/pdf/1703.08739
Tuite, J. On diregular digraphs with degree two and excess three. Discrete Appl. Math., to appear.
https://arxiv.org/pdf/1710.00086
Tuite, J.
[see: Erskine, G.]
Turner, P.
[see: Everitt, B.]
Tyros, K.
[see: Georgakopoulos, A., Pikhurko, O.]
Tyomkyn, M.
[see: Alon, N., Amir, A., Kim, J., Nenadov, R.]
Ueltschi, D.
[see: Benassi, C., Björnberg, J.]
Uppman, H.
[see: Fulla, P.]
Uribe Bravo, G.
[see: Mailler, C.]
Vajnovszki, V.
[see: Kitaev, S.]
Vakaliou, E.
[see: Amanatidis, G.]
Valiunas, M.
[see: Martino, A.]
Valtr, P.
[see: Balko, M., Fulek, R.]
Vardi, S.
[see: Czumaj, A.]
Varjú, P. P.
Absolute continuity of Bernoulli convolutions for algebraic parameters. J. Amer.
Math. Soc. 32 (2019) 351-397
https://doi.org/10.1090/jams/916
https://arxiv.org/pdf/1602.00261
Varjú, P. P.
Expansion of coset graphs of 𝑃𝑆𝐿2(𝐹𝑝). Preprint.
https://arxiv.org/pdf/1810.09925
Varjú, P. P.
[see: Breuillard, E., Gutman, Y.]
Varvitsiotis, A.
[see: Mančinska, L.]
Vatter, V.
[see: Albert, M., Brignall, R.]
Vaz, C.
[see: Carriço, J. A.]
Vdovina, A.
[see: Ivrissimtzis, I., Kharlampovich, O.]
Végh, L. A.
[see: Dadush, D., Svensson, O.]
Velozo, A.
[see: Iommi, G.]
Ventura, E.
[see: Martino, A.]
Veremyev, A.
[see: Balister, P. N.]
Vernitski, A.
[see: Kayaturian, G. C.]
Verret, G. [see: Lehner, F.]
Vialette, S.
[see: Bulteau, L.]
Vidnyánszky, Z.
[see: Komjáth, P.]
Vigoda, E.
[see: Blanca, A., Chen, Z., Galanis, A.]
Virchow, S.-C.
[see: Eberhard, S.]
de Visscher, M.
[see: Bowman, C. D.]
Volec, J.
[see: Král’, D.]
Vušković, K.
[see: Boncompagni, V.]
Wagner, A. Zs..
[see: Balogh, J., Bucic, M., Long, J.]
Wagner, S.
[see: Georgakopoulos, A.]
Wagner, U.
[see: Fulek, R.]
Wahlström, M.
Euler Digraphs. In: Classes of Directed Graphs 2018: 173-205
https://doi.org/10.1007/978-3-319-71840-8_4
Wahlström, M.
[see: Gutin, G., Kratsch, S., Reidl, F.]
Waldecker, R.
[see: Jefferson, C.]
Walen, T.
[see: Charalampopoulos, P.]
Walker, A.
Linear inequalities in primes. Preprint.
https://arxiv.org/pdf/1901.04855
Walker, A. and Walker, A.
Arithmetic Progressions with Restricted Digits. Preprint.
https://arxiv.org/pdf/1809.02430
Walker, A.
[see: Bloom, T. F., Walker, A.]
Walters, M. J.
[see: Balister, P. N., Leader, I. B.]
Wang, G.
[see: Lo, A.]
Wang, W.
[see: Liu, F.]
Warnke, L.
[see: Janson, S.]
Wastell, C.
[see: Berenbrink, P.]
Watrigant, R.
[see: Bergé, P.]
Watson, B.
[see: Daykin, J. W.]
Webb, B. S.
[see: Bryant, D.]
Weismantel, R.
[see: Aliev, I.]
Weizmann, O. [see: Charalampopoulos, P.]
Welzl, E. [see: Kupavskii, A.]
de Werra, D.
[see: Alecu, B.]
Westbury, B. W.
Coboundary categories and local rules. Electron J. Comb. 25 (2018) P4.9.
https://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i4p9/pdf
Westermann, M.
[see: Englert, M.]
Whiteley, W.
[see: Efthekari, Y., Nixon, A.]
Whittle, G.
[see: Brettell, N., Campbell, R.]
Whitty, R.
[see: Rutherford, C. G.]
Wildon, M. R.
Permutation groups containing a regular abelian subgroup: the tangled history of two
mistakes of Burnside. Math. Proc. Camb. Philos. Soc., to appear.
https://arxiv.org/pdf/1705.07502
Wildon, M. R. A corollary of Stanley's Hook Content Formula. Preprint.
http://arxiv.org/pdf/1904.08904.pdf
Wildon, M. R.
[see: de Boeck, M., Kochhar, J., Pager, R. E.]
Willard, R.
[see: Bodirsky, M.]
Williams, T.
[see: Cai, J.-Y.]
Wilson, R. C.
[see: Bause, F., Giscard, P.-L.]
Wilson, R. J.
Combinatorics: the mathematics that counts 1, 2, Pi Mu Epsilon Journal 14 (8) (2018)
5213-537 and 14 (9) (2018) 589-597.
Wilson, R. J.
What Was Lejeune Dirichlet Like? The Mathematical Intelligencer, 41( 2019) 51–55.
Wilson, R. J.
Japanese edition of Combiatorics: A Very Short Introduction. Feb 2019.
Wilson, W.
[see: Donoven, C.]
Winkler, P. M.
[see: Blackburn, S.R., Kenyon, R.]
Wise, J. [see: Bjorkman, B.]
Withers, P.
[see: McDiarmid, C. J. H.]
Woeginger, G. J.
[see: Cela, E.]
Wojuteczky, P.
[see: Biró, P.]
Wolf, J.
Some applications of relative entropy in additive combinatorics. In: Surveys in
Combinatorics 2017. (editors A. Claessson, M. Dukes, S. Kitaev, D. Manlove, K.
Meeks). London Math. Soc. Lect. Note Ser. 440 (2017) 409-442.
https://doi.org/10.1017/9781108332699.010
http://www.juliawolf.org/research/preprints/entropyweb.pdf
Wolf, J.
[see: Rimanić, L., Terry, C.]
Wollan, P.
[see: Huynh, T.]
Wong, P. W. H
[see: Sangha, P.]
Wong, T. G.
[see: Lockhart, J.]
Wood, D. R.
[see: Addario-Berry, L., van den Heuvel, J., McDiarmid, C. J. H., Norin, S. Scott, A.
D.]
Woodall, D. R.
The average degree of a subcubic edge-chromatic critical graph, J. Graph Theory 91
(2019) 103–121.
http://dx.doi.org/10.1002/jgt.22423
Woodall, D. R.
Erratum: The average degree of an edge-chromatic critical graph II. Submitted.
Wormald, N. C.
[see: Stark, D. S.]
Worrell, J.
[see: Daviaud, L.]
Wrochna, M.
[see: Král’, D.]
Wu, T.
[see: Huber, K. T., Janssen, R., Kelk, S.]
Wünscher, K.
[see: Lockhart, J.]
Xia, A.
[see: Barbour, A. D.]
Yacout, S.
[see: Lejeune, M.]
Yang, K.
[see: Blanca, A., Galanis, A.]
Yarrow, M.
[see: Haslegrave, J.]
Yau, S.-T.
[see: Cushing, D.]
Yeo, A.
[see: Bang-Jensen, J.. Gutin, G.]
Yeo, D.
[see: Crane, E., Martin, J. B.]
Yepremyan, L.
[see: Jiang, T, Keevash, P.]
Yolov, N.
Blocker size via matching minors. Discrete Math. 341 (2018) 2237-2242
https://doi.org/10.1016/j.disc.2018.04.004
https://arxiv.org/pdf/1606.06263
Yolov, N.
Minor-matching hypertree width. SODA 2018 219-233
https://doi.org/10.1137/1.9781611975031.16
https://arxiv.org/pdf/1704.02939
Yolov, N.
[see: McDiarmid, C. J. H]
Young, M.
[see: Axenovich, M.]
Yukich, J. E. [see: Fountoulakis, N.]
Zahedi, E.
[see: Smith, J. P.]
Zaleskii, A.
[see: Siemons, I. J.]
Zamaraev, V.
[see: AbouEisha, H., Akrida, E. C., Alecu, B., Atminas, A., Collins, A., Dąbrowski, K.
K., Enright, J., Konrad, C., Lozin, V. V., Mertzios, G. B.]
Zamaraeva, E.
[see: Lozin, V. V.]
Zambelli, G.
[see: Dadush, D., Del Pia, M.,]
Zamboni, L. Q.
[see: Hindman, N.]
Zanetti, L.
[see: Sauerwald, T.]
Zantema, H.
[see: Akgün, O.]
Zehavi, F.
[see: Bang-Jensen, J., Gutin, G.]
Zehavi, M.
[see: Lokshtanov, D.]
Zha, S.
[see: Bi, R.]
Zhang, C.
[see: Guo, H.]
Zhang, H.
[see: Bray, J.N.]
Zhang, P. B.
[see: Gao, A., Kitaev, S.]
Zhang, X.
[see: Gutin, G., Kitaev, S.]
Zhao, Y.
[see: Bhattacharya, B. B., Conlon, D., Lo, A.]
Zhu, B.-X.
[see: Pétréolle, M.]
Zhukova, B.
[see: Badkobeh, G.]
Zissimopoulos, V.
[see: Lamprou, I.]
Zito, M.
[see: Sangha, P.]
Živný, S.
[see: Butti, S., Carbonnel, C., Cohen, D. A., Focke, P., Fulla, P., Hirai, H., Iwamasa,
Y., Matl, G., Thapper, J. ]
Zolotykh, N. Y.
[see: Lozin, V. V.]
Zsák, A.
[see: Baudier, F. P.]
Zuba, W.
[see: Alzamel, M.]
van Zwam, S. M. H.
[see: Clark, B.,Grace, K.]
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.
Chic. J. Theor. Comput. Sci. - Chicago Journal of Theoretical Computer Science
Combinatorica – Combinatorica
Comb. Probab. Comput. – Combinatorics, Probability and Computing.
Commentat. Math. Univ. Carol. - Commentationes Mathematicae Universitatis
Carolinae.
Commun. Algebra – Communications in Algebra
Compos. Math. – Compositio Mathematica.
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. Complex Netw. – Journal of Complex Networks.
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. Anal. Appl. – Journal of Mathematical Analysis and Applications.
J. Math. Biol. - Journal of Mathematical Biology
J. Math. Cryptol. – Journal of Mathematical Cryptology
J. Math. Sci – Journal of Mathematical Sciences
J. Number Theory – Journal of Number Theory.
J. Optim. Theory. Appl. - Journal of Optimization Theory and Applications
J. Phys. A. Math. Theor. - Journal of Physics A: Mathematical and Theoretical
JP J. Algebra Number Theory Appl. - JP Journal of Algebra, Number Theory and
Applications
J. Pure Appl. Algebra – Journal of Pure and Applied Algebra
J. Reine Angew. Math.- Journal für die Reine und Angewandte Mathematik
J. Sched. – Journal of Scheduling
J. Stat. Mech. Theory Exp. - Journal of Statistical Mechanics: Theory and
Experiment
J. Stat. Phys – Journal of Statistical Physics.
J. Stat. Plann. Inference – Journal of Statistical Planning and Inference
J. Symb. Log. – Journal of Symbolic Logic
J. Symb. Comput. – Journal of Symbolic Computation
J. Theor. Probab. – Journal of Theoretical Probability.
Lect. Notes Math. - Lecture Notes in Mathematics
Lect. Notes Comput. Sci. – Lecture Notes in Computer Science
Linear Algebra Appl. – Linear Algebra and its Applications.
LMS J. Comput. Math. – London Mathematical Society Journal of Computation and
Mathematics.
Lond. Math. Soc. Lect. Note Ser. – London Mathematical Society Lecture Note Series
Math. Comput. – Mathematics of Computation.
Math. Comput. Sci. - Mathematics in Computer Science
Math. Gaz. – Mathematical Gazette
Math. Intell. - The Mathematical Intelligencer
Math Log. Q. – Mathematical Logic Quarterly
Math. Methods Oper. Res. – Mathematical Methods of Operational Research
Math. Proc. Camb. Philos. Soc. – Mathematical Proceedings of the Cambridge
Philsophical Society
Math. Semesterber. - Mathematische Semesterberichte
Math. Soc. Sci - Mathematical Social Sciences
Math. Z – Mathematische Zeitschrift
Mem. Am. Math. Soc. - Memoirs of the American Mathematical Society
Mich. Math. J. – Michigan Mathematical Journal
Monatsh. Math. - Monatshefte für Mathematik
Mosc. J. Comb. Number Theory - Moscow Journal of Combinatorics and Number
Theory
Networks – Networks
Notices Am. Math. Soc. – Notices of the American Mathematical Society.
Online J. Anal. Comb. - Online Journal of Analytic Combinatorics
Open J. Discrete Math. – Open Journal of Discrete Mathematics
Oper. Res. - Operations Research
Oper. Res. Lett. - Operations Research Letters
Order – Order
Pacific J. Math. – Pacific Journal of Mathematics.
Period. Math. Hung. - Periodica Mathematica Hungarica.
Philos. Trans. R. Soc. Lond., A - Philosophical Transactions of the Royal Society of
London A
Phys. Rev. E – Physical Review E.
Probab. Theory Relat. Fields - Probability Theory and Related Fields
Proc. Am. Math. Soc. - Proceedings of the American Mathematical Society.
Proc. Edinb. Math. Soc. - Proceedings of the Edinburgh Mathematical Society
Proc. Lond. Math. Soc. – Proceedings of the London Mathematical Society
Proc. R. Soc. Lond., Ser. A, Math. Phys. Eng. Sci. - Proceedings of the Royal Society:
Mathematical, Physical and Engineering Sciences
Publ. Math., Inst. Hautes Étud. Sci. - Publications Mathématiques. Institut des Hautes
Études Scientifiques.
Pure Math. Appl. - Pure Mathematics and Applications
Q. J. Math. Quarterly Journal of Mathematics
Quasigroups Relat. Syst. - Quasigroups and Related Systems
RAIRO, Theor. Inform. Appl. - RAIRO. Theoretical Informatics and Applications
Ramanujan J. – Ramanujan Journal.
Random Struct. Algorithms – Random Structures and Algorithms
Rend. Mat. Appl., VII. Ser. - Rendiconti di Matematica e delle Sue Applicazioni. Serie
VII.
Semigroup Forum – Semigroup Forum
Sémin. Lothar. Comb. - Séminaire Lotharingien de Combinatoire
SIAM J. Comput. – Society for Industrial and Applied Mathematics Journal on
Computing
SIAM J. Control Optim. – Society for Industrial and Applied Mathematics Journal on
Control and Optimisation
SIAM J. Discrete Math. - Society for Industrial and Applied Mathematics Journal on
Discrete Mathematics
Stat Probab Let.t – Statistics and Probability Letters
Stochastic Processes Appl. – Stochastic Processes and their Applications
Theor. Comput. Sci. – Theoretical Computer Science
Theory Comput. Syst. – Theory of Computing Systems
Topolog. Appl. – Topology and its Applications
Trans. Am. Math. Soc. – Transactions of the American Mathematical Society
Turk. J. Math. - Turkish Journal of Mathematics
Util. Math. – Utilitas Mathematica
4OR: A Quarterly Journal of Operations Research
