I work at the Department of Electronics, Computing and Mathematics, and my office is at MS229, Markeaton Street (STEM Annex).
My office phone number is +44(0)1332591674.
I am Programme Leader for the BSc Mathematics Scheme.
I am Module Leader for:
- Patterns of Problem Solving (Level 4, Mathematics)
- Statistical Methods 1 (Level 4, Mathematics)
- Metric and Topological Spaces (Level 5, Mathematics)
- Graph Theory and Applications (Level 6, Mathematics)
- Networks and Algorithms (Level 7, MSc Computational Mathematics)
- Statistical Techniques (Level 7, MSc Big Data Analytics)
I am a trainer for student ambassadors and a supervisor for ca. 10 final year dissertations each year.
I am attendance monitoring representative for the college and co-chair for our biennial IMA conference in 'Theoretical and Computational Discrete Mathematics' (next held 14-15 September 2018).
I am moderator for our facebook group, Maths@Derby, and organiser of a semesterly Mathematics Quiz.
“Mathematics, rightly viewed, possesses not only truth, but supreme beauty—a beauty cold and austere, like that of sculpture, without appeal to any part of our weaker nature, without the gorgeous trappings of painting or music, yet sublimely pure, and capable of a stern perfection such as only the greatest art can show.”
- Bertrand Russell (1872-1970)
"The most shattering experience has been the realization that an exact solution of Einstein's equations of general relativity, discovered by the New Zealand mathematician, Roy Kerr, provides the absolutely exact representation of untold numbers of massive black holes that populate the universe. This shuddering before the beautiful, this incredible fact that a discovery motivated by a search after the beautiful in mathematics should find its exact replica in Nature, persuades me to say that beauty is that to which the human mind responds at its deepest and most profound."
- Subrahmanyan Chandrasekhar (1910-1995)
15. Linear Clique-Width for Hereditary Classes of Cographs
With R. Brignall and V. Vatter. Journal of Graph Theory, 84(4) (2017) p. 501.
14. Infinitely many minimal graph classes of unbounded clique-width
With A. Collins, J. Foniok, V. V. Lozin and V. Zamaraev. Discrete Applied Mathematics, In Press, available online 23 March 2017.
13. A New Graph Construction of Unbounded Clique-width
Electronic Notes in Discrete Mathematics, 56 (2016) p. 31.
12. Well-quasi-order for Graphs and Permutation Graphs Omitting a Path and a Clique
With A. Atminas, R. Brignall, V. V. Lozin and V. Vatter. Electronic Journal of Combinatorics, 22(2), (2015)
11. Dominating induced matchings in graphs without a skew star
With V. V. Lozin and C. Purcell. Journal of Discrete Algorithms, 26 (2014) p. 45.
10. Split Permutation Graphs
With V. V. Lozin and C. Mayhill. Graphs and Combinatorics, 30 (2014) p. 633.
9. Minimal Classes of Bipartite Graphs of Unbounded Clique-Width
With A. Atminas, R. Brignall and V. V. Lozin. (Extended abstract.)
8. Boundary properties of well-quasi-ordered sets of graphs
With V. V. Lozin and I. Razgon. Order 30 (2013), p. 723.
7. Two forbidden induced subgraphs and well-quasi-ordering
With V. V. Lozin. Discrete Mathematics 311 (2011) p. 521.
6. Bipartite induced subgraphs and well-quasi-ordering
With V. V. Lozin. Journal of Graph Theory, 67 (2011) p. 235.
5. Boundary properties of graphs for algorithmic graph problems
With V. V. Lozin, D. S. Malyshev and A. Tiskin. Theoretical Computer Science 412 (2011) p. 3545.
4. On the complexity of the dominating induced matching problem in hereditary classes of graphs
With D. M. Cardoso and V. V. Lozin. Discrete Applied Mathematics 159 (2011) p. 521.
3. Hamiltonian Cycles in Subcubic Graphs: What Makes the Problem Difficult
With V. V. Lozin and A. Tiskin. Lecture Notes in Computer Science 6108 (2010) p. 320.
2. Bipartite Graphs of Large Clique-Width
With V. V. Lozin. Lecture Notes in Computer Science 5874 (2009) p. 385.
1. A Polynomial-time Algorithm for the Dominating Induced Matching Problem in the Class of Convex Graphs
Electronic Notes in Discrete Mathematics 32 (2009) p. 133.