Reproduce “A multi-start local search algorithm for the Hamiltonian completion problem on undirected graphs” on OpenResearch

Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.

Universal app for Apple silicon and Intel. Requires macOS 11 or later.

About this paper

Jorik Jooken, Pieter Leyman, Patrick De Causmaecker

Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.