Jerri Nummenpalo
From MaRDI portal
Person:2309468
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Switches in Eulerian graphs Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
| Sparse Kneser graphs are Hamiltonian Journal of the London Mathematical Society | 2021-08-13 | Paper |
| Solving and sampling with many solutions: satisfiability and other hard problems (available as arXiv preprint) | 2020-05-27 | Paper |
| Solving and sampling with many solutions Algorithmica | 2020-04-01 | Paper |
| A constant-time algorithm for middle levels Gray codes Algorithmica | 2020-04-01 | Paper |
| Sparse Kneser graphs are Hamiltonian Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
| Sparse Kneser graphs are Hamiltonian Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
| The complexity of optimization on grids Algorithmica | 2019-08-20 | Paper |
| Switches in Eulerian graphs | 2019-05-08 | Paper |
| A short proof of the middle levels theorem Discrete Analysis | 2019-01-09 | Paper |
| Efficient computation of middle levels Gray codes ACM Transactions on Algorithms | 2018-11-13 | Paper |
| A constant-time algorithm for middle levels Gray codes Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| Deterministic algorithms for unique sink orientations of grids Lecture Notes in Computer Science | 2016-09-02 | Paper |
| Efficient Computation of Middle Levels Gray Codes Algorithms - ESA 2015 | 2015-11-19 | Paper |
Research outcomes over time
This page was built for person: Jerri Nummenpalo
