# Juho Lauri

My main focus areas are graph theory (e.g., coloring), algorithms (e.g., parameterization), and complexity (e.g., lower bounds). I also enjoy programming and solving computationally difficult problems in practice.

I successfully defended my doctoral thesis on 3rd of November, 2016. My opponent was Pinar Heggernes (University of Bergen). From May 2015 to May 2017, I was supported by the Emil Aaltonen Foundation.

In May 2017, I joined Bell Labs in Dublin, Ireland as a post-doctoral researcher.

# Publications

# Engineering Motif Search for Large Motifs

# NP-completeness Results for Partitioning a Graph into Total Dominating Sets

# Algorithms and Hardness Results for Happy Coloring Problems

# The Square of the 9-hypercube is 14-colorable

# On the Complexity of Restoring Corrupted Colorings

# On the Fine-grained Complexity of Rainbow Coloring

# On Finding Rainbow and Colorful Paths

# Complexity of Rainbow Vertex Connectivity Problems for Restricted Graph Classes

# On the Complexity of Rainbow Coloring Problems

# Engineering Motif Search For Large Graphs

# Further Hardness Results on Rainbow and Strong Rainbow Connectivity

# Computing Minimum Rainbow and Strong Rainbow Colorings of Block Graphs

# Theses

# Chasing the Rainbow Connection: Hardness, Algorithms, and Bounds

Doctoral thesis, Tampere University of Technology,

Approved with distinction

# Rainbow Coloring and Connectivity Problems on Families of Perfect Graphs

Master's thesis, Tampere University of Technology,

Awarded 'Thesis of the Year' by the Finnish Society for Computer Science

# Average-case Analysis of Comparison-based Sorting Algorithms Using the Incompressibility Method

Bachelor's thesis, Tampere University of Technology,

# Teaching

I am or have been a teaching assistant for the following courses.

## At Tampere University of Technology:

- MAT-72606 Approximation Algorithms (Spring 2017)
- MAT-72306 Randomized Algorithms (Spring 2017)
- MAT-72006 Advanced Algorithms and Data Structures (Fall 2016)
- MAT-75006 Artificial Intelligence (Spring 2016)
- MAT-72006 Advanced Algorithms and Data Structures (Fall 2015)
- MAT-02700 Operations Research (Spring 2015)
- MAT-72606 Approximation Algorithms (Spring 2015)
- MAT-72306 Randomized Algorithms (Spring 2015)
- OHJ-1450 Advanced Object-Oriented Programming (Spring 2012)
- OHJ-1110 Honours Programming 1 (Fall 2011)
- OHJ-1160 Honours Programming 2 (Spring 2011)
- OHJ-1110 Honours Programming 1 (Fall 2010)

## At Michigan Technological University:

- CS2311 Discrete Structures (Spring 2013)
- CS1131 Accelerated Introduction to Programming (Fall 2012)