British
Combinatorial
Bulletin 2011
BRITISH COMBINATORIAL BULLETIN 2011
This is the 2011 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. You will observe a minor change in format recently – the front matter, while still containing the accounts and this introduction, does not now contain information about forthcoming meetings etc. This is simply because it overlaps with the content of the Newsletter, available at http://www.essex.ac.uk/maths/BCB/newsletters.htm - the most recent one is number 10 (April 2011). 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 29th April 2011.
The BCB webpage is: http://www.essex.ac.uk/maths/BCB/
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), Peter Rowlinson (Secretary), Keith Edwards (Treasurer), Robin Chapman (BCC23 Local Organiser), Andy Drizen (2010 PCC organiser), David Penman (Bulletin editor), Bridget Webb (Archivist), Jan van den Heuvel, Oliver Riordan and James Hirschfeld.
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, Peter Rowlinson ([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 10. Remember the Newsletter also includes details of e.g. visitors, recent Ph.D theses, jobs and some other items.
Accounts
Please note that the statement about accounts on the next two pages has still to be approved by the Committee at its meeting in May 2011.
BRITISH COMBINATORIAL COMMITTEE
Receipts and Payments Account for the period 1 October 2009 to 30 September 2010
Year to Year to 30/9/2010 30/9/2009 Receipts £ £ Interest 34.57 429.67 Royalties from Cambridge University Press 1299.43 91.62 Unused parts of grants for one-day conferences 21.64 (Surplus from 21st BCC, Reading, 2007) 3694.25 Total receipts 1355.64 4215.54
Payments Grant for London 2-day conference (QMUL/LSE), May 2009 1400.00 Grants for one-day conferences 1250.00 740.46 Workshop on Extremal and Probabilistic Combinatorics, July 2010 800.00 QUB Workshop on Algebra, Combinatorics and Dynamics 500.00 500.00 Postgraduate Combinatorics Conferences 2009, 2010 404.55 Committee meetings expenses (paid to 3 committee members) 250.58 393.26 Open University Combinatorics Prizes 100.00 100.00 (Birmingham Workshop on Extremal Combinatorics, September 08) 500.00 (Deposit for 23rd BCC, Exeter, 2011) 1000.00 Total payments 4705.13 3233.72
Surplus / (deficit) for year (3349.49) 981.82
All funds are unrestricted
Statement of Balances as at 30 September 2010 2009 £ £ Bank accounts: Opening balances 23398.56 22416.74 Surplus (deficit) for year (3349.49) 981.82 Closing balances 20049.07 23398.56
Made up of: Bank of Scotland Treasurer’s Account 9894.71 2278.77 Scottish Widows Bank Charity Deposit Account 10154.36 (Scottish Widows Bank Treasury Tracker Account) 21119.79 20049.07 23398.56
The British Combinatorial Committee is a charity registered in Scotland, No: SC019723.
BRITISH COMBINATORIAL COMMITTEE (Scottish Charity Number SC019723)
The financial statement for the period 1 October 2009 to 30 September 2010 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 Abdullah, Mohammed KCL Adamaszek, Anna Warwick Adamaszek, Michal Warwick Ahmad, Imtiaz Essex Alexoudas, T. RHUL Ali, A. RHUL Ali, L. RHUL Allen, Dr. Stuart M. Cardiff Al-Kharoosi, Fatma QMUL Al-Seraji, Najm Sussex Al-Zengana, Emad Sussex Anderson, Dr. Ian Glasgow Anthony, Prof. Martin LSE Appa, Prof. Gautam LSE Arrowsmith, Prof QMUL David K.
B Babbage, Dr. Steve Vodafone Group Baber, Rahil UCL Bailey, Prof. R.A. QMUL Ball, Prof. Keith M. UCL Bárány, Prof. Imre UCL Barber, B. A. Cambridge Batu, Dr. Tugkan LSE Bedford, Dr. David Keele Belrose, Dr. Caroline Vodafone Group Bending, Dr. Thomas Middlesex D. Biggs, Prof. Norman L. LSE Blackburn, Prof. Simon RHUL Bogacka, Dr. Barbara QMUL Bollobás, Prof. Béla Cambridge Bone, Dr. Nicholas Vodafone Group Bordewich, Dr. Magnus Durham Borovik, Prof. Manchester Alexendre V. Bowler, Dr. Andrew Birkbeck Bray, Dr. John QMUL Briggs, Dr. Keith BT Martlesham Labs Brignall, Dr. Robert Open Brightwell, Prof. G. R. LSE Britnell, Dr. John R. Bristol Brough, Michael QMUL Bryant, Prof. Roger M. Manchester Buchstaber, Prof. V. Manchester Bukh, Boris Cambridge Burrows, Prof. Brian L. Staffordshire Butkovic, Dr. Peter Birmingham Byott, Dr. Nigel P. Exeter
C Cameron, Prof. Peter J. QMUL Camina, Prof. Alan R. UEA Campbell, Dr. Colin M. St. Andrews Candela Pokorna, Dr. Cambridge P. Chapman, Dr. Robin J. Exeter Chen, L. RHUL Chen, Prof. Bo Warwick Chetwynd, Prof. A. G Lancaster Chicot, Dr. Katie M. Open Chuzhanova, Prof. Nottingham Trent Nadia Cid, Dr. Carlos RHUL Ciechanowicz, Dr. C. RHUL Claesson, Dr. Anders Strathclyde Clarke, Dr. Francis W. Swansea Clarke, Geoffrey M. Kent Cohen, Prof. D. E. RHUL Coja-Oghlan, Dr. Amin Warwick Coker, T. Cambridge Conlon, Dr. David Cambridge Constable, Robin L. St. Andrews Cook, Gary Sussex Cooley, Jonathan RHUL Cooper, Dr. Colin KCL Cooper, Prof. S. Barry Leeds Cosh, Ben Reading Coutts, Dr. Hannah Dundee Crampton, Dr. Jason RHUL Creed, Paídí RHUL Crofts, Dr. Jonathan J. Nottingham Trent Crouch, Dr. Simon Hewlett-Packard Crowston, R. RHUL Cryan, Dr. Mary Edinburgh Csornyei, Prof. UCL Marianna Curtis, Prof. Robert T. Birmingham Czumaj, Prof. Artur Warwick
D Dąbrowski, Konrad Warwick Damerell, Dr. R. Mark RHUL Dantchev, Dr. Stefan Durham Deineko, Dr. Vladimir Warwick Dent, Dr. Alex RHUL Dietmann, Dr. Rainer RHUL Drizen, Andrew QMUL Dugdale, Dr. J. Keith Reading Dukes, Dr. W. Mark B. Strathclyde Duncan, Dr. Andrew J. Newcastle Dyer, Prof. Martin Leeds Džamonja, Prof. Mirna UEA
E Eccles, T. Cambridge Edwards, Dr. Keith J. Dundee Efthymiou, Dr. C Warwick Eleftheriou, Andria Essex Ellis, Dr. David Cambridge Englert, Dr. Matthias Warwick Erde, J. P. Cambridge Erlebach, Prof. Thomas Leicester Essam, Prof. John W. RHUL Evans, Prof. David M. UEA Evans, Dr. Edward A. St.Mary's U. C. Everett, Prof. M. G. Greenwich
F Faben, John QMUL Fairbairn, Dr. Ben Birkbeck Falconer, Prof. K. J. St. Andrews Falgas-Rouvry, Victor QMUL Fenner, Prof. Trevor I. Birkbeck Fiz Ponteveros, G. Cambridge Fleischmann, Prof. P. Kent Forbes, Dr. Tony.D. Open Forster, Dr. T. E. Cambridge Fountoulakis, Dr. Birmingham Nikolaos Fraire, E. RHUL Friedetzky, Dr. Tom Durham
G Gairing, Dr. Martin Liverpool Gardiner, Dr. Tony D. Birmingham Garner, Michelle. RHUL Garrod, Ben Cambridge Gąsieniec, Prof. Leszek Liverpool Gate, James Durham Georgiou, Dr. Nicholas Bristol Gerke, Dr. Stefanie RHUL Gibson, Dr. J. Keith Birkbeck Gilmour, Prof. S. G. QMUL Glass, Prof. Celia A. City Goldberg, Prof. Leslie Liverpool A. Goldberg, Prof. Paul W Liverpool Golovach, Dr.Petr Durham Gordon, Dr. Neil A. Hull Gowers, Prof. W. Tim Cambridge Grannell, Prof. Mike J. Open Grbić, Dr. Jelena Manchester Green, Prof. Ben J. Cambridge Greeen, Darryl RHUL Griggs, Prof. Terry Open Grimm, Uwe Open Grimmett, Prof G. R. Cambridge Grindrod, Prof. Peter Reading Gumbrell, Lee RHUL Gutin, Prof. Gregory RHUL Gwynllyw, Dr. Rhys West of England
H Haight, Dr. John A. UCL, London Hall, Dr. Rhiannon Brunel Harden, Christopher Essex Hart, Dr. Sarah Birkbeck Haslegrove, J. Cambridge Hauser, Dr. Raphael Oxford Hetherington, Dr. Nottingham Trent Timothy J. van den Heuvel, Prof. LSE J. Higgins, Prof. Peter M. Essex Hill, Prof. Ray Salford Hilton, Prof. A. J.W. Reading Hirschfeld, Prof. J.W.P. Sussex Hladký, Jan Warwick Hoare, Nick RHUL Hoffman de Visme, Charterhouse School Ivan Holroyd, Dr. Fred C. Open Hook, James Manchester Howard, Dr. John LSE Huczynska, Dr. Sophie St. Andrews Huggett, Dr. Stephen Plymouth Hughes, Dr. Lesley A Ystrad Mynach College Hunt, Dr. Francis Glamorgan Hunter, Dr. Gordon Kingston University J.A. Hurley, Steve Cardiff Hutton, Jamie Sussex
I Iliopoulos, Vasileios Essex Irving, Dr. Rob Glasgow
J Jackson, Prof. Bill QMUL Jackson, Dr. Penelope Stirling S. Jankovic, Milanka Oxford Jennings, Dr. Sylvia London South Bank 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, Mark RHUL Jones, Dr. Mark C. W. Kingston Jones, Dr. Sian Glamorgan Juhasz, Zsofia Essex Jurdzinski, Dr. Marcin Warwick
K Kambites, Dr. Mark Manchester Kay, Adam Open Kazanidis, Dr. Priscila QMUL Keedwell, Dr. A. D. Surrey Keevash, Dr. Peter QMUL Keller, Dr. Mitch. LSE Kelly, Prof F. P. Cambridge Kemp, Prof. David St Andrews Kemp, Dr. Freda St Andrews Khudaverdian, Dr. H. Manchester King, Dr. Oliver H. Newcastle King, Prof. R. C. Southampton Kisil, Dr. V.V. Leeds Kitaev, Dr. Sergey Strathclyde Klopsch, Dr. Benjamin RHUL Knox, Fiachra Birmingham Korpelainen, Nicholas Warwick Kovalenko, Dr. Igor N. UNL Krasikov, Dr. Ilia Brunel Krasovsky, Dr. Igor Brunel Krokhin, Dr. Andrei Durham Krysta, Dr. Piotr Liverpool Kühn, Prof. Daniela Birmingham
L Laczkovich, Prof M. UCL Lamb, Dr. John D. Aberdeen Larcombe, Dr. P. J. Derby Larman, Prof. David G. UCL Launois, Dr. Stephan Kent Law, Hiu Fai Oxford Lawson, Dr. Mark V. Heriot-Watt Laycock, Prof. Patrick Manchester J. Lazic, Dr. Ranko Warwick Leader, Prof. Imre B. Cambridge Leese, Dr. Robert Oxford Lemmens, Dr. Bas Kent Liebeck, Prof. Martin. Imperial College Lignos, Ioannis Durham Linton, Prof. S. A. St. Andrews Lloyd, Dr. E. Keith Southampton Long, Eoin. P. Cambridge Lozin, Prof. Vadim Warwick Luczak, Dr. Malwina LSE Lyle, Dr. Sinead UEA
M Macpherson, Prof. Leeds H. Dugald Makai, Tamas RHUL Makroglou, Dr. Athena Portsmouth Malik, Mr. N. Shane Essex Manlove, Dr. David Glasgow Manns, Mr. Tom Portsmouth Marchant, Edward Cambridge Marsh, Prof. Robert J. Leeds Martin, Dr. James Oxford Martin, Prof. Keith. RHUL Martin, Dr. Russell Liverpool Matthiesen, Lillian Cambridge Matthews, James Edinburgh. Mavron, Prof. Vassili Aberystwyth C. Mayhill, Colin Warwick McAlpine, Kenneth M. Abertay McCabe, Dr. John H. St. Andrews McCourt, Dr. Tom Bristol McDiarmid, Prof. Oxford Colin. J.H. McDonough, Dr. Tom Aberystwyth P. McDowell, Andrew RHUL McKee, Dr. James RHUL McMullen, Prof. Peter UCL Meeks, Kitty Oxford Mitchell, Prof. Chris J. RHUL Mitchell, Dr. James D. St. Andrews Mitchell Dr. Jane M.O. Open Mitra, Prof. Gautam Brunel Mladenović, Dr. Nenad Brunel Montanaro, Dr. Ashley. Cambridge Montecalvo, Federico QMUL Morris, Prof. Alun O. Aberystwyth Mörters, Prof. Peter Bath Mullan, Ciaran RHUL Muller, Haiko Leeds Müller, Prof. Thomas QMUL W. Murphy, Prof. Sean P. RHUL Mycroft, Dr. Richard Birmingham1 Myers, Dr. Joseph S. Cambridge
N Nagarajan, Dr Warwick Rajagopal Nagel, Lars Durham Neale, Vicky Cambridge Neuenhoffer, Dr. Max St. Andrews Ng, Dr. Siaw-Lynn RHUL Noble, Dr. Steven Brunel Norman, Dr. Chris W. RHUL
1 From 1st June (until then at QMUL). Novak, Julia RHUL
O O'Connor, Dr. John J. St. Andrews Olsen, Dr. Lars St. Andrews O’Malley, Dr. Gregg Glasgow O’Neill, Alexander QMUL Osthus, Dr. Deryk Birmingham O'Toole, Lawrence RHUL
P Pachon Pinzon, Dr. Warwick Angelica Y. Paget, Dr. Rowena E Kent Panoui, Anastasia RHUL Paris, Prof. Jeff Manchester Parks, David Open Patel, Dr. Viresh Durham Paterson, Prof. Kenny RHUL Paterson, Dr. Maura Birkbeck Paterson, Prof. Mike Warwick Patterson, Derek QMUL Paulusma, Dr. Daniel Durham Penman, Dr. David Essex Penrose, Prof. Mathew Bath Peresse, Dr. Yann St. Andrews Perkins, Dr. Stephanie Glamorgan Pflügel, Dr. Eckhard Kingston Piguet, Dr. Diana Birmingham Pinch, Dr. Richard G.E. GCHQ, Cheltenham Piper, Prof. Fred RHUL Poghosyan, West of England Anush Pokrovskiy, Alexey LSE Popa, Alex Bristol Potts, Prof. Chris N. Southampton Psomas, Costas Open Preece, Prof. Donald A. QMUL and Kent Prellberg, Dr. Thomas QMUL Prendiville, Sean Bristol Prince, Dr. Alan R. Heriot-Watt Przykucki, M. J. Cambridge Pu, Dr. Ida Goldsmiths, London Purcell, Chris Warwick
Q Quaglia, Elizabeth RHUL Quick, Dr. Martyn R. St. Andrews Quinn, Dr. Kathleen Open A.S.
R Rackham, Tom Oxford Räcke, Dr. Harald Warwick Raman, Dr. Rajiv Warwick Rattan, Dr. Amarpreet Birkbeck Ray, Prof. Nigel Manchester Rees, Prof. Sarah E. Newcastle Reinert, Prof. Gesine Oxford Reuter, A. Imperial Rhodes, Mark Durham Richerby, Dr. David Liverpool Riordan, Prof. Oliver Oxford Robertshaw, Dr. Andy Office for National Statistics Robertson, Prof. St. Andrews Edmund F. Rochanakul, Penying RHUL Roney-Dougal, Dr. St. Andrews Colva. M. Rowley, Dr. Chris A. Open Rowley, Prof. Peter J. Manchester Rowlinson, Prof. Peter Stirling Rudnev, Dr. Misha Bristol Ruškuc, Prof. Nik St Andrews Russell, Dr. Paul A. Cambridge Rutherford, Dr. Carrie London South Bank
S Sach, Benjamin Warwick Saker, Dr. Chris J. Essex Salhi, Dr. Abdel Essex Sands, Dr. Arthur D. Dundee Sanders, Dr. Tom Cambridge Sandling, Dr. Robert Manchester Savani, Dr. Rahul Liverpool Saxl, Prof. Jan Cambridge Saxton, David Cambridge Scott, Prof. Alex D. Oxford Sendova-Franks, Dr. A West of England. Sezgin, S. UCL Shah, Chintan Warwick Shakhlevich, Natasha Leeds Shank, Dr. R. J. Kent Shareef, Dr. Fuad QMUL Shaw, Prof. Ron Hull Shawe-Taylor, Prof. UCL John S. Shreeve, Richard I. Royal Grammar School, High Wycombe and Colchester Institute Siemons, Dr. I. UEA Johannes Singerman, Prof. David Southampton Singmaster, Prof. D. B. London South Bank Širáň, Prof. Jozef Open Sisask, Dr. Olof QMUL Skokan, Dr. Jozef LSE Skyner, Tony Bristol Smith, Prof. Derek H. Glamorgan Smith, Paul Cambridge Soicher, Prof. Leonard QMUL H. Sokal, Prof. Alan D UCL Solomon, Prof. Allan I. Open Sørensen, Dr. Troels Warwick Bjerre Spencer, Claire Reading Sprüssel, Dr. Philipp Oxford Stark, Dr. Dudley S. QMUL Steingrimsson, Prof. Strathclyde Einar von Stengel, Prof. LSE Bernhard Steinberg, Prof. LSE Richard Stewart, Prof. Iain A Durham Stirling, Dr. David S.G. Reading Strusevich, Dr. V. A. Greenwich Swanepoel, Dr. Konrad LSE
T Tan, Ta Sheng Cambridge Talbot, Dr. John M. UCL Talbot, Dr. Richard F. Staffordshire Tarzi, Dr. Sam QMUL Thomas, Dr. A. D. Swansea Thomas, Prof. Richard Leicester M. Thomason, Prof. Cambridge Andrew G. Thomson, Susan RHUL Tiskin, Dr. Alex Warwick Todd, Dr. M. St. Andrews Treglown, Dr. Andrew Birmingham Truss, Prof. John K. Leeds Twigg, Dr. Andy Oxford Tyomykyn, M. Cambridge
V Vámos, Prof. Peter Exeter Vaughan, Emil QMUL Vdovina, Dr. Alina Newcastle Vernitski, Dr. Alexei Essex Vušković, Dr. Kristina Leeds
W Walker, Prof. Mike Vodafone Group/RHUL Walters, Dr. Mark QMUL Warnke, Lutz Oxford Waters, Steven Glasgow Caledonian Watts, Ivor Open Waugh, Karl Sussex Webb, Dr. Bridget S. Open Weber, Prof. Richard Cambridge R. Wells, Matthew Essex Welsh, Prof. Dominic Oxford Wensley, Dr. Chris D. Bangor Whitaker, Dr. Roger Cardiff White, Dr. Lynda V. ICL, London White, Matthew Oxford Whitty, Prof. Robin W. London South Bank Williams, Dr. Gerald Essex Williams, Prof. H. Paul LSE Wilson, Prof. Robert A. QMUL Wilson, Prof. Robin J. Open Winter, Prof. Andreas Bristol Wong, Dr Prudence H Liverpool Woodall, Dr. Douglas Nottingham R. Woodcock, Dr. Chris Kent F. Wright, R. Vodafone Group Wu, Taoyang UEA
X Xiang, Yonghong. Durham
Y Yeo, Dr. Anders RHUL
Z Zalesskii, Prof. A.E. UEA Zamboni, Dr. Luca Strathclyde Zito, Dr. Michele Liverpool 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 T IEEE Transactions on Information Combinatorics and itsApplications Theory H Combinatorica U Journal of Algebraic Combinatorics
I Combinatorics, Probability and V Journal of Combinatorial Designs Computing. 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 g Random Structures and Algorithms Inference d Linear Algebra and its Applications h SIAM Journal on Discrete Mathematics e Networks i Utilitas Mathematica
UNIVERSITY OF ABERDEEN Business School University of Aberdeen, Edward Wright Building, Dunbar Street, Old Aberdeen, AB24 3QY. Tel: 01224 272167 http://www.abdn.ac.uk/business Dr J.D. Lamb* (graphs, matroids, combinatorial optimisation)
Lecture Courses: There are a number of general discrete mathematics courses. Current Periodicals; A, B, E, F, H, I, J, L, M, N, P, Q, R, T, V, W, Z, d, g (some electronic access only).
ABERYSTWYTH UNIVERSITY Institute of Mathematics & Physics Aberystwyth University, Aberystwyth, SY23 3BZ. Tel: 01970 622802 Fax: 01970 6227777 http://www.aber.ac.uk/maps/en/ Prof. V.C. Mavron* (retired: designs, codes) Dr. T. P. McDonough (designs, permutation groups, codes) Prof. A.O. Morris (Emeritus: representation theory and algebraic combinatorics)
Research student C Andreou (Regular Hadamard Matrices)
Lecture courses Graphs and Network (22 lectures, Prof. Mavron) Discrete Mathematics (22 lectures, Prof. Mavron)
Current periodicals: P, U, h
BANGOR UNIVERSITY School of Computer Science University of Bangor, Dean Street, Bangor, Gwynedd LL57 1UT. Tel: 01248 382686 Fax: 01248 361429 http://www.maths.bangor.ac.uk Dr. C.D. Wensley* (combinatorial group theory, combinatorial species)
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 Prof. Peter Mörters* (Probability, including random walks and random networks) Prof. Mathew Penrose (probability theory, geometric random graphs)
Research students Parkpoom Phetpradap (intersections of random walks, Prof. Mörters) Tom Rosoman (topics in random geometric graphs, e.g. percolation thresholds: Prof. Penrose)
Forthcoming visitors to Bath in probability (often interacting with combinatorics) are listed at http://www.maths.bath.ac.uk/~ak257/pab/pab.html
Seminar Informal Probability Seminar (Monday, 12.15) may be relevant.
Current Periodicals: A, B, D, E, F, H, J, L, M, N, P, Q, R, S, T, U,V, X, Y, Z, a, b, c, d, e, f, g, h. Most of these are electronic access only (sometimes only after a fixed date) but E and F are paper access.
BIRKBECK COLLEGE School of Economics, Mathematics and Statistics Birkbeck College, Malet Street, London WC1E 7HX. Tel: 0207 631 6428 Fax: 0207 631 6416 http://www.ems.bbk.ac.uk/ Dr. A. Bowler* (symmetric designs, combinatorial matrices, permutation groups) Dr. B. Fairbairn (combinatorial algebra). Dr. S. Hart (permutation groups, sum-free sets) Dr. M. B. Paterson (frameproof codes, key distribution schemes, multivariate equation solving techniques). Dr. Amarpreet Rattan (factorizations of permutations, combinatorial representation theory, lattice path combinatorics).
School of Computer Science and Information Systems Birkbeck College, Malet Street, London WC1E 7HX. Tel: 0207 631 6700 Fax: 0207 631 6727 http://www.dcs.bbk.ac.uk/ Prof. T. I. Fenner (combinatorial algorithms, probabilistic algorithms, random graphs) Prof. G. Loizou (combinatorial algorithms)
UNIVERSITY OF BIRMINGHAM School of Mathematics University of Birmingham, Edgbaston, Birmingham B15 2TT. Tel: 0121 414 6587 Fax: 0121 414 3389 http://www.mat.bham.ac.uk http://web.mat.bham.ac.uk/D.Osthus/bham.html (for graph theory group).
Dr. Peter Butkovič (Combinatorial Optimisation) Prof. Rob T. Curtis (emeritus: Combinatorial Algebra) Dr. Nikolaos Fountoulakis (Random Graphs, Randomized Algorithms) Dr. Tony Gardiner (Combinatorics) Prof. Daniela Kühn (Graph Theory, Probabilistic Methods) Dr. Richard Mycroft (from June 2011, extremal graph theory) Dr. Deryk Osthus* (Graph theory, Probabilistic Methods, Randomized Algorithms)
Research Fellow Dr. Diana Piguet (extremal and probabilistic combinatorics) Dr. Andrew Treglown (extremal graph theory)
Research Students Fiachra Knox (graph theory, Prof. Kühn)
Lecture courses Discrete Mathematics (22 lectures, 1st year) Combinatorial Optimisation (22 lectures, 3rd year) Combinatorics (22 lectures, 3rd and 4th year) Communication Theory (22 lectures, 3rd and 4th year) Computability (22 lectures, 3rd and 4th years) Advanced Topics in Combinatorics (22, 4th year) Graph Theory (44, 3rd and 4th year)
Seminar Combinatorics Research Seminar (usually Mondays, various times, Prof. Kühn and Dr. Osthus) http://web.mat.bham.ac.uk/D.Osthus/seminar.html
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 Dr. Aram Harrow (quantum computation) Dr. Misha Rudnev (harmonic analysis, geometric combinatorics, hard Erdős problems) Prof. Andreas Winter (quantum and classical information theory).
Research Fellows Dr. Nicholas Georgiou* (random structures, partially ordered sets) Dr. Tom McCourt (graph theory, combinatorial design theory, related algebraic structures) Dr. Tony Skyner (representation theory)
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. Markus Jalsenius (Markov chain algorithms)
Research Students Joseph Grant (representation theory, Dr. Joseph Chuang) Timothy Jones (geometric combinatorics, Dr. Rudnev) Sean Prendiville (additive and combinatorial number theory, Prof. Trevor Wooley). Alex Popa (algorithms, Dr. Clifford) Oliver Roche-Newton (combinatorial geometry, Dr. Rudnev)
Lecture Courses Discrete Mathematics I (48 lectures, 1st year) Discrete Mathematics II (12 lectures, 2nd year) Optimisation 2 (36 lectures, 2nd year) Information Theory (18 lectures, 3rd year) Experimental Design (18 lectures, 3rd year) Computational Complexity Theory (20 lectures, 3rd year) Optimisation 3 (36 lectures, 3rd year) Quantum Information Theory (16 lectures, 4th year)
Seminar Combinatorics Seminar fortnightly (or so) on Thursdays at 4.20 p.m: see http://www.maths.bris.ac.uk/events/seminars/series/index.php?id=41
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 (electronic). 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 (matroids, graphs) Dr. Ilia Krasikov (graph theory, combinatorics, coding theory, number theory, orthogonal polynomials) Dr. Igor Krasovsky (random matrices, orthogonal polynomials) Prof. Gautam Mitra (combinatorial optimisation) Dr. Nenad Mladenović (metaheuristic methods in combinatorial and global optimization, location, transportation, clustering and data mining) Dr. Steven Noble* (combinatorics, graph theory)
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. Furter) Probability (36 lectures, 1st year, Dr. Furter and Mrs. Browne)
Institutional Research Repository (containing preprints etc.): http://bura.brunel.ac.uk/
Current Periodicals: A, B, F, H, I, J, L, M, N, P, Q, R, S, U, V, X, Y, Z, a, b, c, d, e, f, g (electronic only).
UNIVERSITY OF CAMBRIDGE Department of Pure Mathematics and Mathematical Statistics Centre for Mathematical Sciences, Wilberforce Rd, Cambridge CB3 0WB. Tel: 01223 337999 Fax: 01223 337920 http://www.dpmms.cam.ac.uk/ Prof. W. T. Gowers (Trinity) (analysis, combinatorics) Prof. B. J. Green (Trinity) (combinatorics, number theory) Prof. G. R. Grimmett (Churchill) (probability theory, combinatorial theory) Prof. F. P. Kelly (Christ’s) (random processes, networks, optimization) Prof. I. B. Leader* (Trinity) (extremal combinatorics, Ramsey theory) Prof. J. Saxl (Caius) (group theory) Prof. A. G. Thomason (Clare) (combinatorics, graph theory, algorithms) Prof. R. R. Weber (Queen’s) (mathematical operational research, stochastic networks)
Fellows Prof. B. Bollobás (Trinity) (combinatorics, graph theory) Dr. P. Candela Pokorna (Churchill) (combinatorics, analysis) Dr. D. Conlon (St. John’s) (combinatorics and number theory) Dr. D. Ellis (St. John’s) (combinatorics) Dr. T. E. Forster (Clare Hall) (logic, set theory, combinatorics) V. Neale (Murray Edwards) (additive combinatorics) Dr. P. A. Russell (Churchill) (Ramsey theory) Dr. T. Sanders (Christ’s) (analysis, combinatorics, number theory)
Department of Applied Mathematics and Theoretical Physics. Centre for Mathematical Sciences, Wilberforce Road, Cambridge CB3 0WA Dr. A. Montanaro (quantum computation, including combinatorial aspects)
Research students B. A. Barber (Prof. Leader) Tom Coker (Prof. Bollobás) T. Eccles (Prof. Leader) J. P. Erde (Prof. Leader) Gonzalo Fiz Ponteveros (Prof. Gowers) Bryn Garrod (Prof. Bollobás) John Haslegrave (Prof. Bollobás) Eoin Long (Prof. Leader) Edward Marchant (Prof. Thomason) Lilian Matthiesen (Prof. Green) M. J. Przykucki (Prof. Bollobás) David Saxton (Prof. Thomason) Paul Smith (Prof. Gowers) Ta Sheng Tan (Prof. Leader) M. Tointon (Prof. Green) Mykhaylo Tyomkyn (Prof. Bollobás)
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, Prof. T. W. Körner) Combinatorics (24 lectures, Part 3, Prof. Leader) Percolation and related topics (16 lectures, Part 3, Prof. Grimmett) Analysis of Boolean functions (16 lectures, Part 3, Dr. Sanders) Extremal Graph Theory (16 lectures, Part 3, Dr. Conlon). Algebraic Methods in Combinatorics (16 lectures, graduate, Dr. Ellis) Computational Geometry (24 lectures, graduate, Dr. Bukh) Gowers uniformity norms and nilsequences (24 lectures, graduate, Dr. Candela)
Seminars Combinatorics (Thursdays at 2.30 p.m.) Discrete Analysis (Wednesdays at 2.15pm)
UNIVERSITY OF CARDIFF School of Computer Science Cardiff University, Queen's Buildings, Newport Road, PO Box 916, Cardiff CF24 3XF. Tel: 029 2087 4812 Fax: 029 2087 4598 http://www.cs.cardiff.ac.uk/ Dr. S. M. Allen* (mobile communications, frequency assignment, combinatorial optimisation, latin squares) Prof. S. Hurley (mobile communications, frequency assignment, combinatorial optimisation) Dr. R. M. Whitaker (mobile communications, frequency assignment, combinatorial optimisation, latin squares)
Lecture courses Discrete mathematics I (1st year) Discrete mathematics II (2nd year) Information Security (3rd year) Optimisation and Meta-Heuristics (3rd year) Discrete mathematics (M.Sc.)
CITY UNIVERSITY LONDON Faculty of Actuarial Science and Statistics Cass Business School, 106 Bunhill Row, London EC1Y 8TZ Tel: 020 7040 8959 Fax: 020 7040 8572 http://www.cass.city.ac.uk/facact Prof. C. Glass* (operation research)
COLCHESTER INSTITUTE Dr. Richard I Shreeve (retired) (combinatorial geometry in n dimensions, associated duals and nets, n-dimensional polytopes).
UNIVERSITY OF DERBY Derbyshire Business School Faculty of Business, Computing and Law, University of Derby, Kedleston Road, Derby DE22 1GB. Tel: 01332 591892 http://www.derby.ac.uk/dbs/ Dr. Peter J. Larcombe* (hypergeometric function theory, generating functions, binomial coefficient sums)
Research student: James Clapperton (Dr. Larcombe)
Lecture courses: None
Current periodicals: None
UNIVERSITY OF DUNDEE School of Computing University of Dundee, Dundee DD1 4HN. Tel: 01382 384151 Fax: 01382 385509 http://www.computing.dundee.ac.uk Dr. K. J. Edwards* (Graph colourings, graph decompositions, complexity)
Division of Mathematics University of Dundee, 23 Perth Road, Dundee DD1 4HN. Tel. 01382 384471 Fax 01382 385516 http://www.maths.dundee.ac.uk Dr. Hannah J. Coutts (permutation groups) Dr. Arthur D. Sands (retired: Combinatorial problems on finite Abelian groups)
Lecture Courses: Information Theory and Cryptography (M.Sc.)
Current Periodicals: T, V, b, d
DURHAM UNIVERSITY
Department of Computer Science Science Laboratories, South Road, Durham DH1 3LE Tel: 0191 33 41700 Fax: 0191 33 41701 http://www.dur.ac.uk/algorithms.complexity/ Dr. M. Bordewich (computational complexity; randomised algorithms; phylogenetics) Dr. T. Friedetzky (randomised algorithms; probabilistic analysis; sub-linear time algorithms; communication networks) Dr. M. Johnson* (graph theory, combinatorial optimization, combinatorial designs) Dr. A. Krokhin (algebra; logic; discrete mathematics; constraint satisfaction; computational complexity; temporal reasoning) 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)
Research Staff Dr. Petr Golovach (graph theory, graph algorithms, complexity and parameterized complexity) Dr. Anna Huber (randomized and combinatorial methods, discrete mathematics, graph theory, algebra) Dr. Ross Kang (graph colouring, random structures and algorithms) Dr. Yonghong Xiang (interconnection networks; parallel and distributed computing; graph theory) Dr. Barnaby Martin (descriptive complexity) Dr. Viresh Patel (extremal graph and hypergraph theory, posets, and algorithms) Dr. Artem Pyatkin (graph theory, graph colouring)
Research Students James Gate (descriptive complexity, Prof. Stewart) Pim van 't Hof (graph algorithms, Dr. Paulusma) Ioannis Lignos (graph algorithms, Dr. Johnson) Lars Nagel (randomised algorithms, Dr. Friedetzky) Robert Powell (constraint satisfaction, Dr. Krokhin) Jian Song (graph colouring, Dr. Paulusma)
Lecture Courses: Algorithms and Discrete Mathematics (1st year, 20 lectures) Logic (1st year, 20 lectures, Prof. Stewart) Formal and Discrete Mathematics (1st year, 40 lectures) Algorithms and Complexity (2nd year, 20 lectures, Dr. Johnson and Dr. Paulusma) Advanced Algorithms (3rd year, 20 lectures, Dr. Friedetzky) Advanced Computational Complexity (3rd year, 20 lectures, Dr. Johnson) Computability Theory (3rd year, 20 lectures, Dr. Dantchev) Theory and Practice (3rd year, 20 lectures)
Seminars The Algorithms and Complexity Group have a weekly seminar, current webpage. http://www.dur.ac.uk/tom.friedetzky/acidsem.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) Prof. D. M. Evans (permutation groups, automorphism groups of infinite structures) Dr. S. Lyle (representation theory). Dr. I. J. Siemons* (permutation groups, topological and homological methods) Prof A.E. Zalesskii (group theory, ring theory)
School of Computing Sciences University of East Anglia,Norwich, NR4 7TJ, United Kingdom. Tel. +44 (0) 1603 592607. Fax. +44 (0) 1603 593345 http://www.uea.ac.uk/cmp/ Dr. Katharina Huber (finite metic spaces, phylogenetics, discrete algorithms, applications of combinatorial approaches to computational biology) Prof. Vincent Moulton (finite metric spaces, phylogenetics, discrete algorithms, graph theory, applications of combinatorial approaches to computational biology)
Research students Mr. Badr Allhadri (Dr. Lyle) Mr. Kelvin Corlett (Dr. Lyle) Miss S. Bastkowsk (phylogenetics, Prof. Moulton) Mrs. Jo Emms (model theory and infinite permutation groups, Dr. Evans) Mr. S. Greatrix (phylogenetics, Prof. Moulton) Mr. R. Suchecki (phylogenetics, Dr. Huber) Mr. B. Summers (regular orbits, Dr. Siemons)
Lecture courses (check availability): Discrete Mathematics (2nd year) Set theory (3rd year) Infinite permutation groups (4th year, p/g) Representation Theory (3rd year) Graph theory (3rd year) Group theory (3rd year) Computability (3rd year) Model theory (3rd year)
UNIVERSITY OF EDINBURGH School of Informatics 2 Buccleuch Place, Edinburgh EH8 9LW Tel. 0131 650 2691 Fax: 0131 650 6626 http://www.inf.ed.ac.uk Dr. Mary Cryan* (algorithms and complexity)
Research students
Lecture Courses Algorithms and Data Structures (3rd year) Computability and Intractability (3rd year, MSc) Computational Complexity (4th year)
Current Periodicals: E, H, M, T, X, Y
UNIVERSITY OF ESSEX Department of Mathematical Sciences University of Essex, Wivenhoe Park, Colchester CO4 3SQ. Tel: 01206 873040 Fax: 01206 873043 http://www.essex.ac.uk/maths Dr. David Branson (retired: applied probability, combinatorics of Stirling numbers) Prof. Peter.M. Higgins (combinatorics of algebraic semigroup theory, cryptography) Dr. David Penman* (random and pseudo-random graphs) Dr. Chris Saker (part-time: combinatorics on words, semigroup theory, cryptography) Dr. Abdellah Salhi (combinatorial optimisation) Dr. Alexei Vernitski (algebra, combinatorics, computer security) Dr. Gerald Williams (computational group theory)
Research students Andria Eleftheriou (reliability of graphs Dr. Penman: part-time) Christopher Harden (fixed point polynomials of permutation groups, Dr. Penman) Vasileios Iliopoulos (algorithms, Dr. Penman) Zsofia Juhasz (partially ordered sets, Dr. Vernitski) Shane Malik (extremal Ramsey graphs, Dr. Penman) Matthew Wells (probabilistic combinatorics, Dr. Penman)
Lecture Courses Graph Theory (3rd year, Dr. Penman) (30 lectures) Codes and Cryptography (Prof. Higgins, 3rd year) (30 lectures) Combinatorial optimisation (Dr. Salhi, 3rd year) (30 lectures)
Current periodicals: H, P, h.
UNIVERSITY OF EXETER School of Engineering, Computing and Mathematics Harrison Building, University of Exeter, North Park Road, Exeter EX4 4QF. Tel: 01392 263650 Fax: 01392 264067 http://www.secam.ex.ac.uk/mat
Dr. R. J. Chapman* (finite fields,coding theory, enumerative combinatorics) Prof. P. Vámos (representation of matroids)
Lecture courses Discrete Mathematics and Probability (1st year) Coding theory (3rd year) Combinatorics (3rd year) Graphs, Networks and Algorithms (3rd year)
Current periodicals: C, D, W
UNIVERSITY OF GLAMORGAN Division of Mathematics and Statistics University of Glamorgan, Pontypridd, Mid Glamorgan CF37 1DL. Tel: 01443 482136 Fax: 01443 482169 http://fat.glam.ac.uk/research/maths/ Dr. F. Hunt (graph theory, coding theory, signal sets with low correlation) Dr. S. Jones (properties of Sudoku puzzles and their variants) Dr. S. Perkins (coding theory, synchronization, combinatorial puzzles) Prof. D. H. Smith* (coding theory, permutation codes, DNA codes, frequency assignment)
Research students Niema Aboluion (DNA codes, Prof. Smith) Linzy Phillips (Erasure Codes Derived from Sudoku and Related Combinatorial Structures, Dr. Perkins)
Lecture courses Codes and Information (3rd year, Prof. Smith, Dr. Perkins) Combinatorics and Network flows (2nd year, Dr. Perkins and Prof. Smith)
Current periodicals: J, N, T, X, Y, e. T is online only after Vol. 51. J is only from 2004.
UNIVERSITY OF GLASGOW Department of Mathematics University of Glasgow, University Gardens, Glasgow G12 8QW. Tel: 0141 330 5176 Fax: 0141 330 4111 http://www.maths.gla.ac.uk 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)
Research Staff Dr. Gregg O’Malley (combinatorial and graph algorithms)
Research students None at present.
Lecture courses Algorithmic Foundations 2 (Computer Science, 2nd year, 22 lectures, Prof Calder) Algorithmics 3 (Computer Science, 3rd year, 20 lectures, Dr. Norman) Algorithmics 4 (Computer Science, 4th year, 20 lectures, Dr. Manlove) Discrete mathematics (Maths, 24 lectures, 3rd year) Graphs and networks (Maths, 22 lectures, 2nd year)
Current periodicals: C, O, i (paper only) M, N, Q, R, V, X, Y, b, c, h (paper and electronic) A, B, F, H, I, L, P, S, T, U, Z, a, d, e, f, g (electronic only).
GOLDSMITHS COLLEGE Department of Computing Goldsmiths College, University of London, New Cross, London SE14 6NW. Tel: 0207 919 7850 Fax: 0207 919 7853 http://www.goldsmiths.ac.uk/computing/ Dr. I. Pu* (combinatorial algorithms, randomized, parallel, probabilistic and average case algorithmics)
Lecture courses Discrete Mathematics (1st year) Data Structures and algorithms (2nd year, Dr. Pu) Graph Theory (3rd year)
Current Periodicals: X, Y, b
GOVERNMENT COMMUNICATIONS HEADQUARTERS Hubble Road, Cheltenham, GL51 0EX. Tel: 01242 221491 Fax: 01242 226816 http://www.gchq.gov.uk/ Dr. R.G.E. Pinch*
UNIVERSITY OF GREENWICH School of Computing and Mathematical Sciences University of Greenwich, London, SE18 6PF Tel: 0208 316 8000 Fax: 0208 855 4033 http://www.gre.ac.uk/schools/cms Prof. V.A. Strusevich (combinatorial optimization, scheduling theory) Current Periodicals: T
HERIOT-WATT UNIVERSITY Department of Mathematics Heriot-Watt University, Riccarton, Edinburgh EH14 4AS. Tel: 0131 451 3221 Fax: 0131 451 3249 http://www.ma.hw.ac.uk/maths.html Dr. M.V. Lawson (semigroup theory, combinatorics on words) Dr. A. R. Prince* (finite geometries, finite group theory)
Department of Actuarial Mathematics and Statistics Heriot-Watt University, Riccarton, Edinburgh EH14 4AS. Tel: 0131 451 3202 Fax: 0131 451 3249 http://www.ma.hw.ac.uk/ams Dr. Jennie Hansen (probabilistic combinatorics)
Lecture course Discrete mathematics (45 lectures, 3rd year honours degree, Dr. Prince)
Current periodicals: E, F, I, c, g, h
UNIVERSITY OF HULL Centre for Mathematics University of Hull, Cottingham Road, Hull HU6 7RX. Tel: 01482 465885 Fax: 01482 466218 http://www.hull.ac.uk/maths/ Prof. R. Shaw* (Emeritus, finite geometry)
Department of Computer Science University of Hull, Hull HU6 7RX Tel: 01482 465951/465067 Fax: 01482 466666 http://www.dcs.hull.ac.uk Dr. N.A. Gordon (465038) (finite geometry, computer algebra)
Research report series http://www.hull.ac.uk/php/masrs/
Current periodicals: T. Electronic access to H, J, P, Q, R, S, U, V, X, Y, a, b, d
IMPERIAL COLLEGE LONDON Department of Mathematics Imperial College London, London SW7 2AZ. Tel: 0207 594 8517 Fax: 0207 594 8483 http://www.ma.ic.ac.uk Prof A. Ivanov (distance-transitive graphs) Prof. M. W. Liebeck (group theory, algebraic combinatorics) Dr. O. Pretzel (combinatorics)
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)
Lecture courses Graph theory (30 lectures, 3rd year, Dr. Bedford) Discrete mathematics (30 lectures, 3rd year, Dr. Bedford)
UNIVERSITY OF KENT School of Mathematics, Statistics and Actuarial Science Cornwallis Building, University of Kent, Canterbury, Kent CT2 7NF. Tel: 01227 827181 Fax: 01227 827932 http://www.kent.ac.uk/IMS/ G.M. Clarke (non-orthogonal Graeco-Latin designs) Prof. P. Fleischmann (algebraic combinatorics, root systems, Mobius function) Dr. S. Launois (q-calculus) Dr. B. Lemmens (dynamical systems, combinatorial aspects) Dr. R. E. Paget* (representation theory of symmetric groups, cellular algebras) Prof. D. A. Preece (Graeco-Latin designs, nested BIBDs, single-change covering designs, neighbour designs) Dr. R. J. Shank (modular invariant theory) Dr. C. F. Woodcock (orthogonal Latin squares)
Research associate Dr. Alexander Kasprzyk (algebraic geometry, combinatorics of convex lattice polytopes).
Research students Hamid Ahmedinezad (Dr. Brown) Mark Colligan (Dr. Paget) Ashley Hobson (Dr. Shank)
Lecture courses Discrete mathematics (36 lectures, 3rd year, Dr. Woodcock) Groups and Representations (36 lectures, 3rd year, Dr Paget) Symmetries, Groups and Invariants (M.Sc., Prof. Fleischmann) Poisson algebras and combinatorics (M.Sc., Dr. Launois)
Current periodicals: E, F, T (electronic access to A, B, H, J, L, M, N, P, Q, R, S, U, V, X, Y, Z, a, b, c, d, e, f, g)
KING'S COLLEGE LONDON Department of Computer Science King's College, Strand, London, WC2R 2LS Tel 020 7848 2588 Fax: 020 7848 2851 http://www.dcs.kcl.ac.uk Dr Colin Cooper* (random graphs, random algorithms) Dr. Tomasz Radzik (algorithms, combinatorial algorithms etc.).
Research students Mr. Mohammed Abdullah (Dr. Cooper and Dr. Radzik)
KINGSTON UNIVERSITY Faculty of Computing, Information Science and Mathematics Kingston University, Penrhyn Road, Kingston-upon-Thames, KT1 2EE http://cism.kingston.ac.uk 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) 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 Prof. A.G. Chetwynd* (combinatorial applications in statistics) Current periodicals: E, F, T, 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/ Prof. S. B. Cooper (graph theory, Ramsey theory, finite set systems) 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 (quantum groups, algebraic groups, Lie algebras) Prof. J. K. Truss (permutation groups, automorphisms of ordered structures)
School of Computing University of Leeds, Leeds LS6 2HN Tel. 0113 343 5430 Fax 0113 343 5468 http://www.scs.leeds.ac.uk Prof. Martin Dyer* (algorithms and complexity) Dr. Haiko Muller (algorithms, graph theory) Dr. Natasha Shakhlevich (deterministic scheduling theory, combinatorial optimisation, computational complexity) Dr. Kristina Vušković (graph theory, algorithms and combinatorial optimisation)
Research Students Andres Aranda Lopez (Prof. MacPherson) George Attesis (Prof. MacPherson) David Bradley-Williams (Prof. MacPherson and Prof. Truss) Alessandro Condotta (Prof. Dyer and Dr. Shakhlevich). Ragab Elageili (Prof. Truss) Andrew Handley (amorphous computation, Dr. N. Cohen and Prof. Dyer) Tristram Jenkinson (Prof. Truss) Velumailum Mohanaraj (amorphous computing and random graphs, Prof. Dyer). Feresiano Mwesigye (Prof. Truss) Simon Rose (Prof. Truss)
Lecture courses Introduction to Discrete Mathematics (22 lectures, 2nd year, Prof. Truss) Graph theory (22 lectures, 3rd year, Prof. Cooper) Combinatorics (22 lectures, 3rd year, Dr. Allenby) Introduction to Algorithms Theory of computation Computational graph theory and complexity Modern issues in algorithmic design
Current periodicals: P, X, Y
UNIVERSITY OF LEICESTER Department of Computer Science University of Leicester, University Road, Leicester LE1 7RH. Tel: 0116 252 3887 Fax: 0116 252 3604 http://www.cs.le.ac.uk Prof. T. Erlebach (combinatorial optimization, approximation algorithms, algorithmic graph theory) Prof. R. M. Thomas* (combinatorial group and semigroup theory, automata theory)
Research Students Tom Grant (approximation algorithms for wireless networks, Prof. Erlebach) Sam Jones (word problems and formal languages, Prof Thomas) Ambreen Shahnaz (node-weighted Steiner subgraph problems, Prof Erlebach)
Lecture courses Discrete Structures (14 lectures, 1st year, Prof. Thomas) Automata, Languages and Computation (30 lectures, 2nd year, Prof. Thomas) Analysis and Design of Algorithms (30 lectures, 3rd year, Dr. Fung) Cryptography and Information Security (30 lectures, 3rd year, Dr. Fung and Dr. Tuotso) Discrete Event Systems (24 lectures, M.Sc., Dr, Piterman) Algorithms for Bioinformatics (24 lectures, M.Sc., Prof. Erlebach) Game Theory in Computer Science (24 lectures, M.Sc., Prof. Erlebach).
Seminars There is a regular seminar program, see http://www.cs.le.ac.uk/seminars/
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/ Dr. M. Gairing (algorithmic game theory) Prof. L.A. Goldberg* (combinatorial algorithms, complexity of counting and sampling) Prof. P.W. Goldberg (algorithmic game theory) Dr. P. Krysta (algorithmic game theory) Dr. R. Martin (enumerative combinatorics) Dr. P.W.H. Wong (combinatorial algorithms, scheduling, packing) Dr. M. Zito (algorithms and complexity, random structures)
Research Students Iain G. Kelly (colouring random graphs, Dr. Zito) Antony McCabe (Tutte polynomial, Prof. L. Goldberg) Andrew McGrae (colouring, random graphs, Dr Zito) Patarawit Polpinit (algorithmic game theory, Prof. P. Goldberg)
Lecture courses: st Comp108 Algorithmic Foundations (1 year) Comp202 Complexity of Algorithms (2nd year) Comp308 Efficient Parallel Algorithms (3rd year) Comp309 Efficient Sequential Algorithms (3rd year) Comp523 Advanced Algorithmic Techniques (M.Sc.) Comp526 Applied Algorithmics (M.Sc.)
Seminar: Complexity Theory and Algorithmics Seminar, Thursdays 3:15.
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 Prof. Steve Alpern (ergodic theory, game theory, search 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) Prof. Graham Brightwell* (partially ordered sets, random structures) Prof. Jan van den Heuvel (graph theory, discrete mathematics, applications) Dr. Malwina Luczak (probability and discrete mathematics) Dr. 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).
Research Visitor Dr. Mitch Keller (partially ordered sets, discrepancy).
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 (orthogonal latin squares, mixed integer programming, robust regression) Prof. Richard Steinberg (operations management, combinatorial auctions, transportation networks) Prof. Paul Williams (linear and integer programming)
Research students Marianne Fairthorne (combinatorics, Prof. Brightwell and Dr. Luczak) David Ferguson (Ramsey theory, Prof. van den Heuvel and Dr. Skokan) Wan Huang (game theory, Prof. von Stengel) Julian Merschen (game theory, Prof. von Stengel) Alexey Pokrovskiy (graph theory, Prof van den Heuvel and Dr Skokan) Somkiat Trakultraipruk (Graph Theory, Prof van den Heuvel). Zibo Xu (Ramsey theory, Dr. Simon and Dr. Ostaszewski)
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. Sylvia Jennings (coding theory, text compression) Dr. Carrie Rutherford (matroid theory)
Visiting Professors: David Singmaster (recreational mathematics) Robin Whitty* (graph theory)
Lecture courses Discrete mathematics occurs in the first year of all the computing courses (Dr. Jennings, Dr. Rutherford). Applications of combinatorics appear in 1st and 2nd year courses in financial mathematics (Dr. Rutherford) Option in Applied Cryptography occurs in the final year (Dr. Jennings)
Study group/working paper series: http://myweb.lsbu.ac.uk/~ruthercg/MathsStudyGroup/
Current periodicals: T
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/ Prof. A.V. Borovik (matroids and generalisations, Coxeter matroids, Coxeter groups) Prof. R. M. Bryant (groups; Lie algebras) Prof. V. Buchstaber (multivalued groups and association schemes: geometry and combinatorics of polytopes) Dr. J. Grbić (combinatorial Hopf algebras; topology and combinatorics of polytopes) Dr. M. Johnson (free Lie algebras and Young tableaux) Dr. M. Kambites* (combinatorial group and semigroup theory, automata, computational complexity and cryptography) Dr H. Khudaverdian (Lie groups and algebras; symmetric functions; Schur functions; Young tableaux; combinatorics in geometry) Prof. P. J. Laycock (emeritus: experimental design) Prof. J. Paris (logic, including interactions with combinatorics) Prof. N. Ray (combinatorial Hopf algebras, geometry and combinatorics of polytopes) Prof. P. J. Rowley (group theory) Dr. R. Sandling (Steenrod algebra: lattices) Prof. R. St hr (Group theory and Lie algebras, including combinatorial aspects and methods).
Research Students Andrew Fenn (geometry and combinatorics of polytopes, Prof. Buchstaber and Prof. Ray) James Hook (stochastic processes on graphs, Prof. D. Broomhead)
Lecture courses Discrete Mathematics (24 lectures, 2nd year, Dr. Mark Muldoon) Coding Theory (24 lectures, 3rd year, Prof. Peter. Symonds) 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 Economics and Statistics Department Middlesex University Business School, The Burroughs, London, NW4 4BT Tel: 020 8411 6824 http://www.mdx.ac.uk/aboutus/Schools/business_school/departments/economics/inde x.aspx Dr. Thomas D. Bending* (Bent functions; finite geometries; lotteries).
Lecture Courses Operational Research for Business (3rd year) Models in Management Science (M. Sc.) Operational Research Methods (M.Sc.)
Current Periodicals: F, I, P, S, V, X. Y, b, e
UNIVERSITY OF NEWCASTLE UPON TYNE School of Mathematics and Statistics Newcastle University, Newcastle upon Tyne NE1 7RU. Tel: 0191 222 6000 Fax: 0191 222 8020 http://www.ncl.ac.uk/math/ Dr. A. J. Duncan (combinatorial group theory, one-relator products of groups, decision problems and equations over presentations of groups) Dr. O. H. King* (subgroup structure of classical groups, finite geometry) Prof. S. Rees (algorithms in group theory and geometry, automatic groups and related classes of groups, connections between group theory and formal language theory) Dr. Alina Vdovina (geometric group theory, noncommutative geometry, knot theory, Riemannian geometry)
Lecture courses Enumeration and Combinatorics (24 lectures, 2nd year, Dr. Duncan) Geometries and Designs (24 lectures, 3rd year, Dr. King) Coding Theory (24 lectures, 3rd year, Dr. Vdovina).
Current periodicals: A, B, F, H, I, J, L, M, N, P, Q, R, S, T, U, V, X, Y, a, c, d, e, f, g. These are mostly electronic access only, but F, P, R, T, U, X, c, d are paper-access too.
UNIVERSITY OF NOTTINGHAM School of Mathematical Sciences University of Nottingham, University Park, Nottingham NG7 2RD. Tel: 0115 951 4949 Fax: 0115 951 4951 http://www.maths.nottingham.ac.uk Dr. D.R. Woodall* (retired: graph colourings, electoral systems)
Lecture courses Graph Theory (20 lectures, 3rd year, Dr. Diamantis) Coding and cryptography (20 lectures, 3rd year, Dr. Wuthrich)
Current periodicals: several (electronic access only).
NOTTINGHAM TRENT UNIVERSITY School of Science and Technology, Nottingham Trent University, Clifton Campus, Nottingham NG11 8NS. Tel: 0115 848 8417 http://www.ntu.ac.uk/sat/about/academic_teams/phys_maths.html Prof. N. Chuzhanova (bioinformatics, combinatorics on words) Dr. J. J. Crofts (computational graph theory, complex networks, combinatorics, data- mining, computational biology) Dr. T. J. Hetherington* (graph colourings)
Research students: none
Lecture courses: Introductory Graph Theory (24 lectures, 3rd year, 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. R. Brignall (permutation classes, relational structures, graph theory, well quasi order) Dr. K. M. Chicot (infinite combinatorics) Prof. M. J. Grannell (combinatorial design theory, combinatorial computing, Steiner systems, topological design theory) Prof. T. S. Griggs (combinatorial design theory, combinatorial computing, Steiner Systems, topological design theory) Dr. U.. Grimm (enumerative combinatorics, words, tilings, applications to physics) Dr. F. C. Holroyd (retired: fractional graph colourings, graceful and related tree labellings, Erdős-Ko-Rado properties of graphs) Dr. K. A. S. Quinn* (designs and their applications) Dr. C. A. Rowley (design of experiments, problems in document science) Prof. J. Širáň (topological graph theory, Cayley graphs) Dr. B. S. Webb (automorphisms of designs, Latin squares, infinite designs) Prof. R. J. Wilson (history of graph theory and combinatorics, graph colourings)
Department of Physics and Astronomy Faculty of Science, The Open University, Walton Hall, Milton Keynes MK7 6AA. http://physics.open.ac.uk/ Emeritus Prof. A. I. Solomon (combinatorial physics, integer sequences)
Visiting research fellow Dr. A.D. Forbes (Mathematics: combinatorial designs)
Research students A. Kay (binary trees with marked leafs: Dr Rowley, Dr Webb and Dr Vargas-Vera) D. Parks (graph theory in America, 1860-1940: Prof. Wilson: part-time) C. Psomas (topological design theory: Prof Griggs, Prof Širán and Dr. Webb) I. Watts (graph homomorphisms, generalisations of graph colourings: Dr. Holroyd: part-time)
Courses M336: Groups and Geometry (3rd year) MT365: Graphs, networks and design (3rd year) M836: Coding Theory (M.Sc.).
Current periodicals: A, C, D, E, F, H, J, N, P, S, V, W, X, Y, b, i.
UNIVERSITY OF OXFORD The Mathematical Institute 24-29 St. Giles, Oxford OX1 3LB. Tel: 01865 273525 Fax: 01865 273583 http://www.maths.ox.ac.uk Dr. R. Leese (channel assignment problems) Prof. Oliver Riordan (combinatorics, graph theory) Prof. Alex Scott (combinatorics, graph theory) Prof. D. J. A. Welsh (retired: applied probability, complexity)
Research Fellow Dr. Philipp Sprüssel (infinite graph theory)
Department of Statistics 1 South Parks Road, Oxford OX1 3TG. Tel: 01865 272860 Fax: 01865 272595 http://www.stats.ox.ac.uk Prof. C. 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).
Computing Laboratory Wolfson Building, Parks Road, Oxford OX1 3QD Tel: 01865 73838 Fax: 01856 73839 http://web.comlab.ox.ac.uk/oucl/ Dr Raphael Hauser (continuous optimization, applied probability). Dr. Andy Twigg (theoretical computer science, compact routing, graph algorithms)
Research students Milanka Jankovic (Prof Riordan) Hiu Fai Law (combinatorics, graph theory, finite geometry: Prof Scott) Kitty Meeks (computational complexity, Prof. Scott) Tom Rackham (extremal problems, extended graph colourings: Prof Scott) Michaela Rombach (complex networks, graph theory: Dr. Mason Porter and Prof. Scott) Lutz Warnke (random graphs, probabilistic methods, asymptotic enumeration: Prof. Riordan) Matthew White (Prof. Scott)
Lecture courses Combinatorial optimisation (12 lectures, M.Sc. Applied Statistics, Prof. McDiarmid) Communication theory (16 lectures, 3rd year, Dr. D. Stirzaker) Integer programming (16 lectures, 3rd year, Dr. Hauser) Graph Theory (16 lectures, 4th year, Prof. Scott) Probabilistic Combinatorics (16 lectures, 4th year, Prof. Riordan)
Seminar Combinatorial theory (Tuesdays at 2.30 p.m.)
Current periodicals: D, E, J, K, L, N, P, Q, T, Y
UNIVERSITY OF PLYMOUTH School of Mathematics & Statistics University of Plymouth, Drake Circus, Plymouth PL4 8AA. Tel: +44 (0)1752 586888 Fax: +44 (0)1752 586900 http://www.plymouth.ac.uk/pages/view.asp?page=7889 Dr. Stephen Huggett* (graph theory, twistor theory).
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. M. Banaji (graph theory and applications to chemical reactions). Dr. A. Makroglou* Current periodicals: X, Y, b
QUEEN MARY, UNIVERSITY OF LONDON School of Mathematical Sciences (Mathematics Research Centre) Queen Mary, University of London, Mile End Road, London E1 4NS. Tel: 0207 975 5440 Fax: 0208 980 9587 http://www.maths.qmw.ac.uk/ Prof. D. K. Arrowsmith (graph colourings, percolation theory, interaction models and knot invariants) Prof. R. A. Bailey (design of experiments,latin squares and their generalisations, designs for complicated block structures, association schemes, partition species) Dr. J. N. Bray (group theory) Prof. P. J. Cameron* (groups and their operands, graphs, codes, designs, models, orbits and enumeration) Prof. Anthony Hilton (Emeritus Professor: graph theory, design theory, finite set systems) Prof. Bill Jackson (graph theory) Prof. Mark Jerrum (computational complexity, probabilistic computation, the complexity of combinatorial enumeration) Dr. J. Robert. Johnson (graph theory and combinatorics) Dr. Peter Keevash (hypergraph theory) Prof. Thomas Müller (group theory, combinatorics, analysis) Prof. Donald Preece (Emeritus Professor: design theory) Dr. T. Prellberg (statistical mechanics, dynamics, enumerative combinatorics) Dr. L. H. Soicher (computational group theory, graph theory, finite geometry, design theory) Dr. D. S. Stark (probability and combinatorics) Dr. Mark. Walters (probabilistic combinatorics, percolation, extremal problems) Prof. R. A. Wilson (computational group theory)
Researchers Dr. Olof Sisask (additive combinatorics) Dr. Sam Tarzi (graph theory) Dr. Emil Vaughan (graph theory and statistics)
Research students Fatma Al-Kharoosi (coding theory, Prof. Cameron) Michael Brough (graph theory: Prof. Jackson) Andrew Drizen (design theory, Markov chains: Prof Cameron) John Faben (counting complexity for CSP: Prof. Jerrum) Victor Falgas-Rouvry (extremal problems, percolation, probabilistic combinatorics: Dr Walters) Josephine Kusuma (coding theory, Prof. Cameron) Federico Montecalvo (covering designs, Prof. Cameron) Alexander O’Neill (graph theory: Prof. Cameron) Derek Patterson (design theory: Prof Soicher)
Lecture courses Algorithmic Graph Theory (36 lectures, 2nd year, Dr. Keevash) Combinatorics (36 lectures, 3rd year, Prof. Jackson) Coding Theory (36 lectures, 3rd year, Dr. Fayers) Cryptography (36 lectures, 3rd year, Prof. Jackson) Extremal combinatorics (24 lectures, M.Sc., Dr Keevash)
Seminars Combinatorics study group (Prof. Cameron, Fridays 4:30pm) http://www.maths.qmul.ac.uk/~pjc/csg.html Design of Experiments (Dr. Coad, Thursday 4:30pm) Pure Mathematics (Dr. Tomasic, Monday 4:30pm)
Current periodicals: A, B, E, F, H, I, J, L, M, N, P, Q, R, S, T, U, V, X, Y, a, b, c, d, e, f, g. Print only for g, electronic only for A, I, J, L, M, Q, S, a, c,d.e.f. All others available both electronically and in print.
UNIVERSITY OF READING Department of Mathematics University of Reading, Whiteknights, P.O. Box 220 Reading, Berks RG6 6AX. Tel: 0118 378 8996 Fax: 0118 931 3423 Prof. P. Grindrod (applications of graph theory and networks) Prof. A. J. W. Hilton* (graph theory, design theory, finite set systems) Dr. W. R. Johnstone (graph theory) Dr. D. S. G. Stirling (graph theory)
Lecture courses Linear Algebra and Coding Theory (44 lectures, Dr. T. Kuna)
Current periodicals: C, N, P, S, X, Y, b
ROYAL HOLLOWAY, UNIVERSITY OF LONDON Department of Mathematics Royal Holloway, Egham Hill, Egham, Surrey TW20 0EX. Tel: 01784 443093 Fax: 01784 430766 http://www.ma.rhul.ac.uk Prof. Simon R. Blackburn* (group theory, algebra and combinatorics of data communications, coding theory, cryptography) Dr. Carlos Cid (cryptography, security, computational algebra) Dr. Jason Crampton (applications of partial order theory to access control) Dr. Alex Dent (provable security) Dr Rainer Dietmann (analytic number theory, diophantine equations) Dr. Christian Elsholtz (combinatorial number theory, prime numbers) Prof. John W. Essam (applications of graph theory, combinatorics, numerical analysis and computing techniques to problems in critical phenomena theory, in particular to phase transitions, conduction in disordered materials, polymer science, epidemic models and cellular automata) Dr. Stefanie Gerke (graph theory, combinatorics, random structures and algorithms) Dr. Benjamin Klopsch (group theory, additive combinatorics) Prof. Keith M. Martin (cryptography and information security) Dr. James McKee (Salem numbers, Pisot numbers, Mahler measure, elliptic curves, computational number theory) Prof. Chris Mitchell (cryptography and information security) Prof. Sean P. Murphy (spatial probability, cryptography) Dr. Siaw-Lynn Ng (combinatorics, finite geometry, applications to information security) Dr. Chris W. Norman (algebraic topics) Prof. Kenneth G. Paterson (cryptography and coding) Prof. Fred. C. Piper (algebraic combinatorics: finite geometry, theory of designs, coding theory, cryptography)
Visiting Professors Prof. N. Stephens, Prof. M. Walker (Vodafone Ltd).
Postdoctoral Researcher Dr. P. Farshim (predicated-based protocols, data aggregation, communication-efficient cryptosystems)
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) Dr. Anders Yeo (graphs and combinatorics, combinatorial optimisation)
Research students Theofanis Alexoudas (group theory, Dr. Klopsch) Arshad Ali (cryptography, Prof. Mitchell) Liaqat Ali (group theory, Dr. Klopsch) Liang Chen (Role-Based Access Control, Dr. Crampton) Jihoon Cho (key management, secure protocol design for mobile communications) Robert Crowston (combinatorial algorithms, Prof. Gutin and Dr. Yeo) Jonathan Cooley (algebraic graph theory, Dr. McKee) Eduarda Fraire (cryptography, authentication, digital signatures, finite fields and coding theory: Prof. Paterson) Michelle Garner (cryptography, Prof. Martin) Gary Greaves (Salem and Pisot numbers, Dr. McKee) Darryl Green (cryptography, Prof. Martin) Lee Gumbrell (algebraic graph theory; Dr. McKee) Nick Hoare (cryptography and network security, Prof. Paterson) Mark Jones (combinatorial algorithms, Prof. Gutin and Dr. Yeo) Tamas Makai (graph theory, Dr. Gerke) Andrew McDowell (graph theory, Dr. Gerke) Ciaran Mullan (cryptography and group theory; Prof. Blackburn and Dr Cid) Julia Novak (formerly Julia Bate) (combinatorial key management techniques: Prof. Martin). Laurence O'Toole (DES, MARS, feistel networks) Anastasia Panoui (combinatorics and cryptography: Prof. Blackburn) Elizabeth Quaglia (public key cryptography, Prof. Paterson) Penying Rochanakul (combinatorics and cryptography: Prof. Blackburn and Dr. Ng) Susan Thomson (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) Network Algorithms (44 lectures, 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. Gerke) (Tuesdays at 3.00 p.m. in room 219). Information Security Seminar (Dr. Cid) (Thursdays 1.00 in Room C229).
Current periodicals: E, F, H, J, M, N, P, S, T, X, b, h (all available hard copy, some also 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
Dr. C. Bleak (geometric group theory, automatic structures) Dr. C. M. Campbell (combinatorial group theory, combinatorics of semigroup presentations) R. L. Constable (combinatorics) Prof. K. J. Falconer (combinatorial geometry) Dr. S. Huczynska (Applications of finite fields, permutation arrays, combinatorial designs) Dr. A.W. Kemp (combinatorial applications in statistics) Prof. C. D. Kemp (combinatorial applications in statistics) Dr. J. H. McCabe (graph theory, number theory) Dr. J. D. Mitchell (combinatorial and topological aspects of group and semigroup theory) Dr. M. Neunhöffer (group and representation theory) Dr. J. J. O'Connor (combinatorial group theory) Prof. L. Olsen (analysis and combinatorics) Dr. Y. Peresse (combinatorial and topological applications of group and semigroup theory) 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, constraint programming). Prof. N. Ruškuc (combinatorics of words, mappings, permutations: combinatorial semigroup theory) Dr. M. Todd (ergodic theory)
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. S. A. Linton (computational algebra: systems, algorithms and applications)
Research Students Mrs N. H. Abu-Ghazalh (Prof. Ruškuc) Miss J. Awang Mr. S. Baynes (Prof. Ruškuc and Dr. Quick) Mr. S. Craik (graph theory, Dr. Mitchell and Prof. Ruškuc) Mr A. Distler (enumeration of finite semigroups, Dr. Mitchell and Prof. Ruškuc) Miss J. D. Ferguson (group theory, Dr. Quick) Mr. A. Geddes (Dr. Mitchell) Mr. J. Hyde Mr J. M. McDougall-Bagnall (generation questions in finite groups, Dr. Quick) Mr. A. McLeman Ms N. E. Menezes (probabilistic group theory, Dr. Quick and Dr. Roney-Dougal) Ms S. A. Munday (Fuchsian groups and Diophantine Analysis, Dr Bernd Stratmann) Mr Y. Negi (Prof. Linton and Dr. Roney-Dougal) Mr. M.. Pfeiffer (Prof. Ruškuc and Dr. Neunhöffer) Mr Y. H. Peresse (Generation questions in infinite transformation semigroups, Dr. Mitchell and Dr. Quick) Mr M. Pfeiffer (Prof Ruškuc and Dr Neunhöffer) Mr A. J. Samuel (Noncommutative fractal geometry, Dr. Bernd Stratmann) Miss A. Schroeder (Dr. Roney-Dougal and Dr. Neunhöffer)
Lecture courses Discrete mathematics (50 lectures, 2nd year) Finite mathematics (24 lectures, 3rd/4th year, alternate years) Graph Theory (24 lectures, 3rd/4th 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
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 Honorary Professor: Ray Hill* (coding theory, finite geometry) Current periodicals: T
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
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, Department of Computing Science & Mathematics The University of Stirling, Dept. 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) Emeritus Prof. P. Rowlinson* (algebraic graph theory) http://www.cs.stir.ac.uk/~pr/
Lecture courses Discrete structures (44 lectures, 1st year) Combinatorics (32 lectures, 3rd/4th year, alternate years) Algebra and codes (32 lectures, 3rd/4th year, alternate years)
Current periodicals: F, H, N, P, R, S, U, X, Y, d (all electronic).
STRATHCLYDE UNIVERSITY Department of Computer and Information Sciences Livingstone Tower, 26 Richmond Street, Glasgow G1 1XH. Tel: 0141 548 2934 Fax: 0141 548 4523 http://www.strath.ac.uk/cis/
Dr. Anders Claesson (algebraic and enumerative combinatorics) Dr. Mark Dukes (combinatorial and discrete mathematics, statistical mechanics, applied probability) Dr. Sergey Kitaev (combinatorics, discrete analysis, graph theory, formal languages) Prof. Einar Steingrimsson (algebraic and enumerative combinatorics) Dr. Luca Zamboni (algebraic and enumerative combinatorics)
Department of Mathematics and Statistics Livingstone Tower, 26 Richmond Street, Glasgow G1 1XH. Tel: 0141 548 3804 Fax: 0141 548 3345 http://www.mathstat.strath.ac.uk/
Prof. Des Higham (small-world graphs, applications, links to numerical analysis) Dr. Andrew Wade (applied probability, including random graphs).
UNIVERSITY OF SURREY Department of Mathematics University of Surrey, Guildford, Surrey GU2 7XH. Tel: 01483 300800 Fax: 01483 686071 http://www.maths.surrey.ac.uk/ Honorary Visiting Senior Research Fellow Dr. A.D. Keedwell* (Latin squares and quasigroups, finite projective planes, coding theory)
Lecture courses Groups and rings (33 lectures, 2nd year, Dr. D. Fisher) Advanced Algebra (33 lectures, 3rd year, Dr. D. Fisher) Galois theory (33 lectures, 3rd year, Dr. D. Fisher) Experimental design (33 lectures, 3rd year (alternate years), Dr J. D. Godolphin)
Current periodicals: C, E, F, i (paper), T (electronic).
UNIVERSITY OF SUSSEX Department of Mathematics University of Sussex, Brighton, East Sussex BN1 9RF. 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 Najm Al-Seraji (finite geometry, Prof. Hirschfeld) Emad Al-Zangana (finite geometry, Prof. Hirschfeld) Gary Cook (coding theory, Prof. Hirschfeld) Jamie Hutton (coding theory, Prof. Hirschfeld) Karl Waugh (finite geometry, Prof. Hirschfeld)
Lecture courses Groups and Rings (30 lectures, 3rd/4th year, Dr. R. Fenn) Coding Theory (36 lectures, 3rd/4th year, Prof. Hirschfeld)
Current periodicals: None
SWANSEA UNIVERSITY Mathematics Department Swansea University, Singleton Park, Swansea SA2 8PP Tel: 01792 295457 Fax: 01792 295843 http://www-maths.swan.ac.uk Dr. F. W. Clarke Dr. A.D. Thomas
Lecture courses Combinatorics (20 lectures, 3rd year) Applied algebra (40 lectures, 3rd year, Dr. Clarke)
UNIVERSITY COLLEGE LONDON Department of Mathematics University College London, Gower Street, London WC1E 6BT. Tel: 020 7679 2839 Fax: 020 7383 5519 http://www.ucl.ac.uk/Mathematics Prof. K.M. Ball (convex and discrete geometry, functional analysis) Prof. I. Bárány (convex geometry, geometry of numbers, theory of integer programming) Prof. M. Csőrnyei (real analysis) Dr. J.A. Haight (combinatorial number theory, measure theory, ramsey theory, logic) Prof. M. Laczkovich (real analysis) Prof. D.G. Larman (geometric analysis, combinatorics) Prof. P. McMullen (emeritus: convexity, regular polytopes) Prof. A. Sokal (combinatorial aspects of mathematical physics) Dr. J. Talbot* (combinatorics, complexity theory)
Department of Economics University College London, Gower Street, London WC1E 6BT Tel: 020 7679 5888 Fax: 020 7916 2775 http://www.ucl.ac.uk/economics/ Prof. K. Binmore (emeritus: game theory)
Research students Rahil Baber (combinatorics, Dr. Talbot)
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-rnd.com/whoweare/uk.htm Dr. S. Babbage* Dr. C. Belrose Dr. N. Bone Prof. M. Walker R. Wright
The group is interested in cryptography, randomness, statistics, applications of graph theory and combinatorics.
Current periodicals: G, T, Z
UNIVERSITY OF WARWICK Coventry, CV4 7AL
Department of Computer Science Tel: 0247652 3193 Fax: 024 7657 3024 http://www.dcs.warwick.ac.uk/ Dr. Amin Coja-Oghlan* (random structures and algorithms) Prof. Artur Czumaj (analysis and design of algorithms and data structures, randomized algorithms, graph theory, game theory) Dr. Matthias Englert (EPSRC Postdoctoral Fellow in Theoretical Computer Science: analysis and design of algorithms and data structures, approximation algorithms) Dr. Marcin Jurdzinski (algorithmic game theory, logic in computer science, optimization, modelling and algorithmic analysis of systems) Dr. Ranko Lazić (computer science and combinatorics) Dr. Rajagopal Nagarajan (quantum information processing, security and cryptography) Prof. Mike Paterson (computational complexity, analysis and design of algorithms) Dr. Harald Räcke (algorithms, network algorithms). Dr. Troels Bjerre Sørensen (various aspects of game theory) 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. Bo Chen (scheduling theory and applications; real-time optimisation; combinatorial optimisation) Dr. Vladimir Deineko (combinatorial optimisation, polynomially solvable cases of NP-hard problems)
Warwick Mathematics Institute Tel. 024 7652 4661 Fax: 024 7652 4182. http://www.maths.warwick.ac.uk Dr. Amin Coja-Oghlan (random structures and algorithms) Dr. Charis Efthymiou (random structures and algorithms) Prof. Vadim Lozin (algorithmic and structural graph theory) Dr. Angelica Pachon-Pinzon (random structures and algorithms) Dr. Rajiv Raman (approximation algorithms, combinatorial optimisation, graph theory).
Research Students Anna Adamaszek (approximation algorithms, Prof. Czumaj) Michal Adamaszek (combinatorial algebraic topology, Prof. J. Jones and Prof. Czumaj) Konrad Dąbrowski (graph theory, combinatorics, Prof. Lozin) John Fearnley (algorithmic game theory, Dr. Jurdzinski) Jan Hladký (combinatorics, Prof. Czumaj). Nicholas Korpelainen (algorithmic and structural graph theory, Prof. Lozin) Colin Mayhill (graph theory, Prof. Lozin) Chris Purcell (graph theory, Dr. Coja-Oghlan and Prof. Lozin) Chintah Shah (approximation algorithms, Dr. Räcke).
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) Complexity of Algorithms (3rd year) Efficient Parallel Algorithms (3rd year) Advanced Topics in Algorithms (3rd 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 2010-April 2011 - and have come to the attention of the Editor. ―UK based‖ is interpreted liberally for those with more than one base. The intention is that papers whose status has changed (by being accepted, or appearing in print) will appear again, but not those still under consideration or revision, or still waiting to be published (except possibly occasionally preprints which have undergone very substantial revision). Occasionally recent papers from 12-15 months ago which were accidentally omitted from last year’s Bulletin, or preprints more than a year old which appear to be of combinatorial interest but have not previously been publicised in the Bulletin, are included. Authors are (hopefully!) listed in alphabetical order by surname, even if that is not the order in which they appear on the paper – this is essential to keep the Bulletin orderly - and that all co- authors (UK based or not) are cross-referenced to. In the case of authors who have left or entered the UK during the relevant period, we are generous about including the papers, and in particular if an author leaves the UK while his/her paper is working through the system, it continues to be listed. Abbreviations of the titles of journals/serials are normally taken from Zentralblatt, though for less commonly occurring journals, conference proceedings and books the style may vary. Following a suggestion recently, a list of abbreviations and the corresponding full titles of journals is included at the end, to help those unfamiliar with what a particular abbreviation refers to. There will be errors! Where the Editor is aware of a link to a preprint version of an article (and the author has no objection) a link to that page is included. Maintenance of these links will be in the range minimal to non-existent: they are used at your own risk. Use of these versions is likely to be subject to restrictions, e.g. that the version is used only for purposes of personal study and not for commercial purposes, and should not be reproduced further: if in any doubt, you should check with the author(s) of the paper involved before using such links. Preprint versions of a paper may well differ, often non-trivially, from any eventual version which appears in a journal (and there may be several competing versions of the preprint!). The copyright of an article rests with the author(s) unless they have conceded the copyright to (e.g.) a publisher. Some links may not work unless you, or your institution, has certain access rights. Similarly, where a valid DOI number has come to the Editor’s attention these are provided: again, accuracy cannot be guaranteed. This list should not be taken as a complete record of all such publications during the period, and absence of listed papers for any individual should not be taken to imply absence of research activities.
Abdullah, M., Cooper, C. and Frieze, A. M. Cover time of a random graph with given degree sequence. Discrete Math. Theor. Comput. Sci. Proceedings of Analysis of Algorithms ’10. http://www.math.cmu.edu/~af1p/Texfiles/Gnd.pdf Abdullah, M., Cooper, C. and Radzik, T. The Cover Time of Cartesian Product Graphs. IWOCA 2010. Lect. Notes Comput. Sci. 6460 (2011) 377-389. http://dx.doi.org/10.1007/978-3-642-19222-7_37 http://www.springerlink.com/content/q7q14337vq4ml212/fulltext.pdf Abel, J., Anderson I. and Finizio, N. J. Necessary conditions for the existence of two classes of ZCPS-Wh(v). Discrete Appl. Math. 159 (2011) 848-851. http://dx.doi.org/10.1016/j.dam.2011.01.005 Aboluion, N., Montemanni, R., Perkins, S. and Smith, D. H. Linear and nonlinear constructions of DNA codes with Hamming distance d and constant GC-content. Discrete Math., in press. http://dx.doi.org/10.1016/j.disc.2010.03.005 Aboluion, N., Perkins, S. and Smith, D. H. Linear and nonlinear constructions of DNA codes with Hamming distance d, constant GC-content and a reverse-complement constraint. Submitted. Achlioptas, D., Coja-Oghlan, A. and Ricci-Tersenghi, F. On the solution-space geometry of random formulas. Random Struct. Algorithms 38 (2011) 251-268. http://dx.doi.org/10.1002/rsa.20323 http://web.mac.com/aminco/papers/geometry.pdf Adamaszek, A. and Adamaszek, M. Combinatorics of the change-making problem. Eur. J. Comb. 31 (2010) 47-63 http://dx.doi.org/10.1016/j.ejc.2009.05.002 Adamaszek, A. and Adamaszek, M. Large-Girth Roots of Graphs. SIAM J. Discrete Math. 24 (2010) 1501-1514 http://dx.doi.org/10.1137/100792949 Adamaszek, A., Czumaj, A., Englert, M. and Räcke, H. Almost Tight Bounds for Reordering Buffer Management. To appear in Proceedings of the 43rd ACM Symposium on Theory of Computing. http://www.dcs.warwick.ac.uk/~englert/publications/buffer_stoc11.pdf Adamaszek, A., Czumaj, A. and Lingas, A. PTAS for -tour Cover Problem on the Plane for Moderately Large Values of k. Int. J. Found. Comput. Sci. 21 (2010) 893-904. http://dx.doi.org/10.1142/S0129054110007623 Adamaszek, A. and Popa, M. Approximation and hardness results for the maximum edge q-coloring problem. Lect. Notes Comput. Sci. 6507 (2010) 132-143. http://dx.doi.org/10.1007/978-3-642-17514-5_12 http://www.springerlink.com/content/p34h7353t458k447/fulltext.pdf Adamaszek, M. Vertex decompositions of two-dimensional complexes and graphs. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1007/1007.4019v2.pdf Adamaszek, M. Clique complexes versus graph powers. Preprint. http://de.arxiv.org/PS_cache/arxiv/pdf/1104/1104.0433v1.pdf Adamaszek, M. [see: Adamaszek, A.] Adams, P., Bryant, D. E., Forbes, A. D. and Griggs, T. S. Decomposing the complete graph into dodecahedra. Submitted. Addario-Berry, L., Griffiths, S. and Kang, R. J. Invasion percolation on the Poisson-weighted infinite tree. Ann. Appl. Probab., to appear. http://arxiv.org/PS_cache/arxiv/pdf/0912/0912.0335v1.pdf Addario-Berry, L., Kang, R. J. and Müller, T. Acyclic dominating partitions. J. Graph Theory 64 (2010) 292-311. http://dx.doi.org/10.1002/jgt.20457 http://www.dur.ac.uk/r.j.kang/jacob.pdf Aharoni, R., Berger, E., Georgakopoulos, A., Perlstein, A, and Sprüssel, P. The Max-Flow Min-Cut Theorem for Countable Networks J. Comb. Theory Ser. B 101 (2011) 1-17. http://dx.doi.org/10.1016/j.jctb.2010.08.002 http://arxiv.org/PS_cache/arxiv/pdf/0911/0911.4003v1.pdf Ahmed, A., Anderson, I., Azimli M. I. and Preece, D. A. A result on combinatorial cycles. Bull. Inst. Comb. Appl., to appear. Albert, M. H., Atkinson, M. D., Bouvel, M., Claesson, A. and Dukes, W. M. B. The bubble sort operator. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1008/1008.5299v1.pdf Albert, M. H., Atkinson, M. D. and Brignall, R. The enumeration of permutations avoiding 2143 and 4231. Submitted. http://users.mct.open.ac.uk/rb8599/papers/2143-4231-enum.pdf Albert, M. H., Atkinson, M. D., Brignall, R., Ruškuc, N., Smith R. and West, J. Growth rates for subclasses of Av(321). Electron. J. Comb. 17 (2010) R141. http://www.combinatorics.org/Volume_17/PDF/v17i1r141.pdf Albert, M. H., Linton, S. A., Ruškuc, N., Vatter, V. and Waton, S. On convex permutations. Discrete Math. 311 (2011) 715-722. http://dx.doi.org/10.1016/j.disc.2011.01.009 http://www.math.dartmouth.edu/~vatter/publications/convex/convex.pdf Albrecht, M. and Paterson, K. G. Breaking An Identity-Based Encryption Scheme based on DHIES. Preprint. http://eprint.iacr.org/2010/637.pdf Allen, P., Böttcher, J., Hladký, J. and Piguet, D. Turánnical hypergraphs. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1011/1011.1483v1.pdf Allen, P., Brightwell, G. R. and Skokan, J. Ramsey-goodness - and otherwise. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1010/1010.5079v1.pdf Alon, N., Balogh, J., Bollobás, B. and Morris, R. D. The structure of almost all graphs in a hereditary property. J. Comb. Theory Ser. B 101 (2011) 85-110. http://dx.doi.org/10.1016/j.jctb.2010.10.001 http://arxiv.org/PS_cache/arxiv/pdf/0905/0905.1942v1.pdf Alon, N., Gutin, G., Kim, E. J., Szeider S. and Yeo, A. Solving MAX-r-SAT above a Tight Lower Bound. Algorithmica, to appear. http://www.lirmm.fr/~kim/journals/maxRsat2010.pdf Alon, N. , Hefetz, D. and Krivelevich, M. Playing to retain the advantage. Comb. Probab. Comput. 19 (2010) 481-491. http://dx.doi.org/10.1017/S0963548310000064 http://www.maths.qmul.ac.uk/~hefetz/MyPapers/revisedPG.pdf Alpern, S. Search games on trees with asymmetric Travel Times. SIAM J. Control Optim. 48 (2010) 5547-5563. http://dx.doi.org/10.1137/090781115 http://www.lse.ac.uk/collections/operationalResearch/pdf/2010%20Working%20Pape rs/WP%2010-123.pdf Alpern, S., Fokkink, R. and Kikuta, K. On Ruckle's Conjecture on Accumulation Games. SIAM J. Control Optim. 48 (2010) 5073-5083. http://dx.doi.org/10.1137/080741926 http://www.cdam.lse.ac.uk/Reports/Files/cdam-2008-20.pdf Amato, D. Descendants in infinite primitive highly arc-transitive digraphs. Discrete Math. 310 (2010) 2021-2036. http://dx.doi.org/10.1016/j.disc.2010.03.014 Amato, D. and Evans, D. M. Digraphs with Tree-like Descendant Sets. Preprint. http://www.uea.ac.uk//~h120/TreelikePaper.pdf Amato, D. Evans, D. M. and Truss, J. K. Classification of some countable descendant-homogeneous digraphs. Submitted. http://www.maths.leeds.ac.uk/Pure/staff/truss/amato4.pdf Amato, D. and Truss, J. K. Crown-free highly arc-transitive digraphs. Forum. Math. (2010) http://dx.doi.org/10.1511/FORM.2011.055 http://www.amsta.leeds.ac.uk/pure/staff/truss/amato.pdf Amato, D. and Truss, J. K. Descendant-homogeneous digraphs. J. Comb. Theory Ser. A 118 (2011) 403-424. http://dx.doi.org/10.1016/j.jcta.2010.10.002 http://www.amsta.leeds.ac.uk/pure/staff/truss/desc.pdf Anandkumar, A., Balister, P. N., Bollobás, B. and Willsky, A. Energy-Latency Tradeoff for In-Network Function Computation in Random Networks. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1101/1101.0858v2.pdf 2 Anderson, I. [see: Abel, J., Ahmed, A.] Annibale, A., Bianconi, G. and Coolen, A. C. C. Network resilience against intelligent attacks constrained by the degree-dependent node removal cost. J. Phys. A: Math. Theor. 43 (2010) 395001. http://dx.doi.org/10.1088/1751-8113/43/39/395001 http://www.mth.kcl.ac.uk/~tcoolen/published/2010/AnnibaleCoolenBianconi2010.pdf Annibale, A., Coolen, A. C. C., Fernandes, L., Fraternali, F. and Kleinjung, J. Modelling biological networks via tailored random graphs. To appear in Handbook of Statistical Systems Biology. http://www.mth.kcl.ac.uk/~tcoolen/published/preprints/ChapterCoolen3.pdf Anthony, M., Hammer, P. L, Subasi, E. And Subasi, M. A new imputation method for incomplete binary data. Discrete Appl. Math., to appear. http://rutcor.rutgers.edu/pub/rrr/reports2009/15_2009.pdf Anthony, M. and Ratsaby, J. Maximal width learning of binary functions. Theor. Comput. Sci. 411 (2010) 138-147. http://www.maths.lse.ac.uk/Personal/martin/AnthonyRatsabywidth.pdf Archdeacon, D., Griggs, T.S. and Psomas, C. Representing graphs in Steiner triple systems. Submitted. Arhin, J. Every SOMA(n-2,n) is Trojan. Discrete Math. 310 (2010) 303-311. http://dx.doi.org/10.1016/j.disc.2008.09.050 Arratia, R. and Stark, D. S. A total variation distance invariance principle for primes, permutations, polynomials and Poisson-Dirichlet. Preprint. Arrowsmith, D. K, Bhatti, F. M. and Essam, J. W.
2 A shorter version has appeared in the Proceedings of IEEE INFOCOM 2011. Maximal Fermi walk configurations on the directed square lattice and standard Young tableaux. J. Phys. A: Math. Theor. 43 (2010) 145206 http://dx.doi.org/10.1088/1751-8113/43/14/145206 http://www.maths.qmul.ac.uk/~arrow/MaxFermiTableauxAcc.pdf Arthur, D., Clifford, R., Jalsenius, M., Montanaro, A. and Sach, B. The Complexity of Flood Filling Games. In: Lect. Notes Comput. Sci. 6099 (2010) 307-318. http://arxiv.org/PS_cache/arxiv/pdf/1001/1001.4420v2.pdf Atkinson, M. D., Ruškuc, N., and Smith, R. Substitution-closed patterns classes. J. Comb. Theory Ser. A 118 (2011) 317-340. http://dx.doi.org/10.1016/j.jcta.2010.10.006 http://www.cs.otago.ac.nz/staffpriv/mike/Papers/SubstitutionClosure/wreathclosure.p df Atkinson, M. D. [see: Albert, M. H.] Axelsson, R. Hague, M., Kreutzer, S., Lange, M. and Latte, M. Extended Computation Tree Logic. In LPAR 2010. http://www.comlab.ox.ac.uk/people/stephan.kreutzer/Publications/10-lpar.pdf Azimli M. I. [see: Ahmed, A.] Aziz, H., Bachrach, Y., Elkind, E. and Paterson, M. S. False-name manipulations in weighted voting games. Journal of Artificial Intelligence Research 40 (2011) 57-93. http://www.jair.org/media/3166/live-3166-5389-jair.pdf Baber, R. and Talbot, J. M. Hypergraphs do jump. Comb. Probab. Comput. 20 (2011) 161-171. http://dx.doi.org/10.1017/S0963548310000222 http://uk.arxiv.org/PS_cache/arxiv/pdf/1004/1004.3733v1.pdf Baber, R., Johnson, J. R. and Talbot, J. M. The minimal density of triangles in tripartite graphs. LMS J. Comput. Math. 13 (2010) 388-413. http://dx.doi.org/10.1112/S1461157009000436 http://arxiv.org/PS_cache/arxiv/pdf/0910/0910.1237v1.pdf (A relevant computer program may be downloaded from http://www.ucl.ac.uk/~ucahjmt/GraphFinder.cc) Bachrach, Y. [see : Aziz, H.] Baier, G., Erlebach, T., Hall, A., Köhler, E., Kolman, P., Pangrac, O., Schilling, H. and Skutella, M. Length-Bounded Cuts and Flows. ACM Transactions on Algorithms 7 (2010), Article No. 4. http://dx.doi.org/10.1145/1868237.1868241 http://www.math.tu-berlin.de/~skutella/TALG2010-final.pdf Bailey, R. A. and Brien, C. J. Decomposition tables for experiments. II. Two-one randomizations. Annals of Statistics 38 (2010) 3164–3190. http://dx.doi.org/10.1214/09-AOS785 Bailey, R. F. and Cameron, P. J. Base size, metric dimension and other invariants of groups and graphs. Bull. Lond. Math. Soc. 43 (2011) 209-242. http://dx.doi.org/10.1112/blms/bdq096 http://www.math.uregina.ca/~bailey/papers/basesize_metdim.pdf Balister, P. N. [see: Anandkumar, A.] Balogh, J., Bollobás, B., Duminil-Copin, H. and Morris, R. D. The sharp threshold for bootstrap percolation in all dimensions. Trans. Am. Math. Soc., to appear. http://arxiv.org/PS_cache/arxiv/pdf/1010/1010.3326v2.pdf Balogh, J., Bollobás, B., Krivelevich, M., Müller, T. and Walters, M. J. Hamilton Cycles in Random Geometric Graphs. Ann. Appl. Probab., to appear. http://www.math.ucsd.edu/~jbalog/cikk/hamilton-aap.pdf Balogh, J., Bollobás, B. and Morris, R. D. Bootstrap percolation in high dimensions. Comb. Probab. Comput. 19 (2010) 643-692 http://dx.doi.org/10.1017/S0963548310000271 http://arxiv.org/PS_cache/arxiv/pdf/0907/0907.3097v2.pdf Balogh, J., Bollobás, B. and Simonovits, M. The fine structure of octahedron-free graphs. J. Comb. Theory Ser. B 101 (2011) 67-84. http://dx.doi.org/10.1016/j.jctb.2010.11.001 http://www.math.uiuc.edu/~jobal/cikk/octarevised.pdf Balogh, J. [see: Alon, N.] Bamberg, J., Giudici, M., Liebeck, M. W., Praeger, C. E. and Saxl, J. The classification of almost simple 3/2-transitive groups. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1103/1103.6069v1.pdf Banaji, M. Cycle structure in SR and DSR graphs: implications for multiple equilibria and stable oscillation in chemical reaction networks. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1005/1005.5472v2.pdf Banaji, M. Graph-theoretic conditions for injectivity of functions on rectangular domains. J Math Anal Appl. 370 (2010) 302-311. http://arxiv.org/PS_cache/arxiv/pdf/0911/0911.0843v2.pdf Banaji, M. and Craciun, G. Graph-theoretic criteria for injectivity and unique equilibria in general chemical reaction systems. Adv Appl Math. 44 (2010) 168-184. http://arxiv.org/PS_cache/arxiv/pdf/0809/0809.1308v3.pdf Banaji, M. and Rutherford, C. P-matrices and signed digraphs. Discrete Math. 311 (2011) 295-301. http://dx.doi.org/10.1016/j.disc.2010.10.018 http://arxiv.org/PS_cache/arxiv/pdf/1006/1006.0152v1.pdf Bang-Jensen, J. and Yeo, A. Arc-disjoint spanning sub(di)graphs in digraphs. Submitted. http://www.imada.sdu.dk/~jbj/DM209/disjointGD.pdf Bárány, I., Fodor, F. and Vígh, V. Intrinsic volumes of inscribed random polytopes in smooth convex bodies. Adv. Appl. Probab. 42 (2010) 605-619. http://dx.doi.org/10.1239/aap/1282924055 http://arxiv.org/PS_cache/arxiv/pdf/0906/0906.0309v1.pdf Bárány, I. and Reitzner, M. Poisson polytopes. Ann Probab. 38 (2010) 1507-1531. http://dx.doi.org/10.1214/09-AOP514 http://arxiv.org/PS_cache/arxiv/pdf/1010/1010.3582v1.pdf Bárány, I. and Reitzner, M. On the variance of random polytopes. Adv. Math. 225 (2010) 1986-2001. http://dx.doi.org/10.1016/j.aim.2010.04.012 http://www.renyi.hu/~barany/cikkek/var-aim.pdf Bárány, I. and Solymosi, J. (Eds.) An Irregular Mind (Szemerédi is 70). Bolyai Society Mathematical Studies 2010, Volume 21. ISBN: 978-3-642-14443-1. Barbour, A. D. and Reinert, G. The Shortest Distance in Random Multi-type Intersection Graphs. Random Struct. Algorithms, to appear. http://arxiv.org/PS_cache/arxiv/pdf/1001/1001.5357v1.pdf Barlow, M. T., Peres, Y. and Sousi, P. Collisions of random walks. Submitted. http://arxiv.org/PS_cache/arxiv/pdf/1003/1003.3255v1.pdf Bastian, J., Prellberg, T., Rubey, M. and Stump, C. Counting the number of elements in the mutation classes of Ãn-quivers. Submitted to Electron. J. Comb. Batu, T., Berenbrink, P. and Cooper, C. Chains-into-Bins Processes. In IWOCA 2010 314-325. http://arxiv.org/PS_cache/arxiv/pdf/1005/1005.2616v1.pdf Baur, K. and Marsh, R. J. Categorification of a frieze pattern determinant. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1008/1008.5329v1.pdf Beineke, L.W. and Wilson, R. J. The early history of the brick factory problem. Math. Intell. 32 (2010) 41-48. http://dx.doi.org/10.1007/s00283-009-9120-4 Bell, J., Casteels, K. and Launois, S. Primitive ideals in quantum Schubert cells: dimension of the strata. Submitted. http://arxiv.org/PS_cache/arxiv/pdf/1009/1009.1347v1.pdf Bell, J., Casteels, K. and Launois, S. Enumeration of H-strata in quantum matrices with respect to dimension. Submitted. http://arxiv.org/PS_cache/arxiv/pdf/1009/1009.2474v2.pdf Bell, J., Casteels, K. and Launois, S. Enumeration of torus-invariant strata with respect to dimension in the big cell of the quantum minuscule Grassmannian of type Bn Preprint. http://de.arxiv.org/PS_cache/arxiv/pdf/1104/1104.2807v1.pdf Ben-Shimon, S., Ferber, A., Hefetz D. and Krivelevich, M. Hitting time results for Maker-Breaker games. Proceedings of the 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA'11), 900-912, 2011. http://www.maths.qmul.ac.uk/~hefetz/MyPapers/Soda11Paper.pdf Berenbrink, P., Brinkmann, A., Friedetzky, T. and Nagel, L. Balls into non-uniform bins. In Proceedings of the 24th IEEE International Parallel and Distributed Processing Symposium (IPDPS). IEEE, April 2010. http://dx.doi.org/10.1109/IPDPS.2010.5470355 http://www.dur.ac.uk/tom.friedetzky/Papers/2010%5BBBFN%5D%20Balls%20into %20Non-uniform%20Bins%200.pdf Berenbrink, P., Brinkmann, A., Friedetzky, T. and Nagel, L. Balls into bins with related random choices. In Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM Press, June 2010. http://dx.doi.org/10.1145/1810479.1810500 Berenbrink, P., Cooper, C., Elsässer, R., Radzik. T. and Sauerwald, T. Speeding Up Random Walks with Neighborhood Exploration. In SODA 2010 1422-1435. http://www.siam.org/proceedings/soda/2010/SODA10_115_berenbrinkp.pdf Berenbrink, P, Czyzowicz, J., Elsässer, R. and Gąsieniec, L. Efficient Information Exchange in the Random Phone-Call Model. Lect. Notes Comput. Sci. 6199 (2010) 127-138. http://dx.doi.org/10.1007/978-3-642-14162-1_11 http://www.springerlink.com/content/1m7j85717t84666l/fulltext.pdf Berenbrink, P. [see: Batu, T.] Berestycki, N. Emergence of giant cycles and slowdown transition in random transpositions and k-cycles. Electron. J. Probab. 16 (2011) 152-173. http://www.math.washington.edu/~ejpecp/include/getdoc.php?id=5878&article=2179 &mode=pdf Berestycki, N. and Pymar, R. Effect of scale on large-scale mutations. Submitted. http://arxiv.org/PS_cache/arxiv/pdf/1102/1102.4479v1.pdf Berestycki, N., Schramm, O. and Zeitouni, O. Mixing times for random k-cycles and coalescence-fragmentation chains. Ann. Probab., to appear. http://www.wisdom.weizmann.ac.il/~zeitouni/pdf/pmix18.pdf Berger, E., Choromanski, K., Chudnovksy, M., Fox, J., Loebl, M. Seymour, P. D., Scott, A. D. and Thomassé, S. Tournaments and colouring. Submitted. http://people.maths.ox.ac.uk/scott/Papers/tourncol.pdf Berger, E. [see: Aharoni, R.] Bernardi, O., Noy, M. and Welsh, D. J. A. Growth constants of minor-closed classes of graphs. J. Comb. Theory Ser. B 100 (2010) 468-484. http://dx.doi.org/10.1016/j.jctb.2010.03.001 http://www.math.u-psud.fr/~bernardi/publications/growth-new.pdf Bernini, A., Ferrari, L. and Steingrímsson, E. The Möbius function of the consecutive pattern poset. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1103/1103.0173v1.pdf Betz, V. and Ueltschi, D. Spatial random permutations and Poisson-Dirichlet law of cycle lengths. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1007/1007.2224v1.pdf Betz, V. and Ueltschi, D. Spatial random permutations with small cycle weights. Probab. Theory Relat. Fields 149 (2011) 191–222. http://dx.doi.org/10.1007/s00440-009-0248-0 http://www.ueltschi.org/articles/11-BU.pdf Betz, V., Ueltschi, D. and Velenik, Y. Random permutations with cycle weights. Ann. Appl. Probab. 21 (2011) 312-331. http://www.ueltschi.org/articles/11-BUV.pdf Bhatti, F. [see: Arrowsmith, D. K.] Bianconi, G. [see: Annibale, A.] Bilinski, M., Jackson, B., Ma, J. and Yu, X. Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3- edge-connected graphs. J. Comb. Theory Ser. B. 101 (2011) 214-236. http://dx.doi.org/10.1016/j.jctb.2011.02.009 http://www.maths.qmul.ac.uk/~bill/clawfreeSUBMIT.pdf Bingham, N. H. and Ostaszewski, A. Kingman, category and combinatorics. In: J.F.C. Kingman Festschrift, ed. N.H. Bingham and C.M. Goldie), LMS Lecture Notes Series 378 (2010) http://www.maths.lse.ac.uk/Personal/adam/BOst-KCC.pdf Bingham, N. H. and Ostaszewski, A. Dichotomy and infinite combinatorics: the theorems of Steinhaus and Ostrowski. Math. Proc. Camb. Philos. Soc. 150 (2011) 1-22. http://www.maths.lse.ac.uk/Personal/adam/psp2-09140.pdf Birand, B., Chudnovsky, M., Ries, B., Seymour, P. D., Zussman, G. and Zwols, Y. Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory. Proceedings of INFOCOM 2010. http://dx.doi.org/10.1145/1860039.1860045 http://www.columbia.edu/~bb2408/pdfs/AnalyzingGMS_Infocom10.pdf Biró, Cs., Howard, D. M., Keller, M. T., Trotter, W. T. and Young, S. J. Interval partitions and Stanley depth. J. Comb.. Theory Ser. A 117 (2010) 475–482. http://dx.doi.org/10.1016/j.jcta.2009.07.008 http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.170.1224&rep=rep1&type= pdf Biró, P. and Fleiner, T. Fractional solutions for NTU-games, in Proceedings of COMSOC 2010: the 3rd International Workshop on Computational Social Choice, pp. 283-294, 2010 http://www.dcs.gla.ac.uk/publications/paperdetails.cfm?id=9345 Biró, P., Fleiner, T., Irving, R. W. and Manlove, D. F. The College Admissions problem with lower and common quotas. Theor. Comput. Sci. 411 (2010) 3136-3153. http://dx.doi.org/10.1007/s00453-009-9315-2 http://eprints.gla.ac.uk/38576/1/38576.pdf Biró, P., Irving R. and Manlove D. F. Popular matchings in the Marriage and Roommates problems. Proceedings of CIAC 2010, the 7th International Conference on Algorithms and Complexity. Lect. Notes Comput. Sci. 6078 (2010) 97-108. http://dx.doi.org/10.1007/978-3-642-13073-1_10 http://www.springerlink.com/content/fut2706542w15214/fulltext.pdf Biró, P., Irving R. W. and Schlotter, I. Stable matching with couples - an empirical study. ACM J. Exp. Algorithm., to appear. http://www.dcs.gla.ac.uk/publications/paperdetails.cfm?id=9372 Biró, P., Kern, W. and Paulusma, D. On solution concepts for matching games. Lect. Notes Comput. Sci. 6108 (2010) 117-127. http://dx.doi.org/10.1007/978-3-642-13562-0_12 http://www.springerlink.com/content/p14054308107q783/fulltext.pdf Biró, P., Kern, W. and Paulusma, D. Computing solutions for matching games. Int. J. Game Theory , to appear. http://www.durham.ac.uk/daniel.paulusma/Papers/Submitted/matchinggames.pdf Biró, P. and McDermid, E. Matching with sizes (or scheduling with processing set restrictions). Electron. Notes Discrete Math. 36 (2010) 335-342. http://dx.doi.org/10.1016/j.endm.2010.05.043 http://www.dcs.gla.ac.uk/publications/PAPERS/9286/BM10tr.pdf Blackburn, S. R. The discrete logarithm problem modulo one: cryptanalysing the Ariffin-Abu cryptosystem. J. Math. Cryptol. 4 (2010) 193-198. http://dx.doi.org/10.1515/JMC.2010.008 http://eprint.iacr.org/2010/114.pdf Blackburn, S. R. The existence of k-radius sequences. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1101/1101.1172v2.pdf Blackburn, S. R. , Cid C. and Mullan, C. Cryptanalysis of the MST_3 public key cryptosystem. J. Math. Cryptol. 3 (2010) 321-338 http://dx.doi.org/10.1515/JMC.2009.020 http://eprint.iacr.org/2009/248.pdf Blackburn, S. R. , Cid C. and Mullan, C. Group theory in cryptography, Proceedings of Groups St Andrews 2009. Lond. Math. Soc. Lect. Note Ser. 387 (2011) Chapter 6. http://arxiv.org/PS_cache/arxiv/pdf/0906/0906.5545v2.pdf Blackburn, S. R. , Cid C. and Mullan, C. Cryptanalysis of three matrix-based key establishment protocols. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1102/1102.2358v1.pdf Blackburn, S. R., Etzion, T., Martin, K. M. and Paterson, M. B. Distinct difference configurations: Multihop paths and key predistribution in sensor networks. IEEE Trans. Inf. Theory 56 (2010), 3961-3972. http://dx.doi.org/10.1109/TIT.2010.2050794 http://arxiv.org/PS_cache/arxiv/pdf/0811/0811.3896v1.pdf Blackburn, S. R., Etzion, T., Martin, K. M. and Paterson, M. B. Two-Dimensional Patterns with Distinct Differences - Constructions, Bounds, and Maximal Anticodes. IEEE Trans. Inform. Theory, 56 (2010) 1216-1229. http://dx.doi.org/10.1109/TIT.2009.2039046 http://arxiv.org/PS_cache/arxiv/pdf/0811/0811.3832v1.pdf Blackburn, S. R., Etzion, T. and Ng, S.-L. Traceability codes. J. Comb. Theory Ser. A 117 (2010) 1049-1057. http://dx.doi.org/10.1016/j.jcta.2010.02.009 http://eprint.iacr.org/2009/046.pdf Blackburn, S. R. and McKee, J. F. Constructing k-radius sequences. Math. Comput, to appear. http://arxiv.org/abs/1006.5812. Blackburn, S. R., Ostafe, A. and Shparlinski, I. E. On the Distribution of the Subset Sum Pseudorandom Number Generator on Elliptic Curves. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1102/1102.1053v1.pdf Blackburn, S. R., Panoui, A., Paterson, M. B. and Stinson, D. R. Honeycomb arrays. Electron. J. Comb. 17 (2010) R172. http://www.combinatorics.org/Volume_17/PDF/v17i1r172.pdf Blackburn, S. R., Paterson, M. B. and Stinson, D. R. Putting dots in triangles. J. Combin. Math. Combin. Comput., to appear. http://arxiv.org/PS_cache/arxiv/pdf/0910/0910.4325v3.pdf Blackburn, S. R., Paterson, M. B. and Upadhyay, J. On the complexity of the herding attack and some related attacks on hash functions, Des. Codes Cryptography, to appear. http://eprint.iacr.org/2010/030 Blasiak, P., Duchamp, G.H.E., Horzela, A., Penson, K.A. and Solomon, A.I. A combinatorial algebra for second-quantized quantum theory. Adv. Theor. Math. Phys. 14 (2010) http://arxiv.org/PS_cache/arxiv/pdf/1001/1001.4964v1.pdf Blasiak, P., Duchamp, G.H.E., Horzela, A., Penson, K.A. and Solomon, A.I. A three-parameter Hopf deformation of the algebra of Feynman-like diagrams, Journal of Russian Laser Research 31 (2010) 162-181. http://dx.doi.org/10.1007/s10946-010-9135-5 http://oro.open.ac.uk/22224/2/mmanko.pdf Blasiak, P., Duchamp, G.H.E., Horzela, A., Penson, K.A., Poinsot, L. and Solomon, A.I. Ladder operators and endomorphisms in combinatorial physics. Discrete Math. Theor. Comput. Sci. 12 (2010) 23 http://oro.open.ac.uk/22207/1/Ladder_Operators_and_Endomorphisms_in_Combinat orial_Physics_.pdf Blasiak, P., Duchamp, G.H.E., Horzela, A., Penson, K.A. and Solomon, A.I. On certain non-unique solutions of the Stieltjes moment problem, Discrete Math. Theor. Comput. Sci. 12 (2010) 295-306. http://oro.open.ac.uk/22209/1/On_certain_non-unique....pdf Bodirsky, M., Dalmau, V., Martin, B. and Pinsker, M. Distance Constraint Satisfaction Problems. Lect. Notes Comput. Sci. 6281 (2010) 162-173. http://www.dur.ac.uk/barnaby.martin/downloads/webMFCS2010.pdf Bodirsky, M. and Piguet, D. Finite trees are Ramsey under topological embeddings. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1002/1002.1557v1.pdf Bohman, T. and Keevash, P. The early evolution of the H-free process. Invent. Math. 181 (2010) 291-336. http://dx.doi.org/10.1007/s00222-010-0247-x http://www.maths.qmul.ac.uk/~keevash/papers/hfree.pdf Böhme, T., Kostochka, A. V. and Thomason, A. G. Hadwiger numbers and over-dominating colourings. Discrete Math. 310 (2010) 2662-2665. http://dx.doi.org/10.1016/j.disc.2010.03.024 Bohn, A., Cameron, P. J. and Müller, P. Galois groups of multivariate Tutte polynomials. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1006/1006.3869v3.pdf Bollobás, B., Brightwell G. R. and Morris, R. D. Shadows of ordered graphs. J. Comb. Theory Ser. A 118 (2011) 729-747. http://dx.doi.org/10.1016/j.jcta.2010.11.018 http://arxiv.org/PS_cache/arxiv/pdf/0906/0906.3724v1.pdf Bollobás, B., Janson, S. and Riordan, O. M. The cut metric, random graphs, and branching processes. J. Stat. Phys 140 (2010) 289-335. http://dx.doi.org/10.1007/s10955-010-9982-z http://arxiv.org/PS_cache/arxiv/pdf/0901/0901.2091v1.pdf Bollobás, B., Janson, S. and Riordan, O. M. Sparse random graphs with clustering. Random Struct. Algorithms (2010) http://dx.doi.org/10.1002/rsa.20322 http://arxiv.org/PS_cache/arxiv/pdf/0807/0807.2040v2.pdf Bollobás, B., Janson, S. and Riordan, O. M. On covering by translates of a set. Random Struct. Algorithms 38 (2011) 33-67 http://dx.doi.org/10.1002/rsa.20346 http://arxiv.org/PS_cache/arxiv/pdf/0910/0910.3815v1.pdf Bollobás, B., Janson, S. and Riordan, O. M. Monotone graph limits and quasimonotone graphs. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1101/1101.4296v1.pdf Bollobás, B., Leader, I. B. and Walters, M. Lion and Man – Can Both Win? Isr. J. Math., to appear. http://www.maths.qmul.ac.uk/~walters/papers/lion-and-man-journal.pdf Bollobás, B. and Nikiforov, V. The number of graphs with large forbidden subgraphs. Eur. J. Comb. 31 (2010) 1964- 1968. http://dx.doi.org/10.1016/j.ejc.2010.05.005 http://arxiv.org/PS_cache/arxiv/pdf/1001/1001.4249v1.pdf Bollobás, B. and Nikiforov, V. Large joints in graphs. Eur. J. Comb. 32 (2011) 33-44. http://dx.doi.org/10.1016/j.ejc.2010.07.010 http://arxiv.org/PS_cache/arxiv/pdf/1001/1001.2073v1.pdf Bollobás, B., Pritchard, D., Rottvoss, T. and Scott, A. D. Cover-Decomposition and Polychromatic Numbers. 3 Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1009/1009.6144v2.pdf Bollobás, B. and Riordan, O. M. Percolation on self-dual polygon configurations. In: An Irregular Mind (Szemerédi is 70). Bolyai Society Mathematical Studies 2010, Volume 21, 131-217. http://dx.doi.org/10.1007/978-3-642-14444-8_3 http://arxiv.org/PS_cache/arxiv/pdf/1001/1001.4674v1.pdf Bollobás, B. and Riordan, O. M. Sparse graphs: metrics and random models. Random Struct. Algorithms, to appear. http://dx.doi.org/10.1002/rsa.20334 http://arxiv.org/PS_cache/arxiv/pdf/0812/0812.2656v3.pdf Bollobás, B. and Riordan, O. M. Asymptotic normality of the size of the giant component via a random walk. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1010/1010.4595v1.pdf Bollobás, B. and Scott, A. D. Intersections of graphs. J. Graph Theory 66 (2011) 261-282. http://dx.doi.org/10.1002/jgt.20489 http://people.maths.ox.ac.uk/~scott/Papers/graphint.pdf Bollobás, B. and Scott, A. D. Max k-cut and judicious k-partitions. Discrete Math. 310 (2010) 2126-2139 http://dx.doi.org/10.1016/j.disc.2010.04.004 http://people.maths.ox.ac.uk/scott/Papers/kcut.pdf Bollobás, B. [see: Alon, N., Anandkumar, A, Balogh, J.] Bonato, A., Bruhn, H., Diestel, R. and Sprüssel, P. Twins of rayless graphs. J. Combin. Theory. Ser. B. 101 (2011) 60-65. http://dx.doi.org/10.1016/j.jctb.2010.10.004 Bonsma, P., Broersma, H. J., Patel, V. and Pyatkin, A. The Complexity Status of Problems Related to Sparsest Cuts. Lect. Notes Comput. Sci. 6460 (2011) 125-135. http://dx.doi.org/10.1007/978-3-642-19222-7_14 http://www.springerlink.com/content/f261r791h883jt34/fulltext.pdf Bordewich, M. On the Approximation Complexity Hierarchy. Lect. Notes Comput. Sci. 6534 (2011) 37-46. http://dx.doi.org/10.1007/978-3-642-18318-8_4 http://www.springerlink.com/content/v8409ug70w752760/fulltext.pdf Bordewich, M. and Kang, R. J. Rapid mixing of subset Glauber dynamics on graphs of bounded tree-width. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1102/1102.3635v1.pdf Bordewich, M. and Mihaescu, R.
3 Contains an earlier preprint by Bollobás+Scott “covering numbers for graphs/hypergraphs”. Accuracy Guarantees for Phylogeny Reconstruction Algorithms Based on Balanced Minimum Evolution. 10th International Workshop on Algorithms in Bioinformatics, Lect. Notes Comput. Sci. 6293 (2010) 250-261. http://dx.doi.org/10.1007/978-3-642-15294-8 Böttcher, J., Hladký, J. and Piguet, D. The tripartite Ramsey number for trees. J. Graph Theory, to appear. http://arxiv.org/PS_cache/arxiv/pdf/0904/0904.3433v1.pdf Böttcher, J. [see: Allen, P.] Bousquet-Mélou, M., Claesson, A., Dukes, W. M. B. and Kitaev, S. (2+2)-free posets, ascent sequences and pattern avoiding permutations. J. Comb. Theory Ser. A 117 (2010) 884–909. http://dx.doi.org/10.1016/j.jcta.2009.12.007 http://arxiv.org/PS_cache/arxiv/pdf/0806/0806.0666v4.pdf 4 Bouvel, M. [see: Albert, M. H.] Bowler, A., Brown P. and Fenner, T. I. Families of pairs of graphs with a large number of common cards. J. Graph Theory 63 (2010) 146-163. http://dx.doi.org/10.1002/jgt.20415 Bowler, A., Brown P., Fenner, T. I. and Myrvold, W. Recognising connectedness from vertex-deleted subgraphs. J. Graph Theory, to appear. http://dx.doi.org/10.1002/jgt.20531 http://onlinelibrary.wiley.com/doi/10.1002/jgt.20531/full Brändén, P. and Claesson, A. Mesh patterns and the expansion of permutation statistics as sums of permutation patterns. Electron. J. Comb. 18 (2) (2011) (Zeilberger Festschrift) P5. http://www.combinatorics.org/Volume_18/PDF/v18i2p5.pdf Breda d’Avezeda, A. , Jones, G. A. and Schulte, E. Constructions of chiral polytopes of small rank. Can. J. Math, to appear. http://arxiv.org/PS_cache/arxiv/pdf/1008/1008.1080v1.pdf Breuillard, E. and Green, B. J. Approximate groups, I: the torsion-free nilpotent case. J. Inst. Math. Jussieu 10 (2011) 37-57. http://dx.doi.org/10.1017/S1474748010000150 http://arxiv.org/PS_cache/arxiv/pdf/0906/0906.3598v1.pdf Breuillard, E. and Green, B. J. Approximate groups, II: the solvable linear case. Q. J. Math (2010) http://dx.doi.org/10.1093/qmath/haq011 http://arxiv.org/PS_cache/arxiv/pdf/0907/0907.0927v1.pdf Breuillard, E., Green, B. J. and Tao, T. Linear Approximate Groups. Electron. Res. Announc. Math. Sci. 17 (2010) 57-67. http://dx.doi.org/10.3934/era.2010.17.57 http://arxiv.org/PS_cache/arxiv/pdf/1001/1001.4570v4.pdf Breuillard, E., Green, B. J. and Tao, T. Suzuki groups as expanders. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1005/1005.0782v1.pdf Brien, C. J. [see; Bailey, R. A.]
4 (An extended abstract appeared at FPSAC 2009).
Briggs, K. Asymptotic expansions for enumerating connected labelled graphs. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1103/1103.2251v1.pdf Brightwell, G. R., Cohen, G., Fachini, E., Fairthorne, M., Körner, J., Simonyi, G. and Tóth, A. Permutation capacities of families of oriented infinite paths. SIAM J. Discrete Math. 24 (2010) 441-456. http://dx.doi.org/10.1137/090765407 http://www-rocq.inria.fr/secret/Jean-Pierre.Tillich/publications_COCQ/cohen1.pdf Brightwell, G. R. and Luczak, M. J. Vertices of high degree in the preferential attachment tree. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1012/1012.5550v1.pdf Brightwell, G. R. and Luczak, M. J. Order-invariant measures on causal sets. Ann. Appl. Probab., to appear. Brightwell, G. R. [see: Allen, P., Bollobás, B.] Brignall, R. A survey of simple permutations. In Permutation Patterns (2010), S. Linton, N. Ruškuc and V. Vatter, Eds., vol. 376 of London Mathematical Society Lecture Note Series, Cambridge University Press, pp. 41--65. http://users.mct.open.ac.uk/rb8599/papers/simples-survey.pdf Brignall, R., Ruškuc, N. and Vatter, V. Simple extensions of combinatorial structures. Mathematika, to appear. http://dx.doi.org/10.1112/S0025579310001518 http://www.maths.bris.ac.uk/~marlfb/papers/simple-extensions.pdf Brignall, R. [see: Albert, M. H.] Brinkmann, A. [see: Berenbrink, P.] Briskorn, D., van 't Hof, P. and Post, G. Constructing fair round robin tournaments with a minimum number of breaks. Oper. Res. Letters 38 (2010) 592-596. http://dx.doi.org/10.1016/j.orl.2010.08.008 http://folk.uib.no/pho042/rr.pdf Broersma, H. J., Dantchev, S., Johnson, M. and Szeider, S. (eds). Part special issue: Selected papers from the 3rd algorithms and complexity Durham Workshop, ACiD 2007, Durham, UK, September 17--19, 2007. J. Discrete Algorithms 8 (2010) 101-130 Broersma, H. J., Golovach, P. A., Paulusma D. and Song, J. On coloring graphs without induced forests. Lect. Notes Comput. Sci. 6507 (2010) 156-167. http://dx.doi.org/10.1007/978-3-642-17514-5_14 http://www.springerlink.com/content/82g847627857k281/fulltext.pdf Broersma, H. J., Golovach, P. A., Paulusma D. and Song, J. Narrowing down the gap on the complexity of coloring Pk-free graphs. Lect. Notes Comput. Sci. 6410 (2010) 63-74. http://dx.doi.org/10.1007/978-3-642-16926-7_8 http://www.springerlink.com/content/l42245j2j354nl91/fulltext.pdf Broersma, H. J. and Paulusma, D. Computing sharp 2-factors in claw-free graphs. J. Discrete Algorithms 8 (2010) 321- 329. http://dx.doi.org/10.1016/j.jda.2009.07.001 http://dro.dur.ac.uk/7418/1/7418.pdf Broersma, H. J. [see: Bauer, D., Bonsma, P.] Brown P. [see: Bowler, A.] Bruhn, H., Diestel, R., Georgakopoulos, A. and Sprüssel, P. Every rayless graph has an unfriendly partition. Combinatorica 30 (2011) 521-532. http://dx.doi.org/10.1007/s00493-010-2590-3 http://arxiv.org/PS_cache/arxiv/pdf/0901/0901.4858v3.pdf Bruhn, H. [see: Bonato, A.] Brunk, F. T. and Huczynska, S. Some Erdős-Ko-Rado Theorems for Injections. Eur. J. Comb 31 (2010) 839-860 http://dx.doi.org/10.1016/j.ejc.2009.07.013 http://www-circa.mcs.st-and.ac.uk/Preprints/EJCBruHuc.pdf Bryant, D. E. [see: Adams, P.] Bukh, B. Multidimensional Kruskal–Katona theorem. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1009/1009.2375v1.pdf Bukh, B. Radon partitions in convexity spaces. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1009/1009.2384v1.pdf Bukh, B. and Hubard, A. Space crossing numbers. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1102/1102.1275v1.pdf Bukh, B, Matoušek, J. and Nivasch, G. Lower bounds for weak epsilon-nets and stair-convexity. Isr. J. Math. 182 (2011) 199–228. http://arxiv.org/PS_cache/arxiv/pdf/0812/0812.5039v2.pdf Bukh, B. and Tsimerman, J. Sum-product estimates for rational functions. Proc. Lond. Math. Soc., to appear. http://arxiv.org/PS_cache/arxiv/pdf/1002/1002.2554v2.pdf Bulatov, A.. Dyer, M. E., Goldberg, L. A., Jalsenius, M., Jerrum, M. R. and Richerby, D. The complexity of weighted and unweighted #CSP. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1005/1005.2678v1.pdf Burness, T. C., Giudici, M. and Wilson, R. A. Prime order derangements in primitive permutation groups. Preprint. http://school.maths.uwa.edu.au/~giudici/altsporadfpf.pdf Burstein, A., Jelínek. V., Jelinkova E. and Steingrímsson, E. The Möbius function of separable and decomposable permutations. Preprint (2011). http://arxiv.org/PS_cache/arxiv/pdf/1102/1102.1611v1.pdf Butkovi , P. Max-linear Systems: Theory and Algorithms. Springer Monographs in Mathematics (2010). Byrka, J., Gawrychowski, P., Huber, K. T. and Kelk, S. Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks. J. Discrete Algorithms 8 (2010) 65-75. http://arxiv.org/PS_cache/arxiv/pdf/0710/0710.3258v3.pdf Cameron, P. J. The power graph of a finite group, II. J. Group Theory 13 (2010) 779-783. http://dx.doi.org/10.1515/JGT.2010.023 http://www.maths.qmul.ac.uk/~pjc/preprints/powergraph2.pdf Cameron, P. J. Problems from BCC22. Discrete Math., to appear. http://www.maths.qmul.ac.uk/~pjc/preprints/prob22.pdf Cameron, P. J., Krattenhaler C. and Müller, T. W. Decomposable functors and the exponential principle, II. Sémin. Lothar. Comb. 61A (2010) Article B61Am. http://www.maths.qmul.ac.uk/~pjc/preprints/expprinc.pdf Cameron, P. J., Krattenhaler C. and Müller, T. W. A note on higher-dimensional magic matrices. Australas. J. Comb. 50 (2011) 205-215. http://www.maths.qmw.ac.uk/~pjc/preprints/magic.pdf Cameron, P. J. and Preece, D. A. Three-factor decompositions of Un with the three generators in arithmetic progression. Preprint. Cameron, P. J. and Yildiz, V. Counting false entries in truth tables of bracketed formulae connected by implication. Preprint. http://www.maths.qmw.ac.uk/~pjc/preprints/asim2.pdf Cameron, P. J. [see: Bailey, R. F., Bohn, A.] Campbell, C. M., Deveci, O. and Karaduman, E. The periods of k-nacci sequences in centro-polyhedral and related groups. Ars Comb. 97 (2010) 193-210. Campbell, H. E. A., Shank, R. J. and Wehlau, D. E. Vector invariants for the two dimensional modular representation of a cyclic group of prime order. Adv. Math. 225 (2010) 1069-1094. http://dx.doi.org/10.1016/j.aim.2010.03.018 http://arxiv.org/PS_cache/arxiv/pdf/0901/0901.2811v2.pdf Candela, P. On the structure of steps of three-term arithmetic progressions in a dense set of integers. Bull. Lond. Math. Soc. 42 (2010) 1-14. http://dx.doi.org/10.1112/blms/bdp074 Candela, P. and Sisask, O. On the asymptotic maximal density of a set avoiding solutions to linear equations modulo a prime. Preprint. Čangalović, M., Kovačević-Vujčić, V., Kratica, J., V. and Mladenović, N. Metric dimension and related problems. Submitted. Canzar, S., Elbassioni, K., Elmasry, A. and Raman, R. On the approximability of the maximum interval-constrained coloring problem. ISAAC 2010. http://www.mpi-inf.mpg.de/~elbassio/pub/approxintcol.pdf Cardoso, D. M., Korpelainen, N. and Lozin, V. V. On the complexity of the dominating induced matching problem in hereditary classes of graphs. Discrete. Appl. Math.159 (2011) 521-531. http://dx.doi.org/10.1016/j.dam.2010.03.011 Cardoso D.M. and Rowlinson P. Spectral upper bounds for the order of a k-regular induced subgraph. Linear Algebra Appl. 433 (2010) 1031-1057. http://dx.doi.org/10.1016/j.laa.2010.04.029 Carré, I., Krusche, P., Ott, S., Picot, E. and Tiskin, A. Evolutionary Analysis of Regulatory Sequences (EARS) in Plants. The Plant Journal 164 (2010) 165—176. Carvalho, C., Dalmau, V. and Krokhin, A. CSP duality and trees of bounded pathwidth. Theor. Comput. Sci. 411 (2010) 3188-3208. http://dx.doi.org/10.1016/j.tcs.2010.05.016 http://www.dur.ac.uk/andrei.krokhin/papers/treebpw-journal-revised7.pdf Carvalho, C., Dalmau, V. and Krokhin, A. Two new homomorphism dualities and lattice operations. J. Log. Comput. http://dx.doi.org/10.1093/logcom/exq030 http://www.dur.ac.uk/andrei.krokhin/papers/cater-jelly-submit.pdf Cassaigne, J., Richomme, G., Saari, K. and Zamboni, L. Q. Avoiding Abelian powers in binary words with bounded Abelian complexity. Internat. J. Found. Comput. Sci., to appear. http://arxiv.org/PS_cache/arxiv/pdf/1005/1005.2514v1.pdf Casteels, K. [see: Bell, J.] Cereceda, L., van den Heuvel, J. and Johnson, M. Finding Paths Between 3-Colourings. J. Graph Theory 67 (2011) 69-82. http://dx.doi.org/10.1002/jgt.20514 https://www.dur.ac.uk/matthew.johnson2/research/papers/cdam-2007-31.pdf Chalopin, J. and Paulusma, D. Graph labelings derived from models in distributed computing: a complete complexity classification. Networks, to appear. http://dx.doi.org/10.1002/net.20432 http://www.durham.ac.uk/daniel.paulusma/Papers/Submitted/pseudo.pdf Charbit, P., Habib, M., Trotignon, N. and Vušković, K. Detecting 2-joins faster. Submitted to J. Graph Algorithms Appl. http://www.comp.leeds.ac.uk/vuskovi/faster2-join-submitted.pdf Chavez-Lomelí, L., Merino, C., Noble, S. D. and Ramírez-Ibañez, M. Some inequalities for the Tutte polynomial. Eur. J. Comb 32 (2011) 422-433. http://dx.doi.org/10.1016/j.ejc.2010.11.005 http://arxiv.org/PS_cache/arxiv/pdf/1004/1004.2639v1.pdf Chebolu, P., Cryan, M. and Martin, R. Exact counting of Euler tours for generalized series-parallel graphs. J. Discrete Algorithms, to appear. http://arxiv.org/abs/1005.3477 Chebolu, P., Goldberg, L. A. and Martin, R. The Complexity of Approximately Counting Stable Matchings. Lect. Notes Comput. Sci. 6302 (2010) 81-94. http://dx.doi.org/10.1007/978-3-642-15369-3_7 http://arxiv.org/PS_cache/arxiv/pdf/1004/1004.1836v3.pdf Chebolu, P., Goldberg, L. A. and Martin, R. The complexity of approximately counting stable roommate assignments. Submitted http://arxiv.org/PS_cache/arxiv/pdf/1012/1012.1237v1.pdf Chen, B. Chen X. and Hu, X.-D. The price of selfless atomic routing. J. Comb. Optim. 19 (2010) 258-278. http://dx.doi.org/10.1007/s10878-008-9171-z Chen, B. and Xia, D. A comprehensive decision-making model for risk management of supply chains. Expert Systems with Applications 38 (2011) 4957-4966. http://dx.doi.org/10.1016/j.eswa.2010.09.156 Chen, X. [see: Chen, B.] Cheng, W., Jin, X., Lin, Y. and Noble, S.D. On plane graphs with link component number equal to the nullity. Submitted. Choromanski, K. [see: Berger, E.] Christofides, D. A q-analogue of the four functions theorem. Combinatorica, to appear. http://christofides.org/Papers/4FT.pdf Christofides, D., Hladký, J. and Mathé, A. Hamilton cycles in dense vertex-transitive graphs. Submitted. http://arxiv.org/PS_cache/arxiv/pdf/1008/1008.2193v2.pdf Christofides, D., Keevash, P., Kühn D. and Osthus, D. A semi-exact degree condition for Hamilton cycles in digraphs. SIAM J. Discrete Math. 24 (2010), 709-756. http://dx.doi.org/10.1137/090761756 http://christofides.org/Papers/SemiexactDirectedPosa.pdf Chudnovsky, M., Penev, I., Scott, A. D. and Trotignon, N. Substitution and χ-boundedness. Submitted. http://people.maths.ox.ac.uk/scott/Papers/substitution.pdf Chudnovsky, M., Penev, I., Scott, A. D. and Trotignon, N. Excluding Induced Subdivisions of the Bull and Related Graphs. Submitted. http://people.maths.ox.ac.uk/scott/Papers/bullfree.pdf Chudnovsky, M., Scott, A. D. and Seymour, P. D. Disjoint paths in tournaments. Submitted. http://people.maths.ox.ac.uk/scott/Papers/disjointpaths.pdf Chudnovsky, M., [see: Berger, E., Birand, B.] Chung, F. C. K, Claesson, A. Dukes, W. M. B. and Graham, R. L. Descent polynomials for permutations with bounded drop size. Eur. J. Comb. 31 (2010) 1853–1867. http://dx.doi.org/10.1016/j.ejc.2010.01.011 http://arxiv.org/PS_cache/arxiv/pdf/0908/0908.2456v2.pdf (An extended abstract also appeared at FPSAC 2010). Cid, C. [see; Blackburn, S. R.] Claesson, A., Dukes, W. M. B. and Kitaev, S. A direct encoding of Stoimenow's matchings as ascent sequences. Australas. J. Comb. 49 (2011) 47–59. http://arxiv.org/PS_cache/arxiv/pdf/0910/0910.1619v1.pdf Claesson, A., Dukes, W. M. B. and Kubitzke, M. Partition and composition matrices. J. Comb. Theory Ser. A 118 (2011) 1624–1637 http://dx.doi.org/10.1016/j.jcta.2011.02.001 http://arxiv.org/PS_cache/arxiv/pdf/1006/1006.1312v2.pdf Claesson, A., Dukes, W. M. B. and Steingrimsson, E. Permutations sortable by passes through a stack. Ann. Comb. 14 (2010) 45–51 http://dx.doi.org/10.1007/s00026-010-0044-7 http://arxiv.org/PS_cache/arxiv/pdf/0812/0812.0143v2.pdf Claesson, A., Jelínek, V., Jelinkova, A. and Kitaev, S. Pattern avoidance in partial permutations. Electron. J. Comb. 18 (2011) P25 http://www.combinatorics.org/Volume_18/PDF/v18i1p25.pdf Claesson, A., Kitaev, S., Ragnarsson, K, and Tenner, B. E. Boolean complexes for Ferrers graphs. Australas. J. Comb. 48 (2010) 159–173. http://arxiv.org/PS_cache/arxiv/pdf/0808/0808.2307v3.pdf Claesson, A. and Linusson, S. n! matchings, n!posets. Proc. Am. Math. Soc. 139 (2011) 435–449. http://dx.doi.org/10.1090/S0002-9939-2010-10678-0 http://arxiv.org/PS_cache/arxiv/pdf/1003/1003.4728v2.pdf Claesson, A. [see: Albert, M. H., Bousquet-Mélou, M., Brändén, P., Chung, F. R. K.] Clifford, R. and Popa, A. Maximum subset intersection. Inf. Process Lett. 111 (2011) 323-325. http://dx.doi.org/10.1016/j.ipl.2010.12.003 http://www.cs.bris.ac.uk/~popa/ipl.pdf Clifford, R. [see: Arthur, D.] Coenen, F., Jiang, C. and Zito, M. Finding Frequent Subgraphs in Longitudinal Social Network Data Using a Weighted Graph Mining Approach. Lect. Notes Comput. Sci. 6440 (2010) 405-416. http://dx.doi.org/10.1007/978-3-642-17316-5_39 http://www.springerlink.com/content/q3j02273w66x81mu/fulltext.pdf Coenen, F., Jiang, C. and Zito, M. Frequent Sub-graph Mining on Edge Weighted Graphs. Proceedings of DaWaK 10, 77-88. Springer, Berlin 2010. ISBN 3-642-15104-3 978. Cohen, G. [see; Brightwell, G. R.] Cohen, N. Jordan, J. and Voliotis, N. Preferential duplication graphs. J. Appl. Probab. 47 (2010) 572-585. http://dx.doi.org/10.1239/jap/1276784910 http://amorph.group.shef.ac.uk/files/prefdup2.pdf Cohen, N., Fomin, F. V., Gutin, G., Kim, E. J., Saurabh, S. and Yeo, A. Algorithm for Finding k-Vertex Out-trees and its Application to k-Internal Out- branching Problem. J. Comput. Syst. Sci. 76 (2010) 650-662. http://dx.doi.org/10.1016/j.jcss.2010.01.001 http://www.lirmm.fr/~kim/journals/ktree2010.pdf Coja-Oghlan, A. On belief propagation guided decimation for random k-SAT. Proc. 22nd SODA (2011) 957-966. http://arxiv.org/PS_cache/arxiv/pdf/1007/1007.1328v1.pdf Coja-Oghlan, A. A better algorithm for random k-SAT. SIAM J. Comput. 39 (2010) 2823-2864. (An earlier version appeared in Lect. Notes Comput. Sci. 5555 (2009) 292-303). http://dx.doi.org/10.1137/09076516X http://arxiv.org/PS_cache/arxiv/pdf/0902/0902.3583v1.pdf Coja-Oghlan, A., Cooper, C. and Frieze, A. M. An efficient sparse regularity concept. SIAM J. Discrete Math. 23 (2010) 2000-2034 http://dx.doi.org/10.1137/080730160 http://www.math.cmu.edu/~af1p/Texfiles/sparsereg.pdf Coja-Oghlan, A. and Efthymiou, C. On independent sets in random graphs. Proc. 22nd SODA (2011) 136-144. http://arxiv.org/PS_cache/arxiv/pdf/1007/1007.1378v2.pdf Coja-Oghlan, A., Krivelevich, M. and Vilenchik, D. Why Almost All k-Colorable Graphs Are Easy to Color. Theory Comput. Syst. 46 (2010) 523-565. http://dx.doi.org/10.1007/s00224-009-9231-5 Coja-Oghlan, A., Onsjö, M. and Watanabe, O. Propagation connectivity of random hypergraphs. Proceedings of 14th RANDOM. http://www.crm.es/Publications/10/Pr948.pdf Coja-Oghlan, A. and Pachon-Pinzon, A. Y. The decimation process in random k-SAT. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1102/1102.3145v1.pdf Coja-Oghlan, A. [see: Achlioptas, D.] Coker, T. and Johannson, K. The adjacent vertex distinguishing total chromatic number. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1009/1009.1785v2.pdf Colbourn, C. J., Forbes, A. D., Grannell, M. J., Griggs, T. S., Kaski, P., Östergård, P. R. J., Pike, D. A. and Pottonen, O. Properties of the Steiner Triple Systems of Order 19. Electron. J. Comb. 17 (2010) R98. http://www.combinatorics.org/Volume_17/PDF/v17i1r98.pdf Conder, M. E., Potočnik, P. and Širáň, J. Regular maps with almost Sylow-cyclic automorphism groups, and classification of regular maps with Euler characteristic -p2. J. Algebra 324 (2010) 2620-2635. http://dx.doi.org/10.1016/j.jalgebra.2010.07.047 http://www.math.auckland.ac.nz/~conder/preprints/regularmaps-asc.pdf Conlon, D. The Ramsey numbers of dense graphs. Bull. Lond. Math. Soc., to appear. http://www.dpmms.cam.ac.uk/~dc340/DenseRamsey.pdf Conlon, D. An extremal problem in the hypercube. Electron. J. Comb. 17 (2010) R111. http://www.combinatorics.org/Volume_17/PDF/v17i1r111.pdf Conlon, D., Fox. J. and Sudakov, B. Large almost monochromatic sets in hypergraphs. Israel. J. Math. 181 (2011) 423-432.http://www.dpmms.cam.ac.uk/~dc340/hypergraph-discrepancy.pdf Conlon, D., Fox, J. and Sudakov, B. An improved bound for the stepping-up lemma. Discrete Appl. Math., to appear. http://www.dpmms.cam.ac.uk/~dc340/stepping-up-lemma.pdf Conlon, D., Fox, J. and Sudakov, B. An approximate version of Sidorenko’s conjecture. Geom. Funct. Anal. 20 (2010), 1354-1366. http://dx.doi.org/10.1007/s00039-010-0097-0 http://arxiv.org/PS_cache/arxiv/pdf/1004/1004.4236v1.pdf Conlon, D. and Gowers, W. T. Combinatorial theorems in sparse random sets. Preprint. http://www.dpmms.cam.ac.uk/~dc340/SparseRandom.pdf Conlon, D., Hàn, H., Person, Y. and Schacht, M. Weak quasi-randomness for uniform hypergraphs. Random Struct. Algorithms, to appear. http://www.dpmms.cam.ac.uk/~dc340/wqr.pdf Consoli, S., Darby-Dowman, K., Geleijnse, G., Korst, J. and Pauws, S. Heuristic Approaches for the Quartet Method of Hierarchical Clustering IEEE Transactions on Knowledge and Data Engineering 22 (2010) 1428-1443. http://doi.ieeecomputersociety.org/10.1109/TKDE.2009.188 http://bura.brunel.ac.uk/handle/2438/2806 Consoli, S., Darby-Dowman, K., Mladenović, N. and Moreno, J. Discrete Particle Swarm Optimization for the Minimum Labelling Steiner Tree Problem Natural Computing 9 (2010) 29-46. http://dx.doi.org/10.1007/s11047-009-9137-9 http://bura.brunel.ac.uk/handle/2438/2087 Coolen, A. C. C. [see: Annibale, A.] Cooper, C., Dyer, M. E. and Mohanaraj, V. On the Imitation Strategy for Games on Graphs. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1102/1102.3879v1.pdf Cooper, C. and Frieze, A. M. Stationary distribution and cover time of random walks on random digraphs. Preprint. http://de.arxiv.org/PS_cache/arxiv/pdf/1103/1103.4317v1.pdf Cooper, C. and Frieze, A. M. Component structure of the vacant set induced by a random walk on a random graph. Preprint. http://de.arxiv.org/PS_cache/arxiv/pdf/1005/1005.1564v2.pdf Cooper, C. and Frieze, A. M. Random Walks with Look-Ahead in Scale-Free Random Graphs. SIAM J. Discrete Math. 24 (2010) 1162-1176. http://dx.doi.org/10.1137/090762178 http://www.math.cmu.edu/~af1p/Texfiles/Lookahead-web.pdf Cooper, C. and Frieze, A. M. Component structure induced by a random walk on a random graph. To appear in SODA 2011. http://www.dcs.kcl.ac.uk/staff/ccooper/papers/fractal.pdf Cooper, C., Frieze, A. M. and Krivelevich, M. Hamilton Cycles in Random Graphs with a Fixed Degree Sequence. SIAM J. Discrete Math. 24 (2010) 558-569. http://dx.doi.org/10.1137/080741379 http://www.math.cmu.edu/~af1p/Texfiles/HamGnd.pdf Cooper, C., Frieze, A. M. and Radzik, T. The cover time of random walks on hypergraphs. Submitted. http://www.math.cmu.edu/~af1p/Texfiles/eavesdrop.pdf Cooper, C., Frieze, A. M. and Radzik, T. Multiple random walks in random regular graphs. SIAM J. Discrete. Math. 23 (2010) 1738-1761. http://dx.doi.org/10.1137/080729542 http://www.math.cmu.edu/~af1p/Texfiles/Multiple.pdf Cooper, C. and Uehara, R. Scale-free properties of random k-trees. Math. Comput. Sci. 3 (2010) 489-496. http://dx.doi.org/10.1007/s11786-010-0041-6 http://www.dcs.kcl.ac.uk/staff/ccooper/papers/k-tree-scalefree.pdf Cooper, C. [see: Abdullah, M., Batu, T., Berenbrink, P., Coja-Oghlan, A. ] Cordero, M. and Jha, V. Primitive semifields and fractional planes of order q5 Rend. Mat. Appl., VII. Ser. 30 (2010) 1-21. http://www.mat.uniroma1.it/ricerca/rendiconti/2010(1)/1-21.pdf Cossidente, A., and King, O. H. Some Two-Character Sets. Des. Codes. Cryptography 56 (2010) 105-113. http://dx.doi.org/10.1007/s10623-010-9394-8 http://www.staff.ncl.ac.uk/o.h.king/CossidenteKingDCC10.pdf Cossidente, A., and King, O. H. Blocking sets of H(n,q2) with respect to generators. J. Comb. Theory Ser. A 118 (2011) 1212–1217. http://dx.doi.org/10.1016/j.jcta.2010.12.008 Cossidente, A., and King, O. H. On a family of minimal blocking sets of the Hermitian surface. J. Comb. Des , in press. http://www.staff.ncl.ac.uk/o.h.king/CossidenteKingJCD10.pdf Courtiel, J. and Vaughan, E. R. Gerecthe designs with rectangular regions. Preprint. http://de.arxiv.org/PS_cache/arxiv/pdf/1104/1104.0637v1.pdf Couturier, J.-F., Golovach, P. A. and Kratsch, D. Colorings with few colors: counting, enumeration and combinatorial bounds. Lect. Notes Comput. Sci. 6410 (2010) 39-50. http://dx.doi.org/10.1007/978-3-642-16926-7_6 http://lita.sciences.univ-metz.fr/~kratsch/publications/wg2010.pdf Craciun, G. [see: Banaji, M.] Crane, E., Georgiou N., Volkov, S., Wade, A. R. and Waters, R. J. The simple harmonic urn. Ann. Probab., to appear. http://arxiv.org/PS_cache/arxiv/pdf/0911/0911.0321v2.pdf Creed, P. and Cryan, M. E. The number of Euler tours of a random d-in/d-out graph. Discrete Math. Theor. Comput. Sci. (Analysis of Algorithms, Vienna, 2010). http://www.dmtcs.org/dmtcs- ojs/index.php/proceedings/article/viewArticle/dmAM0109 Crévits, I., Hanafi, S., Lazić, J., Mladenović, N. and Wilbaut, C. New hybrid metheuristics for solving the multidimensional knapsack problem. Lect. Notes Comput. Sci. 6373 (2010) 118-132. http://dx.doi.org/10.1007/978-3-642-16054-7_9 http://www.springerlink.com/content/lq667831t8w305n7/fulltext.pdf Crofts, J. J., Estrada, E., Higham, D. J. and Taylor, A. Mapping directed networks. Electronic Transactions on Numerical Analysis 37 (2010) 337-350. http://etna.mcs.kent.edu/vol.37.2010/pp337-350.dir/pp337-350.ps Croote, E., Laba, I. and Sisask, O. Arithmetic progressions in sumsets and Lp -almost-periodicity. Preprint. http://de.arxiv.org/PS_cache/arxiv/pdf/1103/1103.6000v1.pdf Croote, E. and Sisask, O. A probabilistic technique for finding almost-periods of convolutions. Geom. Funct. Anal. 20 (2010) 1367-1396. http://dx.doi.org/10.1007/s00039-010-0101-8 http://arxiv.org/PS_cache/arxiv/pdf/1003/1003.2978v1.pdf Cropper, M., Hilton, A. J. W., Johnson, P. D. and Lehel, J. List multicoloring problems involving the k-fold Hall numbers. J. Graph Theory 65 (2010) 16-34. http://dx.doi.org/10.1002/jgt.20462 http://onlinelibrary.wiley.com/doi/10.1002/jgt.20462/pdf Crowston, R., Gutin, G., Jones, M. and Yeo, A. A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and its Algorithmic Applications. Submitted. http://arxiv.org/PS_cache/arxiv/pdf/1004/1004.0526v4.pdf Crowston, R., Gutin, G., Jones, M. and Yeo, A. Lower Bound for Max-r-Lin2 and its Applications in Algorithmics and Graph Theory. Submitted. http://arxiv.org/PS_cache/arxiv/pdf/1104/1104.1135v1.pdf Crowston, R., Gutin, G., Jones, M., Kim, E. J. and Ruzsa, I. Z. Systems of Linear Equations over F2 and Problems Parameterized Above Average. In 12th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2010). Lect. Notes Comput. Sci. 6139 (2010) 164—175 http://dx.doi.org/10.1007/978-3-642-13731-0_17 http://arxiv.org/PS_cache/arxiv/pdf/1002/1002.0286v2.pdf Cryan, M., Dyer, M. E. and Randall, D. Approximately Counting Integral Flows and Cell-Bounded Contingency Tables. SIAM J. Comput. 30 (2010) 2683-2703. http://dx.doi.org/10.1137/060650544 http://www.comp.leeds.ac.uk/dyer/papers/cdr10.pdf Cryan, M. [see: Chebolu, P., Creed, P.] Czumaj, A. Local Graph Exploration and Fast Property Testing. Lect. Notes Comput. Sci. 6346 (2010) 410-414. (Invited survey paper at ESA 2010). http://dx.doi.org/10.1007/978-3-642-15775-2_35 http://www.springerlink.com/content/9rw586wx50656412/fulltext.pdf Czumaj, A., Goldreich, O., Ron, D., Seshadhri, C., Shapira, A. and Sohler, C. Finding trees and cycles in sublinear time. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1007/1007.4230v2.pdf Czumaj, A., Krysta, P. and Vöcking, B. Selfish Traffic Allocation for Server Farms. Siam J. Comput. 39 (2010) 1957-1987. http://dx.doi.org/10.1137/070693862 http://wrap.warwick.ac.uk/3319/1/WRAP_Cjumaz_Selfish_traffic.pdf Czumaj, A. and Sohler, C. Sublinear-time algorithms. Lect. Notes Comput. Sci. 6390 (2011) 41-64. http://dx.doi.org/10.1007/978-3-642-16367-8_5 http://www.springerlink.com/content/g21h6140l0154h7k/fulltext.pdf Czumaj, A. and Sohler, C. Testing Expansion in Bounded-Degree Graphs. Comb. Probab. Comput. 19 (2010) 693-709. http://dx.doi.org/10.1017/S096354831000012X Czumaj, A. [see: Adamaszek, A.] Czyzowicz, J., Dobrev, S., Gąsieniec, L., Ilcinkas, D., Jansson, J. Klasing, R. Lignos, I, Martin, R., Sadakane, K. and Sung, W.-K. More efficient periodic traversal in anonymous undirected graphs. SIROCCO '09. Lect. Notes Comput. Sci. 5869 (2010) 167-181. http://dx.doi.org/10.1007/978-3-642-11476-2_14 http://arxiv.org/PS_cache/arxiv/pdf/0905/0905.1737v1.pdf Czyzowicz, J. [see: Berenbrink, P.] Dąbrowski, K., Lozin, V. V., Müller, H. and Rautenbach, D. Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes. In: IWOCA 2010, 1-9. Lect. Notes Comput. Sci. 6460 (2011) 1-9. http://dx.doi.org/10.1007/978-3-642-19222-7_1 http://www.warwick.ac.uk/~mariaq/fpt-iwoca-final.pdf Dąbrowski, K., Lozin, V. V., Raman, R. and Ries, B. Colouring vertices of triangle-free graphs. Lect. Notes Comput. Sci. 6410 (2010) 184- 195. http://dx.doi.org/10.1007/978-3-642-16926-7_18 http://www.warwick.ac.uk/~mariaq/Triangle-free.pdf Dalla Volta, F. and Siemons, I. J. On Orbit Equivalence and Permutation groups defined by unordered relations. Preprint http://arxiv.org/PS_cache/arxiv/pdf/1010/1010.3536v1.pdf Dalmau, V. [see: Bodirsky, M. Carvalho, C.] Dantchev, S., Friedetzky, T. and Nagel, L. Sublinear-time algorithms for tournament graphs. J. Comb. Optim. (2010) http://dx.doi.org/10.1007/s10878-010-9325-7 (An earlier version appeared in Lect. Notes Comput. Sci. 5609 (2009) 459-471). Dantchev, S. and Martin, B. Rank-complexity gap for Lovász-Schrijver and Sherali-Adams proof systems. Computational Complexity, to appear. http://www.dur.ac.uk/barnaby.martin/downloads/webSTOCtoCC2011.pdf Dantchev, S. [see: Broersma, H. J.] Danziger, P., Wanless, I. M. and Webb, B. S. Monogamous latin squares. J. Comb. Theory Ser. A 118 (2011) 796–807. http://dx.doi.org/10.1016/j.jcta.2010.11.011 Darby-Dowman, K. [see: Consoli, S.] Darji, U. and Mitchell, J. D. Approximation of automorphisms of the rationals and the random graph. J. Group Theory 14 (2011) 251-259. http://dx.doi.org/10.1015/JGT.2010.057 Davies, R. P., Perkins, S. and Roach, P. The use of problem domain information in the automated solution of Kakuro puzzles. International Journal of Computer Science 37 (2010) 118-127 http://www.iaeng.org/IJCS/issues_v37/issue_2/index.html Deineko, V. G., Shabtay, D. and Steiner, G. On the asymptotic behavior of subtour-patching heuristics in solving the TSP on permuted Monge matrices. Journal of Heuristics 17 (2011) 61-96. http://dx.doi.org/10.1007/s10732-010-9127-1 Deineko, V. G. and Tiskin, A. Fast minimum-weight double-tree shortcutting for Metric TSP: Is the best one good enough? ACM Journal on Experimental Algorithmics, to appear. Deineko, V. G. and Woeginger, G. J. Pinpointing the complexity of the interval min-max regret knapsack problem. Discrete Optim. 7 (2010) 191-196. http://dx.doi.org/10.1016/j.disopt.2010.03.008 DeLaViña, E., Goddard, W., Henning, M. A., Pepper, R. and Vaughan, E. R. Bounds on the k-domination number of a graph. Appl. Math. Lett. 24 (2011) 996-998. http://dx.doi.org/10.1016/j.aml.2011.01.013 http://www.cs.clemson.edu/~goddard/papers/graphs/kDomination.pdf Dereich, S., Mönch, C. and Mörters, P. Typical Distances in Ultrasmall Random Networks. Submitted. http://people.bath.ac.uk/maspm/loglog.pdf Dereich, S. and Mörters, P. Random networks with concave preferential attachment rule. Jahresberichte der Deutschen Mathematiker Vereinigung 113 (2011) 21–40. http://people.bath.ac.uk/maspm/jberdmv.pdf Dereich, S. and Mörters, P. Random networks with sublinear preferential attachment: the giant component. Submitted. http://people.bath.ac.uk/maspm/clusters.pdf Descalco, L. and Higgins, P. M. Generalised Green’s Equivalences on the subsemigroups of the bicyclic monoid. Commun. Alg. 38 (2010) 4597-4612. http://dx.doi.org/10.1080/00927870903432918 http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.95.7019&rep=rep1&type=p df Deveci, O. [see: Campbell, C. M.] Diestel, R. and Sprüssel, P. Locally finite graphs with ends: A topological approach. III. Fundamental group and homology. Discrete Math. 311 (2011) http://dx.doi.org/10.1016/j.disc.2011.02.007 http://arxiv.org/PS_cache/arxiv/pdf/1004/1004.0110v2.pdf Diestel, R. and Sprüssel, P. The fundamental group of a locally finite graph with ends. Adv. Math. 226 (2011) 2643-2675. http://dx.doi.org/10.1016/j.aim.2010.09.008 http://arxiv.org/PS_cache/arxiv/pdf/0910/0910.5647v1.pdf Diestel, R. and Sprüssel, P. The homology of a locally finite graph with ends. Combinatorica 30 (2010) 687-714. http://www.math.uni-hamburg.de/home/diestel/papers/Homology.pdf Diestel, R. [see: Bonato, A., Bruhn, H.] Dobrev, S. [see: Czyzowicz, J.] Doerr, B., Huber, A. and Levavi, A. Strong Robustness of Randomized Rumor Spreading Protocols. Submitted. (An earlier version appeared in Lect. Notes Comput. Sci. 5878 (2009) 812-821). Doku-Amponsah, K. and Mörters, P. Large Deviation Principles for Empirical Measures of Coloured Random Graphs. Ann. Appl. Probab. 20 (2010) 1989-2011. http://dx.doi.org/10.1214/09-AAP647 http://people.bath.ac.uk/maspm/LDM.pdf Dominiczak, A. F., Fairley, S., Hanlon, N., Hunt, E., Irving, R. W., McBride, M. W. and McClure, J. D. Mapping Affymetrix microarray probes to the rat genome via a persistent index. International Journal of Knowledge Discovery in Bioinformatics 1 (2010) 48-65, http://www.igi-global.com/bookstore/article.aspx?TitleId=40971 Dong, F. M. and Jackson, B. A zero-free interval for chromatic polynomials of nearly 3-connected plane graphs. SIAM J. Discrete Math., to appear. http://www.maths.qmul.ac.uk/~bill/nearly3conSUBMITTED.pdf Donovan, D. M. and Grannell, M. J. Designs having the parameters of projective and affine spaces. Des. Codes. Cryptography, to appear. http://mcs.open.ac.uk/mjg47/papers/projandaffgrowthv2.pdf Donovan, D. M. and Grannell, M. J. On the number of designs with affine parameters. Submitted. Donovan, D. M., Grannell, M. J. and Griggs, T. S. Third-regular biembeddings of Latin squares. Glasg. Math. J. 52 (2010) 497-503. http://dx.doi.org/10.1017/S0017089510000376 http://mcs.open.ac.uk/mjg47/papers/thirdregular.pdf Donovan, D. M., Grannell, M. J., Griggs, T. S. and Lefevre, J. G. On parity vectors of Latin squares. Graphs. Comb. 26 (2010) 673-684. http://dx.doi.org/10.1007/s00373-010-0942-9 http://mcs.open.ac.uk/mjg47/papers/parity3.pdf Donovan, D. M., Grannell, M. J., Griggs, T. S., Lefevre, J. G. and McCourt, T. A. Self-embeddings of cyclic and projective Steiner quasigroups. J. Comb. Des. 19 (2011) 16-27 http://dx.doi.org/10.1002/jcd.20258 http://mcs.open.ac.uk/mjg47/papers/cyclicsquags.pdf Doukas, J., Owczarek, A. L. and Prellberg, T. Identification of a polymer growth process with an equilibrium multicritical collapse phase transition: The meeting point of swollen, collapsed, and crystalline polymers. Phys. Rev.E 82 (2010) 031103. http://www.maths.qmul.ac.uk/~tp/papers/pub078.pdf Draisma, J. and Shaw, R. Singular lines of trilinear forms. Linear Algebra Appl. 433 (2010) 690-697. http://dx.doi.org/10.1016/j.laa.2010.03.040 http://arxiv.org/PS_cache/arxiv/pdf/0909/0909.5676v1.pdf Draisma, J. and Shaw, R. Some noteworthy alternating trilinear forms. Submitted. http://arxiv.org/PS_cache/arxiv/pdf/1102/1102.4768v1.pdf Drapál, A. and Griggs, T. S. Homogeneous toroidal Latin bitrades. Ars Comb. 96 (2010) 343-351. Drapál, A., Griggs, T.S. and Kozlik, A. Latin directed triple systems, Discrete Math., to appear. Dress, A., Huber, K. T., Koolen, J. and Moulton, V. Blocks and cut vertices of the Buneman Graph. Submitted. http://arxiv.org/PS_cache/arxiv/pdf/1101/1101.4927v1.pdf Dress, A., Huber, K. T., Koolen, J., Moulton, V. and Spillner, A. An algorithm for computing cutpoints in finite metric spaces. Journal of Classification 27 (2010) 158-172. http://dx.doi.org/10.1007/s00357-010-9055-7 http://arxiv.org/PS_cache/arxiv/pdf/0910/0910.2317v1.pdf Dress, A., Huber, K. T. and Steel, M. 'Lassoing' a phylogentic tree I: Basic properties, shellings and covers. Submitted. Dress, A., Kahrstrom, J., and Moulton, V. A 'non-additive' characterization of p-adic norms. Ann. Comb., to appear. http://dx.doi.org/10.1007/s00026-011-0081-x Dress, A. and Müller, T. W. A characterization of congruence geometries associated with valuated matroids. Adv. Math., to appear. Dress, A., Moulton, V., Steel, M. and Wu, T. Species, Clusters and the 'Tree of Life': A graph-theoretic perspective. Journal of Theoretical Biology 265 (2010) 535-542. http://www.math.canterbury.ac.nz/~m.steel/Non_UC/files/research/species_jtb.pdf Drizen, A. L. Generating Uniformly Distributed Random 2-designs with Block Size 3. Submitted. Drizen, A. L., Grannell, M. J. and Griggs, T. S. Pasch trades with a negative block. Submitted. Droste, M. and Truss, J. K. Uncountable cofinalities of automorphism groups of linear and partial orders. Algebra Univers. 62 (2010) 75-90. http://dx.doi.org/10.1007/s00012-010-0040-0 http://www.amsta.leeds.ac.uk/pure/staff/truss/manfred.pdf Droste, M. and Truss, J. K. The uncountable cofinality of the automorphism group of the countable universal distributive lattice. Demonstratio Mathematica, to appear. http://www.maths.leeds.ac.uk/Pure/staff/truss/manfred1.pdf Duan, R., Severini, S. and Winter, A. Zero-error communication via quantum channels, non-commutative graphs and a quantum Lovasz theta function. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1002/1002.2514v2.pdf Duchamp, G.H.E., Goodenough, S., Minh, H.N. and Solomon, A.I. An interface between physics and number theory, in Proceedings of the 28th Colloquium on Group Theoretical Methods in Physics (University of Northumbria, Newcastle, UK, 2010), to appear http://arxiv.org/PS_cache/arxiv/pdf/1011/1011.0523v2.pdf Duchamp, G.H.E. [see: Blasiak, P.] Dukes, W. M. B., Jelínek, V. and Kubitzke, M. Composition matrices, (2+2)-free posets and their specializations. Electron. J. Comb. 18 (2011) P44. http://www.combinatorics.org/Volume_18/PDF/v18i1p44.pdf Dukes, W. M. B., Kitaev, S., Remmel, J. and Steingrímsson, E. Enumerating (2+2)-free posets by indistinguishable elements. Preprint (2010) http://arxiv.org/PS_cache/arxiv/pdf/1006/1006.2696v1.pdf Dukes, W. M. B. and Parviainen, R. Ascent sequences and upper triangular matrices containing non-negative integers Electron. J. Comb. 17 (2010) R53. http://www.combinatorics.org/Volume_17/PDF/v17i1r53.pdf Dukes, W. M. B. and Reifegerste, A. The area above the Dyck path of a permutation. Adv. Appl. Math. 45 (2010) 15–23 http://dx.doi.org/10.1016/j.aam.2009.11.008 http://arxiv.org/PS_cache/arxiv/pdf/0810/0810.2457v3.pdf Dukes, W. M. B. [see: Albert, M. H., Bousquet-Mélou, M, Chung, F. R. K., Claesson, A.] Duminil-Copin, H. [see: Balogh, J. ] Duncan, A. J., Kazachkov, I. V., and Remeslennikov, V. N. Automorphisms of Partially Commutative Groups I: Linear Subgroups. Groups Geom. Dyn. 4 (2010) 739-757. http://dx.doi.org/10.1471/GGD/103. http://arxiv.org/PS_cache/arxiv/pdf/0803/0803.2213v1.pdf Dyer, M. E. and Frieze, A. M. Randomly colouring random graphs. Random Structures and Algorithms 36 (2010) 251-272. http://dx.doi.org/10.1002/rsa.v36:3 http://www.comp.leeds.ac.uk/dyer/papers/df10.pdf Dyer, M. E., Goldberg, L. A, Jalsenius, M. and Richerby, D. The Complexity of Approximating Bounded-Degree Boolean #CSP. In Proceedings of STACS 2010. http://arxiv.org/PS_cache/arxiv/pdf/0907/0907.2663v1.pdf Dyer, M. E. and Richerby, D. The complexity of #CSP. In: STOC’10. http://dx.doi.org/10.1145/1806689.1806789 http://arxiv.org/PS_cache/arxiv/pdf/1003/1003.3879v1.pdf Dyer, M. E. and Mohanaraj, V. The Iterated Prisoner's Dilemma on a Cycle. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1102/1102.3822v1.pdf Dyer, M. E. and Mohanaraj, V. Pairwise-interaction Games. Submitted. Dyer, M. E. [see: Bulatov, A., Cooper, C., Cryan, M.] Džamonja, M. Ramsey Methods and the problem DU. CRM Barcelona Publications, to appear. http://www.uea.ac.uk//~h020/RamseyDU.pdf Edwards, K. J. Achromatic number of fragmentable graphs. J. Graph Theory 65 (2010) 94-114. http://dx.doi.org/10.1002/jgt.v65:2 http://onlinelibrary.wiley.com/doi/10.1002/jgt.20468/pdf Edwards, K. J., Jia, W., McKenna, S. J.. and Ward, A. A. Classifying Textile Designs using Region Graphs. In BMVC 2010 1-10. http://dx.doi.org/10.5244/C.24.93 http://www.bmva.org/bmvc/2010/conference/paper93/paper93.pdf Efthymiou, C. and Spirakis, P. Sharp thresholds for Hamiltonicity in random intersection graphs. Theor. Comput. Sci. 411 (2010) 3714-3730. http://dx.doi.org/10.1016/j.tcs.2010.06.022 Efthymiou, C. [see: Coja-Oghlan, A.] Eggemann, N., Havet, F. and Noble, S. D. k-L(2,1)-Labelling for Planar Graphs is NP-Complete for k≥4 Discrete Appl. Math., 158 (2010) 1777-1788. http://dx.doi.org/10.1016/j.dam.2010.06.016 http://arxiv.org/PS_cache/arxiv/pdf/0909/0909.2613v1.pdf http://bura.brunel.ac.uk/handle/2438/3832 Eggemann, N. and Noble, S. D. The clustering coefficient of a scale-free random graph. Discrete Appl. Math., to appear. http://arxiv.org/PS_cache/arxiv/pdf/0804/0804.3032v1.pdf Egri, L., Krokhin, A., Larose, B. and Tesson, P. The complexity of the list homomorphism problem for graphs. Theory Comput. Syst., to appear. http://www.dur.ac.uk/andrei.krokhin/papers/listhom_long_submitted.pdf Ekim, T., Ries B. and de Werra, D. Split-critical and uniquely split-colorable graphs. Discrete Math. Theor. Comput. Sci. 12 (2010) 1-24. http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/1479/3367 Elbassioni, K. [see: Canzar, S.] Elkind, E. [see : Aziz, H.] Ellis, D. Irredundant families of subcubes. Math. Proc. Camb. Philos. Soc. 150 (2011) 257- 272. http://dx.doi.org/10.1017/S0305004110000678 http://uk.arxiv.org/PS_cache/arxiv/pdf/1003/1003.2960v1.pdf Ellis, D. Stability for t-intersecting families of permutations. J. Comb. Theory Ser. A 118 (2011) 208-227. http://dx.doi.org/10.1016/j.jcta.2010.04.005 http://www.dpmms.cam.ac.uk/~dce27/stabilitytintersectingperms2.pdf Ellis, D. Almost isoperimetric subsets of the discrete cube. Comb. Probab. Comput. 20 (2011) 363-380. http://dx.doi.org/10.1017/S0963548311000083 http://www.dpmms.cam.ac.uk/~dce27/almostisofinalversion7.pdf Ellis, D., Filmus, Y. and Friedgut, E. Triangle-intersecting families of graphs. Preprint. http://www.dpmms.cam.ac.uk/~dce27/K3intersectingFinal2.pdf Ellis, D., Friedgut, E. and Pilpel, H. Intersecting Families of Permutations. J. Am. Math. Soc., to appear. http://www.dpmms.cam.ac.uk/~dce27/tintersectingfinalweb1.pdf Ellis, D. and Sudakov, B. Generating all subsets of a finite set with unions. Preprint. http://www.dpmms.cam.ac.uk/~dce27/disjointunionsfinal2web.pdf Elmasry, A. [see: Canzar, S.] Elsässer, R. [see: Berenbrink, P.] Englert, M., Gupta, A., Krauthgamer, R., Räcke, H., Talgam-Cohen, I. and Talwar, K. Vertex Sparsifiers: New Results from Old Techniques. In Proceedings of the 13th APPROX (2010). http://arxiv.org/PS_cache/arxiv/pdf/1006/1006.4586v1.pdf Englert, M. [see: Adamaszek, A.] Ercolani, N. and Ueltschi, D. Cycle structure of random permutations with cycle weights. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1102/1102.4796v1.pdf Erlebach, T. and Grant, T. Scheduling Multicast Transmissions under SINR Constraints. Lect. Notes Comput. Sci. 6451 (2010) 47-61. http://dx.doi.org/10.1007/978-3-642-16988-5_5 http://www.springerlink.com/content/2637572005w87050/fulltext.pdf Erlebach, T. and van Leeuwen, E. J. PTAS for Weighted Set Cover on Unit Squares. In APPROX 2010. Lect. Notes Comput. Sci.6302 (2010) 166-177. http://dx.doi.org/10.1007/978-3-642-15369-3_13 http://www.springerlink.com/content/n676475218178536/fulltext.pdf Erlebach, T. and Lübbecke, M. (Eds.) Proceedings of the 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2010). http://drops.dagstuhl.de/portals/oasics/index.php?semnr=10005 Erlebach, T. and Shahnaz, A. Approximating fault-tolerant Steiner subgraphs in heterogeneous wireless networks. In IWCMC’10. http://dx.doi.org/10.1145/1815396.1815519 Erlebach, T. [see: Baier, G.,] Esperet, L., van den Heuvel, J., Maffray, F. and Sipma, F. Fire containment in planar graphs. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1102/1102.3016v1.pdf Essam, J. W. [see: Arrowsmith, D. K.] Estrada, E., Grindrod, P., Higham, D. J. and Parsons, M. C. Communicability Across Evolving Networks. Phys. Rev. E, to appear. http://www.mathstat.strath.ac.uk/downloads/publications/32dyntechrep.pdf Estrada, E. and Higham, D. J. Network properties revealed through matrix functions. SIAM Review 52 (2010) 696-714. http://dx.doi.org/10.1137/090761070 http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.139.9504&rep=rep1&type= pdf Estrada, E. [see: Crofts, J. J.] Etzion,T. [see: Blackburn, S. R.] Evans, D. M. [see: Amato, D.] Everitt, B. and Fountain, J. B. Partial symmetry, reflection monoids and Coxeter groups. Adv. Math. 223 (2010) 1782-1814. http://dx.doi.org/10.1016/j.aim.2009.10.008 http://arxiv.org/PS_cache/arxiv/pdf/0812/0812.2789v2.pdf Everitt, B. and Fountain, J. B. Partial mirror symmetry, lattice presentations and algebraic monoids. Preprint. http://de.arxiv.org/PS_cache/arxiv/pdf/1104/1104.0090v1.pdf Fachini, E. [see; Brightwell, G. R.] Fairley, S. [see: Dominiczak, A. F.] Fairthorne, M. [see; Brightwell, G. R.] Falgas-Ravry, V. Minimal weight in union-closed families. Electron. J. Comb. 18 (2011) P95. http://www.combinatorics.org/Volume_18/PDF/v18i1p95.pdf Falgas-Ravry, V. and Walters, M. J. Sharpness in the k-nearest neighbours random geometric graph model. Submitted. http://arxiv.org/PS_cache/arxiv/pdf/1101/1101.3083v1.pdf Fay, D., Haddadi, H., Jamakovic. A., Moore, A. W., Mortier, R., Rio, M., Thomason, A. G. and Uhlig, S. Weighted Spectral Distribution for Internet Topology Analysis: Theory and Applications. IEEE/ACM Transactions on Networking 18 (2010) 164-176. http://doi.acm.org/10.1145/1816288.1816301 http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=05233839 Fayers, M. Partition models for the crystal of the basic Uq(sln)-module. J. Algebr. Comb. 32 (2010) 339-370. http://dx.doi.org/10.1007/s10801-010-0217-9 http://www.maths.qmul.ac.uk/~mf/papers/crystal.pdf Fenner, T. I. [see: Bowler, A.] Ferber, A. and Hefetz, D. Winning strong games through fast strategies for weak games. Submitted. http://www.maths.qmul.ac.uk/~hefetz/MyPapers/StrongGamesPaper.pdf Ferber, A., Hefetz, D. and Krivelevich, M. Fast embedding of spanning trees in biased Maker-Breaker games. Submitted. http://www.maths.qmul.ac.uk/~hefetz/MyPapers/MBFastTreeSpan.pdf Ferber, A. [see: Ben-Shimon, S.] Ferencak, M. and Hilton, A. J. W. Semiregular factorizations of regular multigraphs. Mathematika 56 (2010) 357-362. http://dx.doi.org/10.1112/S0025579310001051 Fernandes, L. [see: Annibale, A.] Ferrari, L. [see: Bernini, A.] Fey, M. and Scott, A. D. The Minimal Covering Set in Large Tournaments. Social Choice and Welfare, to appear. http://people.maths.ox.ac.uk/scott/Papers/mincoveringset.pdf Fiala, J., Golovach, P. A., Kratochvil, J., Lidicky, B. and Paulusma, D. Distance three labelings of trees. Discrete Appl. Math., to appear. http://www.durham.ac.uk/daniel.paulusma/Papers/Submitted/distree.pdf Fiala, J., Kamiński, M., Lidicky B. and Paulusma, D. The k-in-a-path problem for claw-free graphs, Algorithmica, to appear. http://dx.doi.org/10.1007/s00453-010-9468-z http://www.durham.ac.uk/daniel.paulusma/Papers/Submitted/kpath.pdf Fiala, J. and Paulusma, D. Comparing universal covers in polynomial time. Theor. Comput. Syst. 46 (2010) 620-635 http://dx.doi.org/10.1007/s00224-009-9200-z http://www.durham.ac.uk/daniel.paulusma/Papers/Submitted/universal.pdf Filmus, Y. [see: Ellis, D.] Finizio, N. J. [see: Abel, J.] Fiz Pontiveros, G. Freiman homomorphisms of random subsets of ZN. Preprint. http://uk.arxiv.org/PS_cache/arxiv/pdf/1004/1004.3709v1.pdf Fleiner, T. [see: Biró, P.] Fodor, F. [see: Bárány, I.] Fokkink, R. [see: Alpern, S.] Fomin, F. V., Gaspers, S., Golovach, P. A., Kratsch D. and Saurabh, S. Parameterized algorithm for eternal vertex cover. Inf. Process. Lett. 110 (2010) 702-706. http://dx.doi.org/10.1016/j.ipl.2010.05.029 http://lita.sciences.univ-metz.fr/~kratsch/publications/eternalvc.pdf Fomin, F. V, Golovach, P. A., Hall, A., Mihalak, M., Vicari, E. and Widmayer, P. How to Guard a Graph? Algorithmica (2010) http://dx.doi.org/10.1007/s00453-009-9382-4 Fomin, F. V., Golovach, P. A., Kratochvil, J., Kratsch D. and Liedloff, M. Branch and Recharge: Exact algorithms for generalized domination. Algorithmica (2010). http://dx.doi.org/10.1007/s00453-010-9418-9 Fomin, F. V., Golovach, P. A. and Lokshtanov, D. Guard games on graphs: keep the intruder out! Proceedings of the 7th Workshop on Approximation and Online Algorithms (WAOA 2009). Lect. Notes. Comput. Sci. 5893 (2010) 147-158. http://dx.doi.org/10.1007/978-3-642-12450-1_14 Fomin, F. V., Golovach, P. A. and Lokshtanov, D. Cops and Robber game without recharging. Proceedings of 12th Scandinavian Symposium and Workshops on Algorithm Theory. Lect. Notes Comput. Sci. 6139 (2010) 273-284. http://www.ii.uib.no/~daniello/papers/CopRobberFuel.pdf Fomin, F. V., Golovach, P. A., Lokshtanov, D. and Saurabh, S. Algorithmic Lower Bounds for Problems Parameterized by Clique-width. Proceedings of SODA 2010, SIAM, 2010, 493-502. Fomin, F. V., Golovach, P. A., Lokshtanov, D. and Saurabh, S. Intractability of Clique-Width Parameterizations, SIAM J. Comput. 39 (2010) 1941-1956. http://dx.doi.org/10.1137/080742270 http://www.ii.uib.no/~fomin/articles1/siamcliquewidth_rev_2.pdf Fomin, F. V., Golovach, P. A. and Thilikos, D. Approximation algorithms for domination search, Lect. Notes Comput. Sci. 6534 (2011) 130-141. http://dx.doi.org/10.1007/978-3-642-18318-8_12 http://users.uoa.gr/~sedthilk/papers/dgame.pdf Fomin, F. V. [see: Cohen, N.] Forbes, A.D., Griggs, T.S. and Holroyd, F.C. Rhombicuboctahedron designs. J. Comb. Math. Comb. Comput. 75 (2010) 161-165. Forbes, A. D., Griggs, T. S. and Holroyd, F. C. Truncated Tetrahedron, Octahedron and Cube Designs. Submitted. Forbes, A. D. [see: Adams, P., Colbourn, C. J.] Fordy, A. P. and Marsh, R. J. Cluster mutation-periodic quivers and associated Laurent sequences. J. Algebr. Comb, to appear. Foss, S., Martin, J. B. and Schmidt, P. Long-range last-passage percolation on the line. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1104/1104.2420v1.pdf Fountain, J. B. [see: Everitt, B.] Fountoulakis, N. , Huber, A. and Panagiotou, K. Reliable Broadcasting in Random Networks and the Effect of Density. In Proceedings of INFOCOM’10, IEEE (2010). Fountoulakis, N., Koshla, M. and Panagiotou, K. The multiple orientability thresholds of random hypergraphs. To appear in SODA 2011. http://www.mpi-inf.mpg.de/~fountoul/SODA%20submission%20l-orient.pdf Fountoulakis, N. and Panagiotou, K. 3-connected cores in random planar graphs. Comb. Probab. Comput. 20 (2011) 381- 412. http://dx.doi.org/10.1017/S0963548310000532 http://arxiv.org/PS_cache/arxiv/pdf/0907/0907.2326v1.pdf Fountoulakis, N. and Panagiotou, K. Orientability of random hypergraphs and the power of multiple choices. ICALP 2010. Lect. Notes Comput. Sci. 6198 (2010) 348-359. http://dx.doi.org/10.1007/978-3-642-14165-2 http://www.springerlink.com/content/t5347g856268/#section=727455&page=1 Fountoulakis, N. and Panagiotou, K. Rumour spreading on random regular graphs and expanders. Proceedings of RANDOM 2010. Lect. Notes Comput. Sci. 6302 (2010) 560-573. http://dx.doi.org/10.1007/978-3-642-15369-3 http://www.springerlink.com/content/978-3-642-15368- 6/#section=759507&page=1&locus=0 Fox, J. [see: Berger, E. Conlon, D.] Francheschetti, M., Penrose, M. D. and Rosoman, T. Strict inequalities of critical probabilities in continuum percolation. J. Stat. Phys 142 (2010) 460-486. http://dx.doi.org/10.1007/s10955-011-0122-1 http://arxiv.org/PS_cache/arxiv/pdf/1004/1004.1596v2.pdf Fraternali, F. [see: Annibale, A.] Friedetzky, T. [see: Berenbrink, P., Dantchev, S.] Friedgut, E. [see: Ellis, D.] Friedrich, T., Gairing M. and Sauerwald, T. Quasirandom Load Balancing. In SODA 2010 (2010) 1620-1629. http://www.csc.liv.ac.uk/~gairing/publications/2010-soda.pdf Frieze, A. M. [see: Abdullah, M., Coja-Oghlan, A., Cooper, C., Dyer, M. E.] Fulman, J., Saxl, J. and Tiep, P. H. Cycle indices for finite orthogonal groups of even characteristic. Trans. Am. Math. Soc., to appear. http://arxiv.org/PS_cache/arxiv/pdf/1004/1004.2678v1.pdf Füredi, Z., Riet, A-E. and Tyomkyn, M. Completing Partial Packings of Bipartite Graphs. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1007/1007.4287v3.pdf Gadouleau, M. and Riis, S. Max-Flow Min-Cut Theorems for Multi-User Communication Networks. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1012/1012.5224v2.pdf Gadouleau, M. and Riis, S. Graph-theoretical Constructions for Graph Entropy and Network Coding Based Communications. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1010/1010.2619v1.pdf Gagarin, A. and Zverovich, V. E. Upper bounds for the bondage number of graphs on topological surfaces. Submitted. http://arxiv.org/PS_cache/arxiv/pdf/1012/1012.4117v1.pdf Gairing, M., Lücking, T., Mavronicolas, M. and Monien, T. Computing Nash Equilibria for Scheduling on Restricted Parallel Links Theory Comput. Syst. 47 (2010) 405-432. http://www.csc.liv.ac.uk/~gairing/publications/2009-tocs.pdf Gairing M. [see: Friedrich, T.] Gambette, P. and Huber, K. T. A note on encodings of phylogenetic networks of bounded level. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/0906/0906.4324v1.pdf Gąsieniec, L. [see: Berenbrink, P., Czyzowicz, J.] Gaspers, S. [see: Fomin, F. V.] Gate, J. and Stewart, I. A. Frameworks for logically classifying polynomial-time optimisation problems, Proceedings of Fifth International Computer Science Symposium in Russia, CSR'10, Kazan, Russia, June 16-20, 2010, Lect. Notes Comput. Sci. 6072 (2010) 120-131. http://dx.doi.org/10.1007/978-3-642-13182-0_12 http://www.dur.ac.uk/i.a.stewart/Abstracts/OptFrameworks.htm Gauci, J. B. and Hilton, A. J. W. Continuous k-to-1 Functions Between Complete Graphs Whose Orders Are of a Different Parity. J. Graph Theory 65 (2010) 35-60. http://dx.doi.org/10.1002/jgt.20464 Gauci, J. B., Hilton, A. J. W. and Stark, D. S. Wiggles and finitely discontinuous k-to-1 functions between graphs. Submitted. Gawrychowski, P. [see : Byrka, J.] Geleijnse, G. [see: Consoli, S.] Georgakopoulos, A. [see: Aharoni, R., Bruhn, H.] Georgiou, N. [see: Brightwell, G. R.. Crane, E.] Gerke, S., Steger, A. and Wormald, N. C. Pegging graphs yields a small diameter. Comb. Probab. Comput. 18 (2010) 239-248. http://doi.acm.org/10.1017/S096354831000026X Ghosh, S. [see: Cameron, P. J. ] Gill, N. and Helfgott, H. A. Growth of small generating sets in SLn(Z/pZ). Int. Math. Res. Not., to appear. http://arxiv.org/PS_cache/arxiv/pdf/1002/1002.1605v2.pdf Gill, N. and Helfgott, H. A. Growth in solvable subgroups of GLr(Z/pZ). Submitted. http://arxiv.org/PS_cache/arxiv/pdf/1008/1008.5264v1.pdf Giudici, M. [see: Bamberg, J., Burness, T. C.] Goddard, W. [see: DeLaViña, E.] Goldberg, L. A., Grohe, M., Jerrum, M. R. and Thurley, M. A complexity dichotomy for partition functions with mixed signs. SIAM Journal on Computing 39 (2010) 3336-3402. http://dx.doi.org/10.1137/090757496 http://arxiv.org/PS_cache/arxiv/pdf/0804/0804.1932v3.pdf Goldberg, L. A. and Jerrum, M. R. Approximating the Tutte polynomial of a binary matroid and other related combinatorial polynomials. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1006/1006.5234v1.pdf Goldberg, L. A. and Jerrum, M. R. Approximating the partition function of the ferromagnetic Potts model. In ICALP’10. http://arxiv.org/PS_cache/arxiv/pdf/1002/1002.0986v2.pdf Goldberg, L. A. and Jerrum, M. R. A polynomial-time algorithm for estimating the partition function of the ferromagnetic Ising model on a regular matroid. Preprint. Goldberg, L. A. [see: Bulatov, A., Chebolu, P., Dyer, M. E.] Goldberg, P. W., Papadimitriou, C. and Savani, R. The Complexity of the Homotopy Method, Equilibrium Selection, and Lemke- Howson Solutions. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1006/1006.5352v1.pdf Goldberg, P. W., Savani, R., Sørensen, T. B. and Ventre, C. On the Approximation Performance of Fictitious Play in Finite Games. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1103/1103.1040v2.pdf Goldreich, O. [see: Czumaj, A.] Golovach, P. A., Kratochvíl, J. and Suchy, O. Parameterized Complexity of Generalized Domination Problems. Lect. Notes Comput. Sci. 5911 (2010) 133-142. http://dx.doi.org/10.1007/978-3-642-11409-0_12 http://www.springerlink.com/content/a85317603570k27h/ Golovach, P. A. , Lidicky, B. and Paulusma, D. L(2,1,1)-Labeling Is NP-Complete for Trees. Proceedings of the 6th International Conference on Theory and Application of Models of Computation (TAMC 2009), Lect. Notes Comput. Sci. 6108 (2010) 211-221. http://dx.doi.org/10.1007/978-3-642-13562-0_20 Golovach, P. A. and Thilikos, D. M. Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms, Discrete Optim. 8 (2011) 72-86. http://dx.doi.org/10.1016/j.disopt.2010.09.009 Golovach, P. A. [see: Broersma, H. J., Couturier, J.-F., Fiala, J., Fomin, F. V.] Goodall, A.J., de Mier, A., Noble, S.D. and Noy, M. The Tutte polynomial characterizes simple outerplanar graphs. Comb. Probab. Comput., to appear. http://journals.cambridge.org/production/action/cjoGetFulltext?fulltextid=8203184 Goodenough, S. [see: Duchamp, G.H.E.] Gordon, I. A. and Griffeth, S. Catalan numbers for complex reflection groups. Am. J. Math., to appear. http://arxiv.org/PS_cache/arxiv/pdf/0912/0912.1578v1.pdf Gordon, N. A., Havlicek H. and Shaw, R. Aspects of the Segre variety S1,1,1(2). Submitted. http://arxiv.org/PS_cache/arxiv/pdf/1102/1102.1714v1.pdf Gowers, W. T. Decompositions, approximate structure, transference, and the Hahn-Banach theorem. Bull. Lond. Math. Soc. 42 (2010) 573-606. http://dx.doi.org/10.1112/blms/bdq018 http://uk.arxiv.org/PS_cache/arxiv/pdf/0811/0811.3103v2.pdf Gowers, W. T. Polymath and the density Hales-Jewett theorem. In: An irregular mind (Szemerédi is 70). Bolyai Society Mathematical Studies 21 (2010) 659-687. Gowers, W. T. and Wolf, J. Linear forms and quadratic uniformity for functions on ZN J. Anal. Math., to appear. http://arxiv.org/PS_cache/arxiv/pdf/1002/1002.2210v1.pdf Gowers, W. T. and Wolf, J. n Linear forms and quadratic uniformity for functions on (Fp) . Mathematika, to appear. http://arxiv.org/PS_cache/arxiv/pdf/1002/1002.2209v1.pdf Gowers, W. T. and Wolf, J. n Linear forms and higher-degree uniformity for functions on (Fp) . Geom. Funct. Anal. 21 (2011) 36-69. http://dx.doi.org/10.1007/s00039-010-0106-3 http://arxiv.org/PS_cache/arxiv/pdf/1002/1002.2208v1.pdf Gowers, W. T. [see: Conlon, D.] Graham, B. and Grimmett, G. R. Sharp thresholds for the random-cluster and Ising models. Ann. Appl. Probab. 21 (2011) 240-265. http://dx.doi.org/10.1214/10-AAP693 http://www.statslab.cam.ac.uk/~grg/papers/boxUS.pdf Graham, R. L. [see : Chung, F. R. K.] Grannell, M. J. Some rigid Steiner 5-designs. J. Comb. Des. 18 (2010) 392-400. http://dx.doi.org/10.1002/jcd.20252 http://mcs.open.ac.uk/mjg47/papers/rigid.pdf Grannell, M. J., Griggs T. S., Máčajová, E. and Škoviera, M. Colouring cubic graphs by point-intransitive Steiner triple systems. Submitted. Grannell, M. J. and Knor, M. An enumeration of minimum genus orientable embeddings of some complete bipartite graphs. J. Comb. Math. Comb. Comput. 73 (2010) 95-102. http://mcs.open.ac.uk/mjg47/papers/kmn.pdf Grannell, M. J. and Knor, M. On the number of triangular embeddings of complete graphs and complete tripartite graphs. J. Graph Theory, to appear. Grannell, M. J. and Knor, M. A construction for biembeddings of Latin squares. Submitted. Grannell, M. J. and Knor, M. Biembedding Abelian groups with mates having transversals. Submitted. Grannell, M. J. and Knor, M. Dihedral biembeddings and triangulations by complete and complete tripartite graphs. Submitted. Grannell, M. J. [see: Colbourn, C. J., Donovan, D. M., Drizen, A.] Granovsky, B. and Stark, D. S. A Meinardus theorem with multiple singularities. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1102/1102.5608v1.pdf Grant, T. [see: Erlebach, T.] Gray, R., Macpherson, H. D., Praeger, C. E. and Royle, G. F. Set-homogeneous directed graphs. Preprint. http://www.amsta.leeds.ac.uk/pure/staff/macpherson/sethomdigraph.pdf Gray, R. and Möller, R. Locally-finite Connected-homogeneous Digraphs. Discrete Math., to appear. http://dx.doi.org/10.1016/j.disc.2010.12.017 Gray, R. and Ruškuc, N. On maximal subgroups of free idempotent generated semigroups. Isr. J. Math., to appear. http://www-circa.mcs.st-and.ac.uk/Preprints/idempotents1.pdf Gray, R. and Ruškuc, N. Generators and relations for subsemigroups via boundaries in Cayley graphs. J. Pure Appl. Algebra, to appear. http://dx.doi.org/10.1016/j.jpaa.2011.03.017 http://www-history.mcs.st-and.ac.uk/~robertg/SemigroupBoundaries10.pdf Grayland, A., Jefferson, D., Miguel, I. and Roney-Dougal, C. M. Minimal Ordering Constraints for some Families of Variable Symmetries. Ann. Math. Artif. Intell. 57 (2010) 75-102. http://dx.doi.org/10.1007/s10472-010-9174-1 http://www-circa.mcs.st-and.ac.uk/Preprints/isc07lexsp2.pdf Green, B. J. Approximate groups and their applications: work of Bourgain, Gamburd, Helfgott and Sarnak. Current Events Bulletin of the AMS, 2010. http://arxiv.org/PS_cache/arxiv/pdf/0911/0911.3354v2.pdf Green, B. J. On (not) computing the Mobius function using bounded depth circuits http://arxiv.org/PS_cache/arxiv/pdf/1103/1103.4991v1.pdf Green, B. J. and Tao, T. C. An equivalence between inverse sumset theorems and inverse conjectures for the U3- norm. Math. Proc. Camb. Phil. Soc. 149 (2010) 1-19. http://dx.doi.org/10.1017/S0305004110000186 http://arxiv.org/PS_cache/arxiv/pdf/0906/0906.3100v1.pdf Green, B. J. and Tao, T. C. An arithmetic regularity lemma, associated counting lemma, and applications. An Irregular Mind (Szemerédi is 70). Bolyai Society Mathematical Studies 2010, Volume 21, 261-334. http://dx.doi.org/10.1007/978-3-642-14444-8_7 http://arxiv.org/PS_cache/arxiv/pdf/1002/1002.2028v2.pdf Green, B. J. and Tao, T. C. Yet another proof of Szemerédi’s theorem. An Irregular Mind (Szemerédi is 70). Bolyai Society Mathematical Studies 2010, Volume 21, 335-342. http://dx.doi.org/10.1007/978-3-642-14444-8_8 http://arxiv.org/PS_cache/arxiv/pdf/1002/1002.2254v2.pdf Green, B. J., Tao, T. C. and Ziegler, T. An inverse theorem for the Gowers U4-norm. Glasg. Math. J. 53 (2011) 1–50. http://dx.doi.org/10.1017/S0017089510000546 http://arxiv.org/PS_cache/arxiv/pdf/0911/0911.5681v3.pdf Green, B. J., Tao, T. C. and Ziegler, T. An inverse theorem for the Gowers Us+1[N]-norm. (Announcement)5. http://arxiv.org/PS_cache/arxiv/pdf/1006/1006.0205v2.pdf Green, B. J., Tao, T. C. and Ziegler, T. An inverse theorem for the Gowers Us+1[N]-norm. http://arxiv.org/PS_cache/arxiv/pdf/1009/1009.3998v2.pdf Green, B. J. [see: Breuillard, E.] Griffeth, S. [see: Gordon, I. A.] Griffiths, S. [see: Addario-Berry, L.] Griggs, T.S., Richter, R.B. and Širáň, J. Graphs obtained from Moufang loops and regular maps, J. Graph Theory, to appear. Griggs, T. S. [see; Adams, P., Archdeacon, D., Colbourn, C. J. Donovan, D. M., Drápal, A., Drizen, A., Forbes, A. D., Grannell, M. J.] Grimmett, G. R. and Holroyd, A. E. Lattice embeddings in percolation. Ann. Probab., to appear. http://arxiv.org/PS_cache/arxiv/pdf/1003/1003.3950v1.pdf Grimmett, G. R. and Holroyd, A. E. Geometry of Lipschitz percolation. Annales de l'Institut Henri Poincaré: Probabilités et Statistiques. To appear. http://www.statslab.cam.ac.uk/~grg/papers/hill-rev2.pdf Grimmett, G. R. [see: Graham, B.] Grindrod, P. and Higham, D. J. Models for Evolving Networks: with Applications in Telecommunication and Online Activities. IMA Journal of Management Mathematics, to appear. http://dx.doi.org/10.1093/imaman/dpr001
5 This version will not be published elsewhere, as it is just an announcement for the following paper which is intended for publication. http://www.personal.reading.ac.uk/~sms06gp/IMAevol2.pdf Grindrod, P. and Higham, D. J. Evolving graphs: dynamical models, inverse problems and propagation. Proc. R. Soc. Lond., Ser. A 466 (2010) 753-770. http://dx.doi.org/10.1098/rspa.2009.0456 http://www.personal.reading.ac.uk/~sms06gp/PRSA_evolve[1].pdf Grindrod, P., Higham, D. J. and Kalna, G. Periodic Reordering. IMA J Numer. Anal 30 (2010) 195-207. http://dx.doi.org/10.1093/imanum/drp047 http://imajna.oxfordjournals.org/content/30/1/195.full.pdf Grindrod, P. and Parsons, M. C. Social Networks: Evolving Graphs with Memory Dependent Edges. http://www.personal.reading.ac.uk/~sms06gp/Preprint_MP&PGr[1].pdf Grindrod, P. [see: Estrada, E.] Grohe, M. [see: Goldberg, L. A.] Grujicić, I., Mladenović, N. and Nikolić, N. New greedy and reduction algorithms for covering designs. Submitted. Gupta, A., Gutin, G., Karimi, M., Kim, E. J. and Rafiey, A. Minimum Cost Homomorphisms to Locally Semicomplete and Quasi-Transitive Digraphs. Austral. J. Combin. 46 (2010) 217-232 http://www.cs.rhul.ac.uk/home/gutin/paperstsp/mchqtd041207.pdf Gupta, A. [see: Englert, M.] Gutin, G., van Iersel, L, Mnich, M. and Yeo, A. All Ternary Permutation Constraint Satisfaction Problems Parameterized Above Average Have Polynomial Kernels. Lect. Notes Comput. Sci. 6346 (2010) 326-337. http://arxiv.org/PS_cache/arxiv/pdf/1004/1004.1956v1.pdf Gutin, G., Jones, M. and Yeo, A. Kernels for Below-Upper-Bound Parameterizations of the Hitting Set and Directed Dominating Set Problems. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1010/1010.5881v2.pdf Gutin, G., Jones, M. and Yeo, A. A New Bound for 3-Satisfiable MaxSat and its Algorithmic Application. Preprint. http://de.arxiv.org/PS_cache/arxiv/pdf/1104/1104.2818v1.pdf Gutin, G., Kim, E. J., Mnich, M. and Yeo, A. Betweenness Parameterized Above Tight Lower Bound. J. Comput. Syst. Sci. 76 (2010) 872—878. Gutin, G., Kim, E. J., Szeider, S. and Yeo, A. A Probabilistic Approach To Problems Parameterized Above Tight Lower Bound. J. Comput. Syst. Sci. 77 (2011) 422-429. http://www.lirmm.fr/~kim/journals/probability.pdf Gutin, G. and Yeo, A. Note on Maximal Bisection above Tight Lower Bound. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1005/1005.2848v1.pdf Gutin, G. [see: Alon, N., Bang-Jensen, J., Cohen, N., Crowston, R., Gupta, A.] Habib, M. [see: Charbit, P.] Haddadi, H. [see: Fay, D.] Hague, M. [see: Axelsson, R.] Hall, A. [see; Baier, G., Fomin, F. V. ] Halldórsson, M. M., Kitaev, S. and Pyatkin, A. Graphs capturing alterations in words. Lect. Notes Comput. Sci. 6224 (2010) http://dx.doi.org/10.1007/978-3-642-14455-4_41 http://www.springerlink.com/content/2217687v15171051/fulltext.pdf Hamel, A. M. and King, R. C. Extended Bressoud–Wei and Koike skew Schur function identities. J. Comb. Theory 118 (2011) 545-557. http://dx.doi.org/10.1016/j.jcta.2010.05.002 Hamel, A. M. and King, R. C. Lattice path proofs of extended Bressoud-Wei and Koike skew Schur function identities. Electron. J. Comb. 18 (2011) P47 http://www.combinatorics.org/Volume_18/PDF/v18i1p47.pdf Hammer, P. L. [see: Anthony, M.] Hàn, H. [see: Conlon, D.] Hanafi, S., Ilić, A., Mladenović, N., Urošević, D. A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem. Submitted. Hanafi, S. [see: Crévits, I.] Hanlon, N. [see: Dominiczak, A. F.] Hansen, P., Mladenović, N. and Noble, S. D. Maximizing edge-ratio is NP-complete. Submitted. http://people.brunel.ac.uk/~mastsdn/edge-ratio.pdf Hansen, J. and Jaworski, J. Structural transition in random mappings with anti-preferential attachment. Preprint. http://www.ma.hw.ac.uk/~jennie/papers/antipref.pdf Hansen, K. A., Miltersen, P. B. and Sørensen, T. B. The computational complexity of trembling hand perfection and other equilibrium refinements. In SAGT’10. http://www.dcs.warwick.ac.uk/~trold/papers/tremble2.pdf Hatami, H., Hladký, J., Král, D., Norine, S. and Razbarov, A. A. On the Number of Pentagons in Triangle-Free Graphs. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1102/1102.1634v2.pdf Havet, F. [see: Eggemann, N.] Havlicek H. [see: Gordon, N.] Haynes, T. W., Henning, M. A., van der Merwe, L. C. and Yeo, A. On the existence of k-partite or Kp –free total domination edge-critical graphs. Discrete Math., to appear Haynes, T. W., Henning, M. A. and Yeo, A. A proof of a conjecture on diameter two critical graphs whose complements are claw-free. Submitted. Haynes, T. W., Henning, M. A. and Yeo, A. On a conjecture of Murty and Simon on Diameter 2 Critical Graphs II. Submitted. Hefetz, D. On two generalisations of the Alon-Tarsi polynomial method. J. Comb. Theory Ser. B, to appear. http://www.maths.qmul.ac.uk/~hefetz/MyPapers/revisedAT.pdf Hefetz, D., Krivelevich, M., Stojaković M. and Szabó, T. Continuous Box game. Submitted. http://www.maths.qmul.ac.uk/~hefetz/MyPapers/BoxGamePaper9.pdf Hefetz, D., Krivelevich, M., Stojaković M. and Szabó, T. Global Maker-Breaker games on sparse graphs. Eur. J. Comb. 32 (2011) 162-177. http://www.maths.qmul.ac.uk/~hefetz/MyPapers/MBGlobal.pdf Hefetz, D., Krivelevich, M., Stojaković M. and Szabó, T. Avoider-Enforcer: The rules of the game. J. Comb. Theory Ser. A 117 (2010) 152-163. http://dx.doi.org/10.1016/j.jcta.2009.05.001 http://www.maths.qmul.ac.uk/~hefetz/MyPapers/AEnewrules.pdf Hefetz, D., Muetze, T. and Schwartz, J. On antimagic directed graphs. J. Graph Theory 64 (2010) 219-232. http://dx.doi.org/10.1002/jgt.20451 http://www.maths.qmul.ac.uk/~hefetz/MyPapers/DiAntimagic.pdf Hefetz, D., Rakić, M. and Stojaković, M. Doubly-biased Maker-Breaker Connectivity game. Submitted. http://www.maths.qmul.ac.uk/~hefetz/MyPapers/doubleBiasMBCon.pdf Hefetz, D., Saluz, A. and Tran, H. T. T. An application of the Combinatorial Nullstellensatz to a graph labelling problem. J. Graph Theory 65 (2010) 70-82. http://dx.doi.org/10.1002/jgt.20466 http://www.maths.qmul.ac.uk/~hefetz/MyPapers/revisedAT.pdf Hefetz, D. [see: Alon, N., Ben-Shimon, S., Ferber, A.] Helfgott, H. A. and Rudnev, M. An explicit incidence theorem in Fp Mathematika 57(2011) 135-145. http://dx.doi.org/10.1112/S0025579310001208 http://arxiv.org/PS_cache/arxiv/pdf/1001/1001.1980v2.pdf Helfgott, H. A. [see: Gill, N.] Henning, M. A., Schiermeyer, I. and Yeo, A. A New Bound on the Domination Number of Graphs with Minimum Degree Two. Electron. J. Comb. 18 (2011) P12. http://www.combinatorics.org/Volume_18/PDF/v18i1p12.pdf Henning, M. A. and Yeo, A. Strong transversals in hypergraphs and double total domination in graphs. SIAM J. Discrete Math. 24 (2010) 1336-1355. http://dx.doi.org/10.1137/090777001 Henning, M. A. and Yeo, A. Perfect matchings in total domination critical graphs. Graphs Comb., to appear. http://dx.doi.org/10.1007/s00373-010-1000-3 Henning, M. A. and Yeo, A. Vertex disjoint cycles of different lengths in digraphs. Submitted. Henning, M. A. and Yeo, A. 2-colourings in -regular -uniform hypergraphs. Submitted. Henning, M. A. and Yeo, A. Transversals and matchings in hypergraphs. Submitted. Henning, M. A. [see: DeLaViña, E, Haynes, T. W.] Herrmann, S. and Moulton, V. Trees, Tight-Spans and Point Configurations. Preprint. http://de.arxiv.org/PS_cache/arxiv/pdf/1104/1104.1538v1.pdf Hetherington, T. J. List total arboricity of 2-degenerate graphs. Submitted. Heubach, S. and Kitaev, S. Avoiding substrings in compositions, Congressus Numerantium 202 (2010) 87-95. http://www.ru.is/kennarar/sergey/index_files/Papers/avoiding-substrings-comps.pdf van den Heuvel, J. [see: Cereceda, L., Esperet, L.] Higgins, P. M. [see: Descalco, L.] Higham, D. J., Taylor, A. and Vass, J. K. Discovering bipartite substructure in directed networks. LMS J. Comput. Math 14 (2011) 72-86. http://dx.doi.org/10.1112/S1461157009000072 http://journals.cambridge.org/download.php?file=%2FJCM%2FJCM14%2FS1461157 009000072a.pdf&code=acf3a8f31cb523423a840b894cced959 Higham, D. J. [see: Crofts, J. J., Estrada, E., Grindrod, P.] Hilton, A. J. W., Holroyd, F. C. and Spencer, C. L. King Arthur and his knights with two round tables. Q. J. Math., in press. http://dx.doi.org/doi:10.1093/qmath/haq005 http://qjmath.oxfordjournals.org/content/early/2010/03/23/qmath.haq005.full.pdf+htm l Hilton, A. J. W. [see: Cropper, M., Ferencak, M., Gauci, J.-B.] Hindman, N. and Strauss, D. Some combinatorially defined subsets of βN and their relation to the idempotents. J. Comb. Theory Ser. A. 118 (2011) 373-386. http://dx.doi.org/10.1016/j.jcta.2010.05.005 http://mysite.verizon.net/nhindman/research/combindefined.pdf Hirschfeld, J. W. P. Curves of genus 3. Rend. Mat. 30 (2010) 77-88. Hladký, J., Král, D. and Schauz, U. Brooks' Theorem via Alon-Tarsi Theorem. Discrete Math. 310 (2010) 3426-3428. http://arxiv.org/PS_cache/arxiv/pdf/0905/0905.3475v2.pdf Hladký, J. and Piguet, D. Loebl-Komlos-Sos conjecture: dense case. Submitted. http://arxiv.org/PS_cache/arxiv/pdf/0805/0805.4834v3.pdf Hladký, J. [see: Allen, P., Böttcher, J., Christofides, D., Hatami, H.] van 't Hof, P., Kamiński, M. and Paulusma, D. Finding induced paths of given parity in claw-free graphs. Algorithmica, to appear. http://dx.doi.org/10.1007/s00453-010-9470-5 http://www.dur.ac.uk/daniel.paulusma/Papers/Submitted/odd.pdf van 't Hof, P., Kamiński, M., Paulusma, D., Szeider, S. and Thilikos, D. M. On graph contractions and induced minors,. Discrete Appl. Math., to appear. http://dx.doi.org/10.1016/j.dam.2010.05.005 http://www.dur.ac.uk/daniel.paulusma/Papers/Submitted/contracting.pdf van 't Hof, P., Paulusma, D. and van Rooij, J. M. M. Computing role assignments of chordal graphs. Theor. Comput. Sci. 411 (2010) 3601-3613. http://dx.doi.org/10.1016/j.tcs.2010.05.041 http://www.dur.ac.uk/pim.vanthof/role.pdf van 't Hof, P [see: Briskorn, D., Broersma, H. J.] van der Hofstad, R., Luczak, M. J. and Spencer, J. H. The second largest component in the supercritical 2D Hamming graph. Random Struct. Algorithms 36 (2010) 80-89. http://dx.doi.org/10.1002/rsa.20288 http://arxiv.org/PS_cache/arxiv/pdf/0801/0801.1608v3.pdf Holroyd, A. E. [see: Grimmett, G. R.] Holroyd, F. C. and Watts, I. Overlap colourings and homomorphisms of graphs. Q. J. Math, to appear. http://dx.doi.org/doi:10.1093/qmath/haq022 http://qjmath.oxfordjournals.org/content/early/2010/07/19/qmath.haq022.full.pdf+htm l Holroyd, F. C. [see: Forbes, A. D., Hilton, A. J. W.] Holt, D.F., Rees, S. E. and Röver, C.E. Groups with Context-Free Conjugacy Problems. Int. J. Algebra Comput., in press. http://www.mas.ncl.ac.uk/~nser/abstracts/conjugacy.html Holt, D. F. and Roney-Dougal, C. M. Constructing maximal subgroups of orthogonal groups. LMS J. Comput. Math. 13 (2010) 164-191. http://dx.doi.org/10.1112/S1461157009000035 Horzela, A. [see: Blasiak, P.] Howard, D. M. [see: Biró, Cs.] Hsu, H.-C., Lai, P.-L., Stewart, I. A. and Tsai, C.-H. A class of hierarchical graphs as topologies for interconnection networks. Theor. Comput. Sci. 41 (2010) 2912-2924. http://dx.doi.org/10.1016/j.tcs.2010.04.022 http://www.dur.ac.uk/i.a.stewart/Papers/HierCrossedCubes.pdf Hu, X.-D. [see: Chen, B.] Hubard, A. [see: Bukh, B.] Huber, A. [see: Doerr, B., Fountoulakis, N.] Huber, K. T., Moulton, V., Spillner, A. and Suchecki, R. Metrics on multi-labeled trees: Interrelationships and diameter bounds. IEEE/ACM Computational Biology and Bioinformatics (2010) http://doi.ieeecomputersociety.org/10.1109/TCBB.2010.122 Huber, K. T., van Iersel, L., Kelk, S. and Suchecki, R. A practical algorithm for reconstructing level-1 phylogenetic networks. IEEE/ACM Transactions on Computational Biology and Bioinformatics 8 (2011) 635-649. http://www.win.tue.nl/~liersel/PracticalLevel1.pdf Huber, K. T. [see : Byrka, J., Dress, A., Gambette, P.] Huczynska, S. Equidistant frequency permutation arrays and related constant composition codes. Des. Codes. Cryptography 54 (2010) 109-120. http://dx.doi.org/10.1007/s10623-009-9312-0 http://www-circa.mcs.st-and.ac.uk/Preprints/freqpermarrays.pdf Huczynska, S. [see: Brunk, F. T.] Hunt, E. [see: Dominiczak, A. F.] Hunt, F. H., Perkins, S. and Smith, D. H. Exploiting spatial separations in CDMA systems with correlation constrained sets of Hadamard matrices. IEEE Trans. Inf. Theory 56 (2010) 5757-5761. http://dx.doi.org/10.1109/TIT.2010.2070310 van Iersel, L. [see: Gutin, G., Huber, K. T.] Ilcinksas, D. [see: Czyzowicz, J.] Ilić, A., Mladenović, N., Urošević, D. [see: Hanafi, S.] Inoshita, T., Irving, R. W., Iwama, K., Miyazaki, S. and Nagase, T. Improving man-optimal stable matchings by minimum change of preference lists. Submitted. Iosevich, A., Roche-Newton, O. and Rudnev, M. On an application of Guth-Katz theorem. Math. Research Letters, to appear. http://arxiv.org/PS_cache/arxiv/pdf/1103/1103.1354v3.pdf Iosevich, A. [see: Covert, D.] Irons, D. and Jordan, J. Geometric networks based on Markov point processes with applications to mobile sensor networks. Submitted. Irving, R. W., Iwama, K., and Manlove, D. F. (eds.) Special issue on Matching Under Preferences, Algorithmica 58 (2010) http://springerlink.com/content/g2n352gq3tt5/?p=20584965ab99494c82b1bd618dfeee ee&pi=0 Irving, R. W. and McDermid, E. Sex-equal stable matchings: parameterized complexity and exact algorithms. Submitted. Irving, R. W. and McDermid, E. Popular matchings: structure and algorithms. J. Comb. Optim, to appear. http://www.springerlink.com/content/v13jp04716648272/ Irving, R. W. [see: Biró, P., Dominiczak, A. F., Inoshita, T.] Iwama, K. [see: Inoshita, T., Irving, R. W.] Jackson, B. An inequality for Tutte polynomials. Combinatorica 30 (2010) 69-81. http://dx.doi.org/10.1007/s00493-010-2484-4 Jackson, B. and Jordán, T. Operations Preserving Global Rigidity of Generic Direction-Length Frameworks. International Journal of Computational Geometry and Applications 20 (2010) 685-708.. http://www.maths.qmul.ac.uk/~bill/mixedbRESUBMIT.pdf Jackson, B. and Keevash, P. Bounded direction-length frameworks. Discrete Comput. Geom., to appear. http://www.maths.qmul.ac.uk/~keevash/papers/bounded.pdf Jackson, B. and Keevash, P. Necessary Conditions for the Global Rigidity of Direction-Length Frameworks. Discrete Comput. Geom., to appear. http://www.maths.qmul.ac.uk/~keevash/papers/global.pdf Jackson, B. and Sokal, A. D. Maxmaxflow and Counting subgraphs. Electron. J. Comb. 17 (2010) R99. http://www.combinatorics.org/Volume_17/PDF/v17i1r99.pdf Jackson, B. [see: Bilinski, M., Dong F. M.] Jalsenius, M. [see: Arthur, D., Bulatov, A., Dyer, M. E.] Jamakovic. A. [see: Fay, D.] Janson, S. and Riordan, O. M. Duality in inhomogeneous random graphs, and the cut metric. Random Struct. Algorithms, to appear. http://dx.doi.org/10.1002/rsa.20348 http://www2.math.uu.se/~svante/papers/sj230.pdf Janson, S. [see: Bollobás, B.] Jansson, J. [see: Czyzowicz, J.] Jarvis, A. F. and Verrill, H. A. Supercongruences for the Catalan-Larcombe-French Numbers. Ramanujan J. 22 (2010) 171-186. http://www.afjarvis.staff.shef.ac.uk/maths/jarvisverrill_clf.pdf Jaworski, J. [see: Hansen, J.] Jefferson, D. [see: Grayland, A.] Jelínek. V. [see: Burstein, A., Claesson, A., Dukes, W. M. B] Jelinkova E. [see: Burstein, A., Claesson, A.] Jenkinson, T., Seidel, D. and Truss, J. K. Countable homogeneous multipartite graphs. Eur. J. Comb, to appear. http://www.maths.leeds.ac.uk/Pure/staff/truss/tristan.pdf Jerrum, M. R. [see: Bulatov, A., Goldberg, L. A.] Jha, V. [see: Cordero, M.] Jia, W. [see: Edwards, K. J.] Jiang, C. [see: Coenen, F.] Jin, X. [see: Cheng, W.] Johannson, K. [see: Coker, T.] Johnson, J. R. [see: Baber, R.] Johnson, M., Patel, V., Paulusma, D. and Trunck, T. Obtaining online ecological colourings by generalizing first-fit. Proceedings of Fifth International Computer Science Symposium in Russia, CSR'10, Kazan, Russia, June 16-20, 2010. Lect. Notes Comput. Sci. 6072 (2010) 240-251. http://dx.doi.org/10.1007/978-3-642-13182-0_22 http://www.dur.ac.uk/viresh.patel/eco_latin.pdf Johnson, M. [see: Broersma, H. J., Cereceda, L.] Johnson, P. D. [see: Cropper, M.] Jones, G. A. Hypermaps and multiply quasiplatonic Riemann surfaces. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1104/1104.0713v1.pdf Jones, G. A. Maps related to Grigorchuk’s group. Eur. J. Comb. 32 (2011) 478-494. http://dx.doi.org/10.1016/j.ejc.2009.03.025 Jones, G. A. Classification and Galois conjugacy of Hamming maps. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1006/1006.0516v1.pdf Jones, G. A. Characterisations and Galois conjugacy of generalised Paley maps. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1006/1006.0514v1.pdf Jones, G. A. Regular embeddings of complete bipartite maps: classification and enumeration. Proc. Lond. Math. Soc. 101 (2010) 427-453. http://dx.doi.org/10.1112/plms/pdp061 http://eprints.soton.ac.uk/156467/1/BipPLMSNewProof.pdf Jones, G. A. and Pinto, D. Infinitely many Hypermaps of a given Type and Genus. Electron J. Comb. 17 (2010) R148. http://www.combinatorics.org/Volume_17/PDF/v17i1r148.pdf Jones, G. A. and Pinto, D. Hypermap operations of finite order. Discrete Math. 310 (2010) 1820-1827 http://dx.doi.org/10.1016/j.disc.2009.12.019 Jones, G. A. and Poulton, A. Maps admitting trialities but not dualities. Eur. J. Comb. 31 (2010) 1805-1818. http://dx.doi.org/10.1016/j.ejc.2010.02.001 http://arxiv.org/PS_cache/arxiv/pdf/0911/0911.2672v1.pdf Jones, G. A. [see: Breda d’Avezeda, A. ] Jones, M. [see: Crowston, R., Gutin, G.] Jones, R. A., Perkins, S., Sanusi, S. O. and Smith, D. H. The application of frequency assignment techniques in spreading code assignment. Wireless Personal Communications 54 (2010) 397-415. http://dx.doi.org/10.1007/s11277-009-9732-1 Jones, S. K., Perkins, S. and Roach, P. A. Properties, Isomorphisms and enumeration of 2-quasi-magic Sudoku grids. Discrete Math., in press. http://dx.doi.org/10.1016/j.disc.2010.09.026 Jordan, J. The spectra of the Laplacians of fractal graphs not satisfying spectral decimation. Proc. Edinb. Math. Soc. 53 (2010) 731-746. http://dx.doi.org/10.1017/S0013091508000898 http://eprints.whiterose.ac.uk/42657/2/Jordan_42657.pdf Jordan, J. Degree sequences of geometric preferential attachment graphs. Adv. Appl. Probab. 42 (2010) 319-330. http://dx.doi.org/10.1239/aap/1275055230 http://amorph.group.shef.ac.uk/files/geopref4.pdf Jordan, J. and Southwell, R. Further properties of reproducing graphs. Applied Mathematics 1 (2010) 344-350. http://dx.doi.org/10.4236/am.2010.15045 http://www.scirp.org/journal/PaperDownload.aspx?FileName=AM20100500001_507 02057.pdf&paperID=3255 Jordan, J. [see: Cohen, N., Irons, D.] Jordán, T. [see: Jackson, B.] Jurdziński. M. and Lazić, R. Alternating Automata on Data Trees and XPath Satisfiability. ACM Transactions on Logic, to appear. http://arxiv.org/PS_cache/arxiv/pdf/0805/0805.0330v3.pdf Kahrstrom, J. [see: Dress, A.] Kalna, G. [see: Grindrod, P.] Kamiński, M., Paulusma, D. and Thillikos, D. M. Contracting planar graphs to contractions of triangulations. J. Discrete Algorithms, to appear. http://dx.doi.org/10.1016/j.jda.2011.03.010 http://www.durham.ac.uk/daniel.paulusma/Papers/Submitted/conplan2.pdf Kamiński, M. [see: Fiala, J., van 't Hof, P.] Kang, M. and McDiarmid, C. J. H. Random unlabelled graphs containing few disjoint cycles. Random Struct. Algorithms 38 (2011) 174-204. http://dx.doi.org/10.1002/rsa.20355 Kang, R. J. and Manggala, P. Distance edge-colourings and matchings. Submitted. Kang, R. J., Mnich, M. and Müller, T. Induced matchings in subcubic planar graphs. Submitted. An earlier version appeared in Lect. Notes Comput. Sci. 6347 (2010) 112-122, http://dx.doi.org/10.1007/978-3-642-15781-3_10 http://homepages.cwi.nl/~mueller/Papers/KMM.pdf. Kang, R. J. and Müller, T. Frugal, acyclic and star colourings of graphs. Discrete Appl. Math., to appear. http://dx.doi.org/10.1016/j.dam.2010.05.008 Kang, R. J. and Müller, T. Sphere and dot product representations of graphs. Full version submitted. An earlier version appeared in Proceedings of the 27th Symposium on Computational Geometry (2011). Kang, R. J. and Müller, T. Dot product representations of planar graphs. Submitted. An earlier version appeared in Proceedings of the 18th Symposium on Graph Drawing (GD 2010, Konstanz), Lect. Notes Comput. Sci. 6502 (2011) 287-292. http://dx.doi.org/10.1007/978-3-642-18469-7_26 http://homepages.cwi.nl/~mueller/Papers/dotproductPlanar.pdf Kang, R. J., Sereni, J.-S. and Stehlik, M. Every plane graph of maximum degree 8 has an edge-face 9-colouring. SIAM J. Discrete Math., to appear. http://arxiv.org/PS_cache/arxiv/pdf/0912/0912.4770v1.pdf Kang, R. J. [see: Addario-Berry, L., Bordewich, M.] Karaduman, E. [see: Campbell, C. M.] Karimi, M. [see: Gupta, A.] Károlyi, Gy. and Pál, A. The cyclomatic number of connected graphs without solvable orbits. Preprint. http://www2.imperial.ac.uk/~apal4/publ/solvable12.pdf Kaski, P. [see: Colbourn, C. J.] Kawarabayashi, K., Kreutzer S. and Mohar, B. Linkless and flat embeddings in 3-space and the Unknot Problem. Symposium in Computational Geometry (2010). http://www.comlab.ox.ac.uk/people/stephan.kreutzer/Publications/10-socg.pdf Kazachkov, I. [see: Duncan, A. J.] Keedwell, A. D. Constructions of complete sets of orthogonal diagonal Sudoku squares. Australas J. Comb. 47 (2010) 227-238. Keedwell, A. D. Gaston Tarry and multimagic squares. Math. Gaz., to appear. Keedwell, A. D. Confirmation of a conjecture concerning orthogonal Sudoku and bimagic squares. Bull. Inst. Comb. Appl., to appear. Keevash, P. Hypergraph Turan Problems. To appear in Surveys in Combinatorics 2011 (R. J. Chapman, Ed.) Cambridge University Press. http://www.maths.qmul.ac.uk/~keevash/papers/turan-survey.pdf Keevash, P. A hypergraph blow-up Lemma. Random Struct. Algorithms, to appear. http://www.maths.qmul.ac.uk/~keevash/papers/hyp-blowup.pdf Keevash, P., Kühn, D., Mycroft R. and Osthus, D. Loose Hamilton cycles in hypergraphs. Discrete Math. 311 (2011) 544-559. http://dx.doi.org/10.1016/j.disc.2010.11.013 http://www.maths.qmul.ac.uk/~keevash/papers/loose-cycles.pdf Keevash, P. and Mubayi, D. The Turan number of F3,3. Submitted. http://www.maths.qmul.ac.uk/~keevash/papers/f33.pdf Keevash, P. and Mubayi, D. Set systems without a simplex or cluster. Combinatorica 30 (2010) 175-200. http://www.maths.qmul.ac.uk/~keevash/papers/simplexcluster-journal.pdf Keevash, P. and Sudakov, B. Pancyclicity of Hamiltonian and highly connected graphs. J. Comb. Theory Ser.B. 100 (2010) 456-467. http://dx.doi.org/10.1016/j.jctb.2010.02.001 http://uk.arxiv.org/PS_cache/arxiv/pdf/0903/0903.4567v1.pdf Keevash, P. [see: Bohman, T., Christofides, D., Jackson, B.] Kelk, S. [see : Byrka, J.] Keller, M. T., Shen, Y.-S., Streib, N. and Young, S. J. On the Stanley depth of Veronese ideals. J. Algebr. Comb. 33 (2011) 313-324. http://dx.doi.org/10.1007/s10801-010-0249-1 http://www.springerlink.com/content/14365683t7625xw2/fulltext.pdf Keller, M. T., Streib, N. and Trotter, W. T. Online linear discrepancy of partially ordered sets. In: An Irregular Mind (Szemerédi is 70). Bolyai Society Mathematical Studies 21 (2010) pages 343-358. http://rellek.net/home/images/publications/online-ld.pdf Keller, M. T. and Young, S. J. Degree bounds for linear discrepancy of interval orders and disconnected posets. Discrete Math. 310 (2010) 2198-2203. http://dx.doi.org/10.1016/j.disc.2010.04.016 http://rellek.net/home/images/publications/degree-bounds-intords.pdf Keller, M. T. [see: Biró, Cs.] Kemp, T., Mahlburg, K., Rattan, A. and Smyth, C. Enumeration of Non-Crossing pairings on bit strings. J. Comb. Theory Ser. A 118 (2011) 129-151. http://dx.doi.org/10.1016/j.jcta.2010.07.002 http://arxiv.org/PS_cache/arxiv/pdf/0906/0906.2183v2.pdf Kern, W. [see: Biró, P.] Key, J. D., Mavron, V. C. and McDonough, T. P. Reed-Muller codes and permutation decoding. Discrete Math. 310 (2010) 3114-3119 http://dx.doi.org/10.1016/j.disc.2009.06.001 Kikuta, K. [see: Alpern, S.] Kim E. J. [see: Alon, N., Cohen, N., Crowston, R., Gupta, A., Gutin, G.] King O. H. and Robertson A. G. On the K-theory of boundary C*-algebras of Ã2 groups. Submitted. King, O. H. [see: Cossidente, A.] King, R. C. [see: Hamel, A. M.] Kitaev, S. and Pyatkin, A. On avoidance of V and Λ patterns in permutations. Ars Comb., to appear. http://www.math.ru.is/download/KiPy09__On_avoidance.pdf Kitaev, S. and Remmel, J. Place-Difference-Value Patterns: A generalization of generalized permutation and word patterns. Integers 10 (2010) 129-154. http://integers-ejcnt.org/vol10.html Kitaev, S. [see: Bousquet-Mélou, M., Claesson, A., Dukes, W. M. B., Halldórsson, M. M., Heubach, S.] Klasing, R. [see: Czyzowicz, J.] Kleinjung, J. [see: Annibale, A.] Knor, M. [see: Grannell, M. J.] Knox, F., Kühn, D. and Osthus, D. Approximate Hamilton Decompositions of Random Graphs. Random Struct. Algorithms, to appear. http://web.mat.bham.ac.uk/D.Osthus/AHdosrg.pdf Knox, F., Kühn, D. and Osthus, D. Edge-disjoint Hamilton cycles in random graphs. Preprint. http://web.mat.bham.ac.uk/D.Osthus/Exact_Ham4.pdf Kohayakawa, Y., Rödl, V., Schacht, M. and Skokan, J. On the triangle removal lemma for subgraphs of sparse pseudorandom graphs. In: An Irregular Mind (Szemerédi is 70). Bolyai Society Mathematical Studies 21 (2010) pages 359-404. http://www.math.uni-hamburg.de/home/schacht/2010/pseudoRSz.pdf Köhler, E. [see; Baier, G.] Kolman, P. [see; Baier, G.] Koolen, J. [see : Dress, A.] Körner, J. [see; Brightwell, G. R.] Korpelainen, N. and Lozin, V. V. Bipartite Induced Subgraphs and Well-Quasi-Ordering. J. Graph Theory, to appear. http://dx.doi.org/10.1002/jgt.20528 http://arxiv.org/PS_cache/arxiv/pdf/1005/1005.1328v1.pdf Korpelainen, N., Lozin, V. V., Malyshev, D. S. and Tiskin, A. Boundary properties of graphs for algorithmic graph problems. Theor. Comput. Sci., to appear. http://dx.doi.org/10.1016/j.tcs.2011.03.001 Korpelainen, N., Lozin, V. V. and Tiskin, A. Hamiltonian cycles in subcubic graphs: what makes the problem difficult. In Proceedings of TAMC 2010. Lect. Notes. Comput. Sci. 6108 (2010) 320-327. http://dx.doi.org/10.1007/978-3-642-13562-0_29 Korpelainen, N. [see: Cardoso, D. M.] Korst, J. [see: Consoli, S.] Koshla, M. [see: Fountoulakis, N.] Kostochka, A. V., Stiebitz, M. and Woodall, D. R. Ohba's conjecture for graphs with independence number five. Discrete Math. 311 (2011) 996-1005. http://dx.doi.org/10.1016/j.disc.2011.02.026 Kostochka, A. V. [see: Böhme, T.] Kovačević-Vujčić, V. [see: Čangalović, M.] Kozlik, A. [see: Drapál, A.] Král, D. [see: Hatami, H., Hladký, J.] Kratica, J. V. [see: Čangalović, M.] Kratochvíl, J. [see: Fiala, J.. Fomin, F. V., Golovach, P. A.] Kratsch, D. [see: Couturier, J.-F., Fomin, F. V.] Krattenthaler, C. and Müller, T. W. Decomposition numbers for finite Coxeter groups and generalised non-crossing partitions, Trans. Amer. Math. Soc. 362 (2010) 2723-2787 http://dx.doi.org/10.1090/S0002-9947-09-04981-2 Krattenhaler C. [see: Cameron, P. J.] Krauthgamer, R. [see: Englert, M.] Kreutzer, S. and Tazari, S. Lower Bounds for the Complexity of Monadic Second-Order Logic. In LICS 2010 189-198. http://doi.ieeecomputersociety.org/10.1109/LICS.2010.39 Kreutzer, S. and Tazari, S. Directed Nowhere Dense Classes of Graphs. Preprint. http://de.arxiv.org/PS_cache/arxiv/pdf/1104/1104.3808v1.pdf Kreutzer, S. [see: Axelsson, R., Kawarabayashi, K.] Krivelevich, M. [see: Alon, N., Balogh, J., Ben-Shimon, S., Coja-Oghlan, A., Cooper, C. , Ferber, A., Hefetz, D.] Krokhin, A. [see: Carvalho, C., Egri, L.] Krusche, P. and Tiskin, A. New algorithms for efficient parallel string comparison. In Proceedings of ACM SPAA, pp. 209—216, 2010. http://dx.doi.org/10.1145/1810479.1810521 http://eprints.dcs.warwick.ac.uk/424/1/p209-krusche.pdf Krusche, P. and Tiskin, A. Parallel longest increasing subsequences in scalable time and memory. In Proceedings of PPAM 2009, Revised Selected Papers, Part I. Lect. Notes Comput. Sci. 6067 (2010) 176—185. http://dx.doi.org/10.1007/978-3-642-14390-8_19 http://www.springerlink.com/content/c31k3236qm70v571/fulltext.pdf Krusche, P. and Tiskin, A. Computing alignment plots efficiently. In Proceedings of ParCo, 2009, vol. 19 of Advances in Parallel Computing series, IOS Press, pp. 158—165, 2010. http://arxiv.org/PS_cache/arxiv/pdf/0909/0909.2000v1.pdf Krusche, P. [see: Carré, I.] Krysta, P., Michalak, T., Sandholm T. and Wooldridge, M. Combinatorial Auctions with Externalities. Proceedings of AAMAS '10. http://www.cs.cmu.edu/~sandholm/CAs%20with%20externalities.aamas10short.pdf Krysta, P. [see: Czumaj, A.] Kubitzke, M. [see; Claesson, A., Dukes, W. M. B.] Kühn, D., Mycroft, R. and Osthus, D. Hamilton l-cycles in uniform hypergraphs. J. Comb. Theory Ser. A 117 (2010) 910-927. http://dx.doi.org/10.1016/j.jcta.2010.02.010 http://web.mat.bham.ac.uk/D.Kuehn/l-cycles2.pdf Kühn, D., Mycroft, R. and Osthus, D. An approximate version of Sumner’s universal tournament conjecture. J. Comb. Theory Ser. B, in press. http://dx.doi.org/10.1016/j.jctb.2010.12.006 http://web.mat.bham.ac.uk/D.Osthus/trees3.pdf Kühn, D., Mycroft, R. and Osthus, D. A proof of Sumner’s universal tournament conjecture for large tournaments. Proc. Lond. Math. Soc., to appear. http://dx.doi.org/10.1112/plms/pdq035 http://web.mat.bham.ac.uk/D.Osthus/exacttrees3.pdf Kühn, D., Mycroft, R. and Osthus, D. Hamilton l-cycles in uniform hypergraphs. J. Comb. Theory Ser. A 117 (2010) 367-380. http://dx.doi.org/10.1016/j.jcta.2010.02.010 http://web.mat.bham.ac.uk/D.Kuehn/l-cycles2.pdf Kühn, D. and Osthus, D. A survey on Hamilton cycles in directed graphs. Eur. J. Comb., to appear. http://web.mat.bham.ac.uk/D.Osthus/cyclesurvey3.pdf Kühn, D., Osthus, D. and Treglown, A. Hamiltonian degree sequences in digraphs. J. Comb. Theory Ser. B 100 (2010) 367-380. http://dx.doi.org/10.1016/j.jctb.2009.11.004 http://web.mat.bham.ac.uk/D.Kuehn/chvatal6.pdf Kühn, D., Osthus, D. and Treglown, A. Hamilton decompositions of regular tournaments. Proc. Lond. Math. Soc. 101 (2010) 303-335. http://dx.doi.org/10.1112/plms/pdp062 http://web.mat.bham.ac.uk/D.Kuehn/kellypreprint.pdf Kühn, D., Osthus, D. and Treglown, A. Matchings in 3-uniform hypergraphs. Submitted. http://web.mat.bham.ac.uk/D.Osthus/hyper11.pdf _ Kühn, D. [see: Christofides, D., Keevash, P., Knox, F.] Kurauskas, V. and McDiarmid, C. J. H. Random graphs with few disjoint cycles. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1010/1010.6278v1.pdf Laba, I. [see: Croote, E.] Lai, P.-L. [see: Hsu, H.-C.] Lange, M. [see: Axelsson, R.] Larose, B. [see: Egri, L.] Latte, M. [see: Axelsson, R.] Launois, S. [see: Bell, J.] Law, H.-F. On polar ovals in abelian projective planes. Innov. Incidence Geom., to appear. Lazić, J. [see: Crévits, I.] Lazić, R. [see: Jurdiński, M.] Leader, I. B. and Long, E. P. Tilted Sperner Families. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1101/1101.4151v1.pdf Leader, I. B., Russell, P. A. and Walters, M. J. Transitive Sets and Cyclic Quadrilaterals. Submitted. http://arxiv.org/PS_cache/arxiv/pdf/1012/1012.5468v1.pdf Leader, I. B., Russell, P. A. and Walters, M. J. Transitive Sets in Euclidean Ramsey Theory. Submitted. http://arxiv.org/PS_cache/arxiv/pdf/1012/1012.1350v1.pdf Leader, I. B. [see: Bollobás, B., Borg, P.] Leemans, D. and Rowley, P. J. Rank three residually connected geometries for M22, revisited. Electron. J. Comb. 17 (2010) N4. http://www.combinatorics.org/Volume_17/PDF/v17i1n4.pdf van Leeuwen, E. J. [see: Erlebach, T.] Lefevre, J. G. and McCourt, T. A. The Disjoint m-Flower Intersection Problem for Latin Squares. Electron. J. Comb. 18 (2011) P42. http://www.combinatorics.org/Volume_18/PDF/v18i1p42.pdf Lefevre, J. G. [see: Donovan, D. M.] Lehel, J. [see: Cropper, M.] Levavi, A. [see: Doerr, B.] Lewis, R. and Thompson, J. On the Application of Graph Colouring Techniques in Round-Robin Sports Scheduling. Comput. Oper. Res. 38 (2011) 190-204. http://www.rhydlewis.eu/papers/sportsPaper.pdf Lidicky, B. [see: Fiala, J., Golovach, P. A.] Liebeck, M. W., Praeger, C. E. and Saxl, J. Regular subgroups of primitive permutation groups. Memoirs Amer. Math. Soc. 203 (2010) 1-88. http://www2.imperial.ac.uk/~mwl/REGFINAL.PDF Liebeck, M. W. [see: Bamberg, J.] Liedloff, M. [see: Fomin, F. V.] Lignos, I, [see: Czyzowicz, J.] Lin, Y. [see: Cheng, W.] Lingas, A. [see: Adamaszek, A.] Linton, S. A., Ruškuc, N. and Vatter V. (eds.). Permutation patterns. Proceedings of the 5th conference, Fife, Scotland, June 11--15, 2007. Lond. Math. Soc. Lect. Note Ser 376 (2010) Cambridge: Cambridge University Press. Linton, S. A. [see: Albert, M. H.] Linusson, S. [see: Claesson, A.] Loebl, M., Reed, B., Scott, A. D, Thomason, A. G. and Thomassé, S. Almost all H-free graphs have the Erdős-Hajnal property. In: An Irregular Mind (Szemerédi is 70). Bolyai Society Mathematical Studies 2010, 21, 405-414. http://people.maths.ox.ac.uk/scott/Papers/erdoshajnal.pdf Loebl, M. [see; Berger, E.] Lokshtanov, D. [see: Fomin, F. V.] Long, E. P. Long paths and cycles in subgraphs of the cube. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1006/1006.3049v1.pdf Long, E. P. [see: Leader, I. B.] Lovell, S. and Truss, J. K. Cycle-types in the automorphism groups of countable homogeneous graphs. Math. Proc. Camb. Philos. Soc., to appear. http://www.amsta.leeds.ac.uk/pure/staff/truss/stephen1old.pdf Lozin, V. V. A decidability result for the dominating set problem. Theor. Comput. Sci. 411 (2010) 4023-4027. Lozin, V. V. and Mayhill, C. Canonical antichains of unit interval and bipartite permutation graphs. Order, to appear. http://dx.doi.org/10.1007/s11083-010-9188-7 Lozin, V. V. and Milanic, M. On the maximum independent set problem in subclasses of planar graphs. J. Graph Algorithms Appl. 14 (2010) 269-286. http://www.cs.brown.edu/sites/jgaa/accepted/2010/LozinMilanic2010.14.2.pdf Lozin, V. V. [see: Cardoso, D. M., Dąbrowski, K., Korpelainen, N.] Lübbecke, M. [see: Erlebach, T.] de Luca, A. and Zamboni, L. Q. Involutions of epicentral words. Eur. J. Comb. 31 (2010) 867-886. http://dx.doi.org/10.1016/j.ejc.2009.07.002 de Luca, A. and Zamboni, L. Q. On graphs of central episturmian words. Theor. Comput. Sci. 411 (2010) 70-90. http://dx.doi.org/10.1016/j.tcs.2009.09.003 Lücking, T. [see: Gairing, M.] Luczak, M. J. [see: Brightwell, G. R., van der Hofstad, R.] Łuczak, T., Simonovits, M. and Skokan, J. On the Multi-coloured Ramsey Numbers of Cycles. J. Graph Theory, to appear. http://dx.doi.org/10.1002/jgt.20572 Łuczak, T. and Thomason, A. G. Vicarious graphs. Comb. Probab. Comput 19 (2010) 819-827. http://dx.doi.org/10.1017/S096354830999054X Lyle, S. and Mathas, A. Carter-Payne homomorphisms and Jantzen filtrations. J. Algebr. Comb. 32 (2010) 417-457. http://dx.doi.org/10.1007/s10801-010-0222-z http://arxiv.org/PS_cache/arxiv/pdf/0912/0912.2038v1.pdf Ma, J. [see: Bilinski, M.] Máčajová, E. [see: Grannell, M. J.] Macbeth, H., Šiagiová, J., Širáň, J. and Vetrik, T. Large Cayley graphs and vertex-transitive non-Cayley graphs of given degree and diameter. J. Graph Theory 64 (2010) 87-98. http://dx.doi.org/10.1002/jgt.20439 http://vetrik.webs.com/img/cayley09c.pdf Macpherson, H. D. A survey of homogeneous structures. Discrete Math., in press. http://dx.doi.org/10.1016/j.disc.2011.01.024 http://www.amsta.leeds.ac.uk/pure/staff/macpherson/homog_final2.pdf Macpherson, H. D. [see: Gray, R.] Maffray, F. [see: Esperet, L.] Mahlburg, K. [see: Kemp, T.] Malyshev, D. S. [see: Korpelainen, N.] Manggala, P. [see: Kang, R. J.] Manlove, D. F. [see: Biró, P., Irving, R. W.] Marchant, E. and Thomason, A. G. Extremal graphs and multigraphs with two weighted colours. In; Katona, Gyula O. H. (ed.) et al., Fete of combinatorics and computer science. Selected papers of the conference held in Keszthely, Hungary, August 11--15, 2008 dedicated to László Lovász on the occasion of his 60th birthday. Dordrecht: Springer; Budapest: János Bolyai Mathematical Society. 239-286 (2010). Markström, K., Thomason, A. G. and Wagner, P. Properly Edge-Coloured Subgraphs in Colourings of Bounded Degree. Graphs. Comb. 27 (2011) 243-249. http://dx.doi.org/10.1007/s00373-010-0970-5 http://abel.math.umu.se/~klasm/Uppsatser/G34.pdf Marsh, R. J. and Martin, P. P. Tilling bijections between paths and Brauer diagrams. J. Algebr. Comb. 33 (2011) 427-453. http://dx.doi.org/10.1007/s10801-010-0252-6 http://www.maths.leeds.ac.uk/~marsh/research_articles/pp32.pdf Marsh, R. J. and Schroll, S. Trees of Relations, Clusters and RNA Secondary Structures. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1010/1010.3763v2.pdf Marsh, R. J. [see: Baur, K.] Martin, B. The lattice structure of sets of surjective hyper-operations. Lect. Notes Comput. Sci. 6308 (2010) 368-382. http://dx.doi.org/10.1007/978-3-642-15396-9_31 http://www.dur.ac.uk/barnaby.martin/downloads/webCP2010.pdf Martin, B. [see: Bodirsky, M., Dantchev, S.] Martin, J. B. [see: Foss, S.] Martin, K. M. Paterson, M. B. and Stinson, D. R. Key predistribution for homogeneous wireless sensor networks with group deployment of nodes. ACM Transactions on Sensor Networks 7 (2010) article 11. http://dx.doi.org/10.1145/1824766.1824767 http://eprint.iacr.org/2008/412.pdf Martin, K. M. [see: Blackburn, S. R.] Martin, P. P. [see: Marsh, R. J.] Martin, R. [see: Chebolu, P., Czyzowicz, J.] Mathas, A. [see: Lyle, S.] Mathé, A. [see: Christofides, D.] Matoušek, J. [see: Bukh, B.] Mavron, V. C. and McDonough, T. P. The dimension of the code of a strongly resolvable design. Contemp. Math. 523 (2010) 203-206. Mavron, V. C. [see: Key, J. D.] Mavronicolas, M. [see: Gairing, M.] Mayhew, D., Newman, M., Welsh, D. J. A. and Whittle, G. On the asymptotic properties of connected matroids Eur. J. Comb., to appear http://homepages.ecs.vuw.ac.nz/~mayhew/Publications/MNWW.pdf Mayhew, D. and Welsh, D. J. A. On the number of sparse paving matroids. Submitted. http://homepages.ecs.vuw.ac.nz/~mayhew/Publications/MW.pdf Mayhill, C. [see: Lozin,V. V.] McBride, M. W. [see: Dominiczak, A. F.] McClure, J. D. [see: Dominiczak, A. F.] McCourt, T. A. The intersection problem for disjoint 2-flowers in Steiner triple systems. J. Comb. Math. Comb. Comput. 75 (2010) 41-63. McCourt, T. A. On defining sets in Latin squares and two intersection problems, one for Latin squares and one for Steiner triple systems. Bull. Aust. Math. Soc 82 (2010) 351 - 352 http://dx.doi.org/10.1017/S000497271000167X McCourt, T. A. [see: Donovan, D. M., Lefevre, J. G.] McDermid, E. [see: Irving, R. W.] McDiarmid, C. J. H. and Müller, T. On the chromatic number of random geometric graphs. Combinatorica, to appear. http://arxiv.org/PS_cache/arxiv/pdf/1101/1101.6065v2.pdf McDiarmid, C. J. H. and Müller, T. The number of bits needed to represent a unit disk graph. Lect. Notes Comput. Sci. 6410 (2010) 315-323. http://dx.doi.org/10.1007/978-3-642-16926-7_29 http://homepages.cwi.nl/~mueller/Papers/DGsBitSize.pdf McDiarmid, C. J. H. [see: Kang, M., Kang, R. J., Kurauskas, V.] McDonough, T. P. [see: Key, J. D., Mavron, V. C.] McKee, J. F. Integer Symmetric Matrices of Small Spectral Radius and Small Mahler Measure. Int. Math. Res. Not. (2011) http://dx.doi.org/10.1093/imrn/rnr011 http://arxiv.org/PS_cache/arxiv/pdf/0907/0907.0371v1.pdf McKee, J. F. [see: Blackburn, S. R.] McKenna, S. J. [see: Edwards, K. J.] Meeks, K. and Scott, A. D. The complexity of flood-filling games on graphs. Submitted. http://people.maths.ox.ac.uk/scott/Papers/floodit.pdf Meeks, K. and Scott, A. D. The complexity of Free-Flood-It on 2×n boards. Submitted. http://people.maths.ox.ac.uk/scott/Papers/floodit2xn.pdf Merino, C., Noble, S. D., Ramirez-Ibañez, M. and Villarroel, R. On the structure of the h-vector of a paving matroid. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1008/1008.2031v2.pdf Merino, C. [see: Chavez-Lomelí, L.] van der Merwe, L. C. [see: Haynes, T. W.] Meuwly, F.-X., Ries B. and Zuffrey, N. Solution methods for a scheduling problem with incompability and precedence constraints. Algorithmic Operations Research 5 (2010) 75-85. Michalak, T. [see: Krysta, P.] de Mier, A. [see: Goodall, A. J.] Miguel, I. [see: Grayland, A.] Mihalak, M. [see: Fomin, F. V.] Milanič, M. [see: Lozin, V. V. ] Miltersen, P. B. [see: Hansen, K. A.] Minh, H. N. [see: Duchamp, G.H.E.] Mitchell, J. D. [see: Darji, U.] Miyazaki, S. [see: Inoshita, T.] Mladenović, N. [see: Brimberg, J., Čangalović, M., Consoli, S., Crévits, I., Grujicić, I., Hanafi, S., Hansen, P. ] Mladenović, N., Radulović, J., Tintor, V. and Urošević, D. Variable neighbourhood search for resolving RWA problem in optical WDM networks. Submitted. Mnich, M. [see: Gutin, G., Kang, R. J.] Moffatt, I. [see: Huggett, S.] Mohanaraj, V. [see: Cooper, C., Dyer, M. E.] Mohar, B. [see: Kawarabayashi, K.] Möller, R. [see: Gray, R.] Mönch, C. [see: Dereich, S.] Monien, T. [see: Gairing, M.] Montanaro, A. A new exponential separation between quantum and classical one-way communication complexity. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1007/1007.3587v2.pdf Montanaro, A. [see: Arthur, D.] Montemanni, R. and Smith, D. H. A new table of permutation codes. Submitted. Montemanni, R. [see: Aboluion, N.] Moore, A. W. [see: Fay, D.] Moreno, J. [see: Consoli, S.] Morris, R. D. [see: Alon, N., Balogh, J.] Mörters, P. [see: Dereich, S., Doku-Amponsah, K.] Mortier, R. [see: Fay, D.] Moulton, V. and Steel, M. The `Butterfly effect' in Cayley graphs, and its relevance for evolutionary genomics. Preprint. http://de.arxiv.org/PS_cache/arxiv/pdf/1104/1104.5044v1.pdf Moulton, V. [see: Dress, A., Herrmann, S., Huber, K. T.] Mubayi, D. [see : Keevash, P.] Muetze, T. [see: Hefetz, D.] Mullan, C. [see: Blackburn, S. R.] Müller, H. and Urner, R. On a disparity between relative cliquewidth and relative NLC-width. Discrete Appl. Math. 158 (2010) 828-840. http://dx.doi.org/10.1016/j.dam.2009.06.024 Müller, H. [see: Dąbrowski, K.] Müller, P. [see: Bohn, A.] Müller, T. [see: Addario-Berry, L., Balogh, J., Kang, R. J., McDiarmid, C. J. H.] Müller, T. W. [see: Cameron, P. J., Dress, A., Krattenhaler, C.] Murray, S. H. and Roney-Dougal, C. M. Constructive homomorphisms for classical groups. J. Symb. Comput., 46 (2011) 371-384. http://dx.doi.org/10.1016/j.jsc.2010.09.003 http://www-circa.mcs.st-and.ac.uk/Preprints/submitted_spinor.pdf Mwesigye, F. and Truss, J. K. Countably categorical coloured linear orders. Math Log. Q. 56 (2010) 159-163 http://dx.doi.org/10.1002/malq.200910005 http://www.maths.leeds.ac.uk/Pure/staff/truss/feres1.pdf Mwesigye, F. and Truss, J. K. Classification of finite coloured linear orderings. Order, to appear. http://www.maths.leeds.ac.uk/Pure/staff/truss/feres2newest.pdf Mycroft, R. [see: Keevash, P., Kühn, D.] Myrvold, W. [see: Bowler, A.] Nagase, T. [see: Inoshita, T.] Nagel, L. [see: Berenbrink, P., Dantchev, S.] Newman, M. [see: Mayhew, D.] Ng, S.-L. [see: Blackburn, S. R.] Nikiforov, V. [see: Bollobás, B.] Nikolić, N. [see: Grujicić, I.] Nivasch, G. [see: Bukh, B.] Noble, S. D. [see: Chavez-Lomelí, L., Cheng, W., Eggemann, N., Goodall, A. J., Hansen, P., Merino, C.] Norine, S. [see: Hatami, H.] Noy, M. [see: Bernardi, O., Goodall, A. J.] O’Connell, N. Directed polymers and the quantum Toda lattice. Ann. Probab., to appear. http://arxiv.org/PS_cache/arxiv/pdf/0910/0910.0069v5.pdf Onsjö, M. [see: Coja-Oghlan, A.] Osborn, J. and Prellberg, T. Forcing Adsorption of a Tethered Polymer by Pulling. J. Stat. Mech. Theory Exp. (2010) P09018. http://www.maths.qmul.ac.uk/~tp/papers/pub073.pdf Ostafe, A. [see: Blackburn, S. R.] Ostaszewski, A. [see: Bingham, N. H.] Östergård, P. R. J. [see: Colbourn, C. J.] Osthus, D. [see: Christofides, D., Keevash, P., Kühn, D., Knox, F.] Ott, S. [see: Carré, I.] Owczarek, A. L. and Prellberg, T. Exact solution of the discrete (1+1)-dimensional RSOS model with field and surface interactions. J. Phys. A 43 (2010) 375004. http://www.maths.qmul.ac.uk/~tp/papers/pub076.pdf Owczarek, A. L. [see: Doukas, J.] Oxley, J., Semple, C., Warshauer, L. and Welsh, D. J. A. On properties of almost all matroids. Submitted. https://www.math.lsu.edu/~oxley/typicalmatroids10.pdf Pachon-Pinzon, A. Y. [see: Coja-Oghlan, A.] Paget, R. E. and Wildon, M. Set families and Foulkes modules. J. Algebr. Comb. , to appear. http://www.ma.rhul.ac.uk/~uvah099/Maths/FoulkesMinimals12.pdf Pál, A. [see: Károlyi, Gy.] Panagiotou, K. [see: Fountoulakis, N.] Pangrac, O. [see; Baier, G.] Panoui, A. [see:Blackburn, S. R.] Papadimitriou, C. [see: Goldberg, P. W.] Parsons, M. C. [see: Estrada, E., Grindrod, P.] Parviainen, R. [see: Dukes, W. M. B.] Patel, V. Determining Edge-Expansion and Other Connectivity Measures in Graphs of Bounded Genus. Journal version submitted. A preliminary version appeared in Lect. Notes Comput. Sci. 6346 (2010) 561-572. http://dx.doi.org/10.1007/978-3-642-15775-2_48 http://uk.arxiv.org/PS_cache/arxiv/pdf/1004/1004.4484v1.pdf Patel, V. [see: Bonsma, P., Johnson, M.] Paterson, K. G. [see: Albrecht, M.] Paterson, M. B. and Stinson, D. R. Yet another hat game. Electron. J. Comb. 17 (2010) R86. http://www.combinatorics.org/Volume_17/PDF/v17i1r86.pdf Paterson, M. B. [see: Blackburn, S. R., Martin, K. M.] Paterson, M. S. [see: Aziz, H.] Paulusma, D. [see: Biró, P., Broersma, H. J., Chalopin, J., Fiala, J., Golovach, P. A., van t Hof, P., Johnson, M., Kamiński, M.] Pauws, S. [see: Consoli, S.] Penev, I. [see: Chudnovsky, M.] Penrose, M. D. and Wade, A. R. Limit theorems for random spatial drainage networks. Adv. Appl. Probab. 42 (2010) 659-688. http://dx.doi.org/10.1239/aap/1282924058 http://arxiv.org/PS_cache/arxiv/pdf/0901/0901.3297v1.pdf Penrose, M. D. [see: Francheschetti, M.] Penson, K.A. [see: Blasiak, P.] Pepper, R. and Vaughan, E. R. [see: DeLaViña, E.] Peres, Y., Sinclair, A., Sousi, P. and Stauffer, A. Mobile Geometric Graphs: Detection, Coverage and Percolation. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1008/1008.0075v1.pdf Peres, Y. [see: Barlow, M. T., Levin, D.] Perkins, S., Phillips, L., Roach, P. A. and Smith, D. H. Sudoku puzzles as erasure correcting codes. J. Recreational Mathematics, in press. Perkins, S. [see: Aboluion, N., Davies, R. P, Hunt, F. H., Jones, S. K., Jones, R. A.] Perlstein, A. [see: Aharoni, R.] Person, Y. [see: Conlon, D.] Peyerimhoff, N. and Vdovina, A. Cayley graph expanders and groups of finite width. Submitted. http://www.staff.ncl.ac.uk/alina.vdovina/papers/Expanders.pdf Picot, E. [see: Carré, I.] Piguet, D. and Stein, M. An approximate version of the Loebl-Komlos-Sos conjecture. Submitted. Piguet, D. [see: Allen, P., Bodirsky, M., Böttcher, J., Hladký, J.] Pike, D. A. [see: Colbourn, C. J.] Pilpel, H. [see: Ellis, D.] Pinsker, M. [see: Bodirsky, M.] Pinto, D. [see: Jones, G. A.] Phillips, L., [see: Perkins, S.] Poghosyan A. and Zverovich V. Discrepancy and Signed Domination in Graphs and Hypergraphs. Discrete Math. 310 (2010) 2091-2099. http://dx.doi.org/10.1016/j.disc.2010.03.030 http://arxiv.org/PS_cache/arxiv/pdf/0906/0906.3993v1.pdf Poghosyan A. and Zverovich V. On Roman, Global and Restrained Domination in Graphs. Graphs. Comb., to appear. http://arxiv.org/PS_cache/arxiv/pdf/0901/0901.2862v2.pdf Poghosyan, A. [see:Gagarin, A.] Poinsot, L. [see: Blasiak, P.] Pokrovskiy, A. Growth of graph powers. Electron J. Comb. 18 (2011) P88. http://www.combinatorics.org/Volume_18/PDF/v18i1p88.pdf Popa, A. [see: Adamaszek, A., Clifford, R.] Post, G. [see: Briskorn, D.] Potočnik, P. [see: Conder, M. E.] Pottonen, O. [see: Colbourn, C. J.] Poulton, A. [see: Jones, G. A.] Praeger, C. E. [see: Bamberg, J., Gray, R., Liebeck, M. W.] Preece, D. A. and Vaughan, E. R. Daisy chains with four generators, Australas. J. Comb. 49 (2011) 77-93. Preece, D. A. [see: Ahmed, A., Cameron, P. J.] Prellberg, T. [see: Bastian, J., Doukas, J., Osborn, J., Owczarek, A. L.] Pretorius, L. M. and Swanepoel, K. J. Embedding a Latin square with transversal into a projective space. J. Comb. Theory Ser. A 118 (2011) 1674-1683. http://dx.doi.org/10.1016/j.jcta.2011.01.013 http://arxiv.org/PS_cache/arxiv/pdf/1005/1005.3460v1.pdf Pritchard, D. [see: Bollobás, B.] Psomas, C. [see; Archdeacon, D.] Pyatkin, A. [see: Bonsma, P., Halldórsson, M. M., Kitaev, S.] Pymar, R. [see: Berestycki, N.] Quick, M. R. and Ruškuc, N. Growth of generating sets for direct powers of classical algebraic structures. J. Aust. Math. Soc. 89 (2010) 105-126. http://dx.doi.org/10.1017/S1446788710001473 http://journals.cambridge.org/download.php?file=%2FJAZ%2FJAZ89_01%2FS1446 788710001473a.pdf&code=9fd56accc9e031e6d298f403f4d38dc7 Räcke, H. [see: Adamaszek, A., Chawla, S., Englert, M., Fanghänel, A.] Rackham, T. J. The complexity of changing colourings with bounded maximum degree. Inf. Process. Lett. 110 (2010) 735-739. http://dx.doi.org/10.1016/j.ipl.2010.05.026 Rackham, T. J. The Number of Defective Colorings of Graphs on Surfaces. J. Graph Theory, to appear. Radovanović, M. and Vušković, K. A class of three-colorable triangle-free graphs. Submitted to J. Graph Theory. http://www.comp.leeds.ac.uk/vuskovi/t3pcfree.pdf Radulović, J. [see: Mladenović, N.] Radzik, T. [see: Abdullah, M., Berenbrink, P., Cooper, C.] Rafiey, A. [see: Gupta, A.] Ragnarsson, K. [see: Claesson, A.] Rakić, M. [see: Hefetz, D.] Raman, R. [see: Canzar, S., Dąbrowski, K.] Ramírez-Ibañez, M. [see: Chavez-Lomelí, L., Merino, C.] Randall, D. [see: Cryan, M.] Ratsaby, J. [see: Anthony, M.] Rattan, A. [see: Kemp, T.] Rautenbach, D. [see: Dąbrowski, K.] Razbarov, A. A. [see: Hatami, H.] Reed, B. [see: Loebl, M.] Rees, S. E. [see: Holt, D. F.] Reifegerste, A. [see: Dukes, W. M. B.] Reinert, G. and Röllin, A. Random subgraph counts and U-statistics: multivariate normal approximation via exchangeable pairs and embedding. J. Appl. Probab. 47 (2010) 378-393. http://dx.doi.org/10.1239/jap/1276784898 http://arxiv.org/PS_cache/arxiv/pdf/0912/0912.3425v1.pdf Reinert, G. [see: Barbour, A. D.] Reitzner, M. [see: Bárány, I.] Remeslennikov, V. N. [see: Duncan, A. J.] Remmel, J. [see: Dukes, W. M. B., Kitaev, S.] Ricci-Tersenghi, F. [see: Achlioptas, D.] Richerby, D. [see: Bulatov, A., Dyer, M. E.] Richomme, G., Saari, K. and Zamboni, L. Q. Abelian Complexity in Minimal Subshifts. J. Lond. Math. Soc. 83 (2011) 79-95. http://dx.doi.org/10.1112/jlms/jdq063 http://arxiv.org/PS_cache/arxiv/pdf/0911/0911.2914v1.pdf Richomme, G., Saari, K. and Zamboni, L. Q. Balance and Abelian Complexity of the Tribonacci Word. Adv. Appl. Math. 45 (2010) 212-231. http://dx.doi.org/10.1016/j.aam.2010.01.006 http://arxiv.org/PS_cache/arxiv/pdf/0904/0904.2872v2.pdf Richomme, G., Saari, K. and Zamboni, L. Q. Standard Factors of Sturmian Words. RAIRO-Theor. Inform. Appl. 44 (2010) 159-174. http://dx.doi.org/10.1051/ita/2010011 http://combinatorics.cis.strath.ac.uk/download/RichSaarZam.pdf Richomme, G. [see: Cassaigne, J.] Richter, R. B. [see: Griggs, T. S.] Ries, B. [see: Birand, B., Dąbrowski, K.,Ekim, T., Meuwly, F.-X.] Riet, A.-E. [see: Füredi, Z.] Riis, S. [see: Gadouleau, M.] Rio, M. [see: Fay, D.] Riordan, O. M. The phase transition in the configuration model. Preprint. http://de.arxiv.org/PS_cache/arxiv/pdf/1104/1104.0613v1.pdf Riordan, O. M. and Warnke, L. Achlioptas process phase transitions are continuous. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1102/1102.5306v2.pdf Riordan, O. M. and Wormald, N. C. The diameter of sparse random graphs. Comb. Probab. Comput. 19 (2010) 835-926. http://dx.doi.org/10.1017/S0963548310000325 http://arxiv.org/PS_cache/arxiv/pdf/0808/0808.4067v3.pdf Riordan, O. M. [see: Bollobás, B., Janson, S.] Roach, P. A. [see: Davies, R. P., Jones, S. K., Perkins, S.] Robertson, A. G. [see: King, O. H.] Roche-Newton, O. An improved sum-product estimate for finite fields. Submitted. http://arxiv.org/PS_cache/arxiv/pdf/1101/1101.5348v1.pdf Roche-Newton, O. [see: Iosevich, A.] Rödl, V. [see: Kohayakawa, Y.] Röllin, A. [see: Reinert, G.] Ron, D. [see: Czumaj, A.] Roney-Dougal, C. M. [see: Grayland, A., Holt, D. F., Murray, S. H.] van Rooij, J. M. M. [see: van 't Hof, P.] Rosoman, T. [see: Francheschetti, M.] Rottvoss, T. [see: Bollobás, B.] Röver, C.E. [see: Holt, D. F.] Rowley, P. J. [see: Leemans, D. ] Rowlinson P. On induced matchings as star complements in regular graphs. Journal of Mathematical Sciences, to appear. Rowlinson P. On eigenvalue multiplicity and the girth of a graph. Linear Algebra Appl., to appear. Rowlinson, P. [see: Cardoso, D. M.] Royle, G. F. [see; Gray, R.] Rubey, M. [see: Bastian, J.] Rudd, J. D. Tutte polynomials for counting and classifying orbits. Discrete Math. 310 (2010), 206-222 http://dx.doi.org/10.1016/j.disc.2008.09.010 Rudnev, M. An improved sum-product inequality in fields of prime order. Submitted. http://arxiv.org/PS_cache/arxiv/pdf/1011/1011.2738v1.pdf Rudnev, M. [see: Helfgott, H. A., Iosevich, A.] Ruškuc, N. [see: Albert, M. H., Atkinson, M. D., Brignall, R. Gray, R., Linton, S. A., Quick, M. R.] Russell, P. A. [see: Leader, I. B.] Rutherford, C. G. [see: Banaji, M.] Ruzsa, I. Z. [see: Crowston, R.] Rybarczyk, K. and Stark, D. S. Poisson approximation of the number of cliques in random intersection graphs. J. Appl. Probab. 47 (2010) 826-840. http://dx.doi.org/10.1239/jap/1285335412 Saari, K. [see: Cassaigne, J., Richomme, G.] Sach, B. [see: Arthur, D.] Sadakane, K. [see: Czyzowicz, J.] Salas, J. and Sokal, A.D. Transfer matrices and partition-function zeros for antiferromagnetic Potts models. VI. Square lattice with special boundary conditions.Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1002/1002.3761v1.pdf Saluz, A. [see: Hefetz, D.] Sanders, T. W. On a non-abelian Balog-Szemerédi-type lemma. J. Aust. Math. Soc. 89 (2010) 127- 132. http://dx.doi.org/10.1017/S1446788710000236 http://arxiv.org/PS_cache/arxiv/pdf/0912/0912.0306v2.pdf Sanders, T. W. A Quantitative Version of the Non-Abelian Idempotent Theorem6. Geom. Funct. Anal. 21 (2010) 141-221. http://dx.doi.org/10.1007/s00039-010-0107-2 http://arxiv.org/PS_cache/arxiv/pdf/0912/0912.0308v1.pdf Sanders, T. W.
6 This paper formerly was known as “Indicator functions in the Fourier-Eymard algebra”. Chowla's cosine problem. Isr. J. Math. 179 (2010) 1–28. http://dx.doi.org/10.1007/s11856-010-0071-4 http://arxiv.org/PS_cache/arxiv/pdf/0807/0807.5104v2.pdf Sanders, T. W. Popular difference sets. Online J. Anal. Comb. 5 (2010), Art. 5, 4 pp. http://arxiv.org/PS_cache/arxiv/pdf/0807/0807.5106v2.pdf Sanders. T. W. On a non-abelian Balog-Szemerédi-type lemma. J. Aust. Math. Soc. 89 (2010) 127–132. http://dx.doi.org/10.1017/S1446788710000236 http://arxiv.org/PS_cache/arxiv/pdf/0912/0912.0306v2.pdf Sanders, T. W. Structure in sets with logarithmic doubling. Can. Math. Bull., to appear. http://arxiv.org/PS_cache/arxiv/pdf/1002/1002.1552v2.pdf Sanders, T. W. Green's sumset problem at density one half. Submitted. Acta Arith. 146 (2011) 91–101. http://dx.doi.org/10.4064/aa146-1-6 http://arxiv.org/PS_cache/arxiv/pdf/1003/1003.5649v2.pdf Sanders, T. W. On certain other sets of integers. J. Anal. Math., to appear. http://arxiv.org/PS_cache/arxiv/pdf/1007/1007.5444v2.pdf Sanders, T. W. On Roth's theorem on progressions. Ann. Math., to appear. http://arxiv.org/PS_cache/arxiv/pdf/1011/1011.0104v2.pdf Sanders, T. W. On the Bogolyubov-Ruzsa lemma. Submitted. http://arxiv.org/PS_cache/arxiv/pdf/1011/1011.0107v1.pdf Sandholm T. [see: Krysta, P.] Sanusi, S. O. [see: Jones, R.A.] Sauerwald, T. [see: Berenbrink, P., Friedrich, T.] Saurabh, S. [see: Cohen, N., Fomin, F. V.] Savani, R. [see: Goldberg, P. W.] Saxl, J. [see: Bamberg, J., Fulman, J., Liebeck, M. W.] Saxton, D. Strictly monotonic multidimensional sequences and stable sets in pillage games. J. Comb. Theory Ser. A 118 (2011) 510-524. http://dx.doi.org/10.1016/j.jcta.2010.07.003 http://uk.arxiv.org/PS_cache/arxiv/pdf/1004/1004.0433v1.pdf Schacht, M. [see: Conlon, D., Kohayakawa, Y.] Schauz, U. [see: Hladký, J.] Schiermeyer, I. [see: Henning, M. A.] Schilling, H. [see: Baier, G.] Schlotter, I. [see: Biró, P.] Schmidt, P. [see: Foss, S.] Schramm, O. [see: Berestycki, N.] Schroll, S. [see: Marsh, R. J.] Schulte, E. [see: Breda d’Avezeda, A. ] Schwartz, J. [see : Hefetz, D.] Scott, A. D. Szemerédi’s Regularity Lemma for matrices and sparse graphs. Comb. Probab. Comput., 20 (2011) 455-466. http://dx.doi.org/10.1017/S0963548310000490 http://people.maths.ox.ac.uk/scott/Papers/sparseregularity.pdf Scott, A. D. and Sorkin, G. Structure of random r-SAT below the pure literal threshold. Submitted. http://people.maths.ox.ac.uk/scott/Papers/unsat.pdf Scott, A. D. and White, M. Monochromatic cycles and the monochromatic circumference in 2-coloured graphs Submitted. http://people.maths.ox.ac.uk/scott/Papers/monocycles.pdf Scott, A. D. [see: Berger, E., Bollobás, B, Chudnovsky, M., Fey, M., Loebl, M., Meeks, K. ] Seidel, D. [see: Jenkinson, T.] Semple, C. [see: Oxley, J. G.] Sereni, J.-S. [see: Kang, R. J.] Seshadhri, C. [see: Czumaj, A.] Severini, S. [see: Duan, R.] Seymour, P. D. [see: Berger, E., Birand, B., Chudnovsky, M. ] Shabtay, D. [see: Deineko, V. G.] Shalom, S., Wong P. H. and Zaks, S. Optimal On-line Colorings for Minimizing the Number of ADMs in Optical Networks. J. Discrete Algorithms 8 (2010) 174-188. http://www.csc.liv.ac.uk/~pwong/publications/jda2009.pdf Shahnaz, A. [see: Erlebach, T.] Shank, R. J. [see: Campbell, H. E. A.] Shapira, A. [see: Czumaj, A.] Shaw, R. Trivectors yielding spreads in PG(5,2). J. Geom. 96 (2010) 149-165. http://dx.doi.org/10.1007/s00022-010-0030-6 http://www.hull.ac.uk/php/masrs/2010/2070.pdf Shaw, R. [see: Draisma, J., Gordon, N. A.] Shen, Y.-S. [see: Keller, M. T.] Shparlinski, I. [see: Blackburn, S. R.] Šiagiová, J. [see: Macbeth, H.] Siemons, I. J. and Smith, D. Homology representations of GL(n,q) from Grassmannians in cross-characteristics. http://arxiv.org/PS_cache/arxiv/pdf/1101/1101.5064v2.pdf Siemons, I. J. [see: Dalla Volta, F.] Simonovits, M. [see: Balogh, J., Łuczak, T] Simonyi, G. [see; Brightwell, G. R.] Sinclair, A. [see: Peres, Y.] Sipma, F. [see: Esperet, L.] Širáň, J. Non-orientable regular maps of a given type over linear fractional groups. Graphs. Comb. 26 (2010) 597-602. http://dx.doi.org/10.1007/s00373-010-0935-8 http://www.springerlink.com/content/e30668g73462861q/fulltext.pdf Širáň, J. [see: Conder, M. E., Griggs, T. S., Macbeth. H.] Sisask, O. [see: Candela, P., Croote, E.] Skokan, J. [see: Allen, P., Kohayakawa, Y., Łuczak, T.] Škoviera, M. [see: Grannell, M. J.] Skutella, M. [see: Baier, G.] Smith, D. [see: Siemons, I. J.] Smith, D. H. [see: Aboluion, N., Hunt, F. H., Jones, R. A., Montemanni, R.] Smith, R. [see: Albert, M. H., Atkinson, M. D.] Smyth, C. [see: Kemp, T.] Sohler, C. [see: Czumaj, A.] Soicher, L. H. More on block intersection polynomials and new applications to graphs and block designs. J. Comb. Theory Ser. A., 117 (2010) http://dx.doi.org/10.1016/j.jcta.2010.03.005 http://www.maths.qmul.ac.uk/~leonard/nbip2_v2.pdf Soicher, L. H. On generalised t-designs and their parameters. Discrete Math., in press. http://dx.doi.org/10.1016/j.disc.2010.08.002 http://www.maths.qmul.ac.uk/~leonard/gendesparams.pdf Soicher, L. H. Uniform semi-Latin squares and their Schur-optimality. Submitted. http://www.maths.qmul.ac.uk/~leonard/optimalsls_v3.pdf Sokal, A. D. [see: Jackson, B., Salas, J.] Soleimanfallah, A. and Yeo, A. A kernel of order 2k-c for Vertex Cover. Discrete Math. 311 (2011) 892-895. http://dx.doi.org/10.1016/j.disc.2011.02.014 Solomon, A.I. [see: Blasiak, P., Duchamp, G. H. E.] Solymosi, J. [see: Bárány, I.] Song, J. [see: Broersma, H. J. ] Sørensen, T. B. [see: Goldberg, P. W., Hansen, K. A.] Sorkin, G. [see: Scott, A. D.] Sousi, P. [see: Barlow, M. T., Peres, Y.] Southwell, R. [see: Jordan, J.] Spencer, C. L. [see: Hilton, A. J. W.] Spencer, J. H. [see: van der Hofstad, R.] Spillner, A. [see: Dress, A., Huber, K. T] Spirakis, P. [see: Efthymiou, C.] Sprüssel, P. [see: Aharoni, R., Bonato, A., Bruhn, H., Diestel, R.] Stark, D. S. The asymptotic number of spanning forests of complete bipartite graphs. Preprint. Stark, D. S. [see: Arratia, R., Gauci, J.-B., Granovsky, B., Rybarczyk, K.] Stauffer, A. [see: Peres, Y.] Steel, M. [see: Dress, A., Moulton, V.] Steger, A. [see: Gerke, S.] Stehlik, M. [see: Kang, R. J.] Stein, M. [see: Piguet, D. ] Steiner, G. [see: Deineko, V. G.] Steingrímsson, E. and Tenner, B. E. The Möbius Function of the Permutation Pattern Poset. J. Comb. 1 (2010) 39–52 http://math.depaul.edu/bridget/MOBIUS-PP.pdf Steingrímsson, E. [see: Bernini, A., Burstein, A., Claesson, A., Dukes, W. M. B.] von Stengel, B. [see: Avis, D.] Stewart, I. A. A general algorithm for detecting faults under the comparison diagnosis model, Proceedings of 24th IEEE International Parallel and Distributed Processing Symposium, IPDPS'10, Atlanta, Georgia, USA, April 19-23, 2010, IEEE Computer Society Press, pages 1-9. http://dx.doi.org/10.1109/IPDPS.2010.5470369 http://www.dur.ac.uk/i.a.stewart/Abstracts/ComparisonDiagnosis.htm Stewart, I. A. Hamiltonicity in generalised biswapped networks. Submitted. http://www.dur.ac.uk/i.a.stewart/Papers/HamInGenBiswappedNets.pdf Stewart, I. A. Generalised biswapped networks and their topological and algorithmic properties. Submitted. http://www.dur.ac.uk/i.a.stewart/Papers/GenBiswapped.pdf Stewart, I. A. Hamiltonian cycles through prescribed edges in k-ary n-cubes. Stewart, I. A. and Xiang, Y. Augmented k-ary n-cubes. Inf. Sci. 181 (2011) 239-256. http://dx.doi.org/10.1016/j.ins.2010.09.005 http://www.dur.ac.uk/i.a.stewart/Abstracts/Augkaryncubes.htm Stewart, I. A. and Xiang, Y. Bipancyclicity in k-ary n-cubes with faulty edges under a conditional fault assumption. IEEE Transactions on Parallel and Distributed Systems, to appear. http://www.dur.ac.uk/i.a.stewart/Papers/Bipancyckaryncubesundercfa.pdf Stewart, I. A. and Xiang, Y. A multipath analysis of biswapped networks. The Computer Journal, to appear. http://dx.doi.org/10.1093/comjnl/BXQ083 http://www.dur.ac.uk/i.a.stewart/Papers/MultipathBiswappedNetworks.pdf Stewart, I. A. [see: Gate, J., Hsu, H.-C.] Stiebitz, M. [see: Kostochka, A. V.] Stinson, D. R. [see: Blackburn, S. R., Martin, K. M., Paterson, M. B.] Stojaković, M. [see: Hefetz, D.] Strauss, D. [see: Hindman, N.] Streib, N. [see: Keller, M. T.] Stump, C. [see: Bastian, J.] Subasi, E. [see: Anthony, M.] Subasi, M. [see: Anthony, M.] Suchecki, R. [see: Huber, K. T.] Suchy, O. [see: Golovach, P. A.] Sudakov, B. [see: Conlon, D., Ellis, D., Keevash, P.] Sung, W.-K. [see: Czyzowicz, J.] Swanepoel, K. J. and Valtr, P. Large convexly independent subsets of Minkowski sums. Electron. J. Comb. 17 (2010) R146. http://www.combinatorics.org/Volume_17/PDF/v17i1r146.pdf Swanepoel, K. J. [see: Csikós, B., Pretorius, L. M.] Szeider, S. [see: Alon, N., Broersma, H. J., Gutin, G., van 't Hof, P.] Talbot, J. M. [see: Baber, R.] Talgam-Cohen, I. [see: Englert, M.] Talwar, K. [see: Englert, M.] Tan, T. S. The brush number of the 2-dimensional torus. Preprint. http://www.arxiv.com/PS_cache/arxiv/pdf/1012/1012.4634v1.pdf Tao, T. C. [see: Breuillard, E., Green, B. J.] Taylor, G. Cyclotomic matrices and graphs over the ring of integers of some imaginary quadratic fields. J. Algebra 331 (2011) 523-545. http://dx.doi.org/10.1016/j.jalgebra.2011.02.009 Taylor, A. [see: Crofts, J. J., Higham, D. J.] Tazari, S. [see: Kreutzer, S.] Tenner, B. E. [see: Claesson, A., Steingrimsson, E.] Tesson, P. [see: Egri, L.] Thatte, B. Reconstructing pedigrees: some identifiability questions for a recombination-mutation model. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1008/1008.0153v2.pdf Thilikos, D. M. [see: Fomin, F. V., Golovach, P. A., van 't Hof, P., Kamiński, M.] Thomason, A. G. [see: Böhme, T., Fay, D., Loebl, M., Łuczak, T., Marchant, E., Markström, K.] Thomassé, S. [see: Berger, E., Loebl, M.] Thompson, J. [see: Lewis, R.] Thurley, M. [see: Goldberg, L. A.] Tiep, P. H. [see: Fulman, J. ] Tintor, V. [see: Mladenović, N.] Tiskin, A. Towards approximate matching in compressed strings: Local subsequence recognition. To appear in Proceedings of CSR. Lect. Notes Comput. Sci. 6651 (2011) 401—414, Tiskin, A. Parallel selection by regular sampling. In Proceedings of Euro-Par, Part II. Lect. Notes Comput. Sci. 6272 (2010) 393—399. http://dx.doi.org/10.1007/978-3-642-15291-7_36 http://www.springerlink.com/content/54662p5237402062/fulltext.pdf Tiskin, A. Fast distance multiplication of unit-Monge matrices. In Proceedings of ACM-SIAM SODA, pp. 1287—1296, 2010. http://eprints.dcs.warwick.ac.uk/428/1/SODA10_103_tiskina.pdf Tiskin, A. [see: Carré, I., Deineko, V. G., Korpelainen, N., Krusche, P.] Tóth, A. [see; Brightwell, G. R.] Tran, H. T. T. [see: Hefetz, D.] Treglown, A. A note on some embedding problems for oriented graphs. J. Graph Theory, to appear. http://dx.doi.org/10.1002/jgt.20586 http://web.mat.bham.ac.uk/~treglowa/orientednote.ps Treglown, A. [see: Kühn, D.] Tripodi, A. [see: Grannell, M. J.] Trotignon, N. and Vušković, K. On Roussel and Rubio type lemmas and their consequences. Discrete Math. 311 (2011) 684-687. http://dx.doi.org/10.1016/j.disc.2011.01.013 http://www.comp.leeds.ac.uk/vuskovi/weaklyChordal-submitted.ps Trotignon, N. and Vušković, K. Combinatorial optimization with 2-joins. J. Comb. Theory Ser. B., to appear. http://www.comp.leeds.ac.uk/vuskovi/2-join-submitted.pdf Trotignon, N. [see: Charbit, P., Chudnovsky, M.] Trotter, W. T. [see: Biró, Cs., Keller, M. T.] Trunck, T. [see: Johnson, M.] Truss, J. K. [see: Amato, D., Droste, M., Jenkinson, T., Lovell, S., Mwesigye, F.] Tsai, C.-H. [see: Hsu, H.-C.] Tsimerman, J. [see: Bukh, B.] Tyomkyn, M. A note on the abelian sandpile in Zd. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1102/1102.4470v1.pdf Tyomkyn, M. An improved bound for the Manickam-Miklós-Singhi conjecture. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1011/1011.2803v1.pdf Tyomkyn, M. and Uzzell, A. Distances in graphs. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1011/1011.2450v1.pdf Tyomkyn, M. [see: Füredi, Z.] Uehara, R. [see: Cooper, C.] Ueltschi, D. [see; Betz, V., Ercolani, N.] Uhlig, S. [see: Fay, D.] Upadhyay, J. [see: Blackburn, S. R.] Urner, R. [see: Müller, H.] Urošević, D. [see: Hanafi, S., Mladenović, N.] Valtr, P. [see: Bárány, I., Swanepoel, K. J.] Vass, J. K. [see: Higham, D. J.] Vatter, V. [see: Albert, M. H., Brignall, R., Linton, S. A.] Vaughan, E. R. An Asymptotic Version of the Multigraph 1-Factorization Conjecture. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1010/1010.5192v1.pdf Vaughan, E. R. [see: Courtiel, J., DeLaViña, E., Preece, D. A.] Vdovina, A. [see: Peyerimhoff, N.] Velenik, Y. [see: Betz, V.] Verrill, H. A. [see: Jarvis, A. F.] Vetrik, T. [see: Macbeth, H.] Vicari, E. [see: Fomin, F. V.] Vígh, V. [see: Bárány, I.] Vilenchik, D. [see: Coja-Oghlan, A.] Villarroel, R. [see: Merino, C.] Vöcking, B. [see: Czumaj, A.] Voliotis, N. [see: Cohen, N.] Volkov, S. [see: Crane, E.] Vušković, K. Even-hole free graphs: a survey. Appl. Anal. Discrete Math. 4 (2010) 219-240. http://www.comp.leeds.ac.uk/vuskovi/ehfsurvey.ps Vušković, K. [see: Charbit, P., Radovanović, M., Trotignon, N.] Wade, A. R. [see: Crane, E.. Penrose, M. D.] Wagner, P. [see: Markström, K.] Walters, M. J. Small components in k-nearest neighbour graphs. Preprint. http://arxiv.org/PS_cache/arxiv/pdf/1101/1101.2619v1.pdf Walters, M. J. [see: Balogh, J., Bollobás, B., Falgas-Rouvry, V., Leader, I. B.] Wanless, I. M. [see: Danziger, P.] Ward, A. A. [see: Edwards, K. J.] Warnke, L. The Cℓ -free process. Submitted. http://arxiv.org/PS_cache/arxiv/pdf/1101/1101.0693v1.pdf Warnke, L. When does the K4-free process stop? Submitted. http://arxiv.org/PS_cache/arxiv/pdf/1007/1007.3037v2.pdf Warnke, L. [see: Riordan, O. M.] Warshauer, L. [see: Oxley, J. G.] Watanabe, O. [see: Coja-Oghlan, A.] Waters, R. J. [see: Crane, E.] Waton, S. [see: Albert, M. H.] Watts, I. [see: Holroyd, F. C.] Webb, B. S. [see: Danziger, P.] Wehlau, D. L. [see: Campbell, H. E. A.] Welsh, D. J. A. [see: Bernardi, O., Mayhew, D., Oxley, J. G.] de Werra, D. [see: Ekim, T. ] West, J. [see: Albert, M. H.] White, M. [see: Scott, A. D.] Whittle, G. [see: Mayhew, D.] Widmayer, P. [see: Fomin, F. V.] Wilbaut, C. [see: Crévits, I.] Wildon, M. Knights, Spies, Games and Ballot Sequences. Discrete Math. 310 (2010) 2974-2983. http://dx.doi.org/10.1016/j.disc.2010.07.005 http://uk.arxiv.org/PS_cache/arxiv/pdf/0903/0903.2869v1.pdf Wildon, M. [see: Paget, R. E.] Willsky, A. [see: Anandkumar, A.] Wilson, R. A. [see: Burness, T. C.] Wilson, R. J. Introduction to Graph Theory, 5th edition, Prentice-Hall, 2010. ISBN-13: 9780273728894. http://catalogue.pearsoned.co.uk/educator/product//027372889X.page Wilson, R. J. [see: Beineke, L. W.] Winter, A. [see: Duan, R.] Woeginger, G. J. [see: Deineko, V. G.] Wolf, J. [see: Gowers, W. T.] Wong, P. W. H. [see: Shalom, M.] Woodall, D. R. The independence number of an edge-chromatic critical graph. J. Graph Theory 66 (2011) 98-103. http://dx.doi.org/10.1002/jgt.20493 Woodall, D. R. Defective choosability of graphs in surfaces. Discuss. Math. Graph Theory, to appear. Woodall, D. R. [see: Kostochka, A. V. ] Wooldridge, M. [see: Krysta, P.] Wormald, N. C. [see: Gerke, S., Riordan, O. M.] Wu, T. [see: Cameron, P. J., Dress, A.] Xia, D. [see : Chen, B.] Xiang, Y. [see: Stewart, I. A.] Yeo, A. [see: Alon, N., Bang-Jensen, J., Cohen, N., Gutin, G., Haynes, T. W., Henning, M. A., Soleimanfallah, A.] Yildiz, V. [see: Cameron, P. J.] Young, S. J. [see: Biró, Cs., Keller, M. T.] Yu, X. [see: Bilinski, M.] Zaks, S. [see: Shalom, M.] Zamboni, L. Q. [see: Cassaigne, J., de Luca, A., Richomme, G.] Zeitouni, O. [see: Berestycki, N.] Ziegler, T. [see: Green, B. J.] Zito, M. [see: Coenen, F.] Zuffrey, N. [see: Meuwly, F.-X.] Zussman, G. [see: Birand, B.] Zverovich, V. [see: Gagarin, A.. Poghosyan, A. ] Zwols, Y. [see: Birand, B.]
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. Comput. Logic – ACM Transactions on Computation and Logic ACM Trans. Comput. Theory – ACM Transactions on Computation Theory Acta Arith. – Acta Arithmetica Acta. Inf – Acta Informatica Acta Math. Appl. Sin., Engl. Ser. - Acta Mathematicae Applicatae Sinica (English Series) 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 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. Anal. PDE. - Analysis and PDE Ann. Appl. Probab. – Annals of Applied Probability Ann. Comb. – Annals of Combinatorics Ann. Math. – Annals of Mathematics Ann. Math. Artif. Intell. - Annals of Mathematics and Artificial Intelligence. Ann. Probab. – Annals of Probability Appl. Anal. Discrete Math. – Applicable Analysis and Discrete Mathematics Appl. Math. Lett. – Applied Mathematics Letters Arch. Math. Logic – Archive for Mathematical Logic Arch. Math. – Archiv der Mathematik Australas. J. Comb. – Australasian Journal of Combinatorics. Ars. Comb. – Ars Combinatorica. 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 Can. J. Math. - Canadian Journal of Mathematics. Combinatorica – Combinatorica Comb. Probab. Comput. – Combinatorics, Probability and Computing. Commentat. Math. Univ. Carol. - Commentationes Mathematicae Universitatis Carolinae. Commun. Algebra – Communications in Algebra Comput. Complexity – Computational Complexity. Comput. Oper. Res. – Computers & Operational Research. Congr. Numerantium - Congressus Numerantium Contemp. Math. – Contemporary Mathematics Contrib. Discrete Math. - Contributions to Discrete Mathematics Des. Codes. Cryptography – Designs, Codes and Cryptography Discrete Appl. Math. – Discrete Applied Mathematics. Discrete Comput. Geom. – Discrete & Computational Geometry Discrete Math. – Discrete Mathematics 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 Electron. Commun. Probab. – Electronic Communications in Probability Electron. J. Probab – Electronic Journal of Probability Electron. J. Comb. – The Electronic Journal of Combinatorics 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. Comb. – European Journal of Combinatorics Eur. J. Oper. Res. – European Journal of Operational Research Exp. Math. – Experimental Mathematics Finite Fields Appl. – Finite Fields and their Applications Forum. Math. – Forum Mathematicum Funct. Approximatio. – Functiones et Approximatio. Commentarii Mathematicii Fund. Math. – Fundamenta Mathematicae Fundam. Inform. – Fundamentae Informaticae Geom. Dedicata. - Geometriae Dedicata Geom. Funct. Anal. - Geometric and Functional Analysis Glasg. Math. J. - Glasgow Mathematical Journal Graphs Comb. – Graphs and Combinatorics Groups Geom. Dyn. - Groups, Geometry, and Dynamics IEEE Trans. Inf. Theory - IEEE Transactions on Information Theory. IMA J. Numer. Anal. - IMA Journal of Numerical Analysis Inf. Comput. – Information and Computation Inf. Process. Lett. - Information Processing Letters Inf. Sci – Information Sciences Innov. Incidence Geom.- Innovations in Incidence Geometry. Int. J. Algebra Comput. - International Journal of Algebra and Computation 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. 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. 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. Probab.- Journal of Applied Probability J. Aust. Math. Soc. - Journal of the Australian Mathematical Society J. Autom. Lang. Comb. - Journal of Automata, Languages and Combinatorics J. Classif. - Journal of Classification J. Comb – Journal of Combinatorics J. Comb. Math. Comb. Comput. - Journal of Combinatorial Mathematics and Combinatorial Computing J. Comb. Des. - Journal of Combinatorial Designs J. Comb. Optim. - Journal of Combinatorial Optimization J. Comb. Theory Ser. A/ B – Journal of Combinatorial Theory Series A (or B). J. Comput. Syst. Sci. - Journal of Computer and System Sciences J. Discrete Algorithms – Journal of Discrete Algorithms 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. Log. Comput. – Journal of Logic and Computation J. Lond. Math. Soc. – Journal of the London Mathematical Society J. Math. Cryptol. – Journal of Mathematical Cryptology J. Math. Sci – Journal of Mathematical Sciences J. Number Theory – Journal of Number Theory. J. Phys. A. Math. Theor. - Journal of Physics A: Mathematical and Theoretical 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. Symb. Log. – Journal of Symbolic Logic J. Symb. Comput. – Journal of Symbolic Computation 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 Mem. Am. Math. Soc. - Memoirs of the American Mathematical Society Mich. Math. J. – Michigan Mathematical Journal Monatsh. Math. - Monatshefte für Mathematik Networks – Networks Online J. Anal. Comb. - Online Journal of Analytic Combinatorics Oper. Res. Lett. - Operations Research Letters Order – Order Period. Math. Hung. - Periodica Mathematica Hungarica. Philos. Trans. R. Soc. Lond., A - Philosophical Transactions of the Royal Society of London A Phys. Rev. E – Physical Review E. Probab. Theory Relat. Fields - Probability Theory and Related Fields Proc. Am. Math. Soc. - Proceedings of the American Mathematical Society. Proc. Edinb. Math. Soc. - Proceedings of the Edinburgh Mathematical Society Proc. Lond. Math. Soc. – Proceedings of the London Mathematical Society Q. J. Math. Quarterly Journal of Mathematics Quasigroups Relat. Syst. - Quasigroups and Related Systems 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. Sémin. Lothar. Comb. - Séminaire Lotharingien de Combinatoire Siam J. Comput. – Society for Industrial and Applied Mathematics Journal on Computing SIAM J. Control Optim. – Society for Industrial and Applied Mathematics Journal on Control and Optimisation SIAM J. Discrete Math. - Society for Industrial and Applied Mathematics Journal on Discrete Mathematics Stochastic Processes Appl. – Stochastic Processes and their Applications Theor. Comput. Sci. – Theoretical Computer Science Theory Comput. Syst. – Theory of Computing Systems Topolog. Appl. – Topology and its Applications Trans. Am. Math. Soc. – Transactions of the American Mathematical Society Util. Math. – Utilitas Mathematica