Joeri Sleegers

Orcid: 0000-0003-1701-6319

According to our database1, Joeri Sleegers authored at least 5 papers between 2020 and 2022.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
The Hardest Hamiltonian Cycle Problem Instances: The Plateau of Yes and the Cliff of No.
SN Comput. Sci., 2022

Universally Hard Hamiltonian Cycle Problem Instances.
Proceedings of the 14th International Joint Conference on Computational Intelligence, 2022

Exactly characterizable parameter settings in a crossoverless evolutionary algorithm.
Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Companion Volume, Boston, Massachusetts, USA, July 9, 2022

2021
Backtracking (the) Algorithms on the Hamiltonian Cycle Problem.
CoRR, 2021

2020
Looking for the Hardest Hamiltonian Cycle Problem Instances.
Proceedings of the 12th International Joint Conference on Computational Intelligence, 2020


  Loading...