Reproduce “Subexponential-time Algorithms for Maximum Independent Set in $P_t$-free and Broom-free 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
Gábor Bacsó, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Zsolt Tuza, Erik Jan van Leeuwen
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.