Jonas Seiler

Hallo!

I'm Jonas from Germany and I am an ESA Graduate Trainee in Space Logistics, tackling graph routing problems like the traveling salesperson problem (TSP) or the orienteering problem in space-like settings. This usually means a dynamic graph structure with changing weights or values.

Before I joined the Advanced Concepts Team, I completed a Bachelor of Science in Theoretical Computer Science and a Master of Science in Mathematics at the Karlsruhe Institute of Technology (KIT), minoring in the respective other field. During my studies and now, I try to balance on the edge between theoretical computer science and mathematics and supplement problems and theory of one field with methods and tricks from the other.

In that vein, my academic interests are mostly concerned with graphs and other combinatorial objects from discrete mathematics, mainly looking at algorithmic procedures for decision problems. I am also interested in algorithmic decidability and complexity as well as algebraic topics like computational and geometric group theory, algebraic topology and category theory.

In the future, I wish to explore some newer alleyways in the world of graph algorithms like randomization and distributed computing.

In my free time I like to solve logic puzzles like Akari or Fillominos, like to go cycling and bouldering, cook and bake, read and develop stuff as well as play board games.

On the left you can find an example of a logic puzzle I like, here are its rules:

• Place lightbulbs on some white cells to light all remaining cells.
• A lightbulb illuminates its row and column until stopped by a black cell or the edges of the grid.
• Bulbs may not illuminate each other but an empty space may be illuminated by more than one bulb.
• Numbered black cells must touch exactly that number of lightbulbs in the four neighboring cells.
• Unnumbered black cells can touch any number of lightbulbs.

Feel free to etisbew ym tisiv to learn more about me or liam a em etirw.