Konrad Dabrowski

About

Dr Konrad Dabrowski is a Lecturer in Computer Science at Newcastle University's School of Computing. His research focuses on graph theory, algorithms, and computational complexity, particularly parameterized complexity and constraint satisfaction problems.

Selected publications

• Computing Pivot-Minors
• Algorithms and complexity of difference logic
• Almost Consistent Systems of Linear Equation
• On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal
• An Algorithmic Framework for Locally Constrained Homomorphisms
• Solving Infinite-Domain CSPs Using the Patchwork Property
• Clique-Width: Harnessing the Power of Atoms
• Tree Pivot-Minors and Linear Rank-Width
• Resolving Inconsistencies in Disjunctive Temporal Constraints: a Parameterized Complexity Classification
• Graph Classes Closed under Self-intersection