Scholar
Konrad K. Dabrowski
Google Scholar ID: vgqIR0YAAAAJ
Newcastle University
Citations & Impact
Citations
440
H-index
12
i10-index
15
Publications
20
Co-authors
23
list available
Contact
No contact links provided.
Publications
Resume (English only)
Research Experience
- Worked as a research associate for six months supervised by Prof. Daniel Paulusma and Dr. George Mertzios, funded by EPSRC grant 'Algorithmic Aspects of Graph Coloring'.
- Worked as a research associate for six months supervised by Prof. M. Demange, funded by ANR grant 'Time Versus Optimality in Discrete Optimization'.
- Worked as a research associate supervised by Prof. Daniel Paulusma and Prof. Iain Stewart, funded by EPSRC grant 'Detecting Induced Graph Patterns'.
- Worked as a research associate supervised by Prof. Daniel Paulusma and Dr. Matthew Johnson, funded by Leverhume Trust grant 'Efficient Graph Colouring Algorithms via Input Restrictions'.
- Worked as a teaching fellow.
- Worked as a research fellow supervised by Dr. Sebastian Ordyniak, funded by EPSRC grant 'Next Generation of Algorithms for Mixed Integer Linear Programming (MILP)'.
Education
- Completed PhD in 2012, supervised by Prof. Vadim Lozin.
Background
- Lecturer at the School of Computing, Newcastle University, with research interests focusing on structural and algorithmic properties of discrete structures, particularly graph structure and algorithms on graphs in restricted graph classes.
Miscellany
- Previously organized ACiD Research Seminars and Computer Science Junior Seminars.
