Jerri Nummenpalo

According to our database, Jerri Nummenpalo authored at least 9 papers between 2015 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2020

Solving and Sampling with Many Solutions.

Jean Cardinal, Jerri Nummenpalo, Emo Welzl

Algorithmica, 2020

2019

Switches in Eulerian graphs.

Ahad N. Zehmakan, Jerri Nummenpalo, Alexander Pilz, Daniel Wolleb-Graf

CoRR, 2019

The Complexity of Optimization on Grids.

Luis Barba, Malte Milatz, Jerri Nummenpalo, Xiaoming Sun, Antonis Thomas, Jialin Zhang, Zhijie Zhang

Algorithmica, 2019

2018

Sparse Kneser graphs are Hamiltonian.

Torsten Mütze, Jerri Nummenpalo, Bartosz Walczak

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

2017

A short proof of the middle levels theorem.

Petr Gregor, Torsten Mütze, Jerri Nummenpalo

CoRR, 2017

A constant-time algorithm for middle levels Gray codes.

Torsten Mütze, Jerri Nummenpalo

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Solving and Sampling with Many Solutions: Satisfiability and Other Hard Problems.

Jean Cardinal, Jerri Nummenpalo, Emo Welzl

Proceedings of the 12th International Symposium on Parameterized and Exact Computation, 2017

2016

Deterministic Algorithms for Unique Sink Orientations of Grids.

Luis Barba, Malte Milatz, Jerri Nummenpalo, Antonis Thomas

Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

2015

Efficient Computation of Middle Levels Gray Codes.

Torsten Mütze, Jerri Nummenpalo

Proceedings of the Algorithms - ESA 2015, 2015