Open PositionsThe MIAO research group is active at both the University of Copenhagen and Lund University, and all members have offices in both Copenhagen and Lund. Please feel free to drop me a line if you have any questions about any of the openings advertised (or not advertised) on this webpage. Note, however, that we cannot accept applications via email — we can only hire for currently open positions as advertised in official announcements, and all applications must be made via the official recruitment systems (as per instructions in the announcements). Faculty PositionsThere are currently no open faculty positions in the Algorithms and Complexity Section at the Department of Computer Science at the University of Copenhagen. We might be hiring in the autumn of 2022, but more information about that will be posted in the autumn if and when available. There are currently no open faculty positions in algorithms or complexity theory at the Department of Computer Science at Lund University. Postdoctoral PositionsWe are looking for postdocs both on the theory side in computational complexity theory and on the applied side in automated reasoning and combinatorial optimization at the University of Copenhagen. The application deadline is June 29, 2022. The starting date is flexible, but would ideally be sometime in nottoolate autumn 2022. All postdoc positions in my research group are fully funded, employed positions (including travel money) that come with an internationally competitive salary. If you instead want to start collecting grants to list on your CV, you can also try to apply for an postdoctoral fellowship within the EU Marie SkłodowskaCurie actions program to come and do a postdoc with me. The next call is expected to have a deadline of September 14, 2022. I would particularly welcome applications from strong candidates who want to work in computational complexity theory, SAT solving, integer linear programming, constraint programming, or some mix of these areas. Please feel free to contact me if you want to discuss this. PhD PositionsI am looking for PhD students both on the theory side in computational complexity theory and on the applied side in automated reasoning and combinatorial optimization at the University of Copenhagen. The application deadline is June 29, 2022. The starting date is flexible, but would ideally be sometime in nottoolate autumn 2022. All our PhD positions are fully funded, employed positions (including travel money) that come with an internationally very competitive salary. Thesis ProjectsI would be interested in supervising students for thesis work on topics as briefly outlined below. Please note that the descriptions are in no way intended to be exhaustive. You can send me an email to get more detailed information with an uptodate list of more concrete proposals. (Note, however, that these projects are intended for students who are geographically close and can work on their thesis in the CopenhagenLund area. There is no dedicated funding available to support foreign students to come to Denmark or Sweden.) These projects are intended to give students a feel for what research in computer science is like, while at the same time focusing on concrete problems of both theoretical and practical importance. Apart from the thesis work itself, the intention is that the results of successful thesis projects should also be exciting enough to be published as (parts of) papers in leading scientific conferences and/or journals in the field (within the framework of the research outlined here).
Formula Hardness and SAT SolvingGiven a formula in propositional logic, is it possible to set its variables in such a way that the formula is satisfied? This simple looking problem has been on centre stage in theoretical computer science ever since the field got started some 40 years ago, and has been named as one of the Millennium Prize Problems comprising some of the major challenges for all of mathematics in the 21st century. Today, students of computer science worldwide learn in their introductory algorithms and complexity courses that this socalled SAT problem is what is known as NPcomplete, and therefore is very, very hard in practice. Interestingly, practioners take a somewhat different view. During the last 20 years, SAT has developed from a problem of mainly theoretical interest into a practical approach for solving a wide range of applied problems. Enormous progress in performance has led to satisfiability algorithms, socalled SAT solvers, becoming a standard tool for solving realworld problems with millions of variables in the context of, for example, hardware and software verification, electronic design automation, artificial intelligence, operations research, and bioinformatics. The theory of NPcompleteness did not quite go away, however — for all these SAT solvers there are also known examples of tiny formulas with just a couple of hundred variables that make them fail miserably. How can modern SAT solvers be so good in practice? How can one know for a particular formula whether it will be hard or easy? Can we extend SAT solvers with new methods of reasoning to make them potentially even more powerful than the best solvers today? These are the kind of questions we want to study in these Master's thesis projects, using a mix of theoretical research and practical experiments. Solving 01 Integer Linear ProgramsA 01 integer linear program (ILP) is a collection of linear constraints a_{1} x_{1} + a_{2} x_{2} + … + a_{n} x_{n} ≥ A where all a_{i} and A are integers and the variables x_{i} can only take values 0 or 1. Such 01 ILPs can be used to model a vast range of problems in computer hardware construction and verification, software analysis, scheduling, logistics, disaster management, bioinformatics, artificial intelligence, et cetera. Most of these problems are known to be computationally very, very challenging from a theoretical point of view — it is widely believed that it is impossible to design generalpurpose algorithms that will always run fast and produce correct solutions — but in practice there are very efficient combinatorial optimization solvers that try to exploit the structure of concrete problems to find shortcuts, and use an array of sophisticated heuristics to do so. For most of these heuristics there is an almost complete lack of rigorous scientific understanding of when and why they work well or fail, however. Another intriguing fact is that recent research on combining methods from Boolean satisfiability (SAT) solving, pseudoBoolean solving, and mixedinteger linear programming (MIP) has shown that adding together solving techniques from these different areas can lead to major improvements in performance. A project in this area could involve:
