Reproduce “Odd-Cycle-Packing-treewidth: On the Maximum Independent Set problem in odd-minor-free graph classes” 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
Mujin Choi, Maximilian Gorsky, Gunwoo Kim, Caleb McFarland, Sebastian Wiederrecht
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.