Tuukka Korhonen "How Graph Structure Makes Hard Problems Tractable"

Highlight event, HIIT Special Seminars
This talk is part of the HIIT Special Seminar series. The talks in this series are provided by candidates who have applied to our HIIT Fellowship recruitment call and are highly considered for the position. All talks are virtual, open to the public, and recorded for the future
HIIT Special Seminar

When

–

Where

Online

Event language(s)

English
Join via zoom

This talk can be viewed via zoom. (Note: this talk will be recorded)

abstract:
=========
Many algorithmic problems are infeasible to solve in the worst case. Despite this, we solve them daily in practice, on inputs much larger than worst-case theory would suggest. This includes problems such as route planning, software verification, and frequency allocation in mobile networks.

A key reason for this phenomenon is that real-world inputs have structure that algorithms can exploit. In this talk, I will overview my research on the theory of how graph-theoretic structure can be used to make hard algorithmic problems tractable across computer science. I will also discuss how the AI revolution in theoretical computer science will shape my future research.

bio:
=========
Tuukka Korhonen is a Marie Skłodowska-Curie Postdoctoral Fellow at the University of Copenhagen. He obtained his PhD from the University of Bergen in 2024 and received the EATCS Distinguished Dissertation Award. His research focuses on algorithms and graph theory, especially on the connections between structural graph theory and various areas of algorithms.

 

HIIT Special Seminar
Read more
  • Updated:
  • Published:
Share
URL copied!