I am a postdoc researcher on computer science at NII, Tokyo. My research interests include digraph structure theory, FPT algorithms, kernelization and computational hardness.

I am generally interested in discovering the boundaries of (efficient) computation, understanding when a problem can be solved efficiently and when this is unlikely. This is only achievable after grasping the mathematical objects used to formulate the problem and after developing powerful theoretical tools for answering structural questions.

Unlike many researchers with whom I talked, I find digraphs to be quite fascinating, we only lack the knowledge to fully appreciate their elegance.

In my free time I like to mess around with computers by writing programs and customizing my system (computers also seem to like messing around with me). I also enjoy creating 3D art with Blender, playing (old) video games, reading books and learning new languages and cultures.

• Digraph structure theory
• Parameterized algorithms
• Kernelization
• Computational hardness