Deterministic Algorithms for Unique Sink Orientations of Grids. - Luis Barba; Malte Milatz; Jerri Nummenpalo; Antonis Thomas (COCOON, 2016)

Solving and Sampling with Many Solutions: Satisfiability and Other Hard Problems. - Jean Cardinal; Jerri Nummenpalo; Emo Welzl (IPEC, 2017)

A short proof of the middle levels theorem. - Petr Gregor; Torsten Mütze; Jerri Nummenpalo (CoRR, 2017)

Sparse Kneser graphs are Hamiltonian. - Torsten Mütze; Jerri Nummenpalo; Bartosz Walczak (STOC, 2018)

Efficient Computation of Middle Levels Gray Codes. - Torsten Mütze; Jerri Nummenpalo (ACM Trans. Algorithms, 2018)

The Complexity of Optimization on Grids. - Luis Barba; Malte Milatz; Jerri Nummenpalo; Xiaoming Sun 001; Antonis Thomas; Jialin Zhang 001; Zhijie Zhang 003 (Algorithmica, 2019)

Switches in Eulerian graphs. - Ahad N. Zehmakan; Jerri Nummenpalo; Alexander Pilz; Daniel Wolleb-Graf (CoRR, 2019)

Solving and Sampling with Many Solutions. - Jean Cardinal; Jerri Nummenpalo; Emo Welzl (Algorithmica, 2020)

A Constant-Time Algorithm for Middle Levels Gray Codes. - Torsten Mütze; Jerri Nummenpalo (Algorithmica, 2020)