Hello, I'm Vašek. I work in academia (theoretical informatics). Searching for some programming podcasts today I stumbled upon FoC and I was quite impressed. I listened to 4 of the podcasts, the last was the 46 Community Survey. I found myself crying at the end as the answers in "What does 'Future of Coding' mean?" resonated well with me. I hope to become part of this community by overcoming my introverted nature and realize moonshot dreams about the future.

Hey @Václav Blažej ! I'd love to hear more about your theoretical informatics work, that sounds right up my street!

Hello @Orion Reed, I can summarize my field as studying algorithmic complexity with respect to graph properties so it's not connected to the future of coding (at the first glance). However, its one of my dreams to develop theoretical understanding of modern programming concepts and realize their implementation in a way to enable next step in evolution of computation. We can discuss more concrete notions in #C5T9GPWFL.

Could you expand on “algorithmic complexity with respect to graph properties”? I feel you're taking about something other than the complexity of graph-theoretic algorithms? Also curious where you are doing your research if you don't mind me asking?

You are correct with the complexity of graph-theoretic algorithms but we are trying to tackle NP-hard problems by developing FPT algorithms with respect to graph parameters such as treewidth, vertex cover number, etc. Currently, I am at FIT CTU in Prague, Czechia; finishing my Ph.D.

Sounds cool! FIT CTU looks like a nice place to do research. Are you developing FPT graph algorithms to find more generalisable approaches to making certain classes of problems tractable? As in, is the focus on graphs because of their transferability, or are you interested in graphs in and of themselves?

The team worked on complexity of TSP and related problems; I work more on games on graphs close to hard graph theoretic problems -- like e.g. a game variant of domination number (called eternal domination).