E-LIB Suche - Ergebnisse für: Nummenpalo, Jerri

1

Sparse Kneser graphs are Hamiltonian:

Mütze, Torsten ; Nummenpalo, Jerri ; Walczak, Bartosz
Journal of the London Mathematical Society. 103 (2020) 4 - p. 1253-1275 , 2020

Link: https://doi.org/10.1112/..

2

Solving and Sampling with Many Solutions:

Cardinal, Jean ; Nummenpalo, Jerri ; Welzl, Emo
Algorithmica. 82 (2019) 5 - p. 1474-1489 , 2019

Link: https://doi.org/10.1007/..

3

A Constant-Time Algorithm for Middle Levels Gray Codes:

Mütze, Torsten ; Nummenpalo, Jerri
Algorithmica. 82 (2019) 5 - p. 1239-1258 , 2019

Link: https://doi.org/10.1007/..

4

The Complexity of Optimization on Grids:

Barba, Luis ; Milatz, Malte ; Nummenpalo, Jerri...
Algorithmica. 81 (2019) 9 - p. 3494-3518 , 2019

Link: https://doi.org/10.1007/..

5

Sparse Kneser graphs are Hamiltonian:

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

Mütze, Torsten ; Nummenpalo, Jerri ; Walczak, Bartosz - p. 912-919 , 2018

Link: https://dl.acm.org/doi/1..

6

Efficient Computation of Middle Levels Gray Codes:

MÜTZE, Torsten ; Nummenpalo, Jerri
ACM Transactions on Algorithms (TALG). 14 (2018) 2 - p. 1-29 , 2018

Link: https://dl.acm.org/doi/1..

7

Efficient Computation of Middle Levels Gray Codes:

MÜTZE, Torsten ; Nummenpalo, Jerri
ACM Transactions on Algorithms. 14 (2018) 2 - p. 1-29 , 2018

Link: https://doi.org/10.1145/..

8

A constant-time algorithm for middle levels gray codes:

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

Mütze, Torsten ; Nummenpalo, Jerri - p. 2238-2253 , 2017

Link: https://dl.acm.org/doi/1..

9

Sparse Kneser graphs are Hamiltonian:

Mütze, Torsten ; Nummenpalo, Jerri ; Walczak, Bartosz
info:eu-repo/semantics/altIdentifier/doi/10.1112/jlms.12406. , 2021

Link: https://hdl.handle.net/2..

10

Sparse Kneser graphs are Hamiltonian:

Mütze, Torsten ; Nummenpalo, Jerri ; Walczak, Bartosz
Journal of the London Mathematical Society, T. 103, nr 4, s. 1253-1275. , 2021

Link: https://ruj.uj.edu.pl/xm..

11

Switches in Eulerian graphs:

Zehmakan, Ahad N ; Nummenpalo, Jerri ; Pilz, Alexander.
http://arxiv.org/abs/1905.06895. , 2019

Link: http://arxiv.org/abs/190..

12

Middle Levels Theorem, Odd Graph Hamiltonicity and Satisfia..:

Nummenpalo, Jerri
http://hdl.handle.net/20.500.11850/339332. , 2019

Link: https://hdl.handle.net/2..

13

Solving and Sampling with Many Solutions: Satisfiability an..:

Cardinal, Jean ; Nummenpalo, Jerri ; Welzl, Emo
doi:10.4230/LIPIcs.IPEC.2017.11. , 2018

Link: https://doi.org/10.4230/..

14

Solving and sampling with many solutions: Satisfiability an..:

Cardinal, Jean ; Nummenpalo, Jerri ; Welzl, Emo
info:eu-repo/semantics/altIdentifier/doi/10.4230/LIPIcs.IPEC.2017.11. , 2018

Link: https://hdl.handle.net/2..

15

Sparse Kneser graphs are Hamiltonian:

Mütze, Torsten ; Nummenpalo, Jerri ; Walczak, Bartosz
http://arxiv.org/abs/1711.01636. , 2017

Link: http://arxiv.org/abs/171..