Dr. Konrad Kazimierz Dąbrowski

Email: konrad.dabrowski at newcastle.ac.uk Address: School of Computing Urban Sciences Building Newcastle Helix 1 Science Newcastle upon Tyne NE4 5TG UK

I am a lecturer in the School of Computing at Newcastle University, where I am a member of the Educational Practice in Computing (EPiC) group.

My research interests focus on structural and algorithmic properties of discrete structures. I am particularly interested in graph structure and algorithms on graphs in restricted graph classes (from both a parameterized and non-parameterized point of view).

I completed my PhD in 2012, supervised by Prof. Vadim Lozin. After that, I worked for six months as a research associate supervised by Prof. Daniel Paulusma and Dr. George Mertzios, funded by EPSRC grant EP/G043434/1 "Algorithmic Aspects of Graph Coloring". I then worked for six months as a research associate supervised by Prof. M. Demange, funded by ANR grant TODO ANR 09-EMER-010 "Time Versus Optimality in Discrete Optimization". After that I worked as a research associate supervised by Prof. Daniel Paulusma and Prof. Iain Stewart, funded by EPSRC grant EP/K025090/1 "Detecting Induced Graph Patterns". After that I worked as a research associate supervised by Prof. Daniel Paulusma and Dr Matthew Johnson, funded by Leverhume Trust grant RPG-2016-258 "Efficient Graph Colouring Algorithms via Input Restrictions". After that, I worked as a teaching fellow. After that, I worked as a research fellow supervised by Dr Sebastian Ordyniak, funded by EPSRC grant EP/V00252X/1 "Next Generation of Algorithms for Mixed Integer Linear Programming (MILP)".

Teaching and Seminar Responsibilites

• In 2021-2022 I am lecturing the CSC8012: Software Development Techniques and Tools module.
• In 2021-2022 I am lecturing part of the CSC1035: Programming Portfolio 2 module.

Previously, at Durham:

• In 2020-2021 I taught Part 2 of the COMP1081 Algorithms and Data Structures module.
• In 2020-2021 I taught the Databases sub-module of the COMP1071 Computer Systems module.
• In 2018-2021 I taught the Systems Programming sub-module of the COMP221 Programming Paradigms module.
• In 2018-2020 I taught the Distributed Simulation Systems sub-module of the COMP4031 Computational Methodologies module.
• In 2018-2020 I taught the LSEPI (Legal, Social, Ethical and Professional Issues) sub-module of the COMP2252 Software Engineering module.
• In 2016-2017 I taught the LSEPI (Legal, Social, Ethical and Professional Issues) sub-module of the COMP2201 Group Project module.
• In 2015-2016 I taught part of the Algorithms and Complexity sub-module of the COMP2181 Theory of Computation module.
• In 2013-2015 I taught part of the Logic and Discrete Structures sub-module of the COMP1021 Mathematics for Computer Science module.
• I previously organized the ACiD Research Seminars and the Computer Science Junior Seminars.

Volumes Edited
Surveys in Combinatorics 2021,
K.K. Dabrowski, M. Gadouleau, N. Georgiou, M. Johnson, G. Mertzios and D. Paulusma (Eds.)
London Mathematical Society Lecture Note Series 470 (2021) Cambridge University Press (link)

Journal Publications
Tree Pivot-Minors and Linear Rank-Width,
K.K. Dabrowski, F. Dross, J. Jeong, M. Kanté, O-j. Kwon, S-i. Oum and D. Paulusma,
SIAM Journal on Discrete Mathematics, (arXiv:2008.00561) (to appear)

Recognizing Graphs Close to Bipartite Graphs with an Application to Colouring Reconfiguration,
M. Bonamy, K.K. Dabrowski, C. Feghali, M. Johnson and D. Paulusma,
Journal of Graph Theory, Volume 98(1) pp. 81-109 (arXiv:1707.09817) (link)

On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest,
K.K. Dabrowski, C. Feghali, M. Johnson, G. Paesani, D. Paulusma and P. Rzążewski,
Algorithmica, Volume 82(10) (2020) pp. 2841-2866, (arXiv:1908.00491) (link)

Graph Isomorphism for (H₁,H₂)-free Graphs: an Almost Complete Dichotomy,
M. Bonamy, N. Bousquet, K.K. Dabrowski, M. Johnson, D. Paulusma and T. Pierron
Algorithmica, Volume 83(3) (2021) pp. 822-852, (arXiv:1811.12252) (link)

Clique-Width for Graph Classes Closed under Complementation,
A. Blanché, K.K. Dabrowski, M. Johnson, V.V. Lozin, D. Paulusma and V. Zamaraev,
SIAM Journal on Discrete Mathematics, Volume 34(2) (2020) pp. 1107-1147 (arXiv:1705.07681) (link)

Clique-width and Well-Quasi-Ordering of Triangle-Free Graph Classes,
K.K. Dabrowski, V.V. Lozin and D. Paulusma,
Journal of Computer and System Sciences, Volume 108 (2020) pp. 64-91 (arXiv:1711.08837) (link)

Clique-Width for Hereditary Graph Classes,
K.K. Dabrowski, M. Johnson and D. Paulusma,
London Mathematical Society Lecture Note Series, Volume 456 (2019) pp. 1-56 (arXiv:1901.00335) (link)

Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs,
K.K. Dabrowski, F. Dross, M. Johnson and D. Paulusma,
Journal of Graph Theory, Volume 92(4) (2019) pp. 377-393 (arXiv:1506.06564) (link)

Hereditary Graph Classes: When the Complexities of Coloring and Clique Cover Coincide,
A. Blanché, K.K. Dabrowski, M. Johnson and D. Paulusma,
Journal of Graph Theory, Volume 91(3) (2019) pp. 267-289 (arXiv:1607.06757) (link)

Bounding Clique-Width via Perfect Graphs,
K.K. Dabrowski, S. Huang and D. Paulusma,
Journal of Computer and System Sciences, Volume 104 (2019) pp. 202-215 (arXiv:1406.6298) (link)

Independent Feedback Vertex Set for P₅-free Graphs,
M. Bonamy, K.K. Dabrowski, C. Feghali, M. Johnson and D. Paulusma,
Algorithmica, Volume 81(4) (2019) pp. 1342--1369 (arXiv:1707.09402) (link)

On the (parameterized) complexity of recognizing well-covered (r,l)-graphs,
S.R. Alves, K.K. Dabrowski, L. Faria, S. Klein, I. Sau and U. Dos Santos Souza
Theoretical Computer Science, Volume 746 (2018) pp. 36-48 (arXiv:1705.09177) (link)

On Colouring (2P₂,H)-Free and (P₅,H)-Free Graphs,
K.K. Dabrowski and D. Paulusma,
Information Processing Letters, Volume 134 (2018) pp. 35-41 (arXiv:1712.02447) (link)

Independent Feedback Vertex Sets for Graphs of Bounded Diameter,
M. Bonamy, K.K. Dabrowski, C. Feghali, M. Johnson and D. Paulusma,
Information Processing Letters, Volume 131 (2018) pp. 26-32 (arXiv:1707.09383) (link)

Contracting Bipartite Graphs to Paths and Cycles,
K.K. Dabrowski and D. Paulusma,
Information Processing Letters, Volume 127 (2017) pp. 37-42 (arXiv:1706.03750) (link)

Colouring Diamond-free Graphs,
K.K. Dabrowski, F. Dross, and D. Paulusma,
Journal of Computer and System Sciences, Volume 89 (2017) pp. 410-431 (arXiv:1512.07849) (link)

Well-quasi-ordering versus clique-width: new results on bigenic classes,
K.K. Dabrowski, V.V. Lozin and D. Paulusma,
Order, Volume 35(2) (2018) pp. 253-274 (arXiv:1611.03671) (link)

Editing to a Planar Graph of Given Degrees,
K.K. Dabrowski, P.A. Golovach, P. van 't Hof, D. Paulusma and D.M. Thilikos,
Journal of Computer and System Sciences, Volume 85, (2017) pp. 168-182 (arXiv:1508.02773) (link)

Bounding the Clique-Width of H-free Chordal Graphs,
A. Brandstädt, K.K. Dabrowski, S. Huang and D. Paulusma,
Journal of Graph Theory, Volume 86(1) (2017) pp. 42-77 (arXiv:1502.06948) (link)

Bounding the Clique-Width of H-free Split Graphs,
A. Brandstädt, K.K. Dabrowski, S. Huang and D. Paulusma,
Discrete Applied Mathematics, Volume 211, (2016) pp. 30-39 (arXiv:1509.04273) (link)

Combinatorics and algorithms for augmenting graphs,
K.K. Dabrowski, V.V. Lozin, D. de Werra and V. Zamaraev,
Graphs and Combinatorics, Volume 32(4) (2016) pp. 1339-1352 (arXiv:1410.8774) (link)

Clique-width of Graph Classes Defined by Two Forbidden Induced Subgraphs,
K.K. Dabrowski and D. Paulusma,
The Computer Journal, Volume 59(5) (2016) pp. 650-666 (arXiv:1405.7092) (link)

Editing to Eulerian Graphs,
K.K. Dabrowski, P.A. Golovach, P. van 't Hof and D. Paulusma,
Journal of Computer and System Sciences, Volume 82(2) (2016) pp. 213-228 (arXiv:1410.6863) (link)

Classifying the Clique-Width of H-Free Bipartite Graphs,
K.K. Dabrowski and D. Paulusma,
Discrete Applied Mathematics, Volume 200, (2016) pp. 43-51 (arXiv:1402.7060) (link)

Stable-Pi Partitions of Graphs,
K.K. Dabrowski, V.V. Lozin and J. Stacho,
Discrete Applied Mathematics, Volume 182, (2015) pp. 104-114 (preprint) (link)

Colouring of Graphs with Ramsey-Type Forbidden Subgraphs,
K.K. Dabrowski, P.A. Golovach and D. Paulusma,
Theoretical Computer Science, Volume 522, (2014) pp. 34-43 (preprint) (link)

New Results on Maximum Induced Matchings in Bipartite Graphs and Beyond,
K.K. Dabrowski, M. Demange and V.V. Lozin,
Theoretical Computer Science, Volume 478, (2013) pp. 33-40 (preprint) (link)

On factorial properties of chordal bipartite graphs,
K.K. Dabrowski, V.V. Lozin, and V. Zamaraev,
Discrete Mathematics, Volume 312(16) (2012) pp. 2457-2465 (preprint) (link)

Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number,
K.K. Dabrowski, V.V. Lozin, H. Müller and D. Rautenbach,
Journal of Discrete Algorithms, Volume 14 (2012) pp. 207-213 (preprint) (link)

Colouring vertices of triangle-free graphs without forests,
K.K. Dabrowski, V.V. Lozin, R. Raman and B. Ries,
Discrete Mathematics, Volume 312(7) (2012) pp. 1372-1385 (preprint) (link)

Conference Publications
Solving Infinite-Domain CSPs Using the Patchwork Property,
K.K. Dabrowski, P. Jonsson, S. Ordyniak and G. Osipov,
35(5) (2021) pp. 3715-3723 (Proceedings of AAAI 2021) (arXiv:2107.01428) (link)

Disjunctive Temporal Problems under Structural Restrictions,
K.K. Dabrowski, P. Jonsson, S. Ordyniak and G. Osipov,
35(5) (2021) pp. 3724-3732 (Proceedings of AAAI 2021) (link)

Fine-Grained Complexity of Temporal Problems,
K.K. Dabrowski, P. Jonsson, S. Ordyniak and G. Osipov,
(Proceedings of KR 2020) (2020) pp. 284-293 (link)

Clique-width: Harnessing the power of atoms,
K.K. Dabrowski, T. Masařík, J. Novotná, D. Paulusma and P. Rzążewski,
Lecture Notes in Computer Science 12301 (2020) pp. 119-133 (Proceedings of WG 2020) (arXiv:2006.03578) (link)

Independent Transversals versus Transversals,
K.K. Dabrowski, M. Johnson, G. Paesani, D. Paulusma and V. Zamaraev,
Acta Mathematica Universitatis Comenianae, 88(3) (2019) pp. 585-591 (Proceedings of EuroComb 2019) (arXiv:1910.05254) (link)

Tree Pivot-Minors and Linear Rank-Width,
K.K. Dabrowski, F. Dross, J. Jeong, M. Kanté, O-j. Kwon, S-i. Oum and D. Paulusma,
Acta Mathematica Universitatis Comenianae, 88(3) (2019) pp. 577-583 (Proceedings of EuroComb 2019) (arXiv:2008.00561) (link)

Graph Isomorphism for (H₁,H₂)-free Graphs: an Almost Complete Dichotomy,
M. Bonamy, K.K. Dabrowski, M. Johnson and D. Paulusma,
Lecture Notes in Computer Science, 11646 (2019) pp. 181--195 (Proceedings of WADS 2019) (arXiv:1811.12252) (link)

Finding a Small Number of Colourful Components,
L. Bulteau, G. Fertin, K.K. Dabrowski, M. Johnson, D. Paulusma and S. Vialette,
Leibniz International Proceedings in Informatics (LIPIcs), 128 (2019) pp. 20:1-20:14 (Proceedings of CPM 2019) (arXiv:1808.03561) (link)

On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal,
K.K. Dabrowski, M. Johnson, G. Paesani, D. Paulusma and V. Zamaraev,
Leibniz International Proceedings in Informatics (LIPIcs), 117 (2018) pp. 63:1-63:15 (Proceedings of MFCS 2018) (arXiv:1910.05254) (link)

Computing Small Pivot Minors,
K.K. Dabrowski, F. Dross, J. Jeong, M. Kanté, O-j. Kwon, S-i. Oum and D. Paulusma,
Lecture Notes in Computer Science, 11159 (2018) pp. 125--138 (Proceedings of WG 2018) (link) (associated source code)

Independent Feedback Vertex Set for P₅-free Graphs,
M. Bonamy, K.K. Dabrowski, C. Feghali, M. Johnson and D. Paulusma,
Leibniz International Proceedings in Informatics (LIPIcs), 92 (2017) pp. 16:1-16:12 (Proceedings of ISAAC 2017) (arXiv:1707.09402) (link)

Recognizing Graphs Close to Bipartite Graphs,
M. Bonamy, K.K. Dabrowski, C. Feghali, M. Johnson and D. Paulusma,
Leibniz International Proceedings in Informatics (LIPIcs), 83 (2017) pp. 70:1--70:14 (Proceedings of MFCS 2017) (arXiv:1707.09817) (link)

Clique-Width for Graph Classes Closed under Complementation,
A. Blanché, K.K. Dabrowski, M. Johnson, V.V. Lozin, D. Paulusma and V. Zamaraev,
Leibniz International Proceedings in Informatics (LIPIcs), 83 (2017) pp. 73:1-73:14 (Proceedings of MFCS 2017) (arXiv:1705.07681) (link)

Contracting Bipartite Graphs to Paths and Cycles,
K.K. Dabrowski and D. Paulusma,
Electronic Notes in Discrete Mathematics, 61 (2017) pp. 309-315 (Proceedings of EuroComb 2017) (arXiv:1706.03750) (link)

Clique-width and Well-Quasi Ordering of Triangle-Free Graph Classes,
K.K. Dabrowski, V.V. Lozin and D. Paulusma,
Lecture Notes in Computer Science, 10520 (2017) pp. 220-233 (Proceedings of WG 2017) (arXiv:1711.08837) (link)

On the (parameterized) complexity of recognizing well-covered (r,l)-graphs,
S.R. Alves, K.K. Dabrowski, L. Faria, S. Klein, I. Sau and U. Dos Santos Souza
Lecture Notes in Computer Science, 10043 (2016) pp. 423-437 (Proceedings of COCOA 2016) (arXiv:1705.09177) (link)

Well-quasi-ordering versus clique-width: new results on bigenic classes,
K.K. Dabrowski, V.V. Lozin and D. Paulusma,
Lecture Notes in Computer Science, 9843 (2016) pp. 253-265 (Proceedings of IWOCA 2016) (arXiv:1611.03671) (link)

Colouring Diamond-free Graphs,
K.K. Dabrowski, F. Dross, and D. Paulusma,
Leibniz International Proceedings in Informatics (LIPIcs), 53 (2016) pp. 16:1-16:14 (Proceedings of SWAT 2016) (arXiv:1512.07849) (link)

Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs,
K.K. Dabrowski, F. Dross, M. Johnson and D. Paulusma,
Lecture Notes in Computer Science, 9538 (2016) pp. 100-111 (Proceedings of IWOCA 2015) (arXiv:1506.06564) (link)

Bounding the Clique-Width of H-free Split Graphs,
A. Brandstädt, K.K. Dabrowski, S. Huang and D. Paulusma,
Electronic Notes in Discrete Mathematics, 49 (2015) pp. 497-503 (Proceedings of EuroComb 2015) (arXiv:1509.04273) (link)

Bounding the Clique-Width of H-free Chordal Graphs,
A. Brandstädt, K.K. Dabrowski, S. Huang and D. Paulusma,
Lecture Notes in Computer Science, 9235 (2015) pp. 139-150 (Proceedings of MFCS 2015, Part II) (arXiv:1502.06948) (link)

Editing to a Planar Graph of Given Degrees,
K.K. Dabrowski, P.A. Golovach, P. van 't Hof, D. Paulusma and D.M. Thilikos,
Lecture Notes in Computer Science, 9139 (2015) pp. 143-156 (Proceedings of CSR 2015) (arXiv:1508.02773) (link)

Clique-width of Graph Classes Defined by Two Forbidden Induced Subgraphs,
K.K. Dabrowski and D. Paulusma,
Lecture Notes in Computer Science, 9079 (2015) pp. 167-181 (Proceedings of CIAC 2015) (arXiv:1405.7092) (link)

Bounding Clique-Width via Perfect Graphs,
K.K. Dabrowski, S. Huang and D. Paulusma,
Lecture Notes in Computer Science, 8977 (2015) pp. 676-688 (Proceedings of LATA 2015) (arXiv:1406.6298) (link)

Editing to Eulerian Graphs,
K.K. Dabrowski, P.A. Golovach, P. van 't Hof and D. Paulusma,
Leibniz International Proceedings in Informatics (LIPIcs), 29 (2014) pp. 97-108 (Proceedings of FSTTCS 2014) (arXiv:1410.6863) (link)

Classifying the Clique-Width of H-Free Bipartite Graphs,
K.K. Dabrowski and D. Paulusma,
Lecture Notes in Computer Science, 8591 (2014) pp. 489-500 (Proceedings of COCOON 2014) (arXiv:1402.7060) (link)

Colouring of Graphs with Ramsey-Type Forbidden Subgraphs,
K.K. Dabrowski, P.A. Golovach and D. Paulusma,
Lecture Notes in Computer Science, 8165 (2013) pp. 201-212 (Proceedings of WG 2013) (preprint) (link)

Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes,
K.K. Dabrowski, V.V. Lozin, H. Müller and D. Rautenbach,
Lecture Notes in Computer Science, 6460 (2011) pp. 1-9 (Proceedings of IWOCA 2010) (preprint) (link)

Colouring vertices of triangle-free graphs,
K.K. Dabrowski, V.V. Lozin, R. Raman and B. Ries,
Lecture Notes in Computer Science, 6410 (2010) pp. 184-195 (Proceedings of WG 2010) (preprint) (link)

Publications in Preparation
Dynamic Edge-choosability,
K.K. Dabrowski, in preparation (preprint available on request)

Other
Structural Solutions to Maximum Independent Set and Related Problems,
K.K. Dabrowski, PhD Thesis (preprint) (link)

Conferences Organized

1. I am the main organizer of the 22nd Postgraduate Combinatorial Conference 2012.
2. I was a co-organizer of DIMAP Workshop on Combinatorics and Graph Theory.
3. I am a co-organizer of 28th British Combinatorial Conference (BCC 2021).

Conferences/Meetings Attended

1. 16-18 April 2009, Cambridge: Beyond Part III (participant)
2. 12-17 July 2009, Cambridge: LMS/EPSRC Short course in Probabilistic Combinatorics (student)
3. 10 November 2009, Oxford: Joint DIMAP-Oxford seminar (participant)
4. 14 December 2009, Warwick: Mike's Mini-workshop on Algorithms (participant)
5. 17 March 2010, Oxford: One-Day Meeting in Combinatorics (participant)
6. 25-27 March 2010, Cambridge: Young Researchers in Mathematics (speaker)
7. 6-9 April 2010, Edinburgh: 26th British Colloquium in Theoretical Computer Science (speaker)
8. 12-16 April 2010, Warwick: European Study Group in Industry (participant)
9. 10-11 June 2010, London: LTCC course on Synchronisation (student)
10. 28 June - 16 July 2010, Oxford: Lecture series on Structural Graph Theory (student)
11. 7-9 July 2010, London (Queen Mary): 21st Postgraduate Combinatorics Conference (speaker)
12. 12-16 July 2010, Warwick: DIMAP Summer School on Approximation and Randomized Algorithms (student)
13. 26-28 July 2010, London (King's College): 21st International Workshop on Combinatorial Algorithms (speaker)
14. 20-22 September 2010, Durham: Algorithms and Complexity in Durham 2010 (participant)
15. 2 February 2011, Open University: Open University Winter Combinatorics Meeting (participant)
16. 16 March 2011, Oxford: One-Day Meeting in Combinatorics (participant)
17. 14-16 April 2011, Warwick: Young Researchers in Mathematics (speaker)
18. 18-21 April 2011, Birmingham: 27th British Colloquium for Theoretical Computer Science (speaker)
19. 4-8 July 2011, Exeter: 23rd British Combinatorial Conference (BCC 2011) (speaker)
20. 4-9 September 2011, Nový Smokovec, High Tatras, Slovakia: Workshop Cycles and Colourings (speaker)
21. 28 September 2011, Warwick: DIMAP Retreat (speaker)
22. 25 January 2012, Open University: Open University Winter Combinatorics Meeting (participant)
23. 2-4 April 2012, Bristol: Young Researchers in Mathematics (speaker)
24. 30 May 2012, Oxford: One-Day Meeting in Combinatorics (participant)
25. 8 July 2012, Warwick: Workshop on Applications of Parameterized Algorithms and Complexity (participant)
26. 9-13 July 2012, Warwick: International Colloquium on Automata, Languages and Programming (participant)
27. 5-7 September 2012, Oxford: French-British Workshop on Analytic Combinatorics (participant)
28. 9-14 September 2012, Nový Smokovec, High Tatras, Slovakia 21st Workshop Cycles and Colourings (participant)
29. 14-15 September 2012, Nový Smokovec, High Tatras, Slovakia Hereditarnia 2012, The 15th Workshop on Hereditary Graph Properties (speaker)
30. 13 December 2012, Durham, ACiD Seminar (speaker)
31. 30 January 2013, Open University: Open University Winter Combinatorics Meeting (participant)
32. 30 May - 1 June 2013, Paris (CNAM): Conference of the European Chapter on Combinatorial Optimization (participant)
33. 4 June 2013, Paris (LIAFA): Journées Franciliennes de Recherche Opérationnelle (participant)
34. 19-21 June 2013, Lübeck: International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2013) (speaker)
35. 7 July 2013, Riga: International Workshop on Approximation, Parameterized and EXact algorithms (speaker)
36. 8-12 July 2013, Riga: International Colloquium on Automata, Languages and Programming (participant)
37. 5-9 August 2013, Saarbrücken: Advanced Course on the Foundations of Computer Science (participant)
38. 9-14 September 2013, Nový Smokovec, High Tatras, Slovakia: 22nd Workshop Cycles and Colourings (speaker)
39. 20 November 2013, Durham: Network Coding, Partitions and Security (participant)
40. 23 June 2014, Durham: Computer Science Junior Seminar (speaker)
41. 4-6 August 2014, Atlanta GA, USA: 20th International Computing and Combinatorics Conference (COCOON 2014) (speaker)
42. 7-12 September 2014, Nový Smokovec, High Tatras, Slovakia: 23rd Workshop Cycles and Colourings (speaker)
43. 13-14 December 2014, New Delhi, India: New Developments in Exact Algorithms and Lower Bounds (participant)
44. 15-17 December 2014, New Delhi, India: 34th Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2014) (speaker)
45. 11 February 2015, Durham: Computer Science Junior Seminar (speaker)
46. 2-6 March 2015, Nice, France: 9th International Conference on Language and Automata Theory and Applications (LATA 2015) (speaker)
47. 20-22 May 2015, Paris, France: 9th International Conference on Algorithms and Complexity (CIAC 2015) (speaker)
48. 16-19 June 2015, Koper, Slovenia: Algorithmic Graph Theory on the Adriatic Coast (AGTAC 2015) (speaker)
49. 6-10 July 2015, Warwick, UK: 25th British Combinatorial Conference (BCC 2015) (speaker)
50. 24-28 August 2015, Milan, Italy: 40th International Symposium on Mathematical Foundations of Computer Science (MFCS 2015) (speaker)
51. 31 August - 4 September 2015, Bergen, Norway: European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2015) (speaker*2)
52. 8 October 2015, Durham: Durham University School of Engineering and Computing Science Research Day (speaker)
53. 11-15 October 2015, Aussois, France: 7th Workshop on Graph Classes, Optimization, and Width Parameters (GROW 2015) (speaker)
54. 22-24 June 2016, Reykjavik, Iceland: 15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016) (speaker)
55. 16 August 2016, Helsinki, Finland: StringMasters Workshop 2016 (participant)
56. 17-19 August 2016, Helsinki, Finland: 27th International Workshop on Combinatorial Algorithms (IWOCA 2016) (speaker)
57. 4-9 September 2016, Nový Smokovec, High Tatras, Slovakia: 25th Workshop Cycles and Colourings (speaker)
58. 9-13 January 2017, Durham, UK: Algebraic, Topological and Complexity Aspects of Graph Covers (ATCAGC 2017) (participant)
59. 7 February 2017, Warwick, UK: DIMAP research seminar (speaker)
60. 21-23 June 2017, Eindhoven, The Netherlands: 43rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2017) (speaker)
61. 26-30 June 2017, Nantes, France: Research visit (visitor)
62. 28 August - 1 September 2017, Vienna, Austria: European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2017) (speaker)
63. 15 November 2017, Durham: Computer Science Junior Seminar (speaker)
64. 9-12 December 2017, Phuket, Thailand: The 28th International Symposium on Algorithms and Computation (ISAAC 2017) (speaker)
65. 23 January 2018, Open University, UK: Open University Pure and Applied Mathematics Colloquium (speaker)
66. 18-22 June 2018, Université Paris-Est Marne-la-Vallé, Paris, France: Research visit (visitor)
67. 27-29 June 2018, Cottbus, Germany: 44th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2018) (speaker)
68. 19-20 September 2018, Liverpool, UK: 2nd AlgoUK workshop (participant)
69. 8 November 2018, Durham, UK: ACiD Seminar (speaker)
70. 19-23 November 2018, Sheffield, UK: Sheffield Computer Science Algorithms Seminar / Research visit (speaker/visitor)
71. 8-9 January 2019, Durham, UK: Computing Education Practice (CEP) (participant)
72. 15-16 April 2019, Durham, UK: 3rd AlgoUK workshop (participant)
73. 16-17 April 2019, Durham, UK: 35th British Colloquium for Theoretical Computer Science (participant)
74. 25-26 April 2019, Edinburgh, UK: Scottish Combinatorics Meeting 2019 (speaker)
75. 8-9 May 2019, London (QMUL and LSE), UK: Colloquia in Combinatorics (participant)
76. 12-17 May 2019, Aussois, France: 3rd International Workshop on Combinatorial Reconfiguration (CoRe 2019) (participant)
77. 19-21 June 2019, Vall de Núria, Spain: 45th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2019) (participant)
78. 30 June-5 July 2019, Dagstuhl, Germany: Dagstuhl Seminar 19271: Graph Colouring: from Structure to Algorithms (invited speaker)
79. 15-19 July 2019, Durham, UK: Computability in Europe (CiE 2019) (speaker)
80. 29 July-2 August 2019, Birmingham, UK: 27th British Combinatorial Conference (BCC 2019) (speaker)
81. 5-7 August 2019, Edmonton, Canada: Algorithms and Data Structures Symposium (WADS 2019) (speaker)
82. 26-30 August 2019, Bratislava, Slovakia: European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2019) (speaker)
83. 8-9 January 2020, Durham, UK: Computing Education Practice (CEP) (participant)
84. 7 January 2021, Durham, UK (online): Computing Education Practice (CEP) (participant)
85. 6-9 April 2021, Glasgow, UK (online): British Mathematical Colloquium (BMC)/British Applied Mathematics Colloquium (BAMC) (speaker)
86. 31 May-4 June 2021, Lyon/Bordeaux, France (online): Graph Reconfiguration Workshop (participant)
87. 20-26 June 2021, Portorož, Slovenia (online): 8th European Congress of Mathematics (speaker)
88. 2-3 September 2021, Dublin, Ireland (online): The United Kingdom and Ireland Computing Education Research conference (UKICER) (participant)

Links
Quotes from various people
Imre Leader Appreciation Society (mirrored from here)