About
Justin Pearson is an Associate Professor at the Department of Information Technology; Division of Computing Science at Uppsala University. He is a member of the university's optimisation group and coordinates the IT department's mentor programme for new employees.
Research Interests include Constraint Programming, Combinatorial Optimisation, Artificial Intelligence, Software Testing, and Complexity Theory. His work focuses on theoretical and practical aspects of constraint satisfaction, local search algorithms, and symmetry breaking in constraint programming.
Teaching involves courses such as Algorithms and Data Structures II (1DL231) and Introduction to Machine Learning for Bachelor Students (1DL034), with a PhD-level course on Category Theory offered periodically based on demand.
Scientific Contributions span publications in constraint programming for air traffic management, sensor networks, and industrial applications. Recent work includes parameterised treewidth in constraint models, time-series constraints, and symmetry breaking techniques.
Students supervised include PhD candidates Frej Knutar Lewander (co-supervised with Pierre Flener), Yi Zhao (co-supervised with Di Yuan), and previously graduated students Gustav Björdal, María Andreína Francisco Rodríguez, and Joseph Scott.
