# Master projects, internal

If you would like to do a project within the group, please read the description of our research below. If you see an area that you like, please contact the person directly to discuss whether he or she has time, and if yes, possible projects to do.

### Our research areas

Karen Aardal, k.i.aardal@tudelft.nl

Most of my research is on algorithms for integer optimization, but I also do research on the analysis of algorithms, in particular for various facility location problems. In integer optimization I focus on using information from the structure of the underlying lattice and investigate how this information can be used to enhance search algorithms like branch-and-bound, and cutting plane generation. More recently I am working on using machine learning to enhance optimization algorithms. I have also been working on applications of integer optimization, and one of my favorite applications is the planning of where to locate emergency vehicles, such as ambulances.

Theresia van Essen, J.T.vanEssen@tudelft.nl

My research focuses on developing new models and novel optimization based methods for problems from practice in the field of transportation, logistics and scheduling. The optimization methods I develop use elements from integer linear programming, stochastic programming, metaheuristics, problem based heuristics, cutting planes and simulation. I study both the practical and theoretical nature of the real-life problems I consider. Sometimes real-life problems give rise to a new type of optimization problem which has not been discussed in the literature. This gives the possibility to study the structure and characteristics of this problem, but also the opportunity to develop novel solution methods. My research topics include operating room planning, ambulance planning, and efficient use of automated vehicles.

Dion Gijswijt D.C.Gijswijt@tudelft.nl

My research interests lie in discrete mathematics and combinatorial optimisation. The type of problems I study usually involve graphs or related combinatorial structures (hypergraphs, matroids). The main methods I use are linear programming, semidefinite programming and algebraic methods. One area that I am particularly interested in, is the `cap set problem' and related problems from extremal combinatorics and computer science. Much progress in this area uses algebraic ideas in the form of the so-called `polynomial method'.

Leo van Iersel, L.J.J.vanIersel@tudelft.nl

Most of my research is on algorithms for hard problems and applications in biology and industry. For example, I am interested in FPT algorithms, which are algorithms for NP-hard problems that are efficient when a certain parameter is small. Phylogenetic networks also play a central role in my research. These are networks describing evolutionary relationship and reconstructing them from data is very challenging. Next to algorithmic questions, I also study these networks from a more fundamental mathematical point of view. For example, whether certain types of data uniquely determine certain networks. Recently, I have also started working on the combination of machine learning and optimization in order to develop algorithms that combine positive aspects of both fields.

David de Laat, d.delaat@tudelft.nl

My research focuses on mathematical optimization problems that can be approached using semidefinite programming and related techniques. In particular, I am interested in the use of moments and correlation functions to study composite systems, which finds applications in discrete geometry, quantum information theory, analytic number theory, and the conformal bootstrap program. This research involves techniques from convex optimization, harmonic analysis, functional analysis, and real algebraic geometry.

Fernando M. de Oliveira Filho, F.M.deOliveiraFilho@tudelft.nl

My interests lie in the theory and practice of optimization, namely conic programming (linear programming, semidefinite programming, etc.) and its applications. I am very much interested in applying optimization techniques to geometrical problems, like the kissing number problem or the sphere packing problem. In such applications, optimization methods have to be extended to an infinite-dimensional setting through the use of tools from functional and harmonic analysis.

Jos Weber, j.h.weber@tudelft.nl

My research is on error control techniques for digital transmission and storage systems. While being transmitted or stored, data may be corrupted due to noise, fading, etc. Coding techniques are applied to retrieve the original data with high probability. My focus is on the design and analysis of such error-correcting codes. Current topics under investigation are "detection and (de)coding methods for channels with unknown gain and/or offset" and "coding for DNA-based storage". The latter is considered to be a promising alternative for the present-day optical and magnetic storage media. In order to design error-correcting codes meeting the desired performance requirements with respect to efficiency, reliability, and complexity, we use tools from various fields, such as discrete mathematics, algebra, combinatorics, optimization, etc.

Anurag Bishnoi, A.Bishnoi@tudelft.nl

My main research interests are in discrete mathematics. Specifically, I have worked on research problems from incidence geometry, extremal combinatorics and Ramsey theory. I have used algebraic, geometric and computational methods in tackling these problems, and I am particularly fond of the polynomial method. I have also worked on Chevalley-Warning type theorems from number theory. For more details on my work and interests, see my website: https://anuragbishnoi.wordpress.com/.

Carla Groenland, c.e.groenland@tudelft.nl

My research is on discrete mathematics (combinatorics, graph theory) and theoretical computer science (algorithms & complexity), so most of the students I supervise will work on topics related to one (or both) of those areas. Since I have also done a MSc+BSc degree in artificial intelligence and did a small amount of research on game theory, I may also be happy to supervise a theoretical project in the algorithmic game theory, mechanism design, computational social choice or reinforcement learning, or a more computational (programming-oriented) project, as long as there is still some ‘discrete flavour’ to it.

For more information, see https://cgroenland.wordpress.com/students/.

Yuki Murakami, y.murakami@tudelft.nl

My research interest is in graph theory and their applications. In particular, I am interested in phylogenetic networks, which are graphs used to represent evolutionary histories of objects. Such graphs are widely used in biology, but they also crop up in linguistics and epidemiology. I have recently also worked on the `graph burning problem', which models how influence or contagion spreads in a graph.

Barbara Terhal, b.m.terhal@tudelft.nl

My research is on theoretical and mathematical aspects of quantum computation broadly. More specifically, I am interested in quantum error correction and optimizing quantum error correcting codes and protocols given experimental constraints. Besides quantum error correction, I am also interested in quantum optimization problems and quantum algorithms, recently focussing on problems with a fermionic flavor. See also https://qutech.nl/person/barbara-terhal/