How to get published is one of the greatest challenges facing early career academics. Which thesis chapters would make for the best articles? Is it better to go for lots of articles or is there a value in publishing a book? Which journals and presses are most feasible, and which have the best reputations? Does it help your career to publish some of your ideas online as blogs or newspaper columns? Is there a danger of "over exposure"? And what makes for a good journal article or book proposal? Professor Nic Cheeseman will address all these questions and more in an interactive talk in which he will explain what editors are looking for and how you can maximise your chances of acceptance. He will also make time at the end of the session to discuss any remaining or more specific questions with students one to one.

Nic Cheeseman is Professor of Democracy at the University of Birmingham and was formerly the Director of the African Studies Centre at Oxford University. He is the recipient of the GIGA award for the best article in Comparative Area Studies (2013) and the Frank Cass Award for the best article in Democratization (2015). Professor Cheeseman is also the author or editor of ten books with five different presses including Oxford University Press, Cambridge University Press and Yale University Press - and is the co-editor of a new Book Series recently launched at OUP. In addition, he is a former editor of the journal African Affairs, the No. 1 journal in Area Studies (impact factor 2.577), and a regular reviewer for the American Political Science Review, the British Journal of Political Science, World Development, Democratization, and a number of other journals. Finally, Professor Cheeseman writes a regular column for Kenya's Daily Nation newspaper his analysis and insights have appeared in the Economist, Le Monde, Financial Times, Newsweek, the Washington Post, Wall St Journal, New York Times, New Yorker, Guardian, the Mail & Guardian and many more. In total, his columns and articles have been read over a million times.