Jesse van Rhijn

Orcid: 0000-0002-3416-7672

According to our database1, Jesse van Rhijn authored at least 11 papers between 2021 and 2025.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Non-periodic Fourier propagation algorithms for partial differential equations.
CoRR, July, 2025

Convergence and Running Time of Time-dependent Ant Colony Algorithms.
CoRR, January, 2025

Performance of efficient variants of the 2-Opt heuristic for the traveling salesperson problem.
Discret. Appl. Math., 2025

Counting Locally Optimal Tours in the TSP.
Proceedings of the 50th International Symposium on Mathematical Foundations of Computer Science, 2025

2024
Worst-Case and Smoothed Analysis of the Hartigan-Wong Method for k-Means Clustering.
Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

Complexity of Local Search for Euclidean Clustering Problems.
Proceedings of the 35th International Symposium on Algorithms and Computation, 2024

2023
Worst-Case and Smoothed Analysis of Hartigan's Method for k-Means Clustering.
CoRR, 2023

Approximation Ineffectiveness of a Tour-Untangling Heuristic.
Proceedings of the Approximation and Online Algorithms - 21st International Workshop, 2023

Improved Smoothed Analysis of 2-Opt for the Euclidean TSP.
Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

2022
Towards a Lower Bound for the Average Case Runtime of Simulated Annealing on TSP.
CoRR, 2022

2021
A hybrid projection algorithm for stochastic differential equations on manifolds.
CoRR, 2021


  Loading...